نتایج جستجو برای: linear arrangement
تعداد نتایج: 515835 فیلتر نتایج به سال:
Cell junction of the myelinated nerve mesaxon in the sciatic nerve and spinal posterior funiculus of rabbits and rats was examined by the freeze-fracture method. In replicas of fractured specimens, the cell junctions were the tight junction which was composed of parallel arrays of membrane particles. The rows of particles were straight or gently undulating along the long axis of the fibers. Occ...
This contribution investigates Direction of Arrival (DoA) estimation using linearly arranged microphone arrays. We are going to develop a model for the DoA estimation error in a reverberant scenario and show the existence of a bias, that is a consequence of the linear arrangement and limited field of view (FoV) that is associated with it. Two reasons are identified to cause the bias: First, the...
We present a fast multiscale approach for the network minimum logarithmic arrangement problem. This type of arrangement plays an important role in a network compression and fast node/link access operations. The algorithm is of linear complexity and exhibits good scalability which makes it practical and attractive for using on large-scale instances. Its effectiveness is demonstrated on a large s...
We describe an arrangement for simultaneous recording of speech and geometry of vocal tract in patients undergoing surgery involving this area. Experimental design is considered from an articulatory phonetic point of view. The speech and noise signals are recorded with an acousticelectrical arrangement. The vocal tract is simultaneously imaged with MRI. A MATLAB-based system controls the timing...
The Cutwidth Minimization Problem, also known as the Minimum Cut Linear Arrangement consists of finding an arrangement of the vertices of a graph on a line, in such a way that the maximum number of edges between each pair of consecutive vertices is minimized. This problem has practical applications in VLSI Design, Network Migration and Graph Drawing, among others. In this paper we propose sever...
Fukuda, K., S. Saito, A. Tamura and T. Tokuyama, Bounding the number of k-faces in arrangements of hyperplanes, Discrete Applied Mathematics 31 (1991) 151-165. We study certain structural problems of arrangements of hyperplanes in d-dimensional Euclidean space. Of special interest are nontrivial relations satisfied by the f-vector f = Lfo, fi, . , fd) of an arrangement, where fk denotes the num...
Let A be an n × d matrix having full rank n. An orthogonal dual A of A is a (d − n) × d matrix of rank (d − n) such that every row of A is orthogonal (under the usual dot product) to every row of A. We define the orthogonal dual for arrangements by identifying an essential (central) arrangement of d hyperplanes in n-dimensional space with the n × d matrix of coefficients of the homogeneous line...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید