Pivoting gait is efficient for manipulating a big and heavy object with relatively small force, in which robot iteratively tilts the object, rotates it around vertex, then puts down to floor. However, pivoting can easily fail even external disturbance due its instability nature. To cope this problem, we propose controller robustly control motion during by introducing two modes, i.e., one double...

Based on the fact that Faddeev’s algorithm can be easily mapped into the Systolic array for implementing. An FPGA implementation of Kalman Filter using Modified Faddeev [1] is proposed The Modified Faddeev uses Neighbor pivoting for triangularization substituting the Gaussian elimination.Gaussion elimination may cause the overflow of the datas, and Neighbor pivoting can guarantee the stability ...

We show the singular values of the uniied transformations 6], propose pivoting strategies for downdating, and present a stability analysis.

the primary cilium which is an organelle in nearly every cell in the vertebrate body extends out of the cell surface like an antenna and is known as cell sensor of mechanical and chemical stimuli. in previous numerical simulations, researchers modeled this organelle as a cantilevered beam attached to the cell surface. in the present study, however, we present a novel model that accommodates for...

In the literature there are several proposals to map entity-relationship schemas onto object-oriented schemas, but they only treat relationship sets na vely or restrict them to binary relationship sets. We follow a diierent approach in the treatment of relationship sets. Our goal is to let the designer specify relationships of any arity and then to employ semantic constraints to decompose relat...

We present a pointwise mutual information (PMI) based approach for formalizing paraphrasability and propose a variant of PMI, called mutual information based paraphrase acquisition (MIPA), for paraphrase acquisition. Our paraphrase acquisition method first acquires lexical paraphrase pairs by bilingual pivoting and then reranks them by PMI and distributional similarity. The complementary nature...

System architecture, experimental settings and experimental results of the EHR group for the WAT2016 tasks are described. We participate in six tasks: en-ja, zh-ja, JPCzh-ja, JPCko-ja, HINDENen-hi and HINDENhi-ja. Although the basic architecture of our systems is PBSMT with reordering, several techniques are conducted. Especially, the system for the HINDENhi-ja task with pivoting by English use...

The first algorithm to use a complementary pivoting procedure was that devised by Lemke and Howson to find a Nash equilibrium point of a bimatrix game [ 15 ]. This algorithm introduced a novel proof of convergence not relying on standard monotonicity arguments. Lemke [ 12] generalized his complementary pivot algorithm to solve certain classes of linear complementarity problem (LCP), which Dantz...