Results 1  10
of
792
Synchronization and linearity: an algebra for discrete event systems
, 2001
"... The first edition of this book was published in 1992 by Wiley (ISBN 0 471 93609 X). Since this book is now out of print, and to answer the request of several colleagues, the authors have decided to make it available freely on the Web, while retaining the copyright, for the benefit of the scientific ..."
Abstract

Cited by 369 (11 self)
 Add to MetaCart
The first edition of this book was published in 1992 by Wiley (ISBN 0 471 93609 X). Since this book is now out of print, and to answer the request of several colleagues, the authors have decided to make it available freely on the Web, while retaining the copyright, for the benefit of the scientific community. Copyright Statement This electronic document is in PDF format. One needs Acrobat Reader (available freely for most platforms from the Adobe web site) to benefit from the full interactive machinery: using the package hyperref by Sebastian Rahtz, the table of contents and all LATEX crossreferences are automatically converted into clickable hyperlinks, bookmarks are generated automatically, etc.. So, do not hesitate to click on references to equation or section numbers, on items of thetableofcontents and of the index, etc.. One may freely use and print this document for one’s own purpose or even distribute it freely, but not commercially, provided it is distributed in its entirety and without modifications, including this preface and copyright statement. Any use of thecontents should be acknowledged according to the standard scientific practice. The
MultiAdjoint Logic Programming
 In Proc. of the 10th Int. Conf. on Information Processing and Managment of Uncertainty in KnowledgeBased Systems, (IPMU04
, 2004
"... A synthesis of results of the recently introduced paradigm of multiadjoint logic programming is presented. These results range from a proof theory together with some (quasi)completeness results to general termination results, and from the neurallike implementation of its fixpoint semantics ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
A synthesis of results of the recently introduced paradigm of multiadjoint logic programming is presented. These results range from a proof theory together with some (quasi)completeness results to general termination results, and from the neurallike implementation of its fix
Numerical Recipes in C: The Art of Scientific Computing. Second Edition
, 1992
"... This reprinting is corrected to software version 2.10 ..."
Abstract

Cited by 177 (0 self)
 Add to MetaCart
This reprinting is corrected to software version 2.10
Sorted MultiAdjoint Logic Programs: Termination Results and Applications
"... A general framework of logic programming allowing for the combination of several adjoint lattices of truthvalues is presented. The main contribution is a new sufficient condition which guarantees termination of all queries for the fixpoint semantics for an interesting class of programs. Several ..."
Abstract

Cited by 26 (9 self)
 Add to MetaCart
A general framework of logic programming allowing for the combination of several adjoint lattices of truthvalues is presented. The main contribution is a new sufficient condition which guarantees termination of all queries for the fixpoint semantics for an interesting class of programs. Several
The Effect of Multiple Time Scales and Subexponentiality on the Behavior of a Broadband Network Multiplexer
, 1996
"... The Effect of Multiple Time Scales and Subexponentiality on the Behavior of a Broadband Network Multiplexer Predrag R. Jelenkovi'c The main theme of this dissertation is the evaluation of the capacity of broadband multimedia network multiplexers. This problem calls for the modeling of network ..."
Abstract

Cited by 67 (17 self)
 Add to MetaCart
The Effect of Multiple Time Scales and Subexponentiality on the Behavior of a Broadband Network Multiplexer Predrag R. Jelenkovi'c The main theme of this dissertation is the evaluation of the capacity of broadband multimedia network multiplexers. This problem calls for the modeling of network traffic streams and the analysis of a network multiplexer that is loaded with the corresponding models. For modeling we focus on MPEG video traffic streams that are expected to be predominant in the traffic mixture of future multimedia networks. We experimentally demonstrate that realtime MPEG video traffic exhibits multiple time scale characteristics, as well as subexponential first and second order statistics. Then we construct a model of MPEG video that captures both of these characteristics and accurately predicts queueing behavior for a broad range of buffer and capacity sizes. Depending on whether a network multiplexer (loaded with MPEG) is strictly or weakly stable the dominant effect o...
Algebras of Virasoro type, Riemann surfaces and structures of the theory of solitons, Funkts
 Anal. Appl
, 1987
"... The role of the algebra of complexvalued vector fields on the circle L(S1) (Witt algebra) and its central extension Lc in the theory of a free boson quantum string, especially in dimension d = 26, is well known. These algebras contain Zgraded subalgebras L ⊂ L(S1) and Lc ⊂ Lc, where Lc is a centra ..."
Abstract

Cited by 55 (1 self)
 Add to MetaCart
The role of the algebra of complexvalued vector fields on the circle L(S1) (Witt algebra) and its central extension Lc in the theory of a free boson quantum string, especially in dimension d = 26, is well known. These algebras contain Zgraded subalgebras L ⊂ L(S1) and Lc ⊂ Lc, where Lc is a central extension of L and
Inverse modeling of carbon monoxide surface emissions using CMDL network observations
"... A 3D inverse modeling scheme is used to constrain the direct surface emissions of carbon monoxide CO. A priori estimates of CO emissions are taken from various inventories and are included in the IMAGES model to compute the distribution of CO. The modeled CO mixing ratios are compared with observati ..."
Abstract

Cited by 52 (7 self)
 Add to MetaCart
A 3D inverse modeling scheme is used to constrain the direct surface emissions of carbon monoxide CO. A priori estimates of CO emissions are taken from various inventories and are included in the IMAGES model to compute the distribution of CO. The modeled CO mixing ratios are compared with observations at 39 CMDL stations, averaged over the years 19901996. The interannual variability of CO sources is therefore ignored. We show that the method used (timedependent synthesis inversion) is able to adjust the surface fluxes on a monthly basis in order to improve the agreement between the observed and the modeled CO mixing ratios at the stations. The Earth surface is divided into regions. The spatial distribution of CO sources is fixed inside each of these regions. The inversion scheme optimizes the intensities of the emissions fluxes for the following processes: technological activities, forest and savanna burning, agricultural waste burning and fuelwood use, soil/vegetation emissions, and oceanic emissions. The inversion significantly reduces the uncertainties on the surface sources over Europe, North America and Asia. The most striking result is the increase (almost by a factor of two) of CO flux from Asia in all a posteriori scenarios. The uncertainties on the Southern Hemisphere emissions remain large after the inversion, because the current observational surface network is too sparse at these latitudes. The inversion, moreover, shifts by one month the peak in biomass burning emissions in the Southern Hemisphere. This temporal shift ensures a better match of the observed and modeled CO seasonal cycle at the Ascension Island station. We also attempted to optimize the annual and global productions of CO due to methane and NMHC. With the current set of data, the scheme w...
Randomized Matrix Computations
, 2012
"... We propose new effective randomized algorithms for some fundamental matrix computations such as preconditioning of an ill conditioned matrix that has a small numerical nullity or rank, its 2by2 block triangulation, numerical stabilization of Gaussian elimination with no pivoting, and approximation ..."
Abstract

Cited by 52 (6 self)
 Add to MetaCart
We propose new effective randomized algorithms for some fundamental matrix computations such as preconditioning of an ill conditioned matrix that has a small numerical nullity or rank, its 2by2 block triangulation, numerical stabilization of Gaussian elimination with no pivoting, and approximation of a matrix by lowrank matrices and by structured matrices. Our technical advances include estimating the condition number of a random Toeplitz matrix, novel techniques of randomized preprocessing, a proof of their preconditioning power, and a dual version of the Sherman–Morrison–Woodbury formula. According to both our formal study and numerical tests we significantly accelerate the known algorithms and improve their output accuracy.
Results 1  10
of
792