Synthesis of Moduli of Uniform Continuity by the Monotone Dialectica Interpretation in the Proof-system MinLog

We extract on the computer a number of moduli of uniform continuity for the first few elements of a sequence of closed terms t of Gödel's T of type . The generic solution may then be quickly inferred by the human. The automated synthesis of such moduli proceeds from a proof of the hereditarily extensional equality (≈) of t to itself, hence a proof in a weakly extensional variant of Berger-Buchholz-Schwichtenberg's system Z of . We use an implementation on the machine, in Schwichtenberg's MinLog proof-system, of a non-literal adaptation to Natural Deduction of Kohlenbach's monotone functional interpretation. This new version of the Monotone Dialectica produces terms in NbE-normal form by means of a recurrent partial NbE-normalization. Such partial evaluation is strictly necessary.     

Combining OWL ontologies using -Connections

The standardization of the Web Ontology Language (OWL) leaves (at least) two crucial issues for Web-based ontologies unsatisfactorily resolved, namely how to represent and reason with multiple distinct, but linked ontologies, and how to enable effective knowledge reuse and sharing on the Semantic Web.In this paper, we present a solution for these fundamental problems based on -Connections. We aim to use -Connections to provide modelers with suitable means for developing Web ontologies in a modular way and to provide an alternative to the owl:imports construct.With such motivation, we present in this paper a syntactic and semantic extension of the Web Ontology language that covers -Connections of OWL-DL ontologies. We show how to use such an extension as an alternative to the owl:imports construct in many modeling situations. We investigate different combinations of the logics , and for which it is possible to design and implement reasoning algorithms, well-suited for optimization.Finally, we provide support for -Connections in both an ontology editor, SWOOP, and an OWL reasoner, Pellet.     

The Monte Carlo Event Generator AcerMC version 1.0 with interfaces to PYTHIA 6.2 and HERWIG 6.3

The AcerMC Monte Carlo Event Generator is dedicated for the generation of Standard Model background processes at pp LHC collisions. The program itself provides a library of the massive matrix elements and phase space modules for generation of a set of selected processes: , , , , and complete electroweak process. The hard process event, generated with one of these modules, can be completed by the initial and final state radiation, hadronization and decays, simulated with either PYTHIA or HERWIG Monte Carlo event generator. Interfaces to both of these generators are provided in the distribution version. The matrix element codes have been derived with the help of the MADGRAPH package. The phase-space generation is based on the multi-channel self-optimizing approach as proposed in NEXTCALIBUR event generator. Eventually, additional smoothing of the phase space was obtained by using a modified ac-VEGAS routine in order to improve the generation efficiency.     

-admissibility of the right-shift semigroup on

It is shown that the right-shift semigroup on does not satisfy the weighted Weiss conjecture for α(0,1). In other words, α-admissibility of scalar valued observation operators cannot always be characterised by a simple resolvent growth condition. This result is in contrast to the unweighted case, where 0-admissibility can be characterised by a simple growth bound. The result is proved by providing a link between discrete and continuous α-admissibility and then translating a counterexample for the unilateral shift on to continuous time systems.     

Full-rank representation of generalized inverse AT,S and its application

In this paper, we introduce a full-rank representation of the generalized inverse of a given complex matrix A, which is based on an arbitrary full-rank decomposition of G, where G is a matrix such that R(G)=T and N(G)=S. Using this representation, we introduce the minor of the generalized inverse ; as a special case of the minor, a determinantal representation of the generalized inverse is obtained. As an application, we use an example to demonstrate that this representation is correct.     

Delay-dependent filtering for time-delayed LPV systems

The present paper addresses the parameter-dependent filter design problem for output estimation in linear parameter varying (LPV) plants that include constant delays in the state. We develop LMI-based delay-dependent conditions to guarantee stability and an induced gain bound performance for the filtering error system. An explicit characterization of the filters’ state–space representation is given in terms of the solutions to a convex optimization problem associated with the synthesis conditions. By taking the output estimation error into account as the criterion, the developed filters are shown to be capable of tracking the desired outputs of the time-delayed parameter varying system in the presence of external disturbances. Two families of filters are examined: memoryless and state-delayed filters. The latter one which involves a delay term in its dynamics has the benefit of reducing the conservatism in the design and improving performance. Illustrative examples are provided to demonstrate the feasibility and advantages of the proposed methodologies for memoryless and state-delayed filter design and to validate the superiority of using the state-delayed configuration compared to the conventional memoryless filters.     

Reconstruction of a word from a multiset of its factors

Let be the multiset containing all factors of w of length k including repetitions. One of the main results is that if for all , then w=v. The bound is optimal; however we will also show that if for all , then w and v are structurally similar.     

Polyomino coloring and complex numbers

Usually polyominoes are represented as subsets of the lattice . In this paper we study a representation of polyominoes by Gaussian integers. Polyomino is represented by the set

Then we consider functions of type from the set of all polyominoes to an abelian group G, given by , where v is prime in (N(v) is the norm of v). Using the arithmetic of the ring we find necessary and sufficient conditions for such a function to be a coloring map.     

Interfaces as functors, programs as coalgebras—A final coalgebra theorem in intensional type theory

In [P. Hancock, A. Setzer, Interactive programs in dependent type theory, in: P. Clote, H. Schwichtenberg (Eds.), Proc. 14th Annu. Conf. of EACSL, CSL’00, Fischbau, Germany, 21–26 August 2000, Vol. 1862, Springer, Berlin, 2000, pp. 317–331, URL citeseer.ist.psu.edu/article/hancock00interactive.html; P. Hancock, A. Setzer, Interactive programs and weakly final coalgebras in dependent type theory, in: L. Crosilla, P. Schuster (Eds.), From Sets and Types to Topology and Analysis. Towards Practicable Foundations for Constructive Mathematics, Oxford Logic Guides, Clarendon Press, 2005, URL www.cs.swan.ac.uk/csetzer/] Hancock and Setzer introduced rules to extend Martin-Löf's type theory in order to represent interactive programming. The rules essentially reflect the existence of weakly final coalgebras for a general form of polynomial functor. The standard rules of dependent type theory allow the definition of inductive types, which correspond to initial algebras. Coalgebraic types are not represented in a direct way. In this article we show the existence of final coalgebras in intensional type theory for these kind of functors, where we require uniqueness of identity proofs () for the set of states and the set of commands which determine the functor. We obtain the result by identifying programs which have essentially the same behaviour, viz. are bisimular. This proves the rules of Setzer and Hancock admissible in ordinary type theory, if we replace definitional equality by bisimulation. All proofs [M. Michelbrink, Verifications of final coalgebra theorem in: Interfaces as Functors, Programs as Coalgebras—A Final Coalgebra Theorem in Intensional Type Theory, 2005, URL www.cs.swan.ac.uk/csmichel/] are verified in the theorem prover agda [C. Coquand, Agda, Internet, URL www.cs.chalmers.se/catarina/agda/; K. Peterson, A programming system for type theory, Technical Report, S-412 96, Chalmers University of Technology, Göteborg, 1982], which is based on intensional Martin-Löf type theory.     

Continuous-time interface for a micromachined capacitive accelerometer with NEA of 4 g and bandwidth of 300 Hz

A continuous-time accelerometer interface is feasible when a high dynamic range together with a wide signal band is required. In this paper the implementation of a continuous-time force-feedback loop for a capacitive sensor element with a full-scale signal of ±1.5 g is presented. The interface is measured to attain a noise equivalent acceleration (NEA) density of 500  at 30 Hz for the on-chip digitized output and 300  at 30 Hz for the analog output using a capacitive half-bridge sensor element with a single pair of electrodes. The essential circuit structures of the closed-loop sensor will be presented and analyzed in detail.     

Rewrite-Based Decision Procedures

The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an inference system generates finitely many clauses from the presentation of a theory and a finite set of ground unit clauses, then any fair strategy based on that system can be used as a -satisfiability procedure. In this paper, we introduce a set of sufficient conditions to generalize the entire framework of rewrite-based -satisfiability procedures to rewrite-based -decision procedures. These conditions, collectively termed subterm-inactivity, will allow us to obtain rewrite-based -decision procedures for several theories, namely those of equality with uninterpreted functions, arrays with or without extensionality and two of its extensions, finite sets with extensionality and recursive data structures.     

First-principles study of ground-state properties and phase stability of vanadium nitrides

Using a series of density functional electronic structure total energy calculations, we have systematically studied the ground-state properties and phase stability of vanadium nitrides. Comparison of enthalpy of formation shows that V ₂N is equally stable (polymorphic) in , and Fe₂C phases within a few meV. Formation enthalpy of the various phases considered for perfect stoichiometric V N_1.0 shows that it has enhanced stability in hexagonal WC and NiAs structures in relation to NaCl-type δ-phase. The TiAs phase of VN has nearly same energy as NaCl structure. Comparison of energetics of -type , for x=0 and 0.3333 and of , for x=0, 0.0625, 0.125 and 0.25 shows that vacancies on the nitrogen sublattice lowers the formation enthalpy in relation to respective stoichiometric phases which is in agreement with experiments, as bulk vanadium nitrides are known to be generally non-stoichiometric. The calculated dilute heat of solution for the interstitial nitrogen is found to be in good agreement with experimental values and shows that nitrogen prefers to occupy the octahedral sites in bcc vanadium. The α^′-FeN and martensite structures, considered for the metastable phases of vanadium nitrides, have higher formation enthalpy in relation to equilibrium phases. Analysis of electronic density of states of V ₂N shows that the low energy , and Fe₂C phases are characterized by broad V 3d-N 2p and V 3d bonding bands. Density of states of VN shows that in the low energy WC and NiAs phases some of the antibonding states are made empty, leading to a minimum near the Fermi level. For and , density of states shows that vacancies on the nitrogen sublattice introduce additional filled states in the 3d band below Fermi level enabling enhanced bonding. Comparison between bulk moduli and atomic volumes for the various phases of vanadium nitrides shows that higher bulk moduli are dominated by increased V–N bonds combined with low atomic volumes.     

The global existence of nonlinear observers with linear error dynamics: A topological point of view

In this paper we show that under suitable assumptions, there exists a global homeomorphism Ψ(=Φ^-1) of which maps a nonlinear system onto a linear system with output injection . Thus, an observer for state x can be directly constructed as , which is a generalized version of Luenberger observer. An important feature of the obtained result is that there is no need to find the corresponding change of coordinates Ψ explicitly, which is different from current various existing approaches.     

-parameter: A local truncation error based adaptive framework for finite volume compressible flow solvers

A residual-based strategy to estimate the local truncation error in a finite volume framework for steady compressible flows is proposed. This estimator, referred to as the -parameter, is derived from the imbalance arising from the use of an exact operator on the numerical solution for conservation laws. The behaviour of the residual estimator for linear and non-linear hyperbolic problems is systematically analysed. The relationship of the residual to the global error is also studied. The -parameter is used to derive a target length scale and consequently devise a suitable criterion for refinement/derefinement. This strategy, devoid of any user-defined parameters, is validated using two standard test cases involving smooth flows. A hybrid adaptive strategy based on both the error indicators and the -parameter, for flows involving shocks is also developed. Numerical studies on several compressible flow cases show that the adaptive algorithm performs excellently well in both two and three dimensions.     

Synthetic- control charts optimized for in-control and out-of-control regions

There are real industrial cases where small shifts in the quality of a productive process do not need to be detected, but, at the same time, it is necessary to maintain the performance of the control chart to detect large shifts which are considered important. In this paper the optimization, zero- and steady-state cases, of the synthetic- control chart is studied (standard, side-sensitive, group runs and side-sensitive group runs versions) with the aim of not detecting shifts in a region of admissible shifts (in-control region) and, at the same time, being able to detect shifts considered important (out-of-control region). Genetic algorithms have been employed to solve this optimization problem and user-friendly software has been developed with the objective of helping users to select the best synthetic- chart for the process. On the other hand, a comparison is made with the optimized EWMA chart for this in-control and out-of-control optimization problem.     

Robustness of exponential stability of a class of stochastic functional differential equations with infinite delay

We regard the stochastic functional differential equation with infinite delay as the result of the effects of stochastic perturbation to the deterministic functional differential equation , where is defined by x_t(θ)=x(t+θ),θ(−∞,0]. We assume that the deterministic system with infinite delay is exponentially stable. In this paper, we shall characterize how much the stochastic perturbation can bear such that the corresponding stochastic functional differential system still remains exponentially stable.     

HiggsBounds 2.0.0: Confronting neutral and charged Higgs sector predictions with exclusion bounds from LEP and the Tevatron

HiggsBounds 2.0.0 is a computer code which tests both neutral and charged Higgs sectors of arbitrary models against the current exclusion bounds from the Higgs searches at LEP and the Tevatron. As input, it requires a selection of model predictions, such as Higgs masses, branching ratios, effective couplings and total decay widths. HiggsBounds 2.0.0 then uses the expected and observed topological cross section limits from the Higgs searches to determine whether a given parameter scenario of a model is excluded at the 95% C.L. by those searches. Version 2.0.0 represents a significant extension of the code since its first release (1.0.0). It includes now 28/53 LEP/Tevatron Higgs search analyses, compared to the 11/22 in the first release, of which many of the ones from the Tevatron are replaced by updates. As a major extension, the code allows now the predictions for (singly) charged Higgs bosons to be confronted with LEP and Tevatron searches. Furthermore, the newly included analyses contain LEP searches for neutral Higgs bosons (H) decaying invisibly or into (non-flavour tagged) hadrons as well as decay-mode independent searches for neutral Higgs bosons, LEP searches via the production modes τ⁺τ⁻H and , and Tevatron searches via . Also, all Tevatron results presented at the ICHEP?10 are included in version 2.0.0. As physics applications of HiggsBounds 2.0.0 we study the allowed Higgs mass range for model scenarios with invisible Higgs decays and we obtain exclusion results for the scalar sector of the Randall–Sundrum model using up-to-date LEP and Tevatron direct search results.

Program summary

Program title: HiggsBoundsCatalogue identifier: AEFF_v2_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEFF_v2_0.htmlProgram obtainable from: CPC Program Library, Queen?s University, Belfast, N. IrelandLicensing provisions: GNU General Public Licence version 3No. of lines in distributed program, including test data, etc.: 74 005No. of bytes in distributed program, including test data, etc.: 1 730 996Distribution format: tar.gzProgramming language: Fortran 77, Fortran 90 (two code versions are offered).Classification: 11.1.Catalogue identifier of previous version: AEFF_v1_0Journal reference of previous version: Comput. Phys. Comm. 181 (2010) 138External routines: HiggsBounds requires no external routines/libraries. Some sample programs in the distribution require the programs FeynHiggs 2.7.1 or CPsuperH2.2 to be installed.Does the new version supersede the previous version?: YesNature of problem: Determine whether a parameter point of a given model is excluded or allowed by LEP and Tevatron neutral and charged Higgs boson search results.Solution method: The most sensitive channel from LEP and Tevatron searches is determined and subsequently applied to test this parameter point. The test requires as input, model predictions for the Higgs boson masses, branching ratios and ratios of production cross sections with respect to reference values.Reasons for new version: This version extends the functionality of the previous version.Summary of revisions: List of included Higgs searches has been expanded, e.g. inclusion of (singly) charged Higgs boson searches. The input required from the user has been extended accordingly.Restrictions: Assumes that the narrow width approximation is applicable in the model under consideration and that the model does not predict a significant change to the signature of the background processes or the kinematical distributions of the signal cross sections.Running time: About 0.01 seconds (or less) for one parameter point using one processor of an Intel Core 2 Quad Q6600 CPU at 2.40 GHz for sample model scenarios with three Higgs bosons. It depends on the complexity of the Higgs sector (e.g. the number of Higgs bosons and the number of open decay channels) and on the code version.     

Minimality considerations for graph energy over a class of graphs

Let G be a graph on n vertices, and let CHP(G;λ) be the characteristic polynomial of its adjacency matrix A(G). All n roots of CHP(G;λ), denoted by , are called to be its eigenvalues. The energy E(G) of a graph G, is the sum of absolute values of all eigenvalues, namely, . Let be the set of n-vertex unicyclic graphs, the graphs with n vertices and n edges. A fully loaded unicyclic graph is a unicyclic graph taken from with the property that there exists no vertex with degree less than 3 in its unique cycle. Let be the set of fully loaded unicyclic graphs. In this article, the graphs in with minimal and second-minimal energies are uniquely determined, respectively.     

Ab initio calculations of NO2 and SO2 chemisorption onto non-polar ZnO surfaces

The authors present an ab initio study of NO₂ and SO₂ chemisorption onto non-polar ZnO and ZnO surfaces with the aim of providing theoretical hints for further developments in gas sensors. From first principles calculations (DFT-GGA approximation), the most relevant surface reduction scenarios are analyzed and, subsequently, considered in the chemisorption study. First, calculations indicate that NO₂ adsorbs avidly onto Zn surface atoms. This is compatible with the oxidizing character of NO₂. Second, results also explain the sensor poisoning by SO₂ adsorption (since this molecule competes with NO₂ for the same adsorption sites) and indicate that poisoning can only be reverted at typical operation temperatures (T ≤ 700 °C) in the case of stoichiometric ZnO surfaces.