CERN Document Server

Increasingly, business projects are ephemeral. New Business Intelligence tools must support ad-lib data sources and quick perusal. Meanwhile, tag clouds are a popular community-driven visualization technique. Hence, we investigate tag-cloud views with support for OLAP operations such as roll-ups, slices, dices, clustering, and drill-downs. As a case study, we implemented an application where users can upload data and immediately navigate through its ad hoc dimensions. To support social networking, views can be easily shared and embedded in other Web sites. Algorithmically, our tag-cloud views are approximate range top-k queries over spontaneous data cubes. We present experimental evidence that iceberg cuboids provide adequate online approximations. We benchmark several browser-oblivious tag-cloud layout optimizations.

CERN Document Server

We focus on the problem of query rewriting for sponsored search. We base rewrites on a historical click graph that records the ads that have been clicked on in response to past user queries. Given a query q, we first consider Simrank as a way to identify queries similar to q, i.e., queries whose ads a user may be interested in. We argue that Simrank fails to properly identify query similarities in our application, and we present two enhanced version of Simrank: one that exploits weights on click graph edges and another that exploits ``evidence.'' We experimentally evaluate our new schemes against Simrank, using actual click graphs and queries form Yahoo!, and using a variety of metrics. Our results show that the enhanced methods can yield more and better query rewrites.

Energy Technology Data Exchange (ETDEWEB)

Information glut is one of the primary characteristics of the electronic age. Managing such large volumes of information (e.g., keeping track of the types, where they are, their relationships, who controls them, etc.) can be done efficiently with an intelligent, user-oriented information management system. The purpose of this paper is to describe a concept for managing information resources based on an intelligent information technology system developed by the Argonne National Laboratory for managing digital libraries. The Argonne system, Intelligent Query (IQ), enables users to query digital libraries and view the holdings that match the query from different perspectives.

CERN Document Server

The task of similarity search in multimedia databases is usually accomplished by range or k nearest neighbor queries. However, the expressing power of these "single-example" queries fails when the user's delicate query intent is not available as a single example. Recently, the well-known skyline operator was reused in metric similarity search as a "multi-example" query type. When applied on a multi-dimensional database (i.e., on a multi-attribute table), the traditional skyline operator selects all database objects that are not dominated by other objects. The metric skyline query adopts the skyline operator such that the multiple attributes are represented by distances (similarities) to multiple query examples. Hence, we can view the metric skyline as a set of representative database objects which are as similar to all the examples as possible and, ...

Science.gov (United States)

Sexual information seeking is an important element within human information behavior. Seeking sexually related information on the Internet takes many forms and channels, including chat rooms discussions, accessing Websites or searching Web search engines for sexual materials. The study of sexual Web queries provides insight into sexually-related information-seeking behavior, of value to Web users and providers alike. We qualitatively analyzed queries from logs of 1,025,910 Alta Vista and AlltheWeb.com Web user queries from 2001. We compared the differences in sexually-related Web searching between Alta Vista and AlltheWeb.com users. Differences were found in session duration, query outcomes, and search term choices. Implications of the findings for sexual information seeking are discussed. PMID:15006171

Science.gov (United States)

Record Search Query: Science Keywords>HUMAN DIMENSIONS>INFRASTRUCTURE> ELECTRICITY. Monthly electricity usage at Australian Antarctic Stations ...

Energy Technology Data Exchange (ETDEWEB)

Much research has been carried out in order to manage structured documents such as SGML documents and to provide powerful query facilities which exploit document structures as well as document contents. In order to perform structure queries efficiently in a structured document management system, an index structure which supports fast document element access must be provided. However, there has been little research on the index structures for structured documents. In this paper, we propose various kinds of new inverted indexing schemes and signature file schemes for efficient structure query processing. We evaluate the storage requirements and disk access time of our schemes and present the analytical and experimental results.

CERN Document Server

We study the quantum query complexity of minor-closed graph properties, which include such problems as determining whether a graph is planar, is a forest, or does not contain a path of a given length. We show that most minor-closed properties---those that cannot be characterized by a finite set of forbidden subgraphs---have quantum query complexity \\Theta(n^{3/2}). To establish this, we prove an adversary lower bound using a detailed analysis of the structure of minor-closed properties with respect to forbidden topological minors and forbidden subgraphs. On the other hand, we show that minor-closed properties (and more generally, sparse graph properties) that can be characterized by finitely many forbidden subgraphs can be solved strictly faster, in o(n^{3/2}) queries. Our algorithms are a novel application of the quantum walk search framework and give improved upper bounds for several subgraph-finding problems.

British Library Electronic Table of Contents (United Kingdom)

Purpose - Customer relationship management (CRM) indicates a comprehensive strategy and an interactive process intended to achieve an optimum balance between corporate investment and the satisfaction of customer needs to generate the maximum profit. E-CRM refers to CRM using internet technology plus a database, OLAP, data warehouse, data mining, etc. In order to gain an understanding of the efficiency of implementing an e-CRM system within the library context, to develop theoretically and empirically an evaluation process for the e-CRM system and survey its impact on service quality, a pilot scheme was initiated in 2004. The pilot scheme was to design and implement an e-CRM prototype system for a particular academic library in Taiwan and to survey the system's performances. This paper aims...

CERN Document Server

This paper describes a new method, HGV2C, for pattern analysis. The HGV2C method involves the construction of a computer ego (CE) based on an individual object that can be either a part of the system under analysis or a newly created object based on a certain hypothesis. The CE provides a capability to analyze data from a specific standpoint, e.g. from a viewpoint of a certain object. The CE is constructed from two identical copies of a query object, and its functioning mechanism involves: a hypothesis-parameter (HP) and infothyristor (IT). HP is a parameter that is introduced into an existing set of parameters. The HP value for one of the clones of a query object is set to equal 1, whereas for another clone it is greater than 1. The IT is based on the previously described algorithm of iterative averaging and performs three functions: 1) computation of a similarity matrix for the group of three objects including two clones of a ...

CERN Document Server

RFID technology is gaining adoption on an increasing scale for tracking and monitoring purposes. Wide deployments of RFID devices will soon generate an unprecedented volume of data. Emerging applications require the RFID data to be filtered and correlated for complex pattern detection and transformed to events that provide meaningful, actionable information to end applications. In this work, we design and develop SASE, a com-plex event processing system that performs such data-information transformation over real-time streams. We design a complex event language for specifying application logic for such transformation, devise new query processing techniques to effi-ciently implement the language, and develop a comprehensive system that collects, cleans, and processes RFID data for deliv-ery of relevant, timely information as well as storing necessary data for future querying. We demonstrate an initial prototype of SASE through a real-world ...

Science.gov (United States)

A preliminary database has been developed that will allow mineralogy and bulk-rock geochemical information to be managed under configuration control and facilitate electronic querying. The database is currently developed in Microsoft Access as a collection of tables, views, and entry forms. Each field and table has been described in a data dictionary.

CERN Document Server

Leveraging the potential power of even small handheld devices able to communicate wirelessly requires dedicated support. In particular, collaborative applications need sophisticated assistance in terms of querying and exchanging different kinds of data. Using a concrete example from the domain of mobile learning, the general need for information dissemination is motivated. Subsequently, and driven by infrastructural conditions, realization strategies of an appropriate middleware service are discussed.

DEFF Research Database (Denmark)

We present a framework for designing efficient distributed data structures for multi-dimensional data. Our structures, which we call skip-webs, extend and improve previous randomized distributed data structures, including skipnets and skip graphs. Our framework applies to a general class of data querying scenarios, which include linear (one-dimensional) data, such as sorted sets, as well as multi-dimensional data, such as d-dimensional octrees and digital tries of character strings defined over a fixed alphabet. We show how to perform a query over such a set of n items spread among n hosts using O(log n / log log n) messages for one-dimensional data, or O(log n) messages for fixed-dimensional data, while using only O(log n) space per host. We also show how to make such structures dynamic so as to allow for insertions and deletions in O(log n) messages for quadtrees, octrees, and digital tries, and O(log n / log log n) messages for ...

Energy Technology Data Exchange (ETDEWEB)

Data from many measuring devices throughout the Savannah River Site (SRS) is transmitted to a central location for processing as a vital component in the SRS emergency preparedness and response program. The data processing is currently accomplished using VAX-based FORTRAN programs with the data stored in Digital's Record Management System (RMS) files which is shared using global COMMON. A program is underway to store and process this data using a Structured Query Language (SQL)-based Database Management System (DBMS). The advantages of replacing the current system with one using an SQL-based DBMS are discussed.

British Library Electronic Table of Contents (United Kingdom)

Background Adrenalectomy remains the definitive therapy for most adrenal neoplasms. Introduced in the 1990s, laparoscopic adrenalectomy is reported to have lower associated morbidity and mortality. This study aimed to evaluate national adrenalectomy trends, including major postoperative complications and perioperative mortality. Methods The Nationwide Inpatient Sample was queried to identify all adrenalectomies performed during 1998?2006. Univariate and multivariate logistic regression were performed, with adjustments for patient age, sex, comorbidities, indication, year of surgery, laparoscopy, hospital teaching status, and hospital volume. Annual incidence, major in-hospital postoperative complications, and in-hospital mortality were evaluated. Results Using weighted national estimate, 4...

CERN Document Server

This is a thought piece on data-intensive science requirements for databases and science centers. It argues that peta-scale datasets will be housed by science centers that provide substantial storage and processing for scientists who access the data via smart notebooks. Next-generation science instruments and simulations will generate these peta-scale datasets. The need to publish and share data and the need for generic analysis and visualization tools will finally create a convergence on common metadata standards. Database systems will be judged by their support of these metadata standards and by their ability to manage and access peta-scale datasets. The procedural stream-of-bytes-file-centric approach to data analysis is both too cumbersome and too serial for such large datasets. Non-procedural query and analysis of schematized self-describing data is both easier to use and allows much more parallelism.

CERN Document Server

The previous decade has brought a remarkable increase of the interest in applications that deal with querying and mining of time series data. Many of the research efforts in this context have focused on introducing new representation methods for dimensionality reduction or novel similarity measures for the underlying data. In the vast majority of cases, each individual work introducing a particular method has made specific claims and, aside from the occasional theoretical justifications, provided quantitative experimental observations. However, for the most part, the comparative aspects of these experiments were too narrowly focused on demonstrating the benefits of the proposed methods over some of the previously introduced ones. In order to provide a comprehensive validation, we conducted an extensive experimental study re-implementing eight different time series representations and nine similarity measures and their variants, and testing their effectiveness on ...

CERN Document Server

The present research scholars are having keen interest in doing their research activities in the area of Data mining all over the world. Especially, [13]Mining Image data is the one of the essential features in this present scenario since image data plays vital role in every aspect of the system such as business for marketing, hospital for surgery, engineering for construction, Web for publication and so on. The other area in the Image mining system is the Content-Based Image Retrieval (CBIR) which performs retrieval based on the similarity defined in terms of extracted features with more objectiveness. The drawback in CBIR is the features of the query image alone are considered. Hence, a new technique called Image retrieval based on optimum clusters is proposed for improving user interaction with image retrieval systems by fully exploiting the similarity information. The index is created by describing the images according to their color characteristics, with ...

Science.gov (United States)

Molecular biologists, geneticists, and other life scientists use the BLAST homology search package as their first step for discovery of information about unknown or poorly annotated genomic sequences. There are two main variants of BLAST: BLASTP for searching protein collections and BLASTN for nucleotide collections. Surprisingly, BLASTN has had very little attention; for example, the algorithms it uses do not follow those described in the 1997 BLAST paper and no exact description has been published. It is important that BLASTN is state-of-the-art: Nucleotide collections such as GenBank dwarf the protein collections in size, they double in size almost yearly, and they take many minutes to search on modern general purpose workstations. This paper proposes significant improvements to the BLASTN algorithms. Each of our schemes is based on compressed bytepacked formats that allow queries and collection sequences to be compared four bases at a time, permitting very fast ...

Science.gov (United States)

In this work, we query the Chlamydomonas reinhardtii copper regulon at a whole-genome level. Our RNA-Seq data simulation and analysis pipeline validated a 2-fold cutoff and 10 RPKM (reads per kilobase of mappable length per million mapped reads) (~1 mRNA per cell) to reveal 63 CRR1 targets plus another 86 copper-responsive genes. Proteomic and immunoblot analyses captured 25% of the corresponding proteins, whose abundance was also dependent on copper nutrition, validating transcriptional regulation as a major control mechanism for copper signaling in Chlamydomonas. The impact of copper deficiency on the expression of several O2-dependent enzymes included steps in lipid modification pathways. Quantitative lipid profiles indicated increased polyunsaturation of fatty acids on thylakoid membrane digalactosyldiglycerides, indicating a global impact of copper deficiency on the photosynthetic apparatus. Discovery of a putative plastid copper chaperone and a membrane ...

CERN Document Server

Data mining is a useful decision support technique that can be used to discover production rules in warehouses or corporate data. Data mining research has made much effort to apply various mining algorithms efficiently on large databases. However, a serious problem in their practical application is the long processing time of such algorithms. Nowadays, one of the key challenges is to integrate data mining methods within the framework of traditional database systems. Indeed, such implementations can take advantage of the efficiency provided by SQL engines. In this paper, we propose an integrating approach for decision trees within a classical database system. In other words, we try to discover knowledge from relational databases, in the form of production rules, via a procedure embedding SQL queries. The obtained decision tree is defined by successive, related relational views. Each view corresponds to a given population in the underlying decision tree. We selected ...

Energy Technology Data Exchange (ETDEWEB)

Ontario's Countdown Acid Rain program was formulated in 1985 and placed an annual SO{sub 2} emissions cap of 885 kilotonnes over the province from 1994. Caps were placed on emissions from the Inco nickel/copper smelter in Sudbury, the Falconbridge nickel/copper smelter in Sudbury, the Algoma iron ore sintering plant in Wawa, and Ontario Hydro fossil-fuel plants province-wide. Semi-annual reports are required of the companies, with the 6th report outlining the final planning phase and the 7th and later reports outlining implementation progress. This document summarizes the contents of the 7th set of reports and the responses of the government review team to each company's efforts. All companies have begun implementing abatement plans outlined in the final planning phase reports of December 1988 at a rapid pace and are generally on track in controlling emissions. However, all 4 company reports lack the necessary detail for a complete review of the implementation plan in ...

CERN Document Server

This paper studies neighbor discovery problem in wireless networks. A novel scheme, called compressed neighbor discovery is proposed, which assigns each node a unique signature and let nodes simultaneously transmit their signatures during the discovery period. The query node then determines, based on the superposition of the signatures, a small number of nodes as its neighbors, out of a large number of nodes in the network. This is fundamentally a sparse recovery problem. Using the proposed scheme, a single frame time suffices to achieve reliable discovery for large networks. This is in contrast to conventional schemes, where each node repeatedly transmits its identity with random delay, so that a receiver can identify each neighbor at least once without collision. Two practical, low-complexity discovery schemes are studied. The first scheme assigns sparse pseudo-random on-off signatures to the nodes, so that each node can listen to the channel during its own ...

CERN Document Server

Studies on the large scale peer-to-peer (P2P) network like Gnutella have shown the presence of large number of free riders. Moreover, the open and decentralized nature of P2P network is exploited by malicious users who distribute unauthentic or harmful contents. Despite the existence of a number of trust management schemes in the literature for combating against free riding and distribution of malicious files, these mechanisms are not scalable due to their high computational, communication and storage overhead. These schemes also do not consider effect of trust management on quality-of-service (QoS) of the search. This paper presents a trust management scheme for P2P networks that minimizes distribution of spurious files by a novel technique called topology adaptation. It also reduces search time since most of the queries are resolved within the community of trustworthy peers. Simulation results indicate that the trust management overhead due to the pr oposed ...

Energy Technology Data Exchange (ETDEWEB)

The objective of the research is first to build a highly parallel processing system using 100 personal computers and an ATM switch. The former is a commodity for computer, while the latter can be regarded as a commodity for future communication systems. Second is to implement parallel relational database management system and parallel data mining system over the 100-PC cluster system. Third is to run decision-support queries typicalto data warehouses, to run association rule mining, and to prove the effectiveness of the proposed architecture as a next generation parallel database/datamining server. Performance/cost ratio of PC is significantly improved compared with workstations and proprietry systems due to its mass production. The cost of ATM switch is also considerably decreasing since ATM is being widely accepted as a communication-on infrastructure. By combining 100 PCs as computing commodities and ATM switch as a communication commodity, we built large sca-le ...

International Nuclear Information System (INIS)

Nuclear Forensics is a key element in the response process which is initiated after detection of illicit nuclear or other radioactive material. Credible nuclear forensics relies on appropriate sampling procedures, on validated analytical methods and on thorough data analysis and interpretation. Nuclear forensics aims at providing clues on the history and the potential origin of the material. Elemental and isotopic composition of the material, as well as its macroscopic and microscopic appearance reflect the technological processes used for the fabrication of the material. The nuclear forensic analysis first of all results in measurement data. Through appropriate processing of these data information on the nature and the history of the material can be obtained. A number of data evaluation techniques serving this purpose are conceivable and have been applied. On the one side, statistical methods like principal component analysis (PCA) or classification and regression trees (CART) can be ...

International Nuclear Information System (INIS)

Full text: Introduction. Children, especially premature infants and neonates, are at a much higher risk to obtain an X ray induced disturbance of life - particularly cancer. On the one hand this is due to their longer life expectancy and on the other hand it is due to their higher cell proliferation rate. The paediatric radiology unit of the Inselspital Bern recently installed some of the most advanced X ray equipment nowadays available. It is based on the two latest digital technologies: double read computed radiography (CR) and direct digital radiography (DR). Only the implementation of these digital radiography systems permits the digital acquisition and additionally the analysis of acquired data. The systematic analysis of large amounts of biometric data and exposition data is the basis for further dose reduction and a systematic quality control (QC). Patients are increasingly critical concerning radiation exposure - especially parents regarding their children. Besides an ...