نتایج جستجو برای: auxiliary matrix

تعداد نتایج: 384736  

2005
Jakub Piskorski

This paper compares two storage models for gazetteers, nameley the standard one based on numbered indexing automata associated with an auxiliary storage device against a pure finite-state model, the latter being superior in terms of space and time complexity.1

2012
Xiaojie Su Peng Shi Ligang Wu Hamid Reza Karimi Rongni Yang

This paper is concerned with analyzing a novel model transformation of discrete-time Takagi-Sugeno (T-S) fuzzy systems with time-varying delays and applying it to dynamic output feedback (DOF) controller design. A new auxiliary model is proposed by employing a new approximation for time-varying delay state, and then delay partitioning method is used to analyze the scaled small gain of this auxi...

1999
J. H. O. Sales T. Frederico B. V. Carlson

A three-dimensional reduction of the two-particle Bethe-Salpeter equation is proposed. The proposed reduction is in the framework of light-front dynamics. It yields auxiliary quantities for the transition matrix and the bound state. The arising effective interaction can be perturbatively expanded according to the number of particles exchanged at a given light-front time. An example suggests tha...

Journal: :IEEE transactions on neural networks 1999
Danchi Jiang Jun Wang

Semidefinite programming problem is an important optimization problem that has been extensively investigated. A real-time solution method for solving such a problem, however, is still not yet available. This paper proposes a novel recurrent neural network for this purpose. First, an auxiliary cost function is introduced to minimize the duality gap between the admissible points of the primal pro...

1998
Heidi Harley Seth Kulick

The derivation of unbounded Subject-to-Subject Raising in languages like English is a problem particularly elegantly treated by Tree Adjoining Grammar. The adjoining operation inserts auxiliary trees headed by raising verbs between the subject in SpecIP and the root verb, distancing the subject from its original local relationshlp with the root verb and producing a final multi-clausal structure...

2013
Martin Gruber Jindrich Matousek

In our recent work, a method on how to enumerate differences between various expressive categories (communicative functions) has been proposed. To improve the overall impact of this approach to both the quality of synthetic expressive speech and expressivity perception by listeners, a few modifications are suggested in this paper. The main ones consist in a different way of expressive data proc...

2002
Stefan Kirchner Johann Kroha J. Kroha

We review the diagrammatic, conserving theory for quantum impurities with strong on-site repulsion. The method is based on auxiliary particle technique, where Wick’s theorem is valid, which opens up the possibility for generalizations to more complicated situations. An analysis in terms of the perturbative renormalization group (RG) shows that on the level of the Conserving T– matrix Approximat...

1996
Ruguang ZHOU R. Zhou

Under the Neumann constraints, each equation of the KdV hierarchy is decomposed into two finite dimensional systems, including the well-known Neumann model. Like in the case of the Bargmann constraint, the explicit Lax representations are deduced from the adjoint representation of the auxiliary spectral problem. It is shown that the Lax operator satisfies the r-matrix relation in the Dirac brac...

2010
Masahiro Nakano Hirokazu Kameoka Jonathan Le Roux Yu Kitano Nobutaka Ono Shigeki Sagayama

This paper presents a new multiplicative algorithm for nonnegative matrix factorization with β-divergence. The derived update rules have a similar form to those of the conventional multiplicative algorithm, only differing through the presence of an exponent term depending on β. The convergence is theoretically proven for any real-valued β based on the auxiliary function method. The convergence ...

2007
Kazuhiro Kobayashi Sunyoung Kim Masakazu Kojima

Second order cone program (SOCP) formulations of convex optimization problems are studied. We show that various SOCP formulations can be obtained depending on how auxiliary variables are introduced. An efficient SOCP formulation that increases the computational efficiency is presented by investigating the relationship between the sparsity of an SOCP formulation and the sparsity of the Schur com...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید