bluuebunny/crossref_metadata_2025_split huggingface dataset:
Preparation of Cellulose Nanofibers/Nanoparticles via Electrospray
Authors: Sui Xiaofeng , Yuan Jinying , Yuan Weizhong , Zhou Mi 
Published: December 2007

Abstract
Cellulose nanomaterials (100–500 nm in diameter) including fibers and particles have been produced from nonvolatile room-temperature ionic liquid (RTIL) solvent by electrospray. Solvents are extracted from the biopolymer materials after the formation using cosolvent–water. The fundamental role of concentration has been investigated. Structural, morphological, and crystalline phase features were studied by SEM, TGA, and XRD.
Dynamic Inventory Management with Learning About the Demand Distribution and Substitution Probability
Authors: Chen Li , Plambeck Erica L. 
Published: December 2007

Awell-known result in the Bayesian inventory management literature is: If lost sales are not observed, the Bayesian optimal inventory level is larger than the myopic inventory level (one should “stock more” to learn about the demand distribution). This result has been proven in other studies under the assumption that inventory is perishable, so the myopic inventory level is equal to the Bayesian optimal inventory level with observed lost sales. We break that equivalence by considering nonperishable inventory. We prove that with nonperishable inventory, the famous “stock more” result is often reversed to “stock less,” in that the Bayesian optimal inventory level with unobserved lost sales is lower than the myopic inventory level. We also prove that making lost sales unobservable increases the Bayesian optimal inventory level; in this specific sense, the famous “stock more” result of other studies generalizes to the case of nonperishable inventory. When the product is out of stock, a customer may accept a substitute or choose not to purchase. We incorporate learning about the probability of substitution. This reduces the Bayesian optimal inventory level in the case that lost sales are observed. Reducing the inventory level has two beneficial effects: to observe and learn more about customer substitution behavior and (for a nonperishable product) to reduce the probability of overstocking in subsequent periods. Finally, for a capacitated production-inventory system under continuous review, we derive maximum likelihood estimators (MLEs) of the demand rate and probability that customers will wait for the product. (Accepting a raincheck for delivery at some later time is a common type of substitution.) We investigate how the choice of base-stock level and production rate affect the convergence rate of these MLEs. The results reinforce those for the Bayesian, uncapacitated, periodic review system.
Prevalence and Cluster of Cardiometabolic Biomarkers in Overweight and Obese Schoolchildren: Results from a Large Survey in Southwest Germany
Authors: Nagel Gabriele , Rapp Kilian , Wabitsch Martin , Büchele Gisela , Kroke Anja , Zöllner Iris , Weiland Stephan K , Koenig Wolfgang 
Published: December 2007

Abstract
Background: Obesity is associated with substantial metabolic changes and subclinical inflammation. We explored associations between body mass index (BMI) and cardiometabolic biomarkers and their clustering in overweight and obese schoolchildren.
Methods: In this population-based, cross-sectional study among 450 children 10 years old, we measured adiponectin, leptin, inflammatory markers, apolipoprotein (apo) AI and B, and lipoprotein-associated phospholipase A2 (Lp-PLA2). Except for adiponectin and apoAI (10th percentile) the 90th percentile was used as cutoff point. Body weight was categorized in age- and sex-specific BMI percentiles and overweight and obesity according to International Obesity Task Force definitions.
Results: In linear regression models, all cardiometabolic markers except apoB were statistically significantly associated with overweight. In logistic regression models, compared with the reference category (25th–75th percentile of BMI), overweight was associated with increased concentrations of leptin [odds ratio (OR) 59.80; 95% CI 16.68–214.39], C-reactive protein (6.30; 2.95–13.45), fibrinogen (2.82; 1.33–6.01), and low apoAI (2.62; 1.19–5.75). Overweight was positively associated with interleukin-6, Lp-PLA2, and apoB concentrations and inversely with adiponectin concentrations. Most importantly, in obese children 35% showed one, 20% two, 10% three, and 15% four or more abnormal cardiometabolic biomarkers. The number of abnormal cardiometabolic markers increased in overweight (ptrend &lt;0.001) and obese (ptrend &lt;0.001) children.
Conclusions: Overweight and obesity in children are associated with complex metabolic changes and a low-grade inflammatory response, and thus might not only accelerate cardiovascular disease later on, but may also be associated with the initiation of atherosclerosis in early life.
Molecular Breeding Using a Major QTL for Fusarium Head Blight Resistance in Wheat
Authors: Anderson James A. , Chao Shiaoman , Liu Sixin 
Published: December 2007

ABSTRACTThe difficulties of breeding for Fusarium head blight (caused by Fusarium graminearum Schwabe [teleomorph: Gibberella zeae]) resistance, a quantitatively inherited fungal disease, caused us to initiate a marker‐assisted selection (MAS) approach to accelerate our gains from selection. Although MAS for simply inherited traits has become commonplace in many plant breeding programs, there are few examples of its application with quantitatively inherited traits. Several barriers to MAS for a quantitative trait locus (QTL) must be addressed before it can be integrated into a breeding program, including (i) its efficiency or gain compared to phenotypic selection; (ii) the usefulness of markers in breeding‐relevant populations; and (iii) the cost, throughput, and expertise required. We identified a major QTL, Fhb1, for Fusarium head blight resistance in wheat (Triticum aestivum L.) and validated its effect in an additional mapping population and near‐isogenic lines developed from segregating lines in our breeding program. The effect of this QTL was large and consistent enough to justify complementing our extensive phenotypic screening efforts for this disease with MAS for this major QTL. Fhb1 is located in a highly polymorphic region, and we developed highly diagnostic markers while fine mapping this QTL. The establishment of the USDA‐ARS Regional Small Grains Genotyping Centers has dramatically increased our capabilities to apply MAS by providing access to high‐throughput DNA extraction and genotyping equipment. Because a limited number of individuals can be subjected to MAS, we use a process of retrospective breeding to identify those populations that are most likely to produce cultivar candidates. More efficient DNA extraction technologies and marker platforms will allow us to fully implement MAS in breeding programs.
Physiological Basis of Successful Breeding Strategies for Maize Grain Yield
Authors: Lee E. A. , Tollenaar M. 
Published: December 2007

ABSTRACTDuring the maize (Zea mays L.) hybrid era (1939 to present), commercial grain yields have improved nearly sixfold and the genetic component of the improvement has been estimated as approximately 60%. In this paper, we examine physiological factors and successful breeding strategies that underlie the yield improvement. Grain yield is the product of accumulating dry matter and allocating a portion of the total dry matter to the grain. The processes influencing dry matter accumulation are commonly referred to as the “source” components, while the processes influencing allocation of dry matter to the grain are referred to as the “sink” components. On the source side, changes in leaf canopy size and architecture account for only a minor portion of the improvement. The majority of the improvement in source capacity is due to visual and functional “stay‐green.” On the sink side, the improvement is through changes in the relationship between kernel number per plant and plant growth rate during a period bracketing silking. In a breeding context, these improvements have been made (i) in a “closed” germplasm pool stratified into heterotic groups; (ii) through use of a pedigree method of breeding structured to mimic reciprocal recurrent selection and thereby improving both additive and nonadditive genetic effects; and (iii) by a gradual increase in plant population densities during the hybrid era as the constant source of stress during both inbred line development and hybrid commercialization. Functional stay‐green and the sink establishment dynamics still represent opportunities for yield improvements. It is essential that source and sink are kept in balance, and that improvement in one accompanies a simultaneous improvement in the other. One strategy for exploiting these opportunities is to incorporate high plant population density trials into inbred line development programs.
Molecular Markers in a Commercial Breeding Program
Authors: Eathington Sam R. , Crosbie Theodore M. , Edwards Marlin D. , Reiter Robert S. , Bull Jason K. 
Published: December 2007

ABSTRACTIn the 1980s, DNA‐based molecular markers were identified as having the potential to enhance corn (Zea mays L.) breeding. Research has demonstrated the advantage of using molecular markers for selection of simply inherited traits, however only a few studies have evaluated the potential to enhance genetic gain for quantitative traits. In the late 1990s, Monsanto decided to implement marker assisted selection for quantitative traits in our global plant breeding programs. We built genotyping systems and information tools and developed marker assisted methodologies that increased the mean performance in elite breeding populations.
NOVA University: Plant Breeding Education in a University without Walls
Authors: Andersen Sven B. 
Published: December 2007

ABSTRACTThe NOVA university network consists of a collaboration between agriculture‐related institutions in Sweden, Norway, Finland, Iceland, and Denmark with the goal of supporting veterinary, forestry, and agricultural education. The plant breeding part of these activities was already initiated with joint Ph.D. courses in 1975 and also includes Baltic institutions from Estonia, Latvia, and Lithuania since 1993. The joint courses and other network activities are a means of maintaining a true plant breeding identity in the geographical area while rapid changes take place within the agricultural industry, university curricula, and students' perception of the issue.
Distinct iterable branches
Authors: Steel John R. 
Published: December 2007

§1. Introduction. The basic problem of inner model theory is how to construct mice satisfying hypotheses appreciably stronger than “there is a Woodin limit of Woodin cardinals”. We have a family of constructions, the Kc-constructions, which ought to produce such mice under the appropriate hypotheses on V. Perhaps the most important thing we lack is a proof that the countable elementary submodels of premice produced by a Kc-construction are ω1 + 1-iterable. The best partial results in this direction are those of Neeman ([4]) for Kc-constructions making use of full background extenders over V, and those of Andretta, Neeman, and Steel ([1]) for arbitrary Kc-constructions.Let be a countable premouse embedded by π into a level of the Kc-construction ℂ. If ℂ uses only full extenders over V as its background extenders, then π and ℂ enable one to lift an evolving iteration tree on to an iteration tree * on V. (See [3, §12].) The good behavior of * guarantees that of . The natural conjecture here is that V is ω1 + 1-iterable with respect to such trees* by the strategy of choosing the unique wellfounded branch. The open question here is uniqueness, since by [2] the uniqueness of the wellfounded branch chosen by * at limit stages strictly less than λ implies the existence of a wellfounded branch to be chosen at λ.
A dichotomy in classifying quantifiers for finite models
Authors: Shelah Saharon , Doron Mor 
Published: December 2007

AbstractWe consider a family of finite universes. The second order existential quantifier Qℜ means for each U Є quantifying over a set of n(ℜ)-place relations isomorphic to a given relation. We define a natural partial order on such quantifiers called interpretability. We show that for every Qℜ, either Qℜ is interpretable by quantifying over subsets of U and one to one functions on U both of bounded order, or the logic L(Qℜ) (first order logic plus the quantifier Qℜ) is undecidable.
Free spectra of linear equivalential algebras
Authors: Slomczyńska Katarzyna 
Published: December 2007

AbstractWe construct the finitely generated free algebras and determine the free spectra of varieties of linear equivalential algebras and linear equivalential algebras of finite height corresponding, respectively, to the equivalential fragments of intermediate Gödel-Dummett logic and intermediate finite-valued logics of Gödel. Thus we compute the number of purely equivalential propositional formulas in these logics in n variables for an arbitrary n ∈ ℕ.
Normalized natural deduction systems for some relevant logics I: The logic DW
Authors: Brady Ross T. 
Published: December 2007

Fitch-style natural deduction was first introduced into relevant logic by Anderson in [1960], for the sentential logic E of entailment and its quantincational extension EQ. This was extended by Anderson and Belnap to the sentential relevant logics R and T and some of their fragments in [ENT1], and further extended to a wide range of sentential and quantified relevant logics by Brady in [1984]. This was done by putting conditions on the elimination rules, →E, ~E, ⋁E and ∃E, pertaining to the set of dependent hypotheses for formulae used in the application of the rule. Each of these rules were subjected to the same condition, this condition varying from logic to logic. These conditions, together with the set of natural deduction rules, precisely determine the particular relevant logic. Generally, this is a simpler representation of a relevant logic than the standard Routley-Meyer semantics, with its existential modelling conditions stated in terms of an otherwise arbitrary 3-place relation R, which is defined over a possibly infinite set of worlds. Readers are urged to refer to Brady [1984], if unfamiliar with the above natural deduction systems, but we will introduce in §2 a modified version in full detail.Natural deduction for classical logic was invented by Jaskowski and Gentzen, but it was Prawitz in [1965] who normalized natural deduction, streamlining its rules so as to allow a subformula property to be proved. (This key property ensures that each formula in the proof of a theorem is indeed a subformula of that theorem.)
On weak and strong interpolation in algebraic logics
Authors: Sági Gábor , Shelah Saharon 
Published: December 2007

AbstractWe show that there is a restriction, or modification of the finite-variable fragments of First Order Logic in which a weak form of Craig's Interpolation Theorem holds but a strong form of this theorem does not hold. Translating these results into Algebraic Logic we obtain a finitely axiomatizable subvariety of finite dimensional Representable Cylindric Algebras that has the Strong Amalgamation Property but does not have the Superamalgamation Property. This settles a conjecture of Pigozzi [12].
Associativity as commutativity
Authors: Dǒsen Kosta , Petrić Zoran 
Published: December 2007

AbstractIt is shown that coherence conditions for monoidal categories concerning associativity are analogous to coherence conditions for symmetric strictly monoidal categories, where associativity arrows are identities. Mac Lane's pentagonal coherence condition for associativity is decomposed into conditions concerning commutativity, among which we have a condition analogous to naturality and a degenerate case of Mac Lane's hexagonal condition for commutativity. This decomposition is analogous to the derivation of the Yang-Baxter equation from Mac Lane's hexagon and the naturality of commutativity. The pentagon is reduced to an inductive definition of a kind of commutativity.
Jump operator and Yates Degrees
Authors: Wu Guohua 
Published: December 2007

AbstractIn [9], Yates proved the existence of a Turing degree a such that 0, 0′ are the only c.e. degrees comparable with it. By Slaman and Steel [7], every degree below 0′ has a 1-generic complement, and as a consequence, Yates degrees can be 1-generic, and hence can be low. In this paper, we prove that Yates degrees occur in every jump class.
On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories
Authors: Kołodziejczyk Leszek Aleksander 
Published: December 2007

AbstractModifying the methods of Z. Adamowicz's paperHerbrand consistency and bounded arithmetic[3] we show that there exists a numbernsuch that ⋃mSm(the union of the bounded arithmetic theoriesSm) does not prove the Herbrand consistency of the finitely axiomatizable theory S3n
Uniform almost everywhere domination
Authors: Cholak Peter , Greenberg Noam , Miller Joseph S. 
Published: December 2007

AbstractWe explore the interaction between Lebesgue measure and dominating functions. We show, via both a priority construction and a forcing construction, that there is a function of incomplete degree that dominates almost all degrees. This answers a question of Dobrinen and Simpson, who showed that such functions are related to the proof-theoretic strength of the regularity of Lebesgue measure for Gδ sets. Our constructions essentially settle the reverse mathematical classification of this principle.
Diagonal actions and Borel equivalence relations
Authors: Ding Longyun , Gao Su 
Published: December 2007

AbstractWe investigate diagonal actions of Polish groups and the related intersection operator on closed subgroups of the acting group. The Borelness of the diagonal orbit equivalence relation is characterized and is shown to be connected with the Borelness of the intersection operator. We also consider relatively tame Polish groups and give a characterization of them in the class of countable products of countable abelian groups. Finally an example of a logic action is considered and its complexity in the Borel reducbility hierarchy determined.
A Metamathematical Condition Equivalent to the Existence of a Complete Left Invariant Metric for a Polish Group
Authors: Thompson Alex 
Published: December 2007

AbstractStrengthening a theorem of Hjorth this paper gives a new characterization of which Polish groups admit compatible complete left invariant metrics. As a corollary it is proved that any Polish group without a complete left invariant metric has a continuous action on a Polish space whose associated orbit equivalence relation is not essentially countable.
A Buchholz derivation system for the ordinal analysis of KP + Π3-reflection
Authors: Michelbrink Markus 
Published: December 2007

AbstractIn this paper we introduce a notation system for the infinitary derivations occurring in the ordinal analysis of KP + Π3-Reflection due to Michael Rathjen. This allows a finitary ordinal analysis of KP + Π3-Reflection. The method used is an extension of techniques developed by Wilfried Buchholz, namely operator controlled notation systems for RS∞-derivations. Similarly to Buchholz we obtain a characterisation of the provably recursive functions of KP + Π3-Reflection as <-recursive functions where < is the ordering on Rathjen's ordinal notation system . Further we show a conservation result for -sentences.
Every 1-generic computes a properly 1-generic
Authors: Csima Barbara F. , Downey Rod , Greenberg Noam , Hirschfeldt Denis R. , Miller Joseph S. 
Published: December 2007

AbstractA real is called properly n-generic if it is n-generic but not n + 1-generic. We show that every 1-generic real computes a properly 1-generic real. On the other hand, if m > n ≥ 2 then an m-generic real cannot compute a properly n-generic real.
Computability Results Used in Differential Geometry
Authors: Csima Barbara F. , Soare Robert I. 
Published: December 2007

AbstractTopologists Nabutovsky and Weinberger discovered how to embed computably enumerable (c.e.) sets into the geometry of Riemannian metrics modulo diffeomorphisms. They used the complexity of the settling times of the c.e. sets to exhibit a much greater complexity of the depth and density of local minima for the diameter function than previously imagined. Their results depended on the existence of certain sequences of c.e. sets, constructed at their request by Csima and Soare, whose settling times had the necessary dominating properties. Although these computability results had been announced earlier, their proofs have been deferred until this paper.Computably enumerable sets have long been used to proveundecidabilityof mathematical problems such as the word problem for groups and Hilbert's Tenth Problem. However, this example by Nabutovsky and Weinberger is perhaps the first example of the use of c.e. sets to demonstrate specificmathematical or geometric complexityof a mathematical structure such as the depth and distribution of local minima.
Randomness and halting probabilities
Authors: Becher VeróNica , Figueira Santiago , Grigorieff Serge , Miller Joseph S. 
Published: December 2007

AbstractWe consider the question of randomness of the probability ΩU[X] that an optimal Turing machine U halts and outputs a string in a fixed set X. The main results are as follows:• ΩU[X] is random whenever X is Σn0-complete or Πn0-complete for some n ≥ 2.• However, for n ≥ 2, ΩU[X] is not n-random when X is Σn0 or Πn0. Nevertheless, there exists Δn+10 sets such that ΩU[X] is n-random.• There are Δ20 sets X such that ΩU[X] is rational. Also, for every n ≥ 1, there exists a set X which is Δn+10 and Σn0-hard such that ΩU[X] is not random.We also look at the range of ΩU as an operator. We prove that the set {ΩU[X]: X ⊆ 2≤ω} is a finite union of closed intervals. It follows that for any optimal machine U and any sufficiently small real r, there is a set X ⊆ 2≤ω recursive in ∅′ ⊕ r, such that ΩU[X] = r.The same questions are also considered in the context of infinite computations, and lead to similar results.
The pointwise ergodic theorem in subsystems of second-order arithmetic
Authors: Simic Ksenija 
Published: December 2007

AbstractThe pointwise ergodic theorem is nonconstructive. In this paper, we examine origins of this non-constructivity, and determine the logical strength of the theorem and of the auxiliary statements used to prove it. We discuss properties of integrable functions and of measure preserving transformations and give three proofs of the theorem, though mostly focusing on the one derived from the mean ergodic theorem. All the proofs can be carried out in ACA0; moreover, the pointwise ergodic theorem is equivalent to (ACA) over the base theory RCA0.
Bounding homogenous models
Authors: Barbara F. Csima  , Harizanov Valentina S. , Hirschfeldt Denis R. , Soare Robert I. 
Published: December 2007

AbstractA Turing degree d is homogeneous bounding if every complete decidable (CD) theory has a d-decidable homogeneous model , i.e., the elementary diagram De () has degree d. It follows from results of Macintyre and Marker that every PA degree (i.e., every degree of a complete extension of Peano Arithmetic) is homogeneous bounding. We prove that in fact a degree is homogeneous bounding if and only if it is a PA degree. We do this by showing that there is a single CD theory T such that every homogeneous model of T has a PA degree.
A power function with a fixed finite gap everywhere
Authors: Merimovich Carmi 
Published: December 2007

AbstractWe give an application of the extender based Radin forcing to cardinal arithmetic. Assuming κ is a large enough cardinal we construct a model satisfying 2κ = κ+n together with 2λ = λ+n for each cardinal λ < κ, where 0 < n < ω. The cofinality of κ can be set arbitrarily or κ can remain inaccessible.When κ remains an inaccessible, Vκ is a model of ZFC satisfying 2λ = λ+n for all cardinals λ.