waashk/acm huggingface dataset:
the multilevel relational (mlr) data model  many multilevel relational models have been proposed; different models offer different advantages. in this paper, we adapt and refine several of the best ideas from previous models and add new ones to build the new multilevel relational (mlr) data model. mlr provides multilevel relations with element- level labeling as a natural extension of the traditional relational data model. mlr introduces several new concepts (notably, data-borrow integrity and the uplevel statement) and significantly redefines existing concepts (polyinstantiation and referential integrity as well as data manipulation operations). a central contribution of this paper is proofs of soundness, completeness, and security of mlr. a new data-basedsemantics is given for the mlr data model by combining ideas from seaview, belief-based semantics, and ldv. this new semantics has the advantages of both eliminating ambiguity and retaining upward information flow. mlr is secure, unambiguous, and powerful. it has five integrity properties and five operations for manipulating multilevel relations. soundness, completeness, and security show that any of the five database manipulation operations will keep database states legal (i.e., satisfy all integrity properties), that every legal database state can be constructed, and that mlr is noninterfering. the expressive power of mlr also compares favorably with several other models.  ravi sandhu fang chen
social presence in web surveys  social interface theory has widespread influence in the field of human- computer interaction. the basic thesis is that humanizing cues in a computer interface can engender responses from users similar to human-human interaction. in contrast, the survey interviewing literature suggests that computer administration of surveys on highly sensitive topics reduces or eliminates social desirability effect, even when such humanizing features as voice are used.  in attempting to reconcile these apparently contradictory findings, we varied features of the interface in a web survey (n=3047). in one treatment, we presented an image of 1) a male researcher, 2) a female researcher, or 3) the study logo at several points. in another, we varied the extent of personal feedback provided. we find little support for the soical interface hypothesis. we describe our study and discuss possible reasons for the contradictory evidence on social interfaces  mick p. couper roger tourangeau darby m. steiger
efficient and effective metasearch for a large number of text databases  metasearch engines can be used to facilitate ordinary users for retrieving information from multiple local sources (text databases). in a metasearch engine, the contents of each local database is represented by a representative. each user query is evaluated against the set of representatives of all databases in order to determine the appropriate databases to search. when the number of databases is very large, say in the order of tens of thousands or more, then a traditional metasearch engine may become inefficient as each query needs to be evaluated against too many database representatives. furthermore, the storage requirement on the site containing the metasearch engine can be very large. in this paper, we propose to use a hierarchy of database representatives to improve the efficiency. we provide an algorithm to search the hierarchy. we show that the retrieval effectiveness of our algorithm is the same as that of evaluating the user query against all database representatives. we also show that our algorithm is efficient. in addition, we propose an alternative way of allocating representatives to sites so that the storage burden on the site containing the metasearch engine is much reduced.  clement yu weiyi meng king-lup liu wensheng wu naphtali rishe
tradeoffs in displaying peripheral information  peripheral information is information that is not central to a person's current task, but provides the person the opportunity to learn more, to do a better job, or to keep track of less important tasks. though peripheral information displays are ubiquitous, they have been rarely studied. for computer users, a common peripheral display is a scrolling text display that provides announcements, sports scores, stock prices, or other news. in this paper, we investigate how to design peripheral displays so that they provide the most information while having the least impact on the user's performance on the main task. we report a series of experiments on scrolling displays aimed at examining tradeoffs between distraction of scrolling motion and memorability of information displayed. overall, we found that continuously scrolling displays are more distracting than displays that start and stop, but information in both is remembered equally well. these results are summarized in a set of design recommendations.  paul p. maglio christopher s. campbell
a goal-driven auto-configuration tool for the distributed workflow management system mentorlite  the mentor-lite prototype has been developed within the research project "architecture, configuration, and administration of large workflow management systems" funded by the german science foundation (dfg). it has evolved from its predecessor mentor [1], but aims at a simpler architecture. the main goal of mentor-lite has been to build a light-weight, extensible, and tailorable workflow management system (wfms) with small footprint and easy-to-use administration capabilities. our approach is to provide only kernel functionality inside the workflow engine, and consider system components like history management and worklist management as extensions on top of the kernel. the key point to retain the light-weight nature is that these extensions are implemented as workflows themselves.  the workflow specifications are interpreted at runtime, which is a crucial prerequisite for flexible exception handling and dynamic modifications during runtime. the interpreter performs a stepwise execution of the workflow specification according to its formal semantics. for each step, the activities to be performed by the step are determined and started.  mentor-lite supports a protocol for distributed execution of workflows spread across multiple workflow engines. this support is crucial for workflows that span large, decentralized enterprises with largely autonomous organizational units or even cross multiple enterprises to form so-called "virtual enterprises". a communication manager is responsible for sending and receiving synchronization messages between the engines. in order to guarantee a consistent global state even in the presence of site or network failures, we have built reliable message queues using the corba object transaction services.  for administration, mentor-lite provides a java-based workbench for workflow design, workflow partitioning across multiple workflow servers, and a java- based runtime monitoring tool.  michael gillmann jeanine weissenfels german shegalov wolfgang wonner gerhard weikum
scalable browsing for large collections: a case study  phrase browsing techniques use phrases extracted automatically from a large information collection as a basis for browsing and accessing it. this paper describes a case study that uses an automatically constructed phrase hierarchy to facilitate browsing of an ordinary large web site. phrases are extracted from the full text using a novel combination of rudimentary syntactic processing and sequential grammar induction techniques. the interface is simple, robust and easy to use.  to convey a feeling for the quality of the phrases that are generated automatically, a thesaurus used by the organization responsible for the web site is studied and its degree of overlap with the phrases in the hierarchy is analyzed. our ultimate goal is to amalgamate hierarchical phrase browsing and hierarchical thesaurus browsing: the latter provides an authoritative domain vocabulary and the former augments coverage in areas the thesaurus does not reach.  gordon w. paynter ian h. witten sally jo cunningham george buchanan
the denver model for groupware design the denver model is offered as a framework with which to plan or evaluate the capabilities associated with a particular groupware application. this model was the output of 14 participants at the two day workshop on designing and evaluating groupware, held at chi'95, denver colorado. the denver model consists of three submodels: goals and requirements, design and technology. a description of the framework is provided and evaluation strategies are described in this paper. tony salvador jean scholtz james larson
on the design and quantification of privacy preserving data mining algorithms  the increasing ability to track and collect large amounts of data with the use of current hardware technology has lead to an interest in the development of data mining algorithms which preserve user privacy. a recently proposed technique addresses the issue of privacy preservation by perturbing the data and reconstructing distributions at an aggregate level in order to perform the mining. this method is able to retain privacy while accessing the information implicit in the original attributes. the distribution reconstruction process naturally leads to some loss of information which is acceptable in many practical situations. this paper discusses an expectation maximization (em) algorithm for distribution reconstruction which is more effective than the currently available method in terms of the level of information loss. specifically, we prove that the em algorithm converges to the maximum likelihood estimate of the original distribution based on the perturbed data. we show that when a large amount of data is available, the em algorithm provides robust estimates of the original distribution. we propose metrics for quantification and measurement of privacy-preserving data mining algorithms. thus, this paper provides the foundations for measurement of the effectiveness of privacy preserving data mining algorithms. our privacy metrics illustrate some interesting results on the relative effectiveness of different perturbing distributions.  dakshi agrawal charu c. aggarwal
accessing data cubes along complex dimensions  in a data warehouse, data cubes are accessed through their dimensions. if dimensions are numerical, because numerical data can be clustered or sorted, fast access methods such as binary search or b+ trees can be applied. however, complex attributes such as keyword sets of document contents are not easily sorted or clustered. although it is highly desirable that documents can be searched through their sets of keywords.  signature index is known for its ability to search along complex attributes. we propose a new indexing structure, dimensional signature index (dsi), for fast query processing in data cubes. dsi is particularly suitable for accessing data in data cubes through complex dimensions.  through a mathematical analysis, we found that if one signature index (feature index) is built for each dimension of the data cube, if the size of all feature indices is equal to the size of a large signature index for the entire data cube as a flat file, and if a query execution involves all dimensions of a data cube, the search cost in all these feature indices is the same as the search cost in the large signature index for the entire data cube.  the significance of this discovery is that usually a query does not involve all dimensions of a data cube. by making one feature index for each dimension, only those feature indices involved in the query predicates need to be accessed. on average, this represents significant faster query executions than using a large signature file for the entire data cube.  the use of dsi scheme does not exclude the use of other fast signature index schemes. each feature index in dsi can also use any of the previously proposed fast signature indices (s-trees, multi-leveled, frame-sliced, etc.) to achieve even faster access speed.  yuping yang mukesh singhal
new technology and new roles: the need for "corpus editors"  digital libraries challenge humanists and other academics to rethink the relationship between technology and their work. at the perseus project, we have seen the rise of a new combination of skills. the "corpus editor" manages a collection of materials that are thematically coherent and focused but are too large to be managed soley with the labor-intensive techniques of traditional editing. the corpus editor must possess a degree of domain specific knowledge and technical expertise that virtually no established graduate training provides. this new position poses a challenge to humanists as they train and support members of the field pursuing new, but necessary tasks.  gregory crane jeffrey a. rydberg-cox
a more general model for handling missing information in relational databases using a 3-valued logic  codd proposed the use of two interpretations of nulls to handle missing information in relational databases that may lead to a 4-valued logic [codd86, codd87]. in a more general model, three interpretations of nulls are necessary [roth, zani]. without simplification, this may lead to a 7-valued logic, which is too complicated to be adopted in relational databases. for such a model, there is no satisfactory simplification to a 4-valued logic. however, by making a straightforward simplification and using some proposed logical functions, a 3-valued logic can handle all three interpretations.  kwok-bun yue
taming the wolf in sheep's clothing: privacy in multimedia communications  when ubiquitous multimedia technology is introduced in an organization, the privacy implications of that technology are rarely addressed. users usually extend the trust they have in an organization to the technology it employs. this paper reports results from interviews with 24 internet engineering task force (ietf) attendees whose presentations or contributions to ietf sessions were transmitted on the multicast backbone (mbone). due to a high level of trust in the organization, these users had few initial concerns about the privacy implications of this technology. however, interviewees' trust relied on inaccurate assumptions, since the interviews revealed a number of potential and actual invasions of privacy in transmission, recording and editing of multicast data. previous research found that users who experience an unexpected invasion of their privacy are not only likely to reject the technology that afforded the invasion, but lose trust in the organization that introduced it [2,3]. we discuss a number of mechanisms and policies for protecting users' privacy in this particular application, and propose a strategy for introducing networked multimedia technology in general.  anne adams martina angela sasse
working-memory failure in phone-based interaction  this article investigates working-memory (wm) failure in phone-based interaction (pbi). we used a computational model of phone-based interaction (pbi user) to generate predictions about the impact of three factors on wm failure:pbi features (i.e. menu structure), individual differences (i.e., wm capacity), and task characteristics (i.e., number of tasks). our computational model stipulates that both the storage and the processing of information contribute to wm failure. in practical terms the model and the empirical results indicate that, contrary to guidelines for the design of phone-based interfaces, deep menu hierarchies (no more than three options per menu) do not reduce wm error rates in pbi. at a more theoretical level, the study shows that the use of a computational model in hci research provides a systematic approach for explaining complex empirical results.  brian r. huguenard f. javier lerch brian w. junker richard j. patz robert e. kass
the university of california cd-rom information system  the university of california cd-rom information system replaces the equivalent of 260,000 books of published federal statistics with a cd-rom-based online information system. the size of this database is currently 270 cd-roms (135gb). it contains 1990 u.s. census data (approximately 3,000 items of socio-economic and demographic information, including race-ethnicity, employment, income, educational level, and poverty) for every block and census tract in the u.s., as well as u.s. foreign trade data by commodity from every city in the u.s. to every country in the world. it also contains the digitized map outline boundary data for city blocks for the entire u.s. (census tiger files).  deane merrill nathan parker fredric gey chris stuber
concurrency control in database systems: a step towards the integration of optimistic methods and locking  the traditional approach to concurrency control is based on locking. recently, new methods have been presented called optimistic methods. these methods are well suited in situations where the likelihood of conflicting actions is rather small. otherwise locking should be used. typically in database systems it is not known in advance what kind of transactions are to be processed. therefore what is really needed are methods which combine the benefits of optimistic methods and locking. this paper is a first step in this direction.  george lausen
melding structured abstracts and world wide web for retrieval of reusable components  reusable software libraries (rsls) often suffer from poor interfaces, too many formal standards, high levels of training required for their use, and most of all, a high cost to build and maintain. hence, rsls have largely failed to return the reuse benefits promised by their developers. this paper first describes an rsl implementation using the world wide web (www) browser mosaic and shows how it meets most rsl needs, avoids most rsl pitfalls, and costs only a fraction of the cost for the average commercial rsl. second, the paper describes a way to quickly assess the important aspects of a piece of software so programmers can decide whether or not to reuse it. using the observation that when programmers discuss software they tend to convey the same key information in a somewhat predictable order, this paper describes a method to automatically mimic this activity using a structured abstract of reusable components. structured abstracts provide a natural, easy to use way for developers to (1) search for components, (2) quickly assess the component for use, and (3) submit components to the rsl.  jeffrey s. poulin keith j. werkman
shortest-substring retrieval and ranking  we present a model for arbitrary passage retrieval using boolean queries. the model is applied to the task of ranking documents, or other structural elements, in the order of their expected relevance. features such as phrase matching, truncation, and stemming integrate naturally into the model. properties of boolean algebra are obeyed, and the exact-match semantics of boolean retrieval are preserved. simple inverted-list file structures provide an efficient implementation. retrieval effectiveness is comparable to that of standard ranking techniques. since global statistics are not used, the method is of particular value in distributed environments. since ranking is based on arbitrary passages, the structural elements to be ranked may be specified at query time and do not need to be restricted to predefined elements.  charles l. a. clarke gordon v. cormack
spatial workspace collaboration: a sharedview video support system for remote collaboration capability  collaboration in three-dimensional space: "spatial workspace collaboration" is introduced and an approach supporting its use via a video mediated communication system is described. verbal expression analysis is primarily focused on. based on experiment results, movability of a focal point, sharing focal points, movability of a shared workspace, and the ability to confirm viewing intentions and movements were determined to be system requirements necessary to support spatial workspace collaboration. a newly developed sharedview system having the capability to support spatial workspace collaboration is also introduced, tested, and some experimental results described.  hideaki kuzuoka
beyond being there  a belief in the efficacy of imitating face-to-face communication is an unquestioned presupposition of most current work on supporting communications in electronic media. in this paper we highlight problems with this presupposition and present an alternative proposal for grounding and motivating research and development that frames the issue in terms of needs, media, and mechanisms. to help elaborate the proposal we sketch a series of example projects and respond to potential criticisms.  jim hollan scott stornetta
one is not enough: multiple views in a media space  media spaces support collaboration, but the limited access they provide to remote colleagues' activities can undermine their utility. to address this limitation, we built an experimental system in which four switchable cameras were deployed in each of two remote offices, and observed participants using the system to collaborate on two tasks. the new views allowed increased access to task-related artifacts; indeed, users preferred these views to more typical "face-to-face" ones. however, problems of establishing a joint frame of reference were exacerbated by the additional complexity, leading us to speculate about more effective ways to expand access to remote sites.  william w. gaver abigail sellen christian heath paul luff
the architecture of a heterogeneous distributed database management system: the distributed access view integrated database (david)  this paper describes the architecture of a heterogeneous distributed database management system called the distributed access view integrated database (david). the david system allows uniform access to distributed data stored in different dbmss that support various data models. the system presents the users with a unified cluster data model and with a uniform high level query language (gsql). database heterogeneity issues such as external-to-conceptual view translation, view integration, query processing and the definition of a uniform data access language are presented in the context of the david development.  bharat bhasker csaba j. egyhazy konstantinos p. triantis
query optimization in a memory-resident domain relational calculus database system  we present techniques for optimizing queries in memory- resident database systems. optimization techniques in memory-resident database systems differ significantly from those in conventional disk-resident database systems. in this paper we address the following aspects of query optimization in such systems and present specific solutions for them: (1) a new approach to developing a cpu-intensive cost model; (2) new optimization strategies for main-memory query processing; (3) new insight into join algorithms and access structures that take advantage of memory residency of data; and (4) the effect of the operating system's scheduling algorithm on the memory-residency assumption. we present an interesting result that a major cost of processing queries in memory-resident database systems is incurred by evaluation of predicates. we discuss optimization techniques using the office-by-example (obe) that has been under development at ibm research. we also present the results of performance measurements, which prove to be excellent in the current state of the art. despite recent work on memory-resident database systems, query optimization aspects in these systems have not been well studied. we believe this paper opens the issues of query optimization in memory-resident database systems and presents practical solutions to them.  kyu-young whang ravi krishnamurthy