Given a set T of n points in IR, a Manhattan Network G is a network with all its edges horizontal or vertical segments, such that for all p, q ∈ T , in G there exists a path (named a Manhattan path) of the length exactly the Manhattan distance between p and q. The Minimum Manhattan Network (MMN) problem is to find a Manhattan network of the minimum length, i.e., the total length of the segments...

Three interior point methods are proposed for sufficient horizontal linear complementarity problems (HLCP): a large update path following algorithm, a first order corrector-predictor method, and a second order corrector-predictor method. All algorithms produce sequences of iterates in the wide neighborhood of the central path introduced by Ai and Zhang. The algorithms do not depend on the handi...

Chaotic systems share with stochastic processes several properties that make them almost undistinguishable. In this communication we introduce a representation space, to be called the complexity-entropy causality plane. Its horizontal and vertical axis are suitable functionals of the pertinent probability distribution, namely, the entropy of the system and an appropriate statistical complexity ...

Three interior point methods are proposed for sufficient horizontal linear complementarity problems (HLCP): a large update path following algorithm, a first order corrector-predictor method, and a second order corrector-predictor method. All algorithms produce sequences of iterates in the wide neighborhood of the central path introduced by Ai and Zhang. The algorithms do not depend on the handi...

A new decoder architecture for nonbinary low-density parity check (LDPC) codes is presented in this paper to reduce the hardware operational complexity and power consumption. Adaptive message control (AMC) is to achieve the low decoding complexity, that dynamically trims the message length of belief information to reduce the amount of memory accesses and arithmetic operations. A new horizontal ...

In conventional supervised learning, one searches for "vertical" patterns, connecting inputs directly to outputs. One can instead search for "horizontal" patterns, which go across the learning set, connecting one part of it with another. One way to do this is to pre-process the learning problem before feeding it to a conventional generalizer (like backpropagation). This pre-processing technique...

abstract the present study was an attempt to investigate the relationship between efl learners’ anxiety and writing complexity. for the purpose of the study, 70 female learners, between 17 and 24 years old (mean=20) from najm language school in tehran participated in the study. the participants’ level of anxiety was measured using horwitz, horwitz, and cope’s anxiety questionnaire (1986) and th...

Horizontal Inequality (HI) is defined as inequality among culturally defined (or constructed) groups, in contrast to Vertical Inequality (VI) which is inequality among households or individuals. HIs are multidimensional, including a political and social dimension, as well as economic, and a range of elements in each of these dimensions. There is evidence that in many, but not all, cases HIs per...

Rotational drilling was a revolution in drilling technology. It made the drilling process more efficient and faster and more depth of well could be achieved through rotation method. Besides all of its advantages, the rotation approach induced some problems like pipe sticking and downhole cleaning to the drilling procedure. Hole cleaning and reduction of torque and drag seems to be vital in incl...