bluuebunny/crossref_metadata_2025_split huggingface dataset:
Expression of LIM kinase 1 is associated with reversible G1/S phase arrest, chromosomal instability and prostate cancer
Authors: Davila Monica , Jhala Darshana , Ghosh Debashis , Grizzle William E , Chakrabarti Ratna 
Published: June 2007

Abstract

Background
LIM kinase 1 (LIMK1), a LIM domain containing serine/threonine kinase, modulates actin dynamics through inactivation of the actin depolymerizing protein cofilin. Recent studies have indicated an important role of LIMK1 in growth and invasion of prostate and breast cancer cells; however, the molecular mechanism whereby LIMK1 induces tumor progression is unknown. In this study, we investigated the effects of ectopic expression of LIMK1 on cellular morphology, cell cycle progression and expression profile of LIMK1 in prostate tumors.

Results
Ectopic expression of LIMK1 in benign prostatic hyperplasia cells (BPH), which naturally express low levels of LIMK1, resulted in appearance of abnormal mitotic spindles, multiple centrosomes and smaller chromosomal masses. Furthermore, a transient G1/S phase arrest and delayed G2/M progression was observed in BPH cells expressing LIMK1. When treated with chemotherapeutic agent Taxol, no metaphase arrest was noted in these cells. We have also noted increased nuclear staining of LIMK1 in tumors with higher Gleason Scores and incidence of metastasis.

Conclusion
Our results show that increased expression of LIMK1 results in chromosomal abnormalities, aberrant cell cycle progression and alteration of normal cellular response to microtubule stabilizing agent Taxol; and that LIMK1 expression may be associated with cancerous phenotype of the prostate.
Depression, Immunity, and Survival in Patients With Hepatobiliary Carcinoma
Authors: Steel Jennifer L. , Geller David A. , Gamblin T. Clark , Olek Marion C. , Carr Brian I. 
Published: June 2007

PurposeThe aims of the present study were to assess the prevalence of depressive symptoms at diagnosis, test the association between depressive symptoms and survival, and preliminarily test a mediational model of depression, immunity, and survival in patients with hepatobiliary carcinoma (HBC).Patients and MethodsOne hundred one patients diagnosed with HBC were prospectively studied. Depressive symptoms were measured at diagnosis using the Center for Epidemiological Studies Depression Scale (CES-D). Sociodemographic and disease-specific data were gathered from the patients' charts. In a subsample of patients, stress; alcohol, tobacco, and drug use; sleep quality; physical activity; social support; natural killer (NK) cell number and cytotoxicity; and plasma levels of interleukin (IL) -4, IL-5, tumor necrosis factor alpha, and interferon gamma were measured. Survival was measured from date of diagnosis to death.ResultsAt diagnosis, 37% of patients reported a CES-D score of ≥ 16 (clinical range). Using Cox regression analysis, sociodemographic and disease-specific variables and CES-D score significantly predicted survival (Breslow χ2= 32.4, P = .006). Only vascular invasion (P = .001) and CES-D score ≥ 16 (P = .03) were significant predictors. In a subsample of 23 patients, patients who reported a CES-D score of ≥ 16 were found to have significantly lower NK cell numbers than patients who reported a CES-D score of less than 16 (F1,21= 9.39, P = .003). A robust trend was found in which NK cell number was associated with survival. A mediational model linking depressive symptoms and survival, with NK cell number as a mediator, was preliminarily supported.ConclusionSecondary to the high prevalence of depressive symptoms and impact on survival, psychological and pharmacologic interventions should be designed and implemented in patients diagnosed with HBC.
Book Reviews
Authors: Stohlman Sarah Michelle , Szczepaniková Alice , Ignaczak Ewa , Visser Oane , Scholliers Peter , van der Geest Sjaak , Vermeulen Hans , Płonka Tomasz , TImmer Jaap , Salemink Oscar 
Published: June 2007

Sarah Ahmed, Claudia Castañeda, Anne-Marie Fortier, and Mimi Sheller (eds.), Uprootings/regroundings: questions of home and migrationSusanne Binder and Jelena Tošič (eds.), Refugee studies and politics: human dimensions and research perspectives, and Philomena Essed, Georg Frerks, and Joke Schrijvers (eds.), Refugees and the transformation of societies: agency, policies, ethics and politicsPaul John Eakin (ed.), The ethics of life writingChris Hann and the ‘Property Relations’ group, The postsocialist agrarian question: property relations and the rural conditionAnne J. Kershen (ed.), Food in the migrant experienceMichael Lambek and Paul Antze (eds.), Illness and irony: on the ambiguity of suffering in cultureCristóbal Mendoza, Labour immigration in Southern Europe: African employment in Iberian labour marketsThomas Carl Patterson, Marx’s ghost: conversations with archaeologistsAdam Reed, Papua New Guinea’s last place: experiences of constraint in a postcolonial prisonShinji Yamashita and J. S. Eades (eds.), Globalization in Southeast Asia: local, national and transnational perspectives
Risikoanalyse und Kostenwirksamkeit bei der Massnahmenplanung – Beispiel Diesbach | Risk analysis and cost efficiency of measure planning – the example of Diesbach
Authors: Gächter Markus , Bart Rolf 
Published: June 2007

The region under survey around Diesbach takes in an area of approx. 11.7 km2. Along the perimeter are former rubble and refuse heaps, as well as a number of the typical side channels arising from the protrusions of debris of more recent times. In keeping with the high water flows, along a stretch of about 300 m the Diesbach is channelled along a plaster-coated basin. An integral project, set up in 2000, had the aim of producing a concept for measures to be taken to reduce risk based on a comprehensive hazard and risk analysis. In addition, the project called for the cost efficiency of measures.
The elaboration of the project followed guideline set out by the Canton for the protection from natural hazards. Risk analysis,as an instrument of projects aimed at natural hazards, lies at the centre of these guidelines, because it is inadequate to merely identify changes in danger levels. The risk posed by the Diesbach is expressed in an annual expected damage value of approx. 120 000 Swiss francs. The measure concept will cost approx. 1.6 million Swiss francs and takes into account the problem of loose deposit as well as driftwood with a cost/earning ratio of about 2. The project shows the advantages of a risk-based solution in an exemplary way.
A statistical approach to logical inference in endocrine physiopathology
Authors: Thiry S. , Bouckaert A. 
Published: June 2007

AbstractA combined logical‐statistical approach is suggested here for endocrine physiopathological inference. The prior knowledge of the endocrine system is formalized by a Boolean model. Boolean equations are solved to estimate prior probability distributions. A Bayesian strategy, taking into account the observational errors, is used to solve a specific endocrine problem.
Diagnosing departures from stability in a multidimensional multivariate system
Authors: Gheva David 
Published: June 2007

AbstractThis paper deals with a system containing n m‐variable elements measured at p points of time. The data matrices for each point of time are represented by the biplot technique. Each biplot provides a map of the system which can be used to determine visually the relations between the elements and variables. The biplots are then compared by superimposing them to obtain an ‘aggregate’ graph. Differences between the biplots indicate departure from stability of the system. An example drawn from the Israeli banking system is provided.
Subjective probability and causality assessment
Authors: Lane David A. 
Published: June 2007

AbstractSerious adverse reactions to a drug usually occur too rarely to be identified in the clinical trials required to demonstrate efficacy before the drug can be put on the market. Instead, they are generally first encountered in the uncontrolled world of everyday clinical practice, and the industrial and national regulatory agencies that are responsible for drug safety must rely for their first indications of a possible drug‐adverse event connection on case reports submitted to them by practitioners who observe an occurrence of the event in one of their patients taking the drug. A typical situation in the work of these agencies finds a group of experts assembled around a table reviewing a small series of case reports (perhaps as small as one!) that link a particular drug with a particular type of adverse event. The experts want to determine whether, for each case in their series, the available evidence indicates that the drug caused the adverse event to occur. How are they to proceed? This paper outlines an approach to this problem, based on the use of subjective probability.
Constructing weighing matrices by the method of weaving
Authors: Craigen R. 
Published: June 2007

AbstractWe describe a way of obtaining new weighing matrices from old, which we call weaving because it involves distributing rows and columns of given matrices along the columns and rows of an array to form a partitioned matrix whose blocks have rank one. The method generalizes both the direct sum and direct product of matrices. We use the method to construct some new weighing matrices of relatively small order. © 1995 John Wiley & Sons, Inc.
Graphs with constant link and small degree or order
Authors: Hall J. I. 
Published: June 2007

AbstractThe graph G has constant link L if for each vertex x of G the graph induced by G on the vertices adjacent to x is isomorphic to L. For each graph L on 6 or fewer vertices we decide whether or not there exists a graph G with constant link L. From this we are able to list all graphs on 11 or fewer vertices which have constant link.
Representing groups by graphs with constant link and hypergraphs
Authors: Vogler Walter 
Published: June 2007

AbstractA graph L is called a link graph if there is a graph G such that for each vertex of G its neighbors induce a subgraph isomorphic to L. Such a G is said to have constant link L. We prove that for any finite group Γ and any disconnected link graph L with at least three vertices there are infinitely many connected graphs G with constant link L and AutG ⋍ Γ. We look at the analogous problem for connected link graphs, namely, link graphs that are paths or have disconnected complements. Furthermore we prove that for n, r ≥ 2, but not n = 2 = r, any finite group can be represented by infinitely many connected r‐uniform, n‐regular hypergraphs of arbitrarily large girth.
A criterion for the planarity of a graph
Authors: Breitenbach Jerome R. 
Published: June 2007

AbstractIn a recent paper, Carsten Thomassen [Carsten Thomassen, Planarity and duality of finite and infinite graphs. J. Combinatorial Theory Ser. B 29 (1980) 244–271] has shown that a number of criteria for the planarity of a graph can be reduced to that of Kuratowski. Here we present another criterion which, as well, is easily proved via Kuratowski's. The criterion is based on the observation that the imbedding of a graph in a plane imposes a cyclic ordering, say clockwise, on the edges incident with each vertex, and that these cyclic orderings are related.
Subcontraction‐equivalence and Hadwiger's conjecture
Authors: Woodall D. R. 
Published: June 2007

AbstractThe concept of subcontraction‐equivalence is defined, and 14 graph‐theoretic properties are exhibited that are all subcontraction‐equivalent if Hadwiger's conjecture is true. Some subsets of these properties are proved to be subcontraction‐equivalent anyway. Hadwiger's conjecture is expressed as the union of three independent and strictly weaker subconjectures. As a first step toward one of these subconjectures, it is proved that a graph that does not have Km+1 as a subcontraction must contain an independent set consisting of at least 1/2(m − 1) of its vertices.
On unavoidable hypergraphs
Authors: Chung F. R. K. , Erdös P. 
Published: June 2007

AbstractA r‐uniform hypergraph H (or a r‐graph, for short) is a collection E = E(H) of r‐element subsets (called edges) of a set V = V(H) (called vertices). We say a r‐graph H is (n, e)‐unavoidable if every r‐graph with n vertices and e edges must contain H. In this paper we investigate the largest possible number of edges in an (n, e)‐unavoidable 3‐graph for fixed n and e. We also study the structure of such unavoidable 3‐graphs.
Diameter increase caused by edge deletion
Authors: Schoone A. A. , Bodlaender H. L. , Van Leeuwen J. 
Published: June 2007

AbstractWe consider the following problem: Given positive integers k and D, what is the maximum diameter of the graph obtained by deleting k edges from a graph G with diameter D, assuming that the resulting graph is still connected? For undirected graphs G we prove an upper bound of (k + 1)D and a lower bound of (k + 1)D − k for even D and of (k + 1)D − 2k + 2 for odd D ⩾ 3. For the special cases of k = 2 and k = 3, we derive the exact bounds of 3D − 1 and 4D − 2, respectively. For D = 2 we prove exact bounds of k + 2 and k + 3, for k ⩽ 4 and k = 6, and k = 5 and k ⩾ 7, respectively. For the special case of D = 1 we derive an exact bound on the resulting maximum diameter of order θ(√k). For directed graphs G, the bounds depend strongly on D: for D = 1 and D = 2 we derive exact bounds of θ(√k) and of 2k + 2, respectively, while for D ⩾ 3 the resulting diameter is in general unbounded in terms of k and D. Finally, we prove several related problems NP‐complete.
Chromatic factorizations of a graph
Authors: Hakimi S. Louis , Schmeichel Edward F. 
Published: June 2007

AbstractLet n1 ⩾ n2 ⩾ …︁ ⩾ nk ⩾ 2 be integers. We say that G has an (n1, n2, …︁, nk‐chromatic factorization if G) can be edge‐factored as G1 ⊕ G2 ⊕ …︁ ⊕ Gk with χ(Gi) = nAi, for i = 1,2,…, k. The following results are proved:
If (n1 − 1)n2 …︁ nk < χ(G) ⩽ n1n2 …︁ nk, then G has an (n1, n2, …︁, nk)‐chromatic factorization.
If n1 + n2 + …︁ + nk − (k ‐ 1) ⩽ n ⩽ n1n2 …︁ nk, then Kn has an (n1, n2, …︁, nk)‐chromatic factorization.
Some unavoidable subdigraphs of tournaments
Authors: Petrović Vojislav 
Published: June 2007

AbstractLet H(n, i) be a simple (n − 1)‐path v1 → v2 → …︁ → vn with an additional arc v1vi (3 ⩽ i ⩽ n). We prove that for each n and i (3 ⩽ i ⩽ n), with few exceptions, every n‐tournament Tn contains a copy of H(n, i).
Rectilinear drawings of graphs
Authors: Thomassen Carsten 
Published: June 2007

AbstractWe consider graphs drawn in the plane such that every edge crosses at most one other edge. We characterize, in terms of two forbidden sub‐configurations, which of these graphs are equivalent to drawings such that all edges are straight line segments. As a consequence we obtain a complete characterization of the pairs of dual graphs that can be represented as geometric dual graphs such that all edges except one are straight line segments.
Average distance in graphs with removed elements
Authors: Bienstock D. , Györi E. 
Published: June 2007

AbstractThe average distance in a graph is defined as the average length of a shortest path between two vertices, taken over all pairs of vertices. This parameter can be contrasted with the diameter as a description of the metrical properties of the graph. If a vertex or edge is removed from a graph, in the worst case the average distance will increase. In this paper we consider the question, How small can the increase be if we choose the vertex or edge appropriately? If the graph is a cycle, the increase is roughly by a factor of 4/3. P. Winkler conjectured that any graph contains a vertex whose removal will not increase the average distance by more than a factor of 4/3. A similar conjecture can be made about removed edges, provided, for example, that the graph is 2‐edge‐connected. We prove the stronger statement that the edge version of the conjecture is true if the graph has no vertices of degree one. We also give an asymptotic affirmative answer for the vertex version.
Claw‐free graphs are edge reconstructible
Authors: Ellingham M. N. , Pyber L. , Yu Xingxing 
Published: June 2007

AbstractThe Edge Reconstruction Conjecture states that all graphs with at least four edges are determined by their edge‐deleted subgraphs. We prove that this is true for claw‐free graphs, those graphs with no induced subgraph isomorphic to K1,3. This includes line graphs as a special case.
On minimum degree in Hamiltonian path graphs
Authors: Hendry George R. T. 
Published: June 2007

AbstractFor integers p and s satisfying 2 ⩽ s ⩽ p − 1, let m(p,s) denote the maximum number of edges in a graph G of order p such that the minimum degree in the hamiltonian path graph of G equals s. The values of m(p, s) are determined for 2 ⩽ s ⩽ p/2 and for (2p − 2)/3 ⩽ s ⩽ p − 1, and upper and lower bounds on m(p, s) are obtained for p/2 < s < (2p − 2)/3.
On the maximum number of pairwise compatible euler cycles
Authors: Fleischner H. , Hilton A. J. W. , Jackson Bill 
Published: June 2007

AbstractB. Jackson [4] made the following conjecture: If G is an Eulerian graph with δ(G) ≥ 2k, then G has a set of 2k ‐ 2 pairwise compatible Euler cycles (i.e., every pair of adjacent edges appears in at most one of these Euler cycles as a pair of consecutive edges). We verify this conjecture in the case where every circuit of G is a block of G.
Kanonische Transformationen, Lagrangesche und Poissonsche Klammern
Authors: Schräpel H. D. 
Published: June 2007

AbstractDie Abhängigkeit der Lösungen der Hamiltonschen Gleichungen von ihren Anfangswerten wird untersucht. Mit Hilfe von zwei bekannten Sätzen folgen symmetrische Beziehungen in den Ableitungen. Weitere Bedingungen liefern erste Integrale. Schließlich werden die entwickelten Theoreme auch kanonische Transformationen erweitert.
Stationary Fundamental Solution for an Ideal Fluid in Uniform Motion
Authors: Dragoş L. , Homentcovschi D. 
Published: June 2007

AbstractThe fundamental solution of the system of equations describing an ideal fluid, linearized about an uniform motion, as well as the fundamental matrix of same system are given. As an application the perturbation caused by mass, momentum and energy sources, moving with constant relocity along the direction of an uniform current is determined.
Die inkompressible Strömung am Staupunkt schlanker Körper
Authors: Oswatitsch K. 
Published: June 2007

AbstractIn der üblichen Näherungstheorie für die inkompressible, stationäre Umströmung nicht angestellter schlanker Körper und Flügel wird mit Quellbelegungen von Körperachsen oder Flügelebenen gearbeitet. Dabei treten am Belegungsbeginn logarithmische Singularitäten der Geschwindigkeit auf. Dieser in einem kleinen Bereich auftretende Staupunktsfehler wird behoben.
Dynamic Response of a Circular Beam on a Wieghardt‐Type Elastic Foundation
Authors: Celep Z. 
Published: June 2007

AbstractStarting from the two dimensional formulation of the Wieghardt‐type elastic foundation, the deflection of the foundation surface subjected to an arbitrarily distributed circular load is determined using the method of harmonic analysis. Based on this result, the dynamic response of a circular beam resting on a Wieghardt‐type elastic foundation and subjected to a harmonic load is obtained. Numerical results are plotted for the free vibration as well as for the two types of forced vibration of the circular beam.
On the Rotation of an Axially Symmetric Body in Couple Stress Fluids
Authors: Ramkissoon H. 
Published: June 2007

AbstractThe Stokes' flow due to the rotation of an axially symmetric body in couple stress fluids is examined. General solutions are obtained and with the aid of a concentrated point couple, a simple formula for the couple experienced by the body is derived in terms of the angular velocity of the flow field. The results are then applied to the particular case of a sphere.
Rounding Error Analysis of Interval Algorithms
Authors: Stummel F. 
Published: June 2007

AbstractUsing the linearization method, a rounding error analysis of interval algorithms is established. It is shown that the interval midpoints and radii are approximate solutions of real evaluation algorithms and of certain linear systems uniquely associated to each interval algorithm. In addition, interval data and interval rounding condition numbers are defined which yield optimal bounds of the possible magnitude of the interval radii. These concepts and tools are applied to the following numerical examples: evaluation of a polynomial, continued fraction expansion, summation procedure, and Cramer's rule for two linear equations in two unknowns.
Zufallsschwingungen unter schmalbandiger Parametererregung
Authors: Schmidt G. , Wenzel V. 
Published: June 2007

AbstractUntersucht werden die Schwingungen eines Systems mit schmalbandiger Zufallsparametererregung und nichtlinearen Dämpfungs‐ und Rückstellkräften, dabei wird die Integralgleichungsmethode benutzt. für die Verteilungsdichte der Resonanzamplituden und die Wahrscheinlichkeit von Amplituden oberhalb eines bestimmten Niveaus werden Formeln und numerische Beispiele angegeben.
Zur Dimension der Äste von Verzweigungsdiagrammen
Authors: Collatz L. 
Published: June 2007

AbstractIn den Anwendungen sind sehr viele verschiedenartige Verzweigungsaufgaben auf Computern durchgerechnet worden (s. z. B. Ockendon [9] und viele andere), bei denen zuweilen merkwürdige Verzweigungsphänomene auftreten. Hier sollen nur die Erscheinungen mit verschiedenen Dimensionen der einzelnen Äste betrachtet werden, und auch nur Fälle, in denen die Äste durch analytische Ausdrücke gegeben sind. Schließlich sollen sich die Betrachtungen auf einfache Fälle beschränken, bei denen man die Äste explizit ausrechnen und angeben kann, so daß man sicher sein kann, alle Äste erfaßt zu haben. Daher werden nur einfache Modellbeispiele herausgegriffen, während die in den Anwendungen auftretenden Fälle häufig so kompliziert sind, daß man nur noch numerisch rechnen kann.
Eigenvectors of H‐Selfadjoint Matrices
Authors: Lancaster P. , Rózsa P. 
Published: June 2007

AbstractProperties of the right eigenvectors associated with the conjugate pairs of complex eigenvalues of H‐selfadjoint matrices are investigated. Making use of the solution of certain matrix equations, explicit formulae are obtained expressing the connection between the complete sets of right Jordan chains corresponding to the complex conjugate eigenvalues.
The Time Dependent Deformation of a Capsule in an Arbitrary Stokes Flow
Authors: Brunn P. O. 
Published: June 2007

AbstractThis paper is concerned with the time‐dependent deformation of a spherical capsule suspended in a viscous fluid. The basic assumptions are that (a) the flow in the fluid regions is governed by the Stokes' equations, (b) the deformation is small, and (c) the membrane is purely elastic. Condition (b) requires either the elastic time scale to be small in comparison with a characteristic flow time (i.e., a sufficiently stiff membrane and/or a sufficiently weak flow field) or the inside fluid to be highly viscous. It also allows us to employ a linearly elastic constitutive equation for the membrane, as first approximation. The general results obtained are compared with corresponding results for surface tension droplets. The case of sedimentation in a quiescent fluid, a capsule freely suspended in a linear flow field, and steady‐state results for quadratic flow fields (with emphasis on circular Poiseuille flow) are studied.