bluuebunny/crossref_metadata_2025 huggingface dataset:
Development of an APL standard
Authors: Falkoff A. D. , Orth D. L.
Published: January 2007

Following an extended period of development, with more than half a dozen iterations, a standard for APL was not long ago adopted for use within IBM. In this paper we offer some highlights of our experience in this development process, as well as an appendix containing the technical matter in the standard itself. If a standards effort should get under way in the wider APL community, this experience and its work product may perhaps be found useful, and it is offered here in recognition of this possibility, without any commitment on the part of the IBM Company to support or not support such an effort. It should also be understood that this material is not offered as a specification of the function or performance of any particular IBM product.
APL2M
Authors: Rohmer Jean A.P.L.
Published: January 2007

We propose a modern software strategy based upon an unorthodox use of APL, permitting the adaptation of our system both upwards (new applications) and downwards (new processors). The tactic is the exploitation of APL
not as a programming language
but as a language for a macrogenerator. The purpose of this paper is twofold: first it explains to APL programmers how they can use this language to write assemblers, compilers in a very simple and pleasant manner; second it explains to mini-and microprocessor users that APL is surprisingly a sophisticated but cheap solution to their various software-engineering problems.
Laminar extension
Authors: Mebus George
Published: January 2007

Scalar extension is an implicit conceptual replication of a single-element argument so that it matches the shape of another. Laminar extension is a related extension of an arbitrary array, formed by repeating layers (or laminae) of the array along a new coordinate or along an existing coordinate with a dimension of 1. A restricted form of laminar extension already exists in APL as an implicit conceptual process. This paper identifies needs for an explicit laminar extension, and shows that no adequate implementation is now available in APL. By examining existing primitives, the paper establishes one of them as the natural home for a primitive implementation of explicit laminar extension. Examples illustrate its utility, and an appendix discusses its relationship to the by-slice operator recently proposed by Jenkins and Michel.
A software high performance APL interpreter
Authors: Saal Harry J. , Weiss Zvi
Published: January 2007

The design of a high performance APL system is presented along with an evaluation of the performance improvement measured on a partial implementation. The system contains a compiler which translates APL into the instructions of a virtual APL machine. Numerous special techniques suitable for optimized interpretation of this virtual machine entirely in software on a System 370 are described. The overhead for executing APL programs has been reduced by a factor ranging between 5 and 10 when compared to conventional interpretive systems.
The role of operators in APL
Authors: Iverson Kenneth E.
Published: January 2007

Operators, which apply to functions to produce functions, are an important component of APL. Despite their importance, their role is not well understood, and they are often lumped with functions in expositions of the language. This paper attempts to clarify the role of operators in APL by tracing their development, outlining possible future directions, and commenting briefly on their roles in other languages, both natural and programming.
Statistical software in APL
Authors: Heiberger Richard M.
Published: January 2007

High quality, state-of-the-art statistical software is not yet widely available in APL. However, many individuals and groups have developed collections of functions and some have begun the distribution of workspaces. This bibliography lists many of the available publications using APL in statistics including Analysis of Variance, Data Analysis, Probability, Regression, Statistical Analysis, and Time Series Analysis. A panel discussion on statistical software in APL is scheduled for this meeting. The panelists will include some of the authors listed in the bibliography.
Nested arrays as an extension for APL
Authors: Jenkins Michael A.
Published: January 2007

This workshop will be held to inform interested members of the APL community about current research on adding nested arrays to APL.

The Chairman will present a brief summary of current research in the area, indicating the issues that are yet unresolved, and presenting a set of criteria for deciding them. Each panel member will speak briefly to the issues and then an open discussion will follow.
Nested rectangular arrays for measures, addresses, and paths
Authors: More Trenchard
Published: January 2007

The left argument of the reshaping function in APL is an ordinal number or list of ordinals, called a shape, that measures the rectangularity of an array. Shapes are the simplest measures. A natural extension of the index-generator function shows how an array of any valence (rank), depth of nesting, or type can be used as a measure. The method of generalizing shapes to measures also generalizes addresses and paths to arbitrary arrays. Only the leaves of a measure, address, or path matter, the nested rectangular structure does not. These results of array theory for floating arrays are motivated by similar considerations for grounded arrays.
Efficient storage management in APL
Authors: Sykes Roy A.
Published: January 2007

This paper discusses dynamic storage allocation in
APL,
its costs, and how they can be reduced in both real and virtual environments. It also discusses measures to avoid
WS FULL
's, and how the
APL
System itself attempts to conserve storage.
APL and LISP—should they be combined, and if so how?
Authors: Burge William H. , Moses Joel , Pratt Vaughan R. , Perlis Alan J.
Published: January 2007

APL and LISP are very similar languages—both manipulate a complex data structure and the functional structure of the languages has been ideally chosen for convenient manipulation of these structures. Proposals have been made to combine them by embedding one within the other. Another approach is generalization of each into a common superior. This paper will argue that a superior language probably won't work and will then treat the issues by which the proper embedding choice should be made.

The talk will be followed by a panel discussion about the relationship between APL and LISP.
An APL system-development facility
Authors: Flower Douglas W. , Elliott Maurice
Published: January 2007

The APL system-development facility provides a framework within which system designers can easily solve many of the problems associated with the development of large systems. Systems can be defined and set up quickly, with automatically provided database-access facilities, data dictionary, and interactive maintenance protocols. A planned procedure definition and cataloging capability will provide a report writer and direct data-base inquiry and update facility to the user. Overall system structure is transparent, allowing straightforward additions and changes to the system. Fully general data structures are supported. Additionally, all data-access mechanisms can be tailored to take optimum advantage of individual situations. The optimization techniques themselves are well-defined and localized, further insuring system maintainability.
Smalltalk and generic concepts in programming languages
Authors: Kay Alan C.
Published: January 2007

Early generic concepts in programming languages were mixed-type arithmetic (e.g., “+” used with any combination of fixed-and floating-point numbers) and “print” functions which could be applied to any of a language's objects. Generic concepts reduce the number of terms which must be remembered and permit considerable condensation of language design. Three different paths in the development of generic-concept languages have been followed by APL, Algol 68, and object-oriented languages such as SIMULA 67 and Smalltalk. APL was the earliest and one of the most interesting applications of generic-concept methods, but now makes the weakest use of these ideas.

My talk will use slides and movies to show how the message-object programming system Smalltalk makes use of generic concepts embedded in class descriptions to give rise to a wide variety of simply programmed dynamic simulations including graphic animation, music synthesis, document layout and retrieval, and APL-like calculation features. Many of these systems have been brought to life by child and adult novice programmers.

A short list of references is given for those wishing more introductory information about Smalltalk.
Planning Neurosurgery wiih Interactive 3D Computer Imaging
Authors: Farrell Edward J. , Zappulla Rosario , Kantrowitz Allen
Published: January 2007

Planning intracranial neurosurgery involves understanding the threé-dimensional interrelationships of normal and pathologic structures, and contrasting alternate surgical approaches. The present study demonstrates the usefulness of interactive 3D imaging of CT data for surgical planning. Imaging options allow the surgeon to manipulate structures, obtain quantitative data on spatial relations, and contrast alternate surgical approaches based on 3D images similar to what is seen during surgery. The surgeon can choose the surgical approach that permits the best tumor exposure with minimal disruption of neural structures.
The Fortran 8X standard
Authors: Lahey T.
Published: January 2007

The Fortran Standard Committee has submitted a draft of the next Fortran Standard, referred to as 8x, for public review. Copies of this draft are available for $50 from Global Engineering Documents in Santa Ana, CA, 800 854-7179. Comments should be mailed to:
ANSI X3 Secretariat, CBEMA, 311 First Street NW, Suite 500, Washington, DC 20001
An alternate design for Fortran 8X
Authors: Fullerton J.
Published: January 2007

The current language revision effort by the ANSI X3J3 committee is suffering from substantial discord among the member organizations [13, 5] and the user community. The largest stumbling blocks appear to be the size [12] and complexity of the draft language. Both of these can be substantially reduced by a careful redesign of the language.
Nonassociative polynomial identities, Young tableaux and computers
Authors: Cattaneo G. M. Piacentini , Pittaluga M.
Published: January 2007

One of the problems which arises in nonassociative algebra is to find an efficient way to handle and to classify polynomial identities, because of the number of summands which appear in their expression. In this paper we show that the results in the literature on enumeration of minimal identities of particular degrees are simply particular cases of the well understood theory of Young tableaux and the representations of the symmetric groups, and as such can be generated mechanically by a computer. By applying a method introduced by Regev in the study of (associative) P.I. algebras, we show that one may classify directly from the standard tableaux all (associative or nonassociative) minimal identities of a given degree based on any set of forms of association. This method has the advantage, with respect to the similar technique used repeatedly in papers by Hentzel and Piacentini (for an explanation of the technique, see for example Hentzel [3],[4], and Hentzel-Piacentini [5]), that it may be easily implemented on a computer to solve the problem of classifying identities, with very little computing time; this allows one to handle identities of high degree, which was almost impossible until now. The implementation of the algorithm has been performed on a Micro VAX of our Department, using Common Lisp.
Symbolic manipulation in an extended λ-calculus
Authors: Flaherty Terry
Published: January 2007

A symbolic differentiation functional that handles expressions containing free and bound variables in an extended λ-calculus programming language (SRL) is described. A formalization of partial derivatives of functions wrt position of parameters is presented.
The standards factor
Authors: Meads Jon
Published: January 2007

Little News
has come my way since the last issue of the
Bulletin.
There was supposed to be a meeting of the Human Factors Society Human-Computer Interaction Standards Committee in Palo Alto this January. I was expecting to receive word on it, but have not.
Book review: L'ESPACE EN FRANCAIS by Claude Vandeloise (Editions du Seuil)
Authors: Creelman Paul
Published: January 2007

This simple yet engaging book examines the meaning of the words used to describe space and spatial relations. The words examined in this work in linguistics and cognitive science include the prepositions above/below, inside/outside, in front/behind, before/after, to the right/to the left, and others. This book will be of greatest interest to those working on the knowledge representation and semantics of spatial relations as part of a natural language processing (NLP) project. Applications might include parts of the NLP interface to a scene analysis system or NLP interface to an expert system advice on, for example, airplane repair where the airplane parts are in various spatial relations to one another and to the person using the system. Thus workers in NLP interfacing of various types may be interested. A good French/English dictionary may be needed to read Vandeloise although the language used is not difficult. Almost all of the issues and points examined by Vandeloise are directly applicable to English language semantics as well.
Typesetting APL with TeX
Authors: Hohti Aarno
Published: January 2007

The production of documents, preprints, books, teaching material etc. containing
APL
code has always been difficult or expensive, in particular when good quality has been desirable. Therefore, people have experimented with various computerized typesetting systems for solving this problem. In this note we describe how TEX, Donald Knuth's revolutionary typesetting program, can be used to generate a high quality typesetting environment for
APL.
Book review: Three-Dimensional Machine Vision by Takeo Kanade (Kluwer Academic Publishers)
Authors: Price Keith
Published: January 2007

Three-Dimensional Machine Vision
edited by Takeo Kanade brings together fourteen papers dealing with three-dimensional range data and written by various researchers in the field. Major topics include 3-D sensors, feature extraction, recognition and complete systems, which are the four sections of the book. Though some of the papers are similar to others by the authors, the papers were generally written for this book. Sensors and recognition algorithms each have 4 papers and each are approximately one-third of the book. Feature extraction and systems each have 3 papers and split the remaining one-third.
Automated heuristic analysis of spectroscopic data
Authors: Simon Hank
Published: January 2007

Spectroscopic data consists of a set of numbers which may be plotted on a graph. These numbers indicate a range of values rather than a single discrete value. It is straightforward to assign a meaning to a single value, but interpreting the meaning of a range of values requires more judgment. In nuclear physics, spectroscopic data is related to the mass or energy of a particle detected from a nuclear reaction. these data are discrete numbers, but because of the interactions between the nuclear reaction and the particle detector, a range of data is collected. Although it takes many years of experience to learn how to interpret nuclear physics spectra, the data reduction and analysis are fairly routine. The routine parts of data reduction and analysis can be automated by expert system techniques.
Manhattanville College expert academic advisor--preliminary report
Authors: Schwartz Edward N.
Published: January 2007

In this paper I summarize the experiences of four novice knowledge engineers in the development of an expert academic advising system. We discuss the ideas and techniques behind the system and some of the methods developed and used in implementing the system using a frame-based expert systems shell.
Object Oriented Simulation
Authors: Fishwick Paul A.
Published: January 2007

The words "object" and "paradigm" are widely used within existing computer science literature; however, when one speaks of "object-oriented paradigm" or "object-oriented programming," one is referring to a methodology for algorithmic encoding using concepts of class hierarchy and inheritance. The idea of object-oriented methodology within simulation is to treat the algorithm as a set of objects. Procedures, often termed "methods" may be activated via object to object message transmission -- object A sends a message to another object B that might say, "I am moving towards you at a rate of 20 meters/sec." Object B might then respond to this incoming message by sending messages of its own to other objects within the simulation. Methods are stored "within" an object's frame or definition.
Tactical simulation in an object-oriented animated graphics environment
Authors: Petty Mikel D. , Moshell J. Michael , Hughes Charles E.
Published: January 2007

Action Graphics (AG) combines the ideas of animated graphics, free-form spreadsheets and object-oriented programming to produce a problem solving and simulation environment.
Design and implementation in object-oriented simulation
Authors: Bezivin Jean
Published: January 2007

This document intends to emphasize some important issues about the required qualities of simulation software. It will be argued firstly that the need for readability is much more important for simulation programs than for general software and secondly that the need for high efficiency is rapidly increasing. We shall then discuss how the object-oriented paradigm may help to meet these mutually dependent requirements in various ways.
Determination of technical support requirements of an office automation system
Authors: Williams Edward J.
Published: January 2007

The Body & Chassis Engineering Department of Ford Motor Company recently formulated plans for greatly increasing (from 155 to 476) the number of Fortune engineering-workstation computers. This increase represents a vital step in the implementation of an office automation system. Systems-analysis personnel of the Department used discrete simulation as a tool to quantify the impact of this increase on the workload of technical support personnel. In turn, Department management used the results of these simulations to formulate a hiring plan consistent with the planned rate of terminal acquisition.
Using cautious heuristics to bias generlization and guide example section
Authors: Gordon Diana F.
Published: January 2007

Bias plays a significant role in inductive inference. In the framework of inductive concept learning from examples, there is an unknown target concept to be learned and a set of instances classified as positive or negative examples of the target concept. If learning is incremental, hypotheses (usually expressed in terms of instance features) are formed and then modified to remain consistent with the growing set of known instances. Generalization and specialization are frequently used for making modifications. A hypothesis is consistent with the instances if it logically implies all known positive instances and no known negative instances. If learning is empirical and the concept language is rich, the number of hypotheses consistent with the instances may be quite large. Since the purpose of each hypothesis is to predict over future instances, a judicious choice of one hypothesis over others ("bias")
1
can improve these predictions, thereby enhancing system performance.
AN ONLINE MANUAL FOR A PROGRAMMING LANGUAGE
Authors: Barr Robert
Published: January 2007

A prototype of an online manual was developed to test whether:• given an adequate user interface and sufficient information in an online manual, users would prefer an online manual to a printed manual.• a better interface than the existing Help system's could be developed, one that was easier to use and faster at locating information.
Book review: Medical Language Processing
Authors: Schlossberg Jon L.
Published: January 2007

For several years, Naomi Sager and her group at NYU have been conducting research in natural language processing and applying that research to medical applications. This book,
Medical Language Processing: Computer Management of Narrative Data
, is basically a status report on the many facets of their project, the Linguistic String Project (LSP). The book contains chapters covering the various sub-fields of a natural language processing system and were written by the members of the project who are currently researching the related issues.
Communicating With High-Level Plans
Authors: Bonar Jeffrey
Published: January 2007

This paper provides support for the following points regarding the design of intelligent interfaces (or more generally, intelligent dialog systems): 1) Constraints of human dialog processing, including limited attention span and partial understanding, should be dealt with explicitly in design of intelligent dialog systems; 2) An intelligent dialog system should be a partly autonomous agent, though accountable to its users; 3) An intelligent dialog system should be designed to incorporate explicit active models of tasks, users, the system itself and the process of dialog with the user; 4) Models should be built and maintained both for types of tasks, users and dialog processes and for specific instances for tasks, users and dialogs. In particular, an intelligent dialog system should model users in terms of their individual human characteristics; 5) The configuration of models maintained by an intelligent interface should be self referencing. That is, the system's model of itself, which is a component of the model configuration, should be able to refer to the model configuration as a whole, and should be able to access the assertions in that configuration; and 6) Dialog processes should be modeled from a first-party (system) view and the system's second-party view of the user, rather than from a third-party (observer's) view.
Graphical Knowledge-Based Structure Editors
Authors: Stelzner Marilyn , Cypher Allen
Published: January 2007

We discuss our experience with an interface that gives users the ability to directly represent and manipulate goals at several levels of detail. The interface is built into Bridge, a tutorial environment for novice programmers [Bonar88]. The name comes from our intended "bridge" between novice and expert conceptions of programming. In order to understand student designs and partial programs, Bridge provides languages that allow a student to talk about his or her high-level designs and partial work. We call the vocabulary of these languages plans. Plans are bundles of knowledge about the standard subtasks in a domain, designed and organized based on a typical user's point of view.Many intelligent interfaces monitor low-level user actions, attempting to infer higher level plans. These inferences are typically implemented with partial matching schemes, based on a plan catalog (see, for example, [Johnson86]). The inferences allow the system to complete user actions, correct errors, or provide tutorial assistance. This approach to inference of user intentions is quite difficult. We propose a different approach, designed to more effectively and accurately capture user intentions.Our approach gives users a very high-level plan language. By "high-level" we mean a language that is informal, vague, contains much implicit information, and is designed to represent goals of interest to a particular class of users. In particular,the plan language makes assumptions about the user's background knowledge and overall intentions. This is consistent with our interest in providing interfaces to professionals and domain experts who have no programming experience. We focus on users who are experts in a particular task domain and are using a computer to extend or augment that expertise. Our system must take such a user's specification and derive an implementation using the primitives provided by a standard computer system. In the rest of the article we begin by developing a framework for approaching intelligent interfaces. In particular, we discuss the dilemma of a very high-level programming language intended for use by experts who are not programmers.
BACKBORD
Authors: Yen John , Neches Robert , DeBellis Michael
Published: January 2007

Several previous systems have utilized a retrieval by reformulation paradigm for query-based retrieval from databases. These systems were not designed to support other applications, such as knowledge base browsing, and lacked provisions for acting upon retrieved data. We describe a multi-purpose browsing interface that extends the retrieval by reformulation paradigm by (1) providing a set of tools for knowledge base browsing and event tracking, (2) supporting a general mechanism that enables application-builders to specify actions applicable to retrieved data, and (3) applying specification by reformulation, an interface paradigm more general than retrieval by reformulation, to actions that involve forms filling. This extends the paradigm's benefits beyond database users to both developers and users of a wide range of knowledge-based systems.
A Language/Action Perspective on the Design of Cooperative Work
Authors: Winograd Terry
Published: January 2007

What are the requirements on computer- and telecommunications-based tools to aid groups in producing intellectual products? In this article we examine research collaborations as a particularly informative example of group work and propose a framework for describing research collaboration that should provide guidance to those developing technology to support collaborative work. The framework is based on 50 semistructured interviews with researchers in psychology, management science, and computer science. It focuses on the problems in forming and maintaining personal relationships and completing tasks that researchers must solve to have a successful collaboration. These problems occur when collaborators are initiating projects, executing them, and documenting results.
Cognitive Science and Organizational Design
Authors: Crowston Kevin , Malone Thomas W. , Lin Felix
Published: January 2007

Many researchers have investigated and speculated about the link between information technology and organizational structure with very mixed results. This article suggests that part of the reason for these mixed results is the coarseness of previous analyses of both technology and structure. It describes a new and much more detailed perspective for investigating this link. Using concepts of object-oriented programming from artificial intelligence, the information processing that occurs in organizations is characterized in terms of the kinds of messages people exchange and the ways they process those messages. The utility of this approach is demonstrated through the analysis of a case in which a reduction in levels of management is coupled with the introduction of a computer conferencing system. The detailed model developed for this case helps explain both macro-level data about the changes in the organizational structure, and micro-level data about individuals' use of the system.
Once more, with meaning
Authors: Luebking Scott
Published: January 2007

Many programmers would not approve of a programming statement like:float search_table[10]because using an explicit constant; for example, "10", can create trouble. One common problem occurs when a programmer changes the size of the table in the declaration, but forgets to change terminating values for loops searching the table. As a result, an inconsistency has been introduced into the program. To avoid these inconsistencies, many programmers prefer a statement like:float search_table [MAX_BOOKS]where the size of the table is specified by a symbolic constant. To change the size, only the value assigned to the symbolic constant is changed, but no inconsistency is introduced into the program. In addition, a symbol has more meaning than just a constant; for example,"10" versus MAX_BOOKS.
THE EFFECTS OF FREQUENCY AND LENGTH OF COMMANDS AND TRAINING TRANSFER ON TEXT EDITING PERFORMANCE
Authors: Gunther Virginia A. L. , Grosofosky Alexis , Burns Daniel J. , Payne David G.
Published: January 2007

The nature of the command terms used by computer systems is an important issue affecting human computer interaction. As such, this area has received considerable attention recently (e.g., Ehrenreich, 1982, 1985; Grudin & Barnard, 1984; Landauer, Galotti, & Hartwell, 1983; Landauer & Galotti, 1984; Ledgard, Whiteside, Singer, & Seymour, 1980; Scapin, 1981, 1982). The issues addressed by these researchers are particularly important in light of the larger number of computer users who have little or no knowledge of the underlying logic of either the hardware or the software that they are using. As a group, these users often believe that the system should be "fast and easy to use". One area in which this expectation is especially widespread is that of wordprocessing packages. Although wordprocessing packages generally share the same basic functional purposes, the specific command terms that each uses for a particular function are generally not the same or even similar. There are even instances where different versions of the same wordprocessing package have different commands and/or functions than previous versions. Therefore, not only is the issue of the ease of learning and use of commands important, but also the issue of how these commands might be changed (either across different levels of user expertise or different versions of the software) so that there is maximum transfer of training from old commands to new commands.
Videotex information packagers: a field study aimed at tomorrow's videotex authoring interface
Authors: Kelley John F.
Published: January 2007

Twenty-Three professional Videotex Information Packagers (
VIP
: graphic artists, database architects, wordsmiths, etc.) were interviewed about current work habits with an eye toward the implications for
VIP
automation. Interviews were taped and transcribed for semi-mechanized content analysis. Photographs of work areas and materials were also made. Observations include: heavy continuing reliance on paper notes and records; a frequently frustrated need on the part of
VIP
s for a variety of database listings in different formats (graphic and textual) at differing levels of detail; desperate need for more compatibility among the various hardware and software elements in the graphics/text/database synthesis process.
Abstracts of papers in the Journal of Symbolic Computation
Authors: Winkler Franz
Published: January 2007

We consider linear problems in fields, ordered fields, discretely valued fields (with finite residue field or residue field of characteristic zero) and fields with finitely many independent orderings and discrete valuations. Most of the fields considered will be of characteristic zero. Formally, linear statements about these structures (with parameters) are given by formulas of the respective first-order language, in which all bound variables occur only linearly. We study symbolic algorithms (
linear elimination procedures
) that reduce linear formulas to linear formulas of a very simple form, i.e. quantifier-free linear formulas, and algorithms (
linear decision procedures
) that decide whether a given linear sentence holds in all structures of the given class. For all classes of fields considered, we find linear elimination procedures that run in double exponential space and time. As a consequence, we can show that for fields (with one or several discrete valuations), linear statements can be transferred from characteristic zero to prime characteristic
p
, provided
p
is double exponential in the length of the statement. (For similar bounds in the non-linear case, see Brown, 1978.) We find corresponding linear decision procedures in the Berman complexity classes [EQUATION] for
d
= 1,2. In particular, all these procedures run in exponential space. The technique employed is quantifier elimination via Skolem terms based on Ferrante & Rackoff (1975). Using ideas of Fischer & Rabin (1974). Berman (1977), Füer (1982), we establish lower bounds for these problems showing that our upper bounds are essentially tight. For linear formulas with a bounded number of quantifiers all our algorithms run in polynomial time. For linear formulas of bounded quantifier alternation most of the algorithms run in time [EQUATION] for fixed λ.
An extensible differential equation solver
Authors: Willis Barton L.
Published: January 2007

We describe a method for solving linear second order differential equations in terms of hypergeometric and other (less well known) special functions. Intended as a method for computer algebra systems, the solver described in this article uses a database of functions to construct an anstatz for the solution. A user may extend the solver by appending functions to the database. An overview of a Macsyma language implementation, with sample calculations, is given.
MobiMine
Authors: Kargupta Hillol , Park Byung-Hoon , Pittie Sweta , Liu Lei , Kushraj Deepali , Sarkar Kakali
Published: January 2007

This paper describes an experimental mobile data mining system that allows intelligent monitoring of time-critical financial data from a hand-held PDA. It presents the overall system architecture and the philosophy behind the design. It explores one particular aspect of the system---automated construction of personalized focus area that calls for user's attention. This module works using data mining techniques. The paper describes the data mining component of the system that employs a novel Fourier analysis-based approach to efficiently represent, visualize, and communicate decision trees over limited bandwidth wireless networks. The paper also discusses a quadratic programming-based personalization module that runs on the PDAs and the multi-media based user-interfaces. It reports experimental results using an ad hoc peer-to-peer IEEE 802.11 wireless network.
What's interesting about Cricket?
Authors: Roddick John F. , Rice Sally
Published: January 2007

Despite significant progress, determining the interestingness of a rule remains a difficult problem. This short paper investigates the lessons that may be learned from analysing the (largely manual) selection of interesting statistics for cricket (or any other data rich sport) by experts. In particular, the effect of thresholds on the interestingness of rules describing events in the sporting arena is discussed. The concept of anticipation is shown also to be critical in this selection and to vary the level of interest in events that may contribute to the achievement of a threshold value during a match, thus adding a temporal dimension to interestingness. This temporal aspect can be best modelled on the single-past-branching-future model of time. As a result of this investigation, a few new general ideas are discussed that add to the research in this area. Significantly, some of the new criteria are implicitly temporal in that they rely on a model of behaviour over time. The applicability of threshold values for detecting uncharacteristically poor performances are canvassed as areas of interest yet to be explored.
G-networks with resets
Authors: Fourneau Jean-Michel , Gelenbe Erol
Published: January 2007

Gelenbe Networks (G-networks) are a class of queuing models which include new types of customers called "signals," which are either "negative customers" and "triggers" [1, 2]. Queuing networks typically do not have provisions for some customers being used to eliminate other customers, or to redirect other customers among the queues. In other words, customers in traditional queuing netwroks cannot exert direct control on other customers. G-network models overcome some of these limitations and still preserve the computationally attractive "product form" property of certain Marovian queuing networks. In addition to ordinary customers, G-networks contain "negative customers" which eliminate normal customers, and "triggers" which move other customers from some queue to another [4, 5]. Multiple class versions of these models are discussed in [7, 8], and in [9] many additional results are provided. These queuing networks have generated much interest in the literature.
Generalized processor sharing with heterogeneous traffic classes
Authors: Borst Sem , Mandjes Michel , van Uitert Miranda
Published: January 2007

We consider a system with two heterogeneous traffic classes, one having light-tailed characteristics, the other one exhibiting heavy-tailed properties. The two traffic classes are served in accordance with the Generalized Processor Sharing (GPS) discipline. GPS-based scheduling algorithms, such as Weighted Fair Queueing (WFQ), have emerged as an important mechanism for achieving service differentiation in integrated-services networks.We determine the workload asymptotics of the light-tailed class for the situation where its GPS weight is larger than its traffic intensity. The GPS mechanism ensures that the workload is bounded above by that in an isolated system with the light-tailed class served in isolation at a constant rate equal to its GPS weight. We show that the workload distribution is in fact asymptotically equivalent to that in the isolated system, multiplied with a certain pre-factor, which accounts for the interaction with the heavy-tailed class. Specifically, the pre-factor represents the probability that the heavy-tailed class is backlogged long enough for the light-tailed class to reach overflow. The results provide crucial qualitative insight in the typical overflow scenario.
Optimal scheduling in queueing network models of high-volume commercial web sites
Authors: Squillante Mark S. , Xia Cathy H. , Zhang Li
Published: January 2007

The optimal control of performance measures in high-volume commercial web sites requires a fundamental understanding of the interactions between the diverse set of Internet services that support customer needs and the different importance levels of these services to both the customer and the e-commerce merchant. We present a study of the server control policy in a multiclass queueing network that maximizes a particular function of profit, or minimizes a particular function of cost, across the different classes of Internet services.
Throughput of ideally routed wireless ad hoc networks
Authors: Németh Gábor , Turányi Zoltán Richárd , Valkó András
Published: January 2007

We investigate the throughput of ad hoc networks using ideal shortest path routing between randomly selected source-destination pairs. Our results not only confirm the n
-1/2
decay of the throughput that was published earlier in the literature, but also provides an approach to acquire the relation of various network parameters. This way the effects of changes in the routing, traffic generation algorithms or other network characteristics can be predicted using a first order approximation.
Selection diversity forwarding in a multihop packet radio network with fading channel and capture
Authors: Larsson Peter
Published: January 2007

Recent and increased interest of wireless mobile ad hoc networking motivates detailed examination of routing schemes specifically targeted for the demanding constraints that an unreliable, time varying and broadcast like wireless medium imposes. Incorporation and exploitation of radio characteristics are fundamental keys to successful and near optimal operation of routing schemes in a wireless environment. In this paper, forwarding methods for wireless mobile multihop networking in Rayleigh fading and non-fading channels are examined. An adaptive forwarding scheme denoted Selection Diversity Forwarding (SDF) is introduced and compared with two classical forwarding methods. It is shown that SDF presents significant performance improvements. In particular and in contrast to the reference methods NFP and MFR, the performance of SDF is enhanced under fading channel conditions. It is found that local path adaptation has potential to perform better than routing approaches along a single path.
Scraping the ACM Digital Library
Authors: Bergmark Donna , Phempoonpanich Paradee , Zhao Shumin
Published: January 2007

As part of a larger project to automatically reference link the online scholarly literature, an attempt to analyze PDF documents was undertaken. The ACM Digital Library was used as the corpus for these experiments. With the current PDF and HTML analysis tools, roughly 80% accuracy was obtained in the automatic extraction of reference linking information.
Cross-Language Chinese Text Retrieval in NTCIR Workshop
Authors: Chen Kuang-hua , Chen Hsin-Hsi
Published: January 2007

This article reports the results of Chinese Text Retrieval (CHTR) tasks in NTCIR Workshop 2 and the future plan of NTCIR workshop. CHTR tasks fall into two categories: Chinese-Chinese IR (CHIR) and English-Chinese IR (ECIR). The definitions, schedules, test collection (CIRB010), search results, evaluation, and initial analyses of search results of CHIR and ECIR are discussed in this article. The new plan of NTCIR towards multilingual Cross-Language Information Retrieval (CLIR) is also described.
Report on the third International Workshop on Web Information and Data Management (WIDM'2001)
Authors: Lim Ee-Peng , Hsiang-Li Roger Chiang
Published: January 2007

The third International Workshop on Web Information and Data Management (WIDM'2001) was held at Doubletree Hotel, Buckhead in Atlanta on November 9, 2001. The workshop was sponsored by ACM SIGIR, ACM SIGMIS and E-Book Systems. Like it predecessors, WIDM'2001 was held in conjunction with the International Conference on Information and Knowledge Management (CIKM'2001).The objective of the workshop was to bring together researchers, industrial practitioners, and developers to study how the web information can be extracted, stored, analysed and processed to provide useful knowledge to the end users for various advanced database applications. The workshop received 34 submission of research papers, out of which 11 were accepted.
A unified framework for resource discovery and QoS-aware provider selection in ad hoc networks
Authors: Liu Jiangchuan , Zhang Qian , Li Bo , Zhu Wenwu , Zhang Jun
Published: January 2007

With the rising popularity of network-based applications and the potential use of mobile ad hoc networks in civilian life, an efficient resource discovery service is needed in such networks for quickly locating resource providers. In addition, to improve user experience, QoS awareness is also crucial. In this paper, we identify the challenges when basic resource discovery techniques for the Internet are used in mobile ad hoc networks. We then propose a framework that provides a unified solution to the discovery of resources and QoS-aware selection of resource providers. The key entities of this framework are a set of self-organized discovery agents. These agents manage the directory information of resources using hash indexing. They also dynamically partition the network into domains and collect intra- and inter-domain QoS information to select appropriate providers. Simulation results show that our framework improves the QoS delivered to the clients, while the cost and response time are kept at a low level.
DCA wireless networks under high offered loads
Authors: Mišić Jelena , Tam Bun Yik
Published: January 2007

Dynamic channel allocation policy (DCA) in wireless networks is known to be better than the fixed channel allocation (FCA) policy from the aspect of the call level QoS such as handoff dropping probability. Because of this superiority the DCA networks are usually designed without the call admission control (CAC). However, given the decrease of cell sizes, together with increasing mobile phone and terminal population, and with the bandwidth requirements of multimedia applications, it is likely to come to the situation when high traffic area size exceeds the area where channel borrowing can ensure bounded QoS. This paper analyses the performance of the DCA networks without the CAC under high intensity traffic and shows that under such conditions DCA network fails to ensure sufficiently low level of QoS. Further, we propose CAC which can stabilize the QoS under high loads and changing traffic conditions. This CAC integrates well with distributed DCA policies.
Maximum likelihood network topology identification from edge-based unicast measurements
Authors: Coates Mark , Castro Rui , Nowak Robert , Gadhiok Manik , King Ryan , Tsang Yolanda
Published: January 2007

Network tomography is a process for inferring "internal" link-level delay and loss performance information based on end-to-end (edge) network measurements. These methods require knowledge of the network topology; therefore a first crucial step in the tomography process is topology identification. This paper considers the problem of discovering network topology solely from host-based, unicast measurements, without internal network cooperation. First, we introduce a novel delay-based measurement scheme that does not require clock synchronization, making it more practical than other previous proposals. In contrast to methods that rely on network cooperation , our methodology has the potential to identify layer two elements (provided they are logical topology branching points and induce some measurable delay). Second, we propose a maximum penalized likelihood criterion for topology identification. This is a global optimality criterion, in contrast to other recent proposals for topology identification that employ suboptimal, pair-merging strategies. We develop a novel Markov Chain Monte Carlo (MCMC) procedure for rapid determination of the most likely topologies. The performance of our new probing scheme and identification algorithm is explored through simulation and Internet experiments.
Passage time distributions in large Markov chains
Authors: Harrison Peter G. , Knottenbelt William J.
Published: January 2007

Probability distributions of response times are important in the design and analysis of transaction processing systems and computer-communication systems. We present a general technique for deriving such distributions from high-level modelling formalisms whose state spaces can be mapped onto finite Markov chains. We use a load-balanced, distributed implementation to find the Laplace transform of the first passage time density and its derivatives at arbitrary values of the transform parameter
s
. Setting
s
= 0 yields moments while the full passage time distribution is obtained using a novel distributed Laplace transform inverter based on the Laguerre method. We validate our method against a variety of simple densities, cycle time densities in certain overtake-free (tree-like) queueing networks and a simulated Petri net model. Our implementation is thereby rigorously validated and has already been applied to substantial Markov chains with over 1 million states. Corresponding theoretical results for semi-Markov chains are also presented.