bluuebunny/crossref_metadata_2025 huggingface dataset:
Programming pearls: graphic output
Authors: Bentley Jon L.
Published: July 2002

In previous columns we've studied the innards of programs. In this column we'll take a broader view of the programmer's task and consider the kind of output a program should produce. We'll focus on a single problem: once a system has produced detailed output, how can it summarize the trends in the mountain of data?

The answer to that question depends heavily on both the data and the taste of the reader; paragraphs of text and tables of numbers often provide fine summaries. This column, however, will concetrate on graphical representations of data, which allow the powerful human vision system to understand data. A decade ago programmers could offer the excuse that they were limited to crude line printer graphics, but technology has changed that. Many large installations now have laser printers, and graphics printers for home computers sell for a few hundred dollars. This column is about ways that programmers can use the technology to deliver more useful (and more graphic) output.
Estimation of the inverse function for random variate generation
Authors: Hora Stephen C.
Published: July 2002

A regression method for estimating the inverse of a continuous cumulative probability function F
(
x
)
is presented. It is assumed that an ordered sample, X
1
, …,

X
n
, of identically and independently distributed random variables is available. A reference distribution F

0
(
x
)
with known inverse F
0
-1
(
p
)

is used to calculate the quantities W
i

=
i
ln[
F
0
(

X
i

)/
F
0
(
X

i
+1

)].
These quantities are used to estimate the function γ
(
p
) =
pd
ln≥
F
0
[
F
-1
(
p
)]⋦/
dp from which an estimate of F
-1
(
p
)
is derived. The method produces an estimate in a form that is convenient for random variate generation. The procedure is illustrated using data from a study of oil and gas lease bidding.
Algorithm 804
Authors: Alhargan Fayez A.
Published: July 2002

Computer subroutines in C++ for computing Mathieu functions of integer orders are described. The routines can handle a large range of the order
n
and the parameter
h
. Sample test results and graphs are given.
Introduction to a special section on: information systems management
Authors: Davis Gordon B. , Schwartz M. H.
Published: July 2002

This month,
Communications
is devoting its Research Contributions section to a special purpose: to present the results of research on issues in information systems management. In our call for papers, we asked for contributions emphasizing empirical research—rather than conceptual formulations. In all, we received 29 papers. Five of those papers are presented in the section that follows. Many of the papers not included here, we believe, will be published later, in
Communications
or elsewhere.
A technique for testing command and control software
Authors: Watkins Marvin L.
Published: July 2002

A technique for testing embedded-microprocessor command and control programs is described. The continuity inherent in functions computed by programs which monitor natural phenomena is exploited by a simple difference equation-based algorithm to predict a program's next output from its preceding ones. The predicted output is compared with the actual output while indexing through the program's domain. Outputs which cannot be predicted are flagged as potential errors. Data are presented which show that this technique can be a sensitive measure of a program's correctness.
Documentation for a model
Authors: Gass Saul I. , Hoffman Karla L. , Jackson Richard H. F. , Joel Lambert S. , Saunders Patsy B.
Published: July 2002

A set of documents and their organization according to functional requirements in order to produce information that will facilitate the use of models are described. The authors discuss the role of models in the policy process and of documentation in the assessment of such models.
Performance statistics of a time sharing network at a small university
Authors: O'Neill Paul , O'Neill Avis
Published: July 2002

The purpose of the study was to characterize the input traffic on the interactive terminal facility (ITF) at Jackson State University by mathematical distributions. Five traffic measures were extracted from a week's job accounting records: arrival time (time of day of log on), interarrival time (time between successive arrivals), active central processing unit (CPU) time (user's time slice), inactive CPU time (swapping time), and connect time (duration of a user session). To facilitate analysis, four user groups were formed. An analysis of variance established that the group category largely determined the volume of arrivals. Since a normal distribution could not be fitted to the data, it was concluded that the pattern of daily arrivals was best treated as an empirical distribution. Using the method of moments to estimate parameters, it was found that interarrival times could best be characterized by a gamma distribution, while connect, inactive CPU, and active CPU times approximated exponential distributions.
Employment characteristics of doctoral level computer scientists
Authors: Fairley Richard E.
Published: July 2002

A recent report from the National Research Council contains a detailed profile of doctoral level scientists and engineers, as well as doctorates in the humanities [1]. This paper summarizes those portions of the report that pertain to the employment characteristics of Ph.D.'s in computer science, and other Ph.D. scientists and engineers working in computer science. Our purpose is to verify the common folklore concerning employment opportunities in computer science, academic vs. business/industry employment of doctoral level computer scientists, work activities at the doctoral level, and the relative numbers of Ph.D.'s working in the various subdisciplines of computer science.
Orderly enumeration of nonsingular binary matrices applied to text encryption
Authors: Payne W. H. , McMillen K. L.
Published: July 2002

Nonsingular binary matrices of order
N
, i.e., nonsingular over the field {0, 1}, and an initial segment of the natural numbers are placed in one-to-one correspondence. Each natural number corresponds to two intermediate vectors. These vectors are mapped into a nonsingular binary matrix. Examples of complete enumeration of all 2 × 2 and 3 × 3 nonsingular binary matrices were produced by mapping the intermediate vectors to the matrices.

The mapping has application to the Vernam encipherment method using pseudorandom number sequences. A bit string formed from bytes of text of a data encryption key can be used as a representation of a natural number. This natural number is transformed to a nonsingular binary matrix. Key leverage is obtained by using the matrix as a “seed” in a shift register sequence pseudorandom number generator.
Remark on uniform insertion in structured data structures
Authors: Hollander Clifford R.
Published: July 2002

In a recent paper, Shneiderman and Scheuermann [1] have defined an interesting operation, called
uniform insertion
, whereby a (linked) data structure
G
2
can be embedded within another structure
G
1
in such a way that each data node of
G
1
serves as an entry node for
G
2
. This communication points out and corrects an error in their definition, while preserving the spirit of that operation.
Automatic error recovery for LR parsers
Authors: Mickunas M. Dennis , Modry John A.
Published: July 2002

In this paper we present a scheme for detecting and recovering from syntax errors in programs. The scheme, which is based on LR parsing, is driven by information which is directly and automatically obtainable from the information that is already present in an LR parser. The approach, which is patterned after that of Levy and Graham and Rhodes, appears to provide error recovery which is both simple and powerful.
A terminal-oriented communication system
Authors: Heckel Paul G. , Lampson Butler W.
Published: July 2002

This paper describes a system for full-duplex communication between a time-shared computer and its terminals. The system consists of a communications computer directly connected to the time-shared system, a number of small remote computers to which the terminals are attached, and connecting medium speed telephone lines. It can service a large number of terminals of various types. The overall system design is presented along with the algorithms used to solve three specific problems: local echoing, error detection and correction on the telephone lines, and multiplexing of character output.
An efficient data structure for the simulation event set
Authors: Franta W. R. , Maly Kurt
Published: July 2002

Recently algorithms have been presented for the realization of event scheduling routines suitable for general purpose discrete event simulation systems. Several exhibited a performance superior to that of commonly used simple linked list algorithms. In this paper a new event scheduling algorithm is presented which improves on two aspects of the best of the previously published algorithms. First, the new algorithm's performance is quite insensitive to skewed distributions, and second, its worst-case complexity is O(√n), where n is the number of events in the set. Furthermore, tests conducted to estimate the average complexity showed it to be nearly independent of n.
Information reference coding
Authors: Florentin J. J.
Published: July 2002

Items in business systems have to be identified by reference codes, which can later be used as data codes and file keys in an associated data processing system. In business systems associated with large collections of integrated files (databases) it is vital to assign codes in a methodical way so as to control future extension and changes while maintaining correct program action. The principles of methodical coding are discussed, and the way in which logical connections between data items must be reflected in the reference code framework is shown through a set-theoretic information model.
Reduction of compilation costs through language contraction
Authors: Shaw Mary
Published: July 2002

Programming languages tailored to particular groups of users can often be constructed by removing unwanted features from a general purpose language. This paper describes the use of simulation techniques to predict the savings in compilation cost achievable by such an approach. The results suggest a function which describes the effect of changes in the power of a language on the compilation cost of an algorithm expressed in that language: when features not actually used by the algorithm are removed from the language, the cost of compiling the algorithm decreases moderately, but when features that are needed are removed, the compilation cost increases sharply.
A note on the set basis problem related to the compaction of character sets
Authors: Kou Lawrence T. , Wong C. K.
Published: July 2002

This note discusses the reduction of the set basis problem to the clique cover problem.
A note on Cheney's nonrecursive list-compacting algorithm
Authors: Walden David C.
Published: July 2002

Cheney's list-compacting algorithm [1] goes into an infinite loop when it traces a circular list consisting exclusively of non-items. While it may be reasonable to say that such lists should not exist, it would be very difficult to legislate out of existence programs which illegally create such lists because of bugs, and it would not do for the garbage collector to break down in this instance.
Another method of converting from hexadecimal to decimal
Authors: Kailas M. V.
Published: July 2002

There is a simple paper-and-pencil method of converting arithmetic a hexadecimal number
N
to decimal.
Computer photocomposition of technical text
Authors: Alt Franz L. , Kirk Judith Yuni
Published: July 2002

In computer assisted typesetting by means of photocomposition, special problems arise in highly technical material such as mathematical formulas. New solutions to several of these problems have been devised in the information system of the American Institute of Physics. They include: the representation of special characters (foreign alphabets, mathematical symbols, etc.) not available on input keyboards or on the photocomposer; the generation of such symbols, e.g. by overprinting; the precise positioning of accent marks (floating diacritics); line breaks, i.e. words or formulas placed partly at the end of one line and partly at the beginning of the next; and certain aspects of error correction.
Equivalence between AND/OR graphs and context-free grammars
Authors: Hall Patrick A. V.
Published: July 2002

Recent research in artificial intelligence has led to AND/OR graphs as a model of problem decomposition (Nilsson [3]; Simon and Lee [4]). However, AND/OR graphs of a restricted type are equivalent to context-free grammars. This can be set-up formally (the beginnings of a formalism of AND/OR graphs is contained in [4]), but the formalism is so obvious that a brief discussion and example suffice.
A note on best one-sided approximations
Authors: Phillips David L.
Published: July 2002

In this note we consider the relationship between best approximations and best one-sided approximations for three different measures of goodness of fit. For these measures simple relationships exist between best approximations and best one-sided approximations. In particular it is shown that a best approximation and best one-sided approximation differ only by a multiplicative constant when the measure is the uniform norm of the relative error. In this case problems involving best one-sided approximations can be reduced to problems involving best approximations. The result is especially significant if one wants to numerically determine a best one-sided approximation, since algorithms exist for numerically determining best approximations when the measure is the uniform norm of the relative error (see, for example, [1]).
Rough and ready error estimates in Gaussian integration of analytic functions
Authors: Rabinowitz Philip
Published: July 2002

Two expressions are derived for use in estimating the error in the numerical integration of analytic functions in terms of the maximum absolute value of the function in an appropriate region of regularity. These expressions are then specialized to the case of Gaussian integration rules, and the resulting error estimates are compared with those obtained by the use of tables of error coefficients.
Data input by question and answer
Authors: Pyle I. C.
Published: July 2002

A data input scheme for a time-sharing computer is described in this paper. Instead of using format statements to determine the input, the computer asks the user for the required values one at a time. The computer converses with the user during the input process, checks for errors, provides standard data, and allows editing of values input.
A Fortran II load-time saver
Authors: Ackermann A. Frank
Published: July 2002

The FORTRAN II CHAIN feature on the 7090 can be used to save card-to-tape time, loading time, and to provide a convenient method for storing and transporting producting programs. The method is simply to load the desired program as a CHAIN and save the tape on which it is stored. A trivial program can then be used to recall the major program.
A storage allocation and reference structure
Authors: Fitzwater D. R.
Published: July 2002

A method is proposed and discussed which allows a subscripted-variable capability (in the FORTRAN sense) to be added to AUTOCODER-Type assembly systems.
A reprogramming machine
Authors: Burge William H.
Published: July 2002

In this paper a description is given of a model programming system which is directed by a programming language and has a library for storing the user's items. Rules are given for transforming programs written in the language and for rearranging the items in the library so that they share their common parts. Some speculations are made about how the mechanical detection of common parts or patterns of library items could help a user to solve his problems, and about the relationships between the behavior of the reprogramming machine and human intelligent behavior.
Some preliminary remarks on theoretical pragmatics
Authors: Caracciolo A.
Published: July 2002

The term pragmatics has been used, as is well known, by Morris and Carnap to denote that branch of semiotics which deals with the relation between a language and its users. As such I don't like the term very much. But one might also define it to be that branch which deals with the relation between languages and actions or processes. This seems more appropriate to me. In any case, whatever the definition, there is a basic connection between programming languages and pragmatics, as pointed out by Gorn. I devoted a paragraph to this subject in my talk at the IFIP Congress 1965 entitled “Linguistic Problems in Programming Theory.”
Information dissemination and publication control
Authors: Salton Gerard
Published: July 2002

The present issue contains a “Forum on Algorithms” dealing with some of the problems which arise in connection with the algorithm policy of the
Communications
. Specifically, many ACM members believe that a policy which designates only one language (ALGOL) as appropriate for publication purposes is too restrictive, particularly when this language is not accessible to many members and may not, moreover, be especially well suited for the description of many types of problems. This feeling is reflected in Professor Perlis' comments when he suggests that several languages should be acceptable “one language being selected for each … algorithmic activity, chosen for the lucidity with which it expresses the diverse data manipulations of that area.”
On reversible subroutines and computers that run backwards
Authors: Reilly E. D. , Federighi F. D.
Published: July 2002

A computer design is described which permits subroutines to be executed backward as well as forward, either with their instructions unchanged or replaced with conjugate instructions. It is shown that using this concept a number of new subroutine types can be developed with rather unusual properties. Since these properties are analogous to certain matrix operations, a arallel nomenclature is suggested for their classification.
Description of systems used for data transmission
Authors: Gorn S.
Published: July 2002

Task Group X3.3.5
1
is working to develop proposals for standards relating to the performance of systems used for digital data transmission. It has published two tutorial papers which were submitted by the U.S.A. to the International Organization for Standardization. In the first paper—ISO/TC97/SC6(USA-7)30,
2
May, 1964—the general area of system performance was discussed. In the second paper, ISO/TC97/SC6 (USA-11)60,
3
March, 1965, discussed in some detail were two characteristics of system performance, namely, Transfer Rate of Information Bits (TRIB) and Residual Error Rate.

The present paper, the task group's third tutorial paper, is devoted to “System Description” insofar as that topic relates to system performance. Reported are the results of some 14 discussions that have occurred in about 1 3/4 years (June 1964 through March 1966). Including normal turnover of personnel in the group, some 14 people have been involved in these discussions. At present, the members of the task group are associated with business equipment manufacturers, users groups, and suppliers of communication facilities and services in the proportions 5 to 3 to 1.

Other groups have published papers which discuss system description. In April, 1965, a paper from Italy
4
was published in which system description was discussed in relation to line control and communication system techniques. In May, 1965, a paper from France
5
was published in which system description was discussed in relation to system performance. These papers have been an interesting source of information to X3.3.5.

While considering system performance, X3.3.5 concluded that system performance standards cannot be developed and used fully without having an organized way of describing the hardware and conditions to which performance applies. While this may not be quite t
Disk file sorting
Authors: Schick Thomas
Published: July 2002

Use of the “building-block” type of approach suggested in [1] is heartily recommended. It has been used by our computer center for over a year with excellent results.
Computer preparation of a poetry concordance
Authors: Painter James A.
Published: July 2002

A concordance is an alphabetical index of the words used by a major writer, or group of writers, showing each word in its context. It is one of the basic research tools for scholars in the Humanities. Concordances are very useful in studies of language, vocabulary, and the history of ideas in literature and philosophy. Use of a concordance is probably the only way to interpret critically, or sometimes even to understand, a symbolist writer. It can also be used to help determine the age or even the author of a piece of anonymous writing.
A control system for logical block diagnosis with data loading
Authors: Senko M. E.
Published: July 2002

This paper describes a section of an integrated diagnostic monitor system which facilitates the checking of sections of instructions or subroutines anywhere in the object program. A new method of specifying all diagnostic operations in a format similar to a computer program makes the system convenient to use and relatively simple to understand. The paper also describes a number of other novel diagnostic features which can be included in the system.
A short study of notation efficiency
Authors: Smith Howard J.
Published: July 2002

This comparison indicates that an 8-bit character set, with provision for storing two 4-bit decimal digits in one character position, is a more efficient form of representation than the 6-bit character set, at least for a majority of common applications. This 8(4) representation has several other advantages.
An estimation of the relative efficiency of two internal sorting methods
Authors: Nagler H.
Published: July 2002

This report concerns the IBM 705, models I and II. It is a study of the machine time required by two internal sorting methods, the conventional two-way merge, and a form of the binary search, which is due to D. Mordy, of the IBM Corporation. In particular, estimates are derived for the more time-consuming machine operations of comparison of keys, loading of keys into accumulator storage, and transmission of tags. The first two operations arise in both methods; the last is peculiar to the binary search. If the exclusion of other ancillary program steps from the estimation of machine times may be regretted from a purely practical point of view, some of the intermediate estimates may be of interest in a more theoretical context.
Survey of coded character representation
Authors: Bemer R. W.
Published: July 2002

Technical Committee 97 of the International Standards Organization (ISO) is concerned with standards in data processing. The American Standards Association holds the secretariat of this committee. Sectional Committee X3 of A.S.A. is responsible for national data processing standards in the U. S.
COPE (Console Operator Proficiency Examination)
Authors: Farbman David , Ketover Richard
Published: July 2002

Each year electronic computers become more sophisticated, and the programs they must process become more complex. Because of this, dependence of those in computing on the skill and experience of operators is increasing.

At the same time, selection and training of qualified operators grows more difficult. To meet the need for a quick, accurate, uniform operator test and training aid, the authors have developed COPE (Console Operator Proficiency Examination), outlined below While this examination is programmed specifically for the IBM 705 Mode II with two Tape Record Coordinators, similar programs could be developed for other computers.
Group participation computer demonstration
Authors: McCormick E. M.
Published: July 2002

Engelbart
1
has reported on some demonstrations in which a group functions as various parts of a digital computer. These demonstrations are concerned with binary operations including addition. However, there are occasions when it is desirable to have a group participate in a simulation which is not at this detailed level of computer operation. This note suggests a demonstration which allows a group to simulate the execution of a computer routine itself.
Recursive programming in Fortran II
Authors: Ayers James A.
Published: July 2002

An oft-mentioned advantage of ALGOL over FORTRAN is the recursion capability of the former. FORTRAN adherents often belittle this advantage by claiming that all recursive relations can be reduced to recurrence or iterative relations, or that no recursive relations exist which are worth coding as recursive relations. The question of the truth of this must be left unanswered here. It is hoped that the technique described below will draw the poison from the FORTRANers' wounds by allowing them to recurse to their complete satisfaction. There is an hereditary resemblance between this technique and the MAD (Michigan Algorithm Decoder) recursion technique.
Intrinsic response for analog module testing using an analog testability bus
Authors: Su Chauchin , Chen Yue-Tsang , Jou Shyh-Jye
Published: July 2002

A parasitic effect removal methodology is proposed to handle the large parasitic effects in analog testability buses. The removal is done by an on-chip test generation technique and an intrinsic response extraction algorithm. On-chip test generation creates test signals on-chip to avoid the parasitic effects of the test application bus. The intrinsic response extraction cross-checks and cancels the parasitic effects of both test application and response observation paths. The tests using both SPICE simulation and MNABST-1 P1149.4 test chip reveal that the proposed algorthm can not only remove the parasitic effects of the test buses but also tolerate test signal variations. Furthermore, it is robust enough to handle loud environmental noise and the nonlinearity of the switching devices.
The distributed mission training integrated threat environment system architecture and design
Authors: Stytz Martin R. , Banks Sheila B.
Published: July 2002

We describe the architecture, design, components, and functionality of the Distributed Mission Training Integrated Threat Environment (DMTITE) software. The DMTITE architecture and design support the development and run-time operation of computer-generated actors (CGAs) in distributed simulations. The architecture and design employ object-oriented techniques, component software, object frameworks, containerization, and rapid prototyping technologies. The DMTITE architecture and design consist of highly modular components where interdependencies are well defined and minimized. DMTITE is an open architecture and open design, and most component and framework code is open source. The DMTITE architecture and design have been implemented (including all system components and frameworks) and currently support a number of types of computer-generated actors. The DMTITE architecture, design, and implementation are capable of supporting multiple reasoning, vehicle dynamics, skill level, and migration requirements for any type of CGA.
A precision- and range-independent tool for testing floating-point arithmetic II
Authors: Verdonk Brigitte , Cuyt Annie , Verschaeren Dennis
Published: July 2002

The IEEE 754 and 854 standards for floating-point arithmetic are essentially a specification of a programming environment, encompassing aspects from computer hardware, operating systems, and compilers to programming languages (see especially Section 8). Parts I and II of this paper together describe a tool to test floating-point implementations of arbitrary precision and exponent range (hardware as well as software) for compliance with the principles outlined in the IEEE standards. The tool consists of a driver program, together with a very large set of test vectors encoded in a precision-independent syntax. In Part I we have convered the testing of the basic operaitons +, −, ×, / and of the square root and remainder functions. In Part II we describe the extension of the test tool to deal with conversions between floating-point formats, conversions between floating-point and integer formats, the rounding of floating-point numbers to integral values, and binary-decimal conversions. Conversions can now be tested from a floating-point format of arbitrary precision and exponent range to another arbitrary smaller (larger) floating-point format as well as to and from fixed hardware integer formats. Conversion between the bases 2 and 10 can be tested for a number of precisions ranging from sing (24 bits), double (53 bits), long double or extended (64 bits) to quadruple (113 bits) precisioon and a proper multiprecision (240 bits) format. We conclude Part II with some applications of our test tool and report on the results of testing various floating-point implementations, meaning various language-compiler-hardware combinations as well as multiprecision libraries.
Processor modeling and code selection for retargetable compilation
Authors: Van Praet J. , Lanneer D. , Geurts W. , Goossens G.
Published: July 2002

Embedded processors in electronic systems typically are tuned to a few applications. Development of processor-specific compilers is prohibitively expensive and, as a result, such compilers, if existing, yield code of an unacceptable quality. To improve this code quality, we developed a processor model that captures the connectivity, the parallelism, and all architectural peculiarities of an embedded processor. We also implemented a retargetable and optimizing compiler working on this model. We present the graph-based processor model, and formally define the code generation task as binding the intermediate representation of an application to this model. We also present a new method for code selection, based on this processor model, that is capable of handling directed acyclic graphs instead of trees.
Automating program analysis
Authors: Hickey Timothy , Cohen Jacques
Published: July 2002

The first part of the paper shows that previous theoretical work on the semantics of probabilistic programs (Kozen) and on the correctness of performance annotated programs (Ramshaw) can be used to automate the average-case analysis of simple programs containing assignments, conditionals, and loops. A performance compiler has been developed using this theoretical foundation. The compiler is described, and it is shown that special cases of symbolic simplifications of formulas play a major role in rendering the system usable. The performance compiler generates a system of recurrence equations derived from a given program whose efficiency one wishes to analyze. This generation is always possible, but the problem of solving the resulting equations may be complex. The second part of the paper presents an original method that generalizes the previous approach and is applicable to functional programs that make use of recursion and complex data structures. Several examples are presented, including an analysis of binary tree sort. A key feature of the analysis of such programs is that distributions on complex data structures are represented using attributed probabilistic grammars.
TID—a translation invariant data structure for storing images
Authors: Scott David S. , Iyengar S. Sitharama
Published: July 2002

There are a number of techniques for representing pictorial information, among them are borders, arrays, and skeletons. Quadtrees are often used to store black and white picture information. A variety of techniques have been suggested for improving quadtrees, including linear quadtrees, QMATs (quadtree medial axis transform), forests of quadtrees, etc. The major purpose of these improvements is to reduce the storage required without greatly increasing the processing costs. All of these methods suffer from the fact that the structure of the underlying quadtree can be very sensitive to the placement of the origin.

In this paper we discuss a translation invariant data structure (which we name TID) for storing and processing images based on the medial axis transform of the image that consists of all the maximal black squares contained in the image. We also discuss the performance of TID with other existing structures such as QMATs, forests of quadtrees, and normalized quadtrees. Some discussion on the union and intersection of images using TID is included.
A subset coloring algorithm and its applications to computer graphics
Authors: Rubinstein D. , Shallit J. , Szegedy M.
Published: July 2002

We consider the following problem: we are given a diagram made up of intersecting circles, where each region is colored either black or white. We wish to display this diagram on a bitmap device, where we are allowed to (i) paint a given circle white and (ii) invert the colors within a given circle, changing white to black and vice versa. (These operations are frequently provided in graphics hardware or software.) We ask: using only these paint and invert operations, is it possible to draw the diagram? A generalization of this problem leads to an analogous coloring problem on a subset of the power set of n elements. We give a polynomial-time algorithm that answers the question above, and produces a "short" sequence of instructions to draw the diagram, if one exists. A simple modification of the algorithm permits us to handle the case where there are more colors than just black and white, and the colors are represented by bit strings. This corresponds to the conventions frequently used with color raster devices.
Programmable execution of multi-layered networks for automatic speech recognition
Authors: Bengio Y. , Cardin R. , De Mori R. , Merlo E.
Published: July 2002

A set of Multi-Layered Networks allows the integration of information extracted with variable resolution in the time and frequency domains and to keep the number of links between nodes of the networks small for significant generalization during learning with a reasonable training set size.
Typographic style is more than cosmetic
Authors: Oman Paul W. , Cook Curtis R.
Published: July 2002

There is disagreement about the role and importance of typographic style (source code formatting and commenting) in program comprehension. Results from experiments and opinions in programming style books are mixed. This article presents principles of typographic style consistent and compatible with the results of program comprehension studies. Four experiments demonstrate that the typographic style principles embodied in the book format significantly aid program comprehension and reduce maintenance effort.
—Authors' Abstract
Solid representation and operation using extended octrees
Authors: Brunet Pere , Navazo Isabel
Published: July 2002

Solid modelers must be based on reliable and fast algorithms for Boolean operations. The octree model, as well as several generalizations (polytrees, integrated polytrees, extended octrees), is specially well suited for these algorithms and can be used either as a primary or as a secondary model in solid modeling systems. This paper is concerned with a precise definition of the extended octree model that allows the representation of nonmanifold objects with planar faces and, consequently, is closed under Boolean operations on polyhedrons. Boolean nodes and nearly vertex nodes are introduced, and the model is discussed in comparison with related representations. A fast algorithm for the direct generation of the extended octree from the geometry of the base polygon in extrusion solids is presented, and its complexity is studied. Boolean operation algorithms are introduced.
Implementation benefits of C++ language mechanisms
Authors: Jordan David
Published: July 2002

C + + was designed by Bjarne Stroustrup at AT&T Bell Laboratories in the early 1980s as an extension to the C language, providing data abstraction and object-oriented programming facilities. C + + provides a natural syntactic extension to C, incorporating the class construct from Simula. A design principle was to remain compatible and comparable with C in terms of syntax, performance and portability Another goal was to define an object-oriented language that significantly increased the amount of static type checking provided, with user-defined types (classes) and built-in types being part of a single unified type system obeying identical scope, allocation and naming rules. These aims have been achieved, providing some underlying reasons why C + + has become so prevalent in the industry. The approach has allowed a straightforward evolution from existing C-based applications to the new facilities offered by C + + , providing an easy transition for both software systems and programmers. The facilities described are based on Release 2.0 of the language, the version on which the ANSI and IS0 standardization of C + + is being based.
Inside RISKS: risks in medical electronics
Authors: Jacky Jonathan
Published: July 2002

The RISKS Forum has had many accounts of annoying errors, expensive breakdowns, privacy abuses, security breaches, and potential safety hazards. However, postings describing documented serious injuries or deaths that scan be unequivocally attributed to deficiencies in the design or implementation of computer-controlled systems are very rare. A tragic exception was a series of accidents which occurred between 1985 and 1987 involving a computer-controlled radiation therapy machine.
TRANSPOSABLE ELEMENT-HOST INTERACTIONS: Regulation of Insertion and Excision
Authors: Labrador Mariano , Corces Victor G.
Published: July 2002

▪ Abstract  Transposable elements propagate by inserting into new locations in the genomes of the hosts they inhabit. Their transposition might thus negatively affect the fitness of the host, suggesting the requirement for a tight control in the regulation of transposable element mobilization. The nature of this control depends on the structure of the transposable element. DNA elements encode a transposase that is necessary, and in most cases sufficient, for mobilization. In general, regulation of these elements depends on intrinsic factors with little direct input from the host. Retrotransposons require an RNA intermediate for transposition, and their frequency of mobilization is controlled at multiple steps by the host genome by regulating both their expression levels and their insertional specificity. As a result, a symbiotic relationship has developed between transposable elements and their host. Examples are now emerging showing that transposons can contribute significantly to the well being of the organisms they populate.
PULMONARY COMPLICATIONS OF HIV INFECTION
Authors: Murray, M. D John F.
Published: July 2002

▪ Abstract  Pulmonary disease is a major source of morbidity and mortality in HIV-infected persons. Pneumocystis carinii pneumonia has decreased substantially during the last eight years, but in the United States it remains the most common disorder that announces the onset of AIDS. In contrast, tuberculosis is by far the most important AIDS-associated indicator disease in developing countries. Community-acquired acute bacterial penumonia is a common HIV-linked complication throughout the world; pneumonia occurs at all levels of immune suppression but increases in frequency as CD4 counts decrease. Fungal infections mainly afflict persons who live or have lived in the various endemic areas. AIDS-related Kaposi's sarcoma and lymphoma generally do not involve the lungs until the malignancies are advanced. The increasing use of successful chemoprophylaxis against many important HIV-associated infections is increasing the incidence of other end-stage complications such as cytomegalovirus and disseminated MAC disease.
Bisphosphonates in the Treatment of Malignant Bone Disease
Authors: Berenson, MD James R. , Lipton, MD Allan
Published: July 2002

Tumor-induced osteolysis or lytic bone disease is mediated by osteoclast activation. Osteoclasts can be activated directly by products produced by tumors or indirectly through other nonmalignant cells. By reducing osteoclastic activity, bisphosphonates inhibit bone resorption. Since these agents were shown effective in treating other diseases associated with increased bone resorption, including cancer-related hypercalcemia and Paget's disease of bone, studies have been initiated to explore the use of bisphosphonates in patients with osteolytic bone metastases. Recent large randomized double-blind studies show the efficacy of these agents in reducing skeletal complications in patients with bone metastases from both breast cancer and multiple myeloma.
Diagnosis and Treatment of Venous Thromboembolism
Authors: Lee Agnes Y. Y. , Hirsh Jack
Published: July 2002

▪ Abstract  The diagnosis of deep vein thrombosis (DVT) and pulmonary embolism (PE) has been improved and simplified over the past decade thanks to advances in noninvasive and readily accessible technology. With high degrees of sensitivity and specificity, venous ultrasonography is favored as the initial investigation for DVT. To diagnose PE, most clinicians rely on diagnostic algorithms that combine clinical assessment, noninvasive lung studies, and, if necessary, venous ultrasonography of the legs and D-dimer testing. Substantial progress has also occurred in the treatment of acute venous thromboembolism with the introduction of low-molecular-weight heparins. This class of antithrombotic agents has changed initial therapy from an inpatient, intravenous regimen that required laborious monitoring to an outpatient practice using weight-adjusted doses of once-daily subcutaneous injections. In addition, several new anticoagulants with theoretical advantages over existing agents have entered phase III studies. Aspects of thrombosis treatment that remain controversial include vena caval interruption and the indications for thrombolysis and surgical thromboembolectomy.
ROLE OF BLOOD FLOW IN THE REGULATION OF MUSCLEGLUCOSE UPTAKE
Authors: Baron Alain D. , Clark Michael G.
Published: July 2002

▪ Abstract  Insulin vasodilates skeletal muscle vasculature via an endothelium-derived nitric oxide–dependent mechanism. Data suggests that insulin interacts directly with the endothelium to cause nitric oxide release. This insulin-mediated increase in muscle perfusion accounts for ∼30% of insulin's overall action to stimulate muscle glucose uptake, suggesting a role for insulin and glucose delivery as a determinant of insulin action. Hindlimb perfusion experiments, where perfusion rate is fixed, suggest that changes in distribution of microcirculatory perfusion can modulate substrate uptake. The potential role of insulin to enhance flow through capillary networks that are efficient at nutrient transfer to tissue (nutritive flow) relative to non-nutritive flow is discussed.
A Model for Multimodal Reference Resolution
Authors: Pineda Luis , Garza Gabriela
Published: July 2002

An important aspect of the interpretation of multimodal messages is the ability to identify when the same object in the world is the referent of symbols in different modalities. To understand the caption of a picture, for instance, one needs to identify the graphical symbols that are referred to by names and pronouns in the natural language text. One way to think of this problem is in terms of the notion of anaphora; however, unlike linguistic anaphoric inference, in which antecedents for pronouns are selected from a linguistic context, in the interpretation of the textual part of multimodal messages the antecedents are selected from a graphical context. Under this view, resolving multimodal references is like resolving anaphora across modalities. Another way to see the same problem is to look at pronouns in texts about drawings as deictic. In this second view, the context of interpretation of a natural language term is defined as a set of expressions of a graphical language with well-defined syntax and semantics. Natural language and graphical terms are thought of as standing in a relation of translation similar to the translation relation that holds between natural languages. In this paper a theory based on this second view is presented. In this theory, the relations between multimodal representation and spatial deixis, on the one hand, and multimodal reasoning and deictic inference, on the other, are discussed. An integrated model of anaphoric and deictic resolution in the context of the interpretation of multimodal discourse is also advanced.
The Effect of Learned Perceptual Associations on Visuomotor Programming Varies with Kinematic Demands
Authors: Haffenden Angela M. , Goodale Melvyn A.
Published: July 2002

The present set of experiments investigated the possibility that learned perceptual information can, under certain circumstances, be utilized by visuomotor programming. In Experiment 1 (N = 28), an association was established between the color and size of square wooden blocks (e.g., red = large; yellow = small, or vice-versa). In Experiment 2 (N = 28), an association was established between the shape and size of plastic objects (e.g., hexagon = large; circle = small, or vice-versa). It was expected that the learned associations would change the perceived size of two probe objects halfway in size between the large and small objects (the probe object matched by color or shape to the large group of objects would appear smaller than the probe object matched to the small group of objects as a result of within-group relative size comparisons). In both experiments, half of the participants grasped the target objects, and the other half estimated the size of the objects by opening their thumb and finger a matching amount. For Experiment 1, it was predicted that an influence of the lérned association on the treatment of the probe objects would be seen in manual estimations and in grip scaling because the kinematics of the grasping movement were very similar across trials. As predicted, the learned association between size and color was as easily incorporated into visually guided grasping as it was into visual perceptions. In Experiment 2, it was predicted that an influence of the learned perceptual association would be seen only in manual estimations, and not in grip scaling, because the variability in target object shape from trial to trial would demand changes in precontact finger posture across trials. Despite the significant effect of the size-shape association on size estimations, no influence was seen in preparatory grip scaling, probably because varying shape increased the metrical demands on visuomotor programming from those in Experiment 1. Together, the results suggest that visuomotor programming can make use of learned size information under some, but not all, conditions.
On a Class of Support Vector Kernels Based on Frames in Function Hilbert Spaces
Authors: Gao J. B. , Harris C. J. , Gunn S. R.
Published: July 2002

There has been an increasing interest in kernel-based techniques, such as support vector techniques, regularization networks, and gaussian processes. There are inner relationships among those techniques, with the kernel function playing a central role. This article discusses a new class of kernel functions derived from the so-called frames in a function Hilbert space.