Results 1  10
of
257
On the Computation of Observers in DiscreteEvent Systems
 Information Sciences
, 2000
"... The concept of observer was introduced in previous work by the authors on a hierarchical control theory of discreteevent systems (DES). It was shown that the observer property ensures that in a twolevel hierarchy the lowlevel implementation of a nonblocking highlevel supervisor is also nonblocki ..."
Abstract

Cited by 167 (20 self)
 Add to MetaCart
The concept of observer was introduced in previous work by the authors on a hierarchical control theory of discreteevent systems (DES). It was shown that the observer property ensures that in a twolevel hierarchy the lowlevel implementation of a nonblocking highlevel supervisor is also
ScaleSpace for Discrete Signals
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1990
"... We address the formulation of a scalespace theory for discrete signals. In one dimension it is possible to characterize the smoothing transformations completely and an exhaustive treatment is given, answering the following two main questions: 1. Which linear transformations remove structure in the ..."
Abstract

Cited by 134 (25 self)
 Add to MetaCart
contains more structure than a signal at a finer level of scale? We propose that there is only one reasonable way to define a scalespace for 1D discrete signals comprising a continuous scale parameter, namely by (discrete) convolution with the family of kernels T (n; t) = e I n (t), where I n
A TWOTIMESCALE DISCRETIZATION SCHEME FOR COLLOCATION
"... The development of a twotimescale discretization scheme for collocation is presented. This scheme allows a larger discretization to be utilized for smoothly varying state variables and a second finer discretization to be utilized for state variables having higher frequency dynamics. As such, the di ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The development of a twotimescale discretization scheme for collocation is presented. This scheme allows a larger discretization to be utilized for smoothly varying state variables and a second finer discretization to be utilized for state variables having higher frequency dynamics. As such
Pachinko allocation: DAGstructured mixture models of topic correlations
 In Proceedings of the 23rd International Conference on Machine Learning
, 2006
"... Latent Dirichlet allocation (LDA) and other related topic models are increasingly popular tools for summarization and manifold discovery in discrete data. However, LDA does not capture correlations between topics. In this paper, we introduce the pachinko allocation model (PAM), which captures arbitr ..."
Abstract

Cited by 181 (8 self)
 Add to MetaCart
Latent Dirichlet allocation (LDA) and other related topic models are increasingly popular tools for summarization and manifold discovery in discrete data. However, LDA does not capture correlations between topics. In this paper, we introduce the pachinko allocation model (PAM), which captures
An SQP Algorithm For Finely Discretized Continuous Minimax Problems And Other Minimax Problems With Many Objective Functions
, 1996
"... . A common strategy for achieving global convergence in the solution of semiinfinite programming (SIP) problems, and in particular of continuous minimax problems, is to (approximately) solve a sequence of discretized problems, with a progressively finer discretization meshes. Finely discretized min ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
. A common strategy for achieving global convergence in the solution of semiinfinite programming (SIP) problems, and in particular of continuous minimax problems, is to (approximately) solve a sequence of discretized problems, with a progressively finer discretization meshes. Finely discretized
A computational algebra approach to the reverse engineering of gene regulatory networks
 Journal of Theoretical Biology
, 2004
"... This paper proposes a new method to reverse engineer gene regulatory networks from experimental data. The modeling framework used is timediscrete deterministic dynamical systems, with a finite set of states for each of the variables. The simplest examples of such models are Boolean networks, in whi ..."
Abstract

Cited by 64 (10 self)
 Add to MetaCart
, in which variables have only two possible states. The use of a larger number of possible states allows a finer discretization of experimental data and more than one possible mode of action for the variables, depending on threshold values. Furthermore, with a suitable choice of state set, one can employ
A Modified Chi2 Algorithm for Discretization
, 2002
"... Since the ChiMerge algorithm was first proposed by Kerber in 1992, it has become a widely used and discussed discretization method. The Chi2 algorithm is a modification to the ChiMerge method. It automates the discretization process by introducing an inconsistency rate as the stopping criterion and ..."
Abstract

Cited by 28 (1 self)
 Add to MetaCart
Since the ChiMerge algorithm was first proposed by Kerber in 1992, it has become a widely used and discussed discretization method. The Chi2 algorithm is a modification to the ChiMerge method. It automates the discretization process by introducing an inconsistency rate as the stopping criterion
ANALYSIS OF CLOGGING IN EVACUATION USING A MULTIGRID MODEL
"... Some collective behavior during escape panic such as the ‘fasterisslower effect ’ and the irregular outflow are associated with clogging. The reasons for clogging appearance are investigated with a multigrid model which is presented in previous work. The model implements finer discretization whic ..."
Abstract
 Add to MetaCart
Some collective behavior during escape panic such as the ‘fasterisslower effect ’ and the irregular outflow are associated with clogging. The reasons for clogging appearance are investigated with a multigrid model which is presented in previous work. The model implements finer discretization
Simple Regularity Criteria For Subdivision Schemes. II. The Rational Case
 SIAM J. Math. Anal
, 1997
"... We study regularity properties of special functions obtained as limits of "p/qadic subdivision schemes." Such "rational" schemes generalize  in a flexible way  binary (or dyadic) subdivision schemes, used in computeraided geometric design and in functional analysis to const ..."
Abstract

Cited by 99 (0 self)
 Add to MetaCart
to construct compactly supported wavelets. This finds natural applications in the signal processing area, where it may be desirable to decompose a signal into compactly supported wavelets over fractions of an octave. This results in a finer decomposition than in the dyadic case, which corresponds to an octave
Sparse recovery over continuous dictionariesjust discretize.
 In Asilomar Conference on Signals, Systems and Computers,
, 2013
"... AbstractIn many applications of sparse recovery, the signal has a sparse representation only with respect to a continuously parameterized dictionary. Although atomic norm minimization provides a general framework to handle sparse recovery over continuous dictionaries, the computational aspects lar ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
largely remain unclear. By establishing various convergence results as the discretization gets finer, we promote discretization as a universal and effective way to approximately solve the atomic norm minimization problem, especially when the dimension of the parameter space is low.
Results 1  10
of
257