bluuebunny/crossref_metadata_2025_split huggingface dataset:
Relationship of abdominal pressure and body mass index in men with LUTS
Authors: McIntosh Stuart , Drinnan Michael , Griffiths Clive , Robson Wendy , Ramsden Peter , Pickard Robert 
Published: September 2003

AbstractAimsIn the development of a non‐invasive method for estimating isovolumetric intravesical pressure (pves,isv) we looked for a relationship between intra‐abdominal pressure (pabd) and general build, expressed as body mass index (BMI) in men with lower urinary tract symptoms (LUTS).Materials and MethodsIn 100 consecutive male patients undergoing an invasive pressure flow study (PFS) the pabd was recorded continuously during filling and voiding. The magnitude at four set points was measured: before filling, after filling, during voiding and at the end of voiding. Patients' weight (kg) and height (m) were also recorded and their BMI (weight/height2) was calculated.ResultsDuring the fill/void cycle pabd increased during bladder filling from 37 ± 7 cm H2O (mean ± SD) to 38 ± 8 cm H2O, fell during voiding to 35 ± 9 cm H2O before increasing to 36 ± 8 cm H2O at the end of voiding. There was a clear relationship between the individual values of pabd and BMI (correlation co‐efficient = 0.52) and to a lesser extent weight (correlation co‐efficient = 0.42). The relationship with BMI was clarified by separating the subjects into groups of normal, overweight and obese.ConclusionsA clear relationship between BMI and pabd was demonstrated, but because of the difficulties in quantifying it for an individual, it is impractical to apply an adjustment to non‐invasive estimates of pves,isv. Neurourol. Urodynam. 22:602–605, 2003. © 2003 Wiley‐Liss, Inc.
Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory
Authors: Kirousis Lefteris M. , Kranakis Evangelos , Krizanc Danny , Stamatiou Yannis C. 
Published: September 2003

AbstractWe consider the problem of searching for a piece of information in a fully interconnected computer network (also called a complete network orclique) by exploiting advice about its location from the network nodes. Each node contains a database that “knows” what kind of documents or information are stored in other nodes (e.g., a node could be a Web server that answers queries about documents stored on the Web). The databases in each node, when queried, provide a pointer that leads to the node that contains the information. However, this information is up‐to‐date (or correct) with some bounded probability. While, in principle, one may always locate the information by simply visiting the network nodes in some prescribed ordering, this requires a time complexity in the order of the number of nodes of the network. In this paper, we provide algorithms for locating an information node in the complete communication network, which take advantage ofadvicegiven from network nodes. The nodes may either give correct advice, by pointing directly to the information node, or give wrong advice, by pointing elsewhere. On the lower‐bounds' side, we show that no fixed‐memory (i.e., with memory independent of the network size) deterministic algorithm may locate the information node in a constant (independent of the network size) expected number of steps. Moreover, ifp= ω(1/n) is the probability that a node of ann‐node clique gives correct advice, we show that no algorithm may locate the information node in an expected number of steps less than 1/p−o(1). To study how the expected number of steps is affected by the amount of memory allowed to the algorithms, we give a memoryless randomized algorithm with expected number of steps 4/p+o(1/p) +o(1) and a 1‐bit randomized algorithm requiring on the average at most 2/p+o(1) steps. In addition, in the memoryless case, we also prove a 4/plower bound for the expected number of steps in the case where the nodes giving faulty advice may decide on the content of this advice in any possible way and not merely at random (adversarialfault model). Finally, for the case where faulty nodes behave randomly, we give an optimal, unlimited memory deterministic algorithm with expected number of steps bounded from above by 1/p+o(1/p) + 1. © 2003 Wiley Periodicals, Inc.
Time continuity in cohesive finite element modeling
Authors: Papoulia Katerina D. , Sam Chin‐Hang , Vavasis Stephen A. 
Published: September 2003

AbstractWe introduce the notion of time continuity for the analysis of cohesive zone interface finite element models. We focus on ‘initially rigid’ models in which an interface is inactive until the traction across it reaches a critical level. We argue that methods in this class are time discontinuous, unless special provision is made for the opposite. Time discontinuity leads to pitfalls in numerical implementations: oscillatory behavior, non‐convergence in time and dependence on nonphysical regularization parameters. These problems arise at least partly from the attempt to extend uniaxial traction–displacement relationships to multiaxial loading. We also argue that any formulation of a time‐continuous functional traction–displacement cohesive model entails encoding the value of the traction components at incipient softening into the model. We exhibit an example of such a model. Most of our numerical experiments concern explicit dynamics. Copyright © 2003 John Wiley & Sons, Ltd.
A novel approach to the analysis of distributed shear banding in polymer blends
Authors: Pijnenburg K. G. W. , Van der Giessen E. 
Published: September 2003

AbstractThe toughness of glassy polymers can be enhanced by blending with rubber particles. The consensus is that this toughening is due to massive plastic deformation of the matrix that takes place once the particles have cavitated. Micromechanical studies of regular stackings of particles in a polymer matrix have provided much insight into the localized plastic flow in blends at the microscale of individual particles (or voids, once cavitated). Even some steps towards macroscopic constitutive models have been made. However, at intermediate length scales (i.e. larger than several particles, but smaller than the scale at which the material may be regarded as homogeneous) the situation is unclear. It is this length scale that becomes important around crack tips, for example, where a thorough understanding of the toughening effect has to be derived from. In this paper, we therefore present a novel approach to the analysis of distributed shear banding in polymer–rubber blends. A coarse‐grain description, in which much of the morphology is retained but the local shear banding is idealized into ‘shear surfaces’, will enable us to analyse ensembles with large numbers of particles. The parameters of this model will be validated with results from detailed cell analyses. Copyright © 2003 John Wiley Sons, Ltd.
3D computer simulation of melt flow and heat transfer in the lost foam casting process
Authors: Mirbagheri S. M. H. , Varahram N. , Davami P. 
Published: September 2003

AbstractA new mathematical model has been developed to simulate mould filling in the lost foam casting process, using the finite difference method. The simulation of molten flow and track of free surfaces is based on the SOLA‐VOF numerical technique. An algorithm was developed to calculate the gas pressure of the evaporated foam during the mould filling. The effect of backpressure on the filling behaviour was modelled with an experimental function by adding three‐dimensions 3DVOF functions. In order to verify the computational results, a thin grey iron plate was poured into a transparent mould. Cavity filling, foam depolymerization and gap formation were recorded with a 16mm high‐speed camera. A good agreement was achieved for simulation results of filling sequences with those from experiments. Copyright © 2003 John Wiley & Sons, Ltd.
Effective volume‐fraction optimization for thermal stress reduction in FGMs using irregular h‐refinement
Authors: Cho J. R. , Park H. J. 
Published: September 2003

AbstractThe volume fraction of constituent particles in functionally graded materials (FGM) varies continuously and functionally, and its optimal tailoring could be made by the numerical optimization incorporated with the finite element method. In such a case, the mesh density in finite element discretization of the volume fraction field influences the final design quality such that the further objective function reduction requires the refinement of volume fraction meshes. However, the uniform refinement of the volume fraction mesh is not effective, from the numerical point of view, particularly when the finite difference scheme is employed. This numerical inefficiency could be resolved by locally increasing the mesh density only where more volume‐fraction flexibility (i.e. more mesh density) is required. In this paper, we propose an effective volume‐fraction optimization procedure by applying the irregular h‐refinement to the volume fraction discretization. Copyright © 2003 John Wiley & Sons, Ltd.
Topology optimization of trusses using genetic algorithm, force method and graph theory
Authors: Kaveh A. , Kalatjari V. 
Published: September 2003

AbstractIn this article size/topology optimization of trusses is performed using a genetic algorithm (GA), the force method and some concepts of graph theory. One of the main difficulties with optimization with a GA is that the parameters involved are not completely known and the number of operations needed is often quite high. Application of some concepts of the force method, together with theory of graphs, make the generation of a suitable initial population well‐matched with critical paths for the transformation of internal forces feasible. In the process of optimization generated topologically unstable trusses are identified without any matrix manipulation and highly penalized. Identifying a suitable range for the cross‐section of each member for the ground structure in the list of profiles, the length of the substrings representing the cross‐sectional design variables are reduced. Using a contraction algorithm, the length of the strings is further reduced and a GA is performed in a smaller domain of design space. The above process is accompanied by efficient methods for selection, and by using a suitable penalty function in order to reduce the number of numerical operations and to increase the speed of the optimization toward a global optimum. The efficiency of the present method is illustrated using some examples, and compared to those of previous studies. Copyright © 2003 John Wiley & Sons, Ltd.
Shape optimization of bonded patch to cylindrical shell structures
Authors: Tong Liyong , Sun Xiannian 
Published: September 2003

AbstractAdhesive bonding has been widely used to join or repair metallic and composite structural components to achieve or restore their designated structural stiffness and strengths. However, current analysis methods and empirical databases for composite bonded patch repairs or joints are limited to flat structures, and there exists a very limited knowledge on the effect of curvature on the performance and durability of composite bonded joints and repairs. Recently, a novel finite element formulation was presented for developing adhesive elements for conducting 2.5‐D simplified stress analysis of bonded repairs to curved structures. This paper presents the work on optimal shape design of a bonded curved composite patch using the newly developed adhesive element. The Sequential Linear Programming (SLP) method is employed as the optimization algorithm in conjunction with a fully implemented mesh generation algorithm into which new features have been incorporated. The objective of shape optimization is to minimize the maximum stress in the entire adhesive layer to ensure that the bonded patch effectively works together with the parent structure in service. Several different objective functions, related to possible failure mechanisms of the adhesive layer, are proposed to optimize the shape of a bonded patch. Copyright © 2003 John Wiley & Sons, Ltd.
22q11 deletions in fetuses with malformations of the outflow tracts or interruption of the aortic arch: impact of additional ultrasound signs
Authors: Volpe Paolo , Marasini Maurizio , Caruso Gilda , Marzullo Andrea , Buonadonna Antonia Lucia , Arciprete Paolo , Paolo Salvatore Di , Volpe Gennaro , Gentile Mattia 
Published: September 2003

AbstractObjectivesOne hundred and forty‐one consecutive cases of malformations of the outflow tracts or interrupted aortic arch (IAA), detected by fetal echocardiography, underwent detailed anatomy scan, karyotyping and fluorescence in situ hybridization analysis (FISH) to detect the prevalence of 22q11 microdeletion and to evaluate neonatal clinical findings and outcome according to the presence of the genetic defect. Then, we sought to investigate whether some prenatal ultrasound findings could help identify fetuses at higher risk of carrying the 22q11 microdeletion.MethodsEchocardiography and FISH for the DiGeorge critical region (22q11) were performed in all cases.Results22q11 microdeletion was detected in 28 of 141 fetuses (19.8%). Intrauterine growth restriction (IUGR) appeared to be associated with the worst prognosis, being present in 2/2 intrauterine fetal deaths and 5/6 post‐natal deaths. IUGR, additional aortic arch anomalies and thymic hypo/aplasia were significantly more frequent in fetuses with 22q11 microdeletion (p = 0.011, 0.011 and <0.0001, respectively). Prenatal ultrasound thymus examination, performed on the last 84 fetuses, showed 75% sensitivity and 94% specificity. The combination of 2 predictors, namely, thymus defects and IUGR associated with additional aortic arch anomalies reached more than 90% sensitivity and 100% specificity.ConclusionsOur study demonstrates that 22q11 microdeletion occurs in 20% of malformations of the outflow tracts and IAA type B, as detected in utero, and that this association is significantly predicted by the presence of associated ultrasound findings: thymic hypo/aplasia, IUGR and additional aortic arch anomalies. The feasibility of a correct prenatal diagnosis should enable clinicians to provide the couple with further informative counselling and to plan adequate post‐natal medical interventions. Copyright © 2003 John Wiley & Sons, Ltd.
Pericardial teratoma complicated by hydrops: successful fetal therapy by thoracoamniotic shunting
Authors: Grebille A. G. , Mitanchez D. , Benachi A. , Aubry M. C. , Houfflin‐Debarge V. , Vouhé P. , Dumez Y. , Dommergues M. 
Published: September 2003

AbstractPericardial teratoma is a potentially curable lesion that may become life threatening when it induces mediastinal compression and fetal hydrops. So far, cases with fetal hydrops have been managed by elective delivery or pericardial needle decompression.We report a case in which pericardial teratoma resulted in fetal hydrops. Following transpleural needling of the fetal pericardium at 29 weeks and 6 days, pericardial effusion decreased but hydrops persisted, while major unilateral pleural effusion appeared. A thoracoamniotic shunt was placed at 30 weeks and 5 days. Hydrops resolved, although incompletely. The baby was delivered at 32 weeks and was operated upon on day 3.This observation suggests that fetal hydrops associated with pericardial teratoma may improve following thoracoamniotic shunting. Fetal therapy may limit the risks of respiratory distress arising from the combined effect of airways compression and lung immaturity. Copyright © 2003 John Wiley & Sons, Ltd.
Using disease registries for pharmacoepidemiological research: a case study of data from a cystic fibrosis registry
Authors: Strobl Judith , Enzer Ian , Bagust Adrian , Haycox Alan , Smyth Rosalind , Ashby Deborah , Walley Tom 
Published: September 2003

AbstractBackgroundThe Epidemiologic Registry of Cystic Fibrosis (ERCF) was a multicentre, longitudinal follow‐up project of cystic fibrosis patients enrolled at some 200 centres in nine European countries between 1994 and 1999.PurposeWe aimed to assess and improve the quality of a subset of data from the ERCF relating to seven English centres (1184 patients), prior to using the data for a long‐term cost‐effectiveness analysis of dornase alfa (Pulmozyme®). Specifically we wanted to assess the completeness and accuracy of the data and the comparability of cases across centres.MethodsWe used a subset of ERCF data relating to seven UK cystic fibrosis (CF) centres. Following initial data editing, key variable data from a sample of patients from five centres were subjected to a detailed verification of ERCF data against original data sources available in the centres. Disagreements between ERCF reports and original data sources were identified and corrected in the study dataset. In addition, centre staff were questioned about relevant clinical and recording practices.ResultsThanks to detailed routine data checking procedures on key variables operated by the ERCF, the rates of disagreement between ERCF data and original data as identified in our verification process on the assessed variables are generally low (0.4–3.7%). Some outcome variables (deaths, hospitalisations) seem to be under‐reported by some centres. Episodes of pulmonary exacerbation are difficult to identify and also to verify. Twenty‐four patients were registered twice (consecutively in two different centres). There were some differences between centres in their interpretation of recording rules.ConclusionsResearchers seeking to use disease registry data should consider detailed data quality review processes. Apart from data accuracy, reliable definitions of both critical events as well as their timing are important. The degree of under‐reporting, particularly of outcome variables, should be estimated. Information on local clinical and reporting practices is necessary to interpret multi‐centre data. Data protection issues may limit the possibilities for detailed data quality assessments of secondary data, as does the accessibility of original data for verification purposes. Our experiences and recommendations may be valuable for those intending to use disease registry data as well as those devising and operating such registries. Copyright © 2003 John Wiley & Sons, Ltd.
Intensive monitoring of new drugs based on first prescription signals from pharmacists: a pilot study
Authors: van Grootheest A. C. , Groote J. K. , de Jong‐van den Berg L. T. W. 
Published: September 2003

AbstractBackgroundIntensive monitoring can be a valuable tool in the early detection of adverse drug reactions, especially of new drugs. Aim of this pilot study was to investigate the practical possibilities of a system of intensive monitoring, using the pharmacy computer system to detect the first dispensing of a new drug.MethodEight pharmacists were asked to monitor, using their computer system, when a general practitioner prescribed the target drug (rofecoxib). The pharmacists were also requested to provide the researchers at Lareb with an overview of the patient's medication history. Subsequently, the pharmacist sent the prescribing physician an envelope containing information about the project and a reporting form (all provided by Lareb), which the GP was requested to return to Lareb after the next visit of the patient. The items on the questionnaire concerned characteristics of the patient (anonymous), indication, dose and information about possible adverse drug reactions.ResultsDuring a 4‐week period, the participating pharmacists signalled 44 first prescriptions of rofecoxib. For each of these signals, the pharmacist provided Lareb with the medication history of the patient involved. Of the prescribing GPs who had been sent the report form, 70.5% (n=31) returned the form. Twenty‐one of the 31 forms were returned within 4 weeks. The medication histories showed that in 43 of the 44 cases, the dispensing of the target drug was indeed the first delivery. The participating pharmacists and GPs were also sent an evaluation form. All pharmacists returned their evaluations, indicating an overall motivation to participate in the proposed system. In total, seven GPs returned their evaluation forms, three of whom had not reported adverse drug events to the national spontaneous reporting centre before.ConclusionAlthough the number of participants in this trial was small, we conclude that pharmacists and prescribing physicians are able and willing to contribute to an intensive monitoring system for new drugs. Copyright © 2003 John Wiley & Sons, Ltd.
The General Practice Research Network: the capabilities of an electronic patient management system for longitudinal patient data
Authors: Sayer Geoffrey P. , McGeechan Kevin , Kemp Andrew , Bhasale Alice , Horn Fiona , Hendrie Leigh , Swan Lisa , Scahill Sharon 
Published: September 2003

AbstractPurposeTo evaluate the potential of a general practice research database derived directly from de‐identified electronic medical records to provide national prescribing data in Australia. To observe the utilisation of a computer‐based patient management system over time. To evaluate the impact of the research network participation on data quality in participants' electronic records.MethodA random sample of 297 general practitioners (GPs) from 128 practices provided longitudinal patient data from electronic medical records (using Medical Director® software) retrospectively from 1 January 1999 to April 2002. The General Practice Research Network (GPRN) database contains approximately 600 000 patients, representing over 4 million prescriptions from 4 million encounters. The quality and representativeness of data for prescribing, morbidity and software usage were evaluated by comparison with National data.ResultsOlder GPs (>55) were under‐represented, perhaps due to lower computer usage rates, but patient visits were similar to the national distribution. Over time, there were increases in: the quality of prescribing data (with reason for visit/prescription being compulsorily recorded); recording of non‐prescribing visits; and the use of other features of the electronic patient management software.ConclusionsData derived from electronic general practice records is of sufficient quality to be used to provide national prescribing estimates and has potential value for pharmacoepidemiology and population health monitoring. Such longitudinal data has previously been unavailable in Australia. Monitoring of software usage demonstrates the evolution of the Australian GP user and will be increasingly useful in assessing and improving the quality of electronic medical records. Copyright © 2003 John Wiley & Sons, Ltd.
Medication history on internal medicine wards: assessment of extra information collected from second drug interviews and GP lists
Authors: Andersen S. E. , Pedersen A. B. , Bach K. F. 
Published: September 2003

AbstractPurposeTo assess the extra information about patients' pre‐admission medication that second drug interviews and general practitioners' (GP) drug lists add to routine medication histories.MethodsThe medication histories of 81 patients from two medicine wards were compared with information collected from second interviews and GP drug lists. A panel of clinicians assessed the potential clinical impact of any discrepancies.ResultsIn nine cases (11%CI: 6–20%) the medication history, the second interview and the GP lists were identical. The interviews revealed extra information about 54 prescription drugs and 72 over‐the‐counter drugs (OTCs) in 56 (69%CI: 58–78%) cases. The GP lists added 74 prescription drugs and 26 OTCs to the medication histories in 57 (70%CI: 60–79%) cases. Discrepancies were not associated with age, gender or number of drugs in medication history. In 18% (CI: 10–30%) of the cases, the specialist panel ascribed potential clinical problems to missing drug information.ConclusionsSecond interviews and GP lists reveal extra information about pre‐admission medication in two‐thirds of cases. Both procedures should be routinely performed to compile a more comprehensive basis for drug prescribing. This approach may mend the course of roughly one in five patients. Copyright © 2003 John Wiley & Sons, Ltd.