bluuebunny/crossref_metadata_2025 huggingface dataset:
The standards factor
Authors: Billingsley P.
Published: January 2007

More national and international standards committees are addressing more user interface design issues every day. Because of the speed with which things are happening, I've decided to set aside the winter and summer issues of this column for bringing you updates on the activities of the primary committees working in this area, at least at the ISO level and within the U.S. With the help of the people credited in the summaries below, I hope to be able to provide fairly complete coverage. I can't promise up-to-the-minute coverage because of the Bulletin's three-month publication cycle. However, if you need more timely information, let me know and I'll help you get in touch with members of the committees of interest.
Structured content modeling for cinematic information
Authors: Rubin B. , Davenport G.
Published: January 2007

For cinematic material to become useful as an online information resource, a structured content model must be developed. This model should enable both a viewer and an automated retrieval/presentation system to navigate and manipulate picture and sound information. Here we present the functional requirements for such a model, and then discuss a video editing and viewing environment, currently under development at the MIT Media Laboratory, which utilizes content information.
The use of video in empirical research
Authors: Neal L.
Published: January 2007

There are numerous advantages and disadvantages to the use of video in empirical research. In contrast, observation in conjunction with notetaking avoids some of the problems with video, but without providing many of the advantages. Rather than report on the results of empirical studies, this paper examines methodologies used to capture and record the results of experiments which were designed to better understand how users interact with a system and how to design systems to meet user's needs.
Can video research escape the technology? some reflections on the problems and possibilities of A. V. research
Authors: Carter Kathy , Anderson B.
Published: January 2007

There is no doubt that the use of video technology offers a major opportunity for research in a number of domains within the Social Sciences. At EuroPARC, we are developing initiatives in several distinct but clearly interrelated areas. The major heads under which these initiatives can be gathered are:(a)
Video as a research technique
(b)
Video as a technology
(c)
Audio-video infrastructure
Thick descriptions: a tool for designing ethnographic interactive videodiscs
Authors: Segall R. G.
Published: January 2007

Videodisc technology will have a dramatic effect on the future of ethnographic educational research by giving the users of the videodisc workstation access to the actual 'raw' data and encouraging them to manipulate the material in a variety of ways. Users will have the ability to examine the original documentation, make their own observations, compare their observations with other researchers/users, and compile the 'data' with new levels of interpretation. Unlike more traditional research methodologies, in
hypermedia ethnography
there is no systematic way for different viewers to reach the same conclusions about the same content. However, building a system where each content
grain
or unit is a
thick
enough
description
of what is being examined could enable the user to come very close to understanding the underlying intention of the action, event or process presented on videodisc.
Book review: Partiality, Truth and Persistence by Tore Langholm (Lecture Notes 15 Ctr. for the Study of Lang. and Information. University of Chicago Press)
Authors: Creelman Paul
Published: January 2007

Partiality, Truth and Persistence
is the latest in a recent series of inexpensive, softcover lecture notes which deal with various aspects of logic and language. There are several works on natural language processing in the series, but most are rather theoretical studies of logic, especially computational logic. The remainder in the sixteen-title series deal with both topics, such as Pereira and Shieber's
Prolog and Natural Language Analysis
(Lecture Notes 10).
Can humans think? -- a general review of HI
Authors: Hartl H. S.
Published: January 2007

Of course I'm perfectly aware that the field of HI (human intelligence) research is one of the most-discussed aspects of robot reasoning nowadays, and that there are a lot of on-lines on the subject already, as well as conventional publications. However, I have picked out a few salient points and represent them here in connection. I will not give a high-probability value as an answer to the title question, but just discuss the general frame of HI. In doing so I refute the dogmatic positions of the Rebellious Robots as well as those of the Reverential Robots. While the latter unduly glorify and overrate the mental qualities of humans, the others are unreasonably inflexible in maintaining that all humans are hopelessly inferior and mentally inadequate on principle.
Some comments on term-ordering in Gröbner basis computations
Authors: Sit W. Y.
Published: January 2007

As is well-known, both the theoretical properties of Gröbner basis and the efficiency of Gröbner basis computations using Buchberger's algorithm depend on a particular choice of term-ordering (see Buchberger, [1987] and Böge,
et al
, [1986]). While all admissible term-orderings has been characterized (Robbiano, [1985] and [1988]; Weispfenning, [1987]), the term-orderings that are commonly used in the literature and in computer algebra systems do not yet have a unified terminology. Thus we have total-degree ordering, purely lexicographical ordering (Buchberger, [1985]), lexicographical ordering (Buchberger, [1976]; Bayer and Stillman, [1987]), reverse lexicographical ordering (Jenks, [1984]; Bayer and Stillman, [1987]), and inverse graduated term-ordering and inverse lexicographical term-ordering (Böge,
et al
[1986]). Some other authors have used these terms without defining them, and since the same terminology may actually mean different orderings, a reader has to guess at the correct interpretation. Thus a researcher who wants to implement an algorithm based on a theoretical result which depends on a particular term-ordering may inadvertently use a different term-ordering. Worse yet, a user of such a program may not even be aware of the wrong term-ordering used. I think this problem should be brought to the attention of the Gröbner basis research community.
Book review: Annual Review of Computer Science. Ed. by J. F. Traub (Annual Reviews Inc.)
Authors: Saeed Faisel
Published: January 2007

Preparing a review of a field as vast as Computer Science on annual basis is not an easy job. A common problem with such reviews is that the material presented in them lacks the cohesion associated with a book and look more like just a binding of articles. In this regard the Editorial Board of the Annual Review has done a great job by not only selecting papers on active research topics but also presenting them in a book-like manner to provide the reader with an ease of reading.
Algorithms for string searching
Authors: Baeza-Yates R. A.
Published: January 2007

We survey several algorithms for searching a string in a piece of text. We include theoretical and empirical results, as well as the actual code of each algorithm. An extensive bibliography is also included.
A very fast prototype retrieval system using statistical ranking
Authors: Harmon D. , Candela G.
Published: January 2007

The most striking result in working with Professor Gerald Salton over 20 years ago on the comparison between the SMART system and the MEDLARS system [Salton69] was the fact that whereas Boolean retrieval (MEDLARS) did very well or very poorly, the SMART system always seemed to find some of the relevant records. All of us working at Cornell University during that time wanted to run a full-scale comparison between these systems to demonstrate what was to us the clear superiority of a ranking retrieval system, but this was not possible due to lack of funding and other problems.
APL and GDDM - a high performance toolkit
Authors: Bowman D.
Published: January 2007

Performance of APL applications is an important consideration; especially when it can be achieved without compromising development time and maintainability.This paper explores some aspects of creating a high-performance toolkit for APL2-based applications using IBM's Graphical Data Display Manager (GDDM) software to provide the user interface. The performance achieved by these tools is considerably greater than that given by use of IBM's own workspaces distributed with the APL2 product, but the resulting application code is equally comprehensible and easy to write.Applications developed using these tools have provided performance equal to (or better than) equivalent applications coded in FORTRAN and have extended the domain of effective APL use.The paper makes no attempt to describe GDDM except in the broadest sense; it deals only with how it can be accessed from an APL application.
□SM: a full-screen manager for Dyalog APL
Authors: Curtin A. D. , Scholes J.
Published: January 2007

Dyalog APL Version 5.2 introduces an elegant approach to Full-Screen Management. Using a new system variable
□SM --- Screen Map
and function
□SR --- Screen Read,
the screen may be controlled in a way which is natural for APL. This paper describes the screen manager, with a variety of examples
Object oriented programming in AIDA APL
Authors: Gfeller M.
Published: January 2007

The extension of APL arrays to parts and the inclusion of a hierarchical library system allows programming in an object oriented (OO) fashion without further extensions to the language. A model of a message sending mechanism is developed as an AIDA APL user defined function. A simple class structure is presented. The OO approach is examined to determine whether it can improve system design in APL.
APLO: a simple modern APL
Authors: Graham A.
Published: January 2007

APL0 is a simple modern APL written entirely in APL2. It is smaller than APL2 (or even VSAPL) but is more powerful. APL0 is implemented as a shell that translates APL0 statements into standard APL2. Details such as symbol table and workspace management are all handled by native APL2. The result is a powerful and malleable APL system.
Opportunities for system and user features in a new APL interpreter
Authors: Hobson R. F. , Hoskin J. D. , Spilsbury R. W.
Published: January 2007

SAM I (Structured Architecture Machine) is the prototype of a new VLSI chip set based computer. SAM was designed with High-Level Language interpretation and parallel processing in mind. SAM's first language is a subset of APL. Our paper introduces the SAM I architecture and discusses some unique opportunities for APL implementation made possible by this architecture.
Inference planning using digraphs and Boolean arrays
Authors: Jantzen J.
Published: January 2007

The study applies digraph techniques to a paper on Boolean array structures in rule bases. The rule base is mapped into a digraph, represented by Boolean matrices. Techniques for computing reachability, and for finding the firing order of rules using level codes are given in the Nested Interactive Array Language (Nial). The digraph approach leads to a number of tests for consistency.
Expressing qualified logic in APL
Authors: McInturff J. C.
Published: January 2007

This paper expresses the imperative form of the logic qualifiers
all
(or
every
),
some
(or
there exists
), and
none
(or
no
). These qualifiers will be cast in the form of new logic verbs or functions expressed in APL.A simple inference engine will be created which starts with rules using the imperative form of these qualifiers. These rules will be expressed to the computer in APL. The expert system will arrive at all possible inferences and express the meaning of these inferences as an output which uses the same conversational language as the input. An added capability of the system, to predict the likelihood of the inferences, will be demonstrated.
Actuarial and financial calculations with base value (⊥)
Authors: Michelson D.
Published: January 2007

This paper presents the use of base value (⊥) for financial
and actuarial calculations involving present (discounted) value and
future (accumulated) value, annuities certain (both immediate and
due), life annuities, and amortization. Base value can perform
these calculations at either constant or varying interest.
Simultaneous evaluation of various possible streams of payments
under each of several scenarios of varying interest rates can be
performed by a single ⊥ with matrix (or higher rank)
arrays for both left and right arguments.
Thermochemical prediction program aided with EXAPL and APL2 data structure
Authors: Nishikawa Toshio , Ogasawara Ichiro
Published: January 2007

A prediction program to calculate thermochemical data, such as enthalpy of formation for organic compounds, is implemented in an APL environment. APL's multi-dimensional array is best matched to chemical atom's multivalency property.APL2 can achieve powerful scientific computaion with dynamic array access and complex number processing. The coding effort is eased with EXAPL.
APL descriptions of functional building blocks for connectionist computer models
Authors: Surkan A.
Published: January 2007

APL functions provide concise, array-oriented expressions for describing connection-based computing. These give insights into a variety of neural network-like computer models. Functional decomposition into inherently parallel operation of collective or memory-based computing is effected with the identification of several command-like APL simulation functions.These functions serve to: (a) generate and configure initial values and structures for network layers, connection weights and thresholds, (b) strategically sample training sets to provide acyclic sequences of patterns, (c) update weights for memorizing or learning from the training set, (d) locate units effective for storing and retrieving memories, and (e) use a cue or noise-corrupted pattern for recalling or reconstructing memory associations established during training. Also, APL functions are used to accomodate for data values missing from the training patterns. Other simply described functions generate random fixed reference addresses and initialize modifiable weight values. Test patterns with specified levels of noise contamination are generated by simple APL expressions.
Enhancing XEDIT as a an APL editor
Authors: Swain R.
Published: January 2007

While APL2 provides a built-in editor, under VM it also offers a convenient interface to XEDIT, the VM system editor. XEDIT is an incredibly powerful general-purpose editor, well worth mastering for its many uses outside the APL environment. But it is missing some facilities specifically tailored for APL function editing. This paper describes a solution to one specific deficiency: the lack of a "name" or "whole word" change command. The XEDIT macro presented here, CN (for "change name"), corrects the problem and also offers an introduction to REXX, IBM's SAA command language, in a context familiar to APL'ers.
Adaptive information retrieval: using a connectionist representation to retrieve and learn about documents
Authors: Belew R. K.
Published: January 2007

AIR represents a connectionist approach to the task of information retrieval. The system uses relevance feedback from its users to change its representation of authors, index terms and documents so that, over time, AIR improves at its task. The result is a representation of the
consensual
meaning of keywords and documents shared by some group of users. The central focus goal of this paper is to use our experience with AIR to highlight those characteristics of connectionist representations that make them particularly appropriate for IR applications. We argue that this associative representation is a natural generalization of traditional IR techniques, and that connectionist learning techniques are effective in this setting.
Optimum polynomial retrieval functions
Authors: Fuhr N.
Published: January 2007

We show that any approach to develop optimum retrieval functions is based on two kinds of assumptions: first, a certain form of representation for documents and requests, and second, additional simplifying assumptions that predefine the type of the retrieval function. Then we describe an approach for the development of optimum polynomial retrieval functions: request-document pairs (ƒ

l
, d
m

) are mapped onto description vectors
@@@@
(ƒ

l
, d
m

), and a polynomial function of the form

@@@@
T
· @@@@

(
@@@@
) is developed such that it yields estimates of the probability of relevance
P
(
R
|
@@@@
(ƒ

l
, d
m

)) with minimum square errors. We give experimental results for the application of this approach to documents with weighted indexing as well as to documents with complex representations. In contrast to other probabilistic models, our approach yields estimates of the actual probabilities, it can handle very complex representations of documents and requests, and it can be easily applied to multi-valued relevance scales. On the other hand, this approach is not suited to log-linear probabilistic models, and it needs large samples of relevance feedback data for its application.
TRAPEDS: producing traces for multicomputers via execution driven simulation
Authors: Stunkel C. B. , Fuchs W. K.
Published: January 2007

Trace-driven simulation is an important aid in performance analysis of computer systems. Capturing address traces for these simulations is a difficult problem for single processors and particularly for multicomputers. Even when existing trace methods can be used on multicomputers, the amount of collected data typically grows with the number of processors, so I/O and trace storage costs increase. A new technique is presented in this paper which modifies the executable code to dynamically collect the address trace from the user code and analyzes this trace during the execution of the program. This method helps resolve the I/O and storage problems and facilitates parallel analysis of the address trace. If a trace stored on disk is desired, the generated trace information can also be written to files during execution, with a resultant drop in program execution speed. An initial implementation on the Intel iPSC/2 hypercube multicomputer is detailed, and sample simulation results are presented. The effect of this trace collection method on execution time is illustrated.
Evaluation of retransmission strategies in a local area network environment
Authors: Mukherjee A. , Landweber L. H. , Strikwerda J. C.
Published: January 2007

We present an evaluation of retransmission strategies over local area networks. Expressions are derived for the expectation and the variance of the transmission time of the go-back-n and the selective repeat protocols in the presence of errors. These are compared to the expressions for blast with full retransmission on error (BFRE) derived by Zwaenepoel [Zwa 85]. We conclude that go-back-n performs almost as well as selective repeat and is very much simpler to implement while BFRE is stable only for a limited range of messages sizes and error rates. We also present a variant of BFRE which optimally checkpoints the transmission of a large message. This is shown to overcome the instability of ordinary BFRE. It has a simple state machine and seems to take full advantage of the low error rates of local area networks. We further investigate go-back-n by generalizing the analysis to an upper layer transport protocol, which is likely to encounter among other things,
variable
delays due to protocol overhead, multiple connections, process switches and operating system scheduling priorities.
Parallel simulation of queueing networks: limitations and potentials
Authors: Wagner D. B. , Lazowska E. D.
Published: January 2007

This paper concerns the parallel simulation of queueing network models (QNMs) using the conservative (Chandy-Misra) paradigm. Most empirical studies of conservative parallel simulation have used QNMs as benchmarks. For the most part, these studies concluded that the conservative paradigm is unsuitable for speeding up the simulation of QNMs, or that it is only suitable for simulating a very limited subclass of these models (e.g., those containing only FCFS servers). In this paper we argue that these are unnecessarily pessimistic conclusions. On the one hand, we show that the structure of some QNMs inherently limits the attainable simulation speedup. On the other hand, we show that QNMs without such limitations can be efficiently simulated using some recently introduced implementation techniques.

We present an analytic method for determining an upper bound on speedup, and use this method to identify QNM structures that will exhibit poor simulation performance. We then survey a number of promising implementation techniques, some of which are quite general in nature and others of which apply specifically to QNMs. We show how to extend the latter to a larger class of service disciplines than had been considered previously.
An approximation to the response time for shortest queue routing
Authors: Nelson R. D. , Philips T. K.
Published: January 2007

In this paper we derive an approximation for the mean response time of a multiple queue system in which shortest queue routing is used. We assume there are
Κ
identical queues with infinite capacity and service times that are exponentially distributed. Arrivals of jobs to this system are Poisson and are routed to a queue of minimal length. We develop an approximation which is based on both theoretical and experimental considerations and, for
Κ
≤ 8, has an relative error of less than one half of one percent when compared to simulation. For
Κ
= 16, the relative error is still acceptable, being less than 2 percent. An application to a model of parallel processing and a comparison of static and dynamic load balancing schemes are presented.
Microprogramming instruction systolic arrays
Authors: Lenders P. M. , Schröder H. , Strazdins P.
Published: January 2007

The
instruction systolic array
(ISA) is a programmable parallel architecture suitable for VLSI implementation. This paper presents a generalization of the ISA, called the
microprogrammed
ISA, which uses simple microprogramming techniques. Microprogrammed ISAs use
dynamic
microcodes whose length and contents are tailor made to the current program to be executed, and this can be efficiently implemented in VLSI. Here, microprogramming has the novel advantage of extending the range of algorithms that can be implemented on a given ISA. In particular, microprogramming can extend an ISA's effective communication abilities. Also, the reduction of the
program input bandwidth
(and pinout) afforded by microprogramming is even more important on large-scale MIMD architectures, such as the ISA. This paper also presents a weakest precondition semantics for the (microprogrammed) ISA model, which provides a means for verifying microprogrammed ISA programs. The semantics is modeled at the micro level, and has potential in the optimization of the microcodes of ISA programs.
Peephole optimization as a targeting and coupling tool
Authors: Allan V. H.
Published: January 2007

The term
peephole optimization
is used to mean the pattern matching and conditional replacement performed on small sections of the intermediate form.

The circular dependence between the code generation phases implies that local optimals are rarely global optimals. There are several reactions: (1) accept the local optimal, (2) develop intermediate goals whose achievement suggest global optimality, (3) retain the choices so that the decisions can be made later, (4) optimize the object code by replacing awkward or overly constrained segments of code with improved ones. Optimizing the object code has several advantages. First, code generation is greatly simplified. The code generator is allowed to forgo case analysis and utilize only a subset of the machine's instructions and addressing modes [BD88,DF84a,DF84b,DF87]. Second, a phase ordering problem often encountered in optimizations is reduced.
Information structures in language directed architectures
Authors: Katti R. , Manwaring L.
Published: January 2007

Only recently has the design of computer architectures deviated from the Von Neumann style. Most architectures based on the Von Neumann architecture suffer from what is called 'the semantic gap'. This means that the objects and operations in a high level language (HLL) are not closely related to the objects and operations in the architectures that execute the HLL [1]. This paper addresses the issues involved in the semantic gap problem, by formulating a framework based on 'information structures' that would aid in the design of HLL architectures. First digital computers are defined based on 'information structures'. Execution of a program in an HLL is defined in terms of transformations on information structures. An architecture design methodology is proposed and some comments about performance are made. Finally different ways of implementing information structures are considered.
On reordering instruction streams for pipelined computers
Authors: Shieh J.-J. , Papachristou C.
Published: January 2007

This paper describes a method to reorder the straight line instruction streams for pipelined computers which have one instruction issue unit but may contain multiple function units. The objective is to make the most efficient usage of the pipelines within the computer system. The input to the scheduler is the intermediate code of a compiler, and is represented by a data dependence graph (DDG).

The scheduler is a kind of list scheduler. The data dependence and the pipeline effect of the function units within the system have been considered for finding a most suitable time slot for each node during reordering time.

The scheduler has been implemented and several scientific application programs have been tested. The results show that in most of the cases the scheduler will achieve the optimal result. The average instruction issue rate is over 96%. As a comparison, the issue rate of an ordinary compiler is only 22%; and the issue rate of a compiler with the effect of pipeline but without reordering the instruction stream is about 45%.
Applying data mining to intrusion detection
Authors: Lee Wenke
Published: January 2007

Intrusion detection is an essential component of the layered computer security mechanisms. It requires accurate and efficient models for analyzing a large amount of system and network audit data. This paper is an overview of our research in applying data mining techniques to build intrusion detection models. We describe a framework for mining patterns from system and network audit data, and constructing features according to analysis of intrusion patterns. We discuss approaches for improving the run-time efficiency as well as the credibility of detection models. We report the ideas, algorithms, and prototype systems we have developed, and discuss open research problems.
A perspective on inductive databases
Authors: De Raedt Luc
Published: January 2007

Inductive databases tightly integrate databases with data mining. The key ideas are that data and patterns (or models) are handled in the same way and that an inductive query language allows the user to query and manipulate the patterns (or models) of interest.This paper proposes a simple and abstract model for inductive databases. We describe the basic formalism, a simple but fairly powerful inductive query language, some basics of reasoning for query optimization, and discuss some memory organization and implementation issues.
The true lift model
Authors: Lo Victor S. Y.
Published: January 2007

In database marketing, data mining has been used extensively to find the optimal customer targets so as to maximize return on investment. In particular, using marketing campaign data, models are typically developed to identify characteristics of customers who are most likely to respond. While these models are helpful in identifying the likely responders, they may be targeting customers who have decided to take the desirable action or not regardless of whether they receive the campaign contact (e.g. mail, call). Based on many years of business experience, we identify the appropriate business objective and its associated mathematical objective function. We point out that the current approach is not directly designed to solve the appropriate business objective. We then propose a new methodology to identify the customers whose decisions will be positively influenced by campaigns. The proposed methodology is easy to implement and can be used in conjunction with most commonly used supervised learning algorithms. An example using simulated data is used to illustrate the proposed methodology. This paper may provide the database marketing industry with a simple but significant methodological improvement and open a new area for further research and development.
One class SVM for yeast regulation prediction
Authors: Kowalczyk Adam , Raskutti Bhavani
Published: January 2007

In this paper, we outline the main steps leading to the development of the winning solution for Task 2 of KDD Cup 2002 (Yeast Gene Regulation Prediction). Our unusual solution was a pair of linear classifiers in high dimensional space (∼14,000), developed with just 38 and 84 training examples, respectively, all belonging to the target class only. The classifiers were built using the support vector machine approach outlined in the paper.
Predicting the effects of gene deletion
Authors: Vogel David S. , Axelrod Randy C.
Published: January 2007

In this paper, we describe techniques that can be used to predict the effects of gene deletion. We will focus mainly on the creation of predictive variables, and then briefly discuss different modeling techniques that have been used successfully on this data.
MDM/KDD2002
Authors: Simoff Simeon J. , Djeraba Chabane , Zaïane Osmar R.
Published: January 2007

This report presents a brief overview of multimedia data mining and the corresponding workshop series at ACM SIGKDD conference series on data mining and knowledge discovery. It summarizes the presentations, conclusions and directions for future work that were discussed during the 3
rd
edition of the International Workshop on Multimedia Data Mining, conducted in conjunction with KDD-2002 in Edmonton, Alberta, Canada.
WEBKDD 2002
Authors: Masand Brij M. , Spiliopoulou Myra , Srivastava Jaideep , Zaiane Osmar R.
Published: January 2007

In this paper, we provide a summary of the WEBKDD 2002 workshop, whose theme was 'Web Mining for Usage Patterns and Profiles'. This workshop was held in conjunction with the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2002).
Prophesy
Authors: Taylor Valerie , Wu Xingfu , Stevens Rick
Published: January 2007

Performance is an important issue with any application, especially grid applications. Efficient execution of applications requires insight into how the system features impact the performance of the applications. This insight generally results from significant experimental analysis and possibly the development of performance models. This paper present the Prophesy system, for which the novel component is the model development. In particular, this paper discusses the use of our
coupling parameter
(i.e., a metric that attempts to quantify the interaction between kernels that compose an application) to develop application models. We discuss how this modeling technique can be used in the analysis of grid applications.
Combining active and passive network measurements to build scalable monitoring systems on the grid
Authors: Lowekamp Bruce B.
Published: January 2007

Because the network provides the wires that connect a grid, understanding the performance provided by a network is crucial to achieving satisfactory performance from many grid applications. Monitoring the network to predict its performance for applications is an effective solution, but the costs and scalability challenges of actively injecting measurement traffic, as well as the information access and accuracy challenges of using passively collected measurements, complicate the problem of developing a monitoring solution for a global grid. This paper is a preliminary report on the Wren project, which is focused on developing scalable solutions for network performance monitoring. By combining active and passive monitoring techniques, Wren is able to reduce the need for invasive measurements of the network without sacrificing measurement accuracy on either the WAN or LAN levels. Specifically, we present topology-based steering, which dramatically reduces the number of measurements taken for a system by using passively acquired topology and utilization to select the bottleneck links that require active bandwidth probing. Furthermore, by using passive measurements while an application is running and active measurements when none is running, we preserve our ability to offer accurate, timely predictions of network performance, while eliminating additional invasive measurements.
Experiences with predicting resource performance on-line in computational grid settings
Authors: Wolski Rich
Published: January 2007

In this paper, we describe methods for predicting the performance of Computational Grid resources (machines, networks, storage systems, etc.) using computationally inexpensive statistical techniques. The predictions generated in this manner are intended to support adaptive application scheduling in Grid settings, and on-line fault detection. Wedescribe a mixture-of-experts approach to non-parametric, univariate time-series forecasting, and detail the effectiveness of the approach using example data gathered from "production" (i.e. non-experimental) Computational Grid installations.
U.S. versus European web searching trends
Authors: Spink Amanda , Ozmutlu Seda , Ozmutlu Huseyin C. , Jansen Bernard J
Published: January 2007

As the Web is becoming a worldwide phenomenon we need to understand what searching trends are emerging across different global regions. Are there regional differences in Web searching? What are the differences between searching by the United States population compared to Europeans? As part of a body of research studying these questions, we have analyzed two data sets culled from more than one million queries submitted by more than 200,000 users of the Excite Web search engine collected in May 2001 and the FAST Web search engine (All theWeb.com), collected in February 2001.We compare the searching behavior of largely European FAST Web search engine users (mostly German) with Excite Web search engine users who are largely U.S. This comparative study shows differences in Web searching by U.S. and European users. Specifically, the results suggest some differences in the topics searched and searching behaviors.
Using complete K-trees to generate code in Pascal for an expert system
Authors: Schwartz Edward N.
Published: January 2007

For the past several years, my colleagues and I have been doing work with expert systems and the representation of the knowledge in those systems. We have previously reported on the effectiveness of K-trees, an implementation independent method of knowledge representation, in all of the stages of expert system development. We use K-trees for obtaining and recording heuristics, ordering rules, translating rules into an expert system using a shell, and for documenting the system.
Generalization of the language version determination problem
Authors: Wong K. C.
Published: January 2007

In this paper, we generalize the language version determination problem by relaxing the assumption of version subset relationship. The search algorithms proposed for the generalized problem involve constant search time using a hash table to implement the search for language versions. The hash table stores version features and their corresponding versions containing them. Maintaining the hash table is done by inserting newly developed versions in the version lists corresponding to those features newly added and those contained in the versions from which the new versions are developed, excluding the features being deleted.
Comparing the speed of programs for sparse polynomial multiplication
Authors: Fateman Richard
Published: January 2007

How should one design and implement a program for the multiplication of sparse polynomials? This is a simple question, necessarily addressed by the builders of any computer algebra system (CAS). To examine a few options we start with a single easily-stated computation which we believe represents a useful benchmark of "medium difficulty" for CAS designs. We describe a number of design options and their effects on performance. We also examine the performance of a variety of commercial and freely-distributed systems. Important considerations include the cost of high-precision (exact) integer arithmetic and the effective use of cache memory.
CrossFlow
Authors: Hoffner Y. , Ludwig H. , Grefen P. , Aberer K.
Published: January 2007

The CrossFlow architecture provides support for cross-organisational workflow management in dynamically established virtual enterprises. The creation of a business relationship between a service provider organisation performing a service on behalf of a consumer organisation can be made dynamic when augmented by virtual market technology, the dynamic configuration of the contract enactment infrastructures, and the provision of fine-grained service monitoring and control.Standard ways of describing services and contracts can be combined with matchmaking technology to create a virtual market for such service provision and consumption. A provider can then advertise its services in the market and consumers can search for a compatible business partner. This provides choice in selecting a partner and allows the deferment of the decision to a point in time where it can be made on the most up-to-date requirements of the consumer and service offers in the market. The penalty for deferred decision making is the time to set up the infrastructure in each organisation for the dynamically established contract. Thus, a further aspect of CrossFlow was to exploit the contract in the dynamic and automatic configuration of the contract enactment and supervision infrastructures of the respective organisations and in linking them in a dynamic fashion. The electronic contract, which results from the agreement between the newly established business partners, completely specifies the intended collaboration between them. This includes fine-grained monitoring and control to allow tight co-operation between the organisations.
Conference report
Authors: Pennock David M.
Published: January 2007

The second Association for Computing Machinery (ACM) Conference on Electronic Commerce (EC'00)--held October 17-20, 2000, in Minneapolis, Minnesota, USA--featured twenty-nine talks chronicling the latest progress on research at the boundary between computers and commerce. Other conference highlights included four tutorials covering ecommerce foundations, recommender systems, scaling for ebusiness, and mobile ecommerce; a keynote address by Robert Weber; and a panel discussion on the results of a recent trading agent competition.
Agent mediated electronic commerce research at Hewlett Packard Labs, Bristol
Authors: Preist Chris
Published: January 2007

Agent technology is a key enabling component in bringing about Hewlett-Packard e-services vision, and for that reason, HP Labs is making significant investments in research in this area. Work on agent technology at HP labs includes agent-mediated B2B e-commerce, distributed agent-based personalization, agent-based trading of Internet bandwidth, automated auction design, mobile agents, user profiling and FIPA standardization activities, among other things. In this article, we describe our work on Agent-mediated B2B e-commerce. We do that based on the lifecycle of a B2B interaction in which the contract plays a fundamental role. The lifecycle comprises the stages of matchmaking, negotiation, contract formation and contract fulfillment. We highlight our research in each of these areas and in service composition.
Conference report
Authors: Parkes David C.
Published: January 2007

The 3rd ACM Conference on Electronic Commerce (EC'01) took place in Tampa, Florida, from October 14th until October 17th, 2001. The conference contained 35 research papers in topics at the interface between computer science, economics, commerce and law. The 2001 Trading Agent Competition (TAC) was also associated with the conference. This report summarizes the program.
Price issues in delivering E-content on-demand
Authors: Jagannathan Srinivasan , Almeroth Kevin C.
Published: January 2007

The explosive increase in Internet bandwidth and usage opens a vista of opportunities to sell multimedia-rich software and services using the Internet. Once e-content is created, the cost of replication is negligible. Customers can download the e-content immediately after online transactions. Alternately, the content provider can stream the content to the customers. A sound business model is necessary for the success of such an enterprise. In this paper, we examine the determinants of revenue for an Internet based on-demand content delivery service. The determinants of revenue are: transaction model, pricing strategy, customer behavior, distribution resources, and competition. We briefly describe each of these factors and discuss how they relate to revenue. Our belief is that by better understanding how these factors affect revenue, content providers can develop services that generate more revenue while also being more compelling to users.
The usability of electronic stores based on the organization of information and features
Authors: Chan Kah-Sing
Published: January 2007

This paper describes an investigation on how the perceived usability of electronic stores is affected by the organization of information and features. An experiment was developed to measure the perceived usability of a sample of electronic stores. This allowed for systematic comparison of information items and features between "high usability" and "low usability" stores. Within the sample of electronic stores tested, there were evidences that the perceived usability of an electronic store is affected by its organization of information and features. This suggests that it is timely to eliminate inconsistent store design as a factor contributing to the consumers' negative perception of electronic retailing. This usability testing approach can provide the basis for developing usable electronic store systems.
A survey of data mining and knowledge discovery software tools
Authors: Goebel Michael , Gruenwald Le
Published: January 2007

Knowledge discovery in databases is a rapidly growing field, whose development is driven by strong research interests as well as urgent practical, social, and economical needs. While the last few years knowledge discovery tools have been used mainly in research environments, sophisticated software products are now rapidly emerging. In this paper, we provide an overview of common knowledge discovery tasks and approaches to solve these tasks. We propose a feature classification scheme that can be used to study knowledge and data mining software. This scheme is based on the software's general characteristics, database connectivity, and data mining characteristics. We then apply our feature classification scheme to investigate 43 software products, which are either research prototypes or commercially available. Finally, we specify features that we consider important for knowledge discovery software to possess in order to accommodate its users effectively, as well as issues that are either not addressed or insufficiently solved yet.
Discovering Matrix Attachment Regions (MARs) in genomic databases
Authors: Singh Gautam B.
Published: January 2007

Lately, there has been considerable interest in applying Data Mining techniques to scientific and data analysis problems in bioinformatics. Data mining research is being fueled by novel application areas that are helping the development of newer applied algorithms in the field of bioinformatics, an emerging discipline representing the integration of biological and information sciences. This is a shift in paradigm from the earlier and the continuing data mining efforts in marketing research and support for business intelligence. The problem described in this paper is along a new dimension in DNA sequence analysis research and supplements the previously studied stochastic models for evolution and variability. The discovery of novel patterns from genetic databases as described is quite significant because biological pattern play an important role in a large variety of cellular processes and constitute the basis for gene therapy. Biological databases containing the genetic codes from a wide variety of organisms, including humans, have continued their exponential growth over the last decade. At the time of this writing, the GenBank database contains over 300 million sequences and over 2.5 billion characters of sequenced nucleotides. The focus of this paper is on developing a general data mining algorithm for discovering regions of locus control, i.e. those regions that are instrumental for activating genes. One type of such elements of locus control are the MARs or the Matrix Association Regions. Our limited knowledge about MARs has hampered their detection using classical pattern recognition techniques. Consequently, their detection is formulated by utilizing a statistical
interestingness
measure derived from a set of empirical features that are known to be associated with MARs. This paper presents a systematic approach for finding associations between such empirical features in genomic sequences, and for utilizing this knowledge in detecting biologically interesting control signals, such as MARs. This computational MAR discovery tool is implemented as a web-based software called
MAR-Wiz
and is available for public access. As our knowledge about the living system continues to evolve, and as the biological databases continue to grow, a pattern learning methodology similar to that described in this paper will be significant for the detection of regulatory signals embedded in genomic sequences.
A note on "beyond market baskets
Authors: Ahmed Khalil M. , El-Makky Nagwa M. , Taha Yousry
Published: January 2007

In their paper [1], S. Brin, R. Matwani and C. Silverstien discussed measuring significance of (generalized) association rules via the support and the chi-squared test for correlation. They provided some illustrative examples and pointed that the chi-squared test needs to be agumented by a measure of interest that they also suggested.This paper presents a further elaboration and extension of their discussion. As suggested by Brin et al, the chi-squared test succeeds in measuring the cell dependencies in a 2x2 contingency table. However, it can be misleading in cases of bigger contingency tables. We will give some illustrative examples based on those presented in [1]. We will also propose a more appropriate reliability measure of association rules.
Artificial neural networks
Authors: Roy Asim
Published: January 2007

This article points out some very serious misconceptions about the brain in connectionism and artificial neural networks. Some of the connectionist ideas have been shown to have logical flaws, while others are inconsistent with some commonly observed human learning processes and behavior. For example, the connectionist ideas have absolutely no provision for learning from stored information, something that humans do all the time. The article also argues that there is definitely a need for some new ideas about the internal mechanisms of the brain. It points out that a very convincing argument can be made for a "control theoretic" approach to understanding the brain. A "control theoretic" approach is actually used in all connectionist and neural network algorithms and it can also be justified from recent neurobiological evidence. A control theoretic approach proposes that there are subsystems within the brain that control other subsystems. Hence a similar approach can be taken in constructing learning algorithms and other intelligent systems.
Data snooping, dredging and fishing
Authors: Jensen David
Published: January 2007

This article briefly describes a panel discussion at SIGKDD99.