A minimal permutation representation of a finite group G is a faithful G-set with the smallest possible size. We study the structure of such representations and show that for certain groups they may be obtained by a greedy construction. In these situations (except when central involutions intervene) all minimal permutation representations have the same set of orbit sizes. Using the same ideas w...

This paper presents the settings and the results of the ROMIP 2013 MT shared task for the English→Russian language direction. The quality of generated translations was assessed using automatic metrics and human evaluation. We also discuss ways to reduce human evaluation efforts using pairwise sentence comparisons by human judges to simulate sort operations.

A multi-coupon (MC ) represents a collection of k coupons that a user can redeem to a vendor in exchange for a benefit (some good or service). Recently, Chen et al. [CEL07] proposed an unforgeable privacy-protecting multi-coupon scheme (MCS ), which discourages sharing of coupons through a property called unsplittability, where the coupons of a singleMC cannot be separately used by two users. P...

Diametrically different curricula of Information Technology are used by the Faculties at our University. The authors of this paper studied effectiveness of students teaching in some faculties of MCS University. They prepared the program of Information Technology for all students of MCS University wich will be the subject of this paper.

Construction industry involves the highest risk of occupational accidents and bodily injuries, which range from mild to very severe. The aim of this cross-sectional study was to identify the factors associated with accident severity rate (ASR) in the largest Iranian construction companies based on data about 500 occupational accidents recorded from 2009 to 2013. We also gathered data on safety ...

Outline 1. Introduction to relation algebras. Representations. Atom structures. Examples. 2. Using games to build representations. Axiomatising the finite representable relation algebras. 3. 'Rainbow' construction (Hirsch). Monk's theorem that the representable relation algebras are not finitely axiomatisable. 4. Relativised representations. Weakly associative algebras (WA, Maddux). Finite base...

Research in automatic genre classification has been producing increasingly small performance gains in recent years, with the result that some have suggested that such research should be abandoned in favor of more general similarity research. It has been further argued that genre classification is of limited utility as a goal in itself because of the ambiguities and subjectivity inherent to genr...