bluuebunny/crossref_metadata_2025_split huggingface dataset:
A case study of serial‐flow car disassembly: Ergonomics, productivity and potential system performance
Authors: Kazmierczak Karolina , Neumann W. Patrick , Winkel Jørgen 
Published: May 2007

AbstractA recent European Union (EU) directive increases demands on car recycling. Thus, present craft‐type disassembly systems need reconfiguration in order to be more efficient. A line‐based system tested in the Netherlands was investigated regarding system performance and ergonomics. The system had reduced performance compared to the design specifications due to such factors as system losses, operator inexperience, and teamwork deficiencies. Operators' peak low back loads were lower than in Swedish craft‐type systems. Direct, value‐adding work comprised 30% of the workday, compared to about 70% in the Swedish manufacturing industry. Alternative system configurations were simulated and discussed using a novel combination of flow and human simulations. For example, a smaller variation in cycle time implied higher output in number of cars per week and larger operator cumulative loading on the low back. In all models the cumulative load was high compared to the loads previously recorded in assembly work. © 2007 Wiley Periodicals, Inc. Hum Factors Man 17: 331–351, 2007.
Substrate adhesion affects contraction and mechanical properties of fibroblast populated collagen lattices
Authors: Chen Meng‐Yi , Sun Yu‐Long , Zhao Chunfeng , Zobitz Mark E. , An Kai‐Nan , Moran Steven L. , Amadio Peter C. 
Published: May 2007

AbstractFibroblasts can condense a hydrated collagen lattice to a tissue‐like structure. The purpose of this study was to evaluate the effect of substrate adhesion on the contraction and mechanical properties of fibroblast populated collagen lattices. Bacteriological grade polystyrene (BGPS) plates and tissue culture polystyrene (TCPS) plates were used as substrates for incubation of fibroblast populated collagen lattices. Hydrophobicity of the polystyrene surfaces was measured by the static sessile contact angle method. Collagen lattice contraction was recorded for 2 weeks, after which the lattices were mechanically tested. The BGPS culture plate had a significantly larger contact angle and was more hydrophobic than the TCPS culture plate. Both hydrophobicity and peripheral detachment of the collagen gel significantly decreased the time lag before initiation of gel contraction and increased the strength of the fibroblast populated collagen lattices. Substrate adhesion affects the contractility and strength of cell seeded collagen gels. This information may be useful in developing tissue engineered tendons and ligaments. © 2007 Wiley Periodicals, Inc. J Biomed Mater Res Part B: Appl Biomater 2008
Hyperthermia inhibits cell proliferation and induces apoptosis: Relative signaling status of P53, S100A4, and Notch in heat sensitive and resistant cell lines
Authors: Basile Antonio , Biziato Daniela , Sherbet Gajanan V. , Comi Paola , Cajone Francesco 
Published: May 2007

AbstractThe effects of hyperthermia on the expression of p53, the apoptosis‐associated genes Bax and Bcl‐2, Notch and S100A4 have been studied in the HepG2 cell line and the HUT cell line derived from HepG2, adapted for growth in hyperthermic conditions. Hyperthermia inhibits cell proliferation and induces apoptosis. HepG2 and HUT cells differed in respect of anchorage to growth surface, degree of proliferation and apoptosis and expression of p53, Bax, Bcl‐2, Notch, and S100A4 genes. The induction of apoptosis and the inhibition of cell proliferation occurred independently of p53, and independently also of involvement of the apoptosis family genes Bax and Bcl‐2. We demonstrate novel and marked differences between transient heat shock and heat adaptation in respect of pathways of signaling and generation of phenotypic effects in vitro. Different signaling patterns have been identified here. Pathways of signaling by S100A4, by its interaction with and sequestration of p53, and by Notch also seem differentially operational in the induction of apoptosis, and both appear to be activated as alternative pathways in the context of hyperthermia signaling independently of p53. J. Cell. Biochem. 103: 212–220, 2008. © 2007 Wiley‐Liss, Inc.
Continuous culture of two lancelets and production of the second filial generations in the laboratory
Authors: Zhang Qiu‐Jin , Sun Yi , Zhong Jing , Li Guang , Lü Xiao‐Mei , Wang Yi‐Quan 
Published: May 2007

AbstractThe lancelet is considered to be a promising laboratory model animal. To establish laboratory colonies of lancelet, we collected parental lancelets of Branchiostoma belcheri and B. japonicum (previously named as B. belcheri tsingtauense) with fully developed gonads from Xiamen Rare Marine Creature Conservation Areas (Fujian, China) on dates just before their spawning in the field in 2005. Those parental lancelets spawned spontaneously in the laboratory and produced thousands upon thousands of fertilized eggs. After carefully hatching and maintaining for almost 1 year, we successfully obtained about 500 first generation (F1) adults of B. belcheri and 3,300 of B. japonicum. Part of those F1 lancelets ripened and spontaneously spawned in 2006, and several thousands of second generation (F2) individuals of both species were produced. The young F2 lancelets are growing in good condition and some of B. japonicum initiated gonad development in December, 2006. Our experience emphasizes that cleanness of settlement substratum and sufficient food supply are important factors for long‐term culture of lancelets in the laboratory. J. Exp. Zool. (Mol. Dev. Evol.) 308B:464–472, 2007. © 2007 Wiley‐Liss, Inc.
Glial cell line‐derived neurotrophic factor protects astrocytes from staurosporine‐ and ischemia‐ induced apoptosis
Authors: Yu Albert Cheung Hoi , Liu Rong Yu , Zhang Yun , Sun Hao Rui , Qin Lu Ye , Lau Lok Ting , Wu Bing Yi , Hui Hung Kit , Heung Man Yeung , Han Ji Sheng 
Published: May 2007

AbstractGlial cell line‐derived neurotrophic factor (GDNF) promotes the survival and functions of neurons. It has been shown to be a promising candidate in the treatment of ischemia and other neurodegenerative diseases. We transfected mouse astrocytes in primary cultures with a human GDNF gene and found that their conditioned medium could not only support the growth and survival of cultured dopaminergic neurons but also protect astrocytes from staurosporine‐ and ischemia‐induced apoptosis. This indicated that these transfected astrocytes could release GDNF. A similar protective effect on astrocytes against apoptosis was evident when recombinant human GDNF was used. Moreover, GDNF reduced caspase‐3 activity but not that of caspase‐1 in cultured astrocytes after ischemia treatment. Thus, GDNF protects astrocytes from apoptosis by inhibiting the activation of caspase‐3. © 2007 Wiley‐Liss, Inc.
The use of conformation‐specific ligands and assays to dissect the molecular mechanisms of neurodegenerative diseases
Authors: Leliveld S. Rutger , Korth Carsten 
Published: May 2007

AbstractThe use of conformation‐specific ligands has been closely linked to progress in the molecular characterization of neurodegenerative diseases. Deposition of misfolded or misprocessed proteins is now recognized as a hallmark of all neurodegenerative diseases. Initially, dyes like Congo red and thioflavin T were used as crudely conformation‐specific ligands for staining the β‐sheeted protein components of amyloid deposits in neurodegenerative diseases such as Alzheimer disease (AD) and prion disease, the two diseases in which protein conformations were distinguished early on. This conformational characterization of extracellular protein deposits with dyes ultimately led to the identification of key players in the disease processes. The recent discovery of intermediate conformational species, i.e., soluble oligomers for AD and PK‐sensitive PrPSc for prion disease, whose conformation and assembly are thought to be distinct from both the physiological and the fibrillar conformational states, replaced the former notion that the microscopic protein deposits themselves caused disease. This insight and the generation of conformation‐specific monoclonal antibodies to these conformers further advanced diagnosis and the understanding of molecular mechanisms of AD and are likely to do so in other neurodegenerative diseases. Here we review how conformer distinction performed by a variety of different techniques, including biophysical, biochemical, and antibody‐based methods, led to the current molecular concepts of AD and the prion diseases. We provide an outlook on the application of these techniques in advancing the understanding of molecular mechanisms of other neurodegenerative diseases or degenerative brain conditions. © 2007 Wiley‐Liss, Inc.
Evidences of the cardioprotective potential of fruits: The case of cranberries
Authors: Ruel Guillaume , Couillard Charles 
Published: May 2007

AbstractEating a healthy balanced diet, is one of the most important and relevant ways to delay and prevent various health complications including cardiovascular disease (CVD). Among the nutritional factors that have been investigated in recent years, dietary fat intake may be the one that has been most targeted. However, there is also clear epidemiological evidence that increased fruits and vegetables intake can significantly reduce the risk of CVD, an effect that has been suggested to be resulting to a significant extent, from the high polyphenol content of these foods. Numerous polyphenolic compounds such as flavonoids have been identified as having strong antioxidant properties. Most interesting is the fact that, in addition to being one of the largest groups of antioxidant phytochemicals, flavonoids are also an integral part of the human diet as they are found in most fruits and vegetables. Cranberries are one of the most important sources of flavonoids that have a strong antioxidant and anti‐inflammatory capacities. Thus, consumption of cranberries or their related products could be of importance not only in the maintenance of health but also in preventing CVD. The following review will present evidences supported for the most part by clinical observations that cranberries can exert potentially healthy effects for your heart.
Antioxidant activity and antimicrobial effect of berry phenolics – a Finnish perspective
Authors: Heinonen Marina 
Published: May 2007

AbstractIn Finland, berries are part of the traditional diet significantly contributing to the intake of flavonoids and other phenolic compounds. Compositional data on phenolic compounds in berries has been rapidly accumulating and included in the national food composition database. Among the different bioactive substances in berries, phenolic compounds including flavonoids, tannins, and phenolic acids have received considerable interest due to their effects in food and health. A great amount of in vitro evidence exists showing that berry phenolics are powerful antioxidants. However, the antioxidant effect of berry phenolics is strongly dependent on the choice of berry raw material, as the antioxidant activity differs between the different phenolic constituents, including anthocyanins, ellagitannins, and proanthocyanidins. In foods, the antioxidant effect is also influenced by the structure of food. Tannin‐containing berries exhibit antimicrobial properties against pathogenic bacteria, thus offering many new applications for food industry. Much of the interest in berry phenolics has focused on cranberries and both cultivated and wild blueberries, although also other berries including black currants, cloudberries, lingonberries, and red raspberries posses promising bioactivities that may have relevance to human health. Antioxidant activity of berry phenolics, in addition to other mechanisms, may contribute to human health, but the possible relationship remains yet to be scientifically substantiated.
The shortest and the K‐shortest routes as assignment problems
Authors: Weintraub A. 
Published: May 2007

AbstractThe problem of finding a shortest route in a network with unrestricted costs is approached through solving an assignment problem associated to the network.The upper bound on the number of elementary calculations required for the solution is 0(m3). However, in most cases, the actual number of computations is considerably less and depends on different network characteristics than Dynamic Programming algorithms do. In examples of networks generated stochastically, this number was below 0(m2.5).A parametric analysis is presented. It is shown that if after a shortest route is determined, the costs on all arcs incident into or out of a node are modified in any form, at most 0(m2) elementary calculations will determine a new optimal solution. This feature, shared by Dynamic Programming algorithms only for cases where all cost decrease, can be applied to problems such as the determination of the K‐shortest routes and the K‐smallest assignments, leading to upper bounds of 0(Km3) in both cases.
The flow deviation method: An approach to store‐and‐forward communication network design
Authors: Fratta L. , Gerla M. , Kleinrock L. 
Published: May 2007

AbstractTwo problems relevant to the design of a store‐and‐forward communication network (the message routing problem and the channel capacity assignment problem) are formulated and are recognized to be essentially non‐linear, unconstrained multicommodity (m.c.) flow problems. A “Flow Deviation” (FD) method for the solution of these non‐linear, unconstrained m.c. flow problems is described which is quite similar to the gradient method for functions of continuous variables; here the concept of gradient is replaced by the concept of “shortest route” flow. As in the gradient method, the application of successive flow deviations leads to local minima. Finally, two interesting applications of the FD method to the design of the ARPA Computer Network are discussed.
Cutsets and partitions of hypergraphs
Authors: Lawler E. L. 
Published: May 2007

AbstractA hypergraph is a combinatorial structure with nodes and arcs, similar to an ordinary „linear”︁ graph, except that arcs are incident to arbitrary subsets of nodes, instead of pairs of nodes. Cutsets of hypergraphs are defined in a natural way, and it is shown that optimal cutsets can be found by means of a network flow computation. The optimal cutset computation can be used to generate a family of subsets of nodes, which we call LS sets. Intuitively, an LS set is a subset of nodes that are more strongly connected to each other than to nodes in the complementary set. LS sets are useful for constructing optimal or near‐optimal partitions of the nodes. A polynomial‐bounded partitioning algorithm is presented, and various applications are suggested.
A sufficient condition for a matrix to be totally unimodular
Authors: Commoner F. G. 
Published: May 2007

AbstractTwo conditions for a matrix to be totally unimodular are obtained; one sufficient, one necessary and sufficient. Both conditions involve a directed bipartite graph obtained from a {1, −1, 0}‐valued matrix, and both are generalizations of the fact that directed graphs and 2‐colorable undirected graphs have totally unimodular incidence matrices.
Implementation and computational comparisons of primal, dual and primal‐dual computer codes for minimum cost network flow problems
Authors: Glover F. , Karney D. , Klingman D. 
Published: May 2007

AbstractThis paper presents extensive computational experience with a special purpose primal simplex algorithm. The performance is compared to that of several “state of the art” out‐of‐kilter computer codes. The computational characteristics of several different primal feasible start procedures and pivot selection strategies are also examined.The study discloses the advantages, in both computation time and memory requirements, of the primal approach over the out‐of‐kilter method. The test environment has the following distinguishing properties: (1) all of the codes are tested on the same machine and the same problems, (2) the test set includes capacitated and uncapacitated transhipment networks, transportation problems, and assignment problems, and (3) problem sizes ranging from 200 to 8,000 nodes with up to 35,000 arcs are examined.
Control of an expanding network—“An operational nightmare”
Authors: Mauceri L. J. 
Published: May 2007

AbstractControl of a network, especially as it expands into new geographic areas, is one of the most important factors in assuring that both the reliability and availability of that network will not be adversely effected.When the General Electric Company first offered a commercial network as part of its Time‐Sharing service, only a small part of communications control was automated. The remainder of the control functions were performed manually. As the network grew from its infancy into what it is today, it could have become “An Operational Nightmare”.It became evident that it was necessary to develop into the network a completely automatic control system that would provide operations personnel with the tools for both recognizing and recovering from problems that might compromise either its availability or reliability. Included in this capability are the following:The ability to detect and display the status of all the nodes.The ability to detect and display the status of all links.The ability to introduce new software.The ability to measure the overall network performance.The ability to schedule preventive maintenance.The ability to detect imminent failures.This paper will show why this automated control system is necessary, how it is structured to record the pulse and heart‐beat of the network and finally how it is used to maintain the stability of the network.
Algorithms on circular‐arc graphs
Authors: Gavril F. 
Published: May 2007

AbstractConsider a finite family of non‐empty sets. The intersection graph of this family is obtained by representing each set by a vertex, two vertices being connected by an edge if and only if the corresponding sets intersect. The intersection graph of a family of arcs on a circularly ordered set is called a circular‐arc graph. In this paper we give a characterization of the circular‐arc graph and we describe efficient algorithms for recognizing two subclasses. Also, we describe efficient algorithms for finding a maximum independent set, a minimum covering by cliques and a maximum clique of a circular‐arc graph.
On the optional hamiltonian completion problem
Authors: Slater P. J. , Goodman S. E. , Hedetniemi S. T. 
Published: May 2007

AbstractThe Optional Hamiltonian Completion Problem is defined as follows: let the points V of a graph G be partitioned into a set V0 of optional points and a set V1 of non‐optional points; determine the minimum number of new lines which when added to G result in a graph which has a cycle containing every point of V1. This cycle may or may not contain optional points of V0. In this paper we present algorithms for solving this problem for trees, unicyclic graphs and cacti.
Generalized networks: Networks embedded on a matroid, part I
Authors: Bruno J. , Weinberg L. 
Published: May 2007

AbstractThe definition of ordinary electric networks is based on graphs. Since such a formulation is inadequate in many respects, we define a new network concept, namely, a generalized network, which is a network based on a matroid. To make the paper self‐contained an introduction to basic matroid theory is given in the first part of the paper. We then define a generalized network and formulate the network analysis and network synthesis problems for generalized networks. A number of new results are obtained for both analysis and synthesis and some old results for networks on graphs are generalized to networks on matroids. It is shown that the principle of duality, which does not hold for networks on graphs but is valid for generalized networks, adds power and insight for solving analysis and synthesis problems. The analysis problem, though formulated in terms of resistance networks, holds for networks containing all types of elements. The synthesis problem that is treated is the crucial one of the realization of a p‐port resistance network.
Low cost drainage networks
Authors: Lee D. H. 
Published: May 2007

AbstractAn approach to reducing the cost of drainage networks, such as plumbing networks in buildings, is described. The drain design problem is modelled as a specialized mathematical network called a drainage network; it is shown to be related to the Steiner problem in a directed graph. A procedure which yields a good approximation to the minimum cost drainage network is described. The theoretical solution is implemented in practice via an interactive computer routine which allows for the network to be fitted to the real building. Examples of the application of the approach are given.
A primal algorithm for solving a capacitated network flow problem with additional linear constraints
Authors: Chen S. , Saigal R. 
Published: May 2007

AbstractA variant of the revised simplex method is given for solving capacitated network flow problems with additional linear constraints. The mathematical development, computer implementation and computational experience are presented. The algorithm described uses a working basis of size equal to the number of additional linear constraints for pivoting, pricing, and inversion, which for large networks, can result in a substantial reduction of computation over a standard linear programming approach.
Implementing vehicle routing algorithms
Authors: Golden B. L. , Magnanti T. L. , Nguyen H. Q. 
Published: May 2007

AbstractHeuristic programming algorithms frequently address large problems and require manipulation and operation on massive data sets. The algorithms can be improved by using efficient data structures. With this in mind, we consider heuristic algorithms for vehicle routing, comparing techniques of Clarke and Wright, Gillett and Miller, and Tyagi, and presenting modifications and extensions which permit problems involving hundreds of demand points to be solved in a matter of seconds. In addition, a multi‐depot routing algorithm is developed. The results are illustrated with a routing study for an urban newspaper with an evening circulation exceeding 100,000.
Tree decomposition algorithm for large networks
Authors: Blewett W. J. , Hu T. C. 
Published: May 2007

AbstractDecomposition algorithms have been proposed for finding the shortest paths between all pairs of nodes in a large network. The central idea is to treat the large network as several small networks overlapping each other. When the small networks overlap each other linearly, algorithms have been proposed to treat each small network individually. The present note treats the case of small networks overlapping each other like a tree.
Cost allocation for steiner trees
Authors: Megiddo N. 
Published: May 2007

AbstractA set of points, called consumers, and another point called central supplier, are located in a Euclidean plane. The cost of constructing a connection between two points is proportional to the distance between them. The minimum cost required for connecting all the consumers to the supplier is given by a minimal Steiner tree. An example is given in which for every allocation of the total cost of the tree to the consumers, a coalition of consumers exists, which is charged more than the cost required for connecting its members to the central supplier.
Unicyclic realizability of a degree list
Authors: Boesch F. T. , Harary F. 
Published: May 2007

AbstractSimple necessary and sufficient conditions for a list of integers to be the degrees of the points of a tree are wellknown. Unicyclic graphs, which are connected graphs with exactly one cycle, are considered here. A simple set of necessary and sufficient conditions for a list of integers to be the degrees of the points of such a graph is derived.