نتایج جستجو برای: ion sieve

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

Journal: :Plant & cell physiology 2005
Akari Fukuda Syu Fujimaki Tomoko Mori Nobuo Suzui Keiki Ishiyama Toshihiko Hayakawa Tomoyuki Yamaya Toru Fujiwara Tadakatsu Yoneyama Hiroaki Hayashi

Sieve tubes are comprised of sieve elements, enucleated cells that are incapable of RNA and protein synthesis. The proteins in sieve elements are supplied from the neighboring companion cells through plasmodesmata. In rice plants, it was unclear whether or not all proteins produced in companion cells had the same distribution pattern in the sieve element-companion cell complex. In this study, t...

2015
Stefanie V. Buxa Francesca Degola Rachele Polizzotto Federica De Marco Alberto Loschi Karl-Heinz Kogel Luigi Sanità di Toppi Aart J. E. van Bel Rita Musetti

Phytoplasmas, biotrophic wall-less prokaryotes, only reside in sieve elements of their host plants. The essentials of the intimate interaction between phytoplasmas and their hosts are poorly understood, which calls for research on potential ultrastructural modifications. We investigated modifications of the sieve-element ultrastructure induced in tomato plants by 'Candidatus Phytoplasma solani,...

Journal: :Pattern Recognition Letters 2008
Clément Fredembach Graham D. Finlayson

The sieve is a morphological scale-space operator that filters an input signal by removing intensity extrema at a specific scale. In images, this processing can be carried out along a path -the 1D sieveor over a connected graph -the 2D sieve. The 2D version of the sieve generally performs better; it is however much more complex to implement. In this paper we present the 1.5D sieve, a Hamiltonia...

Journal: :CoRR 2015
Jonathan P. Sorenson

A prime sieve is an algorithm that finds the primes up to a bound n. We say that a prime sieve is incremental, if it can quickly determine if n+1 is prime after having found all primes up to n. We say a sieve is compact if it uses roughly √ n space or less. In this paper we present two new results: • We describe the rolling sieve, a practical, incremental prime sieve that takes O(n log logn) ti...

2012
Jennifer Smith

In this paper, I explain the Quadratic Sieve, its Multiple Polynomial variation, the Number Field Sieve, and give some worked examples of the afore-mentioned algorithms. Using my own Maple implementation of the Quadratic Sieve, I explore the effect of altering one of the parameters of the Quadratic Sieve algorithm, with respect to both time and success rate.

Journal: :Nanoscale 2015
Jingtao Hou Yuanzhi Li Mingyang Mao Yuanzheng Yue G Neville Greaves Xiujian Zhao

The nanostructured Ce ion substituted cryptomelane-type octahedral molecular sieve (OMS-2) catalyst exhibits strong absorption in the entire solar spectrum region. The Ce ion substituted OMS-2 catalyst can efficiently transform the absorbed solar energy to thermal energy, resulting in a considerable increase of temperature. By combining the efficient photothermal conversion and thermocatalytic ...

Journal: :Journal of experimental botany 2007
Alexandra C U Furch Jens B Hafke Alexander Schulz Aart J E van Bel

According to an established concept, injury of the phloem triggers local sieve plate occlusion including callose-mediated constriction and, possibly, protein plugging of the sieve pores. Sieve plate occlusion can also be achieved by distant stimuli, depends on the passage of electropotential waves (EPWs), and is reversible in intact plants. The time-course of the wound response was studied in s...

Journal: :The Journal of Experimental Medicine 1984
M S Blake E C Gotschlich

Gonococci, grown on agar, frequently give rise to opaque colonies. This opacity phenotype is associated with the presence of one or more outer membrane proteins of approximately 28,000 mol weight. These proteins are included within a class of proteins named proteins II. A method is described to isolate and purify the opacity-associated proteins from Neisseria gonorrhoeae. This method uses high ...

Journal: :IACR Cryptology ePrint Archive 2017
Léo Ducas

Asymptotically, the best known algorithms for solving the Shortest Vector Problem (SVP) in a lattice of dimension n are sieve algorithms, which have heuristic complexity estimates ranging from (4/3) down to (3/2) when Locality Sensitive Hashing techniques are used. Sieve algorithms are however outperformed by pruned enumeration algorithms in practice by several orders of magnitude, despite the ...

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

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