bluuebunny/crossref_metadata_2025_split huggingface dataset:
A novel method to prepare zinc hydroxystannate‐coated inorganic fillers and its effect on the fire properties of PVC cable materials
Authors: Yang Ling , Hu Yuan , You Fei , Chen Zuyao 
Published: May 2007

AbstractFire‐retardant (FR) properties, including limiting oxygen index, peak rate of heat release, and smoke parameter have been measured and compared for unfilled and filled polyvinyl‐chloride (PVC)‐based cable formulations, containing 15 wt% amounts of uncoated and zinc‐hydroxystannate (ZHS)‐coated magnesium hydroxide (MH) and calcium carbonate (CaCO3) fillers at the same addition level. Of the uncoated fillers, MH was more effective at lowering flammability than CaCO3. When the ZHS coating was applied to MH and CaCO3, CaCO3 became the most effective additive at lowering PVC flammability and smoke output. POLYM. ENG. SCI., 47:1163–1169, 2007. © 2007 Society of Plastics Engineers
Duration of treatment effect after tobramycin solution for inhalation in young children with cystic fibrosis
Authors: Gibson Ronald L. , Emerson Julia , Mayer‐Hamblett Nicole , Burns Jane L. , McNamara Sharon , Accurso Frank J. , Konstan Michael W. , Chatfield Barbara A. , Retsch‐Bogart George , Waltz David A. , Acton James , Zeitlin Pamela , Hiatt Peter , Moss Richard , Williams Judy , Ramsey Bonnie W. 
Published: May 2007

AbstractRationaleAmong young children with cystic fibrosis (CF), Pseudomonas aeruginosa (Pa) airway infection is associated with increased morbidity and mortality. Early intervention strategies include tobramycin solution for inhalation (TSI), which can eradicate lower airway Pa from cultures obtained at the end of 28 days of treatment in young children.MethodsWe conducted an open label, sequential cohort study of TSI in young children with CF to investigate duration of antimicrobial treatment effect. The primary outcome was lower airway Pa eradication per bronchoalveolar lavage (BAL) fluid culture. Sequential treatment cohorts varied by duration of treatment (28 or 56 days) and timing of follow‐up BAL (at Days 56, 84, or 112). Subjects (N = 36) were treated with TSI, 300 mg twice daily, for 28 days or 56 days per cohort assignment.ResultsAmong 31 evaluable subjects, culture based, lower airway Pa eradication was observed in the majority of subjects for up to 1–3 months following TSI treatment: 75% in Cohort 28/56 (days of treatment/day of follow‐up BAL), 63% in Cohort 28/84, 82% in Cohort 56/112, and 75% in Cohort 28/112. Non‐mucoid Pa at baseline and/or exotoxin A seronegativity were associated with higher rates of eradication. There was a less pronounced effect of TSI treatment on Pa eradication from oropharyngeal cultures in all cohorts. TSI treatment was associated with reduced neutrophilic airway inflammation and was not related to any serious adverse events.ConclusionTSI monotherapy is safe and can eradicate lower airway Pa for up to 3 months after treatment in young children with CF. Pediatr Pulmonol. 2007; 42:610–623. © 2007 Wiley‐Liss. Inc.
β‐strand recombination in tricalbin evolution and the origin of synaptotagmin‐like C2 domains
Authors: Jiménez José L. , Davletov Bazbek 
Published: May 2007

AbstractTwo protein families involved in membrane traffic, tricalbins and synaptotagmins, contain several copies of C2 domains and are related based on their sequence and domain architecture. Paradoxically, tricalbin and synaptotagmin C2 domains belong to different structural types with apparent circular permutation of terminal β‐strands. To understand whether a topological switch took place, we analyzed tricalbin and synaptotagmin‐like C2 domains using two‐dimensional structural analysis. We found that yeast tricalbins contain five to six C2 domains. One of these C2 domains possesses many features of synaptotagmin‐like C2 domains and also carries a conserved C‐terminal strand that is similar to its structural equivalent in synaptotagmin‐like C2 domains, suggesting a structural permutation event. Indeed, among higher eukaryotes, animal tricalbins have evolved a C2 domain with synaptotagmin‐like topology indicating that the structural conversion has taken place. Investigation of plant synaptotagmins, however, proves that they are direct tricalbin orthologs. Our analysis shows that β‐strand recombination is a possible evolutionary mechanism to generate new structural topologies with altered functional properties. Proteins 2007. © 2007 Wiley‐Liss, Inc.
Nuclear orbital plus molecular orbital theory: Simultaneous determination of nuclear and electronic wave functions without Born–Oppenheimer approximation
Authors: Nakai Hiromi 
Published: May 2007

AbstractWe review a recent development in a rigorous non‐Born–Oppenheimer method, i.e., nuclear orbital plus molecular orbital (NOMO) method, which determines the nuclear and electronic wave functions simultaneously. The NOMO theory is an exact theory for the non‐BO problem in principle; for example, full‐configuration interaction formulation for a complete configuration space. Hartree–Fock (HF) equations for NOs and MOs are derived for practical calculations. The usage of Gaussian basis functions for NOs is discussed. We formulate the elimination of translational and rotational contaminations in the NOMO method. Further, many‐body effect such as nucleus–nucleus (n–n), nucleus–electron (n–e), and electron–electron (e–e) correlations are investigated by applying the second‐order Møller–Plesset perturbation theory to the NOMO method. The excited‐state theories such as configuration interaction and generator coordinate methods are examined to describe not only electronic but also vibrational excited states. © 2007 Wiley Periodicals, Inc. Int J Quantum Chem, 2007
Hydrological impacts affecting endangered fish species: a Spanish case study
Authors: Sánchez Navarro Rafael , Stewardson Michael , Breil Pascal , de Jalón Diego García , Eisele Michael 
Published: May 2007

AbstractThe Júcar River Basin (Spain) harbours endemic aquatic species that are declining or going extinct at an alarming rate. After evaluating several possible stressors, flow modification is identified as the factor critically threatening one endemic cyprinid fish species Chondrostoma arrigonis. Physical habitat for this species is compared for river reaches with different flow modification histories to understand local extinctions across this species' historical range. Time‐series of physical habitat, generated using PHABSIM, indicate a dramatic reduction in habitat area with flow modification. Our findings indicate that efforts to regulate and stabilize flows in the Júcar River Basin may cause the rapid extinction of the remaining populations. Copyright © 2007 John Wiley & Sons, Ltd.
Asymptotic Joint Normality of Outdegrees of Nodes in Random Recursive Trees
Authors: Mahmoud Hosam M. , Smythe R. T. 
Published: May 2007

AbstractWe study the joint probability distribution of the number of nodes of outdegree 0, 1, and 2 in a random recursive tree. We complete the known partial list of exact means and variances for outdegrees up to two by obtaining exact combinatorial expressions for the remaining means, variances, and covariances. The joint probability distribution of the number of nodes of outdegree 0, 1, and 2 is shown to be asymptotically trivariate normal and the asymptotic covariance structure is explicitly determined. It is also shown how to extend the results (at least in principle) to obtain a limiting multivariate normal distribution for nodes of outdegree 0, 1, …, k.
Large Cliques Elude the Metropolis Process
Authors: Jerrum Mark 
Published: May 2007

AbstractIn a random graph on n vertices, the maximum clique is likely to be of size very close to 2 lg n. However, the clique produced by applying the naive “greedy” heuristic to a random graph is unlikely to have size much exceeding lg n. The factor of two separating these estimates motivates the search for more effective heuristics. This article analyzes a heuristic search strategy, the Metropolis process, which is just one step above the greedy one in its level of sophistication. It is shown that the Metropolis process takes super‐polynomial time to locate a clique that is only slightly bigger than that produced by the greedy heuristic.
Enumeration of Almost‐Convex Polygons on the Square Lattice
Authors: Enting I. G. , Guttmann A. J. , Richmond L. B. , Wormald N. C. 
Published: May 2007

AbstractWe classify self‐avoiding polygons on the square lattice according to a concavity measure, m, where 2m is the difference between the number of steps in the polygon and the perimeter of the minimal rectangle bounding the polygon. We generate series expansions for the perimeter generating functions Sm(x) for polygons of concavity m. We analyze the series Sm(x) for m = 0 to 3. If Nm,n denotes the number of polygons of perimeter 2n and concavity m, with m = o(n1/2), we prove that Nm,n ˜ 22n−m−7nm+1/m!, and that the radius of convergence of the series counting all polygons with m = o(n) is equal to 1/4. Our numerical data leads us to conjecture that in factmagnified image for m = o(n1/2), a result confirmed for m = 0 and 1.
Randomized adaptive sorting
Authors: Estivill‐Castro Vladimir , Wood Derick 
Published: May 2007

AbstractOur goal is to design practical sorting algorithms that require time proportional not only to the size of the input but also to the disorder in the input. Such sorting algorithms are said to be adaptive. We introduce randomization to achieve this goal; the first time randomization has used to obtain adaptive sorting algorithms. We investigate three randomized algorithms.
Randomized Merge Sort, which is expected Runs‐optimal;
Randomized Quicksort, which is Exchange‐sensitive, that is, it takes Θ(|X|[1+log(Exc(X)+1)]) time in the expected case; and
Skip Sort, whichh is Inversions‐, Runs‐, and Exchhange‐optimal.
The three sorting algorithms are simple and practical, in contrast to previous adaptive sorting algorithms that used complex data structures. Moreover, previous claims about the performance of adaptive variants of Quicksort were baed only on simulation results,; our claims are based on a formal analysis. © 1993 John Wiley & Sons. Inc.
Disjoint systems
Authors: Alon Noga , Sudakov Benny 
Published: May 2007

AbstractA disjoint system of type (∀, ∃, k, n) is a collection 𝒞 = {𝒜1,…, 𝒜m} of pairwise disjoint families of k‐subsets of an n‐element set satisfying the following condition. For every ordered pair 𝒜i and 𝒜j of distinct members of 𝒞 and for every A ϵ 𝒜i there exists a B ϵ 𝒜j that does not intersect A. Let Dn (∀, ∃, k) denote the maximum possible cardinality of a disjoint system of type (∀, ∃, k, n). It is shown that for every fixed k ⩾ 2,.magnified imageThis settles a problem of Ahlswede, Cai, and Zhang. Several related problems are considered as well.
Bounding Ramsey numbers through large deviation inequalities
Authors: Krivelevich Michael 
Published: May 2007

AbstractWe develop a new approach for proving lower bounds for various Ramsey numbers, based on using large deviation inequalities. This approach enables us to obtain the bounds for the off‐diagonal Ramsey numbers R(Kr, Kk), r ≤ k, that match the best known bounds, obtained through the local lemma. We discuss also the bounds for a related Ramsey‐type problem and show, for example, that there exists a K4‐free graph G on n vertices in which every cn3/5 log1/2 n vertices span a copy of K3. © 1995 John Wiley & Sons, Inc.
Situationally embodied curriculum: Relating formalisms and contexts
Authors: Barab Sasha , Zuiker Steve , Warren Scott , Hickey Dan , Ingram‐Goble Adam , Kwon Eun‐Ju , Kouper Inna , Herring Susan C. 
Published: May 2007

AbstractThis study describes an example of design‐based research in which we make theoretical improvements in our understanding, in part based on empirical work, and use these to revise our curriculum and, simultaneously, our evolving theory of the relations between contexts and disciplinary formalisms. Prior to this study, we completed a first cycle of design revisions to a game‐based ecological sciences curriculum to make more apparent specific domain concepts associated with targeted learning standards. Of particular interest was using gaming principles to embed standards‐based science concepts in the curricular experience without undermining the situative embodiment central to our design philosophy. In Study One reported here, the same first‐cycle elementary teacher used the refined second‐cycle curriculum, again with high‐ability fourth graders. We then analyzed qualitative and quantitative data on student participation and performance to further refine our theory and revise the curriculum. In Study Two, another teacher implemented a further refined second‐cycle curriculum with lower achieving fourth graders, including several students labeled as having special needs. We use the design trajectory and results to illustrate and warrant the creation of a situationally embodied curriculum that supports the learning of specific disciplinary formalisms. © 2007 Wiley Periodicals, Inc. Sci Ed, 91:750–782, 2007
Handling document expressions for capturing conceptual query–document relations
Authors: Nakashima Makoto , Ito Tetsuro 
Published: May 2007

AbstractIf keywords or key phrases that characterize a query or a document are replaced and expressed by identifiers within a conceptual hierarchy such as a thesaurus, excellent searches can be expected by taking conceptual query‐document relations of the identifiers into consideration. If, however, judgments to check for matches in the extracted documents take time, the efficiency of the entire system will decrease. In order to deal with this problem, a method is required to easily understand what type of relations exist between the queries and document as well as what the document is referring to. This paper will initially discuss how to handle document expressions that can clearly point out the manner in which the conceptual relations between the queries and documents generate while contributing to improvements in the retrieval efficiency. A method will then be shown that simplifies document expressions when there are many identifiers within a document expression. The effectiveness of this proposed method was ascertained through experiments using test collections for retrievals. © 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(9): 97–106, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10349
Implementing a strategyproof greedy‐allocation combinatorial auction and extending to ascending auction
Authors: Ito Takayuki , Yokoo Makoto , Matsubara Shigeo , Iwasaki Atsushi 
Published: May 2007

AbstractThis paper proposes a new combinatorial auction protocol called Average‐Max‐Minimal‐Bundle (AM‐MB) protocol. The characteristics of the AM‐MB protocol are as follows: (i) it is strategyproof, that is, truth‐telling is a dominant strategy, (ii) the computational overhead is very low, since it allocates bundles greedily thereby avoiding an explicit combinatorial optimization problem, and (iii) it can obtain higher social surplus and revenue than can the Max‐Minimal‐Bundle (M‐MB) protocol, which also satisfies (i) and (ii). Furthermore, this paper extends the AM‐MB protocol to an open ascending‐price protocol in which straightforward bidding is an ex‐post Nash equilibrium. © 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(9): 44–51, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.20748
Semisupervised learning using feature selection based on maximum density subgraphs
Authors: Nakatani Yoshiyuki , Zhu Kuangyi , Uehara Kuniaki 
Published: May 2007

AbstractIn machine learning tasks on large‐scale datasets, the labeled data essential to the classification are not always sufficient, which degrades the learning accuracy. Meanwhile, unlabeled data are always abundant. Hence, semisupervised learning which uses both unlabeled and labeled data to improve the learning accuracy is currently of great interest. In this paper, we use a graph to represent the underlying distribution of both labeled and unlabeled data and split it by using multiway cut to classify unlabeled data. Additionally, we propose a graph‐based feature selection algorithm to improve the learning accuracy of our graph‐based semisupervised learning algorithm. In our algorithm, we first propose an evaluation criterion for the attribute relevance using the graph density. Then, we extract the relevant attribute subset by finding the clique on the graph where each vertex stands for the attribute and each edge stands for the relevance of a feature pair. © 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(9): 32–43, 2007; Published online in Wiley InterScience (www.interscience. wiley.com). DOI 10.1002/scj.20757
A fundamental discussion of 3‐dimensional pattern matching using canonical angles between subspaces for the purpose of differentiating a face and its photograph
Authors: Maeda Ken‐ichi , Yamaguchi Osamu , Fukui Kazuhiro 
Published: May 2007

AbstractThree‐dimensional pattern recognition requires the definition of a similarity measure between 3‐dimensional patterns. We discuss how to match 3‐dimensional patterns, which are represented by a set of images taken from multiple directions and approximately represented by subspaces. The proposed method is to calculate the canonical angles between two subspaces. In order to differentiate an object and its photograph, at least a canonical angle other than the smallest one is required. We discuss the usage of the canonical angle both used by itself and combination, sum and product. We also demonstrate the effectiveness of the proposed method by experiments. © 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(9): 11–20, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.20786
Comparing smoothing techniques in Cox models for exposure–response relationships
Authors: Govindarajulu Usha S. , Spiegelman Donna , Thurston Sally W. , Ganguli Bhaswati , Eisen Ellen A. 
Published: May 2007

AbstractTo allow for non‐linear exposure–response relationships, we applied flexible non‐parametric smoothing techniques to models of time to lung cancer mortality in two occupational cohorts with skewed exposure distributions. We focused on three different smoothing techniques in Cox models: penalized splines, restricted cubic splines, and fractional polynomials. We compared standard software implementations of these three methods based on their visual representation and criterion for model selection. We propose a measure of the difference between a pair of curves based on the area between them, standardized by the average of the areas under the pair of curves. To capture the variation in the difference over the range of exposure, the area between curves was also calculated at percentiles of exposure and expressed as a percentage of the total difference. The dose–response curves from the three methods were similar in both studies over the denser portion of the exposure range, with the difference between curves up to the 50th percentile less than 1 per cent of the total difference. A comparison of inverse variance weighted areas applied to the data set with a more skewed exposure distribution allowed us to estimate area differences with more precision by reducing the proportion attributed to the upper 1 per cent tail region. Overall, the penalized spline and the restricted cubic spline were closer to each other than either was to the fractional polynomial. Copyright © 2007 John Wiley & Sons, Ltd.
Über die praktische Integration ebener Vektoren
Authors: Borbély S. V. 
Published: May 2007

AbstractEs wird ein Verfahren zur zeichnerischen Integration eines von einer reellen Veränderlichen abhängigen Integrales einer komplexen Funktion gegeben, das die Durchführung der Konstruktion direkt in der komplexen Ebene gestattet, ohne dabei durch Komponentenzerlegung auf zwei reelle Integrationen zurückgreifen zu müssen.
Eine einfache Reihentransformation bei einer sehr allgemeinen Fourierschen Reihe .
Authors: Buchholz Herbert 
Published: May 2007

AbstractFür eine Fouriersche Reihe mit dem allgemeine Glied xp · cos P Ψ φ (p ‐ a)−k wird in der Arbeit eine Reihentransformation durchgeführt, die die Berechnung der Reihensumme besonderes dann erleichtert, wenn x nur wenig kleiner als 1 oder gleich 1 ist und k eine reelle Zahl, die nicht wesentlich größer als 1 ist. Die Reihentransformation besteht im wesentlichen in der Verwandlung der vorgelegten Reihe in eine Potenzreihe nach x, die in gewissen Fällen noch ein logarithmenbehaftetes Glied enthalten kann. Die Koeffizienten der Reihe bilden in den einfacheren Fällen die Polynome von Bernoulli und Euler. Die allgemeine Trnsformationsformel schließt eine große Zahl bekannter Sonderfälle ein.
Verfahren zur Beurteilung einer sehr geringen Korrelation zwischen zwei statistischen Merkmalsreihen .
Authors: Gebelein Hans 
Published: May 2007

AbstractWährend die bekannten Korrelationsmaße in mehr oder weniger befriedigender Weise dazu dienen können, einen verhältnismäßig engen Zusammenhang zwischen zwei statistischen Merkmalsreihen zu beschreiben, versagen sie, wenn es sich darum handelt, den Grad der gegenseitigen Abhängigkeit zweier noch eben nicht ganz unabhängiger statistischer Merkmalsreihen zu beurteilen, wie dies namentlich bei der Behandlung biologischer und medizinischer Fragen erforderlich ist. Hier Klarheit zu schaffen und brauchbare Untersuchungsverfahren zu gewinnen ist ein Problem, das eng mit der Lexisschen Dispersionstheorie zusammenhängt. Im folgenden wird jene Theorie so erweitert, daß es gelingt, innerhalb zweidimensionaler statistischer Gesamtheiten mit vielfach gegliederten Merkmalen geringfügige Korrelationen nachzuweisen. Insbesondere zeigt sich, daß ein bestimmtes Vielfaches des Pearsonschen Kontingenzmaßes der dem Problem am besten angemessene Parameter ist, indem diese Größe einerseits in den beiden einfachsten Sonderfällen sich auf die Lexissche Zahl L bzw. auf das Pearsonsche X2 reduziert, während anderseits für sie ein universelles, durch Tafelwerke der Rechnung zugängliches Verteilungsgesetz von der Art einer vieldimensionalen Gaußschen Normalverteilung gilt.
Einige Anwendungen der Theorie der Zylinderschale
Authors: Wuest Walter 
Published: May 2007

AbstractDie Theorie der Zylinderschale wird auf die Berechnung nichtgeschlossener Teilstücke erweitert für den Fall einer nur von einer Koordinate abhängigen Spannungsverteilung. Die Theorie wird dann auf die quergewölbte Biegefeder und die Bimetall‐Zylinderfeder angewandt. Die genannte Biegefeder hat eine nichtlineare Charakteristik und wird bei Erreichen einer kritischen Durchbiegung instabil. Im überkritischen Bereich bleibt das Biegemoment annähernd konstant und diese Eigenschaft wird zum Antrieb mechanischer Werke ausgenutzt.
Regions and Boundaries for Diffracting Shock Wave Systems
Authors: Henderson L. F. 
Published: May 2007

AbstractThis paper examines, as completely as possible, the wave systems that may occur when a plane shock wave i diffracts over a concave corner. For a perfect gas, a particular wave system is specified by three parameters (γ, ϵi, ωo), which are respectively the ratio of the specific heats γ, the inverse strength ϵi of i, and its angle of incidence ωo. The topology of the (ϵi, ωo) plane is studied for a given γ (gas), and regions or domains corresponding to each wave system are delineated. Exact expressions are given for the boundaries of many of these regions. Although it is plausible that the boundaries represent the transition conditions between the wave systems, a detailed analysis shows that the situation is sometimes more complicated than might be expected. A new transition criterion, which may be valid for diffraction over flexible surfaces, is presented. For very weak shocks (ϵi > 0.8328 in air), it is found that Mach reflexion cannot exist, and in its place a continuous wave system is indicated.