bluuebunny/crossref_metadata_2025_split huggingface dataset:
Early Development of Visceral Fat Excess after Spontaneous Catch-Up Growth in Children with Low Birth Weight
Authors: Ibáñez Lourdes , Suárez Larisa , Lopez-Bermejo Abel , Díaz Marta , Valls Carme , de Zegher Francis 
Published: December 2007

Abstract
Context: The sequence of prenatal growth restraint and infantile catch-up of weight is by the age of 4 yr associated with hyperinsulinemic adiposity. We studied whether the adiposity of post-catch-up children born small for gestational age (SGA) is further amplified between age 4 and 6 yr and whether visceral fat excess has already emerged by the age of 6 yr.
Setting: The study took place at a university hospital.
Study Population and Design: A longitudinal cohort (age 2–6 yr) of 22 children born appropriate for gestational age (AGA) and 29 born SGA were studied. Auxological, endocrine, metabolic, and body composition (by absorptiometry) assessments were made at 2, 4, and 6 yr, and visceral fat was assessed (by magnetic resonance imaging) at 6 yr.
Main Outcomes: Outcome measures included fasting glucose, insulin, IGF-I, neutrophil to lymphocyte ratio, lean mass, and total, abdominal, and visceral fat mass.
Results: Between ages 4–6 yr, the relative adiposity of SGA children was further amplified. Between ages 2–6 yr, SGA children gained more total and abdominal fat and raised their insulin, IGF-I, and neutrophil to lymphocyte ratio more than did AGA children (all P &lt; 0.0001). At age 6 yr, the average amount of visceral fat was in SGA children more than 50% higher than in AGA children (P &lt; 0.005). The 0- to 2-yr increment in weight Z-score together with the 2- to 6-yr increment in fasting insulin accounted for 62% of visceral fat variability at age 6 yr.
Conclusion: The amount of visceral fat is in post-catch-up SGA children excessive by the age of 6 yr. In populations at risk for type 2 diabetes or metabolic syndrome after fetal growth restraint, the time window for early intervention may have to be advanced into prepubertal childhood.
Specific Fixed Aqueous Layer of Three-component Hybrid Liposomes Related to Inhibition of Hepatoma Cells Growth
Authors: Matsumoto Yoko , Tanaka Yoshihiro , Goto Koichi , Ueoka Ryuichi 
Published: December 2007

Abstract
It is noteworthy that the thickness of fixed aqueous layer (TFAL) of three-component hybrid liposomes (THL) composed of l-α-dimyristoylphosphatidylcholine (DMPC), polyoxyethylene (20) sorbitan monolaurate (Tween 20), and decyl-β-lactopranoside (LactC10) (DMPC:Tween 20:LactC10 = 65:7:28) was about twice that of two-component hybrid liposomes (HL) composed of DMPC and Tween 20. It is also attractive that THL could remarkably inhibit the growth of hepatoma cells.
Mixed-potential-type Zirconia-based Sensor Using In2O3 Sensing-Electrode for Selective Detection of Methane at High Temperature
Authors: Ueda Taro , Elumalai Perumal , Plashnitsa Vladimir V , Miura Norio 
Published: December 2007

Abstract
We have fabricated a mixed-potential-type yttria-stabilized zirconia (YSZ)-based sensor and examined its sensing characteristics to methane (CH4) at high operating temperatures. Among various oxide sensing electrodes (SEs) tested, In2O3 was found to give the highest sensitivity as well as good selectivity to CH4 at 790 °C, although the response was very slow. To improve the response rate, sintering temperature of In2O3-SE was changed in the range of 1200–1400 °C. As a result, the sensor attached with the 1300 °C-sintered In2O3-SE showed quicker response which was about fifteen times higher than that for the 1400 °C-sintered In2O3-SE.
Preliminary data of life and health insurance in the Roman Law (The collegium funeraticium and the collegium tenuiorum)
Authors: Váradi Ágnes 
Published: December 2007

A modern biztosításnak, illetve magának a biztosítási szerződéseknek a története rövid, alig 200 évre tekint vissza. A különböző finanszírozási, biztosítási és kockázatelemzési módszerek létére már az ókori jogrendszerek – görög és római jog – szabályozásában is találunk utalásokat. –	Az élet- és egészségbiztosítások római jogi előképeiként a
collegium funeraticium
(a temetkezési egyesület) és a
collegium tenuiorum
(beteggondozás céljára létrejött egyesület) értékelhető. Ezeknek az egyesületeknek a
collegium
ok szabályozásának általános római jogi rendszerében elfoglalt helyét, egyes egyedi sajátosságait, szervezetét és céljait vizsgálom a Corpus Iuris Civilis, illetőleg a Digesta fragmentumai, valamint hazai és német, angol illetve orosz római jogi szakirodalom felhasználásával. – Mindezek ismeretében teljessé válhat egy olyan „kis fejlődéstörténet”, mely ha közvetlenül nem is járul hozzá a biztosítási rendszer mai működtetéséhez, de mindenképpen feltár egyfajta belső logikát, mely megalapozhatja a szerves fejlődést a biztosítási jog területén. S egyben bizonyítja, hogy a római jogi alapoknak ma is van létjogosultságuk a szerződési jogban.
From Means to QTL: The Illinois Long‐Term Selection Experiment as a Case Study in Quantitative Genetics
Authors: Dudley J.W. 
Published: December 2007

ABSTRACTDivergent selection for oil and protein concentration in the corn (Zea mays L.) kernel was initiated at the University of Illinois in 1896 by C.G. Hopkins. In 2005, 106 generations of selection had been completed for high oil and 105 for high protein. Limits to selection for low oil and low protein were reached but not for high oil or high protein. Over the more than 100 yr of the existence of the program a number of attempts have been made to analyze the experiment using quantitative genetic tools. The purpose of this paper is to trace the use of quantitative genetic techniques to analyze the results of divergent long‐term selection for oil and protein, to relate results to the question of the need for divergent parents for quantitative trait locus (QTL) analysis, and to provide a new look at the reasons for long‐continued progress from selection. Key findings include (i) progress from selection was much greater than could have been predicted; (ii) based on both classical quantitative genetic analysis and QTL studies, a large number of QTL are involved in control of the three traits; (iii) the number of QTL identified in a given study cannot be predicted by the magnitude of genetic variance or the divergence of the parents but is a function of the number of markers used and the number of lines evaluated; and (iv) epistasis may be an important factor in explaining long‐term response to selection.
A Mini Axial and a Permanent Maglev Radial Heart Pump§
Authors: Qian Kun-Xi , Ru Wei-Min , Wang Hao , Jing Teng 
Published: December 2007

The implantability and durability have been for decades the focus of artificial heart R&D. A mini axial and a maglev radial pump have been developed to meet with such requirements.
The mini axial pump weighing 27g (incl.5g rotor) has an outer diameter of 21mm and a length of 10mm in its largest point, but can produce a maximal blood flow of 6l/min with 50mmHg pressure increase. Therefore, it is suitable for the patients of 40-60kg body weight. For other patients of 60-80kg or 80-100kg body weight, the mini axial pumps of 23mm and 25mm outer diameter had been developed before, these devices were acknowledged to be the world smallest LVADs by Guinness World Record Center in 2004.
The permanent maglev radial pump weighing 150g is a shaft-less centrifugal pump with permanent magnetic bearings developed by the author. It needs no second coil for suspension of the rotor except the motor coil, different from all other maglev pumps developed in USA, Japan, European, etc. Thus no detecting and controlling systems as well as no additional power supply for maglev are necessary. The pump can produce a blood flow up to as large as 10l/min against 100mmHg pressure.
An implantable and durable blood pump will be a viable alternative to natural donor heart for transplantation.
2-Exp Time lower bounds for propositional dynamic logics with intersection
Authors: Lange Martin , Lutz Carsten 
Published: December 2007

AbstractIn 1984. Danecki proved that satisfiability in IPDL, i.e., Propositional Dynamic Logic (PDL) extended with an intersection operator on programs, is decidabie in deterministic double exponential time. Since then, the exact complexity of IPDL has remained an open problem: the best known lower bound was the ExpTime one stemming from plain PDL until, in 2004. the first author established ExpSpace-hardness. In this paper, we finally close the gap and prove that IPDL is hard for 2-ExpTime. thus 2-ExpTime-complete. We then sharpen our lower bound, showing that it even applies to IPDL without the test operator interpreted on tree structures.
Induction and inductive definitions in fragments of second order arithmetic
Authors: Aehlig Klaus 
Published: December 2007

AbstractA fragment with the same provably recursive functions as n iterated inductive definitions is obtained by restricting second order arithmetic in the following way. The underlying language allows only up to n + 1 nested second order quantifications and those are in such a way. that no second order variable occurs free in the scope of another second order quantifier. The amount of induction on arithmetical formulae only affects the arithmetical consequences of these theories, whereas adding induction for arbitrary formulae increases the strength by one inductive definition.
An alternative semantics for quantified relevant logic
Authors: Mares Edwin D. , Goldblatt Robert 
Published: December 2007

AbstractThe quantified relevant logic RQ is given a new semantics in which a formula ∀xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are modelled as functions from variable-assignments to propositions, where a proposition is a set of worlds in a relevant model structure. A completeness proof is given for a basic quantificational system QR from which RQ is obtained by adding the axiom EC of ‘extensional confinement’: ∀x(A ⋁ B) → (A ⋁ ∀xB), with x not free in A. Validity of EC requires an additional model condition involving the boolean difference of propositions. A QR-model falsifying EC is constructed by forming the disjoint union of two natural arithmetical structures in which negation is interpreted by the minus operation.
Iterates of the core model
Authors: Schindler Ralf 
Published: December 2007

AbstractLetNbe a transitive model of ZFC such that “N⊂NandP(ℝ) ⊂N. Assume that bothVandNsatisfy “the core modelKexists.” ThenKNis an iterate ofK, i.e., there exists an iteration treeFonKsuch thatFhas successor length and. Moreover, if there exists an elementary embedding π:V→Nthen the iteration map associated to the main branch ofFequals π յK. (This answers a question of W. H. Woodin, M. Gitik, and others.) The hypothesis thatP(ℝ) ⊂Nis not needed if there does not exist a transitive model of ZFC with infinitely many Woodin cardinals.
Structure with fast elimination of quantifiers
Authors: Prunescu Mihai 
Published: December 2007

AbstractA structure of finite signature is constructed so that: for all existential formulas and for all tuples of elements of the same length as the tuple one can decide in a quadratic time depending only on the length of the formula, if holds in the structure. In other words, the structure satisfies the relativized model-theoretic version of P=N P in the sense of [4]. This is a model-theoretical approach to results of Hemmerling and Gaßner.
Bounded modified realizability
Authors: Ferreira Fernando , Nunes Ana 
Published: December 2007

AbstractWe define a notion of realizability, based on a new assignment of formulas, which does not care for precise witnesses of existential statements, but only for bounds for them. The novel form of realizability supports a very general form of the FAN theorem, refutes Markov's principle but meshes well with some classical principles, including the lesser limited principle of omniscience and weak König's lemma. We discuss some applications, as well as some previous results in the literature.
Complexity, decidability and completeness
Authors: Cenzer Douglas , Remmel Jeffrey B. 
Published: December 2007

AbstractWe give resource bounded versions of the Completeness Theorem for propositional and predicate logic. For example, it is well known that every computable consistent propositional theory has a computable complete consistent extension. We show that, when length is measured relative to the binary representation of natural numbers and formulas, every polynomial time decidable propositional theory has an exponential time (EXPTIME) complete consistent extension whereas there is a nondeterministic polynomial time (NP) decidable theory which has no polynomial time complete consistent extension when length is measured relative to the binary representation of natural numbers and formulas. It is well known that a propositional theory is axiomatizable (respectively decidable) if and only if it may be represented as the set of infinite paths through a computable tree (respectively a computable tree with no dead ends). We show that any polynomial time decidable theory may be represented as the set of paths through a polynomial time decidable tree. On the other hand, the statement that every polynomial time decidable tree represents the set of complete consistent extensions of some theory which is polynomial time decidable, relative to the tally representation of natural numbers and formulas, is equivalent to P = NP. For predicate logic, we develop a complexity theoretic version of the Henkin construction to prove a complexity theoretic version of the Completeness Theorem. Our results imply that that any polynomial space decidable theory Δ possesses a polynomial space computable model which is exponential space decidable and thus Δ has an exponential space complete consistent extension. Similar results are obtained for other notions of complexity.
Determinacy for games ending at the first admissible relative to the play
Authors: Neeman Itay 
Published: December 2007

AbstractLet o(k) denote the Mitchell order of k. We show how to reduce long games which run to the first ordinal admissible in the play, to iteration games on models with a cardinal k so that (1) k is a limit of Woodin cardinals: and (2) o(k) = k++. We use the reduction to derive several optimal determinacy results on games which run to the first admissible in the play.
Enumerations of the Kolmogorov function
Authors: Beigel Richard , Buhrman Harry , Fejer Peter , Fortnow Lance , Grabowski Piotr , Longpré Luc , Muchnik Andrej , Stephan Frank , Torenvliet Leen 
Published: December 2007

AbstractA recursive enumerator for a function h is an algorithm f which enumerates for an input x finitely many elements including h(x). f is a k(n)-enumerator if for every input x of length n. h(x) is among the first k(n) elements enumerated by f. If there is a k(n)-enumerator for h then h is called k(n)-enumerable. We also consider enumerators which are only A-recursive for some oracle A.
Shelah's categoricity conjecture from a successor for tame abstract elementary classes
Authors: Grossberg Rami , Vandieren Monica 
Published: December 2007

AbstractWe prove a categoricity transfer theorem for tame abstract elementary classes.Suppose thatKis a χ-tame abstract elementary class and satisfies the amalgamation and joint embedding properties and has arbitrarily large models. Letλ ≥ Max{χ, LS(K+}.If K is categorical in λ and λ+, then K is categorical in λ++.Combining this theorem with some results from [37]. we derive a form of Shelah's Categoricity Conjecture for tame abstract elementary classes:Suppose K is χ-tame abstract elementary class satisfying the amalgamation and joint embedding properties. Letμ0≔ Hanf(K).Ifand K is categorical in somethen K is categorical in μ for allμ.
0-D-valued fields
Authors: Guzy Nicolas 
Published: December 2007

AbstractIn [12]. T. Scanlon proved a quantifier elimination result for valued D-fields in a three-sorted language by using angular component functions. Here we prove an analogous theorem in a different language which was introduced by F. Delon in her thesis. This language allows us to lift the quantifier elimination result to a one-sorted language by a process described in the Appendix. As a byproduct, we state and prove a “positivstellensatz” theorem for the differential analogue of the theory of real-series closed fields in the valued D-field setting.
The proof-theoretic analysis of transfinitely iterated quasi least fixed points
Authors: Probst Dieter 
Published: December 2007

AbstractThe starting point of this article is an old question asked by Feferman in his paper on Hancock's conjecture [6] about the strength of . This theory is obtained from the well-known theory ID1 by restricting fixed point induction to formulas that contain fixed point constants only positively. The techniques used to perform the proof-theoretic analysis of also permit to analyze its transfinitely iterated variants . Thus, we eventually know that
The complexity of analytic tableaux
Authors: Arai Noriko H. , Pitassi Toniann , Urquhart Alasdair 
Published: December 2007

AbstractThe method of analytic tableaux is employed in many introductory texts and has also been used quite extensively as a basis for automated theorem proving. In this paper, we discuss the complexity of the system as a method for refuting contradictory sets of clauses, and resolve several open questions. We discuss the three forms of analytic tableaux: clausal tableaux, generalized clausal tableaux, and binary tableaux. We resolve the relative complexity of these three forms of tableaux proofs and also resolve the relative complexity of analytic tableaux versus resolution. We show that there is a quasi-polynomial simulation of tree resolution by analytic tableaux; this simulation is close to optimal, since we give a matching lower bound that is tight to within a polynomial.
Finite satisfiability and ℵ0-categorical structures with trivial dependence
Authors: Djordjević Marko 
Published: December 2007

The main subject of the article is the finite submodel property for ℵ0-categorical structures, in particular under the additional assumptions that the structure is simple, 1-based and has trivial dependence. Here, a structure has the finite submodel property if every sentence which is true in the structure is true in a finite substructure of it. It will be useful to consider a couple of other finiteness properties, related to the finite submodel property, which are variants of the usual concept of saturation.For the rest of the introduction we will assume that M is an ℵ0-categorical (infinite) structure with a countable language. We also assume that there is an upper bound to the arity of the function symbols in M:s language and that, for every 0 < n < ℵ0 and R ⊆ Mn which is definable in M without parameters, there exists a relation symbol, in the language of M, which is interpreted as R; these assumptions are not necessary for most results to be presented, but it simplifies the statement of a result which I mention in this introduction.First we will consider ‘canonically embedded’ substructures of Meq. Here, a structure N is canonically embedded in Meq if N's universe is a subset of Meq which is definable without parameters and, for every 0 < n < ℵ0 and R ⊆ Nn which is ε-definable in Meq there is a relation symbol in the language of N which is interpreted as R; we also assume that the language of N has no other relation (or function or constant) symbols.
Universal spaces for classes of scattered eberlein compact spaces
Authors: Bell Murray , Marciszewski Witold 
Published: December 2007

AbstractWe discuss the existence of universal spaces (either in the sense of embeddings or continuous images) for some classes of scattered Eberlein compacta. Given a cardinal κ, we consider the class δκof all scattered Eberlein compact spaces K of weight ≤ κ and such that the second Cantor-Bendixson derivative of K is a singleton. We prove that if κ is an uncountable cardinal such that κ = 2≤κ, then there exists a space X in δκ such that every member of δκ is homeomorphic to a retract of X. We show that it is consistent that there does not exist a universal space (either by embeddings or by mappings onto) in . Assuming that = ω1, we prove that there exists a space X ∈ which is universal in the sense of embeddings. We also show that it is consistent that there exists a space X bΕ, universal in the sense of embeddings, but δω1 does not contain an universal element in the sense of mappings onto.
Degrees of monotone complexity
Authors: Calhoun William C. 
Published: December 2007

AbstractLevin and Schnorr (independently) introduced the monotone complexity, Km (α), of a binary string α. We use monotone complexity to define the relative complexity (or relative randomness) of reals. We define a partial ordering ≤Km on 2ω by α ≤Km β iff there is a constant c such that Km(α | n) ≤ Km(β | n)+ c for all n. The monotone degree of α is the set of all β such that α Km β and β Km α. We show the monotone degrees contain an antichain of size , a countable dense linear ordering (of degrees of cardinality ), and a minimal pair.Downey, Hirschfeldt, LaForte, Nies and others have studied a similar structure, the K-degrees, where K is the prefix-free Kolmogorov complexity. A minimal pair of K-degrees was constructed by Csima and Montalban. Of particular interest are the noncomputable trivial reals, first constructed by Solovay. We defineareal to be (Km,K)-trivial if for some constant c, Km(α | n) ≤ K(n) + c for all n. It is not known whether there is a Km-minimal real, but we show that any such real must be (Km,K)-trivial.Finally, we consider the monotone degrees of the computably enumerable (c.e.) and strongly computably enumerable (s.c.e.) reals. We show there is no minimal c.e. monotone degree and that Solovay reducibility does not imply monotone reducibility on the c.e. reals. We also show the s.c.e. monotone degrees contain an infinite antichain and a countable dense linear ordering.
A polarized partition relation for weakly compact cardinals using elementary substructures
Authors: Jones Albin L. 
Published: December 2007

AbstractWe show that if κ is a weakly compact cardinal, thenfor any ordinals α < κ+ and μ < κ, and any finite ordinals m and n. This polarized partition relation represents the statement that for any partitionof κ × κ+ into m + μ pieces either there are A ∈ [κ]κ, B ∈ [κ]+]α and i < m with A × B ⊆ Ki or there are C ∈ [κ]κ, , and j < μ with C × D ⊆ Lj. Related results for measurable and almost measurable κ are also investigated. Our proofs of these relations involve the use of elementary substructures of set models of large fragments of ZFC.
Corrigendum to: ‘A constructive view on ergodic theorems’
Authors: Spitters Bas 
Published: December 2007

AbstractJeremy Avigad kindly pointed out to me that the proof of Theorem 2 in [3] is incomplete. At the very end it assumes that when is located, so is . This is not correct. In fact, Avigad explained that the construction in the proof of Theorem 15.3 in [1] can be read as a recursive counterexample to the statement: ‘If , then Anx converges for every x’. As a result the conclusion of Theorem 2 should be that An converges if and only if is located. Similar changes have to be made in the abstract, Lemma 4, and Theorem 16. Finally, the paragraph on ergodic measure preserving transformations should be removed.As an unrelated point we would like to mention that in the last two displayed equations of the proof of theorem 1 the term should be replaced by .