bluuebunny/crossref_metadata_2025_split huggingface dataset:
Genomic but Not Antigenomic Hepatitis Delta Virus RNA Is Preferentially Exported from the Nucleus Immediately after Synthesis and Processing
Authors: Macnaughton Thomas B. , Lai Michael M. C. 
Published: July 2002

ABSTRACT

Hepatitis delta virus (HDV) contains a viroid-like circular RNA that replicates via a double rolling circle replication mechanism. It is generally assumed that HDV RNA is synthesized and remains exclusively in the nucleus until being exported to the cytoplasm for virion assembly. Using a [
32
P]orthophosphate metabolic labeling procedure to study HDV RNA replication (T. B. Macnaughton, S. T. Shi, L. E. Modahl, and M. M. C. Lai. J. Virol. 76:3920-3927, 2002), we unexpectedly found that a significant amount of newly synthesized HDV RNA was detected in the cytoplasm. Surprisingly, Northern blot analysis revealed that the genomic-sense HDV RNA is present almost equally in both the nucleus and cytoplasm, whereas antigenomic HDV RNA was mostly retained in the nucleus, suggesting the specific and highly selective export of genomic HDV RNA. Kinetic studies showed that genomic HDV RNA was exported soon after synthesis. However, only the monomer and, to a lesser extent, the dimer HDV RNAs were exported to the cytoplasm; very little higher-molecular-weight HDV RNA species were detected in the cytoplasm. These results suggest that the cleavage and processing of HDV RNA may facilitate RNA export. The export of genomic HDV RNA was resistant to leptomycin B, indicating that a cell region maintenance 1 (Crm1)-independent pathway was involved. The large form of hepatitis delta antigen (L-HDAg), which is responsible for virus packaging, was not required for RNA export, as a mutant HDV RNA genome unable to synthesize L-HDAg was still exported. The proportions of genomic HDV RNA in the nucleus and cytoplasm remained relatively constant throughout replication, indicating that export of genomic HDV RNA occurred continuously. In contrast, while antigenomic HDV RNA was predominately in the nucleus, there was a proportionally large fraction of antigenomic HDV RNA in the cytoplasm at early time points of RNA replication. These findings uncover a previously unrecognized presence of HDV RNA in the cytoplasm, which may have implications for viral RNA synthesis and packaging.
Day-case percutaneous endoscopic gastrostomy: a viable proposition?
Authors: Mandal A , Steel A , Davidson A R , Ashby C 
Published: July 2002

Summary
The aim of our study was to evaluate the success rate, complications, and long term outcomes following day-case percutaneous endoscopic gastrostomy (PEG). This retrospective study was carried out in a 650-bed District General hospital in Northamptonshire, UK. Thirty-six patients, aged 28–90 years, were included in the study, 21 males (58%) and 15 females (42%). Indications for PEG insertion included head and neck cancer, dysphagia as a result of primary disease, and AIDS-related malnutrition. Data were collected from the medical and dietetic records. The PEG procedure was successful in 33 patients (92%). In 32 cases (97%) the patient was discharged home. Twenty five of the patients (76%) suffered no complications whilst seven (21%) suffered complications within a month of the procedure. No patient required further surgical intervention. Five patients (15%) died of their primary disease within a month of the procedure. Patients had had their PEG tubes in situ for up to 2.5 years at the end of data collection. We conclude that PEG can be performed as a day-case procedure in stable patients with no increase in complication rate, morbidity, or mortality.
Aortic aneurysm and dissection are not associated with an increased risk for giant cell arteritis/ polymyalgia rheumatica
Authors: Ehrenfeld Michael , Bitzur Rafael , Schneiderman Jacob , Smolinsky Aram , Sidi Yechezkel , Gur Hanan 
Published: July 2002

Abstract
It has recently been claimed that giant cell arteritis (GCA) is associated with a markedly increased risk of aortic aneurysm formation or rupture. In the present study, the opposite approach was taken, by looking for the incidence of GCA and polymyalgia rheumatica (PMR) in patients with aortic aneurysm, aortic dissection, or both (AA/D). The records of 315 consecutive patients admitted with the diagnosis of AA/D were reviewed. In addition, follow up information was obtained in 82 patients by examination in the outpatient clinic. After careful examination and assessment of clinical and laboratory data, it was found that none of the 82 patients who survived hospitalisation and were available for examination had GCA or PMR. Moreover, review of the retrospective data available from hospital records of the total consecutive 315 patients with AA/D failed to find any patient with a diagnosis of GCA/PMR. In conclusion, the present study did not find an increased prevalence of GCA/PMR among a cohort of Israeli patients with AA/D. Therefore, it is suggested that a thorough investigation aiming to diagnose GCA/PMR is not cost effective in most of the elderly patients presenting with AA/D.
Primary hypothyroidism masquerading as hepatic encephalopathy: case report and review of the literature
Authors: Thobe Nicole , Pilger Pamela , Jones Michael P 
Published: July 2002

Abstract
A 74 year old woman with hepatitis C of long duration was admitted to hospital in hyperammonaemic coma. Despite aggressive treatment of hepatic encephalopathy, there was no clinical improvement. As part of her evaluation for other causes of altered mental status, she was found to be profoundly hypothyroid. Treatment with thyroid replacement hormone was accompanied by prompt normalisation of her mental status and hyperammonaemia. Hypothyroidism may exacerbate hyperammonaemia and portosystemic encephalopathy in patients with otherwise well compensated liver disease. Hyopthyroidism should be considered in the differential diagnosis of encephalopathy in patients with liver disease.
Amyloidosis
Authors: Khan M F , Falk R H 
Published: July 2002

Abstract
Amyloidosis is not a single disease but a series of diseases in which there is extracellular deposition of a protein which, although it may be derived from different and unrelated sources, folds into a β pleated sheet.
There have recently been significant advances in elucidating the pathogenesis and in the treatment of this group of disorders. By identifying the source of precursor protein, treatment is aimed at eliminating or reducing the extent of deposition and is tailored for each patient.
Early diagnosis is required for the optimal effect of treatment on patient survival and quality of life. An increased awareness among physicians of the spectrum of the disease and tools to aid its diagnosis is of increasing importance.
Mycoplasma pneumoniae induced popliteal artery thrombosis treated with urokinase
Authors: Joo C U , Kim J S , Han Y M 
Published: July 2002

Abstract
A 5 year old boy with serological and clinical evidence of Mycoplasma pneumoniae infection, which was complicated by popliteal artery thrombosis, is described. Intra-arterial urokinase, in conjunction with medical treatment, resulted in clinical recovery and angiographic resolution of the thrombus. The variety of extrapulmonary complications associated with the M pneumoniae infections continues to broaden. Thrombolytic therapies should be considered when similar clinical circumstances arise.
Necrotising fasciitis in a patient receiving infliximab for rheumatoid arthritis
Authors: Chan A T Y , Cleeve V , Daymond T J 
Published: July 2002

Abstract
A case of necrotising fasciitis in a patient receiving infliximab, an antitumour necrosis factor alpha (TNF-α) agent for rheumatoid arthritis, is presented. A widespread confluent, erythematous, pustular skin rash was the presenting sign. There was no fever throughout this admission. β-Haemolytic group A streptococcus was isolated from blood cultures and skin swabs. The adductor muscles and fascia around the site of a previous hip arthroplasty were necrotic on exploration. The case highlights the risk of severe sepsis in patients on anti-TNF-α treatment.
UNCONVENTIONAL SPIN DENSITY WAVE IN (TMTSF)2PF6 BELOW T = 4.2 K
Authors: KORIN-HAMZIĆ B. , BASLETIĆ M. , MAKI K. 
Published: July 2002

It is well documented that SDW in (TMTSF)2PF6 undergoes another phase transition at T* ≈ 4 K , though the nature of the new phase has not been identified. In particular the angular dependence of the magnetoresistance for B ‖( a, b ′) plane below 4.2 K is dramatically different from the one above 4.2 K. We propose that below T* the new phase unconventional SDW (USDW) appears which modifies drastically the quasiparticle spectrum. The present model describes the observed angular dependence of the magnetoresistance reasonably well, which cannot be interpreted in terms of the conventional SDW.
Thermo-Electric Power of the Bi2Sr2Ca1-xCexCu2Oy System
Authors: Sita D. R. , Singh R. 
Published: July 2002

The temperature dependence of thermo-electric power (TEP) of Bi 2 Sr 2 Ca 1-x Ce x Cu 2 O y samples with x upto 0.4 are reported in the temperature range 40–300 K. The normal state TEP data of the superconducting samples are discussed in view of some of the existing theoretical models in the literature, viz. two-band models, Nagaosa and Lee model and a phenomenological narrow band model. The transport in the semiconducting sample is found to be by variable-range-hopping mechanism.
CLOSURE PROPERTY OF SPACE-BOUNDED TWO-DIMENSIONAL ALTERNATING TURING MACHINES, PUSHDOWN AUTOMATA, AND COUNTER AUTOMATA
Authors: OKAZAKI TOKIO , INOUE KATSUSHI , ITO AKIRA , WANG YUE 
Published: July 2002

This paper investigates closure property of the classes of sets accepted by space-bounded two-dimensional alternating Turing machines (2-atm's) and space-bounded two-dimensional alternating pushdown automata (2-apda's), and space-bounded two-dimensional alternating counter automata (2-aca's). Let L(m, n): N2 → N (N denotes the set of all positive integers) be a function with two variables m (= the number of rows of input tapes) and n (= the number of columns of input tapes). We show that (i) for any function f(m) = o( log m) (resp. f(m) = o( log m/ log log m)) and any monotonic nondecreasing function g(n) space-constructible by a two-dimensional Turing machine (2-Tm) (resp. two-dimensional pushdown automaton (2-pda)), the class of sets accepted by L(m,n) space-bounded 2-atm's (2-apda's) is not closed under row catenation, row + or projection, and (ii) for any function f(m) = o(m/ log ) (resp. for any function f(m) such that log f(m) = o( log m)) and any monotonic nondecreasing function g(n) space-constructible by a two-dimensional counter automaton (2-ca), the class of sets accepted by L(m, n) space-bounded 2-aca's is not closed under row catenation, row + or projection, where L(m, n) = f(m) + g(n) (resp. L(m, n) = f(m) × g(n)).
ON SPACES OF CONNECTED GRAPHS III: THE LADDER FILTRATION
Authors: KNEISSLER JAN A. 
Published: July 2002

A new filtration of the spaces of tri-/univalent graphs [Formula: see text] that occur in the theory of finite-type invariants of knots and 3-manifolds is introduced. Combining the results of the two preceding articles, the quotients of this filtration are modeled by spaces of graphs with two types of edges and four types of vertices, and an upper bound for dim [Formula: see text] in terms of the dimensions of the filtration quotients is given. The degree m up to which [Formula: see text] is known is raised by two for u=0 and u=2.
ARTHROSCOPIC SUTURING OF ULNAR AVULSIONS (TYPE I-B) OF THE TRIANGULAR FIBROCARTILAGE COMPLEX OF THE WRIST
Authors: De Smet L. , Van De Meulebroucke B. , Van Ransbeeck H. , Zachee B. , Fabry G. 
Published: July 2002

We reviewed 17 patients with an arthroscopic repair of ulnar avulsions of the TFCC: 12 are considered good, 2 fair and 3 poor.No major complications occurred. The grip forced averaged 71.5% of the contralateral side.These results equal those of open procedures, without the necessity of an extensive approach.
Determining View dependencies using tableaux
Authors: Klug Anthony , Price Rod 
Published: July 2002

A relational database models some part of the real world by a set of relations and a set of constraints. The constraints model properties of the stored information and must be maintained true at all times. For views defined over physically stored (base) relations, this is done by determining whether the view constraints are logical consequences of base relation constraints. A technique for determining such valid view constraints is presented in this paper. A generalization of the tableau chase is used. The idea of the method is to generate a tableau for the expression whose summary violates the test constraints in a “canonical” way. The chase then tries to remove this violation.
It is also shown how this method has applications to schema design. Relations not in normal form or having other deficiencies can be replaced by normal form projections without losing the ability to represent all constraint information.
Some Topics in Code Optimization
Authors: Earnest Christopher 
Published: July 2002

Many compilers for higher order languages attempt to translate the source code into “good” object code. Cocke and Schwartz have described an algorithm for discovering when the computation of an expression is redundant (common), and when it can be moved to a less frequently executed region of the program. The present paper includes a tutorial presentation of their basic methods, along with a number of improvements and extensions. These include simplification of the solution method, to save a pass; extension of it to treat the safety constraint, handle multi-entry regions directly, detect additional commonality and code motion after unsafe code motion, and decide where moved code should be put; and combination of the algorithms for commonality and the dead condition, making use of important work of Ken Kennedy.
The methods here applied to collecting information for use in code optimization include general algorithms for solving a set of linear equations in Boolean algebra. The algorithms are most useful when the coefficient matrix is sparse.
Editorial
Authors: Hodgins Jessica 
Published: July 2002

I'm very pleased to have the opportunity to take over as editor-in-chief after Holly Rushmeier's strong leadership of the past three years. ACM has made a big effort to get TOG back on schedule after the delays caused by changing to a new publication system. With this issue, we are almost on schedule again and the backlog of accepted papers is significantly reduced. I hope to further shorten the time the return reviews to authors and to get accepted paper to readers. As part of that effort, I have asked Steve Fortune for Bell Labs, John Hart from Washington State, Joe Marks from MERL, and Jorg Peters from the University of Florida to be new members of the editorial board to replace those who retired with the end of Holly's term.
I expect that we'll see significant changes in the role of journals during my three-year term. Right now, journals utilize peer reviews and a revision cycle to provide accreditation to research, but this process is tied to a particular distribution medium and requires financial support in the form of subscription fees. With the increasing use of web-baed publishing, I expect that the accreditation and distribution functions will begin to separate. Accreditation will continue to play an important role in scientific reputations and academic careers, while the publication media will become far more diverse. This diversification is particularly important for graphics because many of its important results are not represented well on paper. TOG has moved in this direction with a web page that is expertly maintained by Eric Haines and contains occasional supplemental material (http://www.acm.org./tog/). If TOG is to represent the true breadth of graphics, however, we will have to make much more of an effort in this direction.
During the next three years, we will almost certainly see significant changes in graphics as well. Clearly, the field is expanding beyond the creation of beautiful and useful images and image sequences.
New emphases include increasingly realistic physical modeling, interactive worlds, and nonvisual modalities. Graphics is a fascinating field, in part because researchers are able to adopt and adapt new ideas from so many other fields: art, vision, physics, materials science, control, optimization and biomechanics. I look forward to the innovative and creative work that the community will submit to TOG during the next three years.
From Washington
Authors: Steier Rosalie 
Published: July 2002

Congress is paying careful attention to threats to U.S. high technology from two areas: trademark and patent infringement and proposed foreign violation of U.S. copyright laws.
Computer technology is becoming a major victim of the nearly $8 billion counterfeit business threatening the American economy. Some recent product examples include fake Apple computers seized by U.S. Customs and reverse engineered Apples and other microcomputers on sale in Hong Kong for $300, about a third of the price of a genuine product. U.S. firms fear losses large enough to hinder research and development efforts. This would result in erosion of their technological edge.
Intentional resolution of privacy protection in database systems
Authors: Minsky Naftaly 
Published: July 2002

Traditionally, privacy protection in database systems is understood to be the control over what information a given user can get from a database. This paper is concerned with another, independent, dimension of privacy protection, the control over what a user is allowed to do with a piece of information supplied to him by the database. The ability to condition the supply of information on its intended use is called here “intentional resolution” of privacy protection.
The practical importance of intentional resolution is demonstrated by several examples, and its realization is discussed. It is shown that intentional resolution can be achieved, but that it involves a radical change from the traditional approach to the process of user-database interaction. In particular, it appears to be necessary for the database to impose a certain amount of control over the internal behavior of users' programs which interact with it. A model for user-database interaction which admits such a control is developed.
A system for typesetting mathematics
Authors: Kernighan Brian W. , Cherry Lorinda L. 
Published: July 2002

This paper describes the design and implementation of a system for typesetting mathematics. The language has been designed to be easy to learn and to use by people (for example, secretaries and mathematical typists) who know neither mathematics nor typesetting. Experience indicates that the language can be learned in an hour or so, for it has few rules and fewer exceptions. For typical expressions, the size and font changes, positioning, line drawing, and the like necessary to print according to mathematical conventions are all done automatically. For example, the input sum from i=0 to infinity x sub i = pi over 2 produces ∑
∞

i
=0

x

i

= π/2

The syntax of the language is specified by a small context-free grammar; a compiler-compiler is used to make a compiler that translates this language into typesetting commands. Output may be produced on either a phototypesetter or on a terminal with forward and reverse half-line motions. The system interfaces directly with text formatting programs, so mixtures of text and mathematics may be handled simply.
This paper was typeset by the authors using the system described.
Automatic contour map
Authors: Cottafava G. , Le Moli G. 
Published: July 2002

Some methods for contour mapping by means of a digital plotter are dicussed, and a new method is presented that is simple enough to be implemented by programs with a rather small number of instructions (about 120 FORTRAN IV instructions are required). Comparisons with some methods proposed by other authors are also performed.
A FORTRAN IV program implementing the proposed method is availabel at the Istituto di Elettrotecnica ed Elettronica, Politecnico di Milano.
The structure of programming languages
Authors: Raphael Bertram 
Published: July 2002

In this paper the major components of every programming language are identified as: (1) the elementary program statement, (2) mechanisms for linking elementary statements together, (3) the means by which a program can obtain data inputs. Several alternative forms of each of these components are also described, compared and evaluated. Many examples, frequently from list processing languages, illustrate the forms described.
The advantages, disadvantages and factors influencing the choice of a form of component for a language are discussed, and the paper concludes with the suggestion that programming languages evolve toward one which will permit all the most convenient ways of structuring programs, organizing systems and referencing data.
Data filtering applied to information storage and retrieval applications
Authors: Larsen Robert P. 
Published: July 2002

Manipulation of data strings is the most complex processing function in information storage and retrieval applications. Data string manipulation is discussed within the context of an interpretive processing environment controlled by the use of procedural directives. The sequence of procedural directives is derived from a job assumed to be expressed in a user-oriented source language.
Each data string within the structured data environment (data bank) is explicitly or implicitly related to a format declaration residing in a format library. The processing mechanics associated with data string manipulation is developed in accordance with a generalized data filtering concept. This results in the implementation of a two-port data filter module that satisfies internal processing functions by filtering data strings through format declarations associated with its input and output ports.
Use of the disk file on stretch
Authors: Carlson B. G. , Voorhees E. A. 
Published: July 2002

The paper begins by briefly describing the Stretch (IBM 7030) computer with special emphasis given to the organization and operation of its input-output equipment. Physical characteristics of the two-disk system (4,194,304 72-bit words, 8
µ
sec-per-word transmission rate, etc.) are noted. Timing limitations due to arm motion and disk rotation are discussed.

Applications of disk usage are discussed separately for problem programs and for systems programs such as compilers and the supervisory program. Approximately 260,000 words of disk storage are reserved for the storage of systems programs and the subroutine library. Problem programs, however, are not currently filed on the disk.
Certain programming techniques are discussed for transmitting words between disk and core storage with minimum delaying and interruption of the arithmetic unit. Dumps on disk are considered for both recovery from computer malfunction and for mathematical or physical developments during the calculation.