Search results for " programmi"
showing 10 items of 1629 documents
Simulation and Parameter-Identification of the Closed-Loop Cardiovascular System by the Use of a Nonlinear Mathematical Model
1981
Abstract A non-linear model of human cardio-vascular system, which includes the short-term pressure regulation mechanism was mathematically derived and implemented on a PDP-11/45 in a block-oriented, interactive programming language. In this way the behaviour of the arterial and venous pressures, cardiac output, stroke volume, total peripheral resistance and heart-rate under ergometric workload was studied by simulation, and experimentally proved, that the model matches the system with good accuracy. In a second phase the parameters of the model were identified by the use of the output-error method. For this purpose a non-linear system identification programming package was applied. The par…
Advanced Spectroscopic Detectors for Identification and Quantification
2013
The coupling of vibration spectroscopic detectors to liquid chromatography (LC) is an interesting analytical tool that allows combining high resolution from LC with molecular specific information accessible by infrared (IR) and Raman spectrometry. This chapter describes the basics of IR and Raman spectroscopy with a special emphasis on the advantages and pitfalls of these detection techniques in LC. Two fundamentally different coupling approaches, namely, off-line hyphenation involving the physical elimination of the mobile phase and on-line hyphenation through the use of flow cells, are discussed in detail, describing the most important interfaces and diverse practical applications. Strate…
Structurally Uniform Oligomers
1985
Model compounds as well as prototype reactions are frequently used to understand more complex chemical systems. In the case of phenolic resins a large number of model compounds have been synthesized. They are regarded as either components of a complex mixture of novolaks or resoles or as representative segments of the phenolic crosslinked network. These model compounds were formerly the basis for the correlation of physical properties to molecular structure. Presently the progress of analytical separations and identification methods is formidable; highly sophisticated chemical instrumentation allows the analysis of highly complex mixtures. Nevertheless, well defined compounds with definite …
Experimental realization of a Persistent Identifier Infrastructure stack for Named Data Networking
2015
The continuation of Persistent Identifier Infrastructures is crucial when next-generation Internet architectures based on Information-Centric Networking (ICN) arise. When moving to ICN, we must ensure the resolution of Persistent Identifiers (PID), such as the billions of Digital Object Identifiers (DOI) used today, to provide continued access to scientific literature and research data. It provides the base for the necessary transformations in the Handle System architecture and protocol for running a PID system on the Named Data Networking (NDN) architecture, which is a recent incarnation of ICN. Furthermore, it examines the PID-specific resolution access patterns, investigates the expected…
An immune system model in discrete time based on the analogy with the central nervous system
1988
Jerne's model for the immune system formulated in terms of a neural network recently proposed by Weisbuch and Atlan is generalized to interactions with continuous coupling coefficients. It is shown that even the extended model can be solved analytically without the aid of computer simulations and exhibits one additional attractor, which corresponds to a configuration with high concentrations of active killer cells eventually causing death of the organism.
Dissensus, death and division
2009
The modeling of switching systems describing networks where death and duplication processes occur is described. A dissensus protocol, complementary to consensus protocol, is introduced and the convergence or divergence of the agents' state evolution is studied. We discuss some properties of the topology reached by the network when different rules of duplication and inheritance are implemented.
Pricing and hedging GDP-linked bonds in incomplete markets
2018
Abstract We model the super-replication of payoffs linked to a country’s GDP as a stochastic linear program on a discrete time and state-space scenario tree to price GDP-linked bonds. As a byproduct of the model we obtain a hedging portfolio. Using linear programming duality we compute also the risk premium. The model applies to coupon-indexed and principal-indexed bonds, and allows the analysis of bonds with different design parameters (coupon, target GDP growth rate, and maturity). We calibrate for UK and US instruments, and carry out sensitivity analysis of prices and risk premia to the risk factors and bond design parameters. We also compare coupon-indexed and principal-indexed bonds. F…
Pricing and Hedging GDP-Linked Bonds in Incomplete Markets
2017
We model the super-replication of payoffs linked to a country's GDP as a stochastic linear program on a discrete time and state-space scenario tree to price GDP-linked bonds. As a byproduct of the model, we obtain a hedging portfolio. Using linear programming duality we also compute the risk premium. The model applies to coupon-indexed and principal-indexed bonds, and allows the analysis of bonds with different design parameters (coupon, target GDP growth rate, and maturity). We calibrate for UK and US instruments and carry out a sensitivity analysis of prices and risk premia to the risk factors and bond design parameters. We also compare coupon-indexed and principal-indexed bonds. Results …
Estimating feature discriminant power in decision tree classifiers
1995
Feature Selection is an important phase in pattern recognition system design. Even though there are well established algorithms that are generally applicable, the requirement of using certain type of criteria for some practical problems makes most of the resulting methods highly inefficient. In this work, a method is proposed to rank a given set of features in the particular case of Decision Tree classifiers, using the same information generated while constructing the tree. The preliminary results obtained with both synthetic and real data confirm that the performance is comparable to that of sequential methods with much less computation.