waashk/acm huggingface dataset:
extending a relational database with deferred referential integrity checking and intelligent joins  interactive use of relational database management systems (dbms) requires a user to be knowledgeable about the semantics of the application represented in the database. in many cases, however, users are not trained in the application field and are not dbms experts. two categories of functionality are problematic for such users: (1) updating a database without violating integrity constraints imposed by the domain and (2) using join operations to retrieve data from more than one relation. we have been conducting research to help an uninformed or casual user interact with a relational dbms.  this paper describes two capabilities to aid an interactive database user who is neither an application specialist nor a dbms expert. we have developed deferred referential integrity checking (ric) and intelligent join (ij) which extend the operations of a relational dbms. these facilities are made possible by explicit representation of database semantics combined with a relational schema. deferred ric is a static validation procedure that checks uniqueness of tuples, non-null keys, uniqueness of keys, and inclusion dependencies. ij allows a user to identify only the "target" data which is to be retrieved without the need to additionally specify "join clauses". in this paper we present the motivation for these facilities, describe the features of each, and present examples of their use.  stephanie cammarata prasadram ramachandra darrell shane
mining the web for acronyms using the duality of patterns and relations  the web is a rich source of information, but this information is scattered and hidden in the diversity of web pages. search engines are windows to the web. however, the current search engines, designed to identify pages with specified phrases have very limited power. for example, they cannot search for phrases related in a particular way (e.g. books and their authors).  in this paper we present a solution for identifying a set of inter-related information on the web using the duality concept. duality problems arise when one tries to identify a pair of inter-related phrases such as (book, author), (name, email) or (acronym, expansion) relations. we propose a solution to this problem that iteratively refines mutually dependent approximations to their identifications. specifically, we iteratively refine i) pairs of phrases related in a specific way, and ii) the patterns of their occurrences in web pages, i.e. the ways in which the related phrases are marked in the pages. we cast light on the general solution of the duality problems in the web by concentrating on one paradigmatic duality problem i.e. identifying (acronym, expansion) pairs in terms of the patterns of their occurrences in the web pages. the solution to this problem involves two mutually dependent duality problems of 1) the duality between the related pairs and their patterns, and 2) the duality between the related pairs and the acronym formulation rules.  jeonghee yi neel sundaresan
a device able to get and play music  to process music might appear easy, but to exchange musical information, in real time, between a computer and a device seems more difficult. our paper presents a realization of a musical peripheral built with an electronic organ and that allows a computer to get the information that comes from the keyboard or play music on the organ.  the system is not too complex because our first preocupation was to encode music under a digital form, and then to create automatically the encoding. we present algorithms, realizations and perspectives.  c. aperghis-tramoni
a dynamic load balancing strategy for parallel datacube computation  in recent years, olap technologies have become one of the important applications in the database industry. in particular, the datacube operation proposed in [5] receives strong attention among researchers as a fundamental research topic in the olap technologies. the datacube operation requires computation of aggregations on all possible combinations of each dimension attribute. as the number of dimensions increases, it becomes very expensive to compute datacubes, because the required computation cost grows exponentially with the increase of dimensions. parallelization is very important factor for fast datacube computation. however, we cannot obtain sufficient performance gain in the presence of data skew even if the computation is parallelized. in this paper, we present a dynamic load balancing strategy, which enables us to extract the effectiveness of parallizing datacube computation sufficiently. we perform experiments based on simulations and show that our strategy performs well.  seigo muto masaru kitsuregawa
infinite detail and emulation in an ontologically minimized hci  by default, we attempt to define practical areas of technological endeavor as "applications." for example, the applied psychology of human-computer interaction has characteristically been defined in terms of the methods and concepts basic psychology can provide. this has not worked well. an alternative approach is to begin from a characterization of current practice, to take seriously the requirements of the domain of endeavor, and to define areas of "science" and "application" as possible and appropriate in that context.  john m. carroll
automatic construction of personalized tv news programs  in this paper, we study the automatic construction of personalized tv news programs, where we want to build a program with predefined duration and maximum content value for a specific user. we combine video indexing techniques to parse tv news recordings into stories, and information filtering techniques to select stories which are most adequate given the user profile. we formalize the selection process as an optimization problem, and we study how to take into account duration in the selection of stories. experiments show that a simple heuristic can provide high quality selection with little computation. we also describe two prototypes, which implement two different mechanisms for the construction of user profiles:  explicit specification, using a category-based model,  implicit specification, using a keyword-based model.  bernard merialdo kyung tak lee dario luparello jeremie roudaire
semantics and implementation of schema evolution in object-oriented databases  object-oriented programming is well-suited to such data-intensive application domains as cad/cam, ai, and ois (office information systems) with multimedia documents. at mcc we have built a prototype object-oriented database system, called orion. it adds persistence and sharability to objects created and manipulated in applications implemented in an object-oriented programming environment. one of the important requirements of these applications is schema evolution, that is, the ability to dynamically make a wide variety of changes to the database schema. in this paper, following a brief review of the object- oriented data model that we support in orion, we establish a framework for supporting schema evolution, define the semantics of schema evolution, and discuss its implementation.  jay banerjee won kim hyoung-joo kim henry f. korth
haystack: per-user information environments  traditional information retrieval (ir) systems are designed to provide uniform access to centralized corpora by large numbers of people. the haystack project emphasizes the relationship between a particular individual and his corpus. an individual's own haystack priviliges information with which that user interacts, gathers data about those interactions, and uses this metadata to further personalize the retrieval process. this paper describes the prototype haystack system.  eytan adar david kargar lynn andrea stein
joined normal form: a storage encoding for relational databasess  a new on-line query language and storage structure for a database machine is presented. by including a mathematical model in the interpreter the query language has been substantially simplified so that no reference to relation names is necessary. by storing the model as a single joined normal form (jnf) file, it has been possible to exploit the powerful search capability of the content addressable file store (cafs®; cafs is a registered trademark of international computers limited) database machine.  e. babb
video manga: generating semantically meaningful video summaries  this paper presents methods for automatically creating pictorial video summaries that resemble comic books. the relative importance of video segments is computed from their length and novelty. image and audio analysis is used to automatically detect and emphasize meaningful events. based on this importance measure, we choose relevant keyframes. selected keyframes are sized by importance, and then efficiently packed into a pictorial summary. we present a quantitative measure of how well a summary captures the salient events in a video, and show how it can be used to improve our summaries. the result is a compact and visually pleasing summary that captures semantically important events, and is suitable for printing or web access. such a summary can be further enhanced by including text captions derived from ocr or other methods. we describe how the automatically generated summaries are used to simplify access to a large collection of videos.  shingo uchihashi jonathan foote andreas girgensohn john boreczky
improving database design through the analysis of relationships  much of the work on conceptual modeling involves the use of an entity- relationship model in which binary relationships appear as associations between two entities. relationships involving more than two entities are considered rare and, therefore, have not received adequate attention. this research provides a general framework for the analysis of relationships in which binary relationships simply become a special case. the framework helps a designer to identify ternary and other higher-degree relationships that are commonly represented, often inappropriately, as either entities or binary relationships. generalized rules are also provided for representing higher- degree relationships in the relational model. this uniform treatment of relationships should significantly ease the burden on a designer by enabling him or her to extract more information from a real-world situation and represent it properly in a conceptual design.  debabrata dey veda c. storey terence m. barron
using examples to describe categories  the successful use of menu- based information retrieval systems depends critically on users understanding the category names and partitions used by system designers. some of the problems in this endeavor are psychological and have to do with naming large and ill-defined categories so that users can understand their contents, and effectively partitioning large sets of objects. systems of interest (like home information systems) often consist of new and frequently changing content in large and varied domains, and are particularly prone to these problems. we explored several ways in which one might name categories in one such domain (yellow page category headings) - category names, category names plus examples, and examples alone. we found that three examples alone were essentially as good a way to name these categories as either an expertly chosen name or a name plus examples. examples provide a promising possibility both as a means of flexibly naming menu categories and as a methodological tool to study certain categorization problems.  susan t. dumais thomas k. landauer
document ranking on weight-partitioned signature files  a signature file organization, called the weight-partitioned signature file, for supporting document ranking is proposed. it employs multiple signature files, each of which corresponds to one term frequency, to represent terms with different term frequencies. words with the same term frequency in a document are grouped together and hashed into the signature file corresponding to that term frequency. this eliminates the need to record the term frequency explicitly for each word. we investigate the effect of false drops on retrieval effectiveness if they are not eliminated in the search process. we have shown that false drops introduce insignificant degradation on precision and recall when the false-drop probability is below a certain threshold. this is an important result since false-drop elimination could become the bottleneck in systems using fast signature file search techniques. we perform an analytical study on the performance of the weight-partitioned signature file under different search strategies and configurations. an optimal formula is obtained to determine for a fixed total storage overhead the storage to be allocated to each partition in order to minimize the effect of false drops on document ranks. experiments were performed using a document collection to support the analytical results.  dik kun lee liming ren
the management of human errors in user-centered design user-centered design puts the users at the center of the design activity by involving them from the very beginning in the process and by iteratively testing and re-designing the product. in every testing and evaluation phase human error analysis plays an important role. although it is not possible to design systems in which people do not make errors, much can be done to minimize the incidence of error, to maximize error detection, and to make easier error recovery. however, the qualitative analysis on human error has not received the attention that it deserves. in the paper the main features of the user-centered approach are sketched and a set of guidelines for handling human error is presented. an example drawn from our design experience is reported for each guideline. a. rizzo o. parlangeli e. marchigiani s. bagnara
handling infinite temporal data  in this paper, we present a powerful framework for describing, storing, and reasoning about infinite temporal information. this framework is an extension of classical relational databases. it represents infinite temporal information by generalized tuples defined by linear repeating points and constraints on these points. we prove that relations formed from generalized tuples are closed under the operations of relational algebra. a characterization of the expressiveness of generalized relations is given in terms of predicates definable in presburger arithmetic. finally, we provide some complexity results.  f. kabanza j.-m. stevenne p. wolper
effects of annotations on student readers and writers  recent research on annotations has focused on how readers annotate texts, ignoring the question of how reading annotations might affect subsequent readers of a text. this paper reports on a study of persuasive essays written by 123 undergraduates receiving primary source materials annotated in various ways. findings indicate that annotations improve findings indicate that annotations improve recall of emphasized items, influence how specific arguments in the source materials are perceived, decrease students' tendencies to unnecessarily summarize. of particular interest is that students' perceptions of the annotator appeared to greatly influence how they responded to the annotated material. using this study as a basis, i discuss implications for the design and implementation of digitally annotated materials.  joanna l. wolfe
information dependencies  this paper uses the tools of information theory to examine and reason about the information content of the attributes within a relation instance. for two sets of attributes x and y, an information dependency measure (ind measure) characterizes the uncertainty remaining about the values for the set y when the values for the set x are known. a variety of arithmetic inequalities (ind inequalities) are shown to hold among ind measures; ind inequalities hold in any relation instance. numeric constraints (ind constraints) on ind measures, consistent with the ind inequalities, can be applied to relation instances. remarkably, functional and multivalued dependencies correspond to setting certain constraints to zero, with armstrong's axioms shown to be consequences of the arithmetic inequalities applied to constraints. as an analog of completeness, for any set of constraints consistent with the inequalities, we may construct a relation instance that approximates these constraints within any positive ε. ind measures suggest many valuable applications in areas such as data mining.  mehmet m. dalkilic edward l. roberston
multimodal people id for a multimedia meeting browser  a meeting browser is a system that allows users to review a multimedia meeting record from a variety of indexing methods. identification of meeting participants is essential for creating such a multimedia meeting record. moreover, knowing who is speaking can enhance the performance of speech recognition and indexing meeting transcription. in this paper, we present an approach that identifies meeting participants by fusing multimodal inputs. we use face id, speaker id, color appearance id, and sound source directional id to identify and track meeting. after describing the different modules in detail, we will discuss a framework for combining the information sources. integration of the multimodal people id into the multimedia meeting browser is in its preliminary stage.  jie yang xiaojin zhu ralph gross john kominek yue pan alex waibel
extending relational algebra and relational calculus with set-valued attributes and aggregate functions  in commercial network database management systems, set-valued fields and aggregate functions are commonly supported. however, the relational database model, as defined by codd, does not include set-valued attributes or aggregate functions. recently, klug extended the relational model by incorporating aggregate functions and by defining relational algebra and calculus languages.  in this paper, relational algebra and relational calculus database query languages (as defined by klug) are extended to manipulate set-valued attributes and to utilize aggregate functions. the expressive power of the extended languages is shown to be equivalent. we extend the relational algebra with three new operators, namely, pack, unpack, and aggregation-by-template. the extended languages form a theoretical framework for statistical database query languages.  g. ozsoyoglu z. m. ozsoyoglu v. matos
towards a model of user perception of computer systems response time  the foundational structure of a new model of user perception of computer system response time is proposed. it is suggested that the development of such a model is now of central importance to the computer system configuration design effort. the new model is seen to explain the success of an earlier measure, designed for the non-interactive environment, in predicting user estimates of response time for interactive systems. the results of new empirical studies, designed to delineate specific components of the model, are also discussed.  robert geist robert allen ronald nowaczyk
from theory to practice or how not to fail in developing information systems the development of information systems consists of a wide variety of activities and processes, which come together to create a product designed for a specific purpose. we often encounter products that do not serve the purpose they were intended for, and the question asked is: how does it happen that a process that has been defined and structured in principle, has such a high failure ratio? the purpose of this article is to attempt to clarify the problematic points or subjects that exist in the process of developing information systems and to supply the tools to help reduce the problem. offer drori
pva: a self-adaptive personal view agent system in this paper, we present pva, an adaptive personal view information agent system to track, learn and manage, user's interests in internet documents. when user's interests change, pva, in not only the contents, but also in the structure of user profile, is modified to adapt to the changes. experimental results show that modulating the structure of user profile does increase the accuracy of personalization systems. chien chin chen meng chang chen yeali sun
hypertext versus boolean access to biomedical information: a comparison of effectiveness, efficiency, and user preferences  this study compared of two modes of access to a biomedical database, in terms of their effectiveness and efficiency in supporting clinical problem solving and in terms of user preferences. boolean access, which allowed subjects to frame their queries as combinations of keywords, was compared to hypertext access, which allowed subjects to navigate from one database node to another. the accessible biomedical data were identical across system versions. performance data were collected from two cohorts of first-year medical students, each student randomly assigned to either the boolean or the hypertext system. additional attitudinal data were collected from the second cohort. at each of two research sessions (one just before and one just after their bacteriology course), subjects worked eight clinical case problems, first using only their personal knowledge and, subsequently, with aid from the database. database retrievals enabled students to answer questions they could not answer based on personal knowledge alone. this effect was greater when personal knowledge of bacteriology was lower. there were not statistically significant differences between the two forms of access, in terms of problem- solving effectiveness or efficiency. students preferred boolean access over hypertext access.  barbara m. wildemuth charles p. friedman stephen m. downs
security of statistical databases: multidimensional transformation  the concept of multidimensional transformation of statistical databases is described. a given set of statistical output may be compatible with more than one statistical database. a transformed database d' is a database which (1) differs from the original database d in its record content, but (2) produces, within certain limits, the same statistical output as the original database. for a transformable database d there are two options: one may physically transform d into a suitable database d', or one may release only that output which will not permit the users to decide whether it comes from d or d'. the second way is, of course, the easier one. basic structural requirements for transformable statistical databases are investigated. the closing section discusses advantages, drawbacks, and open questions.  jan schlörer
decompiling codasyl dml into retional queries  a "decompilation" algorithm is developed to transform a program written with the procedural operations of codasyl dml into one which interacts with a relational system via a nonprocedural query specification. an access path model is introduced to interpret the semantic accesses performed by the program. data flow analysis is used to determine how find operations implement semantic accesses. a sequence of these is mapped into a relational query and embedded into the original program. the class of programs for which the algorithm succeeds is characterized.  r. h. katz e. wong
text input methods for eye trackers using off-screen targets  text input with eye trackers can be implemented in many ways such as on-screen keyboards or context sensitive menu-selection techniques. we propose the use of off-screen targets and various schemes for decoding target hit sequences into text. off-screen targets help to avoid the midas' touch problem and conserve display area. however, the number and location of the off-screen targets is a major usability issue. we discuss the use of morse code, our minimal device independent text input method (mditim), quikwriting, and cirrin-like target arrangements. furthermore, we describe our experience with an experimental system that implements eye tracker controlled mditim for the windows environment.  poika isokoski