self-assembly of one-dimensional nanostructures

run are repeatable, and that they are orthogonal to each other, therefore the convex cones of missed directions at each iteration are minimal in size. The convergence results for ORTHOMADS follow directly from those already published for MADS, and they hold deterministically, rather than

length (4 mm); thick places: an increase in the mass, and lasting more than 4 mm; neps: a huge amount of yarn mass (equal or greater than 100%) in a short length (typically from 1 to 4 mm).1–5 As Fig. 1 suggests, there is a direct relationship between the variation of yarn mass and the yarn’s diameter

scale of these transforms has resolution 4 × lower than the real input signal. In this paper, we propose a linear-phase, semi-orthogonal, directional NCWT design using a novel triband filter bank. At the finest scale, the resulting transform has resolution 3 × lower than the real input signal. We

discriminant analysis to estimate an effective metric for computing neighborhoods. We determine the local decision boundaries from centroid information, and then shrink neighborhoods in directions orthogonal to these local decision boundaries, and elongate them parallel to the boundaries. Thereafter, any

Abstract. Secure elements, such as smartcards or trusted platform mod-ules (TPMs), must be protected against implementation-level attacks. Those include side-channel and fault injection attacks. We introduce ODSM, Orthogonal Direct Sum Masking, a new computation paradigm that achieves protection

We consider discrete orthogonal polynomial ensembles which are discrete analogues of the orthogonal polynomial ensembles in random matrix theory. These ensembles occur in certain problems in combinatorial probability and can be thought of as probability measures on partitions. The Meixner ensemble

of discrete orthogonal polynomials of up to degree three. The appropriate directional derivatives are easily computed from this kind of a function. Upon comparing the performance of this zero crossing of second di-rectional derivative operator with the Prewitt gradient operator and the Marr-Hildreth zero

Statics prediction from cross-correlations in orthogonal directions

this paper is to show how the concept of 1--weightings and the technique used by Frank can be used to obtain a similar theory for directed graphs. In the next section we develop the network flow method and show how this method can be used to obtain a sequence of orthogonal pairs in directed graphs