bluuebunny/crossref_metadata_2025_split huggingface dataset:
Cryptococcosis in AIDS
Authors: Imwidthaya P , Poungvarin N 
Published: July 2002

Summary
A total of 87 patients (17 female, 70 male) were admitted to Siriraj Hospital, Mahidol University, Bangkok, Thailand, from January 1996 to December 1997, with a diagnosis of cryptococcal meningitis and underlying AIDS. The age range was 14–70 years, mean 32.1. Six females (35%) and thirty-one males (44%) died, while the others were discharged home after clinical improvement. The mean duration of admission of those who died was 14.5 days, which was shorter than that of the patients who survived (25.7 days). Cerebral cryptococcosis was diagnosed using culture (100%), India ink preparation (91%), latex agglutination test (100%), and polymerase chain reaction (86%). Polymerase chain reaction fingerprinting of Cryptococcus neoformans revealed 99% serotype A and 1% serotype B. The mean minimum inhibitory concentrations of amphotericin B, flucytosine, fluconazole and itraconazole against 87 isolates of C neoformans were 0.55 μg/ml (0.25–1, SD = 0.22), 9.5 μg/ml (2–20, SD = 4.91), 6.9 μg/ml (1–16, SD = 4.42) and 0.36 μg/ml (0.125–1.0, SD = 0.23), respectively. These findings showed that the cryptococcal infections were sensitive to these antifungal agents.
Primary biliary cirrhosis: new perspectives in diagnosis and treatment
Authors: Prince Martin I , Jones David E J 
Published: July 2002

Abstract
Primary biliary cirrhosis (PBC) is a chronic autoimmune disease characterised by cholestatic liver function tests, antimitochondrial antibodies, and abnormal liver histology. Early descriptions of a rare rapidly progressive disease no longer reflect the more indolent progress often seen today. Many patients have significant long term morbidity through symptoms such as fatigue and itch with a minority progressing to liver failure and need for transplantation. The current data on the diagnosis, clinical progression, and treatment of PBC are reviewed.
LIMIT CYCLE BIFURCATION FROM CENTER IN SYMMETRIC PIECEWISE-LINEAR SYSTEMS
Authors: FREIRE EMILIO , PONCE ENRIQUE , ROS JAVIER 
Published: July 2002

The rapid bifurcation described by Kriegsmann [1987] is shown to be a generic bifurcation for planar symmetric piecewise-linear systems. The bifurcation can be responsible for the abrupt appearance of stable periodic oscillations. Although it has some similarities with the Hopf bifurcation for smooth systems, since the stability change of an equilibrium involves the appearance of one limit cycle, the dependence of the limit cycle amplitude on the bifurcation parameter is different from the Hopf's case. To characterize this bifurcation, accurate estimates for the amplitude and period of the bifurcating limit cycle are given. The analysis is just illustrated with the application of the theoretical results to the Wien bridge oscillator. Comparisons with experimental data and Kriegsmann's analysis are also included.
NECROSIS OF THE INDEX, MIDDLE AND RING FINGER PULPS AFTER TRANSFER OF A HETERODIGITAL NEUROVASCULAR ISLAND FLAP
Authors: Lim Aymeric , Low C K , Lee P K 
Published: July 2002

The heterodigital neurovascular island flap is indicated for the resurfacing of significant defects of the thumb pulp. It provides excellent soft tissue cover and sensibility.1 The complications reported have been mostly neurological and include poor sensation, hyperaesthesia, failure of cortical integration and cold intolerance.2–4 Loss of the flap from vascular insufficiency has also been reported.2,5 We report the loss of the index, middle and ring finger pulps in a patient after transfer of a heterodigital neurovascular island flap from the middle finger to the thumb.
Estimating and improving the quality of information in a MIS
Authors: Morey Richard C. 
Published: July 2002

Most discussions of MIS's assume that the information in the records is error-free although it is recognized that errors exist. These errors occur because of delays in processing times, lengthy correction times, and, overly or insufficiently stringent data edits. In order to enable the user to implement data edits and correction procedures tailored to the degree of accuracy needed, this paper presents functional relationships between three common measures of data quality. The MIS addressed is one where records in a MIS are updated as changes occur to the record, e.g., a manpower planning MIS where the changes may relate to a serviceman's rank or skills. Since each of the updating transactions may contain an error, the transactions are subjected to various screens before the stored records are changed. Some of the transactions including some that are correct, are rejected; these are reviewed manually and corrected as necessary. In the meantime, the record is out of date and in error. Some of the transactions that were not rejected also lead to errors. The result is that at any given time the MIS record may contain errors.
For each of several error control mechanisms, we show how to forecast the level of improvement in the accuracy of the MIS record if these options are implemented.
Signature simulation and certain cryptographic codes
Authors: Hammer Carl 
Published: July 2002

Three cyphers allegedly authored by Thomas Jefferson Beale in 1822 have been the subject of intensive study for over 100 years. Generations of cryptanalysts have expended untold man-years, thus far without success, attempting to decode them; vast armies of fortune hunters and treasure seekers have devoted Herculean labors to digging up the rolling hills of Virginia trying to locate the promised bonanza. The history of pertinent activities would fill volumes, yet serious students of cryptography have always had nagging doubts about the cyphers' authenticity. It has been alleged that the “known solution” to Cypher Number Two: 115, 73, 24, 818, 37, 52, 49, … (“I have deposited in the County of Bedford about four miles from Buford's in an excavation or vault…”) with the aid of an unsanitized version of the Declaration of Independence was merely a superb, imaginative, and grandiose hoax perpetrated ages ago for whatever reasons.
Modern computer technology could obviously perform signature analyses on the Beale cyphers and could also, in fact, simulate the process of encoding itself so as to yield new clues and deeper insights into their construction. For the benefit of the uninitiated, the encoding method used in the second cypher employs a specified document whose words are simply numbered consecutively, and first letters of these words are sought out at random to match the letters of the cleartext or message. The sequence of numbers corresponding to these matches is then written down as the final code. While primitive, the process has the advantage of relative security until the source document becomes known; at that moment the cypher can be decoded even by second graders.
The work now completed with the help of our UNIVAC 1108 includes numerous analytical studies of the Beale cyphers and various types of simulations. For example, we have turned the entire process of simulated encoding by various schemes over to the machine and analyzed the signatures of these synthetic codes; we have also encoded various messages by hand, using different texts and a variety of methods to obtain their signatures. These simulations provide convincing evidence that the signatures are both process and data dependent; they indicate also very strongly that Mr. Beale's cyphers are for real and that it is merely a matter of time before someone finds the correct source document and locates the right vault in the Commonwealth of Virginia.
The expanding world of computers
Authors: Harder E. L. 
Published: July 2002

The onward sweep of automatic processing of information is impeded by nine principal barriers: geography, cost, problem complexity, man-machine communication, inadequate sensors, lack of understanding, distance, time, and size. The main incentive for breaching these barriers is the universal need for processing information, ever more urgent as the greater part of human work activity changes from production to service.
Computer developments in hardware, programming, time-sharing, education, data communication, and displays are judged by how effectively they remove these barriers, and their barrier-smashing potentialities indicate continued rapid expansion. Problem-oriented languages are particularly effective over the entire front. Online computers and time-sharing also rate high by this measure. Education and increased understanding are basic to all progress with the computer.
This complex but powerful tool is the most important one available to governments and scientists to use in studying the problems being created by the population explosion, and in analyzing possible solutions.
Hollerith punched card code
Authors: Lohse E. 
Published: July 2002

This proposed USA Standard presents the standard Hollerith Card Code representation of the 128 characters of USASCII in twelve-row punched cards.
Other standards specify the dimensions and quality of punched paper ca rds, and the dimensions and locations of the holes punched in the cards.
This coded representation of the USASCII character set for the twelve-row punched card was developed from research, review of historical work and careful consideration of the use of punched cares in information processing and communication. Resolution of several conflicting requirements is reflected herein.
Letters to the editor: An interpretive input routine for linear programming
Authors: Aigner Dennis J. 
Published: July 2002

In this descriptive article an input code is presented which greatly simplifies data input to any linear programming solution routine, for subsequent use either as a predagogical device or for solving rather small LP problems. This latter (limited) use derives not at all from inherent limitations in the code itself, but from an efficiency evaluation: large LP problems would doubtless benefit from an input system more suited for bulk data handling than the input code described.
From a user's standpoint, input appears almost exactly as a textbook presentation of the LP problem (limited only by a keypunch's inability to write subscripts, etc.). The input interpreter scans columnwise, thus no fixed format data preparation is required. The user may also, under very general requirements only, liberally use editorial comments throughout the input deck as an aid in identification, e.g., of row constraints.
The article includes examples of input, output from a solution routine presently in use, and a skeleton flowchart of the input interpreter.
Standards: Heading format for data transmission (A USAAI) tutorial
Authors: Lohse E. 
Published: July 2002

This paper is for information purposes and is intended as a comprehensive thought-provoking collection of the major aspects and considerations influencing Heading Format for Data Transmission.
Information processing systems of today have outgrown the confines of the attended and isolated system environment. They now perform information interchange via communication networks, often with many real-time aspects. This interconnection of information processing systems via communciations networks requires that the two (or mo re) stations performing information interchange operate by agreed upon information formats. It is the intent of this paper to discuss the uses and organization of all known items that might be included in one type of information format: Heading Format. This paper is an attempt to provide an all-inclusive list of heading format items, thoroughly describle and discuss each item, and arrange the items in a logical sequence. This will establish a comprehensive heading format item sequencing list that individual message transfer systems may draw on to obtain consistent and usable message formats. It is not proposed that all heading format items or even that any one particular heading format item be mandatory for any system.
This paper explores the implications of the use of heading format for generalized information generalized information interchaneg and the criteria on which a future heading format standard could be based.
The following guidelines were used as a basis for the Task Group's work on message formats.
The initial goal of the Task Group should be to prepare a tutorial paper on message formats. In the future, the Task Group may wish to prepare a standard covering message formats if this is found to be desirable.
The Task Group should avoid message format (heading) definitions that are too narrow in scope; that is, a message heading should not be defined in such a manner that it is only applicable to a relatively small class of systems (e.g. store-and-forward).
The doctrine for the use of message headings should be such that, by logical extension, it can meet the needs of communication systems that have different degrees of sophistication.
A compiler-building system developed by Brooker and Morris
Authors: Rosen Saul 
Published: July 2002

In a number of articles published during the past two years, R. A. Brooker and D. Morris (joined by J. S. Rohl in their most recent paper) have presented a very interesting programming system that they have developed for the Ferranti Atlas computer.
The present paper describes some of the major features of their system. It expands on some points that the original authors cover briefly, and treats only very lightly some topics to which they devote considerable space.
The purpose of this paper is purely expository. Except in some very small details, and in some comments, it does not intentionally depart from or add to the material published in the listed references.
In the opinion of the writer, systems of this kind are well worth implementing and will provide useful research tools in the development of languages and techniques. This opinion is true even when such systems turn out to be of limited usefulness in producing “production” compilers, where compiling speed and object code optimization may be considered more important than language flexibility and elegance or generality of system organization.
Data Mining with optimized two-dimensional association rules
Authors: Fukuda Takeshi , Morimoto Yasuhiko , Morishita Shinichi , Tokuyama Takeshi 
Published: July 2002

We discuss data mining based on association rules for two numeric attributes and one Boolean attribute. For example, in a database of bank customers, Age and Balance are two numeric attributes, and CardLoan is a Boolean attribute. Taking the pair (Age, Balance) as a point in two-dimensional space, we consider an association rule of the form
((Age,Balance) ∈P)⇒(CardLoan = Yes),
which implies that bank customers whose ages and balances fall within a planar region P tend to take out credit card loans with a high probability.We consider two classes of regions, rectangles and admissible (i.e., connected and x-monotone) regions. For each class, we propose efficient algorithms for computing the regions that give optimal association rules for gain, support, and confidence, respectively. We have implemented the algorithms for admissible regions as well as several advanced functions based on them in our data mining system named SONAR (System for Optimized Numeric Association Rules), where the rules are visualized by using a graphic user interface to make it easy for users to gain an intuitive understanding of rules.
The human aspects of computing
Authors: Ledgard Henry 
Published: July 2002

What makes computer users happy? Can systems help humans to use them? Does programming sharpen other thinking skills? Is computer anxiety important? Will programmers use Ada packages? How do students learn programming concepts? Are spelling correctors at their limits? When does the work load on a terminal get too heavy? Are instruction sets too large?
These nine questions define some important issues for those of us who study human factors—the ways hardware and software affect, and are affected by, their users. Although the major accomplishments in the field will always rest on careful inspiration, to some degree these questions can be resolved empirically.
Generally, empirical work falls into three broad categories:
Although not at all by choice, only the first two of these categories are represented in this collection.
As with most papers that are accepted and appear in print, the reviewers or editors have some special reason for liking a paper in the first place. This reason may not appear in the reviews of the paper, but it does capture some underlying point or principle deemed to be important.
Each of the articles in this special section is a short description of a study addressing one of the nine questions. The results of these studies do not always reinforce conventional wisdom. Some of the conclusions are provocative. I invite you to read the articles and to see whether you agree with their conclusions.
Data replicas in distributed information services
Authors: Gladney H. M. 
Published: July 2002

In an information distribution network in which records are repeatedly read, it is cost-effective to keep read-only copies in work locations. This paper presents a method of updating replicas that need not be immediately synchronized with the source data or with each other. The method allows an arbitrary mapping from source records to replica records. It is fail-safe, maximizes workstation autonomy, and is well suited to a network with slow, unreliable, and/or expensive communications links.
The algorithm is a manipulation of queries, which are represented as short encodings. When a response is generated, we record which portion of the source database was used. Later, when the source data are updated, this information is used to identify obsolete replicas. For each workstation, the identity of obsolete replicas is saved until a workstation process asks for this information. This workstation process deletes each obsolete replica, and replaces it by an up-to-date version either promptly or the next time the application asks for this particular item. Throughout, queries are grouped so that the impact of each source update transaction takes effect atomically at each workstation.
Optimizations of the basic algorithm are outlined. These overlap change dissemination with user service, allow the mechanism to be hidden within the data delivery subsystem, and permit very large networks.
Dating the Time of Origin of Major Clades: Molecular Clocks and the Fossil Record
Authors: Smith Andrew B. , Peterson Kevin J. 
Published: July 2002

▪ Abstract  Molecular and paleontological data provide independent means of estimating when groups of organisms evolved in the geological past, but neither approach can be considered straightforward. The single most fundamental obstacle to developing an accurate estimate of times of origination from gene sequence data is variation in rates of molecular evolution, both through time and among lineages. Although various techniques have been proposed to circumvent this problem, none unambiguously allow the components of time and rate to be separated. Furthermore, problems of establishing accurate calibration points, correctly rooted phylogenies, and accurate estimates of branch length remain formidable. Conversely, paleontological dates fix only the latest possible time of divergence, and so probabilistic methods are required to set a lower boundary on origination dates. Realistic confidence intervals that take preservational biases into account are only just becoming available.Although molecular and paleontological approaches to dating often agree reasonably well, there are two notable areas of disagreement; when mammal and bird orders originated and when the major phyla originated. The discrepancy in dating bird/mammal ordinal origins probably reflects a global rock-record bias. Paleontological sampling in the Late Cretaceous is still too restricted geographically to draw any firm conclusions about the existence of a pre-Tertiary record for modern orders of bird or mammal from anywhere other than North America. Dating the time of origin of phyla is more complicated, and is confounded by both preservational biases and problems of molecular clock estimation.
QUANTITATIVE FLOW VISUALIZATION IN UNSEEDED FLOWS
Authors: Miles and Richard B. , Lempert Walter R. 
Published: July 2002

▪ Abstract  The various tools for flow visualization have been significantly expanded over the past several years through the use of molecular scattering and molecular laser-induced fluorescence. These approaches have added the capability of sampling individual small volume elements within a flow, and by using cameras for detection, they are easily extended to sample lines and cross-sectional planes. This localized measurement capability means that these approaches can be made quantitative even in complex and/or unsteady flow fields. If the molecular species is naturally occurring, such as oxygen or nitrogen in air, then no seeding is required. Furthermore, in these applications, images of the flow can be frozen in time by using a short pulse laser for illumination. The distribution of the molecules reflects the true physics of the flow, so even raw images taken in this manner give an immediate understanding of flow field properties. With proper calibration, the images can be further analyzed to yield quantitative information about the flow. In the case of flow tagging, the analysis gives velocity profiles when lines are written, and deformation, vorticity, and dilation with grid patterns. Molecular scattering can be used to give quantitative values of density, temperature, and two-dimensional velocity. This paper presents three such molecular-based approaches: laser-induced fluorescence from oxygen, flow tagging by oxygen excitation, and Rayleigh scattering. These three approaches are chosen because all three can be used in naturally occurring air with no seeding. The raw data from each of these approaches gives an immediate appreciation of the flow structure and further analysis yields accurate values of velocity, temperature, and density. These approaches use readily available laser sources; however, they will be greatly enhanced with new source technologies that are currently under development.
Complementary Category Learning Systems Identified Using Event-Related Functional MRI
Authors: Aizenstein Howard J. , MacDonald Angus W. , Stenger V. Andrew , Nebes Robert D. , Larson Jeris K. , Ursu Stefan , Carter Cameron S. 
Published: July 2002

AbstractEvent-related fMRI was used to dissociate the neural systems involved in category learning with and without awareness. Ten subjects performed a speeded response category learning task. Functional MR images were acquired during both explicit and implicit learning conditions. Behavioral data showed evidence of learning in both conditions. Functional imaging data showed different activation patterns in implicit and explicit trials. Decreased activation in extrastriate region V3 was found with implicit learning, and increased activation in V3, the medial temporal lobe, and frontal regions were found with explicit learning. These results support the theory that implicit and explicit learning utilize dissociable neural systems. Moreover, in both the implicit and explicit conditions a similar pattern of decreased activation was found in parietal regions. This commonality suggests that these dissociable systems also operate in parallel.