نتایج جستجو برای: lee kessler

تعداد نتایج: 22789  

Journal: :The Journal of Nutrition 2002

Journal: :Des. Codes Cryptography 2004
Paulo S. L. M. Barreto Steven D. Galbraith Colm O'hEigeartaigh Michael Scott

We present a general technique for the efficient computation of pairings on supersingular Abelian varieties. This formulation, which we call the eta pairing, generalises results of Duursma and Lee for computing the Tate pairing on supersingular elliptic curves in characteristic three. We then show how our general technique leads to a new algorithm which is about twice as fast as the Duursma-Lee...

Journal: :CoRR 2013
Jian Gao Qiong Kong

This paper gives the minimum generating sets of three types of one generator (1 + u)-quasi twisted (QT) codes over F 2 + uF 2 , u 2 = 0. Moreover, it discusses the generating sets and the lower bounds on the minimum Lee distance of a special class of A 2 type one generator (1 + u)-QT codes. Some good (optimal or suboptimal) linear codes over F 2 are obtained by these types of one generator (1 +...

Journal: :Wirtschaftsinformatik 1995
Georg Herzwurm Andreas Hierholzer Michel Kunz

Inhaltsverzeichnis 1 Einleitung 2 2 CASE-Tool Marktanalysen in der Literatur 2 3 Untersuchungsmethodik 3 3.1 Ziel der Untersuchung 3 3.2 Bestimmung der Untersuchungsform 3 3.3 Auswahl der Untersuchungseinheiten 4 3.4 Datenerhebung und -erfassung 5 3.4.1 Kriterienkatalog 5 3.4.2 Evaluierungskonzept 5 4 Darstellung, Interpretation und Diskussion der Ergebnisse 5 4.1 Überblick 5 4.2 Tendenzaussage...

2013
Pavlos Paraskevopoulos Zolzaya Dashdorj Themis Palpanas Luciano Serafini

Pavlos Paraskevopoulos University of Trento, Italy, Telecom Italia SKIL [email protected] Thanh-Cong Dinh University of Trento, Italy, Telecom Italia SKIL [email protected] Zolzaya Dashdorj University of Trento, Italy, Telecom Italia SKIL, Fondazione Bruno Kessler [email protected] Themis Palpanas University of Trento, Italy, [email protected] Luciano Serafini Fondazione ...

2006
Masaaki Shirase Tsuyoshi Takagi Eiji Okamoto

Recently Tate pairing and its variations are attracted in cryptography. Their operations consist of a main iteration loop and a final exponentiation. The final exponentiation is necessary for generating a unique value of the bilinear pairing in the extension fields. The speed of the main loop has become fast by the recent improvements, e.g., the Duursma-Lee algorithm and ηT pairing. In this pap...

Journal: :iranian journal of microbiology 0
mohammad mohammadzadeh department of molecular biology, pasteur institute of iran. mana oloomi department of molecular biology, pasteur institute of iran. saeid bouzari department of molecular biology, pasteur institute of iran.

background and objectives: enteropathogenic escherichia coli (epec) divided into two groups typical and atypical (aspect). the main virulence genes are located in a pathogenicity island called lee ( locus of enterocyte effacement ). lee frequently inserted in trna genes of selc , pheu and phev in the bacterial chromosome. tepec and aepec strains have some differences in their pathogenicity. the...

2000
Myung M. Bae Bella Bose

Lee distance Gray codes for k-ary n-cubes and torus networks are presented. Using these Lee distance Gray codes, it is further shown how to directly generate edge disjoint Hamiltonian cycles for a class of k-ary n-cubes, 2-D tori, and hypercubes.

2015
Simone Taioli Maurizio Dapor Nicola M. Pugno

1 European Centre for Theoretical Studies in Nuclear Physics and Related Areas (ECT*), Bruno Kessler Foundation, Trento, Italy, 2 Faculty of Mathematics and Physics, Charles University in Prague, Prague, Czech Republic, 3 Department of Civil, Environmental and Mechanical Engineering, University of Trento, Trento, Italy, 4 School of Engineering and Materials Science, Queen Mary University of Lon...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید