bluuebunny/crossref_metadata_2025_split huggingface dataset:
Update on chronic viral hepatitis
Authors: Walsh K , Alexander G J M 
Published: July 2002

Abstract
Many recent and significant advances in the field of chronic viral hepatitis, including therapy, suggest that an update on chronic hepatitis is timely.
Chronic hepatitis B virus infection remains a significant worldwide cause of liver cirrhosis and hepatocellular carcinoma, despite the wide availability of a long established and effective vaccine. Transmission occurs via perinatal, sexual, and parenteral routes (particularly intravenous drug abuse and although blood products still carry a risk, this is now extremely low in Western countries). Only a minority of infected adult cases develop chronic hepatitis but in children under 1 year, 90% develop chronic hepatitis. The clinical spectrum of chronic liver injury ranges from mild inflammation to end stage liver cirrhosis. Interferon alfa has been the mainstay of treatment for patients with active disease but nucleoside analogues (lamivudine and adefovir) are now available with similar efficacy. Patients with end stage liver disease and hepatocellular carcinoma can be offered transplantation but infection in the graft is commonplace. The combination of hepatitis B immunoglobulin and newer antiviral drugs reduce the incidence and severity of graft infection significantly.
The hepatitis C virus epidemic of the latter half of the 20th century now affects more than 1% of populations worldwide. This RNA virus is spread parenterally and is becoming the leading indication for liver transplantation. The majority of patients develop chronic hepatitis, which may be progressive, evolving to significant liver disease (cirrhosis or hepatocellular carcinoma) in about 20% cases after decades. Treatment with the combination of interferon alfa and ribavirin is successful in up to 40% cases. Liver transplantation is a therapeutic option for some but graft infection is universal and often complicated by progressive liver fibrosis. A vaccine remains a remote prospect so that prevention is crucial.
Hepatitis D virus infection occurs on a background of hepatitis B virus infection and can also cause liver damage. The response to antiviral therapy is poor.
The newer “hepatitis” viruses G and TT do not cause significant liver injury.
Common krait (Bungarus caeruleus) bite in Anuradhapura, Sri Lanka: a prospective clinical study, 1996–98
Authors: Kularatne S A M 
Published: July 2002

Abstract
Common krait (Bungarus caeruleus) is the deadliest snake found commonly in the dry zone of Sri Lanka. In Anuradhapura, 210 farmers bitten by the common krait over a three year period were investigated prospectively from 1 January 1996. The sex ratio was equal, 110 (52%) patients were in the age group 10–30 years. One hundred and one (48%) patients were severely envenomed and needed mechanical ventilation from 12 hours to 29 days (mode two days). The bite occurred at night while the victims were asleep on the floor. In 99 (47%) situations killed specimens were available for identification. The cardinal symptom was abdominal pain developing within hours of the bite. Alteration in the level of consciousness was observed in 150 (71%) patients: drowsy in 91 (43%), semiconscious in 24 (11%), and deep coma in 35 (17%). Autonomic disturbances included transient hypertension, tachycardia, lacrimation, sweating, and salivation. These manifested in 139 (66%) patients with moderate to severe envenomation. One hundred and forty nine (71%) had hypokalaemia and 105 (50%) metabolic acidosis, anterograde memory loss in 84 (40%), and delayed neuropathy in 38 (22%) patients. Polyvalent antivenom had no significant benefit (t = 0.5) in reversing respiratory paralysis and preventing delayed neurological complications. Sixteen (7.6%) patients died and a submucosal haemorrhage in the stomach was seen at necropsy in three cases. Mortality could be minimised with early and free access to mechanical ventilation.
Variations in treatment benefits influence smoking cessation: results of a randomised controlled trial
Authors: Schauffler Helen H , McMenamin Sara , Olson Keri , Boyce-Smith Gifford , Rideout Jeffrey A , Kamil Jeffrey 
Published: July 2002

OBJECTIVETo assess the impact and costs of coverage for tobacco dependence treatment benefits with no patient cost sharing for smokers with employer sponsored coverage in two large independent practice association (IPA) model health maintenance organisations (HMOs) in California, USA.METHODSA randomised experimental design was used. 1204 eligible smokers were randomly assigned either to the control group, which received a self-help kit (video and pamphlet), or to the treatment group, which received the self-help kit and fully covered benefits for over the counter (OTC) nicotine replacement therapy (NRT) gum and patch, and participation in a group behavioural cessation programme with no patient cost sharing.RESULTSThe quit rates after one year of follow up were 18% in the treatment group and 13% in the control group (adjusted odd ratio (OR) 1.6, 95% confidence interval (CI) 1.1 to 2.4), controlling for health plan, sociodemographics, baseline smoking characteristics, and use of bupropion. Rates of quit attempts (adjusted OR 1.4, 95% CI 1.1 to 1.8) and use of nicotine gum or patch (adjusted OR 2.3, 95% CI 1.6 to 3.2) were also higher in the treatment group. The annual cost of the benefit per user who quit ranged from $1495 to $965 or from $0.73 to $0.47 per HMO member per month.CONCLUSIONSFull coverage of a tobacco dependence treatment benefit implemented in two IPA model HMOs in California has been shown to be an effective and relatively low cost strategy for significantly increasing quit rates, quit attempts, and use of nicotine gum and patch in adult smokers.
Passive smoking in the home: plasma cotinine concentrations in non-smokers with smoking partners
Authors: Jarvis Martin J , Feyerabend Colin , Bryant Andrew , Hedges Barry , Primatesta Paola 
Published: July 2002

BACKGROUNDRisks of lung cancer and of heart disease attributable to passive smoking have been evaluated mainly in non-smokers married to smokers, but there has been little quantitative assessment of the extent of exposure in marriage partners as indicated by markers of inhaled smoke dose.OBJECTIVETo relate plasma cotinine concentrations in non-smoking English adults to the smoking behaviour of their partners and to demographic and other factors.DATAPopulation survey. Data from two years (1994 and 1996) of the Health Survey for England.MAIN OUTCOME MEASURESPlasma cotinine concentrations in non-smoking adults married to or cohabiting with a partner.RESULTSThere was a strong dose–response relation between cotinine concentrations in non-smoking adults and the smoking behaviour of their partners, rising from a geometric mean of 0.31 ng/ml in those with non-smoking partners to 1.99 ng/ml in those whose partners smoked 30 or more cigarettes per day. In addition, exposure was greater in men, in the autumn and winter, and in those living in more disadvantaged circumstances, and there was an increasing gradient of exposure from the south to the north of the country. On average, cotinine concentrations in non-smokers with a smoking partner were 0.6–0.7% of those in cigarette smokers.CONCLUSIONSIf cotinine is taken as a measure of risk relevant dose, the implied increase in risk of lung cancer in non-smokers with smoking partners is consistent with the risk observed in epidemiological studies. Smoking by partners in the home is a major source of non-smoking adults' exposure to passive smoking.
Motion planning in the presence of moving obstacles
Authors: Reif John , Sharir Micha 
Published: July 2002

This paper investigates the computational complexity of planning the motion of a body B in 2-D or 3-D space, so as to avoid collision with moving obstacles of known, easily computed, trajectories. Dynamic movement problems are of fundamental importance to robotics, but their computational complexity has not previously been investigated.
We provide evidence that the 3-D dynamic movement problem is intractable even if B has only a constant number of degrees of freedom of movement. In particular, we prove the problem is PSPACE-hard if B is given a velocity modulus bound on its movements and is NP-hard even if B has no velocity modulus bound, where, in both cases, B has 6 degrees of freedom. To prove these results, we use a unique method of simulation of a Turing machine that uses time to encode configurations (whereas previous lower bound proofs in robotic motion planning used the system position to encode configurations and so required unbounded number of degrees of freedom).

We also investigate a natural class of dynamic problems that we call
asteroid avoidance problems
: B, the object we wish to move, is a convex polyhedron that is free to move by translation with bounded velocity modulus, and the polyhedral obstacles have known translational trajectories but cannot rotate. This problem has many applications to robot, automobile, and aircraft collision avoidance. Our main positive results are polynomial time algorithms for the 2-D asteroid avoidance problem, where B is a moving polygon and we assume a constant number of obstacles, as well as single exponential time or polynomial space algorithms for the 3-D asteroid avoidance problem, where B is a convex polyhedron and there are arbitrarily many obstacles. Our techniques for solving these asteroid avoidance problems use “normal path” arguments, which are an intereting generalization of techniques previously used to solve static shortest path problems.

We also give some additional positive results for various other dynamic movers problems, and in particular give polynomial time algorithms for the case in which B has no velocity bounds and the movements of obstacles are algebraic in space-time.
Sharing and protection in a single-address-space operating system
Authors: Chase Jeffrey S. , Levy Henry M. , Feeley Michael J. , Lazowska Edward D. 
Published: July 2002

This article explores memory sharing and protection support in Opal, a single-address-space operating system designed for wide-address (64-bit) architectures. Opal threads execute within protection domains in a single shared virtual address space. Sharing is simplified, because addresses are context independent. There is no loss of protection, because addressability and access are independent; the right to access a segment is determined by the protection domain in which a thread executes. This model enables beneficial code-and data-sharing patterns that are currently prohibitive, due in part to the inherent restrictions of multiple address spaces, and in part to Unix programming style.We have designed and implemented an Opal prototype using the Mach 3.0 microkernel as a base. Our implementation demonstrates how a single-address-space structure can be supported alongside of other environments on a modern microkernel operating system, using modern wide-address architectures. This article justifies the Opal model and its goals for sharing and protection, presents the system and its abstractions, describes the prototype implementation, and reports experience with integrated applications.
LH*—a scalable, distributed data structure
Authors: Litwin Witold , Neimat Marie-Anna , Schneider Donovan A. 
Published: July 2002

We present a scalable distributed data structure called LH*. LH* generalizes Linear Hashing (LH) to distributed RAM and disk files. An LH* file can be created from records with primary keys, or objects with OIDs, provided by any number of distributed and autonomous clients. It does not require a central directory, and grows gracefully, through splits of one bucket at a time, to virtually any number of servers. The number of messages per random insertion is one in general, and three in the worst case, regardless of the file size. The number of messages per key search is two in general, and four in the worst case. The file supports parallel operations, e.g., hash joins and scans. Performing a parallel operation on a file of
M
buckets costs at most 2
M
+ 1 messages, and between 1 and
O
(log
2
M
rounds of messages.

We first describle the basic LH* scheme where a coordinator site manages abucket splits, and splits a bucket every time a collision occurs. We show that the average load factor of an LH* file is 65%–70% regardless of file size, and bucket capacity. We then enhance the scheme with load control, performed at no additional message cost. The average load factor then increases to 80–95%. These values are about that of LH, but the load factor for LH* varies more.
We nest define LH* schemes without a coordinator. We show that insert and search costs are the same as for the basic scheme. The splitting cost decreases on the average, but becomes more variable, as cascading splits are needed to prevent file overload. Next, we briefly describe two variants of splitting policy, using parallel splits and presplitting that should enhance performance for high-performance applications.
All together, we show that LH* files can efficiently scale to files that are orders of magnitude larger in size than single-site files. LH* files that reside in main memory may also be much faster than single-site disk files. Finally, LH* files can be more efficient than any distributed file with a centralized directory, or a static parallel or distributed hash file.
New Methods in Automatic Extracting
Authors: Edmundson H. P. 
Published: July 2002

This paper describes new methods of automatically extracting documents for screening purposes, i.e. the computer selection of sentences having the greatest potential for conveying to the reader the substance of the document. While previous work has focused on one component of sentence significance, namely, the presence of high-frequency content words (key words), the methods described here also treat three additional components: pragmatic words (cue words); title and heading words; and structural indicators (sentence location).
The research has resulted in an operating system and a research methodology. The extracting system is parameterized to control and vary the influence of the above four components. The research methodology includes procedures for the compilation of the required dictionaries, the setting of the control parameters, and the comparative evaluation of the automatic extracts with manually produced extracts. The results indicate that the three newly proposed components dominate the frequency component in the production of better extracts.
An algorithm for hidden line elimination
Authors: Galimberti R. 
Published: July 2002

The algorithm presented causes the elimination of hidden lines in the representation of a perspective view of concave and convex plane-faced objects on the picture plane. All the edges of the objects are considered sequentially, and all planes which hide every point of an edge are found.
The computing time increases roughly as the square of the number of edges. The algorithm takes advantage of a reduced number of concave points and automatically recognizes if only one object with no concave points is considered. In this last case, the result is obtained in a much simpler way.
On understanding types, data abstraction, and polymorphism
Authors: Cardelli Luca , Wegner Peter 
Published: July 2002

Our objective is to understand the notion of
type
in programming languages, present a model of typed, polymorphic programming languages that reflects recent research in type theory, and examine the relevance of recent research to the design of practical programming languages.

Object-oriented languages provide both a framework and a motivation for exploring the interaction among the concepts of type, data abstraction, and polymorphism, since they extend the notion of type to data abstraction and since type inheritance is an important form of polymorphism. We develop a λ-calculus-based model for type systems that allows us to explore these interactions in a simple setting, unencumbered by complexities of production programming languages.
The evolution of languages from untyped universes to monomorphic and then polymorphic type systems is reviewed. Mechanisms for polymorphism such as overloading, coercion, subtyping, and parameterization are examined. A unifying framework for polymorphic type systems is developed in terms of the typed λ-calculus augmented to include binding of types by quantification as well as binding of values by abstraction.
The typed λ-calculus is augmented by universal quantification to model generic functions with type parameters, existential quantification and packaging (information hiding) to model abstract data types, and bounded quantification to model subtypes and type inheritance. In this way we obtain a simple and precise characterization of a powerful type system that includes abstract data types, parametric polymorphism, and multiple inheritance in a single consistent framework. The mechanisms for type checking for the augmented λ-calculus are discussed.
The augmented typed λ-calculus is used as a programming language for a variety of illustrative examples. We christen this language Fun because fun instead of λ is the functional abstraction keyword and because it is pleasant to deal with.
Fun is mathematically simple and can serve as a basis for the design and implementation of real programming languages with type facilities that are more powerful and expressive than those of existing programming languages. In particular, it provides a basis for the design of strongly typed object-oriented languages.
POPULATION GENETIC PERSPECTIVES ON THE EVOLUTION OF RECOMBINATION
Authors: Feldman Marcus W. , Otto Sarah P. , Christiansen Freddy B. 
Published: July 2002

It is not generally realized that genetics has finally solved the age-old problem of the reason for the existence (i.e. the function) of sexuality and sex, and that only geneticists can properly answer the question, “Is sex necessary?” ▪ Abstract  Optimality arguments and modifier theory are reviewed as paradigms for the study of the evolution of recombination. Optimality criteria (such as maximization of mean fitness) may agree with results from models developed in terms of the evolution of recombination at modifier loci. Modifier models demonstrate, however, that equilibrium mean fitness can decrease during the evolution of recombination rates and is not always maximized. Therefore, optimality arguments do not successfully predict the conditions under which increased or decreased recombination will evolve. The results from modifier models indicate that decreased recombination rates are usually favored when the population is initially near a polymorphic equilibrium with linkage disequilibrium. When the population is subject to directional selection or to deleterious mutations, increased recombination may be favored under certain conditions, provided that there is negative epistasis among alleles.
EXPERIMENTS ON THE DYNAMICS OF MOLECULAR PROCESSES: A Chronicle of Fifty Years
Authors: Boato Giovanni , Volpi Gian Gualberto 
Published: July 2002

[Figure: see text] [Figure: see text] [Figure: see text] [Figure: see text] ▪ Abstract  This paper reviews the way in which, in the Italy of the years immediately after World War II, interest in the dynamics of molecular processes was awakened. The narrative begins with the work of a small number of chemists and physicists who, in the initial stage, interacted closely. In the course of the years, their interests diverged and younger people joined the newly formed groups. Even now, after half a century, a common approach can still to be seen regarding how to attack problems and perform experiments. Experimental work is discussed, bringing out the common viewpoint of fields as diverse as mass spectrometry, isotope effects, chemical kinetics, molecular beams, molecule-molecule interactions, molecule-ion interactions, molecule-surface interactions, and plasma chemistry.
The Endogenous Modulation of IOR is Nasal-Temporal Asymmetric
Authors: Berger Andrea , Henik Avishai 
Published: July 2002

Abstract
Inhibition of return (IOR) refers to a reflexive mechanism mediated by phylogenetically primitive extrageniculate visuomotor pathways, which apparently serves to favor novel spatial locations by inhibiting those recently sampled. We demonstrate an asymmetry between temporal and nasal hemifields in the strategic modulation of IOR by endogenously controlled attention. Exogenous and endogenous precues were manipulated independently on each trial such that precues to initiate endogenous spatial orienting were presented after IOR had been activated by exogenous visual signals. Both types of precues manifested their characteristic effects on reaction time (RT) to detect subsequent targets: facilitation by endogenous precues, and IOR by exogenous precues. Under monocular viewing, an asymmetric interaction between these two mechanisms was observed. While endogenous allocation of attention to the nasal hemifield reduced IOR, no endogenous modulation of IOR was present in the temporal hemifield where the effects of the two types of precues were independent. These observations suggest a framework for understanding the neurobiology of automaticity and control—from an evolutionary perspective.
Deconvolution of Event-Related fMRI Responses in Fast-Rate Experimental Designs: Tracking Amplitude Variations
Authors: Hinrichs Hermann , Scholz Michael , Tempelmann Claus , Woldorff Martin G. , Dale Anders M. , Heinze Hans-Jochen 
Published: July 2002

Abstract
Recent developments towards event-related functional magnetic resonance imaging has greatly extended the range of experimental designs. If the events occur in rapid succession, the corresponding time-locked responses overlap significantly and need to be deconvolved in order to separate the contributions of different events. Here we present a deconvolution approach, which is especially aimed at the analysis of fMRI data where sequence- or context-related responses are expected. For this purpose, we make the assumption of a hemodynamic response function (HDR) with constant yet not predefined shape but with possibly variable amplitudes. This approach reduces the number of variables to be estimated but still keeps the solutions flexible with respect to the shape. Consequently, statistical efficiency is improved. Temporal variations of the HDR strength are directly indicated by the amplitudes derived by the algorithm. Both the estimation efficiency and statistical inference are further supported by an improved estimation of the noise covariance. Using synthesized data sets, both differently shaped HDRs and varying amplitude factors were correctly identified. The gain in statistical sensitivity led to improved ratios of false- and true-positive detection rates for synthetic activations in these data. In an event-related fMRI experiment with a human subject, different HDR amplitudes could be derived corresponding to stimulation at different visual stimulus contrasts. Finally, in a visual spatial attention experiment we obtained different fMRI response amplitudes depending on the sequences of attention conditions.