Mostafa Hosseini ([email protected]) Parisa Adimi Naghan ([email protected]) Ali Moghadas Jafari ([email protected]) Mahmoud Yousefifard ([email protected]) Shervin Taslimi ([email protected]) Kian Khodadad ([email protected]) Forouzan Mohammadi ([email protected]) Makan Sadr ([email protected]) Mansour Rezaei ([email protected]) Mohammad Reza Masjedi (mr...

Generalizing a classical problem in enumerative combinatorics, Mansour and Sun counted the number of subsets of Zn without certain separations. Chen, Wang, and Zhang then studied the problem of partitioning Zn into arithmetical progressions of a given type under some technical conditions. In this paper, we improve on their main theorems by applying a convolution formula for cyclic multinomial c...

TITLE: Reprogramming Intestinal Immunity by Novel L. Acidophilus Strains Results in Protective Immunity against Colon Cancer PRINCIPAL INVESTIGATOR: Mansour Mohamadzadeh CONTRACTING ORGANIZATION: University of Florida Gainesville, Florida 32608 REPORT DATE: November 2015 TYPE OF REPORT: Final PREPARED FOR: U.S. Army Medical Research and Materiel Command Fort Detrick, Maryland 21702-5012 DISTRIB...

Two extensions of the Linial, Mansour, Nisan AC0 learning algorithm are presented. The LMN method works when input examples are drawn uniformly. The new algorithms improve on theirs by performing well when given inputs drawn from unknown, mutually independent distributions. A variant of the one of the algorithms is conjectured to work in an even broader setting.

The iterated Even-Mansour cipher is a construction of a block cipher from r public permutations P1, . . . , Pr which abstracts in a generic way the structure of key-alternating ciphers. The indistinguishability of this construction from a truly random permutation by an adversary with oracle access to the inner permutations P1, . . . , Pr has been investigated in a series of recent papers. This ...

We prove that every sufficiently long simple permutation contains two long almost disjoint simple subsequences, and then we show how this result has enumerative consequences. For example, it implies that, for any r, the number of permutations with at most r copies of 132 has an algebraic generating function (this was previously proved, constructively, by Bóna and (independently) Mansour and Vai...

We are interested in the problem of plan­ ning for factored POMOPs. Building on the recent results of Kearns, Mansour and Ng, we provide a planning algorithm for fac­ tored POMOPs that exploits the accuracy­ efficiency tradeoff in the belief state sim plifi­ cation introduced by Boyen and Koller.

Este artigo presenta uma análise de erros nas interlínguas aprendizes FLE nível B1.2 (QECR) curso on-line em 2020. Através da identificação, classificação e descrição (CORDER, 1973; DURÃO, 2004, 2007; JAMES, 2013, GIMENEZ, 2017) três produções textuais assíncronas cinco participantes coleta dados por meio questionário, os critérios linguístico 1981) etiológico (SELINKER, 1972; RICHARDS, 1973) p...

Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after applying P : C = k2 ⊕P (M ⊕ k1). They did not, however, describe how one could instantiate such a permutation securely. It is a fundamental open problem whether their construction could be proved secure outside the random permutatio...