bluuebunny/crossref_metadata_2025 huggingface dataset:
KDD/MDM 2006
Authors: Zhang Zhongfei , Masseglia Florent , Jain Ramesh , Bimbo Alberto Del
Published: April 2007

This is a report of the 7
th
ACM KDD/MDM Workshop on Multimedia Data Mining held in Philadelphia, PA, USA, on 20 August 2006. This report outlines the motivations to hold the workshop, the response we have received in terms of paper submissions and participations, as well as the post-workshop events. The central theme of this year's MDM workshop is to merge multimedia and data mining research together to exploit the synergy between the two areas to advance and promote the research and development in multimedia data mining. The workshop was extremely successful. The feedback we have received during and after the workshop was overwhelmingly positive, which indicates the emerging interest and enthusiasm on the topic of multimedia data mining in the related research communities. Due to this fact, we plan to continue this series next year.
Invitation to data reduction and problem kernelization
Authors: Guo Jiong , Niedermeier Rolf
Published: April 2007

To solve NP-hard problems, polynomial-time preprocessing is a natural and promising approach. Preprocessing is based on data reduction techniques that take a problem's input instance and try to perform a reduction to a smaller, equivalent problem kernel. Problem kernelization is a methodology that is rooted in parameterized computational complexity. In this brief survey, we present data reduction and problem kernelization as a promising research field for algorithm and complexity theory.
Notation as a tool of thought
Authors: Iverson Kenneth E.
Published: April 2007

The importance of nomenclature, notation, and language as tools of thought has long been recognized. In chemistry and in botany, for example, the establishment of systems of nomenclature by Lavoisier and Linnaeus did much to stimulate and to channel later investigation. Concerning language, George Boole in his
Laws of Thought
[1, p.21] asserted "That language is an instrument of human reason, and not merely a medium for the expression of thought, is a truth generally admitted.
A dictionary of APL
Authors: Iverson Kenneth E.
Published: April 2007

APL is a formal, imperative language. Because it is imperative, a sentence may be called an instruction, and may be executed to produce a result. In illustrations used here, an instruction will be indented, and the result of its execution will be shown on the following line without indentation.
FAQs and figures
Authors: Notkin David
Published: April 2007

As I await questions from the community about ACM TOSEM (see my last column), let me bring you up to date on a few things. Any of you that have been authors or reviewers for TOSEM in the past few years have had to tussle with the manuscript processing system that ACM uses -- Manuscript Central. ScholarOne, the company that developed Manuscript Central, was acquired relatively recently by Thompson Scientific. The software is used by several thousand journals worldwide, covering many different scholarly disciplines. Professional societies, government agencies and commercial publishers use Manuscript Central.
Structuring complex requirements
Authors: Diev Sergey
Published: April 2007

Sets of requirements that analysts are dealing with are often big and complex. That makes requirements structuring one of the most important activities in requirements engineering, because of how requirements are structured and presented directly impacts the requirements development process and the quality of requirements.

In this methodological paper we argue that a requirements analyst has to build a
requirements architecture
that fits the properties of the problem. In particular, the requirements analyst should create a clear vision of the principles governing how requirements are being defined, built and presented.

We review some of the instruments that an analyst can use to structure requirements: requirements sets, views, levels and links. Among static views we emphasize
concepts view
, and also consider functions view, application architecture view, and other views; among dynamic views we consider use cases view, operational scenarios view, events view, and others. We specifically notice the importance of
individual requirements sets
, the purpose of which is to reveal the requirements for a particular element (concept, function, action, etc.). We argue in favor of differentiating between requirements model and requirements representation. We demonstrate on examples how requirements architecture is needed in complex contexts.
CBS testing requirements and test case process documentation revisited
Authors: Gill Nasib S. , Tomar Pradeep
Published: April 2007

Component-based software testing is an important capability that supports productivity and quality assurance in component-based software development. The increased size and complexity of software systems has led to the current focus on developing distributed applications that are constructed primarily using components. Thus, the component-based systems require efficient and effective ways to test these systems and need to develop effective techniques for testing various aspects of the components such as reusability, security, dependability and safety. Study on the subject by several researchers indicates that more than fifty percent of the cost of software development is devoted to testing and it results into very high cost for testing complex software. The present paper is aimed at improving component-based system testing while considering two factors: component-based system testing requirement and test case process documentation. Lastly, the paper also discusses the limitations of component-based software testing that hinders component-based development.
Why software engineering programs should teach agile software development
Authors: Hazzan Orit , Dubinsky Yael
Published: April 2007

In this paper we propose ten reasons why it is important, suitable and timely to introduce agile software development into software engineering programs in the academia. These reasons address technical, social and cognitive issues.
Integration of statechart and B method based analysis and verification for flight control software of unmanned aerial vehicle
Authors: Jiufu Liu
Published: April 2007

B is a formal method which enables the automatic generation of an executable code through successive refinements from an abstract specification. Unified Modeling Language (UML) specifications can be formally verified by analyzing the corresponding B specification, and integration of UML specifications and B method can overcomes the drawbacks of UML. In this paper Statemate, one tool supporting the virtual prototype technology, is used, and the flight control software behaviors are presented in the form of statecharts The B method is adopted to translate the statecharts into B specification of flight control software.
Book review: USING 1-2-3 RELEASE 3.1 by Rebecca Altman, et. al. (Que Corporation, 1990)
Authors: Jones Larry
Published: April 2007

This book is typical of the
USING
series of books produced by Que Corporation. As such, it attempts to meet the needs of all users, "new spreadsheet users, and users who have upgraded to Release 3.1." Unfortunately, spreadsheet programs are becoming so complex that it is difficult for any book to satisfy such a diverse audience. Therefore, someone tends to suffer and, in this case, it's the new user.
Book review: Computer User's Dictionary by Bryan Pfaffenberger (Que Corporation, 1990)
Authors: Bruce Walter R. , Stanley Timothy S.
Published: April 2007

What does bad page break, firmware, postprocessor, read-only attribute, and Wingz have in common? They are all words found in the 488 pages of the Computer User's Dictionary.
A naming system for feature-based service specification in distributed operating systems
Authors: Ravindran K. , Ramakrishnan K. K.
Published: April 2007

The paper describes a naming system that allows a service to evolve or reconfigure in functionality by adding and removing features and still co-exist with its previous versions. The underlying naming model has two aspects: (1)
(Attribute_name, Attribute_value)
pair based characterization of service features which allows the meta information on a service to be represented as a collection of such pairs (as in X.500 and Universal Naming Protocol). At low level, the name server provides parse and match operations on the (attribute, value) pairs using which high level name binding operations, viz., name registration and name resolution, are constructed. (2)
Data-driven communication paradigm
which enables different versions of a client and server to communicate with one another. In this paradigm, a server matches the attributes requested by a client with those it supports, and invokes service specific functions named by the attributes. Since attributes refer to orthogonal features, client and server can evolve independently by adding or removing attributes and still communicate. With this model of specifying services, name server functions may be factorized from service specific functions and implemented in a generic fashion in terms of parse and match operations and function invocations. The paper also describes language support for the naming system and implementation issues.
A library for discrete event simulations
Authors: Pollatschek M. A.
Published: April 2007

Discrete event simulation models development of processes evolving in time such as inventory or service stations, where change in the state (inventory level or number of waiting customers) are caused by events occurring at discrete points of time, such as the arrival of a new customer. The model is a program which imitates the process and collects statistics from which conclusions can be drawn. For example, what is the impact of a given policy on inventory level or of priority rules on queue size? Dedicated languages have been developed for writing simulation programs such as GPSS, Simscript, SLAM, SIMAN. However, it is possible to extend ordinary C (and of course C++) by an appropriate library providing nearly all the services that dedicated languages offer. In the following we give a short tutorial on simulation using a simple problem, coding it in C and calling functions from the library to demonstrate that the library approach is a respectful alternative to dedicated languages. We also discuss shortly how to fit the C library to various environments and review two real life problems where the library was successfully used. (Similar libraries are available for compiled BASIC, Pascal and FORTRAN, all for a PC.)
When floating-point addition isn't commutative
Authors: Ris Fred , Barkmeyer Ed , Schaffert Craig , Farkas Peter
Published: April 2007

In this note, the symbols "+", "x", and "=" have their mathematical meanings; the symbols "⊕", "⊗", and "→" denote floating-point addition, multiplication and assignment respectively. Informally, T → A ⊕ B implies T = round (A+B), T → A ⊗ B implies T = round (AB), and T → AB ⊕ C implies T = round (AxB + C).
Mixed language programming realization and the provision of data types
Authors: Einarsson Bo
Published: April 2007

The importance of mixed language programming, and some of the associated problems, are summarized. The paper presents a structured view on the major ways to realize mixed language programming and how to provide the necessary data types.
A comment on the Eispack machine epsilon routine
Authors: Hopkins Tim , Slater John
Published: April 2007

We analyze the algorithm used to generate the value for the machine epsilon in the Eispack suite of routines and show that it can fail on a binary floating-point system. The comments in the code describing the conditions under which this method will work are not restrictive enough and we provide a replacement set of assumptions. We conclude by suggesting how the algorithm may be modified to overcome most of the shortcomings.
How to stabilize a fixed point
Authors: Briggs Keith
Published: April 2007

While reading the thesis on 'Renormalization in area preserving maps' by Robert Mackay (Princeton 1982), I noticed an intriguing method proposed for computing an unstable fixed point of a nonlinear operator, in the case where we know approximately the eigenvalue of the linearized operator. Mackay attributed this method to his advisor Martin Kruskal. Although simple and practical, I had not seen this idea before, and since an error in the thesis makes it unnecessarily difficult to follow, I thought this presentation would be of interest. All credit is due to Mackay and Kruskal.
What causes a trap in IEEE-754 floating-point?
Authors: Tydeman Fred
Published: April 2007

In the ANSI/IEEE Std 754-1985 (IEEE Standard for Binary Floating-point Arithmetic), and the ANSI/IEEE Std 854-1987 (IEEE Standard for Radix-Independent Floating-Point Arithmetic), is signaling a trap an "edge-triggered" or a "level-sensitive" event? Does it matter if an exception is signaled by an arithmetic operation versus a user setting a status flag?
Determination of parameter relations within non-linear models
Authors: Whiten W. J.
Published: April 2007

Unknown parameter relations within a non-linear model can be investigated by linearising and the creation of an artificial zero point from which the parameter relation can be constructed using linear regression techniques.
Achieving a full deck
Authors: Hodge H. K.
Published: April 2007

While in the process of computing poker odds, the following question occurred to me: given a random number generator that returns answers from one to 52, how many calls on average need to be made before at least one of each number is found?
When is double rounding innocuous?
Authors: Figueroa Samuel A.
Published: April 2007

Double rounding is the phenomenon that occurs when the result of an operation is rounded to fit some intermediate destination, and then again when delivered to its final destination. This can be a common occurrence when using some floating-point arithmetic engines which lack single precision registers: results of operations are typically rounded to fit in a register, whose width may be double precision or wider, before being stored in some memory location possibly in a format narrower than that of the registers. Examples of such floating-point arithmetic engines include Intel's x87 series and IBM's POWER architecture. (Implementations of the latter are found in some IBM workstations.)
Note on local methods of univariate interpolation
Authors: Akima Hiroshi
Published: April 2007

Five local methods or algorithms of univariate interpolation are mutually compared both numerically and graphically. They are Ackland's osculatory method (
J. Inst. Actuar. 49
, 369-375, 1915), Algorithm 433 (
Commun. ACM 15
, 914-918, 1972), Maude's method (
Computer J. 16
, 64-65, 1973), Algorithm 514 (
ACM TOMS 3
, 175-178, 1977), and Algorithm 697 (
ACM TOMS 17
, 367, 1991). The comparison results indicate that Algorithm 697 is the best among these five methods.
Remark on “An example of error propagation reinterpreted as subtractive cancellation” by J. A. Delaney (SIGNUM Newsletter 1/96)
Authors: Drygalla V.
Published: April 2007

The author proposes the reformulation of an algorithm which is discussed in Vandergraft's textbook as an example of an unstable method.
Computationally complicated problems of numerical computations (in particular, interval computations), biofeedback, computer games, and Gulf War
Authors: Koshelev Misha
Published: April 2007

Many problems of numerical computations are computationally
intractable
(or, to use a precise term from theoretical computer science,
NP-hard
; for precise definitions, see, e.g., [2]). From a practical viewpoint, this means that no
feasible
algorithm can solve all instances of such problems.
“Interval rational = algebraic” revisited
Authors: Lakeyev Anatoly V. , Kreinovich Vladik
Published: April 2007

In [1], it is shown that if we add "interval computations" operation to the list of arithmetic operations that define rational functions, then the resulting class of "interval-rational" functions practically coincides with the class of all algebraic functions. By "practically coincides", we mean that first, every interval-rational function is algebraic, and that second, for every algebraic function A(x), there exists an interval-rational function that coincides with A(x) for almost all x. In [1], "almost all" was understood in terms of Lebesgue measure; this result is therefore, not very computer realistic, because all the numbers representable in a computer are rational and therefore, form a set of Lebesgue measure 0. In this article, we formulate a more computer-realistic version of the result that interval + rational = algebraic.
Astrogeometry, error estimation, and other applications of set-valued analysis
Authors: Finkelstein Andrei , Kosheleva Olga , Kreinovich Vladik
Published: April 2007

In many real-life application problems, we are interested in
numbers
, namely, in the numerical values of the physical quantities. There are, however, at least two classes of problems, in which we are actually interested in
sets
:• In
image processing
(e.g., in
astronomy)
, the desired black-and-white image is, from the mathematical viewpoint, a
set.
• In
error estimation
(e.g., in engineering, physics, geophysics, social sciences, etc.), in addition to the estimates x
1
, ....,

x
n

for
n
physical quantities, we want to know what can the
actual
values

x
i

of these quantities be, i.e., the
set
of all possible vectors
x
= (
x
,
1
, ....,

x
n

).In both cases, we need to process sets. To define a generic set, we need infinitely many parameters; therefore, if we want to represent and process sets in the computer, we must restrict ourselves to finite-parametric families of sets that will be used to approximate the desired sets. The wrong choice of a family can lead to longer computations and worse approximation. Hence, it is desirable to find the family that it is
the best
in some reasonable sense.A similar problem occurs for
random sets.
To define a generic set, we need
infinitely many
parameters; as a result, traditional (finite-parametric) statistical methods are often not easily applicable to random sets. To avoid this difficulty, several researchers (including U. Grenander) have suggested to approximate arbitrary sets by sets from a certain
finite-parametric
family. As soon as we fix this family, we can use methods of traditional statistics. Here, a similar problem appears: a wrong choice of an approximation family can lead to a bad approximation and/or long computations; so, which family should we choose?In this paper, we show, on several application examples, how the problems of choosing the optimal family of sets can be formalized and solved. As a result of the described general methodology:•for
astronomical images
, we get exactly the geometric shapes that have been empirically used by astronomers and astrophysicists (thus, we have a theoretical explanation for these shapes), and• for
error estimation
, we get a theoretical explanation of why
ellipsoids
turn out to be experimentally the best shapes (and also, why ellipsoids are used in Khachiyan's and Karmarkar's algorithms for linear programming).
With what accuracy can we measure masses if we have an (approximately known) mass standard
Authors: Kreinovich Vladik
Published: April 2007

To measure masses with high accuracy, we need a mass standard. To make a standard work, we must have a procedure that will enable us to compare a mass of a physical body with the mass of a standard. This procedure has an error (as any other measurement procedure).To measure arbitrary masses (that are not necessarily equal to the mass of the standard), we must use an indirect measuring procedure. What potential accuracy can we attain in such a procedure? In this paper, we give an answer to this question.
Automatic differentiation in prose
Authors: Pfeiffer F W
Published: April 2007

Much of the popular numerical software for solving nonlinear equations and nonlinear optimization problems require arrays of partial derivatives. Computing these derivatives efficiently and accurately has been an obstacle since the time of Newton. A little-known approach to computing derivatives, however, has made this obstacle disappear for users of one programming language. This short article presents an overview of the approach and its implementation in the language.
Implementing an elementary function library
Authors: Thompson Peter
Published: April 2007

This paper describes the author's experience of implementing a comprehensive library of elementary functions in the INMOS proprietry language occam, to support scientific and engineering applications of transputers.
Using Gaussian elimination for computation of the central difference equation coefficients
Authors: Cynar Sandra J
Published: April 2007

The Gaussian elimination method has been widely used for solutions of sets of linear equations for a very long time. This paper describes another use for the Gaussian elimination techniques. An algorithm will be developed for computing the coefficients for the central difference expressions approximating the first or second derivative of any order error by expressing the problem in matrix notation and applying Gaussian techniques for the solution.
Communications standards review
Authors: Schonbach Avi
Published: April 2007

This is the first in a series of reports which will survey activities in the area of communications standards. The increasingly strong influence of such standards on the computer industry is plainly manifested in the move from central to distributed computing. The main relevance of communications to small systems lies in the fact that they are necessary to both distributed processing and resource sharing. Small systems have limited resources locally; in an interlinked environment jobs which are too large for the local resources can be submitted for execution on other systems. As well, special servers can be shared by a large number of users, thereby reducing overall cost. Communications provide the user of a small system with access to remote information systems, and with support of networked interest groups through applications such as electronic mail and bulletin board.
An algorithm for fast polynomial approximation
Authors: Gatterdam Ronald W
Published: April 2007

An algorithm is presented for the computation of the coefficients of least square fitting polynomials. The algorithm is such that multiplication is not required with respect to the data points. Since the only multiplication required is by system constants, and that only for the final computation, this algorithm is suitable for real time computation on small microprocessors. Explicit coefficients are given for the quadratic case.
How to rate numerical packages? Foundations of ratings, and their possible use in numerical mathematics, in education, and in military design
Authors: Ramírez Raúl Antonio Trejo , Kreinovich Vladik
Published: April 2007

One of the major human activities is solving problems. It is desirable to be able to predict whether a problem will be solved or not or, more precisely, the probability that a person can solve a problem. This probability can be estimated based on previous experience of people solving similar problems.Then, it is necessary to somehow describe the ability of the problem-solvers as well as the difficulty of the problems. This can be done by assigning to each problem or problem solver a
rating
, i.e., a number that represents the skill of the problem solver or the difficulty of the problem.In this paper, we propose to use a rating system developed in sports to other real-life problems, including rating of numerical packages.
Intelligent control in space exploration
Authors: Nguyen Hung T. , Kreinovich Vladik
Published: April 2007

This paper is a short overview of our NASA-supported research into the necessity of using interval-based intelligent control techniques for space exploration. This is a reasonably new application area for interval computations, and we hope that the overviewed results and problems will be of some interest to the numerical computations community.This paper is a short version of our detailed report presented to NASA.
Some suggestions on the implementation of reliable simulations
Authors: Chiang Yi-Ling F.
Published: April 2007

We studied Several simulation programming codes. Based on our findings, the following suggestions may be necessary in the development of reliable simulation packages: 1) avoid global storage assignment in coding; 2) construct modular programming structure in implementation; 3) employ simple schemes in computation; 4) do not introduce pseudo-physical term in modeling; 5) engage reasonable time interval in run; and 6) establish solution verification in use.
Symmetry and nonconvergence in iterative polynomial zero-finding
Authors: Chen Tien Chi
Published: April 2007

It is well known that, in Newton's method, a real guess cannot converge to a complex zero of a real polynomial. Actually for the class of RR-weighted methods including those of Newton and Halley, a guess lying on a reflective symmetry axis of the zeros produces only iterates on the same axis; multiple symmetry axes intersect at the centroid
C
; a nearby guess gives approximations to either
C
or ∞. Irrational Newton-like method fare much better, but local symmetry can still lead to rebounding, calling for special detection and recovery algorithms.
Energy from space
Authors: Koshelev Misha , Starks Scott
Published: April 2007

The sun is a practically limitless source of energy. In some areas, solar cells enable us to use this source. In many places on Earth, however, clouds prevent us from tapping into solar energy. To use this energy, researchers have proposed placing solar cells on a satellite and beaming the collected energy down to the Earth.The problem with this solution is that the resulting high-energy beam is highly dangerous. Instead of using a single beam, we propose to use several beams from different satellites; this configuration will enable us to beam the energy to practically any location on Earth without endangering other locations. Since errors can be extremely dangerous, we need verified computations (i.e., interval computations) to compute the parameters of the beams. Thus, interval computations are useful for transmitting energy from space.
A proposal for a set of level 3 basic linear algebra subprograms
Authors: Dongarra Jack , Du Croz Jeremy , Duff Iain , Hammarling Sven
Published: April 2007

This paper describes a proposal for Level 3 Basic Linear Algebra Subprograms (Level 3 BLAS). The Level 3 BLAS are targeted at matrix-matrix operations with the aim of providing more efficient, but portable, implementations of algorithms on high-performance computers, especially those with hierarchical memory and parallel processing capability.
A nonlinear Runge-Kutta formula for initial value problems
Authors: Evans D. J. , Sanugi B. B.
Published: April 2007

New non-linear Runge-Kutta methods for solving initial value problems are shown to be obtained by the strategic use of geometric mean (GM) rather than arithmetic mean averaging of the functional values in the standard integration formula.
A shell for modern personal computers
Authors: Meyer Mike
Published: April 2007

Over the last five years, the average personal computer has changed radically in both power and typical peripherals. The command interpreters on these machines have not changed to reflect this. The following paper describes a command interpreter designed for a modern personal computer, with a high speed 16/32 bit processor, a megabyte or more of memory, a medium resolution bitmapped display, and a pointing device.
Indentation styles in C
Authors: Hansen John C. , Yim Roger
Published: April 2007

Hansen and Sands [1985] compare two different styles of indentation shown in Figure 1.
A comparison of the ISO working draft standard for SQL and a commercial implementation of SQL
Authors: Ferrante Louis
Published: April 2007

Our is one of many organizations which have adopted the SQL language for use with their database systems. Since portability is a major requirement in our work, we must know how the emerging ISO working draft standard for SQL and the implementation of SQL in INGRES 4.0, the DBMS we have selected, differ. In particular, we must learn which features in INGRES are not part of the standard, and which features of the ISO standard have not been implemented in INGRES.This report is a comparison between the ISO working draft standard for the SQL2 database language (ISO TC97/SC21 N1479) and INGRES (release 4.0) SQL. The comparison is not a complete and detailed list of the differences between INGRES SQL and the working draft standard. Rather it attempts to highlight the major differences between the two.
A synthesis algorithm for a class of 4NF
Authors: Unger E. A. , Angaye Cleopas O.
Published: April 2007

In order to ensure a better logical data base design that captures the semantics of the enterprise application, two basic approaches, decomposition and synthesis, are employed. The synthesis approach provides a schema that envelops all the given dependencies, though currently applicable to only functional dependencies and only for 3NF. However, the decomposition approach may produce data base schema in BCNF without satisfying the dependency preserving property [BEE79]. Ling et al. [LIN81] have discussed the existence of an objectionable form of attribute redundancy denoted superfluous attributes in schemas formed by decomposition and synthesis algorithms. A new synthesis algorithm, denoted Algorithm 2 [ANG83], eliminates such superfluous attributes from synthesized data base schema.In this paper, definitions for separable entities based only upon the dependency set under consideration are given. Algorithm 2 [ANG83] is shown to produce a data base schema which is in BCNF if the dependency set consists only of functional dependencies and the entities are separable. Further, a synthesis algorithm to normalize a relational schema involving only multivalued dependencies into a 4NF data base schema is proposed. The inclusion of multivalued dependencies in the synthesis algorithm permits wider units of information representation in the modeling of enterprise application. This algorithm will produce a 4NF schema if the dependency set consists only of multivalued dependencies which are not also functional dependencies and the entities are separable.
Assembling a low-cost parallel microcomputer system for student experimentation
Authors: Diersing Robert J.
Published: April 2007

This paper presents an overview of a project wherein an MIMD parallel microcomputer system is being assembled primarily from available hardware and software system components. The basic system is a Z-80A S-100 bus microcomputer system to which processing elements originally intended to be intelligent input/output processors have been added along with a shared memory unit. The system was originally a message-passing system but later became a hybrid system with the addition of the shared memory.System software has been written to allow the host program to control the execution of programs in the processing elements. Support has been provided for PL/I-80 language supplied by Digital Research of California and the Z-80 C compiler supplied by Cromemco Incorporated.The motivation for construction of the system is to provide a small-scale parallel microcomputer system for student experimentation for the least possible cost. The system is currently being expanded to include four processing elements in addition to the host.
Design requirements of a single-user operating system
Authors: Ranai K.
Published: April 2007

This paper describes the design requirements of a single-user operating system which could be easily be implemented and used on various personal computers. The main emphasis of the design is its robustness and its 'openness' in the sense that no sharp boundary exist between the operating system and the user's program.
MICRODOS
Authors: Ranai K.
Published: April 2007

This paper describes an experimental implementation of a single-user operating system called MICRODOS. It has adopted a layered software system model (hierarchical nature) and is written almost entirely in the high level language BCPL. The main feature of MICRODOS is that it has avoided or simplified many of the major problems that are normally associated with large multi access operating systems.
An office specification language based on path expressions
Authors: Ronzani S. , Tisato F. , Zicari R.
Published: April 2007

I enclose a paper by Drs. Ronzani, Tisato, and Zicari of Milan. It was accepted for presentation at the recent SIGSMALL conference; unfortunately, we were unable to include it in the Proceedings. I would greatly appreciate it if you could publish this paper in the earliest convenient issue of the SIGSMALL Newsletter.
Some notes on converting programs from mainframes to the IBM-PC using MS-FORTRAN 3.30 — there is good news and bad news
Authors: Sawey Ronald M.
Published: April 2007

The good news is that the new linker that comes with the latest version of MS-FORTRAN can given significantly smaller executable files than the previous linkers. The bad news is that if you have encountered stack overflows with earlier versions of MS-FORTRAN, you can expect a lot more of them with this latest version. The bottom line is, if you buy the latest version of MS-FORTRAN (3.30 compiler and 3.02 linker) make
certain
that you have "downgrade rights" to the earlier version (3.20 compiler and 2.14 linker).
PC/370 virtual machine
Authors: Higgins Donald S.
Published: April 2007

PC/370 Virtual Machine is a software package containing an IBM 370 cross assembler, linkage editor, and 370 emulator for use by students and programmers on any MS-DOS compatible PC such as the IBM PC, XT, or AT with 128K of memory. The software was originally developed in 1981 for CP/M-80 Z80 systems with 64K. (1) The cross assembler translates standard IBM 370 assembler into 370 relocatable object code. The linkage editor combines multiple 370 relocatable object modules into an executable load module file which dynamically loads the emulator at execution time. The emulator executes the standard 370 instruction set plus the packed decimal instruction set. In addition, the emulator supports extended architecture instructions, random and sequential file I/O, interactive debug, plus the extended instructions defined in ASSIST. (2) In 1985, the package was converted from Z80 macro assembler to 8086 macro assembler. This paper describes the conversion process and gives some benchmark data comparing performance of the original Z80 version and the 8086 version.
Nimbus logo
Authors: Johnson Ken
Published: April 2007

Edinburgh University has been using Logo for about twelve years. This Institute recently designed a highly innovative Logo for use on the Nimbus computer in British schools. This paper describes the Nimbus briefly and sets out the features of the new version, drawing particular attention to parallel processing, data files, array operations, the ease with which you can add machine code extensions and a number of novel infix operators.
Screen editor and emulator
Authors: Higgins Donald S.
Published: April 2007

Screen Editor and Emulator (SEE) is a freeware program for editing ASCII text files on any IBM compatible MS-DOS microcomputer with 128K of memory. SEE supports full screen color display and editing of ASCII text files up to 512K. The keyboard controls are designed to be compatible with popular editors and word processors including PFS:Write, Wordstar, and the Turbo Pascal editor. What is unique about SEE is that it is written in IBM 370 assembly language and is distributed in source program format. The source code can be modified to add, change, or delete keyboard commands to suit individual preferences. Using the freeware PC/370 assembler, SEE can be assembled in less than 60 seconds on a standard IBM PC (see references).
Provably monotone approximations, ROMANNUMERAL 3
Authors: Dunham Charles B.
Published: April 2007

Familiar forms which may be theoretically monotone may not be evaluated monotonically even with monotone arithmetic.
Words
Authors: Hodge H. K.
Published: April 2007

I have expanded my data processing horizons. I have written a word processor program.
Sparsity structure and Gaussian elimination
Authors: Duff I. S. , Erisman A. M. , Gear C. W. , Reid J. K.
Published: April 2007

In this paper we collate and discuss some results on the sparsity structure of a matrix. If a matrix is irreducible, Gaussian elimination yields an LU factorization in which L has at least one entry beneath the diagonal in every column except the last and U has at least one entry to the right of the diagonal in every row except the last. If this factorization is used to solve the equation
Ax=b
, the intermediate vector has an entry in its last component and the solution x is full. Furthermore, the inverse of
A
is full.Where the matrix is reducible, these results are applicable to the diagonal blocks of its block triangular form.
Approximation with exact Lagrange-type interpolation
Authors: Dunham C. , Zhu Z.
Published: April 2007

Under stated favorable conditions, the Lagrange formula for polynomial interpolation is computationally
exact
at the nodes. This is applied to approximation with Lagrange-type interpolation.
THE DANGERS OF TAKING THINGS TOO SERIOUSLY
Authors: Hedge H. K.
Published: April 2007

An irresistable challenge for someone like myself who likes to dabble in physics.
Solving equations nonlinear in only one of
N
+ 1 variables
Authors: Dunham Charles B. , Zhu C. Z.
Published: April 2007

Equations linear in
n
out of
n
+ 1 variables can be solved by reduction to a linear subproblem and variation of the nonlinear parameter.
Improvement of complex arithmetic by use of double elements
Authors: Dunham C. B.
Published: April 2007

It is shown that use of double precision in complex multiplication and division can significantly reduce rounding errors in these operations. Use of double precision accumulation of inner products in complex multiplication gives very close to the best possible error bound. Use of the same in complex division reduces error bounds, but a double precision divide is necessary to get close to the best possible bound.
Glucose supplements increase human muscle in vitro Na+-K+-ATPase activity during prolonged exercise
Authors: Green H. J. , Duhamel T. A. , Foley K. P. , Ouyang J. , Smith I. C. , Stewart R. D.
Published: April 2007

Regulation of maximal Na+-K+-ATPase activity in vastus lateralis muscle was investigated in response to prolonged exercise with (G) and without (NG) oral glucose supplements. Fifteen untrained volunteers (14 males and 1 female) with a peak aerobic power (V̇o2peak) of 44.8 ± 1.9 ml·kg−1·min−1; mean ± SE cycled at ∼57% V̇o2peakto fatigue during both NG (artificial sweeteners) and G (6.13 ± 0.09% glucose) in randomized order. Consumption of beverage began at 30 min and continued every 15 min until fatigue. Time to fatigue was increased ( P < 0.05) in G compared with NG (137 ± 7 vs. 115 ± 6 min). Maximal Na+-K+-ATPase activity (Vmax) as measured by the 3- O-methylfluorescein phosphatase assay (nmol·mg−1·h−1) was not different between conditions prior to exercise (85.2 ± 3.3 or 86.0 ± 3.9), at 30 min (91.4 ± 4.7 vs. 91.9 ± 4.1) and at fatigue (92.8 ± 4.3 vs. 100 ± 5.0) but was higher ( P < 0.05) in G at 90 min (86.7 ± 4.2 vs. 109 ± 4.1). Na+-K+-ATPase content (βmax) measured by the vanadate facilitated [3H]ouabain-binding technique (pmol/g wet wt) although elevated ( P < 0.05) by exercise (0<30, 90, and fatigue) was not different between NG and G. At 60 and 90 min of exercise, blood glucose was higher ( P < 0.05) in G compared with NG. The G condition also resulted in higher ( P < 0.05) serum insulin at similar time points to glucose and lower ( P < 0.05) plasma epinephrine and norepinephrine at 90 min of exercise and at fatigue. These results suggest that G results in an increase in Vmaxby mechanisms that are unclear.
AMP does not induce torpor
Authors: Swoap Steven J. , Rathvon Meaghan , Gutilla Margaret
Published: April 2007

Torpor, a state characterized by a well-orchestrated reduction of metabolic rate and body temperature (Tb), is employed for energetic savings by organisms throughout the animal kingdom. The nucleotide AMP has recently been purported to be a primary regulator of torpor in mice, as circulating AMP is elevated in the fasted state, and administration of AMP causes severe hypothermia. However, we have found that the characteristics and parameters of the hypothermia induced by AMP were dissimilar to those of fasting-induced torpor bouts in mice. Although administration of AMP induced hypothermia (minimum Tb= 25.2 ± 0.6°C) similar to the depth of fasting-induced torpor (24.9 ± 1.5°C), ADP and ATP were equally effective in lowering Tb(minimum Tb: 24.8 ± 0.9°C and 24.0 ± 0.5°C, respectively). The maximum rate of Tbfall into hypothermia was significantly faster with injection of adenine nucleotides (AMP: −0.24 ± 0.03; ADP: −0.24 ± 0.02; ATP: −0.25 ± 0.03°C/min) than during fasting-induced torpor (−0.13 ± 0.02°C/min). Heart rate decreased from 755 ± 15 to 268 ± 17 beats per minute (bpm) within 1 min of AMP administration, unlike that observed during torpor (from 646 ± 21 to 294 ± 19 bpm over 35 min). Finally, the hypothermic effect of AMP was blunted with preadministration of an adenosine receptor blocker, suggesting that AMP action on Tbis mediated via the adenosine receptor. These data suggest that injection of adenine nucleotides into mice induces a reversible hypothermic state that is unrelated to fasting-induced torpor.
Compromised renal microvascular reactivity of angiotensin type 1 double null mice
Authors: Park Sungmi , Bivona Benjamin J. , Harrison-Bernard Lisa M.
Published: April 2007

Angiotensin type 1A (AT1A) and 1B (AT1B) receptor deletion (AT1DKO) results in renal microvascular disease, tubulointerstitial injury, and reduced blood pressure. To test the hypothesis that renal preglomerular responses to angiotensin (ANG) II are mediated by AT1Aand AT1Breceptors, experiments were performed in AT1DKO mice using the in vitro blood perfused juxtamedullary nephron technique. Kidneys were harvested from AT1DKO and wild-type (WT) mice and bathed with ANG II (1–100 nM), norepinephrine (NE; 100–1,000 nM), or acetylcholine (ACh; 10 μM). Baseline diameters of afferent (19.5 ± 0.7 and 13.9 ± 0.7 μm, n = 17 and 16) and efferent (15.5 ± 2.1 and 10.8 ± 1.0 μm, n = 4 and 7) arterioles of AT1DKO were significantly larger than WT. Afferent and efferent arteriolar responses to ANG II, 100, and 300 nM NE were absent in AT1DKO; although significant constriction to 1 μM NE was observed (−17 ± 5 and −23 ± 6%, respectively). Afferent arterioles of WT mice dilated significantly in response to ACh (15.1 ± 0.6 to 17.0 ± 1.2 μm, n = 6); however, arterioles from AT1DKO tended to contract (19.9 ± 1.2 to 17.8 ± 1.6 μm; n = 6, P = 0.06). In summary, loss of ANG II-induced contraction, reduced vasoconstriction to NE, and endothelial cell dysfunction contribute to the renal vascular phenotype of AT1DKO mice. We conclude that ANG II signaling via the AT1receptor plays a pivotal role in basal renal microvascular tone and effectiveness to respond to vasoconstrictor and vasodilator agonists.
Thyroid hormone deficiency alters expression of acid-base transporters in rat kidney
Authors: Mohebbi Nilufar , Kovacikova Jana , Nowik Marta , Wagner Carsten A.
Published: April 2007

Hypothyroidism in humans is associated with incomplete distal renal tubular acidosis, presenting as the inability to respond appropriately to an acid challenge by excreting less acid. Here, we induced hypothyroidism in rats with methimazole (HYPO) and in one group substituted with l-thyroxine (EU). After 4 wk, acid-base status was similar in both groups. However, after 24 h acid loading with NH4Cl HYPO rats displayed a more pronounced metabolic acidosis. The expression of the Na+/H+ exchanger NHE3, the Na+-phosphate cotransporter NaPi-IIa, and the B2 subunit of the vacuolar H+-ATPase was reduced in the brush-border membrane of the proximal tubule of the HYPO group, paralleled by a lower abundance of the Na+/HCO3− cotransporter NBCe1 and a higher expression of the acid-secretory type A intercalated cell-specific Cl−/HCO3− exchanger AE1. In contrast to control conditions, the expression of NBCe1 was increased in the HYPO group during metabolic acidosis. In addition, net acid excretion was similar in both groups. The relative number of type A intercalated cells was increased in the connecting tubule and cortical collecting duct of the HYPO group during acidosis. Thus thyroid hormones modulate the renal response to an acid challenge and alter the expression of several key acid-base transporters. Mild hypothyroidism is associated only with a very mild defect in renal acid handling, which appears to be mainly located in the proximal tubule and is compensated by the distal nephron.
Crucial role of Rho-nuclear factor-κB axis in angiotensin II-induced renal injury
Authors: Ozawa Yuri , Kobori Hiroyuki
Published: April 2007

This study was performed to determine the effectiveness of the Rho kinase inhibitor and NF-κB inhibitor in renal injury of ANG II-infused hypertensive rats. Male Sprague-Dawley rats, maintained on a normal diet, received either a sham operation ( n = 7) or continuous ANG II infusion (120 ng/min) subcutaneously via minipumps. The ANG II-infused rats were further subdivided into three subgroups ( n = 7 each) to receive one of the following treatments during the entire period: vehicle, Rho kinase inhibitor (fasudil; 3 mg·kg−1·day−1ip), or NF-κB inhibitor (parthenolide; 1 mg·kg−1·day−1ip). After 12 days of ANG II infusion, systolic blood pressure (BP; 208 ± 7 vs. 136 ± 3 mmHg), Rho kinase activity, NF-κB activity, renal ANG II contents (160 ± 25 vs. 84 ± 14 pg/g), monocytic chemotactic protein (MCP) 1 mRNA, interstitial macrophage infiltration, transforming growth factor-β1 (TGF-β1) mRNA, interstitial collagen-positive area, urinary protein excretion (43 ± 6 vs. 11 ± 2 mg/day), and urinary albumin excretion were significantly enhanced compared with the Sham group. While fasudil or parthenolide did not alter systolic BP (222 ± and 190 ± 21, respectively), both treatments completely blocked ANG II-induced enhancement of NF-κB activity, renal ANG II contents (103 ± 11 and 116 ± 21 pg/g, respectively), MCP1 mRNA, interstitial macrophage infiltration, TGF-β1 mRNA, interstitial collagen-positive area, urinary protein excretion (28 ± 6 and 23 ± 3 mg/day, respectively), and urinary albumin excretion. Importantly, parthenolide did not alter ANG II-induced Rho kinase activation although fasudil abolished ANG II-induced Rho kinase activation. These data indicate that the Rho-NF-κB axis plays crucial roles in the development of ANG IIinduced renal injury independently from BP regulation.