نتایج جستجو برای: sequentially rotated array
تعداد نتایج: 158917 فیلتر نتایج به سال:
This paper investigates the impact of sequential selection, a concept recently introduced for Evolution Strategies (ESs). Sequential selection performs the evaluations of the different candidate solutions sequentially and concludes the iteration immediately if one offspring is better than the parent. In this paper, the (1,4)-CMA-ES, where sequential selection is implemented, is compared on the ...
This paper demonstrates that piecewise, rotated explicit curves are flexible enough for 2–D modeling applications such as font design. Their use simplifies many operations such as scan conversion, point classification, and curve intersection.
We proposed a rotated character recognition method using eigen-subspace characterized multiple projection and simple projection. Then the multiple projections showed a higher accuracy at low dimensions than a simple projection for alphanumeric 62 categories. This time, we applied it for the first class of Japanese Industrial Standard (JIS) Kanji set which includes 2,965 categories. As the resul...
We study vectors which undergo maximum or minimum rotation by a matrix on the field of real numbers. The cosine of the angle between a maximally rotated vector and its image under the matrix is called the cosine or antieigenvalue of the matrix and has important applications in numerical methods. Using Lagrange multiplier technique, we obtain systems of nonlinear equations which represent these ...
This paper presents the design and control of a magnetically suspended ceiling actuator which combines four iron-cored linear actuators and a checkerboard permanent magnet array for an infinite planar stroke. When the actuators are rotated with respect to the PM array, it is shown that the thrust and normal force produced by the three-phase linear actuators can be controlled by applying Park's ...
Row-Diagonal Parity (RDP) is a new algorithm for protecting against double disk failures. It stores all data unencoded, and uses only exclusive-or operations to compute parity. RDP is provably optimal in computational complexity, both during construction and reconstruction. Like other algorithms, it is optimal in the amount of redundant information stored and accessed. RDP works within a single...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید