waashk/acm huggingface dataset:
the model-assisted global query system for multiple databases in distributed enterprises  today's enterprises typically employ multiple information systems, which are independently developed, locally administered, and different in logical or physical designs. therefore, a fundamental challenge in enterprise information management is the sharing of information for enterprise users across organizational boundaries; this requires a global query system capable of providing on-line intelligent assistance to users. conventional technologies, such as schema-based query languages and hard-coded schema integration, are not sufficient to solve this problem. this article develops a new approach, a "model-assisted global query system," that utilizes an on-line repository of enterprise metadata \---the metadatabase---to facilitate global query formulation and processing with certain desirable properties such as adaptiveness and open-systems architecture. a definitional model characterizing the various classes and roles of the required metadata as knowledge for the system is presented. the significance of possessing this knowledge (via a metadatabase) toward improving the global query capabilities available previously is analyzed. on this basis, a direct method using model traversal and a query language using global model constructs are developed along with other new methods required for this approach. it is then tested through a prototype system in a computer- integrated manufacturing (cim) setting.  waiman cheung cheng hsu
"is this document relevant?…probably": a survey of probabilistic models in information retrieval  this article surveys probablistic approaches to modeling information retrieval. the basic concepts of probabilistic approaches to information retrieval are outlined and the principles and assumptions upon which the approaches are based are presented. the various models proposed in the development of ir are described, classified, and compared using a common formalism. new approaches that constitute the basis of future research are described.  fabio crestani mounia lalmas cornelis j. van rijsbergen iain campbell
grouplens: an open architecture for collaborative filtering of netnews  collaborative filters help people make choices based on the opinions of other people. grouplens is a system for collaborative filtering of netnews, to help people find articles they will like in the huge stream of available articles. news reader clients display predicted scores and make it easy for users to rate articles after they read them. rating servers, called better bit bureaus, gather and disseminate the ratings. the rating servers predict scores based on the heuristic that people who agreed in the past will probably agree again. users can protect their privacy by entering ratings under pseudonyms, without reducing the effectiveness of the score prediction. the entire architecture is open: alternative software for news clients and better bit bureaus can be developed independently and can interoperate with the components we have developed.  paul resnick neophytos iacovou mitesh suchak peter bergstrom john riedl
mining association rules between sets of items in large databases  we are given a large database of customer transactions. each transaction consists of items purchased by a customer in a visit. we present an efficient algorithm that generates all significant association rules between items in the database. the algorithm incorporates buffer management and novel estimation and pruning techniques. we also present results of applying this algorithm to sales data obtained from a large retailing company, which shows the effectiveness of the algorithm.  rakesh agrawal tomasz imielinski arun swami
extending the relational database data model for design applications  in recent years many researchers have tried to apply the traditional database systems to design applications. to date, most of these experiments have been largely unsuccessful. insufficient computing power may be one reason for this failure. however, the problem may be more fundamental. we believe the data models of the traditional database systems are intrinsically unsuited for design applications. in this paper we give reasons for this opinion and describe an enhanced relational model which removes some of the weaknesses we have identified.  martin hardwick
conceptual schema analysis: techniques and applications  the problem of analyzing and classifying conceptual schemas is becomig increasingly important due to the availability of a large number of schemas related to existing applications. the purposes of schema analysis and classification activities can be different: to extract information on intensional properties of legacy systems in order to restructure or migrate to new architectures; to build libraries of reference conceptual components to be used in building new applications in a given domain; and to identify information flows and possible replication of data in an organization. this article proposes a set of techniques for schema analysis and classification to be used separately or in combination. the techniques allow the analyst to derive significant properties from schemas, with human intervention limited as far as possible. in particular, techniques for associating descriptors with schemas, for abstracting reference conceptual schemas based on schema clustering, and for determining schema similarity are presented. a methodology for systematic schema analysis is illustrated, with the purpose of identifying and abstracting into reference components the similar and potentially reusable parts of a set of schemas. experiences deriving from the application of the proposed techniques and methodology on a large set of entity-relationship conceptual schemas of information systems in the italian public administration domain are described  s. castano v. de antonellis m. g. fugini b. pernici
integrating geometrical and linguistic analysis for email signature block parsing  the signature block is a common structured component found in email messages. accurate identification and analysis of signature blocks is important in many multimedia messaging and information retrieval applications such as email text-to-speech rendering, automatic construction of personal address databases, and interactive message retrieval. it is also a very challenging task, because signature blocks often appear in complex two- dimensional layouts which are guided only by loose conventions. traditional text analysis methods designed to deal with sequential text cannot handle two- dimensional structures, while the highly unconstrained nature of signature blocks makes the application of two-dimensional grammars very difficult. in this article, we describe an algorithm for signature block analysis which combines two- dimensional structural segmentation with one-dimensional grammatical constraints. the information obtained from both layout and linguistic analysis is integrated in the form of weighted finite-state transducers. the algorithm is currently implemented as a component in a preprocessing system for email text-to-speech rendering.  hao chen jianying hu richard w. sproat
integration of spatial join algorithms for processing multiple inputs  several techniques that compute the join between two spatial datasets have been proposed during the last decade. among these methods, some consider existing indices for the joined inputs, while others treat datasets with no index, providing solutions for the case where at least one input comes as an intermediate result of another database operator. in this paper we analyze previous work on spatial joins and propose a novel algorithm, called slot index spatial join (sisj), that efficiently computes the spatial join between two inputs, only one of which is indexed by an r-tree. going one step further, we show how sisj and other spatial join algorithms can be implemented as operators in a database environment that joins more than two spatial datasets. we study the differences between relational and spatial multiway joins, and propose a dynamic programming algorithm that optimizes the execution of complex spatial queries.  nikos mamoulis dimitris papadias
tirs: a topological information retrieval system satisfying the requirements of the waller-kraft wish list  most document retrieval systems based on probabilistic models of feature distributions assume random selection of documents for retrieval. the assumptions of these models are met when documents are randomly selected from the database or when retrieving all available documents. a more suitable model for retrieval of a single document assumes that the best document available is to be retrieved first. models of document retrieval systems assuming random selection and best-first selection are developed and compared under binary independence and two poisson independence feature distribution models. under the best-first model, feature discrimination varies with the number of documents in each relevance class in the database. a weight similar to the inverse document frequency weight and consistent with the best-first model is suggested which does not depend on knowledge of the characteristics of relevant documents.  s. cater d. kraft
cumulating the science of hci: from s-r compatibility to transcription typing  in keeping with our claim that an applied psychology of hci must be based on cumulative work within a unified framework, we present two extensions of the model human processor. a model of immediate response behavior and stimulus- response (s-r) compatibility is presented and extended to a new domain: transcription typing. parameters are estimated using one s-r compatibility experiment, used to make a priori predictions in four other s-r compatibility tasks, and then carried over into the area of typing. a model of expert transcription typing is described and its prediction of typing phenomena is demonstrated and summarized.  b. e. john a. newell
understanding and constructing shared spaces with mixed-reality boundaries  we propose an approach to creating shared mixed realities based on the construction of transparent boundaries between real and virtual spaces. first, we introduce a taxonomy that classifies current approaches to shared spaces according to the three dimensions of transportation, artificiality, and spatiality. second, we discuss our experience of staging a poetry performance simultaneously within real and virtual theaters. this demonstrates the complexities involved in establishing social interaction between real and virtual spaces and motivates the development of a systematic approach to mixing realities. third, we introduce and demonstrate the technique of mixed- reality boundaries as a way of joining real and virtual spaces together in order to address some of these problems.  steve benford chris greenhalgh gail reynard chris brown boriana koleva
stholes: a multidimensional workload-aware histogram  attributes of a relation are not typically independent. multidimensional histograms can be an effective tool for accurate multiattribute query selectivity estimation. in this paper, we introduce _stholes_, a "workload- aware" histogram that allows bucket nesting to capture data regions with reasonably uniform tuple density. _stholes_ histograms are built without examining the data sets, but rather by just analyzing query results. buckets are allocated where needed the most as indicated by the workload, which leads to accurate query selectivity estimations. our extensive experiments demonstrate that _stholes_ histograms consistently produce good selectivity estimates across synthetic and real- world data sets and across query workloads, and, in many cases, outperform the best multidimensional histogram techniques that require access to and processing of the full data sets during histogram construction.  nicolas bruno surajit chaudhuri luis gravano
performance measurements on hep - a pipelined mimd computer  a pipelined implementation of mimd operation is embodied in the hep computer. this architectural concept should be carefully evaluated now that such a computer is available commercially. this paper studies the degree of utilization of pipelines in the mimd environment. a detailed analysis of two extreme cases indicates that pipeline utilization is quite high.  although no direct comparisons are made with other computers, the low pipeline idle time in this machine indicates that this architectural technique may be more beneficial in an mimd machine than in either sisd or simd machines.  harry f. jordan
authentication protocols for personal communication systems masquerading and eavesdropping are major threats to the security of wireless communications. to provide proper protection for the communication of the wireless link, contents of the communication should be enciphered and mutual authentication should be conducted between the subscriber and the serving network. several protocols have been proposed by standards bodies and independent researchers in recent years to counteract these threats. however, the strength of these protocols is usually weakened in the roaming environment where the security breach of a visited network could lead to persistent damages to subscribers who visit. the subscriber's identity is not well protected in most protocols, and appropriate mechanisms solving disputes on roaming bills are not supported either. to solve these problems, new authentication protocols are proposed in this paper with new security features that have not been fully explored before. hung-yu lin lein harn
the mesh superceded?  two dimensional interconnection schemes have some inherent advantages because of their linear area and constant wire- lengths. the nearest-neighbor mesh is such a topology that has enjoyed a widespread acceptance. we investigate a family of bus-based topologies called the doble-lattice-meshes, and propose a variation to improve their properties. we show that the bus-based topologies perform better than the mesh for a variety of communicaion structures. in particular, when global communication is needed, they provide larger effective bandwidth, and when localized communication is permissible, they provide largest neighborhoods for a given communication capacity.  l. v. kale
design of an integrated services packet network  the integrated services digital network (isdn) has been proposed as a way of providing integrated voice and data communications services on a universal or near-universal basis. in this paper, i argue that the evolutionary approach inherent in current isdn proposals is unlikely to provide an effective long term solution and advocate a more revolutionary approach, based on the use of advanced packet switching technology. the bulk of this paper is devoted to a detailed description of an integrated services pocket network (ispn), which i offer as an alternative to current isdn proposals.  jonathan s. turner
automatic tcp buffer tuning with the growth of high performance networking, a single host may have simultaneous connections that vary in bandwidth by as many as six orders of magnitude. we identify requirements for an automatically-tuning tcp to achieve maximum throughput across all connections simultaneously within the resource limits of the sender. our auto-tuning tcp implementation makes use of several existing technologies and adds dynamically adjusting socket buffers to achieve maximum transfer rates on each connection without manual configuration.our implementation involved slight modifications to a bsd-based socket interface and tcp stack. with these modifications, we achieved drastic improvements in performance over large bandwidth delay paths compared to the default system configuration, and significant reductions in memory usage compared to hand-tuned connections, allowing servers to support at least twice as many simultaneous connections. jeffrey semke jamshid mahdavi matthew mathis
efficient vector processing on dataflow supercomputer sigma-1  efficiency in vector handling is the key to obtaining high performance in numerical programs. so far, the main defect of dataflow computers is inefficiency in vector processing. we propose structure-flow processing as a new scheme for handling data structures such as vectors in dataflow architecture. the main objective of structure-flow processing is to enhance vector processing performance of a dataflow computer. in this structure-flow processing scheme, the arrival of a data structure unrolls the control structure which processes the data structure itself. a high-level structure is an implementation mechanism of a structure-flow scheme on a practical dataflow computer. since all the computation is executed by instruction-level dataflow architecture, scalar level parallelism and function level parallelism are also fully utilized by this scheme. the sigma-1 architecture that supports high- level structure processing are discussed and the performance is measured. according to the measurement, vector programs can be executed three to four times faster than by unfolding using scalar dataflow processing.  k. hiraki s. sekiguchi t. shimada
mp/c: a multiprocessor/computer architecture  a computer architecture for concurrent computing is proposed that has the shared memory aspect of tightly coupled multiprocessor systems and also the connection simplicity associated with message-connected, loosely coupled multicomputer systems. a large address space is dynamically partitioned into contiguous segments that can be accessed by a single processor. the partitioning is accomplished by switching the system buses, using semiconductor switches. the completion of a concurrent process is signaled by a processor's return to an idle state and the reattachment of its memory segment to the neighboring active processor. in effect, the assignment of an address sequence and the activation of a processor is a process fork operation, and the processor deactivation and memory segment reattachment is a process join. following a description of the mp/c structure and basic operation, some additional enhancements of the system, which improve the applicability of mp/c to many classes of computations, are outlined. applications include tree-structured multiprocessing, recursive and nondeterministic procedures, arbitrary concurrent computations, very high precision numeric calculations, and process-structured operating systems. the linear mp/c structure is extensible to higher dimensions. a two-dimensional system is described, and its usefulness for data base operations and array processing is discussed.  bruce w. arden ran ginosar
decentralized optimal traffic engineering in the internet distributed optimal traffic engineering in the presence of multiple paths has been found to be a difficult problem to solve. in this paper, we introduce a new approach in an attempt to tackle this problem. this approach has its basis in nonlinear control theory. more precisely, it relies on the concept of sliding modes. we develop a family of control laws, each of them having the property that the steady-state network resource allocation yields the maximum of the given utility function, subject to the network resource constraints. these control laws not only allow each ingress node to independently adjust its traffic sending rate but also provide a scheme for optimal traffic load redistribution among multiple paths. the only nonlocal information needed is binary feedback from each congested node in the path. moreover, the algorithms presented are applicable to a large class of utility functions, namely, utility functions that can be expressed as the sum of concave functions of the sending rates. we show that the technique can be applied not only to rate adaptive traffic with multiple paths, but also to assured service traffic with multiple paths. preliminary case studies show that this technique is potentially very useful for optimal traffic engineering in a multiple-class-of-service and multiple- path enabled internet, e.g., differentiated services enabled multi-protocol label switching networks. constantino lagoa hao che
synthesis of application-specific heterogeneous multiprocessor systems (abstract)  heterogeneous systems can achieve enhanced performance and/or cost- effectiveness over homogeneous systems. sos, a formal method to synthesize optimal heterogeneous systems for given applications, involves creation and solution of a mixed integer-linear programming model. a primary component of the model is the set of relations to be satisfied to ensure proper ordering of various events in the task execution, and completeness and correctness. experiments indicate sos can be useful in designing heterogeneous systems.  shiv prakash alice c. parker
frame content independent stripping  token rings have the property that a station that transmits a frame on the ring is responsible for removing the frame after it has been delivered to the destination stations. the algorithm to perform the frame removal is called 'frame stripping'. most existing algorithms strip frames based on their content. this is not always adequate. the need for a new algorithm arises from the fact that frames transmitted by a station need not have the station's own address as the source address for a variety of reasons - such as when a bridge transmits a frame or when another address is used as the source address by a station instead of its original station address. this paper discusses a new frame content independent stripping (fcis) algorithm for token rings.  the fcis algorithm counts the number of frames transmitted by the station after capturing the token. in addition, the station places a special delimiter frame at the end of the transmission of frames, before releasing the token. the station then strips all received frames until either the number of frames stripped equals the number of frames transmitted or when either the delimiter frame or a token is received. we demonstrate that the fcis algorithm has a minimal impact on the performance of the ring. we study the robustness of the algorithm to errors and demonstrate that its reliability is as good as the inherent mechanisms of the token ring.  the algorithm studied here is very simple to implement and interoperates with other stations not implementing this algorithm. the algorithm places no topological restrictions on the network and has the attractive feature of removing large fragments and no-owner frames.  h. yang k. k. ramakrishnan
a brief overview of atm: protocol layers, lan emulation, and traffic management  asnychronous transfer mode (atm) has emerged as the most promising technology in supporting future broadband multimedia communication services. to accelerate the deployment of atm technology, the atm forum, which is a consortium of service providers and equipment vendors in the communication industries, has been created to develop implementation and specification agreements. in this article, we present a brief overview on atm protocol layers and current progress on lan emulation and traffic management in the atm forum.  kai-yeung siu raj jain
on the use of on-demand layer addition (odl) with mutli-layer multicast transmission techniques  this work deals with the multicast transmission of data using multiple multicast groups. one reason to use multiple groups is to address the potential heterogeneity of receivers. but there is a risk that some of the groups are not used and sending data to a group with no receiver has many costs that are often underestimated. as ip multicast becomes widely deployed and used, these issues may well compromise its scalability.  in this paper we introduce a new protocol, odl (on demand layer addition), which _enables a source to use only the layers that are actually required by the current set of receivers_. we describe its behavior when used with several kinds of packet scheduling schemes (cumulative or not) and different scenarios (one-to- many versus many-to-many). we have implemented the odl protocol, integrated it in the mcl multicast library and we report several experiments that assess its benefits.  vincent roca