waashk/acm huggingface dataset:
simple conditions for guaranteeing higher normal forms in relational databases  a key is simple if it consists of a single attribute. it is shown that if a relation schema is in third normal form and every key is simple, then it is in projection-join normal form (sometimes called fifth normal form), the ultimate normal form with respect to projections and joins. furthermore, it is shown that if a relation schema is in boyce-codd normal form and some key is simple, then it is in fourth normal form (but not necessarily projection-join normal form). these results give the database designer simple sufficient conditions, defined in terms of functional dependencies alone, that guarantee that the schema being designed is automatically in higher normal forms.  c. j. date ronald fagin
dealing with slow-evolving fact: a case study on inventory data warehousing  data warehousing for inventory management (dwin) is a production project at telcordia aimed at providing telecommunications service providers with decision support functions for inventory control and monitoring. in this paper, we report some interesting issues related to the design of the data warehouse. specifically, we will discuss the issues of slow-evolving fact, transaction-oriented fact table, and large dimensions. we also propose the concept of virtual data cubes and show its usefulness. we address these issues through a data mart case study and present benchmarking results. finally, based on the experiences learned, we discuss potential research issues that may benefit the data warehousing and olap practice.  chung-min chen munir cochinwala elsa yueh
a streaming ensemble algorithm (sea) for large-scale classification ensemble methods have recently garnered a great deal of attention in the machine learning community. techniques such as boosting and bagging have proven to be highly effective but require repeated resampling of the training data, making them inappropriate in a data mining context. the methods presented in this paper take advantage of plentiful data, building separate classifiers on sequential chunks of training points. these classifiers are combined into a fixed-size ensemble using a heuristic replacement strategy. the result is a fast algorithm for large-scale or streaming data that classifies as well as a single decision tree built on all the data, requires approximately constant memory, and adjusts quickly to concept drift. w. nick street yongseog kim
learning a word processing system with training wheels and guided exploration  a training wheels interface creates a reduced functionality system intended to prevent new users from suffering the consequences of certain types of common errors when they exercise system functions and procedures. this has been shown to be an effective training system design for learning basic text editing functions [4]. we extend this result by examining the extent to which training wheels learners can transfer their skills to interaction with the full- function system. the experiment reported here indicates that training wheels subjects were better able to perform advanced full-system editing functions than subjects who were trained on the full system itself.  richard catrambone john m. carroll
a comparative analysis of reactions from multicultural and culturally homogeneous teams to decision making with and without gdss technology cultural diversity in the u.s. workforce is increasing, in addition, organizations are requiring greater worker involvement and teamwork. while cultural diversity provides unique opportunities to stimulate the work environment, it can also create problems in individual interaction that often hinders group performance. therefore, it is imperative to determine how multicultural team performance is similar and different from culturally homogeneous team performance. in the information age a number of organizations are using technology such as group decision support systems (gdss) to promote participation and improve team interaction. this article provides the results of a pilot study where survey responses were collected from two categories of teams, multicultural teams and culturally homogeneous teams. participants were surveyed on their preferences for team decision making, in reaction to team exercises, within a gdss environment and within a traditional, non-gdss environment. an analysis of the responses showed that a significantly higher percent of multicultural team members, in comparison to culturally homogeneous team members, responded more favorably for using a gdss in certain aspects of team decision making. for example, multicultural team members to a greater extent preferred the computer environment for "discussion of issues" and "expressing ideas." implications for using gdss technology for team building within multicultural organizations are discussed. bonnie f. daily john loveland robert steiner
cscw and the internet (workshop session) (abstract only)  this full- day workshop will focus on understanding the range of ways in which the internet and the web are being used for collaboration, on the communities using it, and on how (and what) cscw tools are appearing in this domain. the workshop will strive to characterize current on-line collaborations and their underlying technologies and to outline the implications of these for cscw and distributed groups more generally.  sara bly susan anderson
efficient content-based indexing of large image databases  large image databases have emerged in various applications in recent years. a prime requisite of these databases is the means by which their contents can be indexed and retrieved. a multilevel signature file called the two signature multi-level signature file (2smlsf) is introduced as an efficient access structure for large image databases. the 2smlsf encodes image information into binary signatures and creates a tree structures can be efficiently searched to satisfy a user's query. two types of signatures are generated. type i signatures are used at all tree levels except the leaf level and are based only on the domain objects included in the image. type ii signatures, on the other hand, are stored at the leaf level and are based on the included domain objects and their spatial relationships. the 2smlsf was compared analytically to existing signature file techniques. the 2smlsf significantly reduces the storage requirements; the index structure can answer more queries; and the 2smlsf performance significantly improves over current techniques. both storage reduction and performance improvement increase with the number of objects per image and the number of images in the database. for an example large image database, a storage reduction of 78% may be archieved while the performance improvement may reach 98%.  essam a. el-kwae mansur r. kabuka
the automatic indexing system air/phys - from research to applications  since october 1985, the automatic indexing system air/phys has been used in the input production of the physics data base of the fachinformationsentrum karlsruhe/west germany. the texts to be indexed are abstracts written in english. the system of descriptors is prescribed. for the application of the air/phys system a large-scale dictionary containing more than 600 000 word- descriptor relations reap. phrase-descriptor relations has been developed. most of these relations have been obtained by means of statistical and heuristical methods. in consequence, the relation system is rather imperfect. therefore, the indexing system needs some fault- tolerating features. an appropriate indexing approach and the corresponding structure of the air/phys system are described. finally, the conditions of the application as well as problems of further development are discussed.  p. biebricher n. fuhr g. lustig m. schwantner g. knorz
annotating answers with their properties  when responding to queries, humans often volunteer additional information about their answers. among other things, they may qualify the answer as to its reliability, and they may provide some abstract characterization of the answer. this paper describes a user interface to relational databases that similarly annotates its answers with their properties. the process assumes that various assertions about properties of the data have been stored in the database (meta-information). these assertions are then used to infer properties of each answer provided by the system (meta-answers). meta-answers are offered to users along with each answer issued, and help them to assess the value and meaning of the information that they receive.  amihai motro
the aqua approximate query answering system  aqua is a system for providing fast, approximate answers to aggregate queries, which are very common in olap applications. it has been designed to run on top of any commercial relational dbms. aqua precomputes synopses (special statistical summaries) of the original data and stores them in the dbms. it provides approximate answers along with quality guarantees by rewriting the queries to run on these synopses. finally, aqua keeps the synopses up-to-date as the database changes, using fast incremental maintenance techniques.  swarup acharya phillip b. gibbons viswanath poosala sridhar ramaswamy
design and implementation of a shared workspace by integrating individual workspaces  this paper proposes "teamworkstation" (tws) as an approach to an effective shared workspace for the support of remote collaboration. there are three key design objectives in tws: integration of virtual and actual workspaces, a simultaneously-accessible shared drawing surface, and smooth transition between individual workspaces and shared workspace. to achieve these objectives, images of computers and/or paper are overlaid so that information and images from both are effectively combined and distributed to the group members.  m. ohkubo h. ishii
towards data mining benchmarking: a test bed for performance study of frequent pattern mining  performance benchmarking has played an important role in the research and development in relational dbms, object-relational dbms, data warehouse systems, etc. we believe that benchmarking data mining algorithms is a long overdue task, and it will play an important role in the research and development of data mining systems as well.  frequent pattern mining forms a core component in mining associations, correlations, sequential patterns, partial periodicity, etc., which are of great potential value in applications. there have been a lot of methods proposed and developed for efficient frequent pattern mining in various kinds of databases, including transaction databases, time-series databases, etc. however, so far there is no serious performance benchmarking study of different frequent pattern mining methods.  to facilitate an analytical comparison of different frequent mining methods, we have constructed an open test bed for performance study of a set of recently developed, popularly used methods for mining frequent patterns in transaction databases and mining sequential patterns in sequence databases, with different data characteristics. the testbed consists of the following components.  a synthetic data generator, which can generate large sets of synthetic data in various kinds of data distributions. a few large data sets from real world applications will also be provided.  a good set of typical frequent pattern mining methods, ranging from classical algorithms to recent studies. the method are grouped into three classes: frequent pattern mining, max-pattern mining, and sequential pattern mining. for frequent pattern mining, we will demonstrate apriori, hashing, partitioning, sampling, treeprojection, and fp-growth. for maximal pattern mining, we will demonstrate maxminer, treeprojection, and fp-growth-max.  for sequential pattern mining, we will demonstrate gsp and freespan.  a set of performance curves. these algorithms their running speeds, scalabilities, bottlenecks, and performance on different data distributions, will be compared and demonstrated upon request. some performance curves from our pre-conference experimental evaluations will also be shown.  an open testbed. our goal is to construct an extensible test bed which integrates the above components and supports an open-ended testing service. researchers can upload the object codes of their mining algorithms, and run them in the test bed using these data sets. the architecture is shown in figure 1.  this testbed is our first step towards benchmarking data mining algorithms. by doing so, performance of different algorithms can be reported consistently, on the same platform, and in the same environment. after the demo, we plan to make the testbed available on the www so that it may, hopefully, benefit further research and development of efficient data mining methods.  jian pei runying mao kan hu hua zhu
scope of the ois/oa project  why is xerox computer services working on office automation?  first, because our national financial picture has seen ever increasing inflation. the cost of almost everything has increased dramatically, including the cost of doing business. a large part of the cost of doing business is administrative costs. office automation concerns itself with administrative costs of labor (clerical and professional) and time (timely delivery of information).  when we look at the future, we know that we have to find better ways of getting information from our heads, pens, and typewriters to those who need it. we're not going to be able to rely on once plentiful secretarial or clerical support staff, because we are already feeling a shortfall of these administrative personnel, and in the future, we will see a decreasing population.  the ability of a company to stay price-competitive in any marketplace hinges on its recognition of the need to automate certain functions within the office, so that employee talent can be applied to successfully achieving the overall goals of the company and meeting new challenges.  d. d. lombardi
computer performance evaluation (sigmetrics): brownian motion?  over the past decade, computer performance evaluation (cpe) has gained increasing importance and attention. evaluation was originally performed at the level of the hardware components and the focus has since migrated out towards the perspective of the user. in between, there are methods of analysis that are directed at the evaluation of system software performance and application program performance. the data collection tools used for the analyses range from hardware and software monitors to questionnaires and accounting logs. for every data collection tool, there exist numerous data reduction methods. as a result, several theories of computer performance evaluation have evolved, not all of which are necessarily consistent. the choice of data collection tools, data reduction tools, and cpe theory does not appear to abide by any generally agreed to criteria. an organization that undertakes a cpe effort has no real guidance as to its choice of method.  what are the objectives of cpe? in what way can each of the many cpe tools and theories help to achieve these objectives and, just as importantly, in what respects are these same tools merely avenues to the collection of useless data? as cpe proliferates, management becomes increasingly aware of the costs of undertaking cpe efforts. is there a unified theory of cpe; an unstated objective toward which all cpe activity is presumed to be striving? if there is such an unstated objective, to what extent has the last decade of cpe activity seen progress toward that objective? alternatively, to what extent has all this activity simply been the irregular (brownian) motion of cpe practitioners?  wayne douglas bennett
an experimental sound-based hierarchical menu navigation system for visually handicapped use of graphical user interfaces  the use of modern computers by the visually handicapped has become more difficult over the past few years. in earlier systems the user interface was a simple character based environment. in those systems, simple devices like screen readers, braille output and speech synthesizers were effective. current systems now run graphical user interfaces (guis) which have rendered these simple aids almost useless.  in the current work we are developing a tonally based mechanism that allows the visually handicapped user to navigate through the same complex hierarchical menu structures used in the gui. the software can be easily, and cheaply, incorporated in modern user interfaces, making them available for use by the visually handicapped. in the remainder of this paper we present a description of the sound-based interfaces as well as the techniques we have developed to test them.  a. i. karshmer p. brawner g. reiswig
the role of "help networks" in facilitating use of cscw tools  the pattern of cscw system users helping other using to resolve problems and make more effective use of such tools has been observed in a variety of settings, but little is known about how help patterns develop or their effects. results from a pre-post study of the implementation of cscw tools among university faculty, staff and administration indicate that the network of helping relationships is largely disaggregated and generally follows work group alignments rather than technical specialization. a relatively small group of "high providers" is responsible for most help to users, and tends to act as a liaison between central support staff and work group members. these providers are not systematically different from other personnel except in terms of their expertise. implications of these findings for the development and cultivation of help relationships in support of cscw are developed.  j. d. eveland anita blanchard william brown jennifer mattocks
extracting semi-structured data through examples  in this paper, we describe an innovative approach to extracting semi- structured data from web sources. the idea is to collect a couple of example objects from the user and to use this information to extract new objects from new pages or texts. to perform the extraction of new objects, we introduce a bottom-up extration strategy and, through experimentation, demonstrate that it works quite effectively with distinct web sources, even if only a few examples are provided by the user.  berthier ribeiro-neto alberto h. f. laender altigran s. da silva
relief from the audio interface blues: expanding the spectrum of menu, list, and form styles  menus, lists, and forms are the workhorse dialogue structures in telephone- based interactive voice response applications. despite diversity in applications, there is a surprising homogeneity in the menu, list, and form styles commonly employed. there are, however, many alternatives, and no single style fits every prospective application and user population. a design space for each dialogue structure organizes the alternatives and provides a framework for analyzing their benefits and drawbacks. in addition to phone- based interactions, the design spaces apply to any limited-bandwidth, temporally constrained display devices, including small-screen devices such as personal digital assistants (pdas) and screen phones.  paul resnick robert a. virzi
tilepic: a file format for tiled hierarchical data  tilepic is a method for storing tiled data of arbitrary t ype in a hierarchical, indexed format for fast retrieval. it is useful for storing moderately large, static, spatial datasets in a manner that is suitable for panning and zooming over the data, especially in distributed applications. because different data types may be stored in the same object, tilepic can support semantic zooming as well. it has proven suitable for a wide variety of applications involving the networked access and presentation of images, geographic data, and text. the tilepic format and its supporting tools are unencumbered, and available to all.  jeff anderson-lee robert wilensky
efficient algorithms for mining outliers from large data sets  in this paper, we propose a novel formulation for distance-based _outliers_ that is based on the distance of a point from its _kth_ nearest neighbor. we rank each point on the basis of its distance to its _kth_ nearest neighbor and declare the top _n_ points in this ranking to be outliers. in addition to developing relatively straightforward solutions to finding such outliers based on the classical nested-loop join and index join algorithms, we develop a highly efficient _partition-based_ algorithm for mining outliers. this algorithm first partitions the input data set into disjoint subsets, and then prunes entire partitions as soon as it is determined that they cannot contain outliers. this results in substantial savings in computation. we present the results of an extensive experimental study on real-life and synthetic data sets. the results from a real-life nba database highlight and reveal several expected and unexpected aspects of the database. the results from a study on synthetic data sets demonstrate that the partition-based algorithm scales well with respect to both data set size and data set dimensionality.  sridhar ramaswamy rajeev rastogi kyuseok shim
interfaces in organizations (panel session): supporting group work  research on human factors in computer systems has emphasized supporting individuals. this panel will discuss new issues that emerge when computer systems support groups of people and whole organizations. malone (see following paper) will suggest a broadening of the definition of user interfaces to include "organizational interfaces" and will indicate how a theoretical base for such an endeavor might be developed. then cashman will describe a "coordinator tool" in use at dec for tracking the assignment of tasks to people in activities such as software maintenance. finally, brown will suggest how computer systems can be designed to radically increase the bandwidth of cooperation in groups by, for example, exploiting linguistic notions of context.  irene greif john seely brown paul m. cashman thomas malone
the role of integral displays in decision making  a common approach to designing human-computer decision systems is to divide decision tasks between the person and the computer. the success of this approach depends on knowledge of the specific task components and their interactions, information important for allocating tasks to man and machine. such knowledge is often unavailable for complex, realistic decision situations. also, people are reluctant to relinquish part of their decision- making responsibilities. one way to circumvent these problems is to provide general assistance to the decision maker that is independent of any particular decision situation. we propose to use the computer to reduce the decision maker's cognitive load rather than his task load. specifically, we hope to show that human decision processes can be aided by displaying decision- relevant information in ways that capitalize on certain characteristics of the human perceputal system.  timothy e. goldsmith roger w. schvaneveldt
videomap and videospaceicon: tools for anatomizing video content  a new approach to interacting with stored video is proposed. the approach utilizes videomap and videospaceicon. videomap is the interface that shows the essential video features in an easy to perceive manner. videospaceicon represents the temporal and spatial characteristics of a video shot as an intuitive icon. a video indexing method supports both tools. these tools allow the user's creativity to directly interact with the essential features of each video by offering spatial and temporal clues. this paper introduces the basic concept and describes prototype versions of the tools as implemented in a video handling system. videomap and videospaceicon are effective for video handling functions such as video content analysis, video editing, and various video applications which need an intuitive visual interface.  yoshinobu tonomura akihito akutsu kiyotaka otsuji toru sadakata