Results 1  10
of
30,734
SpertII: A Vector Microprocessor System
, 1996
"... this article. Primary support for our work came from ONR URI Grant N0001492J1617, ARPA Contract N0001493C0249, NSF Grant MIP9311980, and NSF PYI AwardMIP8958568NSF.Additional support was provided by ICSI. IBM donated the RS/6000. ..."
Abstract

Cited by 60 (8 self)
 Add to MetaCart
this article. Primary support for our work came from ONR URI Grant N0001492J1617, ARPA Contract N0001493C0249, NSF Grant MIP9311980, and NSF PYI AwardMIP8958568NSF.Additional support was provided by ICSI. IBM donated the RS/6000.
A Fast Kohonen Net Implementation for SpertII
"... . We present an implementation of Kohonen SelfOrganizing Feature Maps for the SpertII vector microprocessor system. The implementation supports arbitrary neural map topologies and arbitrary neighborhood functions. For small networks, as used in realworld tasks, a single SpertII board is measured ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. We present an implementation of Kohonen SelfOrganizing Feature Maps for the SpertII vector microprocessor system. The implementation supports arbitrary neural map topologies and arbitrary neighborhood functions. For small networks, as used in realworld tasks, a single SpertII board
A Simple Estimator of Cointegrating Vectors in Higher Order Cointegrated Systems
 ECONOMETRICA
, 1993
"... Efficient estimators of cointegrating vectors are presented for systems involving deterministic components and variables of differing, higher orders of integration. The estimators are computed using GLS or OLS, and Wald Statistics constructed from these estimators have asymptotic x2 distributions. T ..."
Abstract

Cited by 524 (3 self)
 Add to MetaCart
Efficient estimators of cointegrating vectors are presented for systems involving deterministic components and variables of differing, higher orders of integration. The estimators are computed using GLS or OLS, and Wald Statistics constructed from these estimators have asymptotic x2 distributions
MediaBench: A Tool for Evaluating and Synthesizing Multimedia and Communications Systems
"... Over the last decade, significant advances have been made in compilation technology for capitalizing on instructionlevel parallelism (ILP). The vast majority of ILP compilation research has been conducted in the context of generalpurpose computing, and more specifically the SPEC benchmark suite. At ..."
Abstract

Cited by 966 (22 self)
 Add to MetaCart
. At the same time, a number of microprocessor architectures have emerged which have VLIW and SIMD structures that are well matched to the needs of the ILP compilers. Most of these processors are targeted at embedded applications such as multimedia and communications, rather than generalpurpose systems
Virtual time and global states of distributed systems.
 Proc. Workshop on Parallel and Distributed Algorithms,
, 1989
"... Abstract A distributed system can be characterized by the fact that the global state is distributed and that a common time base does not exist. However, the notion of time is an important concept in every day life of our decentralized \ r eal world" and helps to solve problems like getting a c ..."
Abstract

Cited by 744 (5 self)
 Add to MetaCart
consistent population census or determining the potential causality between events. We argue that a linearly ordered structure of time is not (always) adequate for distributed systems and propose a generalized nonstandard m o del of time which consists of vectors of clocks. These clockvectors are p
GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems
 SIAM J. SCI. STAT. COMPUT
, 1986
"... We present an iterative method for solving linear systems, which has the property ofminimizing at every step the norm of the residual vector over a Krylov subspace. The algorithm is derived from the Arnoldi process for constructing an l2orthogonal basis of Krylov subspaces. It can be considered a ..."
Abstract

Cited by 2076 (41 self)
 Add to MetaCart
We present an iterative method for solving linear systems, which has the property ofminimizing at every step the norm of the residual vector over a Krylov subspace. The algorithm is derived from the Arnoldi process for constructing an l2orthogonal basis of Krylov subspaces. It can be considered
In vivo gene delivery and stable transduction of nondividing cells by a lentiviral vector
 Science
, 1996
"... A retroviral vector system based on the human immunodeficiency virus (HIV) was developed that, in contrast to a murine leukemia virusbased counterpart, transduced heterologous sequences into HeLa cells and rat fibroblasts blocked in the cell cycle, as well as into human primary macrophages. Additi ..."
Abstract

Cited by 478 (17 self)
 Add to MetaCart
A retroviral vector system based on the human immunodeficiency virus (HIV) was developed that, in contrast to a murine leukemia virusbased counterpart, transduced heterologous sequences into HeLa cells and rat fibroblasts blocked in the cell cycle, as well as into human primary macrophages
A Framework for Uplink Power Control in Cellular Radio Systems
 IEEE Journal on Selected Areas in Communications
, 1996
"... In cellular wireless communication systems, transmitted power is regulated to provide each user an acceptable connection by limiting the interference caused by other users. Several models have been considered including: (1) fixed base station assignment where the assignment of users to base stations ..."
Abstract

Cited by 651 (18 self)
 Add to MetaCart
power control problem can be reduced to finding a vector p of users' transmitter powers satisfying p I(p) where the jth constraint p j I j (p) describes the interference that user j must overcome to achieve an acceptable connection. This work unifies results found for these systems
For Most Large Underdetermined Systems of Linear Equations the Minimal ℓ1norm Solution is also the Sparsest Solution
 Comm. Pure Appl. Math
, 2004
"... We consider linear equations y = Φα where y is a given vector in R n, Φ is a given n by m matrix with n < m ≤ An, and we wish to solve for α ∈ R m. We suppose that the columns of Φ are normalized to unit ℓ 2 norm 1 and we place uniform measure on such Φ. We prove the existence of ρ = ρ(A) so that ..."
Abstract

Cited by 568 (10 self)
 Add to MetaCart
We consider linear equations y = Φα where y is a given vector in R n, Φ is a given n by m matrix with n < m ≤ An, and we wish to solve for α ∈ R m. We suppose that the columns of Φ are normalized to unit ℓ 2 norm 1 and we place uniform measure on such Φ. We prove the existence of ρ = ρ(A) so
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
 IEEE Transactions on Automatic Control
, 1992
"... AbstructThe stability of a queueing network with interdependent servers is considered. The dependency of servers is described by the definition of their subsets that can be activated simultaneously. Multihop packet radio networks (PRN’s) provide a motivation for the consideration of this system. We ..."
Abstract

Cited by 949 (19 self)
 Add to MetaCart
. We study the problem of scheduling the server activation under the constraints imposed by the dependency among them. The performance criterion of a scheduling policy m is its throughput that is characterized by its stability region C,, that is, the set of vectors of arrival rates for which the system
Results 1  10
of
30,734