bluuebunny/crossref_metadata_2025 huggingface dataset:
T-scan
Authors: Bernard J. C.
Published: January 2007

All large computer centers are actualy faced with a major change in their workload. Most applications are leaving batch operations for time sharing ease of use.In fact, all kinds of computer work could be performed through a console: development, maintenance, data base query and update and even batch control and submit.A second problem arises as end-user profil is no more computer oriented. Users only look at the time the system needs to answer their requests, and don't care about the computer game. So performance analysts and operations managers are supposed to achieve a certain level of servic which they are almost unable to measure.We try in this paper to discuss some major problems related to conversational computer operations. We will present several drawbacks characterising the currently existing solutions. A problem that lead us to define simple operating principle for response time measurements. This principle is implemented in a fully automatic measurement tool named T-SC
A study of an entity-based database user interface
Authors: Mantei M. M. , Cattell R. G. G.
Published: January 2007

A study is presented of a database system interface in which an entity (a concept) and the relationships in which it is involved are displayed to the user; the user is permitted to move about in the database by selecting entities related to the current one displayed. The database system was designed as a personalized database (PDB) for a scientist, student, manager, or anyone who has a need for a fast mechanism for storing and organizing a wide variety of information. The study is exploratory recording baseline times and types of behavior for a variety of personal information management tasks performed by an individual. Data entry, information retrieval, and browsing behavior are examined and contrasted to behavior with more conventional storage media.
To the mountain....a practitioner's view of the Gaithersburg conference
Authors: Maxwell Carron M.
Published: January 2007

I went to the Human Factors conference in Gaithersburg hoping to learn from the experts. And there were experts, knee deep and crowded into the maze that was the Bureau of Standards. The papers and, presumably the research that preceded them, were thorough and thoughtful.
High-tech can stimulate creative action
Authors: Shneiderman Ben
Published: January 2007

Jokes about the complexity and error-prone use of computer systems reflect the experience of many people. Computer anxiety, terminal terror, and network neurosis are modern maladies - but help is on the way!
The Σ- concept
Authors: Mac an Airchinnigh Mícheál
Published: January 2007

The "User's Conceptual Model" (UCM) plays an important role in determining the behaviour of a user at the user-computer interface. In this paper I consider a small well-defined group of users of computer systems - those who know some general-purpose programming language. Such users have a conceptual model of their own (favourite) "programming language as a problem-solving tool". Using the problem to compute the inner product of two vectors in E
n
as a starting point, I develop that which I have called the Σ- concept and show how it fits into a formal model of the UCM of the "programming language as a problem-solving tool".
Software psychology
Authors: Sammet J. E.
Published: January 2007

This book should be either read carefully, or at least skimmed, by almost all programmers, programming managers, and any people concerned with the realities of software and software systems. The author defines "Software psychology" on p. 3 as:The study of human performance in using computer and information systems. Understanding of human skills and capacity to design effective computer systems can be improved by application of the techniques of experimental psychology; the analysis of cognitive and perceptual processes; the methods of social, personnel and industrial psychology; and the theories of psycholinguistics.
A comparative study of man-machine interfaces in interactive systems
Authors: Maeda K. , Miyake Y. , Nievergelt J. , Saito Y.
Published: January 2007

This study compares and assesses the quality of a number of man-machine interfaces in a sample of interactive systems chosen to represent a wide spectrum of different applications, including: text editors, information retrieval, data communication and processing utilities, and programming environments. The purpose of this study is to develop a check-list for comparing and assessing man-machine interfaces, and to illustrate this technique by means of examples. As a consequence of this approach we have observed the widespread existence of application-independent commands in different systems, and we show here how a search for "the simplest interface that does a given job" succeeds in reducing the complexity of the user interface of a widely used interactive system.
Some notes on the representation of the user's conceptual model
Authors: Mac an Airchinnigh Micheal
Published: January 2007

"There seems to be no reason to believe that we are ever acquainted with other people's minds, seeing that these are not directly perceived." - Bertrand Russell (1956) p.42
Have a look at XML files
Authors: Markus Arjen
Published: January 2007

Software engineering seems to be ridden with hypes: someone launches a "new" idea, a lot of noise is made over that in the various journals which leads the casual reader or listener to believe that all previous ideas are very wrong or at least completely ancient and therefore useless. The new idea inspires the creation or resurrection of a bunch of TLAs and FLAs and other buzzwords. But after a while the hype is gone and the new idea is either forgotten or becomes an old and more or less well-understood tool - one of many and not one instead of many.
A psychometric evaluation of the use of data flow diagrams
Authors: Clark John D.
Published: January 2007

Systems morphology is usually assumed to be a function of the problem and the applied design heuristic. Recently, however, it has been suggested that the designer's psychological characteristics may have an impact as well. This study attempts to measure the impact of various cognitive metrics and experience on the structural characteristics of data flow diagrams. It appears that a statistically significant relationship does exist and it may well prove to be useful in the assignment of systems analysts to analysis and design tasks.
Constrained languages need not constrain person/computer interaction
Authors: Jackson Mark D.
Published: January 2007

When using a computer system, one source of difficulty for many people is the method of interacting with the software in order to exchange and manipulate information. Some researchers argue that computers will not be easy to use until software services can respond to natural language user input. This argument is based on an assumption that any constraints placed on the manner of expression will limit ease of use or impede user proficiency. However, results of recent experiments suggest that constraints can be placed on the format of user input without limiting ease of user expression. When users know the type of information to enter, their flexible language processing skills can adapt to constrained input formats without degrading performance.
Review of "The Psychology of Human-Computer Interaction by Stuart K. Card, Thomas P. Moran and Alan Newell", Lawrence Erlbaum Associates, Hillsdale, NJ, 1983.
Authors: Swigger K. M.
Published: January 2007

This is a book that is intended not just to be read but to be used-through discussion, study, and prolonged reflection. The major concern of the book is, as the title implies, how humans interact with computers. The authors construct an empirically based cognitive theory of a skilled human-computer interaction and apply it to the specific problem of text editing. They do not simply inform readers of the problems, they provide solutions to the problems and describe a methodology for unifying psychology and computer science. A few years ago Ben Shneiderman [1] listed the computer science topics relevant to human-factors research. The Psychology of Human-Computer Interaction tells the student how to actually perform human-factors research. It discusses the processes involved, the techniques to use, and the methods to follow.
Who dictates your display terminal design?
Authors: Smith Wanda
Published: January 2007

The intent of this paper is to describe the history and current status of the design "regulations" for computer terminal products in Europe, and recently in Canada and in the United States. Included is a description of: 1) the concerns and issues that have evolved into country controls, 2) the informational base around which these controls were developed, 3) the current controversy over their scientific credibility, 4) the different mechanisms utilized to influence control adherence, and 5) restrictions unique to some countries. Although the paper will focus on activity in Europe, a brief summary will be given of the activities in Canada and the U.S. Included will be a summary of recent activities of U.S. institutions to create national guidelines and of the International Organization for Standardization.
Technology transfer
Authors: Grantham Charles E.
Published: January 2007

Transfer of technological developments from the research laboratory to the production line is a topic which has been given increasing attention in the past few years (Tornatzky, et al, 1983). The very survival of many large corporations hinges on the efective management of the technology transfer process. Recent development of research consortia, e.g., MCC and SRC, may be taken as evioence of the growing corporate concern with this issue.
A note on an empirical study of paging on an IBM 370/145
Authors: Allen R. C. , Clark S. R.
Published: January 2007

A summary is presented of the paging activity observed for various programs executing on a System/370 model 145 using OS/VSI (Release 2.0). Paging activity was measured by periodic sampling of the queues involved in real storage page management and by inspection of page traffic counters maintained by the operating system.
A meta comment about the I.J. Good - Sam Rashevsky interchange
Authors: Berliner Hans J.
Published: January 2007

Though I usually prefer to smile (benignly) when chess amateurs discuss computer problems, the discussion in the SIGART Newsletter of February 1973 was a little too much for me.
ARPA "automatic programming" meeting
Authors: Waldinger Richard
Published: January 2007

A meeting was held by ARPA January 17-18 to discuss the establishment of a research effort in "Automatic Programming" organized along the same lines as the current Speech Recognition activity. The meeting was led by Steve Crocker and was attended by nearly twenty people who are currently doing work that could be called "automatic programming," as well as representatives of other interested government agencies.
Re-organization of AI in Edinburgh
Authors: Michie Donald
Published: January 2007

Readers of the June, 1974,
SIGART Newsletter
will have learned of a re-organization of the Edinburgh AI School. This was recently enacted by the University Court on the recommendation of a University Committee convened by the Dean of Science, Norman Feather F.R.S., Professor of Natural Philosophy. The recommendations themselves were released in March this year, although adoption by the University Court was not finalised until July 15.
A comparison of human and computer vision systems
Authors: Price Keith
Published: January 2007

I will begin with a general overview of the two types of systems and compare them at a general level. The second section will describe the eye and camera as the input devices. Later sections will discuss segmentation of the scene, visual imagery and encoding of the scene, perception, depth and space perception, and perception of movement.
The CSL vision system
Authors: Snyder Wesley E.
Published: January 2007

This is a summary of a paper by the same title published as AI Tech Note 5, Coordinated Science Laboratory. The longer report contains detailed results of the tests described herein.
Automatic proof of correctness of a binary addition algorithm
Authors: Moore J. Strother
Published: January 2007

The Boyer-Moore Pure LISP Theorem Prover ([1], [2], and [3]) has recently proved the correctness of a program implementing binary addition with a carry flag. Because of the relative complexity of the binary addition algorithm and the automatic nature of the proof, this result was thought interesting enough to warrant this technical note.
The fourth B
Authors: Maloff Chalda I. , Zears Russell W.
Published: January 2007

Recent developments in computer generation of music have been impressive. Such diverse musical styles as Country and Western music [1] and Victorian Hymns [2] have been successfully simulated. Advanced works have allowed for increased flexibility of stylistic capabilities [3], and have dealt with such complex musical problems as anticipations and delayed resolutions [4]. Despite the increased flexibility and intricacy of these programs, the basic approach has been to restrict the program to a preordained style of composition.
An iterative lisp solution to the samefringe problem
Authors: Greussay Patrick
Published: January 2007

The "samefringe" problem of testing trees for equality of tips (even if the trees have a different internal structure) seems to be the main example used to illustrate the usefulness of coroutines in AI languages.
AI and scientific revolution
Authors: Jeffrey Joe
Published: January 2007

Artificial intelligence, as a field of scientific endeavor, is significantly different from all other fields of computer science. I would like to consider, for a moment, certain of these significant differences, as dispassionately as possible.
Natural language interfaces
Authors: Waltz David L.
Published: January 2007

As you can see by the thickness of this issue, the response to my request for contributions was overwhelming - I received 52 separate items! Since the contributions arrived over a period of time, and since we had to use archaic means (typing, cutting and pasting) to produce this newsletter, the articles are not in optimal order. I hope that the index below will help untangle the issue.
Syntactically based classification from natural language responses
Authors: Knaus Roger
Published: January 2007

As part of both the decenial census and monthly current population surveys, the U.S. Bureau of the Census publishes statistics about the industries and occupations in which people are employed. The data for the employment statistics are natural language responses to the following questions:Ia. For whom did you work?Ib. What kind of business or industry is this?Oa. What kind of work were you doing?Ob. What were the most important duties?Oc. What was your job title?
CAI, data bases and scene analysis
Authors: Schefe Peter
Published: January 2007

I have been working for about 3 years on syntactic-semantic analysis of natural language, especially of German.
Data base system for AI applications
Authors: Travis Larry E.
Published: January 2007

The design and implementation of a high level, "algol-family" AI language incorporating a flexible data base facility is under way at the University of Wisconsin - Madison. Called Telos, the language is Pascal-based and is first being implemented on a multiprocessor Univac 1110 with Pascal also being used as the implementation language. The philosophy of Pascal, to provide a minimal set of features conducive to good program structure, has been carried over into the Telos extensions as much as possible.
Conceptual processing/natural language interface
Authors: Burger John F.
Published: January 2007

This is a natural-language-input project at System Development Corporation in Santa Monica. It was begun under internal R&D funding with the title "Conceptual Processing". It is now funded by government agencies to provide an applications - level system and is now known as the "Natural Language Interface" project.
Solving mechanics problems
Authors: Stone Martha
Published: January 2007

PAT is a program that does part of the natural language processing for a project to solve mechanics problems. The project is headed by Dr. Alan Bundy at the University of Edinburgh, with Dr. George Luger, Robert Welham, and myself as research workers.
Fuzzy semantics for a natural-like language defined over a world of blocks
Authors: Shaket Efraim
Published: January 2007

Winograd used a toy world called BLOCKS for his famous "natural language understanding" system SHRDLU. In this world all distinct objects are equally distinct: a red-orange block is no closer to being a red block than to being a black block; and a rather large block is no closer to being a large block than to being a small block. This paper presents an APL package which gives a fuzzy set semantics for a limited English-like language (in which red-orange is near to red and so on), in a manner which is convenient for reference: the system accepts instructions in the form of simple indicative sentences, and demonstrates its "understanding" by indicating the block which is the intended referent. The work is based on the principle of maximum meaningfulness" and is robust, in the sense that small changes in the instructions or in the state of the world do not disturb it.
A computer consultant for poker using natural language communication
Authors: Cipolaro John K. , Findler Nicholas V.
Published: January 2007

A group of students and a faculty member (N.V.F.) have been studying various aspects of decision making under uncertainty and risk over the past few years [1-5]. The vehicle of our investigations has been the game of Poker. One of the projects we are interested in is how a computer consultant could be created for Poker, which has the following properties:(i) it should need minimum syntactic and semantic analysis to "understand" questions from a naive user;(ii) the preparation and input of a new knowledge base should be easy and high level;(iii) the answers given by it should be syntactically correct and the right ones.
Natural language for PARRY
Authors: Faught Bill
Published: January 2007

Natural language recognition in the PARRY model is constrained by the quick response need and the lack of constraints on the user's English input. To deal with these problems we have developed a set of pattern matching techniques that essentially strip away the language-dependent form of the input and translate it into a semantic representation which the model can then interpret. The language recognizer was the added feature that the more data (idioms, patterned phrases) that we put into it, the more sentences it is able to handle, with little degredation in speed or accuracy.
Intelligent terminals
Authors: Grignetti Mario
Published: January 2007

Our objective is to develop a system to help computer-naive people deal with their Intelligent Terminal (IT), an envisioned personal mini-computer of great sophistication and power. Our system will be capable of mediating intelligently between these users and the tools that will be available to them in the Intelligent Terminal: it will provide streamlined instructions on how to use these tools, and it will answer questions about them posed in relatively unconstrained English. The system's teachings will rely heavily on letting people 'learn by doing', by setting up practice sessions under tutorial supervision. Our initial plan includes developing one such Intelligent oN-Line Assistant and Tutor (INLAT) system that will "know" about an editing system, a mail system, and a document retrieval system.
Using a natural language interface for elementary instruction
Authors: Tharp Alan L.
Published: January 2007

If man is ever to realize the fullest potential of computers, it is essential to shift the communication burden from the user to the machine. Although the recognition and interpretation of full English is not within our grasp, recent advances in natural language processing (e.g. ATNs), in computer software (e.g. the symbol manipulation language Spitbol) and in computer hardware (e.g. faster CPUs and less expensive memories) have made it possible to construct simple but useful natural language interfaces.
What can a computer learn from examples?
Authors: Kugel Peter
Published: January 2007

About a year ago, I wrote an article that appeared in
SIGART
Newsletter [1] In that article, I asked "How well can computers generate programs from examples of what those programs are supposed to do?" My answer was that they cannot do very well If by "computers" we mean devices that only do total computations. I attempted to show that, under what seemed to me to be quite reasonable assumptions, a computer limited to doing total computations an a sequence of examples could only generate finitely many programs altogether and therefore (obviously) only finitely many programs that correctly accounted for the examples given.
A deductive model of control of a problem solver
Authors: McDermott Drew
Published: January 2007

The efficiency of problem-solving computer programs, has suffered from such programs willingness to search problem spaces blindly and their inability to accept new information that would help. A new approach is described, in which the problem solver is driven by a theorem prover which retrieves and chooses among solution plans. The theorem prover can accept new deductive rules expressed in the problem solver's control vocabulary. In this way, the advantages of determinism and extensibility are achieved. A program called NASL embodying this approach has been implemented and applied to the domain of simple electronic circuit design.
Semantic network representations in rule-based inference systems
Authors: Duda Richard O. , Hart Peter E. , Nilsson Nils J. , Sutherland Georgia L.
Published: January 2007

Rule-based inference systems allow judgmental knowledge about a specific problem domain to be represented as a collection of discrete rules. Each rule states that if certain premises are known, then certain conclusions can be inferred. An important design issue concerns the representational form for the premises and conclusions of the rules. We describe a rule-based system that uses a partitioned semantic network representation for the premises and conclusions.
The use of production systems in RITA to construct personal computer "agents"
Authors: Anderson Robert H.
Published: January 2007

A production system called RITA has been developed on a PDP-11/UNIX minicomputer system, to allow the development of "user agents": small programs that perform useful tasks for a user. RITA rules are written in an English-like language, allowing an agent's logic to be understood by a computer-naive user. The RITA system contains explanatory facilities capable of giving substantial trace and historical information regarding the operation of a user agent. An example of the design and implementation of a user agent is given, followed by a discussion of advantages and disadvantages of production systems for this application. Most perceived advantages rely to some extent on the use of the system's explanatory facilities.
The efficiency of certain production system implementations
Authors: McDermott J. , Newell A. , Moore J.
Published: January 2007

The obvious method of determining which productions are satisfied on a given cycle involves matching productions, one at a time, against the contents of working memory. The cost of this processing is essentially linear in the product of the number of productions in production memory and the number of assertions in working memory. By augmenting a production system architecture with a mechanism that enables knowledge of similarities among productions to be precomputed and then exploited during a run, it is possible to eliminate the dependency on the size of production memory. If in addition, the architecture is augmented with a mechanism that enables knowledge of the degree to which each production is currently satisfied to be maintained across cycles, then the dependency on the size of working memory can be eliminated as well. After a particular production system architecture, PSG, is described, two sets of mechanisms that increase its efficiency are presented. To determine their effectiveness, two augmented versions of PSG are compared experimentally with each other and with the original version.
Exemplary programming in RITA
Authors: Waterman D. A.
Published: January 2007

This paper describes the development of a RITA agent for Exemplary Programming (EP). The EP agent learns new facts and stores them in a data base and can learn new procedures for data manipulation. Both the EP agent and the programs it creates are written as sets of IF-THEN rules (production systems) in RITA: the Rule-directed Interactive Transaction Agent system. The programs produced by the EP agent act as "personal computer agents" to perform a variety of tasks for the user. Program creation is a cooperative effort between the user and the EP agent: the user illustrates what he wants done by performing a series of operations on the computer, and the agent watches and asks the user pertinent questions during the demonstration. The resulting program then becomes the user's personal computer agent for performing the given task.
Model-directed learning of production rules
Authors: Buchanan Bruce G. , Mitchell Tom M.
Published: January 2007

The Meta-DENDRAL program is described in general terms that are intended to clarify the similarities and differences to other learning programs. Its approach of model-directed heuristic search through a comptex space of possible rules appears well suited to many induction tasks. The use of a strong model of the domain to direct time rule Eearch has been demons{rated for rule formation in two areas of chemistry. The high performance of programs which use the generated rules attests to the success of this learning strategy.
Rule-based computations on English
Authors: Simmons Robert F.
Published: January 2007

A linear notation for expressing semantic networks as sets of semantic predicates is outlined. Rule forms are presented for translating from English discourse to semantic predicates. Rules for generating English sentences and for computing causal chains from semantic predicates are described. Each of these rule forms has been tested in an existing question answering system. A brief analysis of rule-based systems is given and a method for designing them is suggested.
The role of partial and best matches in knowledge systems
Authors: Hayes-Roth Frederick
Published: January 2007

Partial matching is a comparison of two or more descriptions that identifies their similarities. Determining which of several descriptions is most similar to one description of interest is called the best match problem. Partial and best matches underlie several knowledge system functions, including: analogical reasoning, inductive inference, predicate discovery, pattern-directed inference, semantic interpretation, and speech and image understanding. Because partial matching is both combinatorial and ill-structured, admissible algorithms are elusive. Economical solutions require very effective use of constraints that, apparently, can be provided only by globally organized knowledge bases. Examples of such organizations are provided, and promising avenues of research are proposed.
The production system
Authors: Rosenschein Stanley J.
Published: January 2007

The use of production systems as the primary method for encoding knowledge in large knowledge-based systems is discussed at two levels; their suitability as an architecture that can be efficiently supported and their appropriateness as a language of expression. Questions of efficiency are posed in the framework of a broad class of pattern-directed rewrite systems. Factors governing efficiency are discussed informally, and the usefulness of production systems as an information processing abstraction is examined critically. In this regard, several problems suggested by work on lexically motivated inference are described. It is argued that the use of a particular class of production systems demands a more detailed justification in domain-specific terms than is often given.
Rule-based understanding of signals
Authors: Nii H. Penny , Feigenbaum Edward A.
Published: January 2007

SU/X and SU/P are knowledge-based programs which employ pattern-invoked inference methods. Both tasks are concerned with the interpretation of large quantities of digitized signal data. The task of SU/X is to understand "continuous signals", that is, signals which persist over time. The task of SU/P is to interpret protein x-ray crystallographic data. Some features of the design are: (1) incremental interpretation of data employing many different pattern-invoked sources of knowledge, (2) production rule representation of knowledge, including high level strategy knowledge, (3) "opportunistic" hypothesis formation using both data-driven and model-driven techniques within a general hypothesize-and-test paradigm; and (4) multilevel representation of the solution hypothesis.
Some problems in planning indirect speech acts
Authors: Perrault C. Raymond
Published: January 2007

A competence theory of speech acts should account at least for the relationship between the intentions and beliefs of the speaker of an utterance (including his beliefs about his hearer's beliefs and intentions), and the form of the utterance. What utterances can be used in what contexts to convey what intentions?
Review of "Advances in Computer Chess, Volume 1. by M.R.B. Clarke"; University Press, 1977
Authors: Good I. J.
Published: January 2007

This book contains the proceedings of a conference oh chess programming held in Balliol College, Oxford. It consists of the following seven papers: (1) "On the Structure of an Important Class of Exhaustive Problems and Methods of Search Reduction for Them", by G. M. Adelson-Velskly, V. L. Arlazarov & M. V. Donskoy; (2) "A Representation and Some Mechanisms for a Problem-Solving Chess Program", by H. J. Berliner; (3) "King and Rook Against King: Historical Background and a Problem on the Infinite Board", by D. Michle; (d) "Positional Play in Chess by Computer", by R. H. Atkln; (5) "Describing Pawn Structures", by S. T. Tan; (6) "Tree-Searching and Tree-Pruning Techniques", by J. A. Birmingham & P. Kent; (7) "A Quantitative Study of a King and Pawn Against King", by MR.B. Clarke.
Advances in computer chess
Authors: Bramer Max
Published: January 2007

The latest conference in the series "Advances in Computer Chess" was held at Edinburgh University on April 10th-11th, with the most noticeable trend since the last conference (in 1975) being the close study now being made of endgames usually considered (not always correctly) as elementary.
Editorial
Authors: Liu Bing , Chen-Chuan-Chang Kevin
Published: January 2007

With the phenomenal growth of the Web, there is an everincreasing volume of data and information published in numerous Web pages. The research in Web mining aims to develop new techniques to effectively extract and mine useful knowledge or information from these Web pages [8]. Due to the heterogeneity and lack of structure of Web data, automated discovery of targeted or unexpected knowledge/information is a challenging task. It calls for novel methods that draw from a wide range of fields spanning data mining, machine learning, natural language processing, statistics, databases, and information retrieval. In the past few years, there was a rapid expansion of activities in the Web mining field, which consists of Web usage mining, Web structure mining, and Web content mining. Web usage mining refers to the discovery of user access patterns from Web usage logs. Web structure mining tries to discover useful knowledge from the structure of hyperlinks. Web content mining aims to extract/mine useful information or knowledge from Web page contents. For this special issue, we focus on
Web content mining
.
Mining structures for semantics
Authors: Dong Xin , Madhavan Jayant , Halevy Alon
Published: January 2007

Online data is available in two avors: unstructured data that resides as free text in HTML pages, and structured data that resides in databases and knowledge bases. Unstructured data is easily accessed as human-readable text on a browser, while structured data is hidden behind web query interfaces (web forms), web services, and custom database APIs. Access to this data, popularly referred to as the hidden web, entails submitting correctly completed web forms or writing code to access web services using protocols such as SOAP.
The Weka solution to the 2004 KDD Cup
Authors: Pfahringer Bernhard
Published: January 2007

This short communication describes the Weka solution for the 2004 KDD cup problems, mostly focusing on the bioinformatics problem, where this approach performed best among all submissions. Differences were not significant for the best three submissions, though. The identical setup trained for the physics problem achieved rank nineteen, which is still reasonable.
Protein matching with custom neural network objective functions
Authors: Vogel David S. , Gottschalk Eric , Wang Morgan C.
Published: January 2007

This 2004 KDD Cup presents a perfect case where the usual neural network objective functions do not apply. While the contest problem consisted of 4 different entries with 4 different objective functions, this paper will focus on the solution optimizing GRMSE (Grouped Root Mean Squared Error). It will be shown that the more typical objective functions (including RMSE) cannot be as effective at meeting this criteria. While this objective function may be specific to this problem, and the reader may never see this exact function again in his/her lifetime, the idea behind this paper is applicable in many situations. Too often neural networks are used to minimize SSE (sum of the squares of the errors) or Cross Entropy, when the true measure of success for the model may require a small coding change to the Neural Network objective function. It is shown in this paper that a few small coding changes can make a big difference on a model's performance.
KDD-Cup 2004
Authors: Foussette Christophe , Hakenjos Daniel , Scholz Martin
Published: January 2007

In this paper we describe the winning model for the performance measure "lowest ranked homologous sequence" (RKL). This was a subtask of the Protein Homology Prediction task of the KDD Cup 2004. The goal was to predict protein homology for different performance metrics. The given data was organized in blocks, each of which corresponds to a specific native sequence. The two metrics average precision (APR) and RKL explicitly make use of this block structure. Our solution consists of two parts. The first one is a global classification SVM not aware of the block structure. The second part is a
k-NearestNeighbor
scheme for block similarity, used to train ranking SVMs on the fly. Furthermore, we sketch our approach to optimize the root-mean-squared-error and report some alternative solutions that turned out to be suboptimal.
Report on KDD conference 2004 panel discussion can natural language processing help text mining?
Authors: Kao Anne , Poteet Steve
Published: January 2007

With large amounts of text data now available on-line, both on the Internet and in corporate repositories, text mining is an area of growing interest. Historically, Data Mining researchers have come out of the statistics, database and machine learning communities. Despite a few exceptions, it has by and large had little interaction with the computational linguistics and natural language processing (NLP) community. Given that the subject matter of text mining is free text, one might naturally assume techniques developed over the last few decades in computational linguistics and NLP, should make big contributions towards the younger field of text mining. However, other than in the area of information extraction, empirical evidence has not borne this out.
Overview of the ACM SIGKDD 2004 workshops
Authors: Spiliopoulou Myra
Published: January 2007

Following a tradition of several years, KDD conferences host a number of workshops on challenging topics that emerge and demand concerted research activities and intensive sharing of experiences. This short paper an one-glance overview of the 8 workshops that took place at August 22, 2004 before the official opening of KDD 2004 in Seattle. The individual workshop reports follow in the next pages. Complete information on the workshops including links to the individual sites can be found from the KDD 2004 web site http://www.acm.org/sigs/sigkdd/kdd2004.
Multi-relational data mining 2004
Authors: Džeroski Sašo , Blockeel Hendrik
Published: January 2007

In this report we briefly review the 3rd Workshop on Multi-Relational Data Mining (MRDM-2004), which was organized by the authors and held in Seattle, WA, on August 22, as part of the workshop program of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. The goal of the workshop was to bring together researchers and practitioners of Data Mining and interested in methods and applications of finding patterns in expressive languages from multi-relational, complex, and/or structured data.
The 5th international workshop on multimedia data mining (MDM/KDD2004)
Authors: Khan Latifur , Petrushin Valery A.
Published: January 2007

In this short report we summarize the presentations, conclusions and directions of future work that were discussed during MDM/KDD2004 workshop, held in conjunction with the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 22, 2004 at Seattle, Washington, USA.
EUDA
Authors: Lee Jun-Beom , Ko Young-Bae , Lee Sung-Ju
Published: January 2007

Although there has been a great amount of research work in ad hoc networks, most of the research assumes the nodes are homogeneous. All the nodes are assumed to have the same or similar radio propagation range, processing capability, battery power, storage, and so forth. In reality however, nodes in ad hoc networks tend to have heterogeneity. In the military scenarios for instance, the troop leader is usually equipped with more powerful networking devices than the soldiers of the troop. Radios installed in the vehicles such as tanks and jeeps have more capabilities than radios the soldiers carry, as vehicles do not have the same size- or power-constraints as the soldiers.
Comparison of forwarding strategies in internet connected MANETs
Authors: Nordström Erik , Gunningberg Per , Tschudin Christian
Published: January 2007

For efficient Internet Connectivity in MANETs, multiple gateways and potentially multi-homing and hand-over need to be supported. We compare two forwarding strategies; default routes and tunneling to gateways. We find that tunneling is more efficient and flexible compared to default routes. In fact, we show that default routes will not operate correctly in some situations, particularly in multi-homed networks with more than one gateway.
MARio
Authors: Wang Yong , Martonosi Margaret , Peh Li-Shiuan
Published: January 2007

Mobile Ad hoc NETworks (MANETs) often have fast-changing and unpredictable mobility. This is especially true for recently emerging mobile sensor networks [7] and delay tolerant networks [2], where extreme network conditions are prevalent. To better adjust to such network conditions, we propose to deconstruct the underlying node mobility into a set of abstractions that can be readily leveraged for driving dynamic routing decisions. In particular, we investigate the feasibility of using route lifetime to abstract mobility. Through extensive simulations on DSR, we demonstrate up to 31% improvement in packet delivery rate and 53% improvement in average end-to-end packet latency, using our proposed route prefetch and decay techniques that leverage knowledge of route lifetimes.
Recent extensions to the SimpleScalar tool suite
Authors: Burger Doug , Austin Todd M. , Keckler Stephen W.
Published: January 2007

Over the past eight years, the SimpleScalar Tool suite has become the most widely used set of simulation tools in the computer architecture research community. The authors have recently completed an NSF-funded project to extend and improve the SimpleScalar tools. In this paper, we describe the extensions and improvements to the tools, which include the capability to simulate more instruction sets, graphical support for performance viewing, and more simulators that model different types of machines, including embedded systems, ISA-specific systems, systems with operating system, and multiprocessing systems.
The Liberty Simulation Environment, version 1.0
Authors: Vachharajani Manish , Vachharajani Neil , Penry David A. , Blome Jason A. , August David I.
Published: January 2007

High-level hardware modeling via simulation is an essential step in hardware systems design and research. Despite the importance of simulation, current model creation methods are error prone and are unnecessarily time consuming. To address these problems, we have publicly released the Liberty Simulation Environment (LSE), Version 1.0, consisting of a simulator builder and automatic visualizer based on a shared hardware description language. LSE's design was motivated by a careful analysis of the strengths and weaknesses of existing systems. This has resulted in a system in which models are easier to understand, faster to develop, and have performance on par with other systems. LSE is capable of modeling
any
synchronous hardware system. To date, LSE has been used to simulate and convey ideas about a diverse set of complex systems including a chip multiprocessor out-of-order IA-64 machine and a multiprocessor system with detailed device models.
How to use SimPoint to pick simulation points
Authors: Hamerly Greg , Perelman Erez , Calder Brad
Published: January 2007

Understanding the cycle level behavior of a processor running an application is crucial to modern computer architecture research. To gain this understanding, detailed cycle level simulators are typically employed. Unfortunately, this level of detail comes at the cost of speed, and simulating the full execution of an industry standard benchmark on even the fastest simulator can take weeks to months to complete. This fact has not gone unnoticed, and several techniques have been developed aimed at reducing simulation time.
A reflective framework for discovery and interaction in heterogeneous mobile environments
Authors: Grace Paul , Blair Gordon S. , Samuel Sam
Published: January 2007

To operate in dynamic and potentially unknown environments a mobile client must first discover the local services that match its requirements, and then interact with these services to obtain the application functionality. However, high levels of heterogeneity characterize mobile environments; that is, contrasting discovery protocols including SLP, UPnP and Jini, and different styles of service interaction paradigms e.g. Remote Procedure Call, Publish-Subscribe and agent based solutions. Therefore given this type of heterogeneity, utilizing single discovery and interaction systems is not optimal as the client will only be able to use the services available to that particular platform. Hence, in this paper we present an adaptive middleware solution to this problem. ReMMoC is a Web-Services based reflective middleware that allows mobile clients to be developed independently of both discovery and interaction mechanisms. We describe the architecture, which dynamically reconfigures to match the current service environment. Finally, we investigate the incurred performance overhead such dynamic behaviour brings to the discovery and interaction process.
Energy efficient communication in ad hoc networks from user's and designer's perspective
Authors: Kesselman Alex , Kowalski Dariusz , Segal Michael
Published: January 2007

We consider a game that models the creation of a wireless ad hoc network, where nodes are owned by selfish agents. We study a novel cost sharing model in which agents may pay for the transmission power of the other nodes. Each agent has to satisfy some connectivity requirement in the final network and the goal is to minimize its payment with no regard to the overall system performance. We analyze two fundamental connectivity games, namely broadcast and convergecast. We study pure Nash equilibria and quantify the degradation in the network performance called the price of anarchy resulting from selfish behavior. We derive tight bounds on the price of anarchy for these games. We also study centralized network design. One of the most important problems in wireless ad hoc networks is the minimum-energy broadcast. Recently, there appeared many new applications such as real-time multimedia, battlefield communications and rescue operations that impose stringent end-to-end latency bounds on the broadcasting time. However, the existing algorithms that minimize the broadcasting energy tend to produce solutions with high latency. In this paper we consider the problem of bounded-hop broadcast. We present approximation and heuristic algorithms for this problem.
Practical experience with adaptive service access
Authors: Saif Umar , Paluska Justin Mazzola , Chauhan Vijay Praful
Published: January 2007

The dynamically changing nature of the emerging networked environments warrants a computing model in which resources are dynamically discovered and opportunistically utilized to maintain continuity of service. This paper describes the design and implementation of Lightweight Adaptive Network Sockets (LANS) for accessing services in such a dynamically changing networked environment. A LANS socket takes a high-level description of a service and opportunistically connects to the best provider of the service in the changing environment of the application. LANS builds on the architectural philosophy of Service-oriented Network Sockets (SoNS)[13], in that it integrates a service-oriented abstraction with the operating system socket interface and provides adaptive service access at the end-host session layer. However, our experience with SoNS led to three key improvements for the LANS architecture. 1) The LANS session layer reduces the computation and communication over-head resulting from the SoNS end-to-end architecture. 2) LANS is designed to offer richer semantics for resource selection and allocation to enable better utilization of resources in shared pervasive environments. 3) Applications in LANS can control the opportunistic behavior of the system to avoid perfunctory reconnections. Our experiments show that LANS running on an iPAQ consumes 40% less power, requires less than 1% of the network traffic, and is far less processor hungry than the original version of SoNS --- without compromising performance and offering richer semantics for adaptive service access.
A context based storage system for mobile computing applications
Authors: Khungar Sharat , Riekki Jukka
Published: January 2007

In this paper, we describe a novel context based storage system that use context to manage user data and make it available to him based on his situation. First, we examine several existing systems that use context with documents. Subsequently, a new storage system is presented that uses context to aid in the capture of and access to documents in mobile environment. We describe file browser and calendar applications that we have developed within our mobile computing infrastructure utilizing the features of context based storage. Novel features of our system include the access rights mechanism for data and support for group activity.