Refine
Year of publication
- 1998 (147) (remove)
Document Type
- Preprint (109)
- Article (21)
- Doctoral Thesis (7)
- Lecture (3)
- Report (3)
- Diploma Thesis (1)
- Master's Thesis (1)
- Periodical Part (1)
- Working Paper (1)
Keywords
- AG-RESY (13)
- PARO (12)
- SKALP (9)
- Case Based Reasoning (4)
- industrial robots (4)
- motion planning (3)
- parallel processing (3)
- CIM-OSA (2)
- HANDFLEX (2)
- Kalman filtering (2)
- TOVE (2)
- coset enumeration (2)
- on-line algorithms (2)
- particle methods (2)
- path planning (2)
- search algorithms (2)
- subgroup problem (2)
- Analysis (1)
- Boltzmann Equation (1)
- C5H3(SiMe3)2-Liganden (1)
- CFD (1)
- Chirale Induktion (1)
- Cobalt-Halbsandwichkomplexe (1)
- Complexity (1)
- Correspondence with other notations (1)
- Dependency Factors (1)
- Dirichlet series (1)
- Distributed Software Development (1)
- EXPRESS-G (1)
- Electron states in low-dimensional structures (1)
- Enterprise modeling (1)
- Enterprise modelling (1)
- Funktionalanalysis (1)
- Grid Graphs (1)
- Gröbner base (1)
- Gröbner bases (1)
- Gröbner bases in monoid and group rings (1)
- HOT (1)
- Hilbert transform (1)
- Ill-Posed Problems (1)
- Indexierung (1)
- Inhaltserschließung (1)
- Integral (1)
- Integration (1)
- Internet Based Software Process Management Environment (1)
- Kallianpur-Robbins law (1)
- Koordinationschemie (1)
- Kristallographie (1)
- LCSH (1)
- Learning systems (1)
- Lebesque-Integral (1)
- Linear Integral Equations (1)
- MEGI (1)
- MILOS (1)
- Monoid and group rings (1)
- Monotone dynamical systems (1)
- Navier-Stokes (1)
- Nonlinear dynamics (1)
- Numerical Simulation (1)
- Ontolingua (1)
- Ontology (1)
- PC-based robot control (1)
- PERA (1)
- Phosphor (1)
- Pn (1)
- Quantum mechanics (1)
- RSWK (1)
- Rarefied Gas Flows (1)
- Rayleigh Number (1)
- Recurrent neural networks (1)
- Riemann-Siegel formula (1)
- Riemannsche Summen (1)
- Robust reliability (1)
- SWEEPING (1)
- Simultaneous quantifier elimination (1)
- Singularity theory (1)
- Treppenfunktionen (1)
- Tunneling (1)
- UML (1)
- Vorlesungsskript (1)
- WETICE 98 (1)
- Wannier-Bloch resonance states (1)
- Wannier-Stark systems (1)
- adaptive grid generation (1)
- area loss (1)
- automated proof planner (1)
- bi-directional search (1)
- center and median problems (1)
- chaos (1)
- cholesterische Phasen (1)
- client/server-architecture (1)
- confluence (1)
- convex models (1)
- crack diagnosis (1)
- cusp forms (1)
- da (1)
- damage diagnosis (1)
- discretization (1)
- distributed and parallel processing (1)
- distributed control system (1)
- distributed processing (1)
- domain decomposition (1)
- exact fully discrete vectorial wavelet transform (1)
- fixpoint theorem (1)
- fluid dynamic equations (1)
- graph search (1)
- higher order (1)
- higher order tableau (1)
- initial value representation (1)
- kinetic equations (1)
- kinetic models (1)
- konvexe Analysis (1)
- level set method (1)
- lifetime statistics (1)
- lifetimes (1)
- locational analysis (1)
- log averaging methods (1)
- molekularer Chiralitätswechselwirkungstensor (1)
- monoid- and group-presentations (1)
- moving contact line (1)
- multi-hypothesis diagnosis (1)
- natural language semantics (1)
- non-linear dynamics (1)
- numerics for pdes (1)
- occupation measure (1)
- off-line programming (1)
- planar Brownian motion (1)
- prefix reduction (1)
- prefix string rewriting (1)
- prefix-rewriting (1)
- proof presentation (1)
- pyramid scheme (1)
- quantum chaos (1)
- quantum mechanics (1)
- quasienergy (1)
- rarefied gas flows (1)
- ratio ergodic theorem (1)
- reinitialization (1)
- resonances (1)
- robot calibration (1)
- robot control architectures (1)
- robot motion planning (1)
- rotating machinery (1)
- scale discrete spherical vector wavelets (1)
- search algorithm (1)
- search alogorithms (1)
- semiclassical (1)
- sequent calculus (1)
- skolemization (1)
- stationary solutions (1)
- steady Boltzmann equation (1)
- strong theorems (1)
- subgroup presentation problem (1)
- theorem prover (1)
- trajectory optimization (1)
- variable cardinality case (1)
- vectorial multiresolution analysis (1)
- vehicular traffic (1)
Faculty / Organisational entity
- Kaiserslautern - Fachbereich Informatik (38)
- Kaiserslautern - Fachbereich Mathematik (35)
- Kaiserslautern - Fachbereich Physik (35)
- Fraunhofer (ITWM) (12)
- Kaiserslautern - Fachbereich Wirtschaftswissenschaften (9)
- Kaiserslautern - Fachbereich Elektrotechnik und Informationstechnik (6)
- Kaiserslautern - Fachbereich Maschinenbau und Verfahrenstechnik (6)
- Kaiserslautern - Fachbereich Biologie (3)
- Kaiserslautern - Fachbereich Chemie (2)
- Universitätsbibliothek (1)
In this paper we study the space-time asymptotic behavior of the solutions and derivatives to th incompressible Navier-Stokes equations. Using moment estimates we obtain that strong solutions to the Navier-Stokes equations which decay in \(L^2\) at the rate of \(||u(t)||_2 \leq C(t+1)^{-\mu}\) will have the following pointwise space-time decay \[|D^{\alpha}u(x,t)| \leq C_{k,m} \frac{1}{(t+1)^{ \rho_o}(1+|x|^2)^{k/2}} \]
where \( \rho_o = (1-2k/n)( m/2 + \mu) + 3/4(1-2k/n)\), and \(|a |= m\). The dimension n is \(2 \leq n \leq 5\) and \(0\leq k\leq n\) and \(\mu \geq n/4\)
Das Problem der Integration heterogener Softwaresysteme stellt sich auch auf dem Gebiet der CAx-Systeme, wie sie in vielfältigen Ausprägungen etwa in der Automobilbranche für die Fahrzeugentwicklung eingesetzt werden. Zunächst werden die heute in diesem Bereich
praktizierten Lösungen und die dabei auftretenden Probleme kurz dargestellt. Danach werden der neue Standard für Produktdaten, STEP, und der Standard für die Interoperabilität heterogener Softwaresysteme, CORBA, sowie einige CORBA-Entwurfsmuster erläutert. Als nächstes wird eine auf diesen beiden Standards basierende CAx-Integrationsarchitektur, die im Projekt ANICA entwickelt wurde, vorgestellt und die prinzipielle Vorgehensweise bei
ihrer Realisierung beschrieben. Daran anschließend wird über eine erste Umsetzung dieser Architektur in die Praxis berichtet. Zum Abschluß wird kurz auf die gewonnenen Erfahrungen eingegangen und ein Ausblick auf zukünftige Entwicklungen gegeben.
Die virtuelle Produktentwicklung in verteilter Umgebung erfordert eine intensive Kommunika-tion zwischen den beteiligten CAx-Systemen. Diese findet bisher in Form des dateibasierten Datenaustausches mit Hilfe von Direktkonvertern oder neutralen Schnittstellen statt. Der Datenaustausch wird hierbei meist in mehreren Iterationsschleifen durchgeführt und ist oft mit Datenverlusten sowie Unterbrechungen der Entwicklungsaktivitäten verbunden. Demgegenüber steht als neuer Ansatz für die Interoperabilität zwischen CAx-Systemen das Konzept eines CAx-Objektbusses auf Basis von CORBA und STEP. Dieser Ansatz ermög-licht eine plattformübergreifende Online-Kopplung heterogener CAx-Systeme. Im Gegensatz zum dateibasierten Datenaustausch ist hierbei ein transparenter Zugriff sowohl auf Daten als auch auf Funktionen der angebundenen Systeme möglich. Dadurch kann die Durchgängigkeit der Produktdaten in der Prozeßkette deutlich erhöht werden. Zur Beurteilung der Praxistauglichkeit wird dieser neue Ansatz dem dateibasierten Daten-austausch am Beispiel virtueller Einbauuntersuchungen gegenübergestellt. Dabei werden für unterschiedliche praxisrelevante Modellgrößen die für die Übertragung von Geometrie und Topologie erforderlichen Zeiten analysiert und verglichen. Weiterhin werden die generellen Vor- und Nachteile der beiden Lösungen dargestellt. Abschließend wird auf die Potentiale des neuen Ansatzes für den Einsatz in anderen Bereichen eingegangen.
Interoperability between different CAx systems involved in the development process of cars is presently one of the most critical issues in the automotive industry. None of the existing CAx systems meets all requirements of the very complex process network of the lifecycle of a car. With this background, industrial engineers have to use various CAx systems to get an optimal support for their daily work. Today, the communication between different CAx systems is done via data files using special direct converters or neutral system independent standards like IGES, VDAFS, and recently STEP, the international standard for product data description. To reduce the dependency on individual CAx s ystem vendors, the German automotive industry developed an open CAx system architecture based on STEP as guiding principle for CAx system development. The central component of this architecture is a common, system-independent access interface to CAx functions and data of all involved CAx systems, which is under development in the project ANICA. Within this project, a CAx object bus has been developed based on a STEP data description using CORBA as an integration platform. This new approach allows a transparent access to data and functions of the integrated CAx systems without file-based data exchange. The product development process with various CAx systems concerns objects from different CAx systems. Thus, mechanisms are needed to handle the persistent storage of the CAx objects distributed over the CAx object bus to give the developing engineers a consistent view of the data model of their product. The following paper discusses several possibilities to guarantee consistent data management and storage of distributed CAx models. One of the most promising approaches is the enhancement of the CAx object bus by a STEP-based object-oriented data server to realise a central data management.
Simultaneous quantifier elimination in sequent calculus is an improvement over the well-known skolemization. It allows a lazy handling of instantiations as well as of the order of certain reductions. We prove the soundness of a sequent calculus which incorporates a rule for simultaneous quantifier elimination. The proof is performed by semantical arguments and provides some insights into the dependencies between various formulas in a sequent.
Monomial representations and operations for Gröbner bases computations are investigated from an implementation point of view. The technique ofvectorized monomial operations is introduced and it is shown how it expedites computations of Gröbner bases. Furthermore, a rank-based monomialrepresentation and comparison technique is examined and it is concluded that this technique does not yield an additional speedup over vectorizedcomparisons. Extensive benchmark tests with the Computer Algebra System SINGULAR are used to evaluate these concepts.
The critical points of the continuous series are characterized by two complex numbers l_1,l_2 (Re(l_1,l_2)< 0), and a natural number n (n>=3) which enters the string susceptibility constant through gamma = -2/(n-1). The critical potentials are analytic functions with a convergence radius depending on l_1 or l_2. We use the orthogonal polynomial method and solve the Schwinger-Dyson equations with a technique borrowed from conformal field theory.
The first observation of spatiotemporal self-focusing of spin waves is reported. The experimental results are obtained for dipolar spin waves in yttrium-iron-garnet films by means of a newly developed space- and time-resolved Brillouin light scattering technique. They demonstrate self-focusing of a moving wave pulse in two spatial dimensions, and formation of localized two-dimensional wave packets, the collapse of which is stopped by dissipation. The experimental results are in good qualitative agreement with numerical simulations.
Wavelet transform originated in 1980's for the analysis of seismic signals has seen an explosion of applications in geophysics. However, almost all of the material is based on wavelets over Euclidean spaces. This paper deals with the generalization of the theory and algorithmic aspects of wavelets to a spherical earth's model and geophysically relevant vector fields such as the gravitational, magnetic, elastic field of the earth.A scale discrete wavelet approach is considered on the sphere thereby avoiding any type of tensor-valued 'basis (kernel) function'. The generators of the vector wavelets used for the fast evaluation are assumed to have compact supports. Thus the scale and detail spaces are finite-dimensional. As an important consequence, detail information of the vector field under consideration can be obtained only by a finite number of wavelet coefficients for each scale. Using integration formulas that are exact up to a prescribed polynomial degree, wavelet decomposition and reconstruction are investigated for bandlimited vector fields. A pyramid scheme for the recursive computation of the wavelet coefficients from level to level is described in detail. Finally, data compression is discussed for the EGM96 model of the earth's gravitational field.
Robust Reliability of Diagnostic Multi-Hypothesis Algorithms: Application to Rotating Machinery
(1998)
Damage diagnosis based on a bank of Kalman filters, each one conditioned on a specific hypothesized system condition, is a well recognized and powerful diagnostic tool. This multi-hypothesis approach can be applied to a wide range of damage conditions. In this paper, we will focus on the diagnosis of cracks in rotating machinery. The question we address is: how to optimize the multi-hypothesis algorithm with respect to the uncertainty of the spatial form and location of cracks and their resulting dynamic effects. First, we formulate a measure of the reliability of the diagnostic algorithm, and then we discuss modifications of the diagnostic algorithm for the maximization of the reliability. The reliability of a diagnostic algorithm is measured by the amount of uncertainty consistent with no-failure of the diagnosis. Uncertainty is quantitatively represented with convex models.
We have computed ensembles of complete spectra of the staggered Dirac operator using four-dimensional SU(2) gauge fields, both in the quenched approximation and with dynamical fermions. To identify universal features in the Dirac spectrum, we compare the lattice data with predictions from chiral random matrix theory for the distribution of the low-lying eigenvalues. Good agreement is found up to some limiting energy, the so-called Thouless energy, above which random matrix theory no longer applies. We determine the dependence of the Thouless energy on the simulation parameters using the scalar susceptibility and the number variance.
This paper presents a brief overview of the INRECA-II methodology for building and maintaining CBR applications. It is based on the experience factory and the software process modeling approach from software engineering. CBR development and maintenance experience is documented using software process models and stored in a three-layered experience packet.
For defining attribute types to be used in the case representation, taxonomies occur quite often. The symbolic values at any node of the taxonomy tree are used as attribute values in a case or a query. A taxonomy type represents a relationship between the symbols through their position within the taxonomy-tree which expresses knowledge about the similarity between the symbols. This paper analyzes several situations in which taxonomies are used in different ways and proposes a systematic way of specifying local similarity measures for taxonomy types. The proposed similarity measures have a clear semantics and are easy to compute at runtime.
As the previous chapters of this book have shown, case-based reasoning is a technology that has been successfully applied to a large range of different tasks. Through all the different CBR projects, both basic research projects as well as industrial development projects, lots of knowledge and experience about how to build a CBR application has been collected. Today, there is already an increasing number of successful companies developing industrial CBR applications. In former days, these companies could develop their early pioneering CBR applications in an ad-hoc manner. The highly-skilled CBR expert of the company was able to manage these projects and to provide the developers with the required expertise.
Object-oriented case representations require approaches for similarity assessment that allow to compare two differently structured objects, in particular, objects belonging to different object classes. Currently, such similarity measures are developed more or less in an ad-hoc fashion. It is mostly unclear, how the structure of an object-oriented case model, e.g., the class hierarchy, influences similarity assessment. Intuitively, it is obvious that the class hierarchy contains knowledge about the similarity of the objects. However, how this knowledge relates to the knowledge that could be represented in similarity measures is not obvious at all. This paper analyzes several situations in which class hierarchies are used in different ways for case modeling and proposes a systematic way of specifying similarity measures for comparing arbitrary objects from the hierarchy. The proposed similarity measures have a clear semantics and are computationally inexpensive to compute at run-time.
Although several systematic analyses of existing approaches to adaptation have been published recently, a general formal adaptation framework is still missing. This paper presents a step into the direction of developing such a formal model of transformational adaptation. The model is based on the notion of the quality of a solution to a problem, while quality is meant in a more general sense and can also denote some kind of appropriateness, utility, or degree of correctness. Adaptation knowledge is then defined in terms of functions transforming one case into a successor case. The notion of quality provides us with a semantics for adaptation knowledge and allows us to define terms like soundness, correctness and completeness. In this view, adaptation (and even the whole CBR process) appears to be a special instance of an optimization problem.
This paper motivates the necessity for support for negotiation during Sales Support on the Internet within Case-Based Reasoning solutions. Different negotiation approaches are discussed and a general model of the sales process is presented. Further, the tradition al CBR-cycle is modified in such a way that iterative retrieval during a CBR consulting session is covered by the new model. Several gen eral characteristics of negotiation are described and a case study is shown where preliminary approaches are used to negotiate with a cu stomer about his demands and available products in a 'CBR-based' Electronic Commerce solution.
Stand des strategischen Controlling-Berichtwesens und Übertragungsmöglichkeiten auf die Universität
(1998)
Enhancing the quality of surgical interventions is one of the main goals of surgical robotics. Thus we have devised a surgical robotic system for maxillofacial surgery which can be used as an intelligent intraoperative surgical tool. Up to now a surgeon preoperatively plans an intervention by studying twodimensional X-rays, thus neglecting the third dimension. In course of the special research programme "Computer and Sensor Aided Surgery" a planning system has been developed at our institute, which allows the surgeon to plan an operation on a threedimensional computer model of the patient . Transposing the preoperatively planned bone cuts, bore holes, cavities, and milled surfaces during surgery still proves to be a problem, as no adequate means are at hand: the actual performance of the surgical intervention and the surgical outcome solely depend on the experience and the skill of the operating surgeon. In this paper we present our approach of a surgical robotic system to be used in maxillofacial surgery. Special stress is being laid upon the modelling of the environment in the operating theatre and the motion planning of our surgical robot .
In the present paper we investigate the Rayleigh-Benard convection in rarefied gases and demonstrate by numerical experiments the transition from purely thermal conduction to a natural convective flow for a large range of Knudsen numbers from 0.02 downto 0.001. We address to the problem how the critical value for the Rayleigh number defined for incompressible vsicous flows may be translated to rarefied gas flows. Moreover, the simulations obtained for a Knudsen number Kn=0.001 and Froude number Fr=1 show a further transition from regular Rayleigh-Benard cells to a pure unsteady behavious with moving vortices.
A new approach is proposed to model and simulate numerically heterogeneous catalysis in rarefied gas flows. It is developed to satisfy all together the following points: i) describe the gas phase at the microscopic scale, as required in rarefied flows, ii) describe the wall at the macroscopic scale, to avoid prohibitive computational costs and consider not only crystalline but also amorphous surfaces, iii) reproduce on average macroscopic laws correlated with experimental results and iv) derive ana- lytic models in a systematic and exact way. The problem is stated in the general framework of a non static flow in the vicinity of a catalytic and non porous surface (without ageing). It is shown that the exact and systematic resolution method based on the Laplace transform, introduced previously by the author to model collisions in the gas phase, can be extended to the present problem. The proposed approach is applied to the modelling of the Eley-Rideal and Langmuir-Hinshelwood recombinations, assuming that the coverage is locally at equilibrium. The models are developed considering one atomic species and extended to the gen eral case of several atomic species. Numerical calculations show that the models derived in this way reproduce with accuracy behaviours observed experimentally.
The World Wide Web is a medium through which a manufacturer may allow Internet visitors to customize or compose his products. Due to missing or rapidly changing standards these applications are often restricted to relatively simple CGI or JAVA based scripts. Usually, results like images or movies are stored in a database and are transferred on demand to the web-user. Viper (Visualisierung parametrisch editierbarer Raumkomponenten) is a Toolkit [VIP96] written in C++ and JAVA which provides 3D-modeling and visualization methodsfor developing complex web-based applications. The Toolkit has been designed to built a prototype, which can be used to construct and visualize prefabricated homes on the Internet. Alternative applications are outlined in this paper. Within Viper, all objects are stored in a scene graph (VSSG ), which is the basic data structure of the Toolkit. To show the concept and structure of the Toolkit, functionality, and implementation of the prototype are described.
On a family F of probability measures on a measure space we consider the Hellinger and Kullback-Leibler distances. We show that under suitable regulari ty conditions Jeffreys' prior is proportional to the k-dimensional Hausdorff measure w.r.t. Hellinger dis tance respectively to the k2 -dimensional Hausdorff measure w.r.t. Kullback-Leibler distance. The proof i s based on an area-formula for the Hausdorff measure w.r.t. to generalized distances.
In order to improve the distribution system for the Nordic countries the BASF AG considered 13 alternative scenarios to the existing system. These involved the construction of warehouses at various locations. For every scenario the transportation, storage, and handling cost incurred was to be as low as possible, where restrictions on the delivery time were given. The scenarios were evaluated according to (minimal) total cost and weighted average delivery time. The results led to a restriction to only three cases, involving only one new warehouse each. For these a more accurate model for the cost was developped and evaluated, yielding results similar to a simple linear model. Since there were no clear preferences between cost and delivery time, the final decision was chosen to represent a compromise between the two criteria.
In this paper, a combined approach to damage diagnosis of rotors is proposed. The intention is to employ signal-based as well as model-based procedures for an improved detection of size and location of the damage. In a first step, Hilbert transform signal processing techniques allow for a computation of the signal envelope and the instantaneous frequency, so that various types of non-linearities due to a damage may be identified and classified based on measured response data. In a second step, a multi-hypothesis bank of Kalman Filters is employed for the detection of the size and location of the damage based on the information of the type of damage provided by the results of the Hilbert transform.
Abstract: We show that the physical mechanism of population transfer in a 3-level system with a closed loop of coherent couplings (loop-STIRAP) is not equivalent to an adiabatic rotation of the dark-state of the Hamiltonian but coresponds to a rotation of a higher-order trapping state in a generalized adiabatic basis. The concept of generalized adiabatic basis sets is used as a constructive toolto design pulse sequences for stimulated Raman adiabatic passage (STIRAP) which give maximum population transfer also under conditions when the usual condition of adiabaticty is only poorly fulfilled. Under certain conditions for the pulses (generalized matched pulses) there exists a higher-order trapping state, which is an exact constant of motion and analytic solutions for the atomic dynamics can be derived.
Abstract: Resonant optical pumping in dense atomic media is discussed, where the absorption length is less than the smallest characteristic dimension of the sample. It is shown that reabsorption and multiple scattering of spontaneous photons (radiation trapping) can substantially slow down the rate of optical pumping. A very slow relaxation out of the target state of the pump process is then sufficient to make optical pumping impossible. As model systems an inhomogeneously and a radiatively broadened 3-level system resonantly driven with a strong broad-band pump field are considered.
Abstract: We analyze the long-time quantum dynamics of degenerate parametric down-conversion from an initial sub-harmonic vacuum (spontaenous down-conversion). Standard linearization of the Heisenberg equations of motions fails in this case, since it is based on an expansion around an unstable classical solution and neglects pump depletion. Introducing a mean-field approximation we find a periodic exchange of energy between the pump and subharmonic mode goverened by an anharmonic pendulum equation. From this equation the optimum interaction time or crystal length for maximum conversion can be determined. A numerical integration of the 2-mode Schrödinger equation using a dynamically optimized basis of displaced and squeezed number states verifies the characteristic times predicted by the mean-field approximation. In contrast to semiclassical and mean-field predictions it is found that quantum uctuations of the pump mode lead to a substantial limitation of the efficiency of parametric down-conversion.
Abstract: Generalized single-atom Maxwell-Bloch equations for optically dense media are derived taking into account non-cooperative radiative atom-atom interactions. Applying a Gaussian approximation and formally eliminating the degrees of freedom of the quantized radiation field and of all but a probe atom leads to an effective time-evolution operator for the probe atom. The mean coherent amplitude of the local field seen by the atom is shown to be given by the classical Lorentz-Lorenz relation. The second-order correlations of the field lead to terms that describe relaxation or pump processes and level shifts due to multiple scattering or reabsorption of spontaneously emitted photons. In the Markov limit a non-linear and nonlocal single-atom density matrix equation is derived. To illustrate the effects of the quantum corrections we discuss amplified spontaneous emission and radiation trapping in a dense ensemble of initially inverted two-level atoms and the effects of radiative interactions on intrinsic optical bistability in coherently driven systems.
In this paper we derive nonparametric stochastic volatility models in discrete time. These models generalize parametric autoregressive random variance models, which have been applied quite successfully to nancial time series. For the proposed models we investigate nonparametric kernel smoothers. It is seen that so-called nonparametric deconvolution estimators could be applied in this situation and that consistency results known for nonparametric errors- in-variables models carry over to the situation considered herein.
Knowledge about the distribution of a statistical estimator is important for various purposes like, for example, the construction of confidence intervals for model parameters or the determiation of critical values of tests. A widely used method to estimate this distribution is the so-called bootstrap which is based on an imitation of the probabilistic structure of the data generating process on the basis of the information provided by a given set of random observations. In this paper we investigate this classical method in the context of artificial neural networks used for estimating a mapping from input to output space. We establish consistency results for bootstrap estimates of the distribution of parameter estimates.
Wavelets on closed surfaces in Euclidean space R3 are introduced starting from a scale discrete wavelet transform for potentials harmonic down to a spherical boundary. Essential tools for approximation are integration formulas relating an integral over the sphere to suitable linear combinations of functional values (resp. normal derivatives) on the closed surface under consideration. A scale discrete version of multiresolution is described for potential functions harmonic outside the closed surface and regular at infinity. Furthermore, an exact fully discrete wavelet approximation is developed in case of band-limited wavelets. Finally, the role of wavelets is discussed in three problems, namely (i) the representation of a function on a closed surface from discretely given data, (ii) the (discrete) solution of the exterior Dirichlet problem, and (iii) the (discrete) solution of the exterior Neumann problem.
For the determination of the earth" s gravity field many types of observations are available nowadays, e.g., terrestrial gravimetry, airborne gravimetry, satellite-to-satellite tracking, satellite gradiometry etc. The mathematical connection between these observables on the one hand and gravity field and shape of the earth on the other hand, is called the integrated concept of physical geodesy. In this paper harmonic wavelets are introduced by which the gravitational part of the gravity field can be approximated progressively better and better, reflecting an increasing flow of observations. An integrated concept of physical geodesy in terms of harmonic wavelets is presented. Essential tools for approximation are integration formulas relating an integral over an internal sphere to suitable linear combinations of observation functionals, i.e., linear functionals representing the geodetic observables. A scale discrete version of multiresolution is described for approximating the gravitational potential outside and on the earth" s surface. Furthermore, an exact fully discrete wavelet approximation is developed for the case of band-limited wavelets. A method for combined global outer harmonic and local harmonic wavelet modelling is proposed corresponding to realistic earth" s models. As examples, the role of wavelets is discussed for the classical Stokes problem, the oblique derivative problem, satellite-to-satellite tracking, satellite gravity gradiometry, and combined satellite-to-satellite tracking and gradiometry.
Contrary to symbolic learning approaches, that represent a learned concept explicitly, case-based approaches describe concepts implicitly by a pair (CB; sim), i.e. by a measure of similarity sim and a set CB of cases. This poses the question if there are any differences concerning the learning power of the two approaches. In this article we will study the relationship between the case base, the measure of similarity, and the target concept of the learning process. To do so, we transform a simple symbolic learning algorithm (the version space algorithm) into an equivalent case-based variant. The achieved results strengthen the hypothesis of the equivalence of the learning power of symbolic and casebased methods and show the interdependency between the measure used by a case-based algorithm and the target concept.
The Wannier-Bloch resonance states are metastable states of a quantum particle in a space-periodic potential plus a homogeneous field. Here we analyze the states of quantum particle in space- and time-periodic potential. In this case the dynamics of the classical counterpart of the quantum system is either quasiregular or chaotic depending on the driving frequency. It is shown that both the quasiregular and the chaotic motion can also support quantum resonances. The relevance of the obtained result to the problem a of crystal electron under simultaneous influence of d.c. and a.c. electric fields is briefly discussed. PACS: 73.20Dx, 73.40Gk, 05.45.+b
We study the statistics of the Wigner delay time and resonance width for a Bloch particle in ac and dc fields in the regime of quantum chaos. It is shown that after appropriate rescaling the distributions of these quantities have universal character predicted by the random matrix theory of chaotic scattering.
The paper discusses the metastable states of a quantum particle in a periodic potential under a constant force (the model of a crystal electron in a homogeneous electric ,eld), which are known as the Wannier-Stark ladder of resonances. An ecient procedure to ,nd the positions and widths of resonances is suggested and illustrated by numerical calculation for a cosine potential.
We prove that there exists a positive \(\alpha\) such thatfor any integer \(\mbox{$d\ge 3$}\) and any topological types \(\mbox{$S_1,\dots,S_n$}\) of plane curve singularities, satisfying \(\mbox{$\mu(S_1)+\dots+\mu(S_n)\le\alpha d^2$}\), there exists a reduced irreducible plane curve of degree \(d\) with exactly \(n\) singular points of types \(\mbox{$S_1,\dots,S_n$}\), respectively. This estimate is optimal with respect to theexponent of \(d\). In particular, we prove that for any topological type \(S\) there exists an irreducible polynomial of degree \(\mbox{$d\le 14\sqrt{\mu(S)}$}\) having a singular point of type \(S\).
The dispersions of dipolar (Damon-Eshbach modes) and exchange dominated spin waves are calculated for in-plane magnetized thin and ultrathin cubic films with (111) crystal orientation and the results are compared with those obtained for the other principal planes. The properties of these magnetic excitations are examined from the point of view of Brillouin light scattering experiments. Attention is paid to study the spin-wave frequency variation as a function of the magnetization direction in the film plane for different film thicknesses. Interface anisotropies and the bulk magnetocrystalline anisotropy are considered in the calculation. A quantitative comparison between an analytical expression obtained in the limit of small film thickness and wave vector and the full numerical calculation is given.
Abstract: Random Matrix Theory (RMT) is a powerful statistical tool to model spectral fluctuations. This approach has also found fruitful application in Quantum Chromodynamics (QCD). Importantly, RMT provides very efficient means to separate different scales in the spectral fluctuations. We try to identify the equivalent of a Thouless energy in complete spectra of the QCD Dirac operator for staggered fermions from SU(2) lattice gauge theory for different lattice size and gauge couplings. We focus on the bulk of the spectrum. In disordered systems, the Thouless energy sets the universal scale for which RMT applies. This relates to recent theoretical studies which suggest a strong analogy between QCD and disordered systems. The wealth of data allows us to analyze several statistical measures in the bulk of the spectrum with high quality. We find deviations which allows us to give an estimate for this universal scale. Other deviations than these are seen whose possible origin is discussed. Moreover, we work out higher order correlators as well, in particular three-point correlation functions.
Finding "good" cycles in graphs is a problem of great interest in graph theory as well as in locational analysis. We show that the center and median problems are NP hard in general graphs. This result holds both for the variable cardinality case (i.e. all cycles of the graph are considered) and the fixed cardinality case (i.e. only cycles with a given cardinality p are feasible). Hence it is of interest to investigate special cases where the problem is solvable in polynomial time. In grid graphs, the variable cardinality case is, for instance, trivially solvable if the shape of the cycle can be chosen freely. If the shape is fixed to be a rectangle one can analyse rectangles in grid graphs with, in sequence, fixed dimension, fixed cardinality, and variable cardinality. In all cases a com plete characterization of the optimal cycles and closed form expressions of the optimal objective values are given, yielding polynomial time algorithms for all cases of center rectangle problems. Finally, it is shown that center cycles can be chosen as rectangles for small cardinalities such that the center cycle problem in grid graphs is in these cases completely solved.
Vorgestellt wird ein System basierend auf einem 3D-Scanner nach dem Licht- schnitt-Prinzip mit dem es möglich ist, einen Menschen innerhalb von 1,5 Sekun- den dreidimensional zu erfassen. Mit Hilfe von Evolutionären Algorithmen wird über eine modellbasierte Dateninterpretation die Auswertung der Meßdaten betrie- ben, so daß beliebige Körpermaße ermittelt werden können. Das Ergebnis ist ein individualisiertes CAD-Modells der Person im Rechner. Ein derartiges Modell kann als virtuelle Kleiderpuppe zur Produktion von Maßbekleidung dienen.
Abstract: We develop a constructive method to derive exactly solvable quantum mechanical models of rational (Calogero) and trigonometric (Sutherland) type. This method starts from a linear algebra problem: finding eigenvectors of triangular finite matrices. These eigenvectors are transcribed into eigenfunctions of a selfadjoint Schrödinger operator. We prove the feasibility of our method by constructing an " AG_3 model" of trigonometric type (the rational case was known before from Wolfes 1975). Applying a Coxeter group analysis we prove its equivalence with the B_3 model. In order to better understand features of our construction we exhibit the F_4 rational model with our method.
We develop a constructive method to derive exactly solvable quantum mechanical models of rational (Calogero) and trigonometric (Sutherland) type. This method starts from a linear algebra problem: finding eigenvectors of triangular finite matrices. These eigenvectors are transcribed into eigenfunctions of a selfadjoint Schrödinger operator. We prove the feasibility of our method by constructing a new "\(AG_3\) model" of trigonometric type (the rational case was known before from Wolfes 1975). Applying a Coxeter group analysis we prove its equivalence with the \(B_3\) model. In order to better understand features of our construction we exhibit the \(F_4\) rational model with our method.
The Monte Carlo complexity of computing integrals depending on a parameter is analyzed for smooth integrands. An optimal algorithm is developed on the basis of a multigrid variance reduction technique. The complexity analysis implies that our algorithm attains a higher convergence rate than any deterministic algorithm. Moreover, because of savings due to computation on multiple grids, this rate is also higher than that of previously developed Monte Carlo algorithms for parametric integration.
We present a parallel control architecture for industrial robot cells. It is based on closed functional components arranged in a flat communication hierarchy. The components may be executed by different processing elements, and each component itself may run on multiple processing elements. The system is driven by the instructions of a central cell control component. We set up necessary requirements for industrial robot cells and possible parallelization levels. These are met by the suggested robot control architecture. As an example we present a robot work cell and a component for motion planning, which fits well in this concept.
Es wird die Aufgabe der vollständigen räumlichen Abdeckung von Regionen in durch mobile Roboter betrachtet. Da-bei können die Regionen in vollständig, teilweise oder nicht bekannten Umgebungen liegen. Zur Lösung wird ein Verfahren aus der Computer-grafik zum Füllen von Bildregionen zugrunde gelegt. Das Verfahren hat eine lokale Sichtweise und läßt somit den Einsatz von Sensordaten und das Auftreten von unvorhergesehenen Hindernissen zu. Die Regionen können durch Karten off-line vorgegeben sein oder durch Sensordaten on-line aufgebaut werden. Dennoch ist eine vollständige und genau einma-lige Flächenbearbeitung garantiert. Dies wird an Beispielen in einer graphischen Visualisierung der Realzeit-Steuerung des Roboters validiert.
We present a parallel path planning method that is able to automatically handle multiple goal configurations as input. There are two basic approaches, goal switching and bi-directional search, which are combined in the end. Goal switching dynamically selects a fa-vourite goal depending on some distance function. The bi-directional search supports the backward search direction from the goal to the start configuration, which is probably faster. The multi-directional search with goal switching combines the advantages of goal switching and bi-directional search. Altogether, the planning system is enabled to select one of the pref-erable goal configuration by itself. All concepts are experimentally validated for a set of benchmark problems consisting of an industrial robot arm with six degrees of freedom in a 3D environment.
This paper is based on a path planning approach we reported earlier for industrial robot arms with 6 degrees of freedom in an on-line given 3D environment. It has on-line capabilities by searching in an implicit and descrete configuration space and detecting collisions in the Cartesian workspace by distance computation based on the given CAD model. Here, we present different methods for specifying the C-space discretization. Besides the usual uniform and heuristic discretization, we investigate two versions of an optimal discretization for an user-predefined Cartesian resolution. The different methods are experimentally evaluated. Additionally, we provide a set of 3- dimensional benchmark problems for a fair comparison of path planner. For each benchmark, the run-times of our planner are between only 3 and 100 seconds on a Pentium PC with 133 MHz.
In this paper, the problem of path planning for robot manipulators with six degrees of freedom in an on-line provided three-dimensional environment is investigated. As a basic approach, the best-first algorithm is used to search in the implicit descrete configuration space. Collisions are detected in the Cartesian workspace by hierarchical distance computation based on the given CAD model. The basic approach is extended by three simple mechanisms and results in a heuristic hierarchical search. This is done by adjusting the stepsize of the search to the distance between the robot and the obstacles. As a first step, we show encouraging experimental results with two degrees of freedom for five typical benchmark problems.
This paper presents a new approach to parallel path planning for industrial robot arms with six degrees of freedom in an on-line given 3D environment. The method is based a best-first search algorithm and needs no essential off-line computations. The algorithm works in an implicitly discrete configuration space. Collisions are detected in the Cartesian workspace by hierarchical distance computation based on polyhedral models of the robot and the obstacles. By decomposing the 6D configuration space into hypercubes and cyclically mapping them onto multiple processing units, a good load distribution can be achieved. We have implemented the parallel path planner on a workstation cluster with 9 PCs and tested the planner for several benchmark environments. With optimal discretisation, the new approach usually shows very good speedups. In on-line provided environments with static obstacles, the parallel planning times are only a few seconds.
We derive a new class of particle methods for conservation laws, which are based on numerical flux functions to model the interactions between moving particles. The derivation is similar to that of classical Finite-Volume methods; except that the fixed grid structure in the Finite-Volume method is substituted by so-called mass packets of particles. We give some numerical results on a shock wave solution for Burgers equation as well as the well-known one-dimensional shock tube problem.
Annual Report 1997
(1998)
Diese Arbeit beschäftigt sich mit einer Möglichkeit zur Effizienzverbesserung, wobei das SNLP-basierte Planungssystem CAPlan verwendet wird. Dabei werden neue, zu lösende Probleme einer Vorverarbeitung unterzogen. Dort werden bestimmte Eigenschaften ermittelt, ohne jedoch das Problem zu lösen. Anschliessend wird dem Planungssystem das neue Problem mit dem Zusatzwissen in Form der analysierten Eigenschaften übergeben. Das Planungssystem verwendet das Wissen, um effizienter eine Lösung zu finden.
In this paper the kinetic model for vehicular traffic developed in [3,4] is considered and theoretical results for the space homogeneous kinetic equation are presented. Existence and uniqueness results for the time dependent equation are stated. An investigation of the stationary equation leads to a boundary value problem for an ordinary differential equation. Existence of the solution and some properties are proved. A numerical investigation of the stationary equation is included.
Ein verhaltensorientierter Ansatz zum flächendeckenden Fahren in a priori unbekannter Umgebung
(1998)
In diesem Aufsatz wird ein Verfahren zum flächendeckenden Fahren in zu- nächst unbekannter Umgebung beschrieben, wie es z.B. für Reinigungsanwen- dungen im Heimbereich benötigt wird. Parallel zur Durchführung der Reini- gungsaufgabe wird dabei die Umgebung exploriert und kartiert. Der verhaltensorientierte Ansatz ermöglicht eine robuste, zielgerichtete und dennoch ressourcenschonende Implementierung und gestattet es, einzelne Ver- haltensweisen leicht durch verbesserte oder auch speziell erlernte Versionen auszutauschen. Das vorgestellte Verfahren wurde simulativ getestet und wird in Kürze auf einem realen Roboter erprobt.
In the following an introduction to the level set method will be givenso that one becomes aware of the arising problems, which lead to the needof reinitialization. The problems concerning reinitialization itself will be analysed more detailed and a solution for area loss will be proposed. This solution consists in a combination of the commonly used PDE for reinitialization and extrapolation around the zero level set. Numericalexperiments show rather satisfactory results as far as area loss and computation of curvature are concerned.
The flow of a liquid into an empty channel is simulated. The simulation is based on a recently published model for general fluid/liquid/solid systems which eliminates the shear stress singularity at the moving contact line between the liquid/fluid interface and the solid. This model is carefully analyzed for low Reynolds and Capillary numbers, adapted to the channel inflow problem, and implemented. Very convincing numerical results are presented.
In this paper domain decomposition methods for radiative transfer problems including conductive heat transfer are treated. The paper focuses on semi-transparent materials, like glass, and the associated conditions at the interface between the materials. Using asymptotic analysis we derive conditions for the coupling of the radiative transfer equations and a diffusion approximation. Several test cases are treated and a problem appearing in glass manufacturing processes is computed. The results clearly show the advantages of a domain decomposition approach. Accuracy equivalent to the solution of the global radiative transfer solution is achieved, whereas computation time is strongly reduced.
In the present paper multilane models for vehicular traffic are considered. A microscopic multilane model based on reaction thresholds is developed. Based on this model an Enskog like kinetic model is developed. In particular, care is taken to incorporate the correlations between the vehicles. From the kinetic model a fluid dynamic model is derived. The macroscopic coefficients are deduced from the underlying kinetic model. Numerical simulations are presented for all three levels of description in [10]. Moreover, a comparison of the results is given there.
In this paper the work presented in [6] is continued. The present paper contains detailed numerical investigations of the models developed there. A numerical method to treat the kinetic equations obtained in [6] are presented and results of the simulations are shown. Moreover, the stochastic correlation model used in [6] is described and investigated in more detail.
In der vorliegenden Arbeit wird die Methode der Molekulardynamik benutzt, um das Transmissionsverhalten von niederenergetischen Sauerstoffionen durch dünne Edelgasfilme mit Hilfe von klassischen Wechselwirkungs-Potentialen zu untersuchen. In einer quantenmechanischen Form, der sogenannten Tight-Binding Näherung, wird die Molekulardynamik verwendet, um die Dynamik des Phasenübergangs von der Flüssigkeit, oder vom Gas, zur amorphen Phase von Silizium, oder von hydrogenisiertem Silizium, zu untersuchen. Ich simuliere ein Experiment von N. J. Sack et. al., in dem Sauerstoffionen durch Elektronenbeschuß von einer WOx-Oberfläche desorbiert wurden und deren Transmissionsverhalten durch dünne Edelgasfilme gemessen wurde. Wenn in der Simulation nur elastische Streuung durch Paarpotentiale zugelassen wird, finde ich gute Übereinstimmung für die Transmissionsausbeuten zwischen Experiment und Simulation für Xe- und Kr-Filme. Die große Anzahl der gefundenen Transmissionen kann auf den kleinen Wechselwirkungsradius der Sauerstoffionen zurückgeführt werden. Die Diskrepanz zwischen Experiment und Simulation, die für Ar-Filme zu verzeichnen ist, wird auf elektronisch inelastische Wechselwirkungen oder strukturelle Effekte im Experiment zurückgeführt. In einem einfachen geometrischen Modell kann ich die Transmissions-Daten der Simulation für Xe- und Kr- Filme interpretieren, nicht jedoch die Daten für Ar-Filme. Dieses geometrische Modell wird dann zur Interpretation eines weiteren, ähnlichen Experiments von N. J. Sack et. al. herangezogen. Neue dynamische Gleichungen für klassische und quantenmechanische Molekulardynamik im kanonischen - , Enthalpie - und freien Enthalpie Ensemble werden vorgeschlagen. Ich zeige, daß Atome, die in den neuen dynamischen Gleichungen in der Zeit propagiert werden, die Phasenraum-Verteilungsfunktionen der entsprechenden Ensembles korrekt abtasten. Basierend auf einem verallgemeinerten Liouville Theorem werden numerische Integrations-Algorithmen entwickelt, die die fundamentalen Symmetrieen der dynamischen Gleichungen respektieren. Silizium gehört zu den am besten studierten Materialien überhaupt. In theoretischen Untersuchungen wird flüssiges und amorphes Silizium üblicherweise ohne Kontrolle des Drucks untersucht. In dieser Arbeit wird gezeigt, daß Druckkontrolle in der Beschreibung sowohl einer thermodynamischen Phase als auch in Phasenübergängen in der Simulation wichtig ist. Der Übergang von der flüssigen zur amorphen Phase von Silizium in einer Tight-Binding Beschreibung mit und ohne Druckkontrolle führt zu Strukturen, die halbleitend mit Druckkontrolle und nicht halbleitend ohne Druckkontrolle sind. Weiterhin werden Evidenzen gefunden, die die Erweiterung der üblichen minimalen Valenzbasis des Siliziums durch d-Orbitale nahelegen, um korrekte Resultate speziell für flüssiges Silizium zu erhalten. Amorphes hydrogenisiertes Silizium ist technisch wichtig, da die Bandlücke durch Wasserstoffgehalt und Herstellung beeinflußt werden kann. In dieser Arbeit wird ein mikroskopisches Modell für amorphes Silizium, erhalten durch Abkühlung eines Silizium-Wasserstoff Gases, mit Hilfe der Molekulardynamik in einer Tight-Binding Beschreibung simuliert. Die Rolle des Wasserstoffs im amorphen Netzwerk wird mit Hilfe einer Vielzahl von Korrelationsfunktionen aufgezeigt. Diese Korrelationsfunktionen demonstrieren die hohe Flexibilität des Wasserstoffs. In Übereinstimmung mit neueren NMR-Daten von Y. Wu et. al finde ich im amorphen Netzwerk eine Klusterung der Wasserstoffatome, die die Tendenz zweier Wasserstoffatome reflektiert unabgesättigte Silizium Bindung, die sich ohne Wasserstoff zu ungünstigen Bindungsgeometrien vereinigen würden, zu passivieren.
This paper describes a tableau-based higher-order theorem prover HOT and an application to natural language semantics. In this application, HOT is used to prove equivalences using world knowledge during higher-order unification (HOU). This extended form of HOU is used to compute the licensing conditions for corrections.
The quasienergy spectrum of a periodically driven quantum system is constructed from classical dynamics by means of the semiclassical initial value representation using coherent states. For the first time, this method is applied to explicitly time dependent systems. For an anharmonic oscillator system with mixed chaotic and regular classical dynamics, the entire quantum spectrum (both regular and chaotic states) is reproduced semiclassically with surprising accuracy. In particular, the method is capable to account for the very small tunneling splittings.
The notion of formal description techniques for timed systems (T-FDTs) has been introduced in [EDK98a] to provide a unifying framework for description techniques that are formal and that allow to describe the ongoing behavior of systems. In this paper we show that three well known temporal logics, MTL, MTL-R , and CTL*, can be embedded in this framework. Moreover, we provide evidence that a large number of dioeerent kinds of temporal logics can be considered as T-FDTs.
Superselection rules induced by the interaction with the environment are investigated with the help of exactly soluble Hamiltonian models. Starting from the examples of Araki and of Zurek more general models with scattering are presented for which the projection operators onto the induced superselection sectors do no longer commute with the Hamiltonian. The example of an environment given by a free quantum field indicates that infrared divergence plays an essential role for the emergence of induced superselection sectors. For all models the induced superselection sectors are uniquely determined by the Hamiltonian, whereas the time scale of the decoherence depends crucially on the initial state of the total system.
Transitions from classical to quantum behaviour in a spin system with two degenerate ground states separated by twin energy barriers which are asymmetric due to an applied magnetic field are investigated. It is shown that these transitions can be interpreted as first- or second-order phase transitions depending on the anisotropy and magnetic parameters defining the system in an effective Lagrangian description.
For the numerical simulation of 3D radiative heat transfer in glasses and glass melts, practically applicable mathematical methods are needed to handle such problems optimal using workstation class computers. Since the exact solution would require super-computer capabilities we concentrate on approximate solutions with a high degree of accuracy. The following approaches are studied: 3D diffusion approximations and 3D ray-tracing methods.
The tunneling splitting of the energy levels of a ferromagnetic particle in the presence of an applied magnetic field - previously derived only for the ground state with the path integral method - is obtained in a simple way from Schr"odinger theory. The origin of the factors entering the result is clearly understood, in particular the effect of the asymmetry of the barriers of the potential. The method should appeal particularly to experimentalists searching for evidence of macroscopic spin tunneling.
Abstract: We investigate the quantum properties of fields generated by resonantly enhanced wave mixing based on atomic coherence in Raman systems. We show that such a process can be used for generation of pairs of Stokes and anti-Stokes fields with nearly perfect quantum correlations, yielding almost complete (i.e. 100%) squeezing without the use of a cavity. We discuss the extension of the wave mixing interactions into the domain of a few interacting light quanta.
Abstract: We predict the possibility of sharp, high-contrast resonances in the optical response of a broad class of systems, wherein interference effects are generated by coherent perturbation or interaction of dark states. The properties of these resonances can be manipulated to design a desired atomic response.
Abstract: The effect of intracavity Electromagnetically Induced Transparency on the properties of optical resonators and active laser devices is discussed theoretically. A pronounced frequency pulling and cavity linewidth narrowing are predicted. The effect can be used to substantially reduce classical and quantum phase noise of the beat-note of optical oscillators. Fundamental limits of this stabilization mechanism are discussed as well as its potential application to high-resolution spectroscopy.
Rewriting techniques have been applied successfully to various areas of symbolic computation. Here we consider the notion of prefix-rewriting and give a survey on its applications to the subgroup problem in combinatorial group theory. We will see that for certain classes of finitely presented groups finitely generated subgroups can be described through convergent prefix-rewriting systems, which can be obtained from a presentation of the group considered and a set of generators for the subgroup through a specialized Knuth-Bendix style completion procedure. In many instances a finite presentation for the subgroup considered can be constructed from such a convergent prefix-rewriting system, thus solving the subgroup presentation problem. Finally we will see that the classical procedures for computing Nielsen reduced sets of generators for a finitely generated subgroup of a free group and the Todd-Coxeter coset enumeration can be interpreted as particular instances of prefix-completion. Further, both procedures are closely related to the computation of prefix Gr"obner bases for right ideals in free group rings.
The light-cone Hamiltonian approach is applied to the super D2- brane, and the equivalent area-preserving and U(1) gauge-invariant effective Lagrangian, which is quadratic in the U(1) gauge field, is derived. The latter is recognised to be that of the three- dimensional U(1) gauge theory, interacting with matter supermultiplets, in a special external induced supergravity metric and the gravitino field, depending on matter fields. The duality between this theory and 11d supermembrane theory is demonstrated in the light-cone gauge.
The paper presents a process-oriented view on knowledge management in software development. We describe requirements on knowledge management systems from a process-oriented perspective, introduce a process modeling language MILOS and its use for knowledge management. Then we explain how a process-oriented knowledge management system can be implemented using advanced but available information technologies.
The paper addresses two problems of comprehensible proof presentation, the hierarchically structured presentation at the level of proof methods and different presentation styles of construction proofs. It provides solutions for these problems that can make use of proof plans generated by an automated proof planner.
A formalism is developed for calculating the quasienergy states and spectrum for time-periodic quantum systems when a time-periodic dynamical invariant operator with a nondegenerate spectrum is known. The method, which circumvents the integration of the Schr-odinger equation, is applied to an integrable class of systems, where the global invariant operator is constructed. Furthermore, a local integrable approximation for more general non-integrable systems is developed. Numerical results are presented for the doubleresonance model.
The lowest resonant frequency of a cavity resonator is usually approximated by the classical Helmholtz formula. However, if the opening is rather large and the front wall is narrow this formula is no longer valid. Here we present a correction which is of third order in the ratio of the diameters of aperture and cavity. In addition to the high accuracy it allows to estimate the damping due to radiation. The result is found by applying the method of matched asymptotic expansions. The correction contains form factors describing the shapes of opening and cavity. They are com- puted for a number of standard geometries. Results are compared with numerical computations.
The Kallianpur-Robbins law describes the long term asymptotic behaviour of the distribution of the occupation measure of a Brownian motion in the plane. In this paper we show that this behaviour can be seen at every typical Brownian path by choosing either a random time or a random scale according to the logarithmic laws of order three. We also prove a ratio ergodic theorem for small scales outside an exceptional set of vanishing logarithmic density of order three.
The pure-Skyrme limit of a scale-breaking Skyrmed O(3) sigma model in 1+1 dimensions is employed to study the effect of the Skyrme term on the semiclassical analysis of a field theory with instantons. The instantons of this model are self-dual and can be evaluated explicitly. They are also localised to an absolute scale, and their fluctuation action can be reduced to a scalar subsystem. This permits the explicit calculation of the fluctuation determinant and the shift in vacuum energy due to instantons. The model also illustrates the semiclassical quantisation of a Skyrmed field theory.
Convex Analysis
(1998)
Preface Convex analysis is one of the mathematical tools which is used both explicitly and indirectly in many mathematical disciplines. However, there are not so many courses which have convex analysis as the main topic. More often, parts of convex analysis are taught in courses like linear or nonlinear optimization, probability theory, geometry, location theory, etc.. This manuscript gives a systematic introduction to the concepts of convex analysis. A focus is set to the geometrical interpretation of convex analysis. This focus was one of the reasons why I have decided to restrict myself to the finite dimensional case. Another reason for this restriction is that in the infinite dimensional case many proofs become more difficult and more technical. Therefore, it would not have been possible (for me) to cover all the topics I wanted to discuss in this introductory text in the infinite dimensional case, too. Anyway, I am convinced that even for someone who is interested in the infinite dimensional case this manuscript will be a good starting point. When I offered a course in convex analysis in the Wintersemester 1997/1998 (upon which this manuscript is based) a lot of students asked me how this course fits in their own studies. Because this manuscript will (hopefully) be used by some students in the future, I will give here some of the possible statements to answer this very question. - Convex analysis can be seen as an extension of classical analysis, in which still we get many of the results, like a mean-value theorem, with less assumptions on the smoothness of the function. - Convex analysis can be seen as a foundation of linear and nonlinear optimization which provides many tools to handle concepts in optimization much easier (for example the Lemma of Farkas). - Finally, convex analysis can be seen as a link between abstract geometry and very algorithmic oriented computational geometry. As already explained before, this manuscript is based on a one semester course and therefore cannot cover all topics and discuss all aspects of convex analysis in detail. To guide the interested reader I have included a list of nice books about this subject at the end of the manuscript. It should be noted that the philosophy of this course follows [3], [4] and THE BOOK of modern convex analysis [6]. The geometrical emphasis however, is also related to intentions of [1].^L