bluuebunny/crossref_metadata_2025 huggingface dataset:
The standards factor
Authors: Meads J.
Published: January 2007

I don't have any news to report this time around. It isn't necessarily that nothing is happening---it's just that I haven't heard about it. Keeping track of what is happening in the standards arena is major effort and the time available to me for this during the past few months has been minimal.
Development and evaluation of direct manipulation lists (poster session)
Authors: Beck D. , Elkerton J.
Published: January 2007

Item selection from a large list is an important task in many interfaces. This research examined a direct manipulation list for browsing and retrieving information. With direct manipulation lists several different retrieval methods can be considered such as scrolling, paging, using string search methods, or using an "elevator". The question asked was which retrieval methods would lead to fast and efficient retrieval for different list lengths and levels of user familiarity with the lists. A 3 x 2 between-subjects factorial design was used with list sizes of 25, 50, and 100 items and users who were either familiar or unfamiliar with the lists. In this experiment, only use of an elevator and paging were studied due to the common use of elevators in many state-of-the-art interfaces and an initial experiment which showed that scrolling was not an efficient method. The results showed that the list size and user familiarity with the list were both significant factors in the retrieval time. A more detailed analysis of retrieval performance revealed that these effects could have been influenced by users having difficulty estimating the position of an item. Moreover, users in the middle of a list tended to use a single method (such as paging), despite the predicted and observed efficiency of using both paging and the elevator. Based upon these results, a new method for direct manipulation is proposed which separates the elevator into regions with specified ranges of items so that the user knows where items are in the list. A task analysis of this method shows promise in ease of use as compared to other methods.
Producing a Regional Network Newsletter
Authors: McGregor Patricia
Published: January 2007

The Merit Network News (MNN) is a free, quarterly publication of the Merit Computer Network, a regional network based in Michigan. Merit serves the user communities at the Michigan state-supported colleges and universities, as well as a large base of commercial and governmental users for these institutions.Like the computing newsletters at most schools and institutions, the MNN faces the challenge of presenting useful information to users with a wide range of knowledge and interests. In the four years the newsletter has been published, it has grown from a four-page flyer to a twelve-to-sixteen page newsletter. Like most other house organs, it carries announcements of new services, access and consulting information, and informative features on new technology. The rapid changes in technology and user needs present challenges in presentation and timeliness.Unlike computing center newsletters, however, the MNN faces difficulties due to its distributed audience. It has a circulation of 23,000, most of which are bundled in with the newsletters at the Merit member universities. Articles are begged or drafted from writers and consultants at other schools, as well as from the Merit staff, and those articles are generally received and published entirely electronically. The political situation requires that something about each school should appear on a regular basis, but the large number of users coming into the network from the world outside Michigan make it important that we keep the newsletter from becoming too focused on Michigan. Changes in access methods, charging, and hosts challenge the staff to keep the users up-to-date.In this article, philosophy, production, and methods of generating articles are discussed, as well as the special problems of a regional network publication. Problems and solutions are explained, and the close relationship between the consulting staff and the newsletter is explored.
Using video to prototype user interfaces
Authors: Vertelney L.
Published: January 2007

The Human Interface Group at Apple Computer uses video as a design tool to prototype and visualize ideas about how computers will be used in the future. This paper is for people who need to build visualizations of user interfaces that don't yet exist. It describes how to create effective interface simulations using animation and video techniques. The advantages and disadvantages of video as a user interface design and prototyping medium are also explored.
A note on the numerical evaluation of arctangent function
Authors: Moritsugu S. , Matsumoto M.
Published: January 2007

This paper describes the problem of selection of an appropriate branch of multiple-valued functions. Real-valued arctangent function over real number filed is considered as an example. It is discussed how to select FORTRAN functions "ATAN" and "ATAN2', and how to evaluate the formula [arctan [EQUATION]. Minute post-conditioning is required for transferring the result of computer algebra to numerical computation.
Summary of the international seminar on parallel processing systems
Authors: Das S. R.
Published: January 2007

I had the opportunity of participating as an
author
of contributed papers, as an
invited lecturer
, and as a
Session Chairperson
at the Fourth National Convention of Computer Engineers -
Seminar on Parallel Processing Systems and their Applications
held at the Institution of Engineers (India), West Bengal State Center, Calcutta, India during December 9-11, 1988, and at the International Computer Symposium held at Tamkang University, Tamsui, Taiwan, Republic of China during December 15-17, 1988. In the following I will first endeavor to discuss some of the important aspects of the Fourth National Convention of Computer Engineers which will be succeeded by discussions on the various aspects of the International Computer Symposium.
Book Review: Approaches to Knowledge Representation - An Introduction. Edited by G. A. Ringland & D. A. Duce (Research Studies Press Ltd., John Wiley & Sons Inc.(
Authors: Ross Simon
Published: January 2007

This collection is entirely edited and authored by members of the Knowledge Based Systems Group, Informatics Division of the Rutherford Appleton Laboratory, Didcot, UK, a research Institute funded by the Science & and Engineering Research Council. As such it is an entirely British collection which provides an introductory text with a slightly different viewpoint as nearly all contributions to the field have been of North American origin (at least this is the impression one gets from other texts).
Book review: Readings in Distributed Artificial Intelligence. Ed by A. H. Bond and L. Gasser (Morgan Kaufmann, 1988)
Authors: Van Dyke Parunak H.
Published: January 2007

New sciences often begin as cliques of closely-coupled researchers. Precisely because the work is new, there are no journals focused on it, and the growing body of insights appears in privately circulated working papers and publications in the organs of disciplines only tangentially related to the central focus of the emerging field. This process has several results.
An efficient implemenatation of string pattern matching machines for a finite number of keywords
Authors: Aoe J. I.
Published: January 2007

This paper describes a method of implementing a static transition table of a string pattern matching machine to locate all occurrences of a finite number of keywords in a text string. The scheme combines the fast access of an array representation with the compactness of a list structure. Each transition can be computed from the present data structure in O(1) time and the storage is as small as the list structure. The construction and pattern matching programs associated with the present data structure are provided and the efficiency is evaluated by a empirical results.
Partial order maintenance
Authors: Collin C. , Levinson R.
Published: January 2007

In this paper we show how to maintain a partially-ordered hierarchy of patterns by subpattern-of for efficient associative retrieval. The techniques described here are most applicable for databases of complex data structures such as graphs or matrices as opposed to simple data structures such as relations, sets, lists or frames that are seen in most information retrieval systems. Any representation scheme for the patterns in the database may be used as long as the user provides the system with the function that compares two patterns in the representation scheme and determines if one pattern is a subpattern of the other, if the patterns are identical or the patterns are incomparable. The user also provides utilities for reading and writing the patterns.
User defined data types in APL2
Authors: Benkard J. P. , Brown J. A.
Published: January 2007

This paper is an investigation of possible definitions of new enclose-like functions, their impact on the
APL
2 language, and their usefulness in applications. Several variants of enclose have been proposed over the years that range from data structure primitives to data type producing primitives. Operator analogues of enclose can be used to create functions that pervade structures and types in different ways. Defined operators can implement type hierarchy and respond to fill items in prototype execution by referring to tables of type characteristics.
Neural network model of serial learning
Authors: Broadbent H. A. , Lucas J.
Published: January 2007

A brief introduction to neural networks is given, and correspondences between the elements of such networks and the primitive objects of APL are indicated. A neural network model is presented for simulating serial learning, the ability of an animal to respond in a prescribed sequence to an array of stimuli presented simultaneously. The particular network presented is intended to model stimulus-response (s-r) chaining, a behaviorist theory of serial learning. Some results obtained from running the network are discussed.
An empirical study of the performance of the APL370 compiler
Authors: Ching W.-M. , Nelson R. , Shi N.
Published: January 2007

The performance of a compiler is usually measured in terms of the execution efficiency of compiled code and the speed of compilation. For an APL compiler, we are also concerned about its relative performance with respect to the interpreter: C/I, the ratio of the speed of compiled code over interpretation. We give performance data on 4 groups of examples of moderate size: i) scalar style code where an interpreter does poorly and the C/I ratio is very high, ii) good APL style code where interpreter still does poorly due to inherent iterativeness or recursion, and the C/I ratio is high, and iii) good APL style code where the interpreter is very efficient on large data, and the C/I ratio is low, and iv) some particular primitives. These examples include neural net simulation, machine simulation, network routing, signal processing and mathematical computations. The APL370 compiler not only speeds up applications of iterative nature, but also gives good performance to codes utilizing APL's strength such as boolean selection and boolean data manipulation.
An APL-tutoring adventure game
Authors: Geyer-Schulz A. , Taudes A. , Mitlöhner J.
Published: January 2007

This paper is concerned with the development of a program system that assists the teaching of APL2. Rather than presenting the teaching material in a book-like sequential manner, we would like to embed the learning component in an object oriented adventure game environment written itself in APL2. The game's actors, objects and places, which are implemented as hierarchical classes of communicating automata, can be freely defined, using a "game definition language". The game is driven by a game simulator.The teaching aspect is integrated as follows: The adventurer/student is a specific actor who is presented with a number of exercises that are selected by "teachers", another special class of actors, on the basis of the APL2-knowledge obtained by the student so far. The solutions entered into the system are analysed by the teachers, who use an LR(1)-parser generator and "critic programs" to give advice on proper APL2-programming.
A future APL: examples and problems
Authors: Gfeffer M.
Published: January 2007

AIDA is a modern APL featuring operator-less syntax, function attributes, function arrays, array parts and a hierarchical object library. The above areas are illustrated by examples on a model interpreter written in SHARP APL®. The relation of the AIDA extensions to APL application systems design is discussed and some problem areas requiring further thought are identified.
APL for music
Authors: Jordan S.
Published: January 2007

"APL For MUSIC" is a multi-faceted computer music system currently under development. Its present capabilities include computer-assisted music instruction, algorithmic composition, granular synthesis, MIDI score-editing, and music theory and analysis. All these types of software are represented to some degree in currently available commercial systems, but the advantages of APL For MUSIC over other systems include powerful integration of system modules, access to the program's internals, and the power and fun of APL.
The benefits and advantages of APL
Authors: Julio D. , Mosland J.
Published: January 2007

Dominique Julio and Joël Mosland have been working for the last ten years in the research department of the Personnel Management of UAP (Union des Assurances de Paris). They use APL for several applications: prototyping, definition and testing of simulation models.This article defines an application whose major characteristic is the interfacing of several computer systems. These systems existed before in UAP and had to be rapidly interconnected, with limited human and financial resources. The choice fell very rapidly on APL, given its ease of development and maintenance.
The structure and content of APL data
Authors: Landaeta D.
Published: January 2007

The complementary data attributes of structure and content are analyzed. Two special classes of functions, structural and pervasive, are defined in terms of their actions on these attributes. As an application of the definitions, a proposal is made for a modification to the nature of fill items and empty arrays.
An APL approach to differential calculus yields a powerful tool
Authors: Neidinger R. D.
Published: January 2007

An APL workspace is developed for the purpose of calculating numerical values of derivatives. The heart of the method, called automatic differentiation, is manipulation of numerical vectors --- an APL way of thinking. The method is not symbolic manipulation as taught in calculus, nor is it approximation as taught in numerical analysis. Automatic differentiation is implemented as a workspace (called GRADIENT) of 14 simple, one-line, numerical vector functions that perform all of the formal differentiation rules. The ideas are introduced for simple first derivatives of single variable functions. We then show that the GRADIENT workspace enables the calculation of all first-order partial derivatives of any typical function in any number of variables. This workspace is used as a tool in the solution of systems of nonlinear equations by Newton's method. Finally, we discuss how APL concepts led to a new approach to higher-order derivatives. This approach enables the calculation of higher-order derivatives for problems that overwhelm commercial symbolic differentiation programs; moreover, the resulting accuracy cannot be obtained by numerical approximation techniques.
APL as a tool for computations in growth studies
Authors: Nummi T.
Published: January 2007

The aim of this paper is to introduce some computational ideas for carrying out the multivariate growth curve analysis. In longitudinal studies missing data is often involved. Therefore handling of incomplete data is an important part of the analysis. Here we introduce a technique for estimating growth curve parameters based on the least squares approach. It was shown that many computational problems in growth curve analysis can be solved easily using APL.
Making APL error messages kinder and gentler
Authors: Shaw W. J.
Published: January 2007

Emulating the overall design of APL, the error messages generated by APL interpreters are formal and succinct. Because of this one gets the feeling the interpreter is not telling all that it knows. It is urged that error messages be made more revealing, and, hence, more user-friendly.
Design of a browsing interface for information retrieval
Authors: Godin R. , Pichet C. , Gecsei J.
Published: January 2007

In conventional Boolean retrieval systems, users have difficulty controlling the amount of output obtained from a given query. This paper describes the design of a user interface which permits gradual enlargement or refinement of the user's query by browsing through a graph of term and document subsets. This graph is obtained from a lattice automatically generated from the usual document-term relation. The major design features of the proposed interface are the integration of menu, fill-in the blank and direct manipulation modes of interaction within the “fisheye view” [Furnas, 1986] paradigm. A prototype user interface incorporating some of these ideas has been implemented on a microcomputer.

The resulting interface is well adapted to various kinds of users and needs. More experienced users with a particular subject in mind can directly specify a query which results into a jump to a particular vertex in the graph. From there, the user can refine his initial query by browsing through the graph from that point on. On the other hand, casual users without any prior knowledge of the contents of the system or users without any particular subject in mind can freely navigate through the graph without ever specifying any query.
Bounding availability of repairable computer systems
Authors: Muntz R. R. , de Souza e Silva E. , Goyal A.
Published: January 2007

Markov models are widely used for the analysis of availability of computer/communication systems. Realistic models often involve state space cardinalities that are so large that it is impractical to generate the transition rate matrix let alone solve for availability measures. Various state space reduction methods have been developed, particularly for transient analysis. In this paper we present an approximation technique for determining steady state availability. Of particular interest is that the method also provides bounds on the error. Examples are given to illustrate the method.
Performance of a dual-bus unidirectional broadcast network operating under probabilistic scheduling strategy
Authors: Mukherjee B.
Published: January 2007

Recent advances in fiber optic technology (viz. its promise to provide information-carrying capacity in the Gpbs range over long repeater-free distances) has triggered tremendous activity in the study of unidirectional
bus networks
(because signal flow in the fiber is unidirectional). A popular network structure that has received significant attention is the
Dual-bus Unidirectional Broadcast System (DUBS) network topology
. Most of the access mechanism studied on this structure are based on round-robin scheduling (or some variation thereof). However since round-robin schemes suffer a loss of channel capacity because of their inter-round overhead (which can be significant for long high-speed buses), a probabilistic scheduling strategy, called

p
i

-persistent protocol, has recently been proposed and studied for single channel unidirectional bus systems. Our concern here is to apply this probabilistic scheduling strategy to each bus in DUBS, and study the corresponding network performance. In so doing, we allow stations to buffer multiple packets, represent a station's queue size by a Markov chain model, and employ an independence assumption. We find that the average packet delay is bounded and the maximum network throughput approaches two pkt/slot with increasing buffer size. Further, the protocol's performance is insensitive to bus characteristics, and it appears to be a particularly well suited for fiber-optic network application requiring long distances and high bandwidth. Simulation results, which verify the analytical model, are also included.
Data mining, national security, privacy and civil liberties
Authors: Thuraisingham Bhavani
Published: January 2007

In this paper, we describe the threats to privacy that can occur through data mining and then view the privacy problem as a variation of the inference problem in databases.
The inference problem
Authors: Farkas Csilla , Jajodia Sushil
Published: January 2007

Access control models protect sensitive data from unauthorized disclosure via direct accesses, however, they fail to prevent indirect accesses. Indirect data disclosure via inference channels occurs when sensitive information can be inferred from non-sensitive data and metadata. Inference channels are often low-bandwidth and complex; nevertheless, detection and removal of inference channels is necessary to guarantee data security. This paper presents a survey of the current and emerging research in data inference control and emphasizes the importance of targeting this so often overlooked problem during database security design.
Tools for privacy preserving distributed data mining
Authors: Clifton Chris , Kantarcioglu Murat , Vaidya Jaideep , Lin Xiaodong , Zhu Michael Y.
Published: January 2007

Privacy preserving mining of distributed data has numerous applications. Each application poses different constraints: What is meant by privacy, what are the desired results, how is the data distributed, what are the constraints on collaboration and cooperative computing, etc. We suggest that the solution to this is a
toolkit
of components that can be combined for specific privacy-preserving data mining applications. This paper presents some components of such a toolkit, and shows how they can be used to solve several privacy-preserving data mining problems.
Randomization in privacy preserving data mining
Authors: Evfimievski Alexandre
Published: January 2007

Suppose there are many clients, each having some personal information, and one server, which is interested only in aggregate, statistically significant, properties of this information. The clients can protect privacy of their data by perturbing it with a randomization algorithm and then submitting the randomized version. The randomization algorithm is chosen so that aggregate properties of the data can be recovered with sufficient precision, while individual entries are significantly distorted. How much distortion is needed to protect privacy can be determined using a privacy measure. Several possible privacy measures are known; finding the best measure is an open question. This paper presents some methods and results in randomization for numerical and categorical data, and discusses the issue of measuring privacy.
A survey on wavelet applications in data mining
Authors: Li Tao , Li Qi , Zhu Shenghuo , Ogihara Mitsunori
Published: January 2007

Recently there has been significant development in the use of wavelet methods in various data mining processes. However, there has been written no comprehensive survey available on the topic. The goal of this is paper to fill the void. First, the paper presents a high-level data-mining framework that reduces the overall process into smaller components. Then applications of wavelets for each component are reviewd. The paper concludes by discussing the impact of wavelets on data mining research and outlining potential future research directions and applications.
A machine learning approach for the curation of biomedical literature
Authors: Keerthi S. Sathiya , Ong Chong Jin , Siah Keng Boon , Lim David B. L. , Chu Wei , Shi Min , Edwin David S. , Menon Rakesh , Shen Lixiang , Lim Jonathan Y. K. , Loh Han Tong
Published: January 2007

In this paper, we present an automated text classification system for the classification of biomedical papers. This classification is based on whether there is experimental evidence for the expression of molecular gene products for specified genes within a given paper. The system performs pre-processing and data cleaning, followed by feature extraction from the raw text. It subsequently classifies the paper using the extracted features with a Naïve Bayes Classifier. Our approach has made it possible to classify (and curate) biomedical papers automatically, thus potentially saving considerable time and resources.
Automatic scientific text classification using local patterns
Authors: Ghanem Moustafa M. , Guo Yike , Lodhi Huma , Zhang Yong
Published: January 2007

In this paper, we describe our approach for addressing Task 1 in the KDD CUP 2002 competition. The approach is based on developing and using an improved automatic feature selection method in conjunction with traditional classifiers. The feature selection method used is based on capturing frequently occurring keyword combinations (or motifs) within short segments of the text of a document and has proved to produce more accurate classification results than approaches relying solely on using keyword-based features.
Do TREC web collections look like the web?
Authors: Soboroff Ian
Published: January 2007

We measure the WT10g test collection, used in the TREC-9 and TREC 2001 Web Tracks, and the .GOV test collection used in the TREC 2002 Web and Interactive Tracks, with common measures used in the web topology community, in order to see if these collections "look like" the web. This is not an idle question; characteristics of the web, such as power law relationships, diameter, and connected components have all been observed within the scope of general web crawls, constructed by blindly following links. The .GOV collection is a fairly straightforward 18GB crawl of sites in the .gov domain. In contrast, WT10g was carved out from a much larger crawl specifically to be a web search test collection within the reach of university researchers. Do such collections retain the properties of the larger web? In the case of WT10g and .GOV, yes.
Second edition of the "XML and information retrieval" workshop held at SIGIR'2002, Tampere, Finland, Aug 15
th
, 2002
Authors: Baeza-Yates Ricardo , Fuhr Norbert , Maarek Yoelle S.
Published: January 2007

The previous workshop on "XML and Information Retrieval" was held in the context of SIGIR'2000 (Athens, Greece) and showed that there is a serious interest in managing semi-structured data from an IR (i.e., unstructured) perspective rather than from the dominating database (i.e., structured) perspective. As a direct outcome of the workshop, a special JASIS issue on XML and IR was edited and published in March 2002. The topic is still in its prime both in the Academia, as evidenced by XML related papers presented at SIGIR'2001, and in the business world with more search engines adding "XML support" as a requirement.The purpose of this workshop was to continue the effort of applying an "IR approach" to XML search and retrieval. We believe that this approach is crucial to extending the role of XML from pure data exchange in business-to-business applications to actual information exchange in end-users facing and Knowledge Management applications. As a side issue, we also intended to ask the IR community how it should relate, if at all, to the XQuery initiative at W3C. The workshop included 3 presentation sessions, for a total of 8 reviewed papers, an invited talk and a panel. The workshop attracted an audience of more than 30 people, who were encouraged to interact with the speakers as well as the audience.
Report on ACM SIGIR workshop on mathematical/formal methods in information retrieval
Authors: Dominich Sandor , Lalmas Mounia , van Rijsbergen C. J. "Keith"
Published: January 2007

The previous two MF/IR workshops (ACM SIGIR 2000 MF/IR 2000, Athens, Greece, and ACM SIGIR 2001 MF/IR 2001, New Orleans, USA) showed that the mathematical/formal results achieved in Information Retrieval (IR) could be organized into a coherent theoretical framework, that they brought new knowledge to IR, and that mathematical/formal research in IR can stand as a specialized research area of IR. Therefore the purpose of the MF/IR 2002, which was the third in row, workshop was, on the one hand, to continue and enhance the results obtained so far, and on the other hand, to present, discuss, analyze, integrate the newer/newest results. MF/IR 2002 also aimed at promoting discussion and interaction among those with theoretical and applicative research interests in mathematical/formal aspects of Information Retrieval, and also at being a forum for the presentation of both theoretical and applicative results (e.g., foundational issues; description and/or integration of models; retrieval applications; mathematical/formal techniques, properties and structures in IR; existing and/or new theories and theoretical aspects).The following areas were addressed: Information Retrieval, Information Filtering, Information, Mining, Indexing and Retrieval, Hypermedia, World Wide Web Retrieval, Digital Libraries, Evaluation, Human Computer Interaction, User Modeling, Semantic Web and Ontologies, where the different entities involved (e.g., documents, queries, indexing, retrieval, relevance, effectiveness, users, etc.) were modeled using any of, but not necessarily limited to, the following approaches: Classical Sets, Fuzzy Sets, Rough Sets, Vectors, Linear Space, Similarity Functions, Probability, Theory of Uncertainty, Functional Analysis, Algebra, Topology, Metric Spaces, Euclidean Geometry, Non-Euclidean Geometries, Boolean Logic, Non-standard Logics, Fuzzy Logic, Quantum Logic, Matroid Theory, Graph Theory.
A survey of discrete event simulation and state-of-the-art discrete event languages
Authors: Pollacia Lissa F.
Published: January 2007

This paper provides an introduction to the main concepts of discrete event simulation and surveys the field of current discrete event simulation languages. Discrete event simulation is a modeling technique for the study of systems whose state may change only at discrete points in time. This type of modeling is applicable to many real-world problems, and a wide variety of languages have been developed for the purpose of modeling these situations. In this paper, a survey of current discrete event simulation languages is presented. The focus of the survey is on identifying new trends in simulation languages, such as extensions to general purpose programming languages, artificial intelligence concepts, special-purpose features, and graphics-based capabilities.
LOWSAS: a computer-aided analysis system for local warfare
Authors: Zhu Ming-Yaun , Bao Dong-Shan
Published: January 2007

This paper describes a local war simulation system called LOWSAS. The system design is based on an object-oriented approach called Battle/Force model and is implemented with programming language Ada.
A short note on results of testing two random number generators
Authors: Saur Joseph M.
Published: January 2007

Park and Miller argue for a minimal standard generator using the Lehmer model. Wichmann and Hill take a different track, and propose a three-tiered multiplicative model. In practice, real differences exist in their behavior, and this paper presents the results of some simple statistical testing and runtime comparisons. The results raise questions about the statistical behavior of the the Park and Miller minimal generator when creating random streams within a narrow range. The Wichmann and Hill generator produces statistically better results under the circumstances we tested, but takes approximately twice as long to run.
Dehumanized people and humanized programs: a natural language view of
being there
Authors: Fass Dan
Published: January 2007

The language used by Chance the gardener, the main character in Jerzy Kosinski's
Being There,
is uncannily like that of several well known natural language understanding systems: ELIZA, PARRY and SAM. This natural language understanding (NLU) view of Chance meshes remarkably well with literary criticism of the character and the book. In light of these resemblances, there is some (not-too-serious) discussion of how NLU systems might perform more intelligently, or at least might appear more intelligent.
The “Worm” programs—early experience with a distributed intelligence
Authors: Schwartz Edward N.
Published: January 2007

Following a mention in a recent article of our preliminary experiments on worm programs (Witten & Thimbleby, 1989), we have been deluged with enquiries about the progress of this research project. Although we had planned to wait until further concrete results were available before going to press, we feel obliged to satisfy curiosity by publishing some details of the research program now. Moreover, our lawyers have advised us that this step is advisable in order to forestall others who may plan to patent this new computational technique
Issues in wireless E-commerce
Authors: Tarasewich Peter , Warkentin Merrill
Published: January 2007

Mobile and wireless technologies continue to advance in terms of their capabilities and sophistication. There has been increasing emphasis on using these technologies as part of electronic commerce systems. But with this shift from wired to wireless e-commerce (also known as m-commerce) comes a new set of issues that needs to be evaluated. This paper explores some of the relevant technologies, applications, and issues in wireless e-commerce.
Integration of product ontologies for B2B marketplaces
Authors: Omelayenko Borys
Published: January 2007

B2B electronic marketplaces bring together many online suppliers and buyers. Each individual participant potentially can use his own format to represent the products in his product catalog, and these catalogs must be integrated together. Complicated products require knowledge-intensive descriptions, or ontologies, and catalog integration requires integration of product ontologies. The paper surveys the requirements for the integration listed by the industries and current state of the art in ontology integration tools. The survey creates a rough picture of the functionality of the future integration tools as required by the industries.
Internet based auctions
Authors: Vakali Athena , Angelis Lefteris , Pournara Dimitra
Published: January 2007

Web based auctions and negotiations have become quite popular due to their implementation and integration in electronic commerce applications. Online auctions have become an effective approach in the buying and selling process, employed in the rapidly emerging Internet-based electronic commerce platforms. The goal of this paper is to outline research efforts in relation to online Internet-based auctions modeling and applications. The key research topics in the area are identified and the paper focus on the issues of auction modeling, use of agents in Web-based auction implementations, auctions computational and combinatorial analysis as well as on security issues involved in online auctioning. The most popular implementations, applications and servers are also referenced and discussed.
The infonomics workshop on electronic market design
Authors: Feltkamp Vincent , Müller Rudolf
Published: January 2007

The Infonomics Workshop on Electronic Market Design took place in Maastricht, The Netherlands from July 11th until July 13th, 2001. The workshop contained 25 presentations about computational, economic, and game-theoretic aspects of electronic market design. This report summarizes the program.
Editor's note
Authors: Wurman Peter R.
Published: January 2007

Editor's Note: Welcome to Issue 3.2

This issue starts off with an article by Pier Luca Lanzi and Alessandro Strada in which they study the results of the second Trading Agent Competition (TAC-01). Through statistical analysis of the public data available about the competition, Lanzi and Strada are able to show that the TAC game qualitatively (but not quantitatively) succeeds at differentiating among agent strategies.

The second article, by Indrajit and Inkdrakshi Ray, provides a survey of results in the study of fair exchange models. Fair exchange mechanisms provide a means by which two parties involved in a transaction can be sure that (a) either both parties get their due, or neither do, or (b) evidence is collected to prove which party violated the contract.

The paper by Srinivasan Jagannathan and Kevin Almeroth presents an overview of some of the issues related to pricing digital content on the Internet. It is well known that building a business model based on the delivery of digital content is challenging because the marginal cost of delivering to one more customer tends to zero.

Finally, Kah-Sing Chan presents a study of the usability of electronic storefronts. The study is based on an analysis of the navigational organization of the web site and survey data collected from web site users. The findings suggest that retailers have a long way to go towards adopting proven, usable designs for their sites.

Enjoy,

Peter Wurman,
Editor-in-Chief
A taxonomy of indoor and outdoor positioning techniques for mobile location services
Authors: Zeimpekis Vasileios , Giaglis George M. , Lekakos George
Published: January 2007

Wireless positioning determination has received increased attention during the past few years. Several wireless applications have been envisaged when mobile terminal location can be determined with sufficient accuracy at any time. In this paper, we attempt to identify the various indoor and outdoor positioning techniques that can be used for the provision of mobile and wireless applications and services. In order to maximize the benefits of this research in the area of positioning technologies, we propose a novel taxonomy with detailed analysis and evaluation of these techniques based on the accuracy that is needed for various mobile location-based services.
Context representation of product data
Authors: Guo Jingzhi , Sun Chengzheng
Published: January 2007

This paper investigates the context representation of
ad hoc
product data that distribute in different semantic communities especially in small and medium sized enterprises through the analysis of the problems in extracting, mediating and comparing product contexts. The problem analysis leads to a proposal for a novel context representation model that separates the representation process into two steps: transform irregular local product definitions into canonical local product representations and map canonical local product representations onto common product representations. This model serves as the foundation to further compare product contexts between different semantic communities.
Exploring the factors affecting internet content filters acceptance
Authors: Ho Shuk Ying , Lui Siu Man
Published: January 2007

Data traveling along the Internet wire is generally unrestricted. The Internet may always bring surfers fun, but sometimes give them unpleasant experiences. Web surfers may be exposed to gory pictures of adult-oriented contents unwittingly. International organizations are working on content rating systems and software filters for the Internet. These tools empower the general public to understand the electronic media by means of the open and objective content labels. Though filters accompany some common browsers out of the box, they are disabled by default. As a result, the efforts spent by these organizations to protect users from Internet harms are wasted. This paper presents an exploratory study on one's acceptance of the Internet content filters in publicly accessed computers. Demographic factors, such as gender, and perception factors, such as severity of the Internet problems, were examined by way of multivariate regression. Results show that the acceptance of blocking filters is significantly related to one's demographics and perception of the Internet. This article discusses implications of the findings, from both an academic and a commercial perceptive, for future research.
Mining sales data using a neural network model of market response
Authors: Gruca Thomas S. , Klemz Bruce R. , Petersen E. Ann Furr
Published: January 2007

Modeling aggregate market response is a core issue in marketing research. In this research, we extend previous forecasting comparative research by comparing the forecasting accuracy of feed-forward neural network models to the premier market modeling technique, Multiplicative Competitive Interaction (MCI) models. Forecasts are compared in two separate studies: (1) the Information Resources Inc. (IRI) coffee dataset from Marion, IN and (2) the A. C. Nielsen catsup dataset from Sioux Falls, SD. Our results suggest neural networks are a useful substitute for MCI models when there are too few observations available to estimate a fully-extended MCI model. Implications are discussed.
Behind-the-scenes data mining
Authors: John George H.
Published: January 2007

Successful technology becomes invisible. Few people think much about internal combustion engines while they drive to work in three-thousand-pound hunks of metal powered by them, or electricity while it enables countless parts of their modern lives. Data mining has a long way to go before it succeeds in this way -- or does it? At KDD-98, the Behind-the-Scenes Data Mining panel presented five views on this aspect of the success of data mining. George H. John, Data Mining Guru at E.piphany, moderated the panel which included Usama Fayyad, Senior Researcher at Microsoft; Elliot Fishman, Director of Product Management at DoubleClick; Gerald Fahner, Project Analyst at Fair Isaac & Co.; and Paul DuBose, CTO of Analytika. The story below is a fictional amalgam of their presentations, seen from the viewpoint of an average citizen -- a day in the life of John Q. Record.
KDD-98 exhibits overview
Authors: Parsa Ismail
Published: January 2007

Initially started as a half-day long display of research prototypes, the KDD exhibits quickly evolved into an industry event eagerly sought by the practitioners, researchers and the vendors in the field. In this article, I provide an overview of the KDD-98 exhibits program and the outline the factors that led to its success.
Knowledge discovery in databases
Authors: Piatetsky-Shapiro Gregory
Published: January 2007

In this paper, we describe the past l0 years of KDD and outline predictions for the next 10 years.
MobiCom poster
Authors: Magalhaes Luiz , Kravets Robin
Published: January 2007

This poster describes a new approach to host mobility, where the responsibility of maintaining an end-to-end pipe that survives changes to the host network attachment point is moved to the transport layer.
MobiCom poster
Authors: Khatib Iyad Al , Maguire Gerald Q. , Ayani Rassul , Forsgren Daniel
Published: January 2007

Since the approval of the IEEE 802.11b by the IEEE in 1999, the demand for WLAN equipment and networks has been growing quickly. We present a queuing model of wireless LAN (WLAN) access points (APs) for IEEE 802.11b. We use experimentation to obtain the characteristic parameters of our analytic model. The model can be used to compare the performance of different WLAN APs as well as the QoS of different applications in the presence of an AP. We focus on the delay introduced by an AP. The major observations are that the delay to serve a packet going from the WLAN medium to the wired medium (on the uplink) is less than the delay to serve a packet, with identical payload, but travelling from the wired medium to the WLAN medium (on the downlink). A key result is an analytic solution showing that the average service time of a packet is a strictly increasing function of payload.
A recursive random search algorithm for large-scale network parameter configuration
Authors: Ye Tao , Kalyanaraman Shivkumar
Published: January 2007

Parameter configuration is a common procedure used in large-scale network protocols to support multiple operational goals. It can be formulated as a black-box optimization problem and solved with an efficient search algorithm. This paper proposes a new heuristic search algorithm, Recursive Random Search(RRS), for large-scale network parameter optimization. The RRS algorithm is based on the initial high-efficiency feature of random sampling and it attempts to maintain this high efficiency by constantly "restarting" random sampling with adjusted sample spaces. Besides the high efficiency, the RRS algorithm is robust to the effect of random noise and trivial parameters in the objective function because of its root in random sampling. These features are very important for the efficient optimization of network protocol configuration. The performance of RRS is demonstrated with the tests on a suite of benchmark functions. The algorithm has been applied to the configuration of several network protocols, such as RED, OSPF and BGP. One example application in OSPF routing algorithm is presented.
A self-tuning structure for adaptation in TCP/AQM networks
Authors: Zhang Honggang , Towsley Don , Hollot C. V. , Misra Vishal
Published: January 2007

Congestion control in TCP/AQM networks is expected to perform well for a wide-range of conditions, but recent advances in modeling and analysis indicate that present AQM schemes need an extra dose of adaptability to cope. This paper answers the call and proposes a self-tuning structure wherein AQM parameters are automatically tuned in response to on-line estimation of link capacity and traffic load. This approach is applicable to any AQM scheme that is parameterizable in terms of link capacity and TCP load. In this paper, we will describe this self-tuning structure, illustrate its application to PI and RED AQMs, provide stability analysis, and conduct ns simulations to compare with both fixed AQM schemes and the recently proposed adaptive RED.
Representing data structures in APL with an extended enclosure function
Authors: Thornburg J
Published: January 2007

We propose a natural extension of the "enclose" general array function, and describe its use in representing complicated data structures such as trees with (possibly) shared branches. We give two examples of the use of the extension, one each in symbolic algebra and in graphics.
Contributions to constructive polynomial ideal theory XXIII
Authors: Renschuch Bodo , Roloff Hartmut , Rasputin Georgij G. , Abramson Michael
Published: January 2007

In a 1941 paper (which is condensed here), N. M. Gjunter refers to some of his unknown papers from 1910, 1913 and 1925, which are partially written in context with the 1941 paper. Thus Gjunter had already pursued a constructive theory of polynomial ideals in 1913. Among other results, he proves the inequality attributed to Macaulay/Sperner in 1913 (from 1927 and 1930, respectively). Also discussed are results analogous to more recent work. The author hereby finishes his sequence of articles.
Strength and similarity of affix removal stemming algorithms
Authors: Frakes William B. , Fox Christopher J.
Published: January 2007

This study evaluated the strength of, and similarity among, four affix removal stemming algorithms. Strength and similarity were evaluated in different ways, including new metrics based on the Hamming distance measure. Data was collected on stemmer outputs for a list of 49,656 English words derived from the UNIX spelling dictionary and the Moby corpus. Conclusions about the relative strength and similarity of the four stemming algorithms are reported.
Robust approximations to the distribution of link distances in a wireless network occupying a rectangular region
Authors: Mullen John P.
Published: January 2007

An important characteristic of a Mobile Ad Hoc Network (MANET) is the distribution of the link distance between communicating nodes. Knowing this distribution is a step in determining the distribution of the number of neighbor nodes, the number of hops required to transmit a message, etc. This paper presents two robust approximations to the link distance distribution for nodes within a rectangular area, providing the x and p node coordinates follow independent continuous spatial distributions. This paper also presents an approximate link distance distribution for the Random Waypoint Mobility model and examines the approximation error in a number of situations.