نتایج جستجو برای: 64 μgml

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

Journal: :J. Computational Applied Mathematics 2017
Sebastiano Vigna

xorshift* generators are a variant of Marsaglia’s xorshift generators that eliminate linear artifacts typical of generators based on Z/2Z-linear operations using multiplication by a suitable constant. Shortly after high-dimensional xorshift* generators were introduced, Saito and Matsumoto suggested a different way to eliminate linear artifacts based on addition in Z/232Z, leading to the XSadd g...

2015
Vinzenz Petr Matthias Rothmund Stefan Würzle

Die Anwendung Remote Task Control entstand in Zusammenarbeit der Firmen HORSCH und geo-konzept im Forschungsprojekt Geo Farm und ermöglicht eine durchgängig automatisierte Prozesskette von der Bereitstellung und Archivierung georeferenzierter Applikationskarten und Datenübertragung zur Landmaschine bis zur Ausführung und Dokumentation des variablen Applikationsprozesses im Feld. Das Projekt Geo...

Journal: :Nonlinearity in biology, toxicology, medicine 2004
Dorothy E. Leidner

The publication of the first article in this issue, “Realizing Strategic Value through Center-Edge Digital Transformation in Consumer-Centric Industries,” provides a unique opportunity to pay tribute to the first author, Paul Gray, who passed away last year. Please join me in thanking Omar El Sawy, Guillermo Asper, and Magnus Thordarson for continuing to revise this article co-authored with Pau...

Journal: :CoRR 2013
Sebastiano Vigna

We continue the line of research started in [Vig08] proposing broadword (a.k.a. SWAR—“SIMD Within A Register”) algorithms for finding matching closed parentheses and the k-th far closed parenthesis. Our algorithms work in time O(logw) on a word of w bits, and contain no branch and no test instruction. On 64-bit (and wider) architectures, these algorithms make it possible to avoid costly tabulat...

1999
Tetsutaro Kobayashi Hikaru Morita Kunio Kobayashi Fumitaka Hoshino

A new elliptic curve scalar multiplication algorithm is proposed. The algorithm o ers about twice the troughput of some conventional OEF-base algorithms because it combines the Frobenius map with the table reference method based on baseexpansion. Furthermore, since this algorithm suits conventional computational units such as 16, 32 and 64 bits, its base eld F p m is expected to enhance ellipti...

2005
Lamia Djoudi Denis Barthou Patrick Carribault Christophe Lemuet Jean-Thomas Acquaviva William Jalby

Code Representation IA64 Assembly Parser Front End IA64 Assembly Parser Back End .s instrumented code .s

2012
Ulrich Rührmair Marten van Dijk

In recent years, PUF-based schemes have not only been suggested for the basic tasks of tamper sensitive key storage or the identification of hardware systems, but also for more complex protocols like oblivious transfer (OT) or bit commitment (BC), both of which possess broad and diverse applications. In this paper, we continue this line of research. We first present an attack on two recent OTan...

Journal: :Analytica chimica acta 2011
Jen Tsai Liu Ching Jung Chen Toshiyuki Ikoma Tomohiko Yoshioka Jeffrey S Cross Shwu-Jen Chang Jang-Zern Tsai Junzo Tanaka

Designing a surface recognition layer with high anti-fouling ability, high affinity, and high specificity is an important issue to produce high sensitivity biosensing transducers. In this study, a self-assembled monolayer (SAM) consisting of a homogeneous mixture of oligo(ethylene glycol) (OEG)-terminated alkanethiolate and mercaptohexadecanoic acid (MHDA) on Au was employed for immobilizing tr...

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

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