bluuebunny/crossref_metadata_2025_split huggingface dataset:
Greater Survival After Breast Cancer in Physically Active Women With High Vegetable-Fruit Intake Regardless of Obesity
Authors: Pierce John P. , Stefanick Marcia L. , Flatt Shirley W. , Natarajan Loki , Sternfeld Barbara , Madlensky Lisa , Al-Delaimy Wael K. , Thomson Cynthia A. , Kealey Sheila , Hajek Richard , Parker Barbara A. , Newman Vicky A. , Caan Bette , Rock Cheryl L. 
Published: June 2007

Purpose Single-variable analyses have associated physical activity, diet, and obesity with survival after breast cancer. This report investigates interactions among these variables. Patients and Methods A prospective study was performed of 1,490 women diagnosed and treated for early-stage breast cancer between 1991 and 2000. Enrollment was an average of 2 years postdiagnosis. Only seven women were lost to follow-up through December 2005. Results In univariate analysis, reduced mortality was weakly associated with higher vegetable-fruit consumption, increased physical activity, and a body mass index that was neither low weight nor obese. In a multivariate Cox model, only the combination of consuming five or more daily servings of vegetables-fruits, and accumulating 540+ metabolic equivalent tasks-min/wk (equivalent to walking 30 minutes 6 d/wk), was associated with a significant survival advantage (hazard ratio, 0.56; 95% CI, 0.31 to 0.98). The approximate 50% reduction in risk associated with these healthy lifestyle behaviors was observed in both obese and nonobese women, although fewer obese women were physically active with a healthy dietary pattern (16% v 30%). Among those who adhered to this healthy lifestyle, there was no apparent effect of obesity on survival. The effect was stronger in women who had hormone receptor–positive cancers. Conclusion A minority of breast cancer survivors follow a healthy lifestyle that includes both recommended intakes of vegetables-fruits and moderate levels of physical activity. The strong protective effect observed suggests a need for additional investigation of the effect of the combined influence of diet and physical activity on breast cancer survival.
Influence of Androgen Suppression Therapy for Prostate Cancer on the Frequency and Timing of Fatal Myocardial Infarctions
Authors: D'Amico Anthony V. , Denham James W. , Crook Juanita , Chen Ming-Hui , Goldhaber Samuel Z. , Lamb David S. , Joseph David , Tai Keen-Hun , Malone Shawn , Ludgate Charles , Steigler Allison , Kantoff Philip W. 
Published: June 2007

Purpose We evaluated whether the timing of fatal myocardial infarction (MI) was influenced by the administration of androgen suppression therapy (AST). Patients and Methods The study cohort comprised 1,372 men who were enrolled onto three randomized trials between February 1995 and June 2001. In the three trials, the men were randomly assigned to receive radiation therapy with 0 versus 3 versus 6, 3 versus 8, or 0 versus 6 months of AST. Fine and Gray's regression was used to determine the clinical factors associated with the time to fatal MI, and estimates of time to fatal MI were calculated using a cumulative incidence method. When comparing the cumulative incidence estimates using Gray's k-sample P values, increased weight was ascribed to the earlier data because recovery of testosterone is expected for most men within 2 years after short-course AST. Results Men age 65 years or older who received 6 months of AST experienced shorter times to fatal MIs compared with men in this age group who did not receive AST (P = .017) and men younger than 65 years (P = .016). No significant difference (P = .97) was observed in the time to fatal MIs in men age 65 years or older who received 6 to 8 months of AST compared with 3 months of AST. Conclusion The use of AST is associated with earlier onset of fatal MIs in men age 65 years or older who are treated for 6 months compared with men who are not treated with AST.
Phase II Study of Erlotinib in Patients With Malignant Pleural Mesothelioma: A Southwest Oncology Group Study
Authors: Garland Linda L. , Rankin Cathryn , Gandara David R. , Rivkin Saul E. , Scott Katherine M. , Nagle Raymond B. , Klein-Szanto Andres J.P. , Testa Joseph R. , Altomare Deborah A. , Borden Ernest C. 
Published: June 2007

Purpose Malignant pleural mesothelioma (MPM) expresses high levels of epidermal growth factor receptor (EGFR), and preclinical studies have identified antitumor activity of EGFR tyrosine kinase inhibitors (TKIs) in MPM. We conducted a phase II trial of the EGFR TKI erlotinib in previously untreated patients with MPM. Patients and Methods Patients with measurable and nonmeasurable disease were treated with erlotinib 150 mg/d on days 1 through 28 of each 28-day dosing cycle. Archived patient tumors were analyzed for immunohistochemical expression of EGFR, phospho-EGFR, human epidermal growth factor receptor 2 (HER2), phospho–extracellular signal-regulated kinase (ERK), and phosphatase and tensin homolog (PTEN) and phosphorylation of members of the phosphatidylinositol 3-kinase/Akt signaling pathway. Results Sixty-three patients were treated on the study. EGFR was highly expressed in 75% of patient tumors, as was phospho-ERK (82%), phospho-Akt (84%), phospho–mammalian target of rapamycin (74%), and phospho-forkhead (74%). HER2 was rarely expressed, and loss of PTEN was rare. For 33 patients with measurable disease, there were no objective responses; 14 patients (42%) had stable disease, 15 patients (45%) had disease progression, and four patients had inadequate assessments to determine response. Toxicities were mainly constitutional (51%), dermatologic (82%), and GI (52%); there was one death on trial, which was related to dyspnea. Median overall survival time was 10 months; 1-year survival rate was 43%; and median progression-free survival time was 2 months. Conclusion Single-agent erlotinib was not effective in MPM, despite high expression of EGFR. Activation of the ERK and phosphatidylinositol 3-kinase/Akt downstream pathways are possible resistance mechanisms to EGFR TKI. The activated phosphatidylinositol 3-kinase/Akt pathway is a potential therapeutic target for MPM.
Non‐linear principal component analysis of maximum expiratory flow‐volume curves
Authors: Van Pelt Wilfrid , Van Rijckevorsel Jan 
Published: June 2007

AbstractThe ability to classify maximum expiratory flow‐volume (MEFV) curves has been explored for several types of principal component analysis (PCA). The PCAs differed in their methods of transformation of the data. These included discrete non‐linear transformation with or without additional restrictions, or continuous linear (classical PCA) and piecewise linear transformation using first degree B‐splines.Two hundred and fifty curves of males between 21 and 30 years of age were involved in these analyses. Although no real pathology occurs among these males, still a clearly differentiated classification of curve types was found. The results were passively gauged with respect to smoking habits and respiratory symptoms. The analysis using piecewise linear transformations differentiated best between people with and without respiratory symptoms, and between smokers and non‐smokers.In general pathology is rare and to be found at the lower tail of a lung function measurement. As the piecewise linear transformations resulted in a more pronounced negative skewness of the relevant variables, the gain of this transformation with respect to the discrete analyses is to be found in the ability to use the information content within a category and with respect to the continuous linear analysis the ability to pronounce this information.
Bayesian estimation of mixed weibull exponential in life testing
Authors: Ashour S. K. 
Published: June 2007

AbstractThis paper deals with estimating the parameters of a mixed Weibull exponential model using a Bayesian method for type I censored samples. A numerical comparison between maximum likelihood and Bayes results has been carried out, using a numerical example and computer facilities for different prior information. Bayesian results in the cases of mixed exponential (complete and censored), single exponential and single Weibull may be consider as special cases of the results of this paper. The problem can be extended to the case of more than two causes of failure.
A top‐down hierarchical classification method
Authors: Hillion Hervé , Proth Jean‐Marie 
Published: June 2007

AbstractIn this paper we present an original top‐down hierarchical classification algorithm. In our approach we associate to each decomposition a ‘degree of separability’ which is used to evaluate the efficiency of the decomposition. In particular, it shows whether or not the classes are well separated and also whether or not they are homogeneous. This algorithm can be applied to items defined by real and bounded numbers.
Weighted decision trees where the cost of a test depends on its outcome
Authors: Bennett Matthew J. 
Published: June 2007

AbstractThe problem of choosing strategies which minimize the cost of decision tree testing is considered in the case where the cost of each test depends on its outcome. The classical entropy bound on the cost is derived and we propose an algorithm for decision tree design based on an extension of Huffman's construction. By comparing the mean costs for a large sample of randomly chosen situations, we show that this algorithm performs well compared with a number of previously published algorithms. The algorithms are also compared with optimal performance for a range of simple cases.
A non‐parametric method for fitting ROC curves for evaluation of industrial inspection performance
Authors: Jaraiedi Majid , Herrin Gary D. 
Published: June 2007

AbstractThe use of signal detection theory (SDT) in evaluation of the performance of an inspector on certain tasks requires the identification of the receiver operating characteristic (ROC) curve of the inspector. In this paper a functional form, Y = f(X), for the ROC equation is proposed, and two alternative approaches are developed for estimation of its parameters. This method does not require prior assumptions on the statistical distribution of the noise and signal‐plus‐noise. The application of the method is illustrated by the use of an example data set.
Necessary conditions for stochastic dominance: A general approach
Authors: Jean William H. , Helms Billy P. 
Published: June 2007

AbstractIn this paper a general method for developing necessary conditions for all degrees of stochastic dominance is derived. The method, a minimization of the expected value of certain functions of the random variable, is used to rederive known necessary conditions for dominance and is then used to derive new necessary conditions. Some of the old and new conditions are then compared empirically using a data set of security returns.
A comparison of various methods for obtaining confidence intervals for the design lowflow values of streams and rivers
Authors: Reeves Jaxk H. , McCormick William P. 
Published: June 2007

AbstractThis paper describes an intriguing use of two relatively new statistical procedures, the bootstrap and non‐stationary Markov modelling, to obtain confidence intervals for the design low‐flow parameter, of great interest to hydrologists. The procedure described is applied to the stream‐flow data gathered over more than 50 years from six gauging sites in Georgia, and is found to yield confidence intervals which are typically shorter than those given by traditional methods.
Prognostic of glial tumours: Presentation of the problem with solution
Authors: Commenges D. , Dartigues J.‐F. 
Published: June 2007

AbstractA study of glial tumours involving 192 cases is presented. Different issues are addressed: (i) the interrelationships between the histological variables, (ii) the problem of the prediction of the survival time, (iii) the causal role of the variables in the progress of the disease.We propose a three‐level grade which can be defined alternatively with perivascular lymphocites or with the signs necrosis and neovascularization.We constructed a predictive model based on the Cox model in which the variables were chosen according to Akaike's criterion.In the explanatory analysis we dropped the variables which could be considered as consequences rather than causes of the disease and we first tested groups of variables (factors): we found that age, the topology and the histology of the tumour were explanatory.
A markov process model for software reliability analysis
Authors: Xie M. 
Published: June 2007

AbstractSoftware reliability is a rapidly developing discipline. In this paper we model the fault‐detecting processes by Markov processes with decreasing jump intensity. The intensity function is suggested to be a power function of the number of the remaining faults in the software. The models generalize the software reliability model suggested by Jelinski and Moranda (‘Software reliability research’, in W. Freiberger (ed.), Statistical Computer Performance Evaluation, Academic Press, New York, 1972. pp. 465–497). The main advantage of our models is that we do not use the assumption that all software faults correspond to the same failure rate. Preliminary studies suggest that a second‐order power function is quite a good approximation. Statistical tests also indicate that this may be the case. Numerical results show that the estimation of the expected time to next failure is both reasonable and decreases relatively stably when the number of removed faults is increased.
Particle systems on flows
Authors: Cinlar Erhan , Kao John S. 
Published: June 2007

AbstractWe start with a stochastic flow of diffeomorphisms of the space. Particles enter the space at random times and places. Each particle is carried by the flow for some random amount of time. We examine the point process formed by the particles at a fixed time, on the evolution of that point process as time varies, and on the equilibrium law of the point process.
Recent developments in the statistical processing of textual data
Authors: Lebart Ludovic , Salem André , Berry Lisette 
Published: June 2007

AbstractStatisticians are accustomed to processing numerical, ordinal or nominal data. In many circumstances, such as socio‐economic, epidemiologic sample surveys and documentary data bases, this data is juxtaposed with textual data (for example, responses to open questions in surveys). This article presents a series of language‐independent procedures based upon applying multivariate techniques (such as correspondence analysis and clustering) to sets of generalized lexical profiles. The generalized lexical profile of a text is a vector whose components are the frequencies of each word (graphical form) or ‘repeated segment’ (sequence of words appearing with a significant frequency in the text). The processing of such large (and often sparse) vectors and matrices requires special algorithms. The main outputs are the following: (1) printouts of the characteristic words and characteristic responses for each category of respondent (these categories are generally derived from available nominal variables); (2) graphical displays of the proximities between words or segments and categories of respondents; (3) when analysing a combination of several texts: graphical displays of proximities between words or segments and each text, or between words or segments and groupings of texts. The systematic use of ‘repeated segments’ provides a valuable help in interpreting the results from a semantic point of view.
Extended skolem sequences
Authors: Baker C. A. 
Published: June 2007

AbstractA k‐extended Skolem sequence of order n is an integer sequence (s1, s2,…, s2n+1) in which sk = 0 and for each j ϵ {1,…,n}, there exists a unique i ϵ {1,…, 2n} such that si = si+j = j. We show that such a sequence exists if and only if either 1) k is odd and n ≡ 0 or 1 (mod 4) or (2) k is even and n ≡ 2 or 3 (mod 4). The same conditions are also shown to be necessary and sufficient for the existence of excess Skolem sequences. Finally, we use extended Skolem sequences to construct maximal cyclic partial triple systems. © 1995 John Wiley & Sons, Inc.
All v(3, t)'s exist for 3t + 1 a prime
Authors: Van Rees G. H. J. 
Published: June 2007

AbstractThe existence of a V(3,t), for any prime 3t+1 is proved constructively. A V(m,t) is equivalent to m idempotent pairwise orthogonal Latin squares of order (m+1)t + 1 with one hole of order t. © 1995 John Wiley & Sons, Inc.
Construction of new symmetric designs with parameters (66,26,10)
Authors: Matulić‐Bedenić I. , Horvatić‐Baldasar K. , Kramer E. 
Published: June 2007

AbstractIt is known that there exists only one (Tran van Trung's) design for (66,26,10) up to now. In this article we consider designs for (66,26,10) with the Frobenius group F39 and we prove that there exist (up to isomorphism) exactly 18 such designs. © 1995 John Wiley & Sons, Inc.We characterize the proper t‐wise balanced designs t−(v,K,1) for t ⩾ 3, λ = 1 and v ⩽ 16 with at least two block sizes. While we do not examine extensions of S(3,4,16)'s, we do determine all other possible extensions of S(3,K,v)'s for v ⩽ 16. One very interesting extension is an S(4, {5,6}, 17) design. © 1995 John Wiley & Sons, Inc.
Some results on (v,{5,w*})‐pbds
Authors: Bennett F. E. , Yin J. 
Published: June 2007

AbstractIn this article, we construct pairwise balanced designs (PBDs) on v points having blocks of size five, except for one block of size w ϵ {17,21,25,29,33}. A necessary condition for the existence of such a PBD is v ⩾ 4w + 1 and (1) v ≡ 1 or 5 (mod 20) for w = 21, 25; (2) v ≡ 9 or 17 (mod 20) for w = 17,29; (3) v ≡ 13 (mod 20) for w = 33. We show that these necessary conditions are sufficient with at most 25 possible exceptions of (v,w). We also show that a BIBD B(5, 1; w) can be embedded in some B(5, 1; v) whenever v ≡ w ≡ 1 or 5 (mod 20) and v ⩾ 5w − 4, except possibly for (v, w) = (425, 65). © 1995 John Wiley & Sons, Inc.
Largest bipartite subgraphs in triangle‐free graphs with maximum degree three
Authors: Bondy J. A. , Locke S. C. 
Published: June 2007

AbstractLet G be a triangle‐free, loopless graph with maximum degree three. We display a polynomial algorithm which returns a bipartite subgraph of G containing at least ⅘ of the edges of G. Furthermore, we characterize the dodecahedron and the Petersen graph as the only 3‐regular, triangle‐free, loopless, connected graphs for which no bipartite subgraph has more than this proportion.
Absolutely 3‐chromatic graphs
Authors: Evans Anthony B. 
Published: June 2007

AbstractA fold is a sequence of simple folds (elementary homomorphisms in which the identified vertices are both adjacent to a common vertex). It was shown in (C. R. Cook and A. B. Evans, Graph folding. Proceedings of the South Eastern Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, 1979, pp. 305–314) that all connected n‐chromatic graphs can be folded onto Kn. A connected n‐chromatic graph is called absolutely n‐chromatic if it can only be folded onto Km when m = n. Some classes of absolutely n‐chromatic graphs were given in Cook and Evans. In this paper, we classify the absolutely 3‐chromatic graphs.
A Mengerian theorem for paths of length at least three
Authors: Hager Michael 
Published: June 2007

AbstractLet be x, y two vertices of a graph G, such that t openly disjoint xy‐paths of length ≥3 exist. In this article we show that then there exists a set S of cardinality less than or equal to 3t – 2, resp. 2t for t ∈ {1, 2, 3}, which destroys all xy‐paths of length ≥3. Also a lower bound for the cardinality of S is given by constructing special graphs.
Two sufficient conditions for a 2‐factor in a bipartite graph
Authors: Katerinis P. 
Published: June 2007

AbstractIn this paper we prove that every 1‐tough bipartite graph which is not isomorphic to K1,1 has a 2‐factor. We also obtain a sufficient condition for the existence of a 2‐factor in a bipartite graph, in the spirit of Hall's theorem.
Toppling kings in a tournament by introducing new kings
Authors: Jing Huang , Weixuan Li 
Published: June 2007

AbstractA king of a tournament is a vertex which can reach any other vertex within two steps. Let K be the king set of a tournament T. A subset M of K is c‐topplable if there exists a supertournament T* of T such that there is a set N of c vertices in T * – T and (K – M) U N is exactly the king set of T*. A characterization of c‐topplable sets of kings is given in this paper.
A note concerning the chromatic index of multigraphs
Authors: Hilton A. J. W. , Jackson Bill 
Published: June 2007

AbstractWe improve an upper bound for the chromatic index of a multigraph due to Andersen and Gol'dberg. As a corollary we deduce that if no two edges of multiplicity at least two in G are adjacent, then χ′(G) ⩽ Δ(G) + 1. In addition we generalize results concerning the structure of critical graphs due to Vizing and to Chetwynd and Hilton.
Vertex‐disjoint paths and edge‐disjoint branchings in directed graphs
Authors: Whitty R. W. 
Published: June 2007

AbstractA theorem of J. Edmonds states that a directed graph has k edge‐disjoint branchings rooted at a vertex r if and only if every vertex has k edge‐disjoint paths to r. We conjecture an extension of this theorem to vertex‐disjoint paths and give a constructive proof of the conjecture in the case k = 2.
3‐Connected line graphs of triangular graphs are panconnected and 1‐hamiltonian
Authors: Broersma H. J. , Veldman H. J. 
Published: June 2007

AbstractA graph is k‐triangular if each edge is in at least k triangles. Triangular is a synonym for 1‐triangular. It is shown that the line graph of a triangular graph of order at least 4 is panconnected if and only if it is 3‐connected. Furthermore, the line graph of a k‐triangular graph is k‐hamiltonian if and only if it is (k + 2)‐connected (k ⩾ 1). These results generalize work of Clark and Wormald and of Lesniak‐Foster. Related results are due to Oberly and Sumner and to Kanetkar and Rao.
Four classes of perfectly orderable graphs
Authors: Chvátal V. , Hoàng C. T. , Mahadev N. V. R. , De Werra D. 
Published: June 2007

AbstractA graph is called “perfectly orderable” if its vertices can be ordered in such a way that, for each induced subgraph F, a certain “greedy” coloring heuristic delivers an optimal coloring of F. No polynomial‐time algorithm to recognize these graphs is known. We present four classes of perfectly orderable graphs: Welsh–Powell perfect graphs, Matula perfect graphs, graphs of Dilworth number at most three, and unions of two threshold graphs. Graphs in each of the first three classes are recognizable in a polynomial time. In every graph that belongs to one of the first two classes, we can find a largest clique and an optimal coloring in a linear time.
Cyclic coloration of 3‐polytopes
Authors: Plummer Michael D. , Toft Bjarne 
Published: June 2007

AbstractA cyclic coloration of a planar graph G is an assignment of colors to the points of G such that for any face bounding cycle the points of F have different colors. We observe that the upper bound 2ρ*(G), due to O. Ore and M. D. Plummer, can be improved to ρ*(G) + 9 when G is 3‐connected (ρ* denotes the size of a maximum face). The proof uses two principal tools: the theory of Euler contributions and recent results on contractible lines in 3‐connected graphs by K. Ando, H. Enomoto and A. Saito.
On matroid separations of graphs
Authors: Truemper Klaus 
Published: June 2007

AbstractLet K be a connected and undirected graph, and M be the polygon matroid of K. Assume that, for some k ⩾ 1, the matroid M is k‐separable and k‐connected according to the matroid separability and connectivity definitions of W. T. Tutte. In this paper we classify the matroid k‐separations of M in terms of subgraphs of K.