نتایج جستجو برای: way

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

Journal: :متن پژوهی ادبی 0
کاووس حسن لی هیئت علمی دانشگاه شیراز

poetic inspiration is one of the major topics dealt with in literary criticism. the objective of this paper is to show the similarities between human birth and composition of poetry , which as qabbani requires a lot of care to be taken so as to protect the child the against

Journal: :hepatitis monthly 0
seyed moayed alavian baqiyatallah university of medical sciences, tehran hepatitis center, ir-iran +98 21 81264070, [email protected]; baqiyatallah university of medical sciences, tehran hepatitis center, ir-iran +98 21 81264070, [email protected]

2008
Michael Varnava Daniel E. Browne Terry Rudolph

We give a scheme for loss tolerantly building a linear optical quantum memory which itself is tolerant to qubit loss. We use the encoding recently introduced in [1] and give a method for efficiently achieving this. The entire approach resides within the “one-way” model for quantum computing [2]. Our results suggest that it is possible to build a loss tolerant quantum memory, such that if the re...

2000
Kazuo Hosokawa Ryutaro Maeda

In this paper, a three-way microvalve system composed of three independent one-way valve units is presented. Each valve unit has a membrane, which is actuated by external negative air pressure. Intervals between the valve units are smaller than 780 μm, which opens up the possibility of realizing a high-density microvalve array. The small intervals were realized by providing the system with a la...

2008
Christos A. Kapoutsis Richard Královic Tobias Mömke

We examine the succinctness of one-way, rotating, sweeping, and two-way deterministic finite automata (1dfas, rdfas, sdfas, 2dfas). Here, a sdfa is a 2dfa whose head can change direction only on the endmarkers and a rdfa is a sdfa whose head is reset on the left end of the input every time the right endmarker is read. We introduce a list of language operators and study the corresponding closure...

1999
Jeong Han Kim Daniel R. Simon Prasad Tetali

Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build a UOWHF which compresses by εn bits, at the cost of εn invocations of the one-way permutation. We show that this construction is not far from optimal, in the following sense: there exists an oracle relative to which t...

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

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