bluuebunny/crossref_metadata_2025 huggingface dataset:
RAMAN SPECTRA OF TITANIUM DI-, TRI-, AND TETRA-CHLORIDES
Authors: MIYAOKA H. , KUZE T. , SANO H. , MORI H. , MIZUTANI G. , OTSUKA N. , TERANO M.
Published: July 2002

We have obtained the Raman spectra of TiCl n (n= 2, 3, and 4). Assignments of the observed Raman bands were made by a normal mode analysis. The force constants were determined from the observed Raman band frequencies. We have found that the Ti-Cl stretching force constant increases as the oxidation number of the Ti species increases.
BERRY'S PHASE AND ORGANIC SALT WITH CHARGE TRANSFER
Authors: AGUIAR PINTO A. C. , THOMAZ M. T. , BRUNO R.
Published: July 2002

We consider the dynamics of a dimer of the organic salt N-methyl-M-ethylmorpholinium-tetracyanoquinodimethane [MEM(TCNQ)2] in the presence of an external precessing magnetic field. We derive the influence of Berry's phases on the magnetization and electric dipole moment per site of the organic salt in the adiabatic limit.
COMPLETE RENORMALIZATION OF THE U-EVOLUTION-MATRIX IN QED
Authors: SEKE JOSIP
Published: July 2002

It is demonstrated that the incompleteness of the conventional on-mass-shell renormalization comes from its exclusive application in the S-matrix theory. Therefore, in order to achieve the renormalization of the U-matrix, a new general renormalization concept, being valid in both non-relativistic and relativistic QED, is applied. Moreover, by using the new method, a renormalized general expression for the non-Lorentzian radiative line shape is derived.
TESTING FOR LOCAL ACTIVITY AND EDGE OF CHAOS
Authors: YANG TAO , CHUA LEON O.
Published: July 2002

In this paper we study the local activity, local passivity and edge of chaos of continuous-time reaction–diffusion cellular nonlinear networks (CNN) with one-port first-order, one-port second-order, two-port second-order, two-port third-order and three-port third-order cells. We prove that the local passive regions determined by cell impedance ZQ(s) and cell admittance YQ(s) for first- and second-order cells are equivalent to each other. We also present an efficient procedure to determine the edge-of-chaos parameter region by combining the local active regions derived from YQ(s) and the pole locations of ZQ(s). In order to characterize the fundamental limitations of local passivity on the emergence of complexity we study the local active property from a parameter space spanned by both the cell parameters and the external excitations called the cell's port currents (in view of its interpretations from classical circuit theory). Analytical results of locally passive, restricted locally passive, edge-of-chaos and locally active parameter regions for CNN cells modeled by cubic nonlinearities are presented. We illustrate our results by analyzing CNN cells modeled by Chua's circuits with a cubic nonlinearity. We find that the morphology of the edge-of-chaos and the local active parameter regions have a close connection to the pattern formation behaviors of CNNs. Simulation results are presented to verify our theoretical results.
NONLINEAR PLANE WAVES IN A LONG-WAVELENGTH CONVECTION MODEL
Authors: MANCHO A. M. , VÁZQUEZ L. , HERRERO H. , HOYAS S.
Published: July 2002

The partial differential equation (PDE) associated with the long-wavelength regime that describes convection between rigid and poorly conducting boundaries in an infinite Prandtl number fluid is studied in this document. This PDE is reduced to a set of ordinary differential equations (ODE) by looking for the exact nonlinear plane wave solutions. Solving this ODE several kinds of oscillatory attractors are obtained. These attractors are compared to oscillations observed in experiments on fluids and some features are also recovered.
SPREAD SPECTRUM COMMUNICATION VIA CHAOS
Authors: ITOH MAKOTO
Published: July 2002

A new scheme is proposed for spread spectrum communication which transmits both analog and binary data via chaotic carriers. The proposed systems have some standard properties of spread spectrum communication. Some computer simulations and performance analysis are given to examine the validity of this scheme.
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.
DIFFERENTIAL EQUATIONS WITH MULTISPIRAL ATTRACTORS
Authors: AZIZ-ALAOUI M. A.
Published: July 2002

A system of nonautonomous differential equations having Chua's piecewise-linearity is studied. A brief discussion about equilibrium points and their stability is given. It is also extended to obtain a system showing "multispiral" strange attractors, and some of the fundamental routes to "multispiral chaos" and bifurcation phenomena are demonstrated with various examples. The same work is done for other systems of autonomous or nonautonomous differential equations. This is achieved by modifying Chua's piecewise-linearity in order to have additional segments. The evolution of the dynamics and a mechanism for the development of multispiral strange attractors are discussed.
MODIFIED NEWTONIAN POTENTIALS FOR OPTICALLY THIN ACCRETION DISKS AROUND BLACK HOLES
Authors: LØVÅS T.
Published: July 2002

The use of modified Newtonian potentials to describe the gravitational field around black holes has proven successful. I will present here an investigation of the accuracy of several modified Newtonian potentials proposed in the literature, by comparing the result with the exact relativistic solution. I will do so for optically thin accretion disks that are more sensitive to the form of the potential than optically thick standard disks. I find that simple modified Newtonian potentials capture the essential features of general relativity, and the results from using the modified Newtonian potentials deviate from the relativistic result only by 20% at most for nonrotating black holes. For rotating black holes the accuracy depends on the rotation of the black hole.
THE ANGLE-GEOMETRY OF SPACETIME AND CLASSICAL CHARGED PARTICLE MOTION
Authors: INGRAHAM R. L.
Published: July 2002

The five-dimensional angle metric of spacetime is defined, and its connection with the conformal (angle-preserving) group C of transformations of spacetime explained. This is an application to physics of the "sphere geometry" developed in the last century by Liouville, F. Klein, Möbius et al. The extra degree of freedom λ plays several observable roles in solutions of the field equations of the theory (which are uniquely fixed by C-invariance and gauge-invariance under the assumed internal symmetries). In the solution for a gauge boson with arbitrarily moving point source, λ appears as a microscopic "parameter" which enforces a nonzero minimum time lag in causal signal propagation. We show how this enables a nonsingular self-interaction to be defined in classical particle motion having the correct properties. There is the correct radiation-reaction term, but unphysical features of the four-dimensional theory: third order motion equations, runaway solutions, infinite "electromagnetic" mass, etc. are avoided. In free field wave function solutions λ is seen to be conjugate to mass (just as r is to p and t is to E) and provides a mass operator.
A MONTE CARLO STUDY OF CARBON MONOXIDE LAYERS ADSORBED ON IONIC SUBSTRATES: STRUCTURES AND PHASE TRANSITIONS
Authors: VU NGOC-THANH , JACK DAVID B.
Published: July 2002

We have studied the order–disorder phase transitions of carbon monoxide layers adsorbed on sodium chloride and lithium flouride substrates using the Metropolis Monte Carlo method. The simulations have been performed in the temperature range from 5 K to 60 K. At low temperature and monolayer coverage, both of these systems form ordered phases which disorder as the temperature is increased. The transition temperature (Tc) is between 30 K and 35 K for CO/NaCl, and from 40 K to 45 K for CO/LiF. Below Tc, both systems have an ordered p(2 × 1) type structure due to correlated azimuthal orientations. Above Tc, both systems undergo a phase transition to an azimuthally disordered p(1 × 1) structure, i.e. one with no preferred orientation in the surface plane. The heat capacity shows a characteristic divergence at the transition temperature. Coverages of less than a monolayer of the CO/NaCl system have also been studied. The CO molecules are found to aggregate and form islands with an ordered structure in the middle of the islands. These islands also undergo an order–disorder transition but at lower temperatures. Multilayer systems were found to destabilize the p(2 × 1) structure of the bottommost layer in favor of a p(1 × 1) structure with the upper layers adopting the bulk structure.
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.
Hopewell Holdings Limited
Authors: Low Rudy , Luk John , Lieu Geoffrey , Priem Richard L.
Published: July 2002

HHL was listed on the Hong Kong stock exchange in 1972. During the first twelve years, chairperson and managing director Sir Gordon Wu focused on property development in the local market. In the early 1980s, Wu saw great potential in the infrastructure development markets of the Asia-Pacific Region's developing economies. He left the highly profitable property development market in Hong Kong and, over the next twelve years, led HHL to undertake highway and electricity-generation projects throughout the Asia-Pacific region. HHL undertook these projects on a Build-Operate-Transfer (BOT) basis. Many impatient shareholders and financial analysts were critical of the HHL's declining economic condition. In October 1997, Wu was forced to make provisions for the potential loss of HK$5.133 billion resulting from HHL's investment in the Bangkok Elevated Road and Train System, a project that was started in late 1990. There were threats from the Thai authorities to terminate the project and new negotiations would have to be conducted with a new, untested cabinet that was formed after the former Prime Minister was toppled because of the currency crisis. The case deals with the difficulties in undertaking infrastructure development projects in developing countries and in maintaining corporate-government relationships.
OPERATOR PROCESSES MAJORIZING THEIR QUADRATIC VARIATION
Authors: SCHÜRMANN MICHAEL
Published: July 2002

We give a full classification of convolution semigroups of completely positive mappings on Hopf algebras. Using the theory of noncommutative Lévy processes, we prove that these convolution semigroups are solutions of Hudson–Parthasarathy quantum stochastic differential equations. The generating process satisfies a positivity condition on the kernel of the counit which is stronger than complete positivity. It majorizes its bracket process which is the noncommutative process given by the quadratic variation. Our work generalizes and improves parts of the theory of M. Fannes and J. Quaegebeur on infinitely divisible completely positive mappings on groups. It is shown that Azéma martingales in the sense of M. Emery arise as components of convolution semigroups on the q-version of the noncommutative polynomial algebra.
GEOMETRIC APPROACH TO DATA MINING
Authors: RODRIGUEZ WLADIMIR , LAST MARK , KANDEL ABRAHAM , BUNKE HORST
Published: July 2002

In this paper, a new, geometric approach to pattern identification in data mining is presented. It is based on applying string edit distance computation to measuring the similarity between multi-dimensional curves. The string edit distance computation is extended to allow the possibility of using strings, where each element is a vector rather than just a symbol. We discuss an approach for representing 3D-curves using the curvature and the tension as their symbolic representation. This transformation preserves all the information contained in the original 3D-curve. We validate this approach through experiments using synthetic and digitalized data. In particular, the proposed approach is suitable to measure the similarity of 3D-curves invariant under translation, rotation, and scaling. It also can be applied for partial curve matching.
NOISE AND SCANNING BY LOCAL ILLUMINATION AS RELIABILITY ESTIMATION FOR SILICON SOLAR CELLS
Authors: CHOBOLA Z. , IBRAHIM A.
Published: July 2002

This paper presents two methods, namely those using noise and homogeneity measurements of a large area solar cells, for determining the local defects, which bring down efficiency and long reliability of single-crystal silicon solar cells. As a result of the non-uniformities (non-homogeneity) in the large junction area, local areas with lower built-in potentials at the junction lead to hot spots and reduced reliability. The two techniques can be used to give a precise description of the quality of the product technology. Correlations between noise and inhomogeneities for an ensemble of 30 silicon solar cell samples are given.
NOISE-ENHANCED PROPAGATION OF BICHROMATIC SIGNALS
Authors: ZAIKIN A. , TOPAJ D. , GARCÍA-OJALVO J.
Published: July 2002

We examine the influence of noise on the propagation of harmonic signals with two frequencies through discrete bistable media. We show that random fluctuations enhance propagation of this kind of signals for low coupling strengths, similarly to what happens with purely monochromatic signals. As a more relevant finding, we observe that the frequency being propagated with better efficiency can be selected by tuning the intensity of the noise, in such a way that for large noises the highest frequency is transmitted better than the lower one, whereas for small noises the reverse holds. Such a noise-induced frequency selection can be expected to exist for general multifrequency harmonic signals.
CSCW
Authors: Grudin Jonathan
Published: July 2002

Collaboration is a sign of maturation. A child is nurtured at home before venturing into the world. An idea is first developed then introduced to a larger community. We work on a software module in isolation before integrating it.
A survey of adaptive sorting algorithms
Authors: Estivill-Castro Vladmir , Wood Derick
Published: July 2002

The design and analysis of adaptive sorting algorithms has made important contributions to both theory and practice. The main contributions from the theoretical point of view are: the description of the complexity of a sorting algorithm not only in terms of the size of a problem instance but also in terms of the disorder of the given problem instance; the establishment of new relationships among measures of disorder; the introduction of new sorting algorithms that take advantage of the existing order in the input sequence; and, the proofs that several of the new sorting algorithms achieve maximal (optimal) adaptivity with respect to several measures of disorder. The main contributions from the practical point of view are: the demonstration that several algorithms currently in use are adaptive; and, the development of new algorithms, similar to currently used algorithms that perform competitively on random sequences and are significantly faster on nearly sorted sequences. In this survey, we present the basic notions and concepts of adaptive sorting and the state of the art of adaptive sorting algorithms.
Algorithms for intersecting parametric and algebraic curves I
Authors: Manocha Dinesh , Demmel James
Published: July 2002

The problem of computing the intersection of parametric and algebraic curves arises in many applications of computer graphics and geometric and solid modeling. Previous algorithms are based on techniques from elimination theory or subdivision and iteration. The former is, however, restricted to low-degree curves. This is mainly due to issues of efficiency and numerical stability. In this article we use elimination theory and express the resultant of the equations of intersection as matrix determinant. The matrix itself rather than its symbolic determinant, a polynomial, is used as the representation. The problem of intersection is reduced to that of computing the eigenvalues and eigenvectors of a numeric matrix. The main advantage of this approach lies in itsefficency and robustness. Moreover, the numerical accuracy of these operations is well understood. For almost all cases we are able to compute accurate answers in 64-bit IEEE floating-point arithmetic.
The first-course conundrum
Authors: Abelson Hal , Bruce Kim , van Dam Andy , Harvey Brian , Tucker Allen , Wegner Peter
Published: July 2002

Recently, the College Entrance Examination Board (CEEB) has decided to redesign the Advanced Placement (AP) examination in computer science (CS) so that AP courses will be forced to switch from Pascal to C++ starting around 1998.
Customer-developer links in software development
Authors: Keil Mark , Carmel Erran
Published: July 2002

Many of the best ideas for new products and product improvements come from the customer or end user of the product [15]. In the software arena, tapping into this source of information requires the establishment of one or more
customer-developer links
. These links are defined as the techniques and/or channels that allow customers and developers to exchange information.
CASE tools as collaborative support technologies
Authors: Vessey Iris , Sravanapudi Ajay Paul
Published: July 2002

Since the inception of computers, the software industry has searched for dramatic solutions to its systems development problems. In the latter half of the 1980s and into the 1990s, the search has focused on automated software engineering (computer-assisted software engineering or CASE) tools (see, for example, [17]). Many in the software engineering field claim CASE tools will completely replace the software developer [15]. A more realistic view, however, is that such tools will aid systems developers in the process of specifying, designing, and constructing software systems.
Evaluation of model-based retrieval effectiveness with OCR text
Authors: Taghva Kazem , Borsack Julie , Condit Allen
Published: July 2002

We give a comprehensive report on our experiments with retrieval from OCR-generated text using systems based on standard models of retrieval. More specifically, we show that average precision and recall is not affected by OCR errors across systems for several collections. The collections used in these experiments include both actual OCR-generated text and standard information retrieval collections corrupted through the simulation of OCR errors. Both the actual and simulation experiments include full-text and abstract-length documents. We also demonstrate that the ranking and feedback methods associated with these models are generally not robust enough to deal with OCR errors. It is further shown that the OCR errors and garbage strings generated from the mistranslation of graphic objects increase the size of the index by a wide margin. We not only point out problems that can arise from applying OCR text within an information retrieval environment, we also suggest solutions to overcome some of these problems.
Managing user perceptions of email privacy
Authors: Weisband Suzanne P. , Reinig Bruce A.
Published: July 2002

Email users, expecting privacy, risk embarassment, lawsuits, and worse.
Join indices
Authors: Valduriez Patrick
Published: July 2002

In new application areas of relational database systems, such as artificial intelligence, the join operator is used more extensively than in conventional applications. In this paper, we propose a simple data structure, called a join index, for improving the performance of joins in the context of complex queries. For most of the joins, updates to join indices incur very little overhead. Some properties of a join index are (i) its efficient use of memory and adaptiveness to parallel execution, (ii) its compatibility with other operations (including select and union), (iii) its support for abstract data type join predicates, (iv) its support for multirelation clustering, and (v) its use in representing directed graphs and in evaluating recursive queries. Finally, the analysis of the join algorithm using join indices shows its excellent performance.
Customizing information capture and access
Authors: Rus Daniela , Subramanian Devika
Published: July 2002

This article presents a customizable architecture for software agents that capture and access information in large, heterogeneous, distributed electronic repositories. The key idea is to exploit underlying
structure
at various levels of granularity to build high-level indices with task-specific interpretations. Information agents construct such indices and are configured as a network of reusable modules called structure detectors and segmenters. We illustrate our architecture with the design and implementation of smart information filters in two contexts: retrieving stock market data from Internet newsgroups and retrieving technical reports from Internet FTP sites.
Some tests of generalized bisection
Authors: Kearfott R. Baker
Published: July 2002

This paper addresses the task of reliably finding approximations to all solutions to a system of nonlinear equations within a region defined by bounds on each of the individual coordinates. Various forms of generalized bisection were proposed some time ago for this task. This paper systematically compares such generalized bisection algorithms to themselves, to continuation methods, and to hybrid steepest descent/quasi-Newton methods. A specific algorithm containing novel “expansion” and “exclusion” steps is fully described, and the effectiveness of these steps is evaluated. A test problem consisting of a small, high-degree polynomial system that is appropriate for generalized bisection, but very difficult for continuation methods, is presented. This problem forms part of a set of 17 test problems from published literature on the methods being compared; this test set is fully described here.
Economies of scale in computing: Grosch's law revisited
Authors: Mendelson Haim
Published: July 2002

Does Grosch's law apply in the 1980s? A look at the price and performance of computer systems concludes that there are no economies of scale in computing. Computer technology is characterized by constant returns to scale, a fact that has important implications on future centralization/decentralization decisions.
A decision matrix as the basis for a simple data input routine
Authors: Vasilakos G. J.
Published: July 2002

Currently a great deal of time and effort is being spent on the development of bigger and better compiler languages, multiprogram executive systems, etc. Since the implementation of of new methods and procedures is not instantaneous, but rather occurs by an evolutionary process, we should be concerned also with the problem of maintaining, improving and incorporating new ideas into existing systems. It is with this somewhat neglected area that the author is interested. A method employing a decision matrix is presented for the handling of a standard systems programming problem, that of providing a data input routine.
A subjective viewpoint— the use of digital computers in Western Germany
Authors: Schuff H. K.
Published: July 2002

The first computers operating in post-war Germany had been constructed within Germany. These were developed at the Max Plank Institute in Göttingen, with two additional university machines under construction at Darmstadt and Munich [1]. These machines did not attain any importance, however, in the German economy.
A method of syntax-checking ALGOL 60
Authors: Lietzke Marjorie P.
Published: July 2002

A syntax checker was designed based on the syntax of ALGOL as described in the ALGOL 60 Report [
Communications of the ACM
, May 1960]. Since the definition of the elements of the language is recursive it seemed most desirable to design the syntax checker as a set of mutually recursive processors tied together by subroutines which perform certain bookkeeping functions. Because of the recursive nature of the language and of the syntax checker the problem of recovery after an error required much attention. A method was devised which permits most programs to be checked completely despite errors.
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.
Algorithm 419: zeros of a complex polynomial [C2]
Authors: Jenkins M. A. , Traub J. F.
Published: July 2002

The subroutine
CPOLY
is a Fortran program to find all the zeros of a complex polynomial by the three-stage complex algorithm described in Jenkins and Traub [4]. (An algorithm for real polynomials is given in [5].) The algorithm is similar in spirit to the two-stage algorithms studied by Traub [1, 2]. The program finds the zeros one at a time in roughly increasing order of modulus and deflates the polynomial to one of lower degree. The program is extremely fast and the timing is quite insensitive to the distribution of zeros. Extensive testing of an Algol version of the program, reported in Jenkins [3], has shown the program to be very reliable.
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.
Further evidence for the analysis of algorithms for the zero-one programming problem
Authors: Proll L. G.
Published: July 2002

The purpose of this note is to report computational experience additional to that recently summarized by Gue et al., with two algorithms for the zero-one linear programming problem. An error in Gue's paper is corrected. The utility of one of the algorithms as a suboptimizer is indicated.
Buffer allocation in merge-sorting
Authors: Ferguson David E.
Published: July 2002

A fixed buffer allocation for merge-sorting is presented here which minimizes the number of input-output operations for a given order of merge. When sorting on movable arm disks, the number of seeks is equal to the number of input-output operations, and the seek time usually controls the sort time. First some standard terminology is introduced. Then the input buffer allocation method is described, followed by an analysis of the improvement to be expected over more conventional allocation. This analysis makes use of a particular distribution function. An analysis of a completely different distribution is given which yields similar results. This suggests that the results do not depend on a particular distribution function. An optimum output buffer size is also determined. It is concluded that this buffering allocation can significantly reduce the time of merge sorting on movable arm disks when the input data are not random, and that this output buffer allocation should be used whether the data is random or not.
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.
Covering the computer field
Authors: Salton Gerard
Published: July 2002

During the past year, the
Communications
has printed approximately twenty papers in each of three main areas: programming language development, compiler management and construction, and numerical methods. In addition, about twenty new algorithms were published, as well as half a dozen papers covering the general area of education in computer science; new proposed standards were also disseminated for various types of paper tape, punched cards, and for data communication codes. Three of the twelve issues were conference issues consisting of papers originally given at the ACM Conference on Programming Languages and Pragmatics, the ACM Symposium on Symbolic and Algebraic Manipulation, and a Symposium on the Impact of Computing on Undergraduate Mathematics. A survey paper was published on simulation languages, and two reports were printed covering the computer scene in Communist China and Europe, respectively.
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.
Block structures, indirect addressing, and garbage collection
Authors: Kain R. Y.
Published: July 2002

Programming languages have included explicit or implicit block structures to provide a naming convenience for the programmer. However, when indirect addressing is used, as in SNOBOL, naming constraints may be introduced. Two modifications to SNOBOL are described, resulting in two desirable consequences: (1) naming constraints disappear even when there is indirect addressing within function definitions; and (2) there is a significant saving in the number of calls to the garbage collector, because some garbage is collected, at little expense, each time a function returns to its calling program. These modifications have been implemented as an extension to a SNOBOL dialect.
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 comparison of batch processing and instant turnaround
Authors: Smith Lyle B.
Published: July 2002

A study of the programming efforts of students in an introductory programming course is presented and the effects of having instant turnaround (a few minutes) as opposed to conventional batch processing with turnaround times of a few hours are examined. Among the items compared are the number of computer runs per trip to the computation center, program preparation time, keypunching time, debugging time, number of runs, and elapsed time from the first run to the last run on each problem. Even though the results are influenced by the fact that “bonus points” were given for completion of a programming problem in less than a specified number of runs, there is evidence to support “Instant” over “Batch”.
Information Retrieval: PEEKABIT, computer offspring of punched card PEEKABOO, for natural language searching
Authors: Hutton Fred C.
Published: July 2002

The “peekaboo” idea from punched card information retrieval methods has been mated with the idea of superimposed punching to produce a programming technique which cuts computer run time in half on a test search of 33,000 subject index entries. A search program using the device has been operational since late 1963. As an item is entered in the store, an 18-byte mask is created from the item's meaningful words using the inclusive OR operation. If, at search time, the logical product (using the AND operation) of this mask and a similarly constructed
question mask
is not equal to the
question mask
, then one or more question words are not present in the store item. An equality is inconclusive; the words of the store item must be unpacked and compared with question words. The present store is made up of over 600,000 subject index entries estimated to average 60 characters each. Longer texts, such as abstracts, could be handled by multiple masks.
Practical error coefficients in the integration of periodic analytic functions by the trapezoidal rule
Authors: Rabinowitz Philip
Published: July 2002

Theoretical and practical values of error coefficients useful in bounding the error in integrating periodic analytic functions with the trapezoidal rule are tabulated for various ranges of the parameters.
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.
Copyright aspects of computer usage
Authors: Lawlor Reed C.
Published: July 2002

This paper is concerned with the question of what constitutes infringement of a copyright on a book or other nondramatic literary work when the work is fed into a computer and is indexed, analyzed, partially reprinted, or otherwise utilized by the computer to produce eye-readable output. The question of copyrightability of programs and infringement of copyrights on programs is also discussed. The paper is directed primarily to a discussion of the present law. Some aspects of the proposed new copyright law are also included. General recommendations are made with respect to the proposed revisions of the copyright law.
Starting approximations for square root calculation on IBM system /360
Authors: Fike C. T.
Published: July 2002

Several starting approximations for square root calculation by Newton's method are presented in a form to facilitate their use in IBM System/360 square root routines. These approximations include several for the range [1/16, 1], which is the interval of primary interest on IBM System/360.
Symbolic derivatives without list processing, subroutines, or recursion
Authors: Smith Peter J.
Published: July 2002

A routine has been developed which computes and prints out the symbolic derivative of an absolutely continuous elementary function of one or several variables. No use is made of list processing languages. The chain rule is applied and the result is edited to produce results as elegant and efficient as those obtained by hand computation. A subset may be imbedded in a formula translator to introduce a differentiation operator into an “algebraic” programming language.
Logic programming revisited
Authors: Bruynooghe Maurice , Marek Victor
Published: July 2002

Logic programming has been introduced as programming in the Horn clause subset of first-order logic. This view breaks down for the negation as failure inference rule. To overcome the problem, one line of research has been to view a logic program as a set of iff-definitions. A second approach was to identify a unique
canonical, preferred
, or
intended
model among the models of the program and to appeal to
common sense
to validate the choice of such model. Another line of research developed the view of logic programming as a nonmonotonic reasoning formalism strongly related to Default Logic and Autoepistemic Logic. These competing approaches have resulted in some confusion about the declarative meaning of logic programming. This paper investigates the problem and proposes an alternative epistemological foundation for the
canonical model
approach, which is not based on common sense but on a solid mathematical information principle. The thesis is developed that
logic programming can be understood as a natural and general logic of inductive definitions
. In particular,
logic programs with negation represent nonmonotone inductive definitions
. It is argued that this thesis results in an alternative justification of the well-founded model as the unique intended model of the logic program. In addition, it equips logic programs with an easy-to-comprehend meaning that corresponds very well with the intuitions of programmers.
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.
Geometric continuity, shape parameters, and geometric constructions for Catmull-Rom splines
Authors: DeRose Tony D. , Barsky Brian A.
Published: July 2002

Catmull-Rom splines have local control, can be either approximating or interpolating, and are efficiently computable. Experience with Beta-splines has shown that it is useful to endow a spline with
shape parameters
, used to modify the shape of the curve or surface independently of the defining control vertices. Thus it is desirable to construct a subclass of the Catmull-Rom splines that has shape parameters.

We present such a class, some members of which are interpolating and others approximating. As was done for the Beta-spline, shape parameters are introduced by requiring
geometric
rather than
parametric
continuity. Splines in this class are defined by a set of control vertices and a set of shape parameter values. The shape parameters may be applied globally, affecting the entire curve, or they may be modified locally, affecting only a portion of the curve near the corresponding joint. We show that this class results from combining geometrically continuous (Beta-spline) blending functions with a new set of geometrically continuous interpolating functions related to the classical
Lagrange curves
.

We demonstrate the practicality of several members of the class by developing efficient computational algorithms. These algorithms are based on geometric constructions that take as input a control polygon and a set of shape parameter values and produce as output a sequence of Bézier control polygons that exactly describes the original curve. A specific example of shape design using a low-degree member of the class is given.