Results 1  10
of
22
Explicit design of timevarying stabilizing control laws for a class of controllable systems without drift
 Systems and Control Letters
, 1992
"... This paper gives a systematic way to design timevariant feedback control laws for a class of controllable nonlinear systems. This class contains a lot of systems which cannot be stabilized via a timeinvariant feedback control law. The interest of this work lies in the design method since a genera ..."
Abstract

Cited by 74 (2 self)
 Add to MetaCart
This paper gives a systematic way to design timevariant feedback control laws for a class of controllable nonlinear systems. This class contains a lot of systems which cannot be stabilized via a timeinvariant feedback control law. The interest of this work lies in the design method since a general existence result is already available. The techniques employed here are basic: they mainly involve classical Lyapunov analysis.
PseudoRandom Functions and Factoring
 Proc. 32nd ACM Symp. on Theory of Computing
, 2000
"... The computational hardness of factoring integers is the most established assumption on which cryptographic primitives are based. This work presents an efficient construction of pseudorandom functions whose security is based on the intractability of factoring. In particular, we are able to constru ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
The computational hardness of factoring integers is the most established assumption on which cryptographic primitives are based. This work presents an efficient construction of pseudorandom functions whose security is based on the intractability of factoring. In particular, we are able to construct efficient lengthpreserving pseudorandom functions where each evaluation requires only a (small) constant number of modular multiplications per output bit. This is substantially more efficient than any previous construction of pseudorandom functions based on factoring, and matches (up to a constant factor) the efficiency of the best known factoringbased pseudorandom bit generators.
Perfect Matchings Extend to Hamilton Cycles in Hypercubes
"... Kreweras’ conjecture [1] asserts that any perfect matching of the hypercube Qd, d ≥ 2, can be extended to a Hamilton cycle. We prove this conjecture. ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
Kreweras’ conjecture [1] asserts that any perfect matching of the hypercube Qd, d ≥ 2, can be extended to a Hamilton cycle. We prove this conjecture.
Bhadeshia: ‘Mechanical stabilisation of austenite
 Mater. Sci. Technol
"... A theory has been developed for the mechanical stabilisation of plastically deformed austenite by balancing the force which drives the transformation interface against the resistance from dislocation debris in the austenite. The work has been used to explain why very large strains are required to me ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
A theory has been developed for the mechanical stabilisation of plastically deformed austenite by balancing the force which drives the transformation interface against the resistance from dislocation debris in the austenite. The work has been used to explain why very large strains are required to mechanically stabilise certain stainless steels, and also to interpret the subunit mechanism of bainite growth.
Matching graphs of Hypercubes and Complete bipartite graphs
"... Kreweras’ conjecture [9] asserts that every perfect matching of the hypercube Qd can be extended to a Hamiltonian cycle of Qd. We [5] proved this conjecture but here we present a simplified proof. The matching graph M(G) of a graph G has a vertex set of all perfect matchings of G, with two vertices ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Kreweras’ conjecture [9] asserts that every perfect matching of the hypercube Qd can be extended to a Hamiltonian cycle of Qd. We [5] proved this conjecture but here we present a simplified proof. The matching graph M(G) of a graph G has a vertex set of all perfect matchings of G, with two vertices being adjacent whenever the union of the corresponding perfect matchings forms a Hamiltonian cycle of G. We show that the matching graph M(Kn,n) of a complete bipartite graph is bipartite if and only if n is even or n = 1. We prove that M(Kn,n) is connected for n even and M(Kn,n) has two components for n odd, n ≥ 3. We also compute distances between perfect matchings in M(Kn,n).
A/D Graphs  A Data Structure For Data Dependence Analysis In Programs With Pointers
"... This paper describes A/D graphsa new structure to determine data dependences in programs with pointers. In contrast to known methods, with A/D graphs we can derive the data dependences of a program statement by a single corresponding graph. Our method uses storage more efficiently and can handle ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper describes A/D graphsa new structure to determine data dependences in programs with pointers. In contrast to known methods, with A/D graphs we can derive the data dependences of a program statement by a single corresponding graph. Our method uses storage more efficiently and can handle the modules of a program separately. With A/D graphs we can perform a data dependence analysis by solving a monotone data flow system for restricted imperative languages. Based on an intraprocedural analysis using A/D graphs which produce optimal results we developed a method to derive a safe approximation of the data dependences by employing kbounded A/D graphs. Using this method we can perform intraprocedural as well as interprocedural data dependence analysis with storage quadratic in the number of program statements. The use of A/D graphs for data dependence analysis promises a significant improvement over known methods. Though we have constructed an experimental system to obtain preliminary data on the usefulness of our method, we still lack a sound comparison of the results to that of other systems. Currently we are working toward an integration of A/D graphs into the SUIF [1] system. As a further step we are attempting to extend the present research to programs with arbitrary, and in particular recursive, data structures. Our final aim is to be able to analyze any imperative program that does not use pointer arithmetic. Acknowledgements
The CSL Collapse Model and Spontaneous Radiation: An Update
, 1998
"... A brief review is given of the continuous spontaneous localization (CSL) model, in which a classical field interacts with quantized particles to cause dynamical wavefunction collapse. One of the model’s predictions is that particles ``spontaneously’’ gain energy at a slow rate. When applied to the e ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A brief review is given of the continuous spontaneous localization (CSL) model, in which a classical field interacts with quantized particles to cause dynamical wavefunction collapse. One of the model’s predictions is that particles ``spontaneously’’ gain energy at a slow rate. When applied to the excitation of a nucleon in a Ge nucleus, it is shown how a limit on the relative collapse rates of neutron and proton can be obtained, and a rough estimate is made from data. When applied to the spontaneous excitation of 1s electrons in Ge, by a more detailed analysis of more accurate data than given previously, an updated limit is obtained on the relative collapse rates of the electron and proton, suggesting that the coupling of the field to electrons and nucleons is mass proportional. 1.
Studies of Spin Relaxation and Recombination at the HERMES Hydrogen/Deuterium Gas Target
, 2000
"... d des atomaren Anteils werden sogenannte SamplingKorrekturen ben otigt. F ur eine als homogen angenommene Zelloberfl ache sind dies eindeutige Relationen, die z.B. mithilfe einer Molekularstromrechnung ermittelbar sind. Die Analyse der Daten zeigt jedoch, da die Zelloberfl ache durch den Einflu de ..."
Abstract
 Add to MetaCart
d des atomaren Anteils werden sogenannte SamplingKorrekturen ben otigt. F ur eine als homogen angenommene Zelloberfl ache sind dies eindeutige Relationen, die z.B. mithilfe einer Molekularstromrechnung ermittelbar sind. Die Analyse der Daten zeigt jedoch, da die Zelloberfl ache durch den Einflu des Elektronenstrahls ver andert wird, wodurch die Annahme einer homogenen Zelloberfl ache nicht aufrechterhalten werden kann. Es werden Modelle entwickelt, die es erlauben, den Bereich m oglicher SamplingKorrekturen mithilfe der am Probestrahl gemessenen Werte einzugrenzen. Es zeigt sich, da die systematische Unsicherheit der Targetpolarisation etwa proportional zur St arke von Rekombination und Wandstorelaxation ist. Eine pr azise Unterscheidung des molekularen Anteils, der durch Rekombination verursacht wird, und anderen molekularen Anteilen wie z.B. dem Restgasdruck sowie der einzelnen Faktoren, die die atomare Polarisation reduzieren, ist daher f ur eine genaue Bestimmung der Targetpolar
Calibration chain developed at LAPP for the ECAL of CMS
"... The experience of large calorimeters, in passed and actual experiments shows that the calibration is an extremely long and methodic task, implying several redundant methods in hardware and software as well. If, as expected nowadays, the Higgs has a mass under 150 GeV, its discovery in decay by LHC ..."
Abstract
 Add to MetaCart
The experience of large calorimeters, in passed and actual experiments shows that the calibration is an extremely long and methodic task, implying several redundant methods in hardware and software as well. If, as expected nowadays, the Higgs has a mass under 150 GeV, its discovery in decay by LHC experiments will rely heavily on the resolution of the ECAL. The precise measurement of these two gammas will depend in particular upon an accurate calibration (the constant term is expected /e energy scale. The knowledge and the mastering of the calibration will play a major role. We describe here the electronic system, that has been developed at LAPP to update permanently the calibration of the electronic readout chain of CMSECAL, during data taking.