Results 1  10
of
5,734
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
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
SIGNAL RECOVERY BY PROXIMAL FORWARDBACKWARD SPLITTING
 MULTISCALE MODEL. SIMUL. TO APPEAR
"... We show that various inverse problems in signal recovery can be formulated as the generic problem of minimizing the sum of two convex functions with certain regularity properties. This formulation makes it possible to derive existence, uniqueness, characterization, and stability results in a unifi ..."
Abstract

Cited by 509 (24 self)
 Add to MetaCart
We show that various inverse problems in signal recovery can be formulated as the generic problem of minimizing the sum of two convex functions with certain regularity properties. This formulation makes it possible to derive existence, uniqueness, characterization, and stability results in a
Design of capacityapproaching irregular lowdensity paritycheck codes
 IEEE TRANS. INFORM. THEORY
, 2001
"... We design lowdensity paritycheck (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the codes is based on [1]. Assuming that the unde ..."
Abstract

Cited by 588 (6 self)
 Add to MetaCart
that the underlying communication channel is symmetric, we prove that the probability densities at the message nodes of the graph possess a certain symmetry. Using this symmetry property we then show that, under the assumption of no cycles, the message densities always converge as the number of iterations tends
Basic problems in stability and design of switched systems
 IEEE Control Systems Magazine
, 1999
"... By a switched system, we mean a hybrid dynamical system consisting of a family of continuoustime subsystems and a rule that orchestrates the switching between them. This article surveys recent developments in three basic problems regarding stability and design of switched systems. These problems ar ..."
Abstract

Cited by 379 (10 self)
 Add to MetaCart
are: stability for arbitrary switching sequences, stability for certain useful classes of switching sequences, and construction of stabilizing switching sequences. We also provide motivation for studying these problems by discussing how they arise in connection with various questions of interest
Technological pedagogical content knowledge: A framework for integrating technology in teacher knowledge.
 Teachers College Record,
, 2006
"... Abstract This paper describes a framework for teacher knowledge for technology integration called technological pedagogical content knowledge (originally TPCK, now known as TPACK, or technology, pedagogy, and content knowledge). This framework builds on Lee Shulman's construct of pedagogical c ..."
Abstract

Cited by 420 (19 self)
 Add to MetaCart
properties that make applying them in straightforward ways difficult. Most traditional pedagogical technologies are characterized by specificity (a pencil is for writing, while a microscope is for viewing small objects); stability (pencils, pendulums, and chalkboards have not changed a great deal over time
The curvelet transform for image denoising
 IEEE TRANS. IMAGE PROCESS
, 2002
"... We describe approximate digital implementations of two new mathematical transforms, namely, the ridgelet transform [2] and the curvelet transform [6], [5]. Our implementations offer exact reconstruction, stability against perturbations, ease of implementation, and low computational complexity. A cen ..."
Abstract

Cited by 404 (40 self)
 Add to MetaCart
We describe approximate digital implementations of two new mathematical transforms, namely, the ridgelet transform [2] and the curvelet transform [6], [5]. Our implementations offer exact reconstruction, stability against perturbations, ease of implementation, and low computational complexity. A
A Note on Certain Stability and Limiting Properties of νinfinitely divisible distributions
"... Abstract. The class of νinfinitely divisible (ID) distributions, which arise in connection with random summation, is a reach family including geometric infinitely divisible (GID) and geometric stable (GS) laws. We present two simple results connected with triangular arrays with random number of te ..."
Abstract
 Add to MetaCart
of terms and their limiting νID distributions as well as random sums with νID distributed terms. These generalize and unify certain results scattered in the literature that concern the special cases of GID and GS laws.
The price of stability for network design with fair cost allocation
 In Proceedings of the 45th Annual Symposium on Foundations of Computer Science (FOCS
, 2004
"... Abstract. Network design is a fundamental problem for which it is important to understand the effects of strategic behavior. Given a collection of selfinterested agents who want to form a network connecting certain endpoints, the set of stable solutions — the Nash equilibria — may look quite differ ..."
Abstract

Cited by 281 (30 self)
 Add to MetaCart
Abstract. Network design is a fundamental problem for which it is important to understand the effects of strategic behavior. Given a collection of selfinterested agents who want to form a network connecting certain endpoints, the set of stable solutions — the Nash equilibria — may look quite
Maximizing Queueing Network Utility Subject to Stability: Greedy Primaldual algorithm
 Queueing Systems
, 2005
"... We study a model of controlled queueing network, which operates and makes control decisions in discrete time. An underlying random network mode determines the set of available controls in each time slot. Each control decision \produces " a certain vector of \commodities"; it also has assoc ..."
Abstract

Cited by 204 (9 self)
 Add to MetaCart
We study a model of controlled queueing network, which operates and makes control decisions in discrete time. An underlying random network mode determines the set of available controls in each time slot. Each control decision \produces " a certain vector of \commodities"; it also has
What do people think they’re doing? Action identification and human behavior
 Psychological Review
, 1987
"... Issues in the cognitive representation and control of action are broached from the perspective of action identification theory. This theory holds that any action can be identified in many ways, ranging from lowlevel identities that specify how the action is performed to highles'el identities ..."
Abstract

Cited by 251 (10 self)
 Add to MetaCart
in promoting a level of prepotent identification that matches the upper limits of the actor's capacity to perform the action. The implications of this analysis are developed for action stability, the psychology of performance impairment, personal versus situational causation, and the behavioral bases
Results 1  10
of
5,734