Macro-sieve electrodes were implanted in the sciatic nerve of five adult male Lewis rats following spinal cord injury to assess the ability of the macro-sieve electrode to interface regenerated peripheral nerve fibers post-spinal cord injury. Each spinal cord injury was performed via right lateral hemisection of the cord at the T9-10 site. Five months post-implantation, the ability of the macro...

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...

We report the factorization of a 135-digit integer by the triple-large-prime variation of the multiple polynomial quadratic sieve. Previous workers [6][10] had suggested that using more than two large primes would be counterproductive, because of the greatly increased number of false reports from the sievers. We provide evidence that, for this number and our implementation, using three large pr...

The physical, hydrological, and physico-chemical properties of horticultural substrates are influenced by particle shape size. Sieve analysis has been the predominate method used to characterize size distribution substrates. However, literature shows a diversity techniques procedures. effects agitation time sample on distributions soilless were evaluated for several measures sieve analysis, inc...

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...

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...

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.

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...

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 ...