bluuebunny/crossref_metadata_2025_split huggingface dataset:
Nursing Home Food ServicesLinked with Risk of Malnutrition
Authors: Carrier Natalie , Ouellet Denise , West Gale E. 
Published: May 2007

Purpose: Links between food service characteristics and residents’ risk of malnutrition were examined.Methods: Cognitively intact residents meeting inclusion criteria and living in one of 38 participating nursing homes were randomly sampled. The final sample consisted of 132 residents, who were screened for risk of malnutrition and completed a face-to-face interview questionnaire about dining experiences. Additional data came from participants’ medical charts, and each institution's food service manager completed a written questionnaire. Frequencies and logistic regressions were used to describe the sample and to examine relationships between risk of malnutrition and food service characteristics.Results: Overall, 37.4% of participants were at risk of malnutrition. Food service factors, including food packages, lids, and dishes that were difficult to manipulate (β=0.285, p=0.009), bulk food-delivery systems (β=1.329, p=0.036), overall food satisfaction (β=0.253, p=0.044), menu cycle length (β=-2.162, p=0.003), and porcelain dishes (β=-0.345, p=0.052), all were significantly associated with risk of malnutrition.Conclusions: Our findings clearly show a need for nursing homes to modify certain aspects of food service that may increase the risk of malnutrition among cognitively intact residents.
Berlin's Changing Memory Landscape: New Scholarship in German and English
Authors: Wüstenberg Jenny 
Published: May 2007

Claus Leggewie and Erik Meyer, “Ein Ort, an den man gerne geht” Das Holocaust-Mahnmal und die deutsche Geschichtspolitik nach 1989 (Munich: Carl Hanser Verlag, 2005)Karen E. Till, The New Berlin: Memory, Politics, Place (Minneapolis: University of Minnesota Press, 2005)Peter Carrier, Holocaust Monuments and National Memory Cultures in France and Germany since 1989: The Origins and Political Function of the Vél’ d’Hiv’ in Paris and the Holocaust Monument in Berlin (New York: Berghahn Books, 2005)
Ueber die Wirkung nicht‐leitender Körper bei der elektrischen Induction
Authors: Faraday M. , Riess P. 
Published: May 2007

AbstractDer nachfolgende Brief erklärt sich selbst. Ich habe darauf eine sehr verbindliche Antwort von Hrn. Riess erhalten, welche ich demselben hinzuzufügen wünsche. Ich habe das Englische der Antwort ein wenig geändert, hauptsächlich in einzelnen kleinen Worten und nur in solchen Fällen, wo ich glaubte, die Aenderung würde die Meinung des Verfassers klarer machen. Gewisse Ausdrücke von Hrn. Riess verlangen fast eine Antwort. In Bezug auf diese Fälle und um Zweideutigkeit in Betreff meiner eignen Meinung zu entfernen, habe ich gewagt, einige Anmerkungen hinzuzufügen, nicht um eine Discussion über Hypothesen zu erregen, sondern um meine Ansicht (dem Leser) zu erläutern. Es ist nicht die Pflicht oder das Amt eines Naturforschers Glauben zu dictiren, und jede Hypothese ist mehr oder weniger Sache des Glaubens; er hat nur seine Thatsachen und seine Schlüsse zu geben, und so viel von der Logik, welche die ersteren mit den letzteren verknüpft, als er für nothwendig halten mag; dann hat er das Ganze der wissenschaftlichen Welt zur gegenwärtigen, und, wie er zuweilen ohne Anmassung glauben darf, zur künftigen Beurtheilung zu überliefern.
Expression of two recombinant chloramphenicol acetyltransferase variants in highly reduced genome Escherichia coli strains
Authors: Sharma Shamik S. , Campbell John W. , Frisch David , Blattner Frederick R. , Harcum Sarah W. 
Published: May 2007

AbstractHighly reduced E. coli strains, MDS40, MDS41, and MDS42, lacking approximately 15% of the genome, were grown to high cell densities to test their ability to produce a recombinant protein with high yields. These strains lack all transposons and insertion sequences, cryptic prophage and many genes of unknown function. In addition to improving genetic stability, these deletions may reduce the biosynthetic requirements of the cell potentially allowing more efficient production of recombinant protein. Basic growth parameters and the ability of the strains to produce chloramphenicol acetyltransferase (CAT) under high cell density, batch cultivation were assessed. Although growth rate and recombinant protein production of the reduced genome strains are comparable to the parental MG1655 strain, the reduced genome strains were found to accumulate significant amounts of acetate in the medium at the expense of additional biomass. A number of hypotheses were examined to explain the accumulation of acetate, including oxygen limitation, carbon flux imbalance, and metabolic activity of the recombinant protein. Use of a non‐catalytic CAT variant identified the recombinant protein activity as the source of this phenomenon; implications for the metabolic efficiency of the reduced genome strains are discussed. Biotechnol. Bioeng. 2007;98: 1056–1070. © 2007 Wiley Periodicals, Inc.
Studies on aerosol delivery of plasmid DNA using a mesh nebulizer
Authors: Arulmuthu Eugene R. , Williams David J. , Baldascini Helen , Versteeg Henk K. , Hoare Mike 
Published: May 2007

AbstractAerosol delivery of plasmid DNA therapeutic solutions is promising for the treatment of respiratory diseases. However, it poses challenges, most significantly the need to protect the delicate supercoiled (sc) structure of plasmid during aerosolization. Nebulizers for liquid aerosolization using meshes appear a better method for delivery than conventional jet and ultrasonic nebulizers. This paper explores their application to the delivery of plasmid DNA. A computational fluid dynamics model of the dynamics of fluid flow through the nozzle of the MicroAIR® mesh nebulizer indicated high strain rates (>105 s−1) near the nozzle exit capable of causing damage to the shear‐sensitive plasmid DNA. Knowledge of the strain rates predicted using CFD and molecule size determined using atomic force microscopy (AFM) enabled estimation of the hydrodynamic force and whether damage of shear‐sensitive therapeutics was likely. Plasmids of size 5.7 and 20 kb were aerosolized in the mesh nebulizer. The sc structure of the 5.7‐kb plasmid was successfully delivered without damage, while aerosolization of the 20‐kb plasmid led to disintegration of the pDNA sc structure as observed in AFM. Subsequent formulation of the sc 20‐kb plasmid with PEI resulted in successful aerosol delivery. The maximum hydrodynamic forces computed for the aerosolization of structures of the size of 5.7‐kb and PEI formulated 20‐kb plasmids were less than the forces reported to damage the structure of double‐stranded DNA. A combination of CFD analysis and structure analysis may be used to predict successful aerosol delivery in such a mesh nebulizer. Biotechnol. Bioeng. 2007;98: 939–955. © 2007 Wiley Periodicals, Inc.
Coupling kinetic expressions and metabolic networks for predicting wine fermentations
Authors: Pizarro Francisco , Varela Cristian , Martabit Cecilia , Bruno Claudio , Pérez‐Correa J. Ricardo , Agosin Eduardo 
Published: May 2007

AbstractProblematic fermentations are commonplace and cause wine industry producers substantial economic losses through wasted tank capacity and low value final products. Being able to predict such fermentations would enable enologists to take preventive actions. In this study we modeled sugar uptake kinetics and coupled them to a previously developed stoichiometric model, which describes the anaerobic metabolism of Saccharomyces cerevisiae. The resulting model was used to predict normal and slow fermentations under winemaking conditions. The effects of fermentation temperature and initial nitrogen concentration were modeled through an efficiency factor incorporated into the sugar uptake expressions. The model required few initial parameters to successfully reproduce glucose, fructose, and ethanol profiles of laboratory and industrial fermentations. Glycerol and biomass profiles were successfully predicted in nitrogen rich cultures. The time normal or slow wine fermentations needed to complete the process was predicted accurately, at different temperatures. Simulations with a model representing a genetically modified yeast fermentation, reproduced qualitatively well literature results regarding the formation of minor compounds involved in wine complexity and aroma. Therefore, the model also proves useful to explore the effects of genetic modifications on fermentation profiles. Biotechnol. Bioeng. 2007;98: 986–998. © 2007 Wiley Periodicals, Inc.
Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms
Authors: Dembo Ron S. , Tulowitzki Ulrich 
Published: May 2007

AbstractWe present a general scheme for improving the asymptotic behavior of a given nonlinear programming algorithm without incurring a significant increase in storage overhead. To enhance the rate of convergence we compute search directions by partially solving a sequence of quadratic programming (QP) problems as suggested by Dembo [6]. The idea is illustrated on a class of extremely large nonlinear programming problems arising from traffic equilibrium calculations using both the Frank‐Wolfe and PARTAN algorithms to partially solve the QP subproblems. Computational results indicate that the convergence rate of the underlying algorithm is indeed enhanced significantly when Frank‐Wolfe is used to solve the QP subproblems but only marginally so in the case of PARTAN. It is conjectured, and supported by the theory [11], that with better algorithms for the QP subproblems the improvements due to the proposed framework would be more marked.
Minimum‐delay routing in continuous‐time dynamic networks with Piecewise‐constant capacities
Authors: Ogier Richard G. 
Published: May 2007

AbstractA single‐source single‐sink dynamic network is considered where the link flows are real‐valued measurable functions defined on a time interval and where storage is allowed at the nodes. Piecewise‐constant link and storage capacities are given. A τ‐maximum flow is a dynamic flow assignment that maximizes the total amount of commodity reaching the sink before time τ. The problem considered is that of computing a flow which is simultaneously τ‐maximum for all τ. Such a flow solves a minimum‐delay dynamic routing problem. An algorithm is presented which computes an optimal flow in O( | N | 4T4) time, where | N | is the number of nodes and T is the number of times that the capacities change. Previous polynomial‐time algorithms have been given only for the case of constant capacities.
Solving nonlinear multiple‐facility network location problems
Authors: Hooker J. N. 
Published: May 2007

AbstractWe show how to locate optimally p new facilities (servers) on a network so as to minimize cost, where cost can be any convex function of the distances between demand points (nodes) and a closest server. The algorithm is generally practical only for small p (perhaps 2, 3, or 4), but it admits a large number of servers with locations fixed beforehand. The classical p‐median, p‐center, and p‐facility cent‐dian problems are special cases. Other problems of this form include a large number of obnoxious facility problems, problems in which the objective is to minimize an Lk norm of distances, and a wide variety of problems, problems in which the objective is to minimize an Lk norm of distances, and a wide variety of problems in which equity or social welfare is a a factor.
Domination theory and the crapo β‐invariant
Authors: Huseby Arne Bang 
Published: May 2007

AbstractRelations are established between the domination and minimum domination invariants and a matroid invariant known as the Crapo β‐invariant. Using these results, it is possible to extend well‐known results of domination theory. Moreover, the proofs of these results are considerably simplified. Matroid theory is made available to reliability applications by introducing a certain regularity assumption.
The minimum augmentation of any graph to a K‐edge‐connected graph
Authors: Cai Guo‐Ray , Sun Yu‐Geng 
Published: May 2007

AbstractFor a graph G0 = (V, E0) and an integer K, how many edges are needed for augmenting G0 to a K‐edge‐connected graph? Results in the literature have answered this in several special cases such as when G0 is a tree, or when K = 2. In this paper, we settle the problem in the general case where G0 can be any multigraph and K can be any positive integer. We obtained both good characterization and good algorithm for the problem. Applications of our algorithm are suggested in designing a reliable network aiming at the most effective use of exising network.
A composite algorithm for a concave‐cost network flow problem
Authors: Balakrishnan Anantharam , Graves Stephen C. 
Published: May 2007

AbstractWe consider the problem of routing multiple commodities between various origin—destination pairs in a network, at minimum total cost. Economies of scale in arc flow costs are modeled using piecewise linear, concave total‐cost functions for each arc. This model applies to a variety of medium‐ and long‐term planning contexts including transportation planning, design of communication networks, plant location and capacity expansion planning, production planning, and water resource management. We formulate the general problem as a mixed‐integer program and develop a composite algorithm to generate both good lower bounds and heuristic solutions. We also report on computational results for several randomly generated general networks (with up to 40 nodes, 359 arcs, and 60 commodities) and layered neetworks (with up to 60 nodes, 372 arcs, and 60 commodities). These tests demonstrate that even for relatively large problems, the composite algorithm is very effective in generating solutions with small gaps between the upper and lower bounds (1.7% on average for general networks, and 0.4% on average for layered networks); for 19 out of the 25 layered network problems, the method generated and verified the optimal solution.
The maximum independent set problem for cubic planar graphs
Authors: Burns James E. 
Published: May 2007

AbstractA maximum independent set of a graph is a set of vertices with maximum cardinality such that no pair of vertices is connected by an edge. Choukhmane and Franco have presented a polynomial time approximation algorithm for the maximum independent set problem in cubic planar graphs. If M is taken as the ratio of the size of the independent set produced by their algorithm to the size of a maximum independent set of the input graph, then they show that their algorithm gives M ⩾ 6/7 for any cubic planar graph and M ⩾ 7/8 for a triangle‐free cubic planar graph. We give a new, stronger proof of thier result. The new proof shows that their algorithm actually gives M ⩾ 7/8 for all cubic planar graphs.
An algorithm for the resource constrained shortest path problem
Authors: Beasley J. E. , Christofides N. 
Published: May 2007

AbstractIn this paper we examine an integer programming formulation of the resource constrained shortest path problem. This is the problem of a traveller with a budget of various resources who has to reach a given destination as quickly as possible within the resource constraints imposed by his budget. A lagrangean relaxation of the integer programming formulation of the problem into a minimum cost network flow problem (which in certain circumstances reduces to an unconstrained shortest path problem) is developed which provides a lower bound for use in a tree search procedure. Problem reduction tests based on both the original problem and this lagrangean relaxation are given. Computational results are presented for the solution of problems involving up to 500 vertices, 5000 arcs, and 10 resources.
A continuous‐time network simplex algorithm
Authors: Anderson E. J. , Philpott A. B. 
Published: May 2007

AbstractGiven a network having costs and upper bound constraints on the flows in its arcs, the minimum‐cost network flow problem is that of finding flows which satisfy a flow‐conservation constraint at each node and minimize the total cost of the flow. If the arc capacities vary as functions of time, and storage is permitted at the nodes of the network, then the problem becomes an infinitedimensional linear program with a network structure. We describe an algorithm to solve such problems. This algorithm is a continuuous‐time version of the network simplex algorithm.
A new algorithm for general matching problems using network flow subproblems
Authors: Lessard Réjean , Rousseau Jean‐Marc , Minoux Michel 
Published: May 2007

AbstractWe describe a new algorithm for minimum cost perfect matching problems in arbitrary (nonbipartite) graphs based on an active constraint set strategy on the whole set of constraints defining the matching polytope (the so‐called Edmonds' constraints or blossom inequalities). At each step, the resulting subproblem reduces to a minium cost network flow problem which may be solved either via classical network flow algorithms, or via primal network flow algorithms. Finite convergence of the algorithm is proved under a nondegeneracy assumption and an anticycling procedure is defined for ensuring finite termination in degenerate cases. Computer experiments using a primal code for the network flow subproblems show that this approach appears to be competitive even with respect to the most efficient general matching codes currently described in the literature.
Edge‐vulnerability and mean distance
Authors: Favaron Odile , Kouider Mekkia , Mahéo Maryvonne 
Published: May 2007

AbstractThe mean distance of a simple connected graph G of order n is defined by magnified image We answer a problem of Plesnik about the edge‐vulnerability of G related to μ, i.e., we find a bound for μ(G − e) − μ(G) and for magnified image where e is an edge of G such that G − e is still conencted. This question is of interest in interconnection La distance moyenne d'un graphe G, simple et connexe, d'ordre n, est définie par magnified image Nous répondons ici à un problème de Plesnik sur l'arěte‐vulnérabilité de G par rapport à μ, i.e. nous trouvons une borne pour μ(G −e) − μ(G) et pour magnified image oú e est une arěte de G telle que G − e soit encore connexe.
Reduction tests for the steiner problem in grapsh
Authors: Duin C. W. , Volgenant A. 
Published: May 2007

AbstractBefore actually solving the Steiner problem in graphs, it is knwon that recution tests may reduce the problem size, e. g., by eliminating vertices from the graph. We improve existing tests and develop new techniques based on a bottleneck approach. The latter include optimal edge detection, edge elimination, and node elimination because of degree considerations. We give computational results of a recution algorithm on a large number of test problem. These problems have up to 200 vertices; their edge densities vary from sparse to complete with Euclidean weights as well as unifirmly random. The algorithm solves the majority of the test problems by recution tests only, and reduces the size of the remaining problems to at most one fourth of the original size.
The prize collecting traveling salesman problem
Authors: Balas Egon 
Published: May 2007

AbstractThe following is a valid model for an important class of scheduling and routing problems. A salesman who travels between pairs of cities at a cost depending only on the pair, gets a prize in every city that he vitis and pays a penalty to every city that he fails to visit, wishes to minimize his travel costs and net penalties, while visiting enough cities to collect a prescribed amount of prize money. We call this problem the Prize Collecting Traveling Salesman Problem (PCTSP). This paper discusses structural properties of the PCTS polytope, the convex hull of solutions to the PCTSP. In particular, it identifies several families of facet defining inequalities for this polytope. Some of these inequalities are related to facets of the ordinary TS polytope, others to facets of the knapsack polytope. They can be used in algorithms for the PCTSP either as cutting planes or as ingredients of a Lagrangean optimand.
On the separation number of a graph
Authors: Miller Zevi , Pritikin Dan 
Published: May 2007

AbstractWe consider the following graph labeling problem, introduced by Leung et al. (J. Y‐T. Leung, O. Vornberger, and J. D. Witthoff, On some variants of the bandwidth minimization problem. SIAM J. Comput. 13 (1984) 650–667). Let G be a graph of order n, and f a bijection from V(G) to the integers 1 through n. Let |f|, and define s(G), the separation number of G, to be the maximum of |f| among all such bijections f. We first derive some basic relations between s(G) and other graph parameters. Using a general strategy for analyzing separation number in bipartite graphs, we obtain exact values for certain classes of forests and asymptotically optimal lower bounds for grids and hypercubes.
A comparison of phase and nonphase network flow algorithms
Authors: Martel Charles 
Published: May 2007

AbstractWe compare the performance of network flow algorithms based on Dinic's layered graph approach to the new Goldberg‐Tarjan (GT) algorithm. We show that for networks with small capacities, in particular for unit networks, the Dinic‐like algorithms are asymptotically faster than the GT algorithm. A second setting that we study is parameterized flow computations. Gallo, Grigoriadis, and Tarjan have shown that the GT algorithm solves this type of problem very efficiently. We show that traditional implementations of the Dinic‐like algorithms are much less efficient for solving parameterized flow problems. We also give a new implementation of a Dinic‐like algorithm that is competitive with the GT algorithm on parameterized flow networks.
An algorithmic note on the gallai‐milgram theorem
Authors: Cameron Kathie 
Published: May 2007

AbstractFor any directed graph G with node‐set V(G), we present an O([V(G)]3) algorithm that finds a partition P of V(G) into directed paths and an independent set I of nodes, such that |P=|I| The existence of such a P and I is the Gallai‐Milgrm theorem. Where G is transitive and acyclic, the well‐known Dilworth theorem that min |P| = max |I| follows immediately. Where G is bipartitite and every edge of G is directed from node‐set U to node‐set V, P corresponds to a largest matching in G.
A combinatorial problem related to distributed loop networks
Authors: Du D.‐Z. , Hsu D. F. , Li Qiao , Xu Junming 
Published: May 2007

AbstractThe problem under consideration arises from studies on local networks and multimodule memory organizations. The ring network has been one of the popular network topologies used in the design and implementation of local area networks and other configurations. We consider here a generalization of the ring network by adding two fixed‐step links to each node. The resulting networks have low diameter, easy routing, and switching structure and therefore are suitable for implementation in the design of reliable networks. Let N denote the number of nodes in the network. For a given N, we are concerned with the problem of determining the best topologies to minimize the diameter (and, hence, the transmission delay) of the network. We obtain new classes of values of N for which topologies can be found that achieve the lower bound lb = [(√2N ‐ 1 ‐ 1)/2] for the minimum diameter. We also show that for some infinite classes of N this lower bound lb is not achievable.
Optimal location of a path or tree on a network with cycles
Authors: Richey Michael B. 
Published: May 2007

AbstractThis paper concerns the problem of locating a path‐ or tree‐shaped facility on a network. For median and center, min and max problems, we consider on which classes of networks the optimal facility location can be found in polynomial time. Some of these problems can be solved on series‐parallel graphs, but by high‐order polynomial‐ or pseudo‐polynomial‐time algorithms. Many of the problems that use pseudo‐polynomial time are shown to be NP‐complete on outerplanar graphs, a subset of series‐parallel graphs.