The inevitable proliferation of expert systems underscores the need for robust, friendly interfaces requiring minimal user training. The objective of the XCALIBUR project is to meet this need by providing natural comprehension and generation in the context of a focused mixed-initiative dialog. The XCALIBUR architecture is discussed, including its three central components (parser, generator and ...

The Next-To-Minimal-Supersymmetric extension of the Standard Model (NMSSM) has been in the focus of extensive studies in the past two decades. In anticipation of the LHC era, the interest in automatized tools that can calculate collider signatures has grown. We present the implementation of the NMSSM into the event generator WHIZARD. In addition to a brief review of the implementation, we discu...

We introduce a generic framework for proof carrying code, developed and mechanically verified in Isabelle/HOL. The framework defines and proves sound a verification condition generator with minimal assumptions on the underlying programming language, safety policy, and safety logic. We demonstrate its usability for prototyping proof carrying code systems by instantiating it to a simple assembly ...

Phenomenological studies of quantum gravity have proposed a modification the commutator between position and momentum in mechanics so to introduce minimal uncertainty mechanics. Such consequent measurable length important consequences on dynamics systems. In present work, we show that such go beyond dynamics, reaching definition quantities as energy, momentum, same Hamiltonian. Furthermore, sin...

in this article our objective is to obtain steady state characteristics of shunt, series, and separately excited dc motors coupled with a centrifugal water pump supplied through a step-up, step-down, and cuk converter from photovoltaic generator. we assume that there are no storage batteries and, of course, the system must operate on maximum utilization i.e. maximum water must be pumped. it is ...

Let R be a finite chain ring (e.g. a Galois ring), K its residue field and C a linear code over R. We prove that d(C), the Hamming distance of C, is d((C : α)), where (C : α) is a submodule quotient, α is a certain element of R and denotes the canonical projection to K. These two codes also have the same set of minimal codeword supports. We explicitly construct a generator matrix/polynomial of ...

We adopt in this paper the newly developed composite nonlinear feedback (CNF) control method to track general target references for systems with input saturation. The original formulation of the CNF control technique is only applicable to set-point tracking, in which the target reference is set to be a constant. In this paper, a reference generator, which is able to produce more general referen...

One of the vexing problems that besets concurrent use of multiple, heterogeneous resources is format multiplicity. C(2)M aims to equip scientists with a wrapper generator on their desktop. The wrapper generator can build wrappers, or converters that can convert data from or into different formats, from a high-level description of the formats. The language in which such a high-level description ...

We present new, efficient algorithms for computations on separable matrix algebras over infinite fields. We provide a probabilistic method of the Monte Carlo type to find a generator for the centre of a given algebra A ⊆ Fm×m over an infinite field F. The number of operations used is within a logarithmic factor of the cost of solving m×m systems of linear equations. A Las Vegas algorithm is als...

We present new, e cient algorithms for computations on separable matrix algebras over in nite elds. We provide a probabilistic of the Monte Carlo type to nd a generator for the centre of a given algebra A Fm m over an in nite eld F using a number of operations that is within a logarithmic factor of the cost of solving m m systems of linear equations. A Las Vegas algorithm is also provided under...