bluuebunny/crossref_metadata_2025_split huggingface dataset:
Management and outcome of brain abscess in renal transplant recipients
Authors: Arunkumar M J , Rajshekhar Vedantam , Chandy Mathew J , Thomas Paulose P , Jacob Chacko Korula 
Published: July 2002

Abstract
Although infection is the commonest central nervous system complication following renal transplantation, brain abscess is uncommon. Over the last 11 years, five renal transplant recipients who had brain abscesses were treated by computed tomography (CT)-guided stereotactic aspiration. Three patients had a fungal abscess, one a tuberculous abscess and the other had a methicillin-resistant Staphylococcus aureus abscess. One patient required a craniotomy for the excision of a fungal abscess which was persistent after two CT-guided stereotactic aspirations. The survivors in this group are the patient with a tuberculous abscess who is alive and well 5 years after diagnosis, and another with a dematiaceous fungal abscess (phaeohyphomycosis). CT-guided stereotactic surgery is minimally invasive, and can safely be performed in these patients. It often leads to an aetiological diagnosis in renal transplant recipients with brain abscesses. Specific antibiotic management directed towards the causative organism rather than empirical treatment can be instituted following the procedure. Although the ultimate prognosis in these patients is bleak even with specific antibiotic therapy, an occasional patient might have a good outcome with prompt and appropriate therapy.
Chest pain and non-respiratory symptoms in acute asthma
Authors: Edmondstone W M 
Published: July 2002

Abstract
The frequency and characteristics of chest pain and non-respiratory symptoms were investigated in patients admitted with acute asthma. One hundred patients with a mean admission peak flow rate of 38% normal or predicted were interviewed using a questionnaire. Chest pain occurred in 76% and was characteristically a dull ache or sharp, stabbing pain in the sternal/parasternal or subcostal areas, worsened by coughing, deep inspiration, or movement and improved by sitting upright. It was rated at or greater than 5/10 in severity by 67% of the patients. A wide variety of upper respiratory and systemic symptoms were described both before and during the attack.
Non-respiratory symptoms occur commonly in the prodrome before asthma attacks and become more frequent after onset of the attack. Chest pain is usual during asthma attacks. Although it is benign and self limiting it may cause diagnostic confusion and patient distress.
Electrophysiological course of uraemic neuropathy in haemodialysis patients
Authors: Ogura T , Makinodan A , Kubo T , Hayashida T , Hirasawa Y 
Published: July 2002

Abstract
The objective of this study was to confirm electrophysiologically both the presence and course of uraemic neuropathy in haemodialysis patients. Nerve conduction studies of the lower extremities were done in 70 haemodialysis patients and 20 normal volunteers. Compared with that in normal volunteers, the distal motor latency in the tibial nerve of patients was prolonged significantly (p&lt;0.05), and the minimal F wave latency in the tibial nerve was also prolonged significantly (p&lt;0.05). Motor conduction velocity in the tibial nerve was reduced significantly (p&lt;0.05), and sensory nerve conduction velocity in the medial plantar nerve also was reduced significantly (p&lt;0.05). These results suggest the presence of uraemic neuropathy in haemodialysis patients. Twenty patients were investigated by a follow up study five years later. Parameters from F wave conduction studies, which were thought to be the most useful in the evaluation of neuropathy, showed no significant differences between the initial and follow up trials. These observations suggest that uraemic neuropathy does not progress during haemodialysis. These results also suggest that most haemodialysis patients showed electrophysiological evidence of uraemic neuropathy, but no remarkable electrophysiological change in uraemic neuropathy during haemodialysis was recognised.
Management of gastrointestinal haemorrhage
Authors: Ghosh S , Watts D , Kinnear M 
Published: July 2002

Abstract
A variety of endoscopic haemostatic techniques have enabled major advances in the management of not only bleeding peptic ulcers and bleeding varices, but also in a variety of bleeding lesions in the small intestine and in the colon. Indeed, the development and widespread implementation of endoscopic haemostasis has been one of the most important developments in clinical gastroenterology in the past two decades. An increasingly ageing cohort of patients with multiple co-morbidity are being treated and therefore improving the outcome of gastrointestinal bleeding continues to pose major challenges.
Vacuum assisted closure system in the management of enterocutaneous fistulae
Authors: Cro C , George K J , Donnelly J , Irwin S T , Gardiner K R 
Published: July 2002

Abstract

Background
A very important yet often troublesome element in the conservative management of enterocutaneous fistulae is the protection of the surrounding skin from contact with the effluent. This report describes the successful use of a vacuum assisted closure (VAC) system in dealing with this problem.

Methods
The results of using the VAC system were studied in three patients with moderate or high volume output enterocutaneous fistulae where conventional treatment had failed to prevent skin excoriation.

Results
The VAC system was found to be highly effective in controlling fistula effluent and in promoting healing of excoriated skin in all three patients. Complete healing of the fistula was also achieved in two of the three patients.

Conclusion
The VAC system can be an effective and economically viable method of containing fistula effluent and protecting the skin of patients with enterocutaneous fistulae. Contrary to conventional thought, the VAC system may also actually promote healing of the fistula.
THE MAXWELL–DIRAC EQUATIONS: ASYMPTOTIC COMPLETENESS AND THE INFRARED PROBLEM
Authors: FLATO MOSHÉ , SIMON JACQUES , TAFLIN ERIK 
Published: July 2002

In this article we present an announcement of results concerning: a) A solution to the Cauchy problem for the M-D equations, namely global existence, for small initial data at t = 0, of solutions for the M-D equations. b) Arguments from which asymptotic completeness for the M-D equations follows. c) Cohomological interpretation of the results in the spirit of nonlinear representation theory and its connection to the infrared tail of the electron in M-D classical field theory. The full detailed results will be published elsewhere.
COVARIANT TECHNIQUES FOR COMPUTATION OF THE HEAT KERNEL
Authors: AVRAMIDI I. G. 
Published: July 2002

The heat kernel associated with an elliptic second-order partial differential operator of Laplace type acting on smooth sections of a vector bundle over a Riemannian manifold, is studied. A general manifestly covariant method for computation of the coefficients of the heat kernel asymptotic expansion is developed. The technique enables one to compute explicitly the diagonal values of the heat kernel coefficients, so called Hadamard–Minakshisundaram–De Witt–Seeley coefficients, as well as their derivatives. The elaborated technique is applicable for a manifold of arbitrary dimension and for a generic Riemannian metric of arbitrary signature. It is very algorithmic, and well suited to automated computation. The fourth heat kernel coefficient is computed explicitly for the first time. The general structure of the heat kernel coefficients is investigated in detail. On the one hand, the leading derivative terms in all heat kernel coefficients are computed. On the other hand, the generating functions in closed covariant form for the covariantly constant terms and some low-derivative terms in the heat kernel coefficients are constructed by means of purely algebraic methods. This gives, in particular, the whole sequence of heat kernel coefficients for an arbitrary locally symmetric space.
ALLOGRAFT REPLACEMENT IN GIANT CELL TUMOUR OF THE HAND
Authors: Patradul Adisorn , Kitidumrongsook Pravit , Parkpian Vinai , Ngarmukos Chaithavat 
Published: July 2002

Allografts were used to replace excised bone segments affected by giant cell tumour of the hand in three patients. The tumour involved the second, third and fourth metacarpals and the capitate in one case; the first metacarpal and the trapezium in one, and the proximal phalanx of the index in one.All had histological confirmation of diagnosis. One patient had recurrence one year after marginal resection of his third metacarpal and required resection of the two adjacent metacarpals and the capitate. He had no recurrence two years after the secondary treatment. The other two had no recurrence at two and three years after their primary procedures. Their affected hands were functioning well.
A model for input and output of multilingual text in a windowing environment
Authors: Kataoka Yutaka , Morisaki Masato , Kuribayashi Hiroshi , Ohara Hiroyoshi 
Published: July 2002

The layered multilingual input/output(I/O) sytems we designed, based on typological studies of major-language writing conventions, unifies common features of such conventions to enable international and local utilization. The internationalization layer input module converts keystroke sequences to phonograms and ideograms. The corresponding output module displays position-independent and dependent characters. The localization layer positions language-specific functions outside the structure, integrating them as tables used by finite automaton interpreters and servers to add new languages and code sets without recompilation.
The I/O system generates and displays stateful and stateless code sets, enabling interactive language switching. Going beyond POSIX locale model bounds, the system generates ISO 2022, ISO/DIS 10646 (1990), and Compound Text, defined for the interchange encoding format in X11 protocols, for basic polyglot text communication and processing. Able to generate multilingual code sets, the I/O system clearly demonstrates that code sets should be selected by applications which have purposes beyond selecting one element from a localization set. Functionality and functions related to text manipulation in an operating sytem (OS) must also be determined by such applications.
A subset of this I/O system was implemented in the X window system as a basic use of X11R5 I/O by supplying basic code set generation and string manipulation to eliminate OS interference. To ensure polyglot string manipulation, the I/O system must clearly be implemented separately from an OS and its limitations.
Distributed timestamp generation in planar lattice networks
Authors: Ammann Paul , Jajodia Sushil 
Published: July 2002

Timestamps are considered for distributed environments in which information flow is restricted to one direction through a planar lattice imposed on a network. For applications in such networks, existing timestamping algorithms require extension and modification. For example, in secure environments, typical timestamps provide a potential signaling channel between incomparable levels. In hierarchical databases, typical timestamps cause peripheral sites to unnecessarily affect the behavior at main sites.
Algorithms are presented by which a network node may generate and compare timestamps using timestamp components maintained at dominated nodes in the network. The comparison relation is shown to be acyclic for timestamps produced by the generation algorithm. We discuss ways to safely relax the requirement that the network be a lattice. By example, we show how to modify a simple nonplanar lattice so that the generation algorithm can be applied. Uses of the timestamp generation algorithm in the motivating applications are outlined.
Computer professionals whose scientific freedom and human rights have been violated—1984
Authors: Minker Jack 
Published: July 2002

This is the third report prepared by the ACM Committee on Scientific Freedom and Human Rights (CSFHR). The first was published in the March 1981 Communications and the second in the December 1982 issue. This report is an update. Since the committee intends to publish future updates, it would appreciate receiving further information about computer scientists whose rights have been violated. Such information should be sent to: Jack Minker, Vice-Chairman, Committee on Scientific Freedom and Human Rights, Department of Computer Science, University of Maryland, College Park, MD 29742.
Because those whose scientific freedom or human rights have been violated derive sustenance and support from contacts with their colleagues, the CSFHR has established a program in which ACM chapters “adopt” individual scientists and correspond with them. Such correspondence should touch on the personal and scientific and not discuss political matters. These letters greatly improve the morale of the recipients and are one of the few ways they can keep current with computer science and technology. This CSFHR program is directed by Helen Takacs (P.O. Drawer CS, Mississippi State, MS 39762).
Specialized merge processor networks for combining sorted lists
Authors: Hollaar Lee A. 
Published: July 2002

In inverted file database systems, index lists consisting of pointers to items within the database are combined to form a list of items which potentially satisfy a user's query. This list merging is similar to the common data processing operation of combining two or more sorted input files to form a sorted output file, and generally represents a large percentage of the computer time used by the retrieval system. Unfortunately, a general purpose digital computer is better suited for complicated numeric processing rather than the simple combining of data. The overhead of adjusting and checking pointers, aligning data, and testing for completion of the operation overwhelm the processing of the data.
A specialized processor can perform most of these overhead operations in parallel with the processing of the data, thereby offering speed increases by a factor from 10 to 100 over conventional computers, depending on whether a higher speed memory is used for storing the lists. These processors can also be combined into networks capable of directly forming the result of a complex expression, with another order of magnitude speed increase possible. The programming and operation of these processors and networks is discussed, and comparisons are made with the speed and efficiency of conventional general purpose computers.
Balancing cooperation and risk in intrusion detection
Authors: Frincke Deborah 
Published: July 2002

Early systems for networked intrusion detection (or, more generally, intrusion or misuse management) required either a centralized architecture or a centralized decision-making point, even when the data gathering was distributed. More recently, researchers have developed far more decentralized intrusion detection systems using a variety of techniques. Such systems often rely upon data sharing between sites which do not have a common administrator and therefore cooperation will be required in order to detect and respond to security incidents. It has therefore become important to address cooperation and data sharing in a formal manner.
In this paper, we discuss the detection of distributed attacks across cooperating enterprises. We begin by defining relationships between cooperative hosts, then use the take-grant model to identify both when a host could identify a widespread attack and when that host is at increased risk due to data sharing. We further refine our definition of potential identification using access, integrity, and cooperation policies which limit sharing. Finally, we include a brief description of both a simple Prolog model encorporating data sharing policies and a prototype cooperative intrusion detection system.
A model for type checking
Authors: Ledgard Henry F. 
Published: July 2002

Most current programming languages treat computation over different classes of objects (e.g. numbers, strings, labels and functions). For correct compilation and execution, the following question then arises: is a program properly constructed so that its operations and operands are compatible? The activity of answering this question is usually called type checking.
This paper attempts to isolate the notion of type checking and presents a partial solution to the type checking problem based on the notions of abstraction and application of functions. In particular, a program is mapped into an expression within a decideable subset of the λ-calculus, which characterizes the type relations within the program and eliminates all other information. The determination of the type-wise correctness or incorrectness of the program is resolved by reducing its corresponding λ-calculus expression to one of two normal forms, the constant “correct” for a type-wise correct program or the constant “error.”
An application to type checking in Algol 60 is made, and the attendant problems faced for any notion of type checking are discussed.
Development of an international system for legal protection of computer programs
Authors: Smoot Oliver R. 
Published: July 2002

Is execution of a program “copying?” If a program is copyrighted, is execution an infringement of the copyright?
Is an algorithm, or a program, or a computer running a program, patentable?

If a program is licensed as a trade secret to
N
users with a nondisclosure clause, at what point is
N
so large as to be the equivalent of publication?

How far can old laws be stretched to accommodate new technology?
How can developing countries gain access to the computer software they need?
Questions such as these increasingly have concerned software developers and lawyers since computer programs first began to be sold. Now international diplomats responding to the call of the developing nations for increased assistance in their development are asking similar questions.
Efficient multiprogramming resource allocation and accounting
Authors: Hamlet R. G. 
Published: July 2002

Although sometimes thought of as only a component of time-sharing operation, multiprogramming can involve broader questions of resource allocation, since fairness is not required to meet a response criterion. In a multiprogrammed system, it may serve maximal resource use to be unfair, for example by holding an input/output channel idle for a program while it completes a small amount of processor usage, enabling further use of the channel. Several applications of this principle are given, and it is suggested that a multiprogramming executive might dynamically adjust its allocation algorithms to gain efficiency.
Allocation of resources is closely connected to accounting for those resources, raising the problems of repeatability, minimal uncharged overhead, and relative weighting of charges for dependent resources. Since weightings may depend on allocation algorithms, these are not arbitrary accounting parameters. Often the only repeatable accounting is one which omits an extensive overhead; this overhead can be multiple-charged to all programs which benefit from it, so that in the worst case the overhead will be paid, and should multiprogramming prove efficient, overcharges will result.
Multiprogramming turns on allocation of the memory resource essential to control of other resources. The general suggestions for allocation and accounting are applied to this question, and some details provided for the case of a monitor which controls a virtual-memory machine.
On the probability distribution of the values of binary trees
Authors: Hurwitz H. 
Published: July 2002

An integral equation is derived for the generating function for binary tree values, the values reflecting sorting effort. The analysis does not assume uniformly distributed branching ratios, and therefore is applicable to a family of sorting algorithms discussed by Hoare, Singleton, and van Emden. The solution to the integral equation indicates that using more advanced algorithms in the family makes only minor reductions in the expected sorting efforts, but substantially reduces the variance in sorting effort.
Statistical tests of the values of several thousand trees containing up to 10,000 points have given first, second, and third moments of the value distribution function in satisfactory agreement with the moments computed from the generating function. The empirical tests, as well as the analytical results, are in agreement with previously pubished results for the first moment in the cases of uniform and nonuniform distribution of branching ratio, and for the second moment in the case of uniform distribution of branching ratio.
Towards standards for handwritten zero and oh
Authors: Bemer R. W. 
Published: July 2002

The Chairman of the ACM Standards Committee, Julien Green, has charged me with making “more effective use of
CACM
for communication … to get grass-roots opinions from the ACM membership.” This paper is the first attempt.

A partial dossier on distinguishing between handwritten zero and the letter oh is assembled here. This presentation was triggered by a request for guidance in this matter presented by the United Kingdom Delegation to ISO/TC97/SC2, Character Sets and Coding, at the meeting in Paris on 1967 March 13-16. The matter is just now in the province of USASI X3.6, to which comments might be directed.
Comments will be expected within sixty days [by approximately October 1st].
Code extension in ASCII
Authors: Gorn S. 
Published: July 2002

The American Standard Code for Information Interchange (ASCII) contains a number of control characters associated with the principle of
code extension
, that is, with the representation of information which cannot be directly represented by means of the characters in the Code. The manner of use of these characters has not previously been completely described.

This paper presents a set of mutually consistent philosophies regarding code extension applications, and suggests a corollary set of doctrines for the application of the code extension characters. Distinctions are drawn between code extension and such other concepts as “graphic substitution” or “syntactic representation” which are often used to meet similar requirements.
Also covered are certain topics which are not truly concerned with code extension but which are often linked with it in discussion on code applications.
The material in this paper is equally applicable in principle to the (proposed) ISO international 7-bit code for information interchange.
COBOL
Authors: Mackinson Thomas N. 
Published: July 2002

COBOL (COmmon Business Oriented Language) is an English Language programming system which is capable of being implemented on a wide variety of electronic digital computers for use in the solution of business data processing problems.
The idea was conceived in May, 1959 at a meeting called in the Pentagon by Mr. Charles Phillips of the Office of the Assistant Secretary of Defense, Comptroller. The purpose of this meeting was to consider the desirability and the feasibility of establishing a common language for the programming of electronic computers for data processing. Representatives from computer user installations, both government and industrial, computer manufacturers, universities, and others concerned with computers were present. There was almost unanimous agreement that the project was both desirable and feasible. The COnference on DAta SYstems Languages (CODASYL) was established, and three committees were defined and staffed. These committees were the Short Range Committee, the Intermediate Range Committee, and the Long Range Committee. Each committee had its own goal and its own time scale. The coordination of the work to be performed was to be accomplished by an Executive Committee.