Search results for " Order"

Congenital neutropenia with retinopathy, a new phenotype without intellectual deficiency or obesity secondary toVPS13Bmutations

2013

Over one hundred VPS13B mutations are reported in Cohen syndrome (CS). Most cases exhibit a homogeneous phenotype that includes intellectual deficiency (ID), microcephaly, facial dysmorphism, slender extremities, truncal obesity, progressive chorioretinal dystrophy, and neutropenia. We report on a patient carrying two VPS13B splicing mutations with an atypical phenotype that included microcephaly, retinopathy, and congenital neutropenia, but neither obesity nor ID. RNA analysis of the IVS34+2T_+3AinsT mutation did not reveal any abnormal splice fragments but mRNA quantification showed a significant decrease in VPS13B expression. RNA sequencing analysis up- and downstream from the IVS57+2T>C…

Examining the effects of birth order on personality.

2015

This study examined the long-standing question of whether a person’s position among siblings has a lasting impact on that person’s life course. Empirical research on the relation between birth order and intelligence has convincingly documented that performances on psychometric intelligence tests decline slightly from firstborns to laterborns. By contrast, the search for birth-order effects on personality has not yet resulted in conclusive findings. We used data from three large national panels from the United States (N = 5,240), Great Britain (N = 4,489), and Germany (N = 10,457) to resolve this open research question. This data base allowed us to identify even very small effects of birth o…

Aminoacid zwitterions in solution : Geometric, energetic, and vibrational analysis using density functional theory-continuum model calculations

1998

Glycine and alanine aminoacids chemistry in solution is explored using a hybrid three parameters density functional (B3PW91) together with a continuum model. Geometries, energies, and vibrational spectra of glycine and alanine zwitterions are studied at the B3PW91/6-31+G∗∗ level and the results compared with those obtained at the HF and MP2/6-31+G∗∗ levels. Solvents effects are incorporated by means of an ellipsoidal cavity model with a multipolar expansion (up to sixth order) of the solute’s electrostatic potential. Our results confirm the validity of the B3PW91 functional for studying aminoacid chemistry in solution. Taking into account the more favorable scaling behavior of density funct…

Characters that agree on prime-power-order elements

2003

On stability issues for IMEX schemes applied to 1D scalar hyperbolic equations with stiff reaction terms

2011

The application of a Method of Lines to a hyperbolic PDE with source terms gives rise to a system of ODEs containing terms that may have very different stiffness properties. In this case, Implicit-Explicit Runge-Kutta (IMEX-RK) schemes are particularly useful as high order time integrators because they allow an explicit handling of the convective terms, which can be discretized using the highly developed shock capturing technology, together with an implicit treatment of the source terms, necessary for stability reasons. Motivated by the structure of the source term in a model problem introduced by LeVeque and Yee in [J. Comput. Phys. 86 (1990)], in this paper we study the preservation of ce…

Forcing for First-Order Languages from the Perspective of Rasiowa–Sikorski Lemma

2017

The paper is concerned with the problem of building models for first-order languages from the perspective of the classic paper of Rasiowa and Sikorski [9]. The central idea, developed in this paper, consists in constructing first-order models from individual variables. The key notion of a Rasiowa–Sikorski set of formulas for an arbitrary countable language L is examined. Each Rasiowa–Sikorski set defines a countable model for L . Conversely, every countable model for L is determined by a Rasiowa–Sikorski set. The focus is on constructing Rasiowa–Sikorski sets by applying forcing techniques restricted to Boolean algebras arising from the subsets of the set of atomic formulas of L .

Stubborn sets, frozen actions, and fair testing

2021

Many partial order methods use some special condition for ensuring that the analysis is not terminated prematurely. In the case of stubborn set methods for safety properties, implementation of the condition is usually based on recognizing the terminal strong components of the reduced state space and, if necessary, expanding the stubborn sets used in their roots. In an earlier study it was pointed out that if the system may execute a cycle consisting of only invisible actions and that cycle is concurrent with the rest of the system in a non-obvious way, then the method may be fooled to construct all states of the full parallel composition. This problem is solved in this study by a method tha…

About Quotient Orders and Ordering Sequences

2017

Summary In preparation for the formalization in Mizar [4] of lotteries as given in [14], this article closes some gaps in the Mizar Mathematical Library (MML) regarding relational structures. The quotient order is introduced by the equivalence relation identifying two elements x, y of a preorder as equivalent if x ⩽ y and y ⩽ x. This concept is known (see e.g. chapter 5 of [19]) and was first introduced into the MML in [13] and that work is incorporated here. Furthermore given a set A, partition D of A and a finite-support function f : A → ℝ, a function Σ f : D → ℝ, Σ f (X)= ∑ x∈X f(x) can be defined as some kind of natural “restriction” from f to D. The first main result of this article ca…

A constructive semantics for non-deducibility

2008

This paper provides a constructive topological semantics for non-deducibility of a first order intuitionistic formula. Formal topology theory, in particular the recently introduced notion of a binary positivity predicate, and co-induction are two needful tools. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)

Unification in first-order transitive modal logic

2019

We introduce unification in first-order transitive modal logics, i.e. logics extending Q–K4, and apply it to solve some problems such as admissibility of rules. Unifiable formulas in some extensions of Q–K4 are characterized and an explicit basis for the passive rules (those with non-unifiable premises) is provided. Both unifiability and passive rules depend on the number of logical constants in the logic; we focus on extensions of Q–K4 with at most four constants ⊤,⊥,□⊥,◊⊤⁠. Projective formulas, defined in a way similar to propositional logic, are used to solve some questions concerning the disjunction and existence properties. A partial characterization of first-order modal logics with pr…