Powered by Deep Web Technologies
Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


1

U-270:Trend Micro Control Manager Input Validation Flaw in Ad Hoc Query  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

0:Trend Micro Control Manager Input Validation Flaw in Ad Hoc 0:Trend Micro Control Manager Input Validation Flaw in Ad Hoc Query Module Lets Remote Users Inject SQL Commands U-270:Trend Micro Control Manager Input Validation Flaw in Ad Hoc Query Module Lets Remote Users Inject SQL Commands September 28, 2012 - 6:00am Addthis PROBLEM: Trend Micro Control Manager Input Validation Flaw in Ad Hoc Query Module Lets Remote Users Inject SQL Commands PLATFORM: Control Manager - 3.0, 3.5, 5.0, 5.5, 6.0 ABSTRACT: Trend Micro has been notified of a potential product vulnerability in Control Manager. reference LINKS: Trend Micro Technical Support ID 1061043 SecurityTracker Alert ID: 1027584 Secunia Advisory SA50760 CVE-2012-2998 IMPACT ASSESSMENT: Medium Discussion: A vulnerability has been reported in Trend Micro Control Manager, which can

2

Answering ad hoc aggregate queries from data streams using prefix aggregate trees  

Science Conference Proceedings (OSTI)

In some business applications such as trading management in financial institutions, it is required to accurately answer ad hoc aggregate queries over data streams. Materializing and incrementally maintaining a full data cube or even its compression or ... Keywords: Aggregate query, Data cube, Data stream, Data warehousing, Online analytic processing (OLAP)

Moonjung Cho; Jian Pei; Ke Wang

2007-08-01T23:59:59.000Z

3

A comparison of the usability of performing ad hoc querying on dimensionally modeled data versus operationally modeled data  

Science Conference Proceedings (OSTI)

To study the usability of dimensionally modeled data (DMD), we conducted an experiment involving 113 participants to analyze their performance in ad hoc querying tasks. The results show that DMD's usability is high according to both objective and subjective ... Keywords: Business intelligence, Data models, Dimensionally modeled data, Learnability, Usability

DušAn VujošEvi?; Ivana Kova?Evi?; Milija Suknovi?; Nenad Lali?

2012-12-01T23:59:59.000Z

4

Ad Hoc Distributed Simulations  

Science Conference Proceedings (OSTI)

An ad hoc distributed simulation is a collection of autonomous on-line simulations brought together to model an operational system. They offer the potential of increased accuracy, responsiveness, and robustness compared to centralized approaches. They ...

Richard Fujimoto; Michael Hunter; Jason Sirichoke; Mahesh Palekar; Hoe Kim; Wonho Suh

2007-06-01T23:59:59.000Z

5

Securing vehicular ad hoc networks  

Science Conference Proceedings (OSTI)

Vehicular networks are very likely to be deployed in the coming years and thus become the most relevant form of mobile ad hoc networks. In this paper, we address the security of these networks. We provide a detailed threat analysis and devise an appropriate ... Keywords: Vehicular ad hoc networks, security, wireless

Maxim Raya; Jean-Pierre Hubaux

2007-01-01T23:59:59.000Z

6

Capacity consideration of wireless ad hoc networks  

E-Print Network (OSTI)

Capacity ProblemCurrent Research on Capacity of Wireless Ad HocChapter 3 Upper Bound on the Capacity of Wireless Ad Hoc

Tan, Yusong

2008-01-01T23:59:59.000Z

7

A virtual ad hoc network testbed  

Science Conference Proceedings (OSTI)

Testing of applications for ad hoc networks poses a special technical challenge due to the difficulty of conducting experiments in an ad hoc network environment at a scale larger than a few nodes. One approach is to conduct experiments in a testbed that ... Keywords: MANETs, SITL, VAN, emulation, hybrid testbed, mobile ad hoc networks, mobile networks, network management, shadow nodes, simulation, software-in-, the-loop, virtual ad hoc networks, virtual machines, virtual networks, virtualisation

Alex Poylisher; Constantin Serban; John Lee; Tai-Chuan Lu; Ritu Chadha; Cho-Yu Jason Chiang; Robert Orlando; Kimberly Jakubowski

2010-07-01T23:59:59.000Z

8

Selecting forwarding neighbors in wireless ad hoc networks  

E-Print Network (OSTI)

networking operation in wireless ad hoc networks. It isa fundamental operation which is frequent in wireless ad hoc

Calinescu, G; Mandoiu, Ion I; Wan, P J; Zelikovsky, A Z

2004-01-01T23:59:59.000Z

9

Ad hoc retrieval of documents with topical opinion  

Science Conference Proceedings (OSTI)

With a growing amount of subjective content distributed across the Web, there is a need for a domain-independent information retrieval system that would support ad hoc retrieval of documents expressing opinions on a specific topic of the user's query. ...

Jason Skomorowski; Olga Vechtomova

2007-04-01T23:59:59.000Z

10

Distributed services for mobile ad hoc networks  

E-Print Network (OSTI)

A mobile ad hoc network consists of certain nodes that communicate only through wireless medium and can move arbitrarily. The key feature of a mobile ad hoc network is the mobility of the nodes. Because of the mobility, communication links form and disappear as nodes come into and go out of each other's communica- tion range. Mobile ad hoc networks are particularly useful in situations like disaster recovery and search, military operations, etc. Research on mobile ad hoc networks has drawn a huge amount of attention recently. The main challenges for mobile ad hoc networks are the sparse resources and frequent mobility. Most of the research work has been focused on the MAC and routing layer. In this work, we focus on distributed services for mobile ad hoc networks. These services will provide some fundamental functions in developing various applications for mobile ad hoc networks. In particular, we focus on the clock synchronization, connected dominating set, and k-mutual exclusion problems in mobile ad hoc networks.

Cao, Guangtong

2005-08-01T23:59:59.000Z

11

Virtual infrastructure for wireless ad hoc networks  

E-Print Network (OSTI)

One of the most significant challenges introduced by ad hoc networks is coping with the unpredictable deployment, uncertain reliability, and erratic communication exhibited by emerging wireless networks and devices. The ...

Gilbert, Seth, 1976-

2007-01-01T23:59:59.000Z

12

Routing in heterogeneous wireless ad hoc networks  

E-Print Network (OSTI)

Wireless ad hoc networks are used in several applications ranging from infrastructure monitoring to providing Internet connectivity to remote locations. A common assumption about these networks is that the devices that ...

Cheekiralla, Sivaram M. S. L., 1980-

2008-01-01T23:59:59.000Z

13

An ad-hoc wireless communication system  

E-Print Network (OSTI)

This thesis studies the challenges of providing load balancing and fault-tolerant external links between ad-hoc multicast mesh networks. The work is the gateway component of a research platform called FluidVoice, a wireless ...

Yuen, Hector

2006-01-01T23:59:59.000Z

14

Ad Hoc Wireless Networking Links  

Science Conference Proceedings (OSTI)

... and batteries Ceramic chip antennas ClearPath disguised antennas [added 11/22/04] Cushcraft Decibel [updated 1/21/04] Do-It-Yourself Wi-Fi ...

15

Topology management in ad hoc networks  

Science Conference Proceedings (OSTI)

The efficiency of a communication network depends not only on its control protocols, but also on its topology. We propose a distributed topology management algorithm that constructs and maintains a backbone topology based on a minimal dominating set ... Keywords: ad hoc networks, connected dominating set, minimum dominating set

Lichun Bao; J. J. Garcia-Luna-Aceves

2003-06-01T23:59:59.000Z

16

Formal Modeling of BeeAdHoc: A Bio-inspired Mobile Ad Hoc ...  

Science Conference Proceedings (OSTI)

Design and development of routing protocols for Mobile Ad. Hoc Networks ... A typical graph is denoted by G(V,E) in which V is a set of vertices in the graph.

17

Ad Hoc mobility management with uniform quorum systems  

Science Conference Proceedings (OSTI)

Keywords: Ad hoc network, balanced incomplete block design, data distribution, mobility management, quorum system, reconfigurable wireless network, uniform quorum system

Zygmunt J. Haas; Ben Liang

1999-04-01T23:59:59.000Z

18

Ad hoc results | KDD R&D Laboratories  

Science Conference Proceedings (OSTI)

Page 1. Ad hoc results | KDD R&D Laboratories Summary Statistics Run Number KD71010s Run Description Automatic ...

19

Maximizing Battery Life Routing in Wireless Ad Hoc Networks  

E-Print Network (OSTI)

Maximizing Battery Life Routing in Wireless Ad Hoc Networks Weifa Liang Department of Computer Abstract--Most wireless ad hoc networks consist of mobile devices which operate on batteries. Power con, for an ad hoc network consisting of the same type of battery mobile nodes, two approximation algorithms

Liang, Weifa

20

Supporting QoS in Integrated Ad-Hoc Networks  

Science Conference Proceedings (OSTI)

Ad-hoc networking is becoming a promising solution to increase the radio coverage of wireless systems. Integrated mobile ad-hoc networks (MANETs), considered as multi-hop networks connected to fixed networks through one or more gateways, seem to be very ... Keywords: Ad-hoc networks, EDCA, IEEE 802.11, Infrastructure networks, QoS

Marek Natkaniec; Katarzyna Kosek-Szott; Szymon Szott; Janusz Gozdecki; Andrzej G?owacz; Susana Sargento

2011-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


21

Radio channel modeling for mobile ad hoc wireless networks .  

E-Print Network (OSTI)

??The radio channel places fundamental limitations on the performance of mobile ad hoc wireless networks. In the mobile radio environment, fading due to multipath delay… (more)

Sng, Sin Hie

2004-01-01T23:59:59.000Z

22

Vampire Attacks: Draining Life from Wireless Ad Hoc Sensor Networks  

Science Conference Proceedings (OSTI)

Ad hoc low-power wireless networks are an exciting research direction in sensing and pervasive computing. Prior security work in this area has focused primarily on denial of communication at the routing or medium access control levels. This paper explores ... Keywords: Denial of service, security, routing, ad hoc networks, sensor networks, wireless networks

Eugene Y. Vasserman; Nicholas Hopper

2013-02-01T23:59:59.000Z

23

Limiting the impact of mobility on ad hoc clustering  

Science Conference Proceedings (OSTI)

This paper explores the impact of node mobility on DMAC, a typical clustering protocol for mobile ad hoc networks. Several protocols for clustering have been proposed, which are quite similar in operations and performance. We selected one and ... Keywords: ad hoc networks, clustering protocols, mobility models

Rituparna Ghosh; Stefano Basagni

2005-10-01T23:59:59.000Z

24

Energy Efficient Routing in Ad Hoc Disaster Recovery Networks  

E-Print Network (OSTI)

, during the rescue attempts in the World Trade Center disaster site, the Wireless Emergency Response TeamEnergy Efficient Routing in Ad Hoc Disaster Recovery Networks Gil Zussman and Adrian Segall, energy conserving, power aware, disaster recovery networks, ad hoc networks, smart badges, IEEE 802.15 1

Zussman, Gil

25

Energy Efficient Routing in Ad Hoc Disaster Recovery Networks  

E-Print Network (OSTI)

disaster site, the Wireless Emergency Response Team (WERT) attempted to locate survivors through signalsEnergy Efficient Routing in Ad Hoc Disaster Recovery Networks Gil Zussman and Adrian Segall. Keywords: Routing, Energy efficient, Energy conserving, Power aware, Disaster recovery networks, Ad hoc

Zussman, Gil

26

Energy-Aware Routing in Wireless Ad-hoc Networks  

E-Print Network (OSTI)

Energy-Aware Routing in Wireless Ad-hoc Networks Panagiotis C. Kokkinos Christos A. Papageorgiou Emmanouel A. Varvarigos Abstract In this work we study energy efficient routing strate- gies for wireless ad-hoc networks. In this kind of net- works, energy is a scarce resource and its conservation

Varvarigo, Emmanouel "Manos"

27

Multiagent based information dissemination in vehicular ad hoc networks  

Science Conference Proceedings (OSTI)

Vehicular Ad hoc Networks (VANETs) are a compelling application of ad hoc networks, because of the potential to access specific context information (e.g. traffic conditions, service updates, route planning) and deliver multimedia services (Voice over ... Keywords: MANETs, Multi-agents, VANETs, information dissemination

S. S. Manvi; M. S. Kakkasageri; Jeremy Pitt

2009-12-01T23:59:59.000Z

28

Neighbor Selection Game in Wireless Ad Hoc Networks  

Science Conference Proceedings (OSTI)

In wireless ad hoc networks, there is no infrastructure to enforce cooperation between nodes. As a result, nodes may act selfishly when running network protocols to conserve their energy resources as much as possible. In this paper, we consider the "neighbor ... Keywords: Energy efficiency, Game theory, Neighbor selection, Selfish nodes, Wireless ad hoc networks

Sajjad Zarifzadeh; Nasser Yazdani

2013-05-01T23:59:59.000Z

29

Towards adaptable ad hoc networks: the routing experience  

Science Conference Proceedings (OSTI)

Network users not only demand new and versatile application support by the networks but they themselves are becoming part of the network (network routers, caches, processors, etc) by contributing their resources to it and being engaged in ad hoc networking ... Keywords: ad hoc, adaptability, autonomic, routing, wireless

Cesar A. Santivanez; Ioannis Stavrakakis

2004-10-01T23:59:59.000Z

30

Adoption of Vehicular Ad Hoc Networking Protocols by Networked Robots  

Science Conference Proceedings (OSTI)

This paper focuses on the utilization of wireless networking in the robotics domain. Many researchers have already equipped their robots with wireless communication capabilities, stimulated by the observation that multi-robot systems tend to have several ... Keywords: Networked robot, Robotic ad hoc network, V2I, V2V, Vehicular ad hoc network, Wireless robot

Wim Vandenberghe; Ingrid Moerman; Piet Demeester

2012-06-01T23:59:59.000Z

31

Towards a routing framework in ad hoc space networks  

Science Conference Proceedings (OSTI)

A routing framework called Space Gateway Routing (SGR) is proposed for routing through Autonomous Regions (ARs) in ad hoc space networks. SGR has two integral parts: External SGR (ESGR) and Interior SGR (ISGR). ESGR ... Keywords: ad hoc networks, autonomous regions, contact allocation, data delivery, inter-region message scheduling, remote control messages, space communications, space gateway routing, space missions, space networks

Chao Chen; Zesheng Chen

2010-12-01T23:59:59.000Z

32

TREC2004: Genomics AdHoc Experiments  

Science Conference Proceedings (OSTI)

... in the Verity query language (eg, , , ), as well as weights ... Stimulation of transcription of the genes for luciferase (lux A and ...

2005-02-10T23:59:59.000Z

33

Broadcasting and transmission coordination for ad hoc and sensor networks  

Science Conference Proceedings (OSTI)

This thesis studies the performance benefit of coordination in wireless sensor networks (WSNs) and ad hoc networks (AHNs). WSNs are often comprised of a large number of inexpensive nodes with short battery life and limited communication and processing ...

Ananth V. Kini / Steven P. Weber

2008-01-01T23:59:59.000Z

34

Opportunistic resource utilization networks-A new paradigm for specialized ad hoc networks  

Science Conference Proceedings (OSTI)

We present opportunistic resource utilization networks or oppnets, a novel paradigm of specialized ad hoc networks. We believe that applications can benefit from using specialized ad hoc networks that provide a natural basis for them, the basis more ... Keywords: Ad hoc networks, Oppnets, Opportunistic networks, Specialized ad hoc networks

Leszek Lilien; Ajay Gupta; Zill-E-Huma Kamal; Zijiang Yang

2010-03-01T23:59:59.000Z

35

Cognitive maritime wireless mesh/ad hoc networks  

Science Conference Proceedings (OSTI)

Cognitive maritime wireless mesh/ad hoc networks are proposed in this paper, for the purpose to provide high-speed and low-cost communications for the current maritime users by incorporating the licensed but unused frequency bands opportunistically. ... Keywords: Cognitive radio networks, IEEE 802.16, Maritime communications, Maritime mesh networks, Mesh/ad hc networks, White Space

Ming-Tuo Zhou; Hiroshi Harada

2012-03-01T23:59:59.000Z

36

Spatial aspects of mobile ad hoc collaboration  

E-Print Network (OSTI)

Traditionally, communication devices are designed to overcome distance in space or time. How can personal mobile tools augment local interaction and promote spontaneous collaboration between users in proximity? Mobile ad ...

Chardin, Ivan Sergeyevich, 1997-

2003-01-01T23:59:59.000Z

37

Model-based compression in wireless ad hoc networks  

Science Conference Proceedings (OSTI)

We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes determines network topology. As opposed to encoding individual node locations, ... Keywords: compression, modeling, routing protocols, routing tables, sensor networks, trajectory

Milenko Drinic; Darko Kirovski; Miodrag Potkonjak

2003-11-01T23:59:59.000Z

38

Landmark routing in ad hoc networks with mobile backbones  

E-Print Network (OSTI)

A Mobile Ad Hoc Network (MANET) is usually assumed to be homogeneous, where each mobile node shares the same radio capacity. However, a homogeneous ad hoc network suffers from poor scalability. Recent research has demonstrated its performance bottleneck through both theoretical analysis and simulation experiments and testbed measurements. This is further exacerbated by heavy routing overhead of ad hoc routing protocols when the network size is large. In this paper, we present a design methodology to build a hierarchical large-scale ad hoc network using different types of radio capabilities at different layers. In such a structure, nodes are first dynamically grouped into multi-hop clusters. Each group elects a cluster-head to be a backbone node (BN). Then higher-level links are established to connect the BNs into a backbone network. Following this method recursively, a multilevel hierarchical network can be established. Three critical issues are addressed in this paper. We first analyze the optimal number of BNs for a layer in theory. Then, we propose a stable and light overhead clustering scheme to deploy the BNs. Finally LANMAR routing is extended to operate the physical hierarchy efficiently. We show that the Hierarchical LANMAR (H-LANMAR) can incorporate and efficiently utilize backbone links to reach remote destinations (thus reducing the hop distance). Simulation results using GloMoSim confirm that our proposed schemes achieve good performance.

Kaixin Xu; Xiaoyan Hong; Mario Gerla

2003-01-01T23:59:59.000Z

39

Modular Anomaly Detection for Smartphone Ad hoc Communication  

E-Print Network (OSTI)

a mobile ad hoc network (MANET). While intrusion detection in MANETs is typically evaluated with network. The study shows the feasibility of the statistics-based anomaly detection regime, having low CPU usage, among others, has been focused on studies of energy and bandwidth constrained communication using

40

A merging clustering algorithm for mobile ad hoc networks  

Science Conference Proceedings (OSTI)

Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We propose a new fully distributed algorithm for clustering in MANETs that merges clusters to ...

Orhan Dagdeviren; Kayhan Erciyes; Deniz Cokuslu

2006-05-01T23:59:59.000Z

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


41

A spontaneous ad hoc network to share WWW access  

Science Conference Proceedings (OSTI)

In this paper, we propose a secure spontaneous ad-hoc network, based on direct peer-to-peer interaction, to grant a quick, easy, and secure access to the users to surf the Web. The paper shows the description of our proposal, the procedure of the nodes ...

Raquel Lacuesta; Jaime Lloret; Miguel Garcia; Lourdes Peñalver

2010-04-01T23:59:59.000Z

42

Mobile ad hoc networking: imperatives and challenges Imrich Chlamtac a  

E-Print Network (OSTI)

with no pre-existing communication infrastructure, e.g., disaster re- covery environments. Ad hoc networking the Personal Computer age (i.e., a one computing device per person) to the Ubiqui- tous Computing age in which a user utilizes, at the same time, several electronic platforms through which he can access all

Xu, Wenyuan

43

On the scalability problem of highway ad hoc network  

Science Conference Proceedings (OSTI)

Vehicular Ad hoc Network in a highway is composed of high speed vehicles or nodes which induce fast topology changes in their configuration. In order to solve the connectivity and scalability problems of VANETs, we introduce the architecture of a Vehicular ...

Florent Kaisser; Véronique Vèque

2009-04-01T23:59:59.000Z

44

Survey Flying Ad-Hoc Networks (FANETs): A survey  

Science Conference Proceedings (OSTI)

One of the most important design problems for multi-UAV (Unmanned Air Vehicle) systems is the communication which is crucial for cooperation and collaboration between the UAVs. If all UAVs are directly connected to an infrastructure, such as a ground ... Keywords: Ad-hoc networks, MANET, Multi-UAV, VANET

?Lker Bekmezci; Ozgur Koray Sahingoz; ?Amil Temel

2013-05-01T23:59:59.000Z

45

Self-stabilizing multicast protocols for ad hoc networks  

Science Conference Proceedings (OSTI)

We propose two distributed algorithms to maintain respectively the minimum weight spanning tree (MST) based multi-cast tree and the shortest path (SPST) multi-cast tree in a given ad hoc network for a given multi-cast group; our algorithms are fault ... Keywords: convergence, distributed system, fault tolerance, multi-cast protocol, self-stabilizing protocol, system graph

Sandeep K. S. Gupta; Pradip K. Srimani

2003-01-01T23:59:59.000Z

46

Automatic categorization of query results  

Science Conference Proceedings (OSTI)

Exploratory ad-hoc queries could return too many answers - a phenomenon commonly referred to as "information overload". In this paper, we propose to automatically categorize the results of SQL queries to address this problem. We dynamically generate ...

Kaushik Chakrabarti; Surajit Chaudhuri; Seung-won Hwang

2004-06-01T23:59:59.000Z

47

Cognitive Coexistence between Infrastructure and Ad-hoc Systems  

E-Print Network (OSTI)

The rapid proliferation of wireless systems makes interference management more and more important. This paper presents a novel cognitive coexistence framework, which enables an infrastructure system to reduce interference to ad-hoc or peer-to-peer communication links in close proximity. Motivated by the superior resources of the infrastructure system, we study how its centralized resource allocation can accommodate the ad-hoc links based on sensing and predicting their interference patterns. Based on an ON/OFF continuous-time Markov chain model, the optimal allocation of power and transmission time is formulated as a convex optimization problem and closed-form solutions are derived. The optimal scheduling is extended to the case where the infrastructure channel is random and rate constraints need only be met in the long-term average. Finally, the multi-terminal case is addressed and the problem of optimal sub-channel allocation discussed. Numerical performance analysis illustrates that utilizing the superior ...

Geirhofer, Stefan; Sadler, Brian M

2008-01-01T23:59:59.000Z

48

Opportunistic media access control and routing for delay-tolerant mobile ad hoc networks  

Science Conference Proceedings (OSTI)

In delay-tolerant mobile ad hoc networks, motion of network nodes, network sparsity and sporadic density can cause a lack of guaranteed connectivity. These networks experience significant link delay and their routing protocols must take a store-and-forward ... Keywords: Cross-layer adaptation design, Delay-tolerant network, Mobile ad hoc network, Opportunistic routing, Vehicular ad hoc network

Liang Dong

2012-11-01T23:59:59.000Z

49

The use of mobile agents for clustering in mobile ad hoc networks  

Science Conference Proceedings (OSTI)

A mobile ad hoc network is a dynamic mobile wireless network that can be formed without the need for any pre-existing wired or wireless infrastructure. One of the main challenges in an ad hoc network is the design of robust routing algorithms that adapt ... Keywords: ad hoc networks, algorithms, clustering, design, management, mobile agents, routing, wireless networks

Mieso K. Denko

2003-09-01T23:59:59.000Z

50

Worst-Case optimal and average-case efficient geometric ad-hoc routing  

Science Conference Proceedings (OSTI)

In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive simulation. GOAFR is the first ad-hoc algorithm to be both asymptotically ... Keywords: ad-hoc networks, face routing, geometric routing, network connectivity, performance, routing, simulation, wireless communication

Fabian Kuhn; Rogert Wattenhofer; Aaron Zollinger

2003-06-01T23:59:59.000Z

51

Review: Unicast routing protocols for vehicular ad hoc networks: A critical comparison and classification  

Science Conference Proceedings (OSTI)

Vehicular Ad hoc NETworks (VANETs) allow vehicles to form a self-organized network without the need for a permanent infrastructure. As a prerequisite to communication, an efficient route between network nodes must be established, and it must adapt to ... Keywords: Inter-vehicle communication, Mobile ad hoc network, Routing, VANET, Vehicular ad hoc networks

James Bernsen; D. Manivannan

2009-02-01T23:59:59.000Z

52

An ant swarm-inspired energy-aware routing protocol for wireless ad-hoc networks  

Science Conference Proceedings (OSTI)

Primitive routing protocols for ad-hoc networks are ''power hungry'' and can therefore consume considerable amount of the limited amount of battery power resident in the nodes. Thus, routing in ad-hoc networks is very much energy-constrained. Continuous ... Keywords: Ad-hoc networks, Ant colony optimization, Energy-efficiency, Performance evaluation, Routing, Simulation

Sudip Misra; Sanjay K. Dhurandher; Mohammad S. Obaidat; Pushkar Gupta; Karan Verma; Prayag Narula

2010-11-01T23:59:59.000Z

53

Context-aware middleware for pervasive and ad hoc environments  

E-Print Network (OSTI)

Abstract: Recent advances in the area of mobile computing and pervasive computing have driven the emergence of new challenges. For example, the “Intelligent Environment ” or “Smart Environment ” has become one of the key research areas in the pervasive computing arena. These scenarios typically consist of intelligent rooms capable of gathering raw sensory data from embedded “invisible ” sensors, then processing and analysing them to deduce highlevel context and infer personal preferences (for room temperature, light intensity, type and level of music, etc.) Mobile and ad hoc scenarios also include time-critical applications such as an automatic car control systems in which cars are able to operate independently and cooperate with each other to avoid collisions. Another example is an air traffic control system whereby thousands of aircraft are proactively coordinated to keep them at safe distances from each other. In this paper, we present a context-aware middleware architecture for the support of both pervasive and ad hoc environments. The approach makes use of both reflection and component technology. A prototype of the middleware has been implemented in OpenCOM, which is a lightweight, efficient and reflective component model based on Microsoft’s COM. 1.

Hector A. Duran-limon; Gordon S. Blair; Adrian Friday; Paul Grace; George Samartzidis; Thirunavukkarasu Sivaharan; Maomao Wu

2003-01-01T23:59:59.000Z

54

Performance Enhanced AODV Routing Protocol Security in Mobile Ad-Hoc Networks  

Science Conference Proceedings (OSTI)

With the emergence of mobile ad-hoc networks, more users desire connectivity regardless of geographic location. MANETs are a promising technology in terms of the applications in the military, emergency situations, and general daily life activities. Various ... Keywords: Ad hoc On-Demand Distance Vector Routing AODV, Black-hole Attack, Denial-of-Service Attack, Mobile Ad-hoc Networks MANETs, Routing Protocols

Raees Khan ShahSani, Muhammad Bakhsh, Amjad Mahmood

2012-07-01T23:59:59.000Z

55

Capacity of ultra-wideband power-constrained ad hoc networks  

E-Print Network (OSTI)

Capacity of Ultra-Wideband Power-Constrained Ad Hoc Networks Xiaojun Tang and Yingbo Hua, Fellow, IEEE This algorithm then produces mappings

Tang, Xiaojun; Hua, Yingbo

2008-01-01T23:59:59.000Z

56

Parameterized Verification of Safety Properties in Ad Hoc Network Protocols  

E-Print Network (OSTI)

We summarize the main results proved in recent work on the parameterized verification of safety properties for ad hoc network protocols. We consider a model in which the communication topology of a network is represented as a graph. Nodes represent states of individual processes. Adjacent nodes represent single-hop neighbors. Processes are finite state automata that communicate via selective broadcast messages. Reception of a broadcast is restricted to single-hop neighbors. For this model we consider a decision problem that can be expressed as the verification of the existence of an initial topology in which the execution of the protocol can lead to a configuration with at least one node in a certain state. The decision problem is parametric both on the size and on the form of the communication topology of the initial configurations. We draw a complete picture of the decidability and complexity boundaries of this problem according to various assumptions on the possible topologies.

Delzanno, Giorgio; Zavattaro, Gianluigi; 10.4204/EPTCS.60.4

2011-01-01T23:59:59.000Z

57

ADS-Directory Services for Mobile Ad-Hoc Networks Based on an Information Market Model  

E-Print Network (OSTI)

Ubiquitous computing based on small mobile devices using wireless communication links is becoming very attractive. The computational power and storage capacities provided allow the execution of sophisticated applications. Due to the fact that sharing of information is a central problem for distributed applications, the development of self organizing middleware services providing high level interfaces for information managing is essential. ADS is a directory service for mobile ad-hoc networks dealing with local and nearby information as well as providing access to distant information. The approach discussed throughout this paper is based upon the concept of information markets.

Hutter, Christian; Rothkugel, Steffen

2007-01-01T23:59:59.000Z

58

Protocol for dynamic ad-hoc networks using distributed spanning trees  

Science Conference Proceedings (OSTI)

A dynamic ad-hoc network consists of a collection of mobile hosts with frequently changing network topology. We propose a distributed algorithm that adapts to the topology by utilizing spanning trees in the regions where the topology is stable, ... Keywords: ad-hoc network, distributed algorithm, routing, simulation, spanning tree

Sridhar Radhakrishnan; Gopal Racherla; Chandra N. Sekharan; Nageswara S. V. Rao; S. G. Batsell

2003-11-01T23:59:59.000Z

59

Distributed cooperative spectrum sensing in cognitive radio for ad hoc networks  

Science Conference Proceedings (OSTI)

Cognitive radio refers to an intelligent radio with the capability of sensing the radio environment and dynamically reconfiguring the operating parameters. Recent research has focused on using cognitive radios in ad hoc environments. Spectrum sensing ... Keywords: Ad hoc networks, Cognitive radio, Spectrum sensing, TV spectrum

Waleed Ejaz, Najam Ul Hasan, Hyung Seok Kim

2013-07-01T23:59:59.000Z

60

A Distributed Virtual Backbone Development Scheme for Ad-Hoc Wireless Networks  

Science Conference Proceedings (OSTI)

The virtual backbone is an approach for solving routing problems in ad-hoc wireless networks. The virtual backbone approach features low latency, moderate routing overhead and is a hybrid scheme that uses the table-driven and on-demand routing ... Keywords: Steiner tree, ad-hoc networks, clustering, routing, virtual backbone

Jyh-Horng Lin; Chyi-Ren Dow; Shiow-Fen Hwang

2003-12-01T23:59:59.000Z

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


61

An Efficient Multi-Channel MAC Protocol for Mobile Ad Hoc Networks  

Science Conference Proceedings (OSTI)

This paper proposes a novel multi-channel MAC protocol for mobile ad hoc networks that enables the nodes to transmit packets in distributed channels. In our protocol, the ATIM window is divided into two windows. The first window is called deciding channel ... Keywords: Ad hoc network, media access control (MAC), multi-channel

Wen-Hwa Liao; Wen-Chin Chung

2009-01-01T23:59:59.000Z

62

Analysis of a reputation system for Mobile Ad-Hoc Networks with liars  

Science Conference Proceedings (OSTI)

The application of decentralized reputation systems is a promising approach to ensure cooperation and fairness, as well as to address random failures and malicious attacks in Mobile Ad-Hoc Networks. However, they are potentially vulnerable to liars. ... Keywords: Mean-field approach, Mobile Ad-Hoc Network, Performance optimization, Reputation system, Robustness against liars

Jochen Mundinger; Jean-Yves Le Boudec

2008-03-01T23:59:59.000Z

63

Ad-Hoc Self-Organized Microgrid for Rural Electrification and Post-disaster Response  

Science Conference Proceedings (OSTI)

This paper presents the concept for an ad-hoc self-organized micro grid based on moveable and renewable energy sources and fully distributed coordination between intelligent power routing nodes. The primary goal of the proposed architecture is to build ... Keywords: Smart Grid, Self-Organization, Ad-hoc Network

Amos Brocco

2013-04-01T23:59:59.000Z

64

A prioritized battery-aware routing protocol for wireless ad hoc networks  

Science Conference Proceedings (OSTI)

It is a challenge area in the field of ad hoc networks to support prioritized routing for time sensitive applications, such as multimedia communications, IP telephony and interactive games. However the existing protocols did not consider the special ... Keywords: battery models, battery-awareness, energy efficiency, prioritized routing, routing protocols, wireless ad hoc networks

Chi Ma; Yuanyuan Yang

2005-10-01T23:59:59.000Z

65

An efficient reliable broadcasting protocol for wireless mobile ad hoc networks  

Science Conference Proceedings (OSTI)

The mobile ad hoc network (MANET) has recently been recognized as an attractive network architecture for wireless communication. Reliable broadcast is an important operation in MANET (e.g., giving orders, searching routes, and notifying important signals). ... Keywords: Broadcast storm, Mobile ad hoc network (MANET), Mobile computing, Reliable broadcast, Wireless communication

Chih-Shun Hsu; Yu-Chee Tseng; Jang-Ping Sheu

2007-04-01T23:59:59.000Z

66

Latency-sensitive power control for wireless ad-hoc networks  

Science Conference Proceedings (OSTI)

We investigate the impact of power control on latency in wireless ad-hoc networks. If transmission power is increased, interference increases, thus reducing network capacity. A node sending/relaying delay-sensitive real-time application traffic can, ... Keywords: ad-hoc networks, latency, medium access control, network connectivity, power control, wireless networks

Mohamed R. Fouad; Sonia Fahmy; Gopal Pandurangan

2005-10-01T23:59:59.000Z

67

Vehicular Ad Hoc Networks: A New Challenge for Localization-Based Systems  

Science Conference Proceedings (OSTI)

A new kind of ad hoc network is hitting the streets: Vehicular Ad Hoc Networks (VANets). In these networks, vehicles communicate with each other and possibly with a roadside infrastructure to provide a long list of applications varying from transit safety ... Keywords: Data Fusion, Localization, Vehicular Networks

Azzedine Boukerche; Horacio A. B. F. Oliveira; Eduardo F. Nakamura; Antonio A. F. Loureiro

2008-07-01T23:59:59.000Z

68

A survey on real-world implementations of mobile ad-hoc networks  

Science Conference Proceedings (OSTI)

Simulation and emulation are valuable techniques for the evaluation of algorithms and protocols used in mobile ad-hoc networks. However, these techniques always require the simplification of real-world properties such as radio characteristics or node ... Keywords: Emulation, Experiment, Implementation, Mobile ad-hoc networks, Real-world, Routing, Testbed

Wolfgang Kiess; Martin Mauve

2007-04-01T23:59:59.000Z

69

Ad Hoc Distributed Dynamic Data-Driven Simulations of Surface Transportation Systems  

Science Conference Proceedings (OSTI)

An ad hoc distributed dynamic data-driven simulation is a collection of autonomous online simulations brought together to model an operational system. They offer the potential of increased accuracy, responsiveness, and robustness compared to centralized ... Keywords: ad hoc distributed simulation, dynamic data-driven application system, microscopic simulation model, online simulation

Michael Hunter; Hoe Kyoung Kim; Wonho Suh; Richard Fujimoto; Jason Sirichoke; Mahesh Palekar

2009-04-01T23:59:59.000Z

70

Using ant-based agents for congestion control in ad-hoc wireless sensor networks  

Science Conference Proceedings (OSTI)

Ad-hoc wireless sensor networks suffer from problems of congestion, which lead to packet loss and excessive energy consumption. In this paper, we address the issue of congestion in these networks. We propose a new routing protocol for wireless sensor ... Keywords: Ad hoc wireless sensor networks, Ant-based agents, Congestion control, Routing

Sanjay K. Dhurandher; Sudip Misra; Harsh Mittal; Anubhav Agarwal; Isaac Woungang

2011-03-01T23:59:59.000Z

71

A Scalable and Reliable Multicast Routing Protocol for Ad-hoc Wireless Networks  

Science Conference Proceedings (OSTI)

Multicasting is an essential service for ad-hoc wireless networks. In a multicasting environment with multiple senders, receivers or meeting members, traditional multicast routing protocols must pay great overhead for multiple multicast sessions. This ... Keywords: ad-hoc wireless networks, clustering, multicasting, routing, virtual backbone

C. R. Dow; J. H. Lin; K. T. Chen; S. C. Chen; S. F. Hwang

2005-09-01T23:59:59.000Z

72

Distributed resource allocation with fairness for cognitive radios in wireless mobile ad hoc networks  

Science Conference Proceedings (OSTI)

Both spectrum sensing and power allocation have crucial effects on the performance of wireless cognitive ad hoc networks. In order to obtain the optimal available subcarrier sets and transmission powers, we propose in this paper a distributed resource ... Keywords: Cognitive radio, Distributed resource allocation, Mobile ad hoc networks, Power control, Spectrum allocation

Songtao Guo; Chuangyin Dang; Xiaofeng Liao

2011-08-01T23:59:59.000Z

73

A power adjusting algorithm on mobility control in mobile ad hoc networks  

Science Conference Proceedings (OSTI)

Power saving is one of the key issues in mobile ad-hoc networks (MANET), while previous researches in MAC layer are mostly focused on improving the channel utilization by adopting variable-range transmission power control. In this paper we focus on the ... Keywords: dynamic source routing (DSR), mobile ad-hoc networks (MANETs), mobility control, power control, power efficiency

Jianrui Yuan; Jintao Meng

2011-10-01T23:59:59.000Z

74

Position-based cluster routing protocol for mobile ad hoc networks  

Science Conference Proceedings (OSTI)

Some of the proposed mobile ad hoc network routing algorithms require maintaining a global network state at each node. The global state is always an approximation of the current network state due to the non-negligible delay of propagating local state. ... Keywords: GPS, QoS, mobile ad hoc network, multicasting, position-based routing protocol

Chao-Cheng Shih; Tzay-Farn Shih

2006-07-01T23:59:59.000Z

75

Landmarke: an ad hoc deployable ubicomp infrastructure to support indoor navigation of firefighters  

Science Conference Proceedings (OSTI)

Indoor navigation plays a central role for the safety of firefighters. The circumstances in which a firefighting intervention occurs represent a rather complex challenge for the design of supporting technology. In this paper, we present the results of ... Keywords: Ad hoc deployment, Firefighting, Human---computer interaction, Indoor navigation, Mobile ad hoc network, Navigation, Orientation, Sensor networks, Ubiquitous computing, Wearable computing

Leonardo Ramirez; Tobias Dyrks; Jan Gerwinski; Matthias Betz; Markus Scholz; Volker Wulf

2012-12-01T23:59:59.000Z

76

Mobility analysis of mobile hosts with random walking in ad hoc networks  

Science Conference Proceedings (OSTI)

This paper focuses on the modeling and analysis of the host mobility characteristics in an ad hoc network, in terms of the link available time and the number of link changes for multi-hop connectivity. Both the mobile handover model and the random walk ... Keywords: Ad hoc network, Link available time, Mobility, Random walk

Supeng Leng; Liren Zhang; Huirong Fu; Jianjun Yang

2007-07-01T23:59:59.000Z

77

A Data Sharing Facility for Mobile Ad-Hoc Emergency and Rescue Applications  

Science Conference Proceedings (OSTI)

Efficient information sharing is very important for emergency and rescue operations. Mobile Ad-Hoc Networks (MANETs) are often the only network environment for such operations. We have developed the MIDAS Data Space (MDS) to transparently share information ... Keywords: Emergency and rescue operations, mobile ad-hoc networks, tailor-made middleware, shared data space.

Thomas Plagemann; Ellen Munthe-Kaas; Katrine S. Skjelsvik; Matija Puzar; Vera Goebel; Ulrik Johansen; Joe Gorman; Santiago Perez Marin

2007-06-01T23:59:59.000Z

78

Integrating service discovery with routing and session management for ad-hoc networks  

Science Conference Proceedings (OSTI)

In this paper, we propose GSR: a new routing and session management protocol for ad-hoc networks as an integral part of a service discovery infrastructure. Traditional approaches place routing at a layer below service discovery. While this distinction ... Keywords: Ad-hoc networks, Routing, Service discovery, Service-centric routing, Session management

Dipanjan Chakraborty; Anupam Joshi; Yelena Yesha

2006-03-01T23:59:59.000Z

79

Capacity of ultra-wideband power-constrained ad hoc networks  

E-Print Network (OSTI)

increases ad hoc wireless capacity,” in Proc. IEEE Int.Negi and A. Rajeswaran, “Capacity of power constrained ad-Gupta and P. R. Kumar, “The capacity of wireless networks,”

Tang, Xiaojun; Hua, Yingbo

2008-01-01T23:59:59.000Z

80

Report of the Ad Hoc Panel on heavy ion facilities  

SciTech Connect

In response to a request from the USAEC, the President of the National Academy of Sciences appointed an Ad Hoc Panel under the NAS-NRC Committee on Nuclear Science to make an intensive study of various aspects of the science and technology involved in heavy ion research in light of the needs of the national program in this field. In particular, the panel was asked to formulate and evaluate various options for the development of heavy ion facilities that would include an appropriate accelerator complex capable of producing heavy ion beams and the ancillary apparatus required for experimental exploitation. Also, the Panel was asked to evaluate the current status and potentialities of the Super HILAC and Bevalac accelerators of the Lawrence Radiation Laboratory, Berkeley. Results of the study are presented. Topics include heavy ions in nuclear physics and chemistry, atomic physics, heavy ions and astro and space physics, materials science and solid state, and biomedicine. The state of the technology related to the choice of a heavy ion accelerator system is reviewed, and the various possible choices are reviewed including the large tandem accelerator, tandem- cyclotron systems, and linear accelerators. The upgrading of existing facilities (Super HILAC, Bevalac, and PPA) is discussed. Cost estimates for various heavy ion facilities are briefly discussed. (WHK)

1974-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


81

Throughput maximization in UWB-based ad-hoc networks  

E-Print Network (OSTI)

Abstract In this paper, we study the problem of radio resource allocation, both transmission rates and transmission powers, so as to maximize the throughput of UWB wireless ad-hoc networks. Our analysis is based on the packet-success function (PSF), which is defined as the probability of a data packet being successfully received as a function of the receiver’s signal-to-interference-and-noise-ratio (SINR). We find an optimal link transmission rate, which maximizes the link’s throughput and is dependent on the all active links transmission powers. If each link transmission rate is adapted to this optimal link transmission rate, then, with single-link operation (i.e., no other interference sources are present), the link’s throughput is directly proportional to the transmitter’s power and increases indefinitely with increasing transmission power. However, with multiplelinks operation and interference each other, as each link transmitting power increases, so does the interference level, and the total network throughput approaches a constant other than infinite. Thus, for sufficiently small transmission power, the total network throughput of the multiple-links case exceeds the throughput of the single-link case, but the reverse happens for high power. In addition, this paper reveals that, as the number of concurrently transmitting links increases, regardless of the power level, the maximal total network throughput approaches a constant, with each link’s throughput approaching zero. To maximize the network throughput, for the case of small maximal transmission power with weak interference levels, the optimal transmission scheduling

Zou Chuanyun; Haas Zygmunt J; Zou Sheng

2009-01-01T23:59:59.000Z

82

SENSTRAC: scalable querying of sensor networks from mobile platforms using tracking-style queries  

Science Conference Proceedings (OSTI)

Future applications running on mobile platforms will sometimes need to query sensors and track sensor data over time. This paper proposes a novel, but natural, solution to querying sensors from mobile platforms, based on the publish-subscribe paradigm. ... Keywords: MANET, SENSTRAC, ad hoc networks, mobile networks, publish-subscribe, query, querying sensors, scalability, sensor networks

Stefan Pleisch; Kenneth P. Birman

2008-06-01T23:59:59.000Z

83

An enhanced clustering algorithm for mobile ad hoc networks to improve the throughput  

Science Conference Proceedings (OSTI)

Mobile ad hoc networks (MANETs) consist of a number of wireless hosts that forms network without a fixed infrastructure. Clustering plays a vital role for MANETs in managing the resources. Clustering involves two processes such as cluster head ...

S. Muthuramalingam; R. Rajaram

2011-09-01T23:59:59.000Z

84

Presentation to the EAC - Workforce Ad Hoc Committee Panel Discussion - Wanda Reder  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Workforce Ad Hoc Committee Workforce Ad Hoc Committee Panel Discussion Wanda Reder June 11, 2012 DOE EAC create an EAC Workforce Ad Hoc Working Group to review the workforce needs and make recommendations to ensure those with appropriate skills sets are available to support the future grid. - Consists EAC members and invited participants - Coordinate with others - Committee activity will sunset after their recommendations - Participants: * Chairs: Wanda Reder; Vice-Chair: Tom Sloan * DOE Point of Contact: David Meyer, Gil Bindewald, Anjan Bose * Members: Barbara Kenny, NSF; Ann Randazzo, CEWD, Dennis Ray, PSERC, Barbara Tyran, EPRI; Elaine Ulrich, DOE; - Additional EAC participation is encouraged! 2012 Workforce Ad-Hoc Background * Electric demand growing via electrification to

85

Trust-based clustering for multicast key distribution scheme in ad hoc network (TBCMKDS)  

Science Conference Proceedings (OSTI)

In wireless and distributed nature of ad hoc networks, security has become a more sophisticated problem than security in other networks, due to the open nature and the lack of infrastructure of such networks. TBCMKDS discussed in this paper addresses ...

V. Palanisamy; P. Annadurai

2011-06-01T23:59:59.000Z

86

An energy-efficient communication system for ad hoc wireless and sensor networks  

E-Print Network (OSTI)

Existing ad hoc wireless and sensor network systems often trade off energy against performance. As such, it is hard to find a single deployable system that supports high data rates while maintaining energy-efficient ...

Tetteh, William Nii Adjetey

2007-01-01T23:59:59.000Z

87

A QoS Providing Multimedia Ad Hoc Wireless LAN with Granular OFDM-CDMA Channel  

Science Conference Proceedings (OSTI)

A QoS providing distributed resource management scheme for multimedia Ad Hoc Wireless LANs(AWLANs) based on orthogonal frequency division multiplexing-code division multiple access(OFDMCDMA) is presented. This scheme implements distributed resource management ...

Hyunho Yang; Kiseon Kim

2003-02-01T23:59:59.000Z

88

Minimizing interference of a wireless ad-hoc network in a plane  

Science Conference Proceedings (OSTI)

We consider the problem of topology control of a wireless ad-hoc network on a given set of points in the plane, where we aim to minimize the maximum interference by assigning a suitable transmission radius to each point. By using computational geometric ...

Magnús M. Halldórsson; Takeshi Tokuyama

2006-07-01T23:59:59.000Z

89

SELF-ORGANISING QUORUM SYSTEMS FOR AD HOC NETWORKS Gareth Owen and Mo Adda  

E-Print Network (OSTI)

-hop ad-hoc networks allow nodes to communicate with each other without being in transmission range for the destination. Many routing protocols propose a function that maps a node's ID to its location, but whilst this information. Li [2] divides the area into grid- squares of different orders. Starting with the grid

Augusto, Juan Carlos

90

A new two level hierarchy structuring for node partitioning in ad hoc networks  

Science Conference Proceedings (OSTI)

A big challenge in designing a distributed application is the partitioning which consists of optimizing the system component inter-communication. In this paper we introduce a new approach of Ad Hoc network group formation based on two level hierarchy ... Keywords: communication, distributed system, graph partitioning, group formation, partitioning

Benaouda Nacéra; Guyennet Hervé; Hammad Ahmed; Mostefai Mohammed

2010-03-01T23:59:59.000Z

91

Proceedings of the fourth ACM international workshop on Vehicular ad hoc networks  

Science Conference Proceedings (OSTI)

Welcome to the Fourth ACM International Workshop on Vehicular Ad Hoc Networks (VANET 2007) in beautiful Montreal! After the success of the previous three events, 2007 is a great year to continue this exciting workshop. The application of short- to medium-range ...

Wieland Holfelder; Paolo Santi; Yih-Chun Hu; Jean-Pierre Hubaux

2007-09-01T23:59:59.000Z

92

Proceedings of the 3rd international workshop on Vehicular ad hoc networks  

Science Conference Proceedings (OSTI)

Welcome to VANET 2006, the Third ACM International Workshop on Vehicular Ad Hoc Networks! After the success of the first two VANET workshops in 2004 and 2005, 2006 is a great year to continue this exciting workshop. The application of short- to medium-range ...

Wieland Holfelder; Dave Johnson; Hannes Hartenstein; Victor Bahl

2006-09-01T23:59:59.000Z

93

Survey paper: A survey on routing algorithms for wireless Ad-Hoc and mesh networks  

Science Conference Proceedings (OSTI)

Wireless networking technology is evolving as an inexpensive alternative for building federated and community networks (relative to the traditional wired networking approach). Besides its cost-effectiveness, a wireless network brings operational efficiencies, ... Keywords: Ad-Hoc network, Multi-hop network, Routing algorithm, Wireless Mesh Network (WMN)

Eiman Alotaibi; Biswanath Mukherjee

2012-02-01T23:59:59.000Z

94

Size-restricted cluster formation and cluster maintenance technique for mobile ad hoc networks  

Science Conference Proceedings (OSTI)

Mobile ad hoc networks may be composed of a large number of nodes and hence a hierarchical cluster-based structure can be employed to address the scalability issues of the large network. In this paper we propose a size-restricted, distributed clustering ...

Gayathri Venkataraman; Sabu Emmanuel; Srikanthan Thambipillai

2007-03-01T23:59:59.000Z

95

Review: Review of multicast routing mechanisms in mobile ad hoc networks  

Science Conference Proceedings (OSTI)

Frequent interactions among the group members of distributed wireless network environment may be facilitated with the help of Mobile Ad Hoc NETworks (MANETs). Some of the group-oriented applications include disaster management, battlefields, audio/video ... Keywords: MANET, Multicast routing, Quality of service, Reliability

Rajashekhar C. Biradar; Sunilkumar S. Manvi

2012-01-01T23:59:59.000Z

96

A peer-to-peer overlay approach for emergency mobile ad hoc network based multimedia communications  

Science Conference Proceedings (OSTI)

Overlay networks are located on top of the physical network and are generally favored for the implementation of peer-to-peer (P2P) networks providing services such as voice over IP (VoIP) communications. The operation of the overlay network results in ... Keywords: ad hoc networking, emergency, overlays, peer-to-peer

Grant P. Millar; Tipu A. Ramrekha; Christos Politis

2009-09-01T23:59:59.000Z

97

LARS: a locally aware reputation system for mobile ad hoc networks  

Science Conference Proceedings (OSTI)

Mobile ad hoc networks (MANETs) have nodes that are dynamically and arbitrarily located. The nodes are often battery powered and may behave selfishly to preserve power. A promising mechanism to deal with node selfishness is to use reputation methods. ... Keywords: MANET, reputation systems, selfishness, trust, virtual currency schemes

Jiangyi Hu; Mike Burmester

2006-03-01T23:59:59.000Z

98

ADAPTIVE DYNAMIC ROUTING IN MOBILE WIRELESS AD HOC NETWORKS UTILIZING ON-LINE LINK LIFE ESTIMATES  

E-Print Network (OSTI)

ADAPTIVE DYNAMIC ROUTING IN MOBILE WIRELESS AD HOC NETWORKS UTILIZING ON-LINE LINK LIFE ESTIMATES of communication infrastructure and by the mobility of the hosts, which also act as routers [9]. Because of this varies widely with the age of the links, so the current duration of a link brings much more information

Baras, John S.

99

Review: Connected dominating sets in wireless ad hoc and sensor networks - A comprehensive survey  

Science Conference Proceedings (OSTI)

Topology control is a fundamental issue in wireless ad hoc and sensor networks. Due to intrinsic characteristic of flatness, hierarchical topology can achieve the scalability and efficiency of a wireless network. To solve this problem, one can construct ... Keywords: Connected dominating set (CDS), Topology control, Virtual backbone network, Wireless network

Jiguo Yu; Nannan Wang; Guanghui Wang; Dongxiao Yu

2013-01-01T23:59:59.000Z

100

On improving temporal and spatial mobility metrics for wireless ad hoc networks  

Science Conference Proceedings (OSTI)

This work shows that two well-known spatial and temporal mobility metrics for wireless multi-hop networks have limitations, possibly resulting in misleading results. Based on the concept of spatial dependence among nodes including transient periods of ... Keywords: Mobile ad hoc network, Mobility metric, Mobility model, Network simulation, Spatial dependence, Temporal dependence

Elmano Ramalho Cavalcanti; Marco Aurélio Spohn

2012-04-01T23:59:59.000Z

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


101

Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics  

Science Conference Proceedings (OSTI)

We study the problem of spanner construction in wireless ad-hoc networks through power assignments under two spanner models—distance and energy. In particular, we are interested in asymmetric power assignments so that the induced communication ... Keywords: Geometric and energy spanners, approximation algorithms

Hanan Shpungin, Michael Segal

2013-07-01T23:59:59.000Z

102

The impact of simulation area shape on the performance of ad hoc networks  

Science Conference Proceedings (OSTI)

The shape of the simulation area is critical in simulations because average hops of source to destination will change in different shapes. We measure one reliability metric (connectivity) and five efficiency metrics (round trip time, drop rate, energy ... Keywords: ad hoc network, performance, simulation area

Heng Luo; David Laurenson; Aihuang Guo; Hui Li

2009-09-01T23:59:59.000Z

103

Eventually Byzantine Agreement on CDS-based mobile ad hoc network  

Science Conference Proceedings (OSTI)

Reliability is an important research topic in the study of distributed systems. Under many circumstances, a healthy processor in a distributed system needs to reach a common agreement before performing some special tasks even if the faults exist. In ... Keywords: Consensus, Eventual Byzantine Agreement, Fault-tolerant, Mobile ad hoc network

Mao-Lun Chiang

2012-05-01T23:59:59.000Z

104

Distributed point coordination function for IEEE 802.11 wireless ad hoc networks  

Science Conference Proceedings (OSTI)

The Distributed Point Coordination Function (DPCF) is presented in this paper as a novel Medium Access Control Protocol (MAC) for wireless ad hoc networks. DPCF extends the operation of the Point Coordination Function (PCF) defined in the IEEE 802.11 ... Keywords: DCF, DPCF, DQCA, DQMAN, IEEE 802.11, MAC, PCF

J. Alonso-Zárate; C. Crespo; Ch. Skianis; L. Alonso; Ch. Verikoukis

2012-05-01T23:59:59.000Z

105

Distributed algorithms for resource allocation of physical and transport layers in wireless cognitive ad hoc networks  

Science Conference Proceedings (OSTI)

In this paper, by integrating together congestion control, power control and spectrum allocation, a distributed algorithm is developed to maximize the aggregate source utility and increase end-to-end throughput. Despite the inherent difficulties of non-convexity ... Keywords: Cognitive ad hoc network, Congestion control, Convex optimization, Cross-layer design, Dual decomposition, Power control, Spectrum allocation

Songtao Guo; Chuangyin Dang; Xiaofeng Liao

2011-02-01T23:59:59.000Z

106

Too Much Mobility Limits the Capacity of Wireless Ad-hoc Networks  

E-Print Network (OSTI)

is that communication between distant nodes causes too much interference. Therefore most of the communication must happen between only nearest neighbors and multiple hops are required to carry a message to a distant node and channel estimation is harder. In this paper, we explore the capacity of highly mobile ad-hoc networks

Jafar, Syed A.

107

Location-aware routing protocol with dynamic adaptation of request zone for mobile ad hoc networks  

Science Conference Proceedings (OSTI)

One possibility direction to assist routing in Mobile Ad Hoc Network (MANET) is to use geographical location information provided by positioning devices such as global positioning systems (GPS). Instead of searching the route in the entire network blindly, ... Keywords: GPS, MANET, location-aware, position-based, routing protocol

Tzay-Farn Shih; Hsu-Chun Yen

2008-06-01T23:59:59.000Z

108

ASR: anonymous and secure reporting of traffic forwarding activity in mobile ad hoc networks  

Science Conference Proceedings (OSTI)

Nodes forward data on behalf of each other in mobile ad hoc networks. In a civilian application, nodes are assumed to be selfish and rational, i.e., they pursue their own self-interest. Hence, the ability to accurately measure traffic forwarding is critical ... Keywords: Anonymity, MANET, Monitoring, Packet forwarding, Secure link layer acknowledgment, Secure reporting protocol, Security

Heesook Choi; William Enck; Jaesheung Shin; Patrick D. Mcdaniel; Thomas F. Porta

2009-05-01T23:59:59.000Z

109

Topology Control and Mobility Strategy for UAV Ad-hoc Networks: A Survey  

E-Print Network (OSTI)

Topology Control and Mobility Strategy for UAV Ad-hoc Networks: A Survey Zhongliang Zhao, Torsten and software are allowing the rapid development of small unmanned aerial vehicles (UAVs), capable of per fiber-reinforce plastic materials let UAVs become an aerial platform, that can be equipped

Braun, Torsten

110

U-270:Trend Micro Control Manager Input Validation Flaw in Ad...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

0:Trend Micro Control Manager Input Validation Flaw in Ad Hoc Query Module Lets Remote Users Inject SQL Commands U-270:Trend Micro Control Manager Input Validation Flaw in Ad Hoc...

111

Semantic-based resource discovery, composition and substitution in IEEE 802.11 mobile ad hoc networks  

Science Conference Proceedings (OSTI)

We present a general framework for resource discovery, composition and substitution in mobile ad-hoc networks, exploiting knowledge representation techniques. Key points of the proposed approach are: (1) reuse of discovery information at network layer ... Keywords: IEEE 802.11, Mobile ad-hoc network, Routing protocol, Semantic-based composition, Service discovery protocol, Service substitutability

Michele Ruta; Giammarco Zacheo; Luigi Alfredo Grieco; Tommaso Noia; Gennaro Boggia; Eufemia Tinelli; Pietro Camarda; Eugenio Sciascio

2010-07-01T23:59:59.000Z

112

Constant-Round password-based group key generation for multi-layer ad-hoc networks  

Science Conference Proceedings (OSTI)

In this paper, we consider a multi-layer mobile ad-hoc network (MANET) composed of several kinds of networking units (such as ground soldiers, tanks, and unmanned aerial vehicles) with heterogeneous resources to communicate and compute. In this multi-layer ... Keywords: authenticated key exchange, heterogeneous, key agreement, multi-layer ad-hoc network, password authentication, pervasive computing

Jin Wook Byun; Su-Mi Lee; Dong Hoon Lee; Dowon Hong

2006-04-01T23:59:59.000Z

113

BUILDING UNDERWATER AD-HOC NETWORKS AND SENSOR NETWORKS FOR LARGE SCALE REAL-TIME AQUATIC APPLICATIONS  

E-Print Network (OSTI)

BUILDING UNDERWATER AD-HOC NETWORKS AND SENSOR NETWORKS FOR LARGE SCALE REAL-TIME AQUATIC, CT 06269 Gainesville, FL 32611 Abstract-- Large-scale Underwater Ad-hoc Networks (UANET) and Underwater Sensor Networks (UWSN) are novel networking paradigms to explore the uninhabited oceans. How- ever

Cui, Jun-Hong

114

Problems with providing QoS in EDCA ad-hoc networks with hidden and exposed nodes  

Science Conference Proceedings (OSTI)

In this paper we investigate the problem of providing QoS within IEEE 802.11 EDCA ad-hoc networks. Our study shows that a strong unfairness in medium access between certain nodes may appear. It also shows that the possible unfairness is dependent on ... Keywords: EDCA, QoS, ad-hoc, hidden and exposed nodes

Katarzyna Kosek

2009-04-01T23:59:59.000Z

115

Use of Multiword Terms and Query Expansion for Interactive Information Retrieval  

E-Print Network (OSTI)

Use of Multiword Terms and Query Expansion for Interactive Information Retrieval Fidelia Ibekwe in the INEX 2008 Ad- Hoc Retrieval track. We investigated the effect of multiword terms on retrieval-Hoc tasks: Focused retrieval, Relevant-in-Context and Best-in-Context. 1 Introduction The INEX Ad-Hoc track

Paris-Sud XI, Université de

116

Bounded-distance multi-clusterhead formation in wireless ad hoc networks  

Science Conference Proceedings (OSTI)

We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the maximum distance from nodes to their cluster-heads. This problem is similar ... Keywords: (k,r)-dominating sets, Ad hoc networks, Clustering, Distance domination, Domination in graphs, Multi-core multicast protocols, Multicast protocols, Multiple domination

Marco Aurélio Spohn; J. J. Garcia-Luna-Aceves

2007-05-01T23:59:59.000Z

117

Multi-hop Broadcast from Theory to Reality: Practical Design for Ad Hoc Networks  

E-Print Network (OSTI)

We propose a complete design for a scope limited, multihop broadcast middleware, which is adapted to the variability of the ad-hoc environment and works in unlimited ad-hoc networks such as a crowd in a city, or car passengers in a busy highway system. We address practical problems posed by: the impossibility to set the TTL correctly at all times, the poor performance of multiple access protocols in broadcast mode, flow control when there is no acknowledgment and scheduling of multiple concurrent broadcasts. Our design, called “Self Limiting Epidemic Forwarding” (SLEF), automatically adapts its behavior from single hop MAC layer broadcast to epidemic forwarding when the environment changes from being extremely dense to sparse, sporadically connected. A main feature of SLEF is a nonclassical manipulation of the TTL field, which combines the usual decrement-when-sending to many very small decrements when receiving. SLEF is intended as a replacement of k-hop limited broadcast for the unlimited ad-hoc setting. 1.

Alaeddine El Fawal

2007-01-01T23:59:59.000Z

118

Performance of ad hoc networks with two-hop relay routing and limited packet lifetime (extended version)  

Science Conference Proceedings (OSTI)

We consider a mobile ad hoc network consisting of three types of nodes (source, destination and relay nodes) and using the two-hop relay routing. This type of routing takes advantage of the mobility and the storage capacity of the nodes, called the relay ... Keywords: Delay tolerant network, Limited packet lifetime, Mobile ad hoc network, Mobility model, Performance analysis, Two-hop relay protocol

Ahmad Al Hanbali; Philippe Nain; Eitan Altman

2008-06-01T23:59:59.000Z

119

Routing Layer Support for Service Discovery in Mobile Ad Hoc Networks  

E-Print Network (OSTI)

Service discovery in Mobile Ad Hoc Networks is an essential process in order for these networks to be selfconfigurable. In this paper we argue that Service Discovery can be greatly enhanced in terms of efficiency (regarding service discoverability and energy consumption), by piggybacking service information in routing layer messages. Thus, a node requesting a service in addition to discovering that service, it is simultaneously informed of the route to the service provider.We extend the Zone Routing Protocol in order to encapsulate service information in its routing messages and through extensive simulations we prove the superiority of our routing layer-enhanced service discovery scheme against an application layer-based flooding scheme. I.

Christopher N. Ververidis; George C. Polyzos

2005-01-01T23:59:59.000Z

120

On the Spectrum Handoff for Cognitive Radio Ad Hoc Networks without Common Control Channel  

E-Print Network (OSTI)

Cognitive radio (CR) technology is a promising solution to enhance the spectrum utilization by enabling unlicensed users to exploit the spectrum in an opportunistic manner. Since unlicensed users are temporary visitors to the licensed spectrum, they are required to vacate the spectrum when a licensed user reclaims it. Due to the randomness of the appearance of licensed users, disruptions to both licensed and unlicensed communications are often difficult to prevent. In this chapter, a proactive spectrum handoff framework for CR ad hoc networks is proposed to address these concerns. In the proposed framework, channel switching policies and a proactive spectrum handoff protocol are proposed to let unlicensed users vacate a channel before a licensed user utilizes it to avoid unwanted interference. Network coordination schemes for unlicensed users are also incorporated into the spectrum handoff protocol design to realize channel rendezvous. Moreover, a distributed channel selection scheme to eliminate collisions a...

Song, Yi

2011-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


121

Scalable ant-based routing algorithm for ad-hoc networks  

E-Print Network (OSTI)

Ants-based routing algorithms have attracted the attention of researchers because they are more robust, reliable, and scalable than other conventional routing algorithms. Since they do not involve extra message exchanges to maintain paths when network topology changes, they are suitable for mobile ad-hoc networks where nodes move dynamically and topology changes frequently. As the number of nodes increases, however, the number of ants (i.e., mobile agents or control messages) also increases and it reduces the scalability of algorithms. In this paper, we propose a scalable ant-based routing algorithm that makes the overhead low while keeping paths short. Our algorithm uses a multistep TTL (Time To Live) scheme, an effective message migration scheme, and an efficient scheme for updating the probability of packet forwarding. Simulation experiments have confirmed that our proposed algorithm can establish shorter paths than the conventional ant-based algorithm with the same signaling overhead.

Yoshitaka Ohtaki; Naoki Wakamiya; Masayuki Murata; Makoto Imase

2004-01-01T23:59:59.000Z

122

Stochastic Geometry based Medium Access Games in Mobile Ad hoc Networking  

E-Print Network (OSTI)

This paper studies the performance of Mobile Ad hoc Networks (MANETs) when the nodes, that form a Poisson point process, selfishly choose their Medium Access Probability (MAP). We consider goodput and delay as the performance metric that each node is interested in optimizing taking into account the transmission energy costs. We introduce a pricing scheme based on the transmission energy requirements and compute the symmetric Nash equilibrium of the game in closed form. It is shown that by appropriately pricing the nodes, the selfish behavior of the nodes can be used to achieve the social optimum at equilibrium. The Price of anarchy is then analyzed for these games. With delay based utility, we bound the price of anarchy and study the effect of the price factor. With goodput based utility, it is shown that price of anarchy is infinite at the price factor that achieves the global optima.

Hanawal, Manjesh Kumar; Baccelli, Francois

2011-01-01T23:59:59.000Z

123

Transmission Capacity of Wireless Ad Hoc Networks with Energy Harvesting Nodes  

E-Print Network (OSTI)

Transmission capacity of an ad hoc wireless network is analyzed when each node of the network harvests energy from nature, e.g. solar, wind, vibration etc. Transmission capacity is the maximum allowable density of nodes, satisfying a per transmitter-receiver rate, and an outage probability constraint. Energy arrivals at each node are assumed to follow a Bernoulli distribution, and each node stores energy using an energy buffer/battery. For ALOHA medium access protocol (MAP), optimal transmission probability that maximizes the transmission capacity is derived as a function of the energy arrival distribution. Game theoretic analysis is also presented for ALOHA MAP, where each transmitter tries to maximize its own throughput, and symmetric Nash equilibrium is derived. For CSMA MAP, back-off probability and outage probability are derived in terms of input energy distribution, thereby characterizing the transmission capacity.

Vaze, Rahul

2012-01-01T23:59:59.000Z

124

A New Energy Efficient Routing Algorithm Based on a New Cost Function in Wireless Ad hoc Networks  

E-Print Network (OSTI)

Wireless ad hoc networks are power constrained since nodes operate with limited battery energy. Thus, energy consumption is crucial in the design of new ad hoc routing protocols. In order to maximize the lifetime of ad hoc networks, traffic should be sent via a route that can be avoid nodes with low energy. In addition, considering that the nodes of ad hoc networks are mobile, it is possible that a created path is broken because of nodes mobility and establishment of a new path would be done again. This is because of sending additional control packets, accordingly, energy consumption increases. Also, it should avoid nodes which have more buffered packets. Maybe, because of long queue, some of these packets are dropped and transmitted again. This is the reason for wasting of energy. In this paper we propose a new energy efficient algorithm, that uses a new cost function and avoid nodes with characteristics which mentioned above. We show that this algorithm improves the network energy consumption by using this ...

Lotfi, Mehdi; Shahmirzadi, Majid Asadi

2010-01-01T23:59:59.000Z

125

No Junk, no Peeking, Serious Offers Only: P2P File Exchange in Wireless Ad-hoc Networks  

Science Conference Proceedings (OSTI)

We consider the problem of anonymous file exchange in wireless ad-hoc networks. We propose a new protocol, dubbed RASH (Roam And SHare), to address the problem. RASH is a peer-to-peer (P2P) protocol which fulfills three objectives: (a) protection of ...

Ryan Vogt; Ioanis Nikolaidis; Pawel Gburzynski

2005-11-01T23:59:59.000Z

126

Survey Paper: A survey of MAC layer solutions to the hidden node problem in ad-hoc networks  

Science Conference Proceedings (OSTI)

Ad-hoc networks suffer from the problem of hidden nodes (terminals), which leads to severe degradation of network throughput. This survey gives a comprehensive overview of Medium Access Control (MAC) protocols which directly or indirectly address this ... Keywords: Hidden node problem, MAC layer, Protocol classification, Protocol comparison

Katarzyna Kosek-Szott

2012-05-01T23:59:59.000Z

127

A new busy signal-based MAC protocol supporting QoS for ad-hoc networks with hidden nodes  

Science Conference Proceedings (OSTI)

This article presents three versions of a novel MAC protocol for IEEE 802.11 ad-hoc networks called Busy Signal-based Mechanism turned On (BusySiMOn) (This is an extended version of our conference paper: [15]). The key idea of the proposed solution is ... Keywords: EDCA, Hidden nodes, MAC protocol, QoS, Wireless communications

Katarzyna Kosek-Szott; Marek Natkaniec; Andrzej R. Pach

2013-08-01T23:59:59.000Z

128

A security solution for IEEE 802.11's ad hoc mode: password-authentication and group Diffie Hellman key exchange  

Science Conference Proceedings (OSTI)

IEEE 802 standards ease the deployment of networking infrastructures and enable employers to access corporate networks while travelling. These standards provide two modes of communication called infrastructure and ad hoc modes. A security solution for ... Keywords: Diffie Hellman, IEEE 80211, ad hoc networks, cryptography, dictionary attacks, group key exchange, mobile networks, network security, password authentication, provable security, random oracles, wireless networks

Emmanuel Bresson; Olivier Chevassut; David Pointcheval

2007-05-01T23:59:59.000Z

129

Characterizing the Interaction Between Routing and MAC Protocols in Ad-Hoc Networks  

SciTech Connect

We empirically study the effect of mobility on the performance of protocols designed for wireless ad-hoc networks. An important objective is to study the interaction of the Routing and MAC layer protocols under different mobility parameters. We use three basic mobility models: grid mobility model, random waypoint model, and exponential correlated random model. The performance of protocols is measured in terms of (i) latency, (ii) throughput, (iii) number of packets received, (iv) long term fairness and (v) number of control packets at the MAC and routing layer level. Three different commonly studied routing protocols are used: AODV, DSR and LAR1. Similarly three well known MAC protocols are used: MACA, 802.1 1 and CSMA. Our main contribution is simulation based experiments coupled with rigorous statistical analysis to characterize the interaction of MAC layer protocols with routing layer protocols in ad-hoc networks. From the results, we can conclude the following: e No single MAC or Routing protocol dominated the other protocols in their class. Probably more interestingly, no MAURouting protocol combination was better than other combinations over all scenarios and response variables. 0 In general, it is not meaningful to speak about a MAC or a routing protocol in isolation. Presence of interaction leads to trade-offs between the amount of control packets generated by each layer. The results raise the possibility of improving the performance of a particular MAC layer protocol by using a cleverly designed routing protocol or vice-versa. Thus in order to improve the performanceof a communication network, it is important to study the entire protocol stack as a single algorithmic construct; optimizing individual layers in the seven layer OS1 stack will not yield performance improvements beyond a point. A methodological contribution of this paper is the use of statistical methods such as analysis of variance (ANOVA), to characterize the interaction between the protocols, mobility patterns and speed. Such methods allow us to analyze complicated experiments with large input space in a systematic manner.

Barrett, C. L. (Christopher L.); Drozda, M. (Martin); Marathe, A. (Achla); Marathe, M. V. (Madhav V.)

2002-01-01T23:59:59.000Z

130

Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms  

E-Print Network (OSTI)

The Min Energy broadcast problem consists in assigning transmission ranges to the nodes of an ad-hoc network in order to guarantee a directed spanning tree from a given source node and, at the same time, to minimize the energy consumption (i.e. the energy cost) yielded by the range assignment. Min energy broadcast is known to be NP-hard. We consider random-grid networks where nodes are chosen independently at random from the $n$ points of a $\\sqrt n \\times \\sqrt n$ square grid in the plane. The probability of the existence of a node at a given point of the grid does depend on that point, that is, the probability distribution can be non-uniform. By using information-theoretic arguments, we prove a lower bound $(1-\\epsilon) \\frac n{\\pi}$ on the energy cost of any feasible solution for this problem. Then, we provide an efficient solution of energy cost not larger than $1.1204 \\frac n{\\pi}$. Finally, we present a fully-distributed protocol that constructs a broadcast range assignment of energy cost not larger tha...

Calamoneri, Tiziana; Monti, Angelo; Rossi, Gianluca; Silvestri, Riccardo

2008-01-01T23:59:59.000Z

131

Building Underwater Ad-Hoc Networks and Sensor Networks for Large Scale Real-Time Aquatic Applications  

E-Print Network (OSTI)

Large-scale Underwater Ad-hoc Networks (UANET) and Underwater Sensor Networks (UWSN) are novel networking paradigms to explore the uninhabited oceans. However, the characteristics of these new networks, such as huge propagation delay, floating node mobility, and limited acoustic link capacity, are significantly different from ground-based mobile ad-hoc networks (MANET) and wireless sensor networks (WSN). In this paper we adopt a top-down approach to explore the new research subject. We at first show a new practical application scenario that cannot be addressed by existing technology and hence demands the advent of the UANET and UWSN. Then along the layered protocol stack, we go down from the top application layer to the bottom physical layer. At each layer we show a set of new design challenges. We conclude that UANET and UWSN are challenges that must be answered by inter-disciplinary efforts of acoustic communication, signal processing and mobile acoustic network protocol design.

Jiejun Kong; Jun-hong Cui; Dapeng Wu; Mario Gerla

2005-01-01T23:59:59.000Z

132

A Comprehensive study of a New Multipath Energy Aware Routing Protocol for Mobile Ad-hoc Networks  

E-Print Network (OSTI)

Maximizing network lifetime is a very challenging issue in routing protocol design for Mobile Ad-hoc NETworks (MANETs), since mobile nodes are powered by limited-capacity batteries. Furthermore, replacing or recharging batteries is often impossible in critical environments (e.g. battlefields, disaster areas, etc.) The proposed MEA-DSR (Multipath Energy-Aware on Demand Source Routing) protocol uses a load distribution policy in order to maximize network lifetime. The simulation results have shown the efficiency of the proposed protocol in comparison to DSR routing protocol in many difficult scenarios

Chettibi, Saloua

2009-01-01T23:59:59.000Z

133

Analysis of Safari: An architecture for scalable ad hoc networking and services.  

E-Print Network (OSTI)

??The convenience, utility value, and ease of deployment has led to an ubiquitous integration of mobile computing devices which will, in future, form mobile ad… (more)

Mohammed, Ahamed Khan

2004-01-01T23:59:59.000Z

134

A Simple Battery Aware Gossip Based Sleep Protocol for Densely Deployed Ad-hoc and Sensor Networks  

E-Print Network (OSTI)

Conserving power in mobile ad-hoc and sensor networks is a big challenge. Most of the nodes in these networks, in general, are battery powered, therefore, an efficient power saving protocol is required to extend the lifetime of such networks. A lot of work has been done and several protocols have been proposed to address this problem. Gossip based protocols, which are based on the results of percolation theory, significantly reduce power consumption with very little implementation overhead. However, not much work has been done to make gossiping battery aware. In this paper we introduce a simple gossip based battery aware sleep protocol. The protocol allows low battery nodes to sleep more, therefore, improves overall network lifetime.

Shukla, Ashish

2010-01-01T23:59:59.000Z

135

An Experimental Evaluation of an Alternative to the Pivot Table for Ad Hoc Access to OLAP Data  

E-Print Network (OSTI)

This paper examines the usability of the orthodox interface to access business intelligence data held in OLAPbased systems -- the pivot table. An alternative to the pivot table is described, based on Erik Thomsen's simple diagramming technique for designing OLAP data structures. That interface is compared to the pivot table in a laboratory-based experiment. The results show that the alternative interface is a better interface to use for ad hoc access to OLAP data. The results for the subjects using the pivot table are very poor, with nearly a third of them being unable to successfully complete any of three simple analysis tasks. These results have important implications, as many systems and software tools are now based on the pivot table interface. The pivot table could be too difficult for most users to use, limiting the success of business intelligence systems based on OLAP technology.

Peter O' Donnell; Nick Draper

2004-01-01T23:59:59.000Z

136

Mobility changes anonymity: new passive threats in mobile ad hoc networks  

E-Print Network (OSTI)

Mobility Changes Anonymity: New Passive Threats in Mobile AdThese new aspects are all introduced by mobility and leftThese new threats are all introduced by mobility and are

Hong, Xiaoyan; Kong, Jiejun; Gerla, Mario

2006-01-01T23:59:59.000Z

137

Qunits: queried units in database search  

E-Print Network (OSTI)

Keyword search against structured databases has become a popular topic of investigation, since many users find structured queries too hard to express, and enjoy the freedom of a ``Google-like'' query box into which search terms can be entered. Attempts to address this problem face a fundamental dilemma. Database querying is based on the logic of predicate evaluation, with a precisely defined answer set for a given query. On the other hand, in an information retrieval approach, ranked query results have long been accepted as far superior to results based on boolean query evaluation. As a consequence, when keyword queries are attempted against databases, relatively ad-hoc ranking mechanisms are invented (if ranking is used at all), and there is little leverage from the large body of IR literature regarding how to rank query results. Our proposal is to create a clear separation between ranking and database querying. This divides the problem into two parts, and allows us to address these separately. The first tas...

Nandi, Arnab

2009-01-01T23:59:59.000Z

138

NAC Ad-Hoc Task Force on Planetary Defense July 8-9, 2010 CORRECTED 9/15/10 1 NASA ADVISORY COUNCIL (NAC)  

E-Print Network (OSTI)

-finding at NASA HQ. DISCUSSION Timeline for Ad-Hoc Task Force on Planetary Defense A brief discussion reiterated Force purview. · Ken Ford, NAC Chair, has requested from the Task Force a coherent, organized report, such as the National Research Council (NRC) report. · Key would be an individual at NASA HQ who would have a budget

139

Underwater wireless ad hoc sensor networks are aimed at remotely monitoring various aquatic activities, such as marine biological and zoological lives, geological changes, and  

E-Print Network (OSTI)

Abstract Underwater wireless ad hoc sensor networks are aimed at remotely monitoring various aquatic activities, such as marine biological and zoological lives, geological changes, and underwater quality of service is more difficult in underwater net- works due to large underwater propagation delay

Kumar, M. Jagadesh

140

EFFECT OF MOBILITY ON PERFORMANCE OF WIRELESS AD-HOC NETWORK PROTOCOLS.  

SciTech Connect

We empirically study the effect of mobility on the performance of protocols designed for wireless adhoc networks. An important ohjective is to study the interaction of the Routing and MAC layer protocols under different mobility parameters. We use three basic mobility models: grid mobility model, random waypoint model, and exponential correlated random model. The performance of protocols was measured in terms of (i) latency, (ii) throughput, (iii) number of packels received, (iv) long term fairness and (v) number of control packets at the MAC layer level. Three different commonly studied routing protocols were used: AODV, DSR and LAR1. Similarly three well known MAC protocols were used: MACA, 802.1 1 and CSMA. The inair1 conclusion of our study include the following: 1. 'I'he performance of the: network varies widely with varying mobility models, packet injection rates and speeds; and can ba in fact characterized as fair to poor depending on the specific situation. Nevertheless, in general, it appears that the combination of AODV and 802.1 I is far better than other combination of routing and MAC protocols. 2. MAC layer protocols interact with routing layer protocols. This concept which is formalized using statistics implies that in general it is not meaningful to speak about a MAC or a routing protocol in isolation. Such an interaction leads to trade-offs between the amount of control packets generated by each layer. More interestingly, the results wise the possibility of improving the performance of a particular MAC layer protocol by using a cleverly designed routing protocol or vice-versa. 3. Routing prolocols with distributed knowledge about routes are more suitable for networks with mobility. This is seen by comparing the performance of AODV with DSR or LAR scheme 1. In DSli and IAR scheme 1, information about a computed path is being stored in the route query control packct. 4. MAC layer protocols have varying performance with varying mobility models. It is not only speed that influences the performance but also node degree and connectivity of the dynamic network that affects the protocol performance. 'The main implication of OUI' work is that performance analysis of protocols at a given level in the protocol stack need to be studied not locally in isolation but as a part of the complete protocol stack. The results suggest that in order to improve the pcrlormance of a communication network, it will be important to study the entire protocol stack as a single algorithmic construct; optimizing individual layers in the 7 layer OS1 stilck will not yield performance improvements beyond a point. A methodological contribution of this paper is the use of statistical methods such as design of experinierits arzd aiialysis qf variance methods to characterize the interaction between the protocols, mobility patterns and speed. This allows us to mako much more informed conclusions about the performance of thc protocols than would have been possible by merely running these experiments and observing the data. These ideas are of independtmt interest and are applicable in other contexts wherein one experimentally analyzes algorithms.

Barrett, C. L. (Christopher L.); Drozda, M. (Martin); Marathe, M. V. (Madhav V.); Marathe, A. (Achla)

2001-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


141

A Security Solution for IEEE 802.11's Ad-hoc Mode:Password-Authentication and Group Diffie-Hellman Key Exchange  

Science Conference Proceedings (OSTI)

The IEEE 802 standards ease the deployment of networkinginfrastructures and enable employers to accesscorporate networks whiletraveling. These standards provide two modes of communication calledinfrastructure and ad-hoc modes. A security solution for the IEEE802.11's infrastructure mode took several years to reach maturity andfirmware are still been upgraded, yet a solution for the ad-hoc modeneeds to be specified. The present paper is a first attempt in thisdirection. It leverages the latest developments in the area ofpassword-based authentication and (group) Diffie-Hellman key exchange todevelop a provably-secure key-exchange protocol for IEEE 802.11's ad-hocmode. The protocol allows users to securely join and leave the wirelessgroup at time, accommodates either a single-shared password orpairwise-shared passwords among the group members, or at least with acentral server; achieves security against dictionary attacks in theideal-hash model (i.e. random-oracles). This is, to the best of ourknowledge, the first such protocol to appear in the cryptographicliterature.

Emmanuel, Bresson; Olivier, Chevassut; David, Pointcheval

2005-10-01T23:59:59.000Z

142

uRbAn: A Multipath Routing based Architecture with Energy and Mobility Management for Quality of Service Support in Mobile Ad hoc Networks  

E-Print Network (OSTI)

Designing a wireless node that supports quality of service (QoS) in a mobile ad hoc network is a challenging task. In this paper, we propose an architecture of a wireless node that may be used to form a mobile ad hoc network that supports QoS. We discuss the core functionalities required for such a node and how those functionalities can be incorporated. A feature of our architecture is that the node has the ability to utilize multiple paths, if available, for the provision of QoS. However, in the absence of multiple paths it can utilize the resources provided by a single path between the source and the destination. We follow a modular approach where each module is expanded iteratively. We compare the features of our architecture with the existing architectures proposed in the literature. Our architecture has provisions of energy and mobility management and it can be customized to design a system-on-chip (SoC).

Abbas, Ash Mohammad

2011-01-01T23:59:59.000Z

143

Joint Mexico-US Secretariat 2007-2009 www.icriforum.org ICRI Ad Hoc Committee on Economics Valuation of Coral Reef  

E-Print Network (OSTI)

(2) The Ad Hoc Committee will develop cost estimates and post them on the ICRI Forum for each of the following activities, building on the compilation of references and materials on economic valuation methodologies, manuals and examples of applications/case studies developed by the Committee based on a survey of ICRI members and other experts and now available through the ICRI Forum and at the WRI web site (www.wri.org/project/valuation-caribbean-reefs): a) Expand the current online compilation to include additional examples and case studies of applications of economic evaluation information to public policies and private sector actions. b) Develop an online searchable data base providing summaries of key economic valuation literature with emphasis on coral reefs, utilizing the expertise of UNEP-WCMC and the Coral Reef Economics Community of Practice (Coral CoP) among others, and taking into account the potential fields contained in the annex to these terms of reference. Such a database should integrate existing efforts and avoid duplication. c) Develop a web-based site to access additional literature and references on economic

unknown authors

2008-01-01T23:59:59.000Z

144

Runtime Reprioritization for Online Aggregation Queries.  

E-Print Network (OSTI)

??The need for interactive ad-hoc analytics has been steadily rising. The traditional batch processing of large data takes order of seconds to several minutes for… (more)

Tunga Gopinath, Karthik

2013-01-01T23:59:59.000Z

145

Query | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Query Query Query Query1.pdf Query More Documents & Publications DOE Retrospective Review Plan and Burden Reduction Report July 29, 2013 DOE Retrospective Review Plan and Burden...

146

Results of electric vehicle safety issues survey: Conducted on behalf of ad hoc EV battery readiness working group in-vehicle safety sub-working group  

DOE Green Energy (OSTI)

This report documents the results of a survey conducted in the winter of 1994-1995 by the In-Vehicle Safety Sub-Working Group, a working subunit of the DOE-sponsored ad hoc EV Battery Readiness Working Group. The survey was intended to determine the opinions of a group of industry experts regarding the relative importance of a list of some 39 potential safety concerns, grouped into 8 broad areas related to electric vehicles and their battery systems. Participation in the survey was solicited from the members of the Battery Readiness Working Group, along with members of the SAE EV Battery Safety Issues Task Force and selected other knowledgeable individuals. Results of the survey questionnaire were compiled anonymously from the 38 individuals who submitted responses. For each of the issues, survey respondents ranked them as having high, medium or low importance in each of three areas: the severity of events involving this concern, the probability that such events will occur, and the likelihood that mitigating action for such events may be needed beyond normal practices. The accumulated responses from this ranking activity are tabulated, and the response totals are also provided by several subgroupings of respondents. Additionally, large numbers of written comments were provided by respondents, and these are summarized with numbers of responses indicated. A preliminary statistical analysis of the tabulated results was performed but did not provide a satisfactory ranking of the concerns and has not been included in this report. A list is provided of the 15 concerns which a majority of the respondents indicated could be of both medium-to-high severity and medium-to-high probability of occurrence. This list will be reviewed by the Safety Sub-Working Group to determine the status of actions being taken by industry or government to mitigate these concerns, and the likelihood that additional research, standards development or regulation may be warranted to address them.

Hunt, G.L.

1996-06-01T23:59:59.000Z

147

Wireless Ad Hoc Networks Bibliography  

Science Conference Proceedings (OSTI)

... Digital Enhanced Cordless Telecommunications (DECT)," IEEE ... on Communications, vol. ... Capacity, Latency, and Power Consumption in Multihop ...

148

Wireless Ad Hoc Networks Bibliography  

Science Conference Proceedings (OSTI)

... and K. Takase, "Multiple Mobile Robot Navigation Using ... Intelligent Robots and Syst., pp. ... MW Subbarao, "Dynamic Power-Conscious Routing for ...

2009-02-03T23:59:59.000Z

149

A Framework for Moving Sensor Data Query and Retrieval of Dynamic Atmospheric Events  

E-Print Network (OSTI)

Abstract. One challenge in Earth science research is the accurate and efficient ad-hoc query and retrieval of Earth science satellite sensor data based on user-defined criteria to study and analyze atmospheric events such as tropical cyclones. The problem can be formulated as a spatiotemporal join query to identify the spatio-temporal location where moving sensor objects and dynamic atmospheric event objects intersect, either precisely or within a user-defined proximity. In this paper, we describe an efficient query and retrieval framework to handle the problem of identifying the spatio-temporal intersecting positions for satellite sensor data retrieval. We demonstrate the effectiveness of our proposed framework using sensor measurements from QuikSCAT (wind field measurement) and TRMM (precipitation vertical profile measurements) satellites, and the trajectories of the tropical cyclones occurring in the North Atlantic Ocean in 2009. Key words: data retrieval, satellite data, atmospheric events, spatiotemporal

Shen-shyang Ho; Wenqing Tang; W. Timothy Liu; Markus Schneider

2010-01-01T23:59:59.000Z

150

Accelerating Network Traffic Analytics Using Query-DrivenVisualization  

SciTech Connect

Realizing operational analytics solutions where large and complex data must be analyzed in a time-critical fashion entails integrating many different types of technology. This paper focuses on an interdisciplinary combination of scientific data management and visualization/analysis technologies targeted at reducing the time required for data filtering, querying, hypothesis testing and knowledge discovery in the domain of network connection data analysis. We show that use of compressed bitmap indexing can quickly answer queries in an interactive visual data analysis application, and compare its performance with two alternatives for serial and parallel filtering/querying on 2.5 billion records worth of network connection data collected over a period of 42 weeks. Our approach to visual network connection data exploration centers on two primary factors: interactive ad-hoc and multiresolution query formulation and execution over n dimensions and visual display of then-dimensional histogram results. This combination is applied in a case study to detect a distributed network scan and to then identify the set of remote hosts participating in the attack. Our approach is sufficiently general to be applied to a diverse set of data understanding problems as well as used in conjunction with a diverse set of analysis and visualization tools.

Bethel, E. Wes; Campbell, Scott; Dart, Eli; Stockinger, Kurt; Wu,Kesheng

2006-07-29T23:59:59.000Z

151

Generating query substitutions  

Science Conference Proceedings (OSTI)

We introduce the notion of query substitution, that is, generating a new query to replace a user's original search query. Our technique uses modifications based on typical substitutions web searchers make to their queries. In this way the new query is ... Keywords: paraphrasing, query rewriting, query substitution, sponsored search

Rosie Jones; Benjamin Rey; Omid Madani; Wiley Greiner

2006-05-01T23:59:59.000Z

152

Distributed XML Query Processing.  

E-Print Network (OSTI)

??While centralized query processing over collections of XML data stored at a single site is a well understood problem, centralized query evaluation techniques are inherently… (more)

Kling, Patrick

2012-01-01T23:59:59.000Z

153

DISTRIBUTED SENSOR PROCESSING OVER AN AD HOC ...  

Science Conference Proceedings (OSTI)

... ing mechanisms that consider the remaining battery life of a node? ... The Linked Cluster algorithm (LCA) [1] was used to self-organize the network ...

2009-02-03T23:59:59.000Z

154

On evacuation assisting vehicular ad hoc networks.  

E-Print Network (OSTI)

??Recent natural and man-made disasters such as Sandy (2012) and Fukushima nuclear power plant (2011) make efficient evacuation route planning and routing more important than… (more)

Pu, Cong

2013-01-01T23:59:59.000Z

155

Cooperative Caching in Ad Hoc Networks  

Science Conference Proceedings (OSTI)

Terminal's latency, connectivity, energy and memory are the main characteristics of today's mobile environments whose performance mayb e improved by caching. In this paper, we present an adaptive scheme for mobile Web data caching, which accounts for ...

Françoise Sailhan; Valérie Issarny

2003-01-01T23:59:59.000Z

156

Geomodification in query rewriting  

E-Print Network (OSTI)

Web searchers signal their geographic intent by using placenames in search queries. They also indicate their flexibility about geographic specificity by reformulating their queries. We conducted experiments on geomodification in query rewriting. We examine both deliberate query rewriting, conducted in user search sessions, and automated query rewriting, with users evaluating the relevance of geo-modified queries. We find geo-specification in 12.7 % of user query rewrites in search sessions, and show the breakdown into sub-classes such as same-city, same-state, same-country and different-country. We also measure the dependence between US-state-name and distance-of-modified-location-from-originallocation, finding that Vermont web searchers modify their locations greater distances than California web searchers. We also find that automatically-modified queries are perceived as much more relevant when the geographic component is unchanged.

Vivian Wei Zhang; Benjamin Rey; Rosie Jones

2006-01-01T23:59:59.000Z

157

Query Explorativeness for Integrated Search  

E-Print Network (OSTI)

We consider query systems which allow imprecise queries and define a new property called query explorativeness. This property characteri es the transf ormations perf ormed by a system in order to answer imprecise queries, i.e. the system's "work"f or mapping input queries into more precise target queries.

In Heterogeneous Data; Ra Domenig; Klaus R. Dittrich

2002-01-01T23:59:59.000Z

158

Efficient query expansion.  

E-Print Network (OSTI)

??Hundreds of millions of users each day search the web and other repositories to meet their information needs. However, queries can fail to find documents… (more)

Billerbeck, B

2005-01-01T23:59:59.000Z

159

Queries, Data, and Statistics: Pick Two.  

E-Print Network (OSTI)

??The query processor of a relational database system executes declarative queries on relational data using query evaluation plans. The cost of the query evaluation plan… (more)

Mishra, Chaitanya

2010-01-01T23:59:59.000Z

160

Multi-aspect query summarization by composite query  

Science Conference Proceedings (OSTI)

Conventional search engines usually return a ranked list of web pages in response to a query. Users have to visit several pages to locate the relevant parts. A promising future search scenario should involve: (1) understanding user intents; (2) providing ... Keywords: composite query, mixture model, query aspect, query summarization

Wei Song; Qing Yu; Zhiheng Xu; Ting Liu; Sheng Li; Ji-Rong Wen

2012-08-01T23:59:59.000Z

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


161

Complex Queries | Open Energy Information  

Open Energy Info (EERE)

Complex Queries Complex Queries < User:Jweers Jump to: navigation, search Contents 1 Using Nested Queries 1.1 Programs 2 Using Inverse Property Ask Query 3 Using Wildcards Plus Array Print with Count 3.1 States start with A (4) Using Nested Queries Complex Help:Inline queries are queries which involve multiple subjects, properties, or nested queries. The following is an example of a nested query which will return only Programs (Category:Programs) in the Energy Sector (Property:ProgramSector = Energy) within the subsector of Wind (Property:Sector = Wind) which have been developed by National Labs (Category:United States Department of Energy National Laboratories). The last piece mentioned is where the nested query comes into play. To find Programs which have been developed by National Labs, we must search the

162

A CANONICAL MEASURE OF MOBILITY FOR MOBILE AD ...  

Science Conference Proceedings (OSTI)

... [8] Xiaoyan Hong, Mario Gerla, Guangyu Pei, and Ching-Chuan Chi- ang, “A group mobility model for ad hoc wireless networks,” in Proceedings of ...

2009-02-03T23:59:59.000Z

163

QueryLines: approximate query for visual browsing  

E-Print Network (OSTI)

We introduce approximate query techniques for searching and analyzing two-dimensional data sets such as line or scatter plots. Our techniques allow users to explore a dataset by defining QueryLines: soft constraints and preferences for selecting and sorting a subset of the data. By using both preferences and soft constraints for query composition, we allow greater flexibility and expressiveness than previous visual query systems. When the user over-constrains a query, for example, a system using approximate techniques can display ¨near misses¨to enable users to quickly and continuously refine queries.

Kathy Ryall; Neal Lesh; Hiroaki Miyashita; Shigeru Makino; Tom Lanning; Tom Lanning; Darren Leigh; Darren Leigh

2005-01-01T23:59:59.000Z

164

Group Nearest Neighbor Queries  

Science Conference Proceedings (OSTI)

Given two sets of points P and Q, a group nearest neighbor(GNN) query retrieves the point(s) of P with the smallestsum of distances to all points in Q. Consider, for instance,three users at locations q1, q2 and q3 that want to find a meeting point (e.g., ...

Dimitris Papadias; Qiongmao Shen; Yufei Tao; Kyriakos Mouratidis

2004-03-01T23:59:59.000Z

165

QueryScope: visualizing queries for repeatable database tuning  

Science Conference Proceedings (OSTI)

Reading and perceiving complex SQL queries has been a time consuming task in traditional database applications for decades. When it comes to decision support systems with automatically generated and sometimes highly nested SQL queries, human understanding ...

Ling Hu; Kenneth A. Ross; Yuan-Chi Chang; Christian A. Lang; Donghui Zhang

2008-08-01T23:59:59.000Z

166

Mixed mode XML query processing  

Science Conference Proceedings (OSTI)

Querying XML documents typically involves both tree-based navigation and pattern matching similar to that used in structured information retrieval domains. In this paper, we show that for good performance, a native XML query processing system should ...

Alan Halverson; Josef Burger; Leonidas Galanis; Ameet Kini; Rajasekar Krishnamurthy; Ajith Nagaraja Rao; Feng Tian; Stratis D. Viglas; Yuan Wang; Jeffrey F. Naughton; David J. DeWitt

2003-09-01T23:59:59.000Z

167

EIA 176 Query System, 2003  

Annual Energy Outlook 2012 (EIA)

3 EIA Home > Natural Gas > Natural Gas Data Publications EIA 176 Query System 2003 The EIA-176 Query System is a Windows-based system which runs under Windows operating systems 95,...

168

EIA 176 Query System, 2001  

Gasoline and Diesel Fuel Update (EIA)

1 EIA Home > Natural Gas > Natural Gas Data Publications EIA 176 Query System 2001 The EIA-176 Query system is a Windows-based system which runs under Windows operating systems 95,...

169

EIA 176 Query System, 2004  

Gasoline and Diesel Fuel Update (EIA)

4 EIA Home > Natural Gas > Natural Gas Data Publications EIA 176 Query System 2004 The EIA-176 Query System is a Windows-based system which runs under Windows operating systems 95,...

170

EIA 176 Query System, 2002  

Gasoline and Diesel Fuel Update (EIA)

2 EIA Home > Natural Gas > Natural Gas Data Publications EIA 176 Query System 2002 EIA 176 Query System 2002 Release date: February 2, 2004 Next release date: February 2005 The...

171

Auditing Categorical SUM, MAX and MIN Queries  

Science Conference Proceedings (OSTI)

Auditing consists in logging answered queries and checking, each time that a new query is submitted, that no sensitive information is disclosed by combining responses to answered queries with the response to the current query. Such a method for controlling ... Keywords: Aggregate function, max-query, min-query, null values, sum-query

Francesco M. Malvestuto

2008-09-01T23:59:59.000Z

172

Query clustering using user logs  

Science Conference Proceedings (OSTI)

Query clustering is a process used to discover frequently asked questions or most popular topics on a search engine. This process is crucial for search engines based on question-answering. Because of the short lengths of queries, approaches based on ... Keywords: Query clustering, search engine, user log, web data mining

2002-01-01T23:59:59.000Z

173

A Semantic Graph Query Language  

Science Conference Proceedings (OSTI)

Semantic graphs can be used to organize large amounts of information from a number of sources into one unified structure. A semantic query language provides a foundation for extracting information from the semantic graph. The graph query language described here provides a simple, powerful method for querying semantic graphs.

Kaplan, I L

2006-10-16T23:59:59.000Z

174

compound queries | OpenEI Community  

Open Energy Info (EERE)

- 15:22 Multicolor Maps from Compound Queries ask queries compound queries developer Google maps maps multicolor result formats results Semantic Mediawiki Hi all, Recently, a...

175

ask queries | OpenEI Community  

Open Energy Info (EERE)

- 15:22 Multicolor Maps from Compound Queries ask queries compound queries developer Google maps maps multicolor result formats results Semantic Mediawiki Hi all, Recently, a...

176

Evaluating verbose query processing techniques  

E-Print Network (OSTI)

Verbose or long queries are a small but significant part of the query stream in web search, and are common in other applications such as collaborative question answering (CQA). Current search engines perform well with keyword queries but are not, in general, effective for verbose queries. In this paper, we examine query processing techniques which can be applied to verbose queries prior to submission to a search engine in order to improve the search engine’s results. We focus on verbose queries that have sentence-like structure, but are not simple “wh- ” questions, and assume the search engine is a “black box. ” We evaluated the output of two search engines using queries from a CQA service and our results show that, among a broad range of techniques, the most effective approach is to simply reduce the length of the query. This can be achieved effectively by removing “stop structure ” instead of only stop words. We show that the process of learning and removing stop structure from a query can be effectively automated.

Samuel Huston; W. Bruce Croft

2010-01-01T23:59:59.000Z

177

Semantic optimization techniques for preference queries  

Science Conference Proceedings (OSTI)

Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). Such queries are parameterized by specific preference relations. Semantic optimization techniques ... Keywords: Integrity constraints, Preference queries, Query evaluation, Query optimization

Jan Chomicki

2007-07-01T23:59:59.000Z

178

Analyzing linguistic structure of web search queries  

Science Conference Proceedings (OSTI)

It is believed that Web search queries are becoming more structurally complex over time. However, there has been no systematic study that quantifies such characteristics. In this thesis, we propose that queries are evolving into a unique linguistic system. ... Keywords: query intent, query segmentation, query structure, query understanding, word co-occurrence networks

Rishiraj Saha Roy

2013-05-01T23:59:59.000Z

179

EIA 176 Query System, 2004  

Gasoline and Diesel Fuel Update (EIA)

4 4 EIA Home > Natural Gas > Natural Gas Data Publications EIA 176 Query System 2004 The EIA-176 Query System is a Windows-based system which runs under Windows operating systems 95, 98, 2000, NT - 4.0 Service Pack 3 or later. It provides a method of extracting and using the company level data filed on the Form EIA-176, and saving the query results in various media and formats. There are pre-selected data queries, which allow the user to select and run the most often-used queries, as well as the ability to create a customized query. Self-extracting executable files with run-time versions of Access are required to set up the system. You may also download the data tables if you already have Microsoft Access on your computer. For instructions, please refer to the documentation listed below.

180

EIA 176 Query System, 2001  

Gasoline and Diesel Fuel Update (EIA)

1 1 EIA Home > Natural Gas > Natural Gas Data Publications EIA 176 Query System 2001 The EIA-176 Query system is a Windows-based system which runs under Windows operating systems 95, 98, 2000, NT - 4.0 Service Pack 3 or later. It provides a method of extracting and using the company level data filed on the Form EIA-176, and saving the query results in various media and formats. There are pre-selected data queries, which allow the user to select and run the most often-used queries, as well as the ability to create a customized query. Self-extracting executable files with run-time versions of Access are required to set up the system. You may also download the data tables if you already have Microsoft Access on your computer. For instructions, please read the documentation file(s) listed below

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


181

EIA 176 Query System, 2003  

Gasoline and Diesel Fuel Update (EIA)

3 3 EIA Home > Natural Gas > Natural Gas Data Publications EIA 176 Query System 2003 The EIA-176 Query System is a Windows-based system which runs under Windows operating systems 95, 98, 2000, NT - 4.0 Service Pack 3 or later. It provides a method of extracting and using the company level data filed on the Form EIA-176, and saving the query results in various media and formats. There are pre-selected data queries, which allow the user to select and run the most often-used queries, as well as the ability to create a customized query. Self-extracting executable files with run-time versions of Access are required to set up the system. You may also download the data tables if you already have Microsoft Access on your computer. For instructions, please refer to the documentation read the documentation file(s) listed below.

182

Structured Queries for Legal Search  

Science Conference Proceedings (OSTI)

... Track. It takes the keywords in RequestText to form a bag-of-words query using the “#combine” operator in In- dri. Common ...

2008-02-05T23:59:59.000Z

183

CQ - Code selection through query.  

E-Print Network (OSTI)

??This thesis proposes a query language for code selection. It is designed to work on virtual machine based languages and is intended to be used… (more)

ZENZARO, SIMONE

2010-01-01T23:59:59.000Z

184

Query Expansion for Microblog Retrieval  

Science Conference Proceedings (OSTI)

... Specifically, we used the Google Search API (GSA) to retrieve pages from the Web, and used the titles to expand queries. ...

2012-02-03T23:59:59.000Z

185

Exploiting underrepresented query aspects for automatic query expansion  

Science Conference Proceedings (OSTI)

Users attempt to express their search goals through web search queries. When a search goal has multiple components or aspects, documents that represent all the aspects are likely to be more relevant than those that only represent some aspects. Current ... Keywords: aspect coverage, global document analysis, query expansion, web search

Daniel Wayne Crabtree; Peter Andreae; Xiaoying Gao

2007-08-01T23:59:59.000Z

186

Preference formulas in relational queries  

Science Conference Proceedings (OSTI)

The handling of user preferences is becoming an increasingly important issue in present-day information systems. Among others, preferences are used for information filtering and extraction to reduce the volume of data presented to the user. They ... Keywords: Preference queries, preferences, query optimization, relational algebra

Jan Chomicki

2003-12-01T23:59:59.000Z

187

Context-sensitive query auto-completion  

Science Conference Proceedings (OSTI)

Query auto completion is known to provide poor predictions of the user's query when her input prefix is very short (e.g., one or two characters). In this paper we show that context, such as the user's recent queries, can be used to improve the prediction ... Keywords: context-awareness, query auto-completion, query expansion

Ziv Bar-Yossef; Naama Kraus

2011-03-01T23:59:59.000Z

188

Depth estimation for ranking query optimization  

Science Conference Proceedings (OSTI)

A relational ranking query uses a scoring function to limit the results of a conventional query to a small number of the most relevant answers. The increasing popularity of this query paradigm has led to the introduction of specialized rank join operators ... Keywords: DEEP, Data statistics, Depth estimation, Query optimization, Relational ranking query, Top-k

Karl Schnaitter; Joshua Spiegel; Neoklis Polyzotis

2009-04-01T23:59:59.000Z

189

Bipolar queries: An aggregation operator focused perspective  

Science Conference Proceedings (OSTI)

The concept of a bipolar query, meant as a database query that involves both negative and positive conditions, is discussed from the point of view of flexible database querying and modeling of more sophisticated intentions and preferences of the user. ... Keywords: Aggregation operators, Bipolar queries, Flexible queries, Fuzzy logic, Logical connectives modeling

S?awomir Zadro?ny; Janusz Kacprzyk

2012-06-01T23:59:59.000Z

190

Ontology-based automatic query refinement  

Science Conference Proceedings (OSTI)

The effectiveness of user query plays a vital role in retrieving highly relevant documents in keyword-based search engine. Because of the lack of domain knowledge, users tend to post very short queries, which do not express their information need ... Keywords: automatic query refinement, document retrieval, information retrieval, keywords, ontology, query expansion, retrieval relevancy, search engines, semantic search, user queries

S. Sendhilkumar; G. S. Mahalakshmi; S. N. Rajasekar

2009-07-01T23:59:59.000Z

191

EIA 176 Query System, 2002  

Gasoline and Diesel Fuel Update (EIA)

2 2 EIA Home > Natural Gas > Natural Gas Data Publications EIA 176 Query System 2002 EIA 176 Query System 2002 Release date: February 2, 2004 Next release date: February 2005 The EIA-176 Query system is a Windows-based system which runs under Windows operating systems 95, 98, 2000, NT - 4.0 Service Pack 3 or later. It provides a method of extracting and using the company level data filed on the Form EIA-176, and saving the query results in various media and formats. There are pre-selected data queries, which allow the user to select and run the most often-used queries, as well as the ability to create a customized query. Self-extracting executable files with run-time versions of Access are required to set up the system. You may also download the data tables if you already have Microsoft Access on your computer. For instructions, please read the documentation file(s) listed below.

192

Complex spatio-temporal pattern queries  

Science Conference Proceedings (OSTI)

This paper introduces a novel type of query, what we name Spatio-temporal Pattern Queries (STP). Such a query specifies a spatiotemporal pattern as a sequence of distinct spatial predicates where the predicate temporal ordering (exact or relative) ...

Marios Hadjieleftheriou; George Kollios; Petko Bakalov; Vassilis J. Tsotras

2005-08-01T23:59:59.000Z

193

EIA 176 Query System, 2000  

U.S. Energy Information Administration (EIA)

The EIA-176 Query system is a Windows-based system which runs under Windows operating systems 95, 98, 2000, NT - 4.0 Service Pack 3 or later.

194

EIA 176 Query System, 2004  

U.S. Energy Information Administration (EIA)

The EIA-176 Query System is a Windows-based system which runs under Windows operating systems 95, 98, 2000, NT - 4.0 Service Pack 3 or later. It provides a method of ...

195

EIA-176 Query System 2005  

U.S. Energy Information Administration (EIA)

Release Date: November 22, 2006 The EIA-176 Query System is a Windows-based system which runs under Windows operating systems 95, 98, 2000, NT - 4.0 Service Pack 3 or ...

196

Adaptively parallelizing distributed range queries  

Science Conference Proceedings (OSTI)

We consider the problem of how to best parallelize range queries in a massive scale distributed database. In traditional systems the focus has been on maximizing parallelism, for example by laying out data to achieve the highest throughput. However, ...

Ymir Vigfusson; Adam Silberstein; Brian F. Cooper; Rodrigo Fonseca

2009-08-01T23:59:59.000Z

197

Usability of XML Query Languages.  

E-Print Network (OSTI)

??The eXtensible Markup Language (XML) is a markup language which enables re-use of information. Specific query languages for XML are developed to facilitate this. There… (more)

Graaumans, Joris Petrus Maria

2005-01-01T23:59:59.000Z

198

SPARQL Query Form | OpenEI  

Open Energy Info (EERE)

624878 Varnish cache server SPARQL Query Form Default Graph URI Query text select distinct ?Concept where a ?Concept LIMIT 100 Display Results As: Auto HTML Spreadsheet XML...

199

Frequent Itemset Mining for Query Expansion in Microblog Ad ...  

Science Conference Proceedings (OSTI)

... paralysis, obesity, heart, epidemic*, #obesity, @n1hc, specialists, proportions, willpower, #heart MB053 superclasico, rcl, #condo, river*, riverboat ...

2013-02-12T23:59:59.000Z

200

Multi-query SQL progress indicators  

E-Print Network (OSTI)

Abstract. Recently, progress indicators have been proposed for SQL queries in RDBMSs. All previously proposed progress indicators consider each query in isolation, ignoring the impact simultaneously running queries have on each other’s performance. In this paper, we explore a multi-query progress indicator, which explicitly considers concurrently running queries and even queries predicted to arrive in the future when producing its estimates. We demonstrate that multi-query progress indicators can provide more accurate estimates than single-query progress indicators. Moreover, we extend the use of progress indicators beyond being a GUI tool and show how to apply multi-query progress indicators to workload management. We report on an initial implementation of a multi-query progress indicator in PostgreSQL and experiments with its use both for estimating remaining query execution time and for workload management. 1

Gang Luo; Jeffrey F. Naughton; Philip S. Yu

2006-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


201

PROBER: Ad-Hoc Debugging of Extraction and Integration Pipelines  

E-Print Network (OSTI)

Complex information extraction (IE) pipelines assembled by plumbing together off-the-shelf operators, specially customized operators, and operators re-used from other text processing pipelines are becoming an integral component of most text processing frameworks. A critical task faced by the IE pipeline user is to run a post-mortem analysis on the output. Due to the diverse nature of extraction operators (often implemented by independent groups), it is time consuming and error-prone to describe operator semantics formally or operationally to a provenance system. We introduce the first system that helps IE users analyze pipeline semantics and infer provenance interactively while debugging. This allows the effort to be proportional to the need, and to focus on the portions of the pipeline under the greatest suspicion. We present a generic debugger for running post-execution analysis of any IE pipeline consisting of arbitrary types of operators. We propose an effective provenance model for IE pipelines which cap...

Sarma, Anish Das; Bohannon, Philip

2010-01-01T23:59:59.000Z

202

Robust control in sparse mobile ad-hoc networks  

Science Conference Proceedings (OSTI)

We consider a two-hop routing delay-tolerant network. When the source encounters a mobile then it transmits, with some probability, a file to that mobile, with the probability itself being a decision variable. The number of mobiles is not fixed, with ...

Eitan Altman; Alireza Aram; Tamer Ba?ar; Corinne Touati; Saswati Sarkar

2010-11-01T23:59:59.000Z

203

A Dynamic Probabilistic Route Discovery for Mobile Ad Hoc Networks  

E-Print Network (OSTI)

Abdulai,J. Ould-Khaoua,M. Mackenzie,L.M. Mohammed,A. International Journal of Communication Networks and Distributed Systems, Volume 4(1) pp 108 - 130

Abdulai, J.

204

Handling asymmetry in power heterogeneous ad hoc networks  

E-Print Network (OSTI)

802.11 [1]) to indicate a TTL value for the BW RES frames.In our experiments we use TTL=2; the choice for this valueselection of value 2 for the TTL of BW RES frames. At the

Shah, Vasudev; Gelal, Ece; Krishnamurthy, Srikanth V.

2007-01-01T23:59:59.000Z

205

A lightweight content replication scheme for mobile ad hoc environments  

E-Print Network (OSTI)

is based on a Time-To-Live (TTL) search. In our scheme, theincluded in the packet. The TTL value of the probe packet isin the current set, i.e. , TTL = max (hi), where hi e S. To

Thanedar, V; Almeroth, K C; Belding-Royer, E M

2004-01-01T23:59:59.000Z

206

Presentation to the EAC - Workforce Ad Hoc Committee Panel Discussion...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

growing via electrification to serve an emerging digital economy * Infrastructure is aging * Retirements are increasing while less experienced, culturally divergent workers, are...

207

Carbon nanotube-based nanoscale ad hoc networks  

Science Conference Proceedings (OSTI)

Recent developments in nanoscale electronics allow current wireless technologies to function in nanoscale environments. Especially due to their incredible electrical and electromagnetic properties, carbon nanotubes are promising physical phenomenon that ...

Baris Atakan; Ozgur B. Akan

2010-06-01T23:59:59.000Z

208

NIST Debuts New Approach to Ad Hoc Networks for First ...  

Science Conference Proceedings (OSTI)

... “The communication range in a commercial building corridor is vastly different from that of a factory floor, which is unlike a coal mine.”. ...

2011-05-02T23:59:59.000Z

209

Proximity-based service discovery in mobile ad hoc networks  

Science Conference Proceedings (OSTI)

Existing approaches to service discovery have been developed primarily for environments with a fixed network backbone and typically rely on centralized components being accessible to potential service clients at any given time. The characteristic lack ...

René Meier; Vinny Cahill; Andronikos Nedos; Siobhán Clarke

2005-06-01T23:59:59.000Z

210

Data Replication in Cooperative Mobile Ad-Hoc Networks  

Science Conference Proceedings (OSTI)

The mobile computing environment provides many benefits such as ubiquitous access to computing but includes constraints on resources such as available bandwidth and battery life. Replication is a widely recognized method for balancing the demands of ... Keywords: MANET, game-theory, mobile, replication

Dan Hirsch; Sanjay Madria

2013-04-01T23:59:59.000Z

211

Clusters, language models, and ad hoc information retrieval  

Science Conference Proceedings (OSTI)

The language-modeling approach to information retrieval provides an effective statistical framework for tackling various problems and often achieves impressive empirical performance. However, most previous work on language models for information retrieval ... Keywords: Language modeling, aspect models, cluster hypothesis, cluster-based language models, clustering, interpolation model, smoothing

Oren Kurland; Lillian Lee

2009-05-01T23:59:59.000Z

212

Combining exploration and ad-hoc networking in robocup rescue  

Science Conference Proceedings (OSTI)

In challenging environments where the risk of loss of a robot is high, robot teams are a natural choice. In many applications like for example rescue missions there are two crucial tasks for the robots. First, they have to efficiently and exhaustively ...

Martijn N. Rooker; Andreas Birk

2005-01-01T23:59:59.000Z

213

Secure Routing and Intrusion Detection in Ad Hoc Networks  

Science Conference Proceedings (OSTI)

... The loss or capture of unattended sensors and personal computing devices ... Traffic monitoring in wired networks is usually per- formed at switches ...

2007-09-19T23:59:59.000Z

214

Topic Based Language Models for Ad Hoc Information Retrieval  

E-Print Network (OSTI)

Azzopardi,L. Girolami,M. van Rijsbergen,C.J. Proceedings of the International Joint Conference in Neural Networks (IJCNN 2004)

Azzopardi, L.

215

FAIR: Fee Arbitrated Incentive Architecture in Wireless Ad Hoc Networks  

E-Print Network (OSTI)

the average price in the estimation table for all destinations. It periodically calculates the trend mechanisms to configure itself to the changing demands of the nodes, users, and network conditions. Price, leading to potentially selfish behavior. In fact, given that node's resources (energy, processor

Li, Baochun

216

Language support for processing distributed ad hoc data  

Science Conference Proceedings (OSTI)

This paper presents the design, theory and implementation of Gloves, a domain-specific language that allows users to specify the provenance (the derivation history starting from the origins), syntax and semantic properties of collections of distributed ... Keywords: declarative language, distributed data sources

Kenny Q. Zhu; Daniel S. Dantas; Kathleen Fisher; Limin Jia; Yitzhak Mandelbaum; Vivek Pai; David Walker

2009-09-01T23:59:59.000Z

217

Test Topics: TREC 2008 Legal Track, Ad Hoc Task  

Science Conference Proceedings (OSTI)

... Kong OR Japan OR Taiwan OR India OR Philippines OR Cambodia OR Vietnam OR North Korea OR South Korea OR Thailand) AND (Goods AND ...

2009-02-10T23:59:59.000Z

218

Making link-state routing scale for ad hoc networks  

Science Conference Proceedings (OSTI)

In this paper, we introduce a class of approaches that attempt to scale link-state routing by limiting the scope of link state update dissemination in space and over time. We present the first fundamental analysis of this generic class, which we call ...

César A. Santiváñez; Ram Ramanathan; Ioannis Stavrakakis

2001-10-01T23:59:59.000Z

219

Architectural framework for wireless mobile ad hoc networks (AF WMANETs)  

Science Conference Proceedings (OSTI)

WMANETs are more popular and successful in the marketplace of the future wireless technology as indicated by the increasing usage of Bluetooth and Wireless Local Area Networks (WLANs). To aid the application of WMANETs in any wireless environment, when ... Keywords: Computational viewpoint, Enterprise viewpoint, Information viewpoint, RM-ODP, Security, TINA, WMANETs

I. Almomani; M. Al-Akaidi; P. Reynolds; J. Ivins

2006-12-01T23:59:59.000Z

220

Final report of the Ad Hoc Experts Group on Fusion  

SciTech Connect

The objectives and strategy of the fusion program are reviewed. In particular, tokamaks, mirrors, alternate concepts, plasma physics, and inertial confinement options are reviewed. (MOW)

1978-06-01T23:59:59.000Z

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


221

Adaptive Scheduling in Ad Hoc and Cellular Wireless Networks  

E-Print Network (OSTI)

Under unicast operations in wireless cellular networks, wetransmission operations in cellular wireless networks. Underoperation for failovers under heterogeneous traffic loading conditions in wireless

Tan, Choo Chin

2013-01-01T23:59:59.000Z

222

On implementing provenance-aware regular path queries with relational query engines  

Science Conference Proceedings (OSTI)

Use of graphs is growing rapidly in social networks, semantic web, biological databases, scientific workflow provenance, and other areas. Regular Path Queries (RPQs) can be seen as a core graph query language to answer pattern-based reachability queries. ... Keywords: datalog, graph querying, regular path queries

Saumen Dey; Víctor Cuevas-Vicenttín; Sven Köhler; Eric Gribkoff; Michael Wang; Bertram Ludäscher

2013-03-01T23:59:59.000Z

223

Optimal query/update tradeoffs in versioned dictionaries  

E-Print Network (OSTI)

External-memory dictionaries are a fundamental data structure in file systems and databases. Versioned (or fully-persistent) dictionaries have an associated version tree where queries can be performed at any version, updates can be performed on leaf versions, and any version can be `cloned' by adding a child. Various query/update tradeoffs are known for unversioned dictionaries, many of them with matching upper and lower bounds. No fully-versioned external-memory dictionaries are known with optimal space/query/update tradeoffs. In particular, no versioned constructions are known that offer updates in $o(1)$ I/Os using O(N) space. We present the first cache-oblivious and cache-aware constructions that achieve a wide range of optimal points on this tradeoff.

Byde, Andrew

2011-01-01T23:59:59.000Z

224

SEMISTRUCTURED PROBABILISTIC OBJECT QUERY LANGUAGE (A Query Language for Semistructured Probabilistic Data).  

E-Print Network (OSTI)

??This work presents SPOQL, a structured query language for Semistructured Probabilistic Object (SPO) model [4]. The original query language for semistructured probabilistic database management system… (more)

Gutti, Praveen

2007-01-01T23:59:59.000Z

225

A system for semantic query optimization  

Science Conference Proceedings (OSTI)

This paper describes a scheme to utilize semantic integrity constraints in optimizing a user specified query. The scheme uses a graph theoretic approach to identify redundant join clauses and redundant restriction clauses specified in a user query. An ...

Sreekumar T. Shenoy; Z. Meral Ozsoyoglu

1987-12-01T23:59:59.000Z

226

Query expansion techniques for question answering  

E-Print Network (OSTI)

Query expansion is a technique used to boost performance of a document retrieval engine, such as those commonly found in question answering (QA) systems. Common methods of query expansion for Boolean keyword-based document ...

Bilotti, Matthew W. (Matthew William), 1981-

2004-01-01T23:59:59.000Z

227

Query  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Queryl Queryl Detailees Name From To Proposed Start Date Proposed End Date Office of the Director of Alex, Aileen DOE/CFO National Intelligence 5/27/2007 5/27/2009 Federal Railroad Alexander, Alice Administration DOE/CFO 7/1/2007 1/1/2008 Arnaudo, Raymond Dept of State DOE/NNSA Moscow Office 3/5/2006 3/3/2008 Cambridge Energy Research Ashley, Peter DOE/PI Associates (CERA) 1/4/2009 3/27/2009 Executive Office of the Barringer, Jody DOE/EE President/OMB 11/16/2008 3/14/2009 Benigni, Deborah Dept of State DOE/IN 4/30/2007 4/30/2009 Federal Bureau of Borgia, Stanley Investigation DOE/IN 6/12/2006 6/12/2008 Federal Bureau of Borgia, Stanley Investigation DOE/IN 6/12/2008 6/12/2009 Department of State/US Brosnahan, Kevin DOE/EE Embassy of Paris 12/1/2007 5/1/2008 Office of the Director of

228

Quantum query complexity for qutrits  

Science Conference Proceedings (OSTI)

We compute lower bounds for the exact quantum query complexity of a ternary function f. The lower bound is of order O(log{sub 3}(n)). In case f is symmetric on a sphere then the lower bound is of order O({radical}(n)). This work is a natural continuation of the work of Beals, Buhrman, Cleve, Mosca, and de Wolf on lower limits for binary functions.

Tamir, Boaz [Department of HPS, Bar Ilan University, Ramat Gan (Israel)

2008-02-15T23:59:59.000Z

229

Example Queries | Open Energy Information  

Open Energy Info (EERE)

Example Queries Example Queries Jump to: navigation, search Example Queries SEP Funding SEP Funding Alabama 55,570,000 Alaska 28,232,000 Arizona 55,447,000 Arkansas 39,416,000 California 226,093,000 Colorado 49,222,000 Connecticut 38,542,000 Delaware 24,231,000 Florida 126,089,000 Georgia 82,495,000 Hawaii 25,930,000 Idaho 28,572,000 Illinois 101,321,000 Indiana 68,621,000 Iowa 40,546,000 Kansas 38,284,000 Kentucky 52,533,000 Louisiana 71,694,000 Maine 27,305,000 Maryland 51,772,000 Massachusetts 54,911,000 Michigan 82,035,000 Minnesota 54,172,000 Mississippi 40,418,000 Missouri 57,393,000 Montana 25,855,000 Nebraska 30,910,000 Nevada 34,714,000 New Hampshire 25,827,000 New Jersey 73,643,000 New Mexico 31,821,000 New York 123,110,000 North Carolina 75,989,000 North Dakota 24,585,000

230

Answering XML queries using materialized views revisited  

Science Conference Proceedings (OSTI)

Answering queries using views is a well-established technique in databases. In this context, two outstanding problems can be formulated. The first one consists in deciding whether a query can be answered exclusively using one or multiple materialized ... Keywords: XML, materialized views, xpath query evaluation

Xiaoying Wu; Dimitri Theodoratos; Wendy Hui Wang

2009-11-01T23:59:59.000Z

231

Schemes of storing XML query cache  

Science Conference Proceedings (OSTI)

XML query caching for XML database-backed Web applications began to be investigated recently. However, the issue of how the cached query results are stored has not been addressed despite its practical significance. In this paper, we deal with ... Keywords: DOM, PDOM, XML query cache, XML update, incremental cache refresh

Hyunchul Kang; Seungchul Han; Younghyun Kim

2005-01-01T23:59:59.000Z

232

Depth estimation for ranking query optimization  

Science Conference Proceedings (OSTI)

A relational ranking query uses a scoring function to limit the results of a conventional query to a small number of the most relevant answers. The increasing popularity of this query paradigm has led to the introduction of specialized rank join operators ...

Karl Schnaitter; Joshua Spiegel; Neoklis Polyzotis

2007-09-01T23:59:59.000Z

233

MIL primitives for querying a fragmented world  

Science Conference Proceedings (OSTI)

In query-intensive database application areas, like decision support and data mining, systems that use vertical fragmentation have a significant performance advantage. In order to support relational or object oriented applications on top of such a fragmented ... Keywords: Database systems, Main-memory techniques, Query languages, Query optimization, Vertical fragmentation

Peter A. Boncz; Martin L. Kersten

1999-10-01T23:59:59.000Z

234

Efficiently approximating query optimizer plan diagrams  

Science Conference Proceedings (OSTI)

Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the optimizer over the query parameter space. These diagrams have proved to ...

Atreyee Dey; Sourjya Bhaumik; Harish D; Jayant R. Haritsa

2008-08-01T23:59:59.000Z

235

Query weighting for ranking model adaptation  

Science Conference Proceedings (OSTI)

We propose to directly measure the importance of queries in the source domain to the target domain where no rank labels of documents are available, which is referred to as query weighting. Query weighting is a key step in ranking model adaptation. As ...

Peng Cai; Wei Gao; Aoying Zhou; Kam-Fai Wong

2011-06-01T23:59:59.000Z

236

Category:Query Results Templates | Open Energy Information  

Open Energy Info (EERE)

Query Results Templates Jump to: navigation, search This is the Query Results Templates category. Pages in category "Query Results Templates" The following 4 pages are in this...

237

Structured Query Language for Virtual Observatory  

E-Print Network (OSTI)

Currently two query languages are defined as standards for the Virtual Observatory (VO). Astronomical Data Query Language (ADQL) is used for catalog data query and Simple Image Access Protocol (SIAP) is for image data query. As a result, when we query each data service, we need to know in advance which language is supported and then construct a query language accordingly. The construct of SIAP is simple, but they have a limited capability. For example, there is no way to specify multiple regions in one query, and it is difficult to specify complex query conditions. In this paper, we propose a unified query language for any kind of astronomical database on the basis of SQL99. SQL is a query language optimized for a table data, so to apply the SQL to the image and spectrum data set, the data structure need to be mapped to a table like structure. We present specification of this query language and an example of the architecture for the database system.

Yuji Shirasaki; Masatoshi Ohishi; Yoshihiko Mizumoto; Masahiro Tanaka; Satoshi Honda; Masafumi Oe; Naoki Yasuda; Yoshifumi Masunaga

2004-11-19T23:59:59.000Z

238

Context-Sensitive Query Auto-Completion ?  

E-Print Network (OSTI)

Query auto completion is known to provide poor predictions of the user’s query when her input prefix is very short (e.g., one or two characters). In this paper we show that context, such as the user’s recent queries, can be used to improve the prediction quality considerably even for such short prefixes. We propose a context-sensitive query auto completion algorithm, NearestCompletion, which outputs the completions of the user’s input that are most similar to the context queries. To measure similarity, we represent queries and contexts as high-dimensional term-weighted vectors and resort to cosine similarity. The mapping from queries to vectors is done through a new query expansion technique that we introduce, which expands a query by traversing the query recommendation tree rooted at the query. In order to evaluate our approach, we performed extensive experimentation over the public AOL query log. We demonstrate that when the recent user’s queries are relevant to the current query she is typing, then after typing a single character, NearestCompletion’s MRR is 48 % higher relative to the MRR of the standard MostPopularCompletion algorithm on average. When the context is irrelevant, however, NearestCompletion’s MRR is essentially zero. To mitigate this problem, we propose HybridCompletion, which is a hybrid of NearestCompletion with MostPopularCompletion. HybridCompletion is shown to dominate both NearestCompletion and MostPopularCompletion, achieving a total improvement of 31.5 % in MRR relative to MostPopular-Completion on average.

Ziv Bar-yossef; Naama Kraus

2011-01-01T23:59:59.000Z

239

Design of FastQuery: How to Generalize Indexing and Querying System for Scientific Data  

Science Conference Proceedings (OSTI)

Modern scientific datasets present numerous data management and analysis challenges. State-of-the-art index and query technologies such as FastBit are critical for facilitating interactive exploration of large datasets. These technologies rely on adding auxiliary information to existing datasets to accelerate query processing. To use these indices, we need to match the relational data model used by the indexing systems with the array data model used by most scientific data, and to provide an efficient input and output layer for reading and writing the indices. In this work, we present a flexible design that can be easily applied to most scientific data formats. We demonstrate this flexibility by applying it to two of the most commonly used scientific data formats, HDF5 and NetCDF. We present two case studies using simulation data from the particle accelerator and climate simulation communities. To demonstrate the effectiveness of the new design, we also present a detailed performance study using both synthetic and real scientific workloads.

Wu, Jerry; Wu, Kesheng

2011-04-18T23:59:59.000Z

240

Improving query performance in virtual data warehouses  

Science Conference Proceedings (OSTI)

In order to improve the quality of Business Intelligence Systems in an organization we can choose to build the system using BI techniques such as OLAP and data warehousing or by using traditional reports based on SQL queries. The cost and developing ... Keywords: SQL query plans, analytical functions, business intelligence projects, data extraction, indexes, partitioning techniques, query optimization and performance, tuning and optimization, virtual data warehouse

Adela Bâra; Ion Lungu; Manole Velicanu; Vlad Diaconita; Iuliana Botha

2008-05-01T23:59:59.000Z

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


241

Logical queries over views: Decidability and expressiveness  

Science Conference Proceedings (OSTI)

We study the problem of deciding the satisfiability of first-order logic queries over views, with our aim to delimit the boundary between the decidable and the undecidable fragments of this language. Views currently occupy a central place in database ... Keywords: Löwenheim class, Satisfiability, conjunctive query, containment, database query, database view, decidability, first-order logic, monadic logic, ontology reasoning, unary logic, unary view

James Bailey; Guozhu Dong; Anthony WIDJAJA To

2010-01-01T23:59:59.000Z

242

Effective Structured Query Formulation for Session Search  

Science Conference Proceedings (OSTI)

... For instance, in TREC 2011 session 11 query “hawaii real estate average resale value house or condo news”, we discover that “hawaii real” and ...

2013-02-12T23:59:59.000Z

243

Decision trees with AND, OR queries  

Science Conference Proceedings (OSTI)

We investigate decision trees in which one is allowed to query threshold functions of subsets of variables. We are mainly interested in the case where only queries of AND and OR are allowed. This model is a generalization of the classical decision tree ... Keywords: AND, OR queries, Boolean functions, CRCW PRAM machines, Ethernet channel, complexity, computational complexity, copy computation, decision theory, decision trees, depth-three circuits, determinism, direct sum problem, nondeterminism, parallel time, query threshold functions, random processes, randomization, required decision tree depth, size complexity, threshold-k function, tight lower bound, trees (mathematics), variable subsets

Y. Ben-Asher; I. Newman

1995-06-01T23:59:59.000Z

244

Querying Allocations Using cbank | Argonne Leadership Computing...  

NLE Websites -- All DOE Office Websites (Extended Search)

apply to the resource (machine) to which a user is currently logged in. For example, a query on Surveyor about PROJECTNAME will return information about the Surveyor allocation...

245

Ontology query languages for the Semantic Web.  

E-Print Network (OSTI)

??Ontology languages and corresponding query languages play key roles for representing and processing information about the real world for the emerging Semantic Web. Efforts have… (more)

Zhang, Zhijun

2005-01-01T23:59:59.000Z

246

Predicting Query Performance in Intranet Search  

E-Print Network (OSTI)

Macdonald,C. He,B. Ounis,I. In Proceedings of the ACM SIGIR'05 Query Prediction Workshop. August 19, 2005, Salvador, Brazil.

Macdonald, C.; He, B.; Ounis, I.

247

Query expansion techniques for question answering.  

E-Print Network (OSTI)

??Query expansion is a technique used to boost performance of a document retrieval engine, such as those commonly found in question answering (QA) systems. Common… (more)

Bilotti, Matthew W. (Matthew William), 1981-

2004-01-01T23:59:59.000Z

248

Top-k typicality queries and efficient query answering methods on large databases  

Science Conference Proceedings (OSTI)

Finding typical instances is an effective approach to understand and analyze large data sets. In this paper, we apply the idea of typicality analysis from psychology and cognitive science to database query answering, and study the novel problem of answering ... Keywords: Efficient query answering, Top-k query, Typicality analysis

Ming Hua; Jian Pei; Ada W. Fu; Xuemin Lin; Ho-Fung Leung

2009-06-01T23:59:59.000Z

249

Queries as anchors: selection by association  

Science Conference Proceedings (OSTI)

This paper introduces a new method for linking the world view of the search engine user community with that of the search engine itself. This new method is based on collecting and aggregating associative query trails in the form of query reformulation ... Keywords: document expansion, index enhancement, reformulation analysis

Einat Amitay; Adam Darlow; David Konopnicki; Uri Weiss

2005-09-01T23:59:59.000Z

250

Processing top k queries from samples  

Science Conference Proceedings (OSTI)

Top-k queries are desired aggregation operations on data sets. Examples of queries on network data include the top 100 source AS's, top 100 ports, or top Domain names over IP packets or over IP flow records. Since the complete dataset is often ...

Edith Cohen; Nadav Grossaug; Haim Kaplan

2006-12-01T23:59:59.000Z

251

Observing SQL queries in their natural habitat  

Science Conference Proceedings (OSTI)

We describe Habitat, a declarative observational debugger for SQL. Habitat facilitates true language-level (not: plan-level) debugging of, probably flawed, SQL queries that yield unexpected results. Users mark SQL subexpressions ... Keywords: Declarative debugging, SQL, query languages, relational databases

Torsten Grust; Jan Rittinger

2013-04-01T23:59:59.000Z

252

Ranking class labels using query sessions  

Science Conference Proceedings (OSTI)

The role of search queries, as available within query sessions or in isolation from one another, in examined in the context of ranking the class labels (e.g., brazilian cities, business centers, hilly sites) extracted from Web documents for various ...

Marius Pa?ca

2011-06-01T23:59:59.000Z

253

Query-Answering CG Knowledge Bases  

Science Conference Proceedings (OSTI)

Conceptual graphs are a good choice for constructing and exploiting a knowledge base. In several of our projects (semantic portal for e-tourism, exploitation of digital object corpus, etc.), we have to query such bases. So it is natural to consider queries ...

Michel Leclère; Nicolas Moreau

2008-07-01T23:59:59.000Z

254

Query Selectivity Estimation for Uncertain Data  

E-Print Network (OSTI)

Abstract. Applications requiring the handling of uncertain data have led to the development of database management systems extending the scope of relational databases to include uncertain (probabilistic) data as a native data type. New automatic query optimizations having the ability to estimate the cost of execution of a given query plan, as available in existing databases, need to be developed. For probabilistic data this involves providing selectivity estimations that can handle multiple values for each attribute and also new query types with threshold values. This paper presents novel selectivity estimation functions for uncertain data and shows how these functions can be integrated into PostgreSQL to achieve query optimization for probabilistic queries over uncertain data. The proposed methods are able to handle both attribute- and tuple-uncertainty. Our experimental results show that our algorithms are efficient and give good selectivity estimates with low space-time overhead. 1

Sarvjeet Singh; Chris Mayfield; Rahul Shah; Sunil Prabhakar; Susanne Hambrusch

2008-01-01T23:59:59.000Z

255

Building an Efficient Preference XML Query Processor  

E-Print Network (OSTI)

Today user-centered information acquisition over collections of complex XML documents is increasingly in demand. To this end, preferences have become an important paradigm enabling users to express individual interests and delivering personalized information. As the structure of XML documents plays a major part in retrieval, users often have specific preferences about the structure. For evaluation a query has to be unfolded into an entire set of queries filling the structure with more or less preferred values. Since such structure expansions typically contain redundancies, it is important to identify and simplify necessary expansion queries for effective evaluation. To address these issues, we developed a preference query optimizer that not only determines an optimal set of expansion queries, but also preserves the specific ordering induced by the user preferences with respect to Pareto optimality.

Sungran Cho; Wolf-tilo Balke

2009-01-01T23:59:59.000Z

256

Learning about the world through long-term query logs  

Science Conference Proceedings (OSTI)

In this article, we demonstrate the value of long-term query logs. Most work on query logs to date considers only short-term (within-session) query information. In contrast, we show that long-term query logs can be used to learn about the world we live ... Keywords: data mining, knowledge discovery, query logs, user behavior

Matthew Richardson

2008-10-01T23:59:59.000Z

257

Optimized query routing trees for wireless sensor networks  

Science Conference Proceedings (OSTI)

In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with a path over which query results can be transmitted to the querying node. ... Keywords: Critical path method, Query routing trees, Sensor networks

Panayiotis Andreou; Demetrios Zeinalipour-Yazti; Andreas Pamboris; Panos K. Chrysanthis; George Samaras

2011-04-01T23:59:59.000Z

258

Experimental quantum private queries with linear optics  

Science Conference Proceedings (OSTI)

The quantum private query is a quantum cryptographic protocol to recover information from a database, preserving both user and data privacy: the user can test whether someone has retained information on which query was asked and the database provider can test the amount of information released. Here we discuss a variant of the quantum private query algorithm that admits a simple linear optical implementation: it employs the photon's momentum (or time slot) as address qubits and its polarization as bus qubit. A proof-of-principle experimental realization is implemented.

De Martini, Francesco [Dipartimento di Fisica, dell'Universita 'La Sapienza', Roma 00185 (Italy); Accademia Nazionale dei Lincei, via della Lungara 10, Roma 00165 (Italy); Giovannetti, Vittorio [NEST-CNR-INFM and Scuola Normale Superiore, Piazza dei Cavalieri 7, 56126 Pisa (Italy); Lloyd, Seth [MIT, RLE, and Department of Mechanical Engineering, MIT 3-160, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139 (United States); Maccone, Lorenzo [Institute for Scientific Interchange, 10133 Torino (Italy); QUIT, Dip. Fisica A. Volta, 27100 Pavia (Italy); Nagali, Eleonora; Sansoni, Linda; Sciarrino, Fabio [Dipartimento di Fisica, dell'Universita 'La Sapienza', Roma 00185 (Italy)

2009-07-15T23:59:59.000Z

259

Natural Gas EIA-176 Query System Readme(1999)  

Annual Energy Outlook 2012 (EIA)

176 Query System Readme 1.0 INTRODUCTION TO THE EIA-176 FRONT END QUERY FACILITY This system provides a method of extracting and using the EIA-176 data, and saving the query...

260

A Belief Model of Query Difficulty That Uses Subjective Logic  

Science Conference Proceedings (OSTI)

The difficulty of a user query can affect the performance of Information Retrieval (IR) systems. This work presents a formal model for quantifying and reasoning about query difficulty as follows: Query difficulty is considered to be a subjective belief, ...

Christina Lioma; Roi Blanco; Raquel Mochales Palau; Marie-Francine Moens

2009-09-01T23:59:59.000Z

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


261

Ordering the attributes of query results  

Science Conference Proceedings (OSTI)

There has been a great deal of interest in the past few years on ranking of results of queries on structured databases, including work on probabilistic information retrieval, rank aggregation, and algorithms for merging of ordered lists. In many applications, ...

Gautam Das; Vagelis Hristidis; Nishant Kapoor; S. Sudarshan

2006-06-01T23:59:59.000Z

262

Probabilistic ranking of database query results  

Science Conference Proceedings (OSTI)

We investigate the problem of ranking answers to a database query when many tuples are returned. We adapt and apply principles of probabilistic models from Information Retrieval for structured data. Our proposed solution is domain independent. It leverages ...

Surajit Chaudhuri; Gautam Das; Vagelis Hristidis; Gerhard Weikum

2004-08-01T23:59:59.000Z

263

The DEDALE system for complex spatial queries  

Science Conference Proceedings (OSTI)

This paper presents DEDALE, a spatial database system intended to overcome some limitations of current systems by providing an abstract and non-specialized data model and query language for the representation and manipulation of spatial objects. DEDALE ...

Stéphane Grumbach; Philippe Rigaux; Luc Segoufin

1998-06-01T23:59:59.000Z

264

Querying Incomplete Data over Extended ER Schemata  

E-Print Network (OSTI)

Since Chen's Entity-Relationship (ER) model, conceptual modeling has been playing a fundamental role in relational data design. In this paper we consider an extended ER (EER) model enriched with cardinality constraints, disjointness assertions, and is-a relations among both entities and relationships. In this setting, we consider the case of incomplete data, which is likely to occur, for instance, when data from different sources are integrated. In such a context, we address the problem of providing correct answers to conjunctive queries by reasoning on the schema. Based on previous results about decidability of the problem, we provide a query answering algorithm that performs rewriting of the initial query into a recursive Datalog query encoding the information about the schema. We finally show extensions to more general settings.

Cali, Andrea

2010-01-01T23:59:59.000Z

265

Table Name query? | OpenEI Community  

Open Energy Info (EERE)

Table Name query? Home > Groups > Databus Is there an API feature which returns the names of tables? Submitted by Hopcroft on 28 October, 2013 - 15:37 1 answer Points: 0 if you are...

266

Indexing a dictionary for subset matching queries  

Science Conference Proceedings (OSTI)

We consider a subset matching variant of the Dictionary Query problem. Consider a dictionary D of n strings, where each string location contains a set of characters drawn from some alphabet ?={1,...,|?|}. Our goal is to ...

Gad M. Landau; Dekel Tsur; Oren Weimann

2010-01-01T23:59:59.000Z

267

Indexing a dictionary for subset matching queries  

Science Conference Proceedings (OSTI)

We consider a subset matching variant of the Dictionary Query problem. Consider a dictionary D of n strings, where each string location contains a set of characters drawn from some alphabet ?. Our goal is to preprocess D so ...

Gad M. Landau; Dekel Tsur; Oren Weimann

2007-10-01T23:59:59.000Z

268

Enabling ?-approximate querying in sensor networks  

Science Conference Proceedings (OSTI)

Data approximation is a popular means to support energy-efficient query processing in sensor networks. Conventional data approximation methods require users to specify fixed error bounds a prior to address the trade-off between result accuracy ...

Liu Yu; Jianzhong Li; Hong Gao; Xiaolin Fang

2009-08-01T23:59:59.000Z

269

T-703: Cisco Unified Communications Manager Open Query Interface...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

703: Cisco Unified Communications Manager Open Query Interface Lets Remote Users Obtain Database Contents T-703: Cisco Unified Communications Manager Open Query Interface Lets...

270

Implementing Graph Pattern Queries on a Relational Database  

Science Conference Proceedings (OSTI)

When a graph database is implemented on top of a relational database, queries in the graph query language are translated into relational SQL queries. Graph pattern queries are an important feature of a graph query language. Translating graph pattern queries into single SQL statements results in very poor query performance. By taking into account the pattern query structure and generating multiple SQL statements, pattern query performance can be dramatically improved. The performance problems encountered with the single SQL statements generated for pattern queries reflects a problem in the SQL query planner and optimizer. Addressing this problem would allow relational databases to better support semantic graph databases. Relational database systems that provide good support for graph databases may also be more flexible platforms for data warehouses.

Kaplan, I L; Abdulla, G M; Brugger, S T; Kohn, S R

2007-12-26T23:59:59.000Z

271

Query clustering using content words and user feedback  

Science Conference Proceedings (OSTI)

Query clustering is crucial for automatically discovering frequently asked queries (FAQs) or most popular topics on a question-answering search engine. Due to the short length of queries, the traditional approaches based on keywords are not suitable ... Keywords: log mining, query clustering, user feedback, web search

Ji-Rong Wen; Jian-Yun Nie; Hong-Jiang Zhang

2001-09-01T23:59:59.000Z

272

Semantic errors in SQL queries: a quite complete list  

Science Conference Proceedings (OSTI)

We investigate classes of SQL queries which are syntactically correct, but certainly not intended, no matter for which task the query was written. For instance, queries that are contradictory, i.e. always return the empty set, are obviously not intended. ... Keywords: SQL, SQL exams, bugs, database courses, databases, errors, logical errors, queries, semantic errors, software correctness, static analysis, teaching

Stefan Brass; Christian Goldberg

2006-05-01T23:59:59.000Z

273

On applying temporal database concepts to event queries  

Science Conference Proceedings (OSTI)

Temporal databases and query languages have been a subject of research for more than 30 years and are a natural fit for expressing queries that involve a temporal dimension. This paper makes an argument for an event query language that incorporates temporal ... Keywords: event processing, temporal databases, temporal queries

Foruhar Ali Shiva; Susan D. Urban

2011-11-01T23:59:59.000Z

274

Querying Source Code with Natural Language Markus Kimmig  

E-Print Network (OSTI)

a developer enters a code search query, we first compute its grammatical form. Then, we search the training) corre- sponds to the query form. In other terms, we search the training data for queries that match enters the query "Where is method init() called" the tool might choose method for the "search for

Paris-Sud XI, Université de

275

Monitoring the dynamic web to respond to continuous queries  

Science Conference Proceedings (OSTI)

Continuous queries are queries for which responses given to users must be continuously updated, as the sources of interest get updated. Such queries occur, for instance, during on-line decision making, e.g., traffic flow control, weather monitoring, ... Keywords: allocation policies, continuous queries

Sandeep Pandey; Krithi Ramamritham; Soumen Chakrabarti

2003-05-01T23:59:59.000Z

276

An interactive visual query interface on spatial/ temporal data  

E-Print Network (OSTI)

Abstract: In this paper a visual approach for the query interface on the spatial/temporal data is described, which is designed for the users who know nothing about query languages. Based on concept of elementary query and query operators, a complex spatial/temporal query could be built as a compound query which is broken down into several interactive iterations. In each of iterations, users just need to build a simple elementary query and select a query operator, which greatly reduces the mental load of users. To make query building more efficient, a novel approach based on the query pattern retrieving and matching is explained and used in the interface. An experimental prototype has been implemented to demonstrate the usability of the interface.

Xin Li; S. K. Chang

2004-01-01T23:59:59.000Z

277

Inferring Function Semantics to Optimize Queries  

E-Print Network (OSTI)

The goal of the COKO-KOLA project [10, 9] is to express rules of rule-based optimizers in a manner permitting verification with a theorem prover. In [10], we considered query transformations that were too general to be expressed with rewrite rules. In this paper, we consider the complementary issue of expressing query transformations that are too specifc for rewrite rules. Such transformations require rewrite rules to be supplemented with semantic conditions to guard rule firing. This work considers the expression of such transformations using conditional rewrite rules, and the expression of inference rules to guide the optimizer in deciding if semantic conditions hold. This work differs from existing work in semantic query optimization in that semantic transformations in our framework are verifiable with a theorem prover. Further, our use of inference rules to guide semantic reasoning makes our optimizer extensible in a manner that is complementary to the extensibility benefits of existing rule-based technology. 1

Mitch Cherniack; Stan Zdonik

1998-01-01T23:59:59.000Z

278

Ambiguous queries: test collections need more sense  

Science Conference Proceedings (OSTI)

Although there are many papers examining ambiguity in Information Retrieval, this paper shows that there is a whole class of ambiguous word that past research has barely explored. It is shown that the class is more ambiguous than other word types and ... Keywords: ambiguous queries, diversity, test collections

Mark Sanderson

2008-07-01T23:59:59.000Z

279

Stratified analysis of AOL query log  

Science Conference Proceedings (OSTI)

Characterizing user's intent and behaviour while using a retrieval information tool (e.g. a search engine) is a key question on web research, as it hold the keys to know how the users interact, what they are expecting and how we can provide them information ... Keywords: Query log analysis, User behaviour, User intent, User interactions, User profiling

David J. Brenes; Daniel Gayo-Avello

2009-05-01T23:59:59.000Z

280

Query and update through XML views  

Science Conference Proceedings (OSTI)

XML has become a standard medium for data exchange, and XML views are frequently used as an interface to relational database and XML data. There have been a considerable number of studies on building and querying XML views, while updating related topics ...

Gao Cong

2007-10-01T23:59:59.000Z

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


281

Ranking entities using web search query logs  

Science Conference Proceedings (OSTI)

Searching for entities is an emerging task in Information Retrieval for which the goal is finding well defined entities instead of documents matching the query terms. In this paper we propose a novel approach to Entity Retrieval by using Web search engine ...

Bodo Billerbeck; Gianluca Demartini; Claudiu S. Firan; Tereza Iofciu; Ralf Krestel

2010-09-01T23:59:59.000Z

282

Secure multidimensional range queries in sensor networks  

Science Conference Proceedings (OSTI)

Most future large-scale sensor networks are expected to follow a two-tier architecture which consists of resource-rich master nodes at the upper tier and resource-poor sensor nodes at the lower tier. Sensor nodes submit data to nearby master nodes which ... Keywords: multidimensional range query, security, sensor networks,

Rui Zhang; Jing Shi; Yanchao Zhang

2009-05-01T23:59:59.000Z

283

Query Answering with DBoxes is Hard  

Science Conference Proceedings (OSTI)

Data in description logic knowledge bases is stored in the form of an ABox. ABoxes are often confusing for developers coming from relational databases because an ABox, in contrast to a database instance, provides an incomplete specification. A recently ... Keywords: Description logics, conjunctive queries, hybrid logic, model theory

Enrico Franconi; Yazmín Angélica Ibáñez-García; ?nanç Seylan

2011-11-01T23:59:59.000Z

284

A logic based context query language  

Science Conference Proceedings (OSTI)

Context is a basic ingredient in pervasive computing. It refers to user's both external environment and internal status, implying user's information needs during the interaction between the user and computer systems. By context-awareness, a variety of ... Keywords: context, context query language, temporal description logic

Ling Feng; Junhui Deng; Zhanjiang Song; Wenwei Xue

2010-11-01T23:59:59.000Z

285

Explicit Query Diversification for Geographical Information Retrieval  

E-Print Network (OSTI)

Explicit Query Diversification for Geographical Information Retrieval Davide Buscaldi1 and Paolo in the Geographical Information Retrieval task. This task represent an opportunity to take advantage of diversity not contain enough geographical data. 1 Introduction Diversity search is an Information Retrieval (IR

Paris-Sud XI, Université de

286

Answering relationship queries on the web  

Science Conference Proceedings (OSTI)

Finding relationships between entities on the Web, e.g., the connections between different places or the commonalities of people, is a novel and challenging problem. Existing Web search engines excel in keyword matching and document ranking, but they ... Keywords: relationship query, web search

Gang Luo; Chunqiang Tang; Ying-li Tian

2007-05-01T23:59:59.000Z

287

V.: GLOO: A Graphical Query Language for OWL Ontologies. OWLED  

E-Print Network (OSTI)

Abstract. The database usability experience has shown that visual query languages tend to be superior to textual languages in many aspects. By applying this principle in the context of ontologies, we present GLOO, a graphical query language for OWL-DL ontologies. GLOO maps diagrammatic queries to DL based query languages such as nRQL, which is offered by the OWL-DL reasoner Racer. GLOO hides the complexity of a DL query language from users and allows them to query OWL ontologies with less difficulty. 1

Amineh Fadhil; Volker Haarslev

2006-01-01T23:59:59.000Z

288

AdCell: Ad Allocation in Cellular Networks  

E-Print Network (OSTI)

With more than four billion usage of cellular phones worldwide, mobile advertising has become an attractive alternative to online advertisements. In this paper, we propose a new targeted advertising policy for Wireless Service Providers (WSPs) via SMS or MMS- namely {\\em AdCell}. In our model, a WSP charges the advertisers for showing their ads. Each advertiser has a valuation for specific types of customers in various times and locations and has a limit on the maximum available budget. Each query is in the form of time and location and is associated with one individual customer. In order to achieve a non-intrusive delivery, only a limited number of ads can be sent to each customer. Recently, new services have been introduced that offer location-based advertising over cellular network that fit in our model (e.g., ShopAlerts by AT&T) . We consider both online and offline version of the AdCell problem and develop approximation algorithms with constant competitive ratio. For the online version, we assume tha...

Alaei, Saeed; Liaghat, Vahid; Pei, Dan; Saha, Barna

2011-01-01T23:59:59.000Z

289

Query-based database policy assurance using semantic web technologies  

E-Print Network (OSTI)

In this thesis, we present a novel approach to database security which looks at queries instead of the database tables themselves. In doing so, we use a number of Semantic Web technologies to define rules, translate queries, ...

Soltren, José Hiram

2009-01-01T23:59:59.000Z

290

On-the-fly progress detection in iterative stream queries  

Science Conference Proceedings (OSTI)

Multiple researchers have proposed cyclic query plans for evaluating iterative queries over streams or rapidly changing input. The Declarative Networking community uses cyclic plans to evaluate Datalog programs that track reachability and other graph ...

Badrish Chandramouli; Jonathan Goldstein; David Maier

2009-08-01T23:59:59.000Z

291

EIA 176 Query System, 2002 - U.S. Energy Information ...  

U.S. Energy Information Administration (EIA)

EIA 176 Query System 2002 Release date: February 2, 2004 Next release date: February 2005. The EIA-176 Query system is a Windows-based system which runs under ...

292

The Effectiveness of Query Expansion for Distributed Information Retrieval  

E-Print Network (OSTI)

The Effectiveness of Query Expansion for Distributed Information Retrieval Paul Ogilvie, Jamie information retrieval where complete collection information is available. One might expect that query expansion would then work for distributed information retrieval when complete collection information

Callan, Jamie

293

Framework for querying distributed objects managed by a grid infrastructure  

Science Conference Proceedings (OSTI)

Queries over scientific data often imply expensive analyses of data requiring a lot of computational resources available in Grids. We are developing a customizable query processor built on top of an established Grid infrastructure, the NorduGrid middleware, ...

Ruslan Fomkin; Tore Risch

2005-09-01T23:59:59.000Z

294

Xplus: a SQL-tuning-aware query optimizer  

Science Conference Proceedings (OSTI)

The need to improve a suboptimal execution plan picked by the query optimizer for a repeatedly run SQL query arises routinely. Complex expressions, skewed or correlated data, and changing conditions can cause the optimizer to make mistakes. For example, ...

Herodotos Herodotou; Shivnath Babu

2010-09-01T23:59:59.000Z

295

Template:Incentive Type Page Query | Open Energy Information  

Open Energy Info (EERE)

Incentive Type Page Query Jump to: navigation, search This is the 'Incentive Type Page Query' template. If limitrec is not included, default is 1000. limitrec is only for the...

296

Quantum query complexity of some graph problems  

E-Print Network (OSTI)

Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for the bounded error quantum query complexity of Connectivity, Strong Connectivity, Minimum Spanning Tree, and Single Source Shortest Paths. For example we show that the query complexity of Minimum Spanning Tree is in Theta(n^{3/2}) in the matrix model and in Theta(sqrt{nm}) in the array model, while the complexity of Connectivity is also in Theta(n^{3/2}) in the matrix model, but in Theta(n) in the array model. The upper bounds utilize search procedures for finding minima of functions under various conditions.

Christoph Durr; Mark Heiligman; Peter Hoyer; Mehdi Mhalla

2004-01-15T23:59:59.000Z

297

Natural Gas Annual Respondent Query System  

Gasoline and Diesel Fuel Update (EIA)

loading new table loading new table Home > Natural Gas > Natural Gas Annual Respondent Query System Natural Gas Annual Respondent Query System (EIA-176 Data through 2012) Report: 176 Natural Gas Deliveries 176 Natural Gas Supply Items 176 Natural Gas Other Disposition Items 176 Type of Operations and Sector Items 176 Continuation Text Lines 176 Company List 191 Field Level Storage Data 757 Processing Capacity 176 Custom Report (User-defined) Years: 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 to 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 Sort by: Area, Company, Item Company, Area, Item Item, Area, Company Company: Show only Company ID Show only Company Name Show both Company ID, Name 2012 Total

298

Variable Interactions in Query-Driven Visualization  

SciTech Connect

One fundamental element of scientific inquiry is discoveringrelationships, particularly the interactions between different variablesin observed or simulated phenomena. Building upon our prior work in thefield of Query-Driven Visualization, where visual data analysisprocessing is focused on subsets of large data deemed to be"scientifically interesting," this new work focuses on a novel knowledgediscovery capability suitable for use with petascale class datasets. Itenables visual presentation of the presence or absence of relationships(correlations) between variables in data subsets produced by Query-Drivenmethodologies. This technique holds great potential for enablingknowledge discovery from large and complex datasets currently emergingfrom SciDAC and INCITE projects. It is sufficiently generally to beapplicable to any time of complex, time-varying, multivariate data fromstructured, unstructured or adaptive grids.

Bethel, E. Wes; Gosink, Luke J.; Anderson, John C.; Joy, Kenneth I.

2007-10-25T23:59:59.000Z

299

Black holes, AdS, and CFTs  

E-Print Network (OSTI)

count all states inside the black hole, but only those thatis the bag of gold? . . . . . Black hole entropy · AdS/CFT 12000) [arXiv:hep-th/9911230] Black holes, AdS, and CFTs 11.

Marolf, Donald

2009-01-01T23:59:59.000Z

300

Selective Sampling Using the Query by Committee Algorithm  

Science Conference Proceedings (OSTI)

We analyze the “query by committee” algorithm, a method for filtering informative queries from a random stream of inputs. We show that if the two-member committee algorithm achieves information gain with positive lower bound, then the ... Keywords: Bayesian Learning, experimental design, query learning, selective sampling

Yoav Freund; H. Sebastian Seung; Eli Shamir; Naftali Tishby

1997-09-01T23:59:59.000Z

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


301

Probabilistic information retrieval approach for ranking of database query results  

Science Conference Proceedings (OSTI)

We investigate the problem of ranking the answers to a database query when many tuples are returned. In particular, we present methodologies to tackle the problem for conjunctive and range queries, by adapting and applying principles of probabilistic ... Keywords: Probabilistic information retrieval, automatic ranking, experimentation, indexing, relational queries, user survey, workload

Surajit Chaudhuri; Gautam Das; Vagelis Hristidis; Gerhard Weikum

2006-09-01T23:59:59.000Z

302

Behavior-driven clustering of queries into topics  

Science Conference Proceedings (OSTI)

Categorization of web-search queries in semantically coherent topics is a crucial task to understand the interest trends of search engine users and, therefore, to provide more intelligent personalization services. Query clustering usually relies on lexical ... Keywords: mission, query log, topic, user intent, user profiling

Luca Maria Aiello; Debora Donato; Umut Ozertem; Filippo Menczer

2011-10-01T23:59:59.000Z

303

A Simple Model for Classifying Web Queries by User Intent  

E-Print Network (OSTI)

València, Spain 3 NLE Lab.- ELiRF, Universitat Politècnica de València, Spain 4 PRHLT, Universitat query classification, User intent, Query analysis 1 Introduction Web Search Engines (WSEs) are the most in an interaction with a Web Search Engine. Query Classification based on user intent is different from traditional

Rosso, Paolo

304

Users, Queries and Documents: A Unified Representation for Web Mining  

Science Conference Proceedings (OSTI)

The collective feedback of the users of an Information Retrieval system has been proved to be useful in many tasks. A popular approach in the literature is to process the logs stored by Internet Service Providers (ISP), Intranet proxies or Web search ... Keywords: Web Logs, User Feedback, Query Clustering, Query Recommendations, Query Suggestions

Michelangelo Diligenti; Marco Gori; Marco Maggini

2009-09-01T23:59:59.000Z

305

Data summaries for on-demand queries over linked data  

Science Conference Proceedings (OSTI)

Typical approaches for querying structured Web Data collect (crawl) and pre-process (index) large amounts of data in a central data repository before allowing for query answering. However, this time-consuming pre-processing phase however leverages the ... Keywords: index structures, linked data, rdf querying

Andreas Harth; Katja Hose; Marcel Karnstedt; Axel Polleres; Kai-Uwe Sattler; Jürgen Umbrich

2010-04-01T23:59:59.000Z

306

Using histograms to estimate answer sizes for XML queries  

Science Conference Proceedings (OSTI)

Estimating the sizes of query results, and intermediate results, is crucial to many aspects of query processing. In particular, it is necessary for effective query optimization. Even at the user level, predictions of the total result size can be valuable ... Keywords: XML, estimation, histogram, schema

Yuqing Wu; Jignesh M. Patel; H. V. Jagadish

2003-03-01T23:59:59.000Z

307

Query Suggestions for Mobile Search: Understanding Usage Patterns  

E-Print Network (OSTI)

Inc 1600 Amphitheatre Parkway, Mountain View, CA shumeet@google.com ABSTRACT Entering search terms that users who were asked to enter queries on a search interface with query suggestions rated their workload heavily on suggestions if they are provided. Users who were asked to enter queries on a search interface

Cortes, Corinna

308

Analyzing, Detecting, and Exploiting Sentiment in Web Queries  

Science Conference Proceedings (OSTI)

The Web contains an increasing amount of biased and opinionated documents on politics, products, and polarizing events. In this article, we present an indepth analysis of Web search queries for controversial topics, focusing on query sentiment. To this ... Keywords: Opinionated queries, Web search, sentiment analysis

Sergiu Chelaru, Ismail Sengor Altingovde, Stefan Siersdorfer, Wolfgang Nejdl

2013-12-01T23:59:59.000Z

309

Improving effectiveness of query expansion using information theoretic approach  

Science Conference Proceedings (OSTI)

Automatic Query expansion is a well-known method to improve the performance of information retrieval systems. In this paper we have suggested information theoretic measures to improve efficiency of co-occurrence based automatic query expansion. We have ... Keywords: automatic query expansion, candidate terms, kullback-leibler divergence, relevance feedback, term cooccurrence

Hazra Imran; Aditi Sharan

2010-06-01T23:59:59.000Z

310

An Improved Query for the Hidden Subgroup Problem  

E-Print Network (OSTI)

An equal superposition query with |0> in the response register is used in the "standard method" of single-query algorithms for the hidden subgroup problem (HSP). Here we introduce a different query, the character query, generalizing the well-known phase kickback trick. This query maximizes the success probability of subgroup identification under a uniform prior, for the HSP in which the oracle functions take values in a finite abelian group. We then apply our results to the case when the subgroups are drawn from a set of conjugate subgroups and obtain a success probability greater than that found by Moore and Russell.

Asif Shakeel

2011-01-05T23:59:59.000Z

311

Microsoft PowerPoint - DSSE_Portfolio.pptx  

NLE Websites -- All DOE Office Websites (Extended Search)

a c cu sta ces Benefit: - Automatic, daily monitoring of database quality issues - Query interface for ad-hoc reporting Technology Readiness Level 9 Tim Rhyne Point of...

312

Automatic discovery of query-classdependent models for multimodal search  

E-Print Network (OSTI)

We develop a framework for the automatic discovery of query classes for query-class-dependent search models in multimodal retrieval. The framework automatically discovers useful query classes by clustering queries in a training set according to the performance of various unimodal search methods, yielding classes of queries which have similar fusion strategies for the combination of unimodal components for multimodal search. We further combine these performance features with the semantic features of the queries during clustering in order to make discovered classes meaningful. The inclusion of the semantic space also makes it possible to choose the correct class for new, unseen queries, which have unknown performance space features. We evaluate the system against the TRECVID 2004 automatic video search task and find that the automatically discovered query classes give an improvement of 18% in MAP over hand-defined query classes used in previous works. We also find that some hand-defined query classes, such as “Named Person ” and “Sports ” do, indeed, have similarities in search method performance and are useful for query-class-dependent multimodal search, while other hand-defined classes, such as “Named Object” and “General Object” do not have consistent search method performance and should be split apart or replaced with other classes. The proposed framework is general and can be applied to any new domain without expert domain knowledge.

Lyndon S. Kennedy; Apostol (Paul) Natsev; Shih-fu Chang

2005-01-01T23:59:59.000Z

313

Multicolor Maps from Compound Queries | OpenEI Community  

Open Energy Info (EERE)

Multicolor Maps from Compound Queries Multicolor Maps from Compound Queries Home > Groups > OpenEI Community Central Jweers's picture Submitted by Jweers(83) Contributor 16 May, 2013 - 14:22 ask queries compound queries developer Google maps maps multicolor result formats results Semantic Mediawiki Hi all, Recently, a couple of people on OpenEI have asked me how to do compound (or multicolor) maps like this one: Thanks to the new Google Maps v3 API, this is really easy. I put together a quick sample of how this is done, complete with code snippits, here: http://en.openei.org/wiki/User:Jweers/Test5. First, create a compound query, then atttribute a custom marker icon to each query using the ;param=value syntax. The new OpenEI maps extension will take care of the rest. Here is an example of it in use on OpenEI by NREL's Geothermal team:

314

Intentional query suggestion: making user goals more explicit during search  

E-Print Network (OSTI)

student.tugraz.at The degree to which users ’ make their search intent explicit can be assumed to represent an upper bound on the level of service that search engines can provide. In a departure from traditional query expansion mechanisms, we introduce Intentional Query Suggestion as a novel idea that is attempting to make users ’ intent more explicit during search. In this paper, we present a prototypical algorithm for Intentional Query Suggestion and we discuss corresponding data from comparative experiments with traditional query suggestion mechanisms. Our preliminary results indicate that intentional query suggestions 1) diversify search result sets (i.e. it reduces result set overlap) and 2) have the potential to yield higher click-through rates than traditional query suggestions.

Markus Strohmaier; Mark Kröll; Christian Körner

2009-01-01T23:59:59.000Z

315

Use of Query Concepts and Information Extraction to Improve ...  

Science Conference Proceedings (OSTI)

Page 1. Use of Query Concepts and Information Extraction to Improve Information Retrieval Effectiveness David O. Holmes M. Catherine McCabe ...

316

Form EIA-176 Query System - Energy Information Administration  

U.S. Energy Information Administration (EIA)

Form EIA-176 Query System Getting Started Guide Version 7.0 Energy Information Administration U.S. Department of Energy October ...

317

Scheduling for in-network sensor query processing.  

E-Print Network (OSTI)

??xi, 135 leaves : ill. ; 30 cm HKUST Call Number: Thesis CSED 2008 Wu In-network query processing for sensor networks is a cross-layer paradigm,… (more)

Wu, Hejun

2008-01-01T23:59:59.000Z

318

IMPLEMENTATION FOR A COHERENT KEYWORD-BASED XML QUERY LANGUAGE.  

E-Print Network (OSTI)

??Due to the increasing pervasiveness of data sets using the XML data format,numerous query languages have been proposed that exploit the structure inherent in XML.… (more)

Potturi, Venkatakalyan

2007-01-01T23:59:59.000Z

319

Form EIA-176 Query System - Energy Information Administration  

U.S. Energy Information Administration (EIA)

Form EIA-176 Query System . User’s guide . Version 7.0 . Energy Information Administration U.S. Department of Energy ...

320

Runway Incursion Database (RWS) - Data Query Tool | Data.gov  

NLE Websites -- All DOE Office Websites (Extended Search)

Runway Incursion Database (RWS) - Data Query Tool Safety DataTools Apps Challenges Resources Blogs Let's Talk Safety You are here Data.gov Communities Safety Data Runway...

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


321

Implementation of the Clinical Research Query Interface VISAGE.  

E-Print Network (OSTI)

??An innovative new query interface called VISAGE (VISual AGgregator and Explorer) has been developed for use in the PhysioMIMI system. This interface consists of three… (more)

Sandberg, Neil L.

2010-01-01T23:59:59.000Z

322

Template:CompanyCsvPostOffsetQuery | Open Energy Information  

Open Energy Info (EERE)

template. It should be called in the following format: CompanyCsvPostOffsetQuery |cat |offset |limit |searchlabel Retrieved from "http:en.openei.orgw...

323

Form EIA-176 Query System - Energy Information Administration  

U.S. Energy Information Administration (EIA)

The EIA-176 Query System is a PC-based system for users to produce reports and ... The View EIA-176 Company Menu lets you control this display.

324

Supporting ad-hoc re-planning and shareability at large-scale events  

Science Conference Proceedings (OSTI)

In this paper we present results from a research and development project focusing on the use of mobile phones at a music festival. Our aim is to explore how the festival experience can be enhanced with the introduction of mobile services. Two questions ... Keywords: coordination, ethnography, festival, groups, interaction design, large-scale event, mobile service, mobility, planning

Sarah Lindström; Mårten Pettersson

2010-11-01T23:59:59.000Z

325

Vampire attacks: Draining life from wireless ad-hoc sensor networks  

E-Print Network (OSTI)

with similarly sized mice (Riskin and Hermanson, 2005) suggests that vampire bats might even consume less energy (Chiroptera) are generally awkward crawlers, but the common vampire bat (Desmodus rotundus) and the New a single kinematic gait shift with increasing speed from a kinetic walk (where kinetic and potential energy

Hopper, Nicholas J.

326

GEOGRAPHICALLY STATIC QUORUMS IN AD-HOC NETWORKS AND THEIR PERFORMANCE AS LOCATION SERVERS  

E-Print Network (OSTI)

other without being in transmission range by relaying their messages through intermediate nodes. Routing a function that maps a node's ID to its location, but whilst this is ideal when networks are static into grid-squares of different orders. Starting with the grid-square that the node currently occupies

Kent, University of

327

Simulation of quorum systems in ad-hoc networks Gareth Huw Owen Mo Adda  

E-Print Network (OSTI)

to communicate with each other without being within the transmission range by relaying their messages through a function that maps a node's ID to its location. While this is ideal for networks that are static server have been proposed to provide this information. Li et al [1] divided the area into grid

Kent, University of

328

Design and simulation of a mobile ad-hoc network in HLA environment  

Science Conference Proceedings (OSTI)

This paper presents a generalized design for MANET simulations to support any kind of widespread adoption, and standardized to allow universal interoperability, along with flexibility to permit runtime extension of its ontology. Traditional network simulation ... Keywords: HLA, MANET, OMT, RTI

Abdul Basit; Shoib A. Khan

2007-05-01T23:59:59.000Z

329

UniPlug : a framework for ad-hoc invention sharing over a campus network  

E-Print Network (OSTI)

In the future, there will be a large number of devices, and most of us will own more than one (some of us already do). Many individual innovators write programs that exploit features on such devices for interesting, ...

Pandey, Durga Prasad, S.M. Massachusetts Institute of Technology

2007-01-01T23:59:59.000Z

330

An efficient clustering scheme for large and dense mobile ad hoc networks (MANETs)  

Science Conference Proceedings (OSTI)

Large and dense MANETs often face scalability problem and need to achieve performance guarantee with the help of a hierarchical structure, typically a cluster control structure. In this paper, an efficient clustering scheme (ECS) is proposed for large ... Keywords: Clustering, MANETs, Scalability, Stability

Jane Yang Yu; Peter Han Joo Chong

2006-12-01T23:59:59.000Z

331

Minimizing Detection Probability Routing in Ad Hoc Networks Using Directional Antennas  

E-Print Network (OSTI)

electromagnetic noise. The ratio of the total received signal power to the total noise which includes thermal and system noise plus total interference is denoted as SNIR [21]. Hence, the detection event occurs if and only if the SNIR is larger than a threshold ?... of interference is assumed to be zero in our study. Free-space path loss (FSPL) is the loss in signal strength of an electromagnetic wave that would result from a line of sight path through free space, with no obstacles nearby to cause reflection or diffraction...

2009-06-08T23:59:59.000Z

332

Cross-layer design of wideband CDMA systems and cooperative diversity for wireless ad hoc networks :  

E-Print Network (OSTI)

spectrum availability, and transmission power constraints.availability, robustness to channel quality and interference conditions, ubiquitous coverage, and terminal mobility. Since the transmissions

Annavajjala, Ramesh

2006-01-01T23:59:59.000Z

333

Geo-LANMAR: A scalable routing protocol for ad hoc networks with group motion  

E-Print Network (OSTI)

nodes [11]. The Time to live (TTL) is used in order to limittime. At the beginning, the TTL value is set to a specificglobal LSU transmission (when TTL value is set to infinity),

Zhou, Biao; Lee, Y Z; Gerla, M; de Rango, F

2006-01-01T23:59:59.000Z

334

Agent-based policy-enabled network management architecture for mobile ad hoc networks  

Science Conference Proceedings (OSTI)

We describe in this paper a novel design of a network management architecture that incorporates both agent and policy technologies. The conceptual model, main components, and various transports employed in this architecture are discussed. We believe ...

Ritu Chadha; Cho-Yu Jason Chiang; Mike Little; Sunil Samtani

2003-10-01T23:59:59.000Z

335

Energy-based adaptation in simulations of survivability of ad hoc communication  

E-Print Network (OSTI)

, it typically does not pay atten- tion to handheld devices' energy constraints when optimising networking should be studied from an energy perspective ­ both in terms of CPU usage and transmission power be included to enable more realistic CPU usage and energy consumption simulation. ACKNOWLEDGEMENTS This work

336

Classification of ad-hoc multi-lateral collaborations based on local workflow models  

Science Conference Proceedings (OSTI)

Establishing multi-lateral collaborations based on local workflows without having a global workflow is complicated, because the set of requirements used for the searching and matchmaking of trading partners is underspecified. The issue is to consider ...

Andreas Wombacher; Bendick Mahleko; Thomas Risse

2003-03-01T23:59:59.000Z

337

Topology Control in Ad hoc Wireless Networks with Hitch-hiking  

E-Print Network (OSTI)

infrastructure. Wireless nodes are battery powered and therefore have a limited operational time. Recently, the optimization of energy utilization of wireless node has received significant attention [8]. Different tech them. The number on each edge represents the cover- age provided by that edge to the destination node

Cardei, Mihaela

338

Traffic Locality Oriented Route Discovery Algorithm with Chase Packets for Mobile Ad Hoc Networks  

E-Print Network (OSTI)

AL-Rodhaan,M. Mackenzie,L.M. Ould-Khaoua,M. The 2009 International Conference on Wireless Networks (ICWN'09), USA, July 13-16, 2009.

AL-Rodhaan, M.

339

Power Allocation in Team Jamming Games in Wireless Ad Hoc Networks  

E-Print Network (OSTI)

In this work, we study the problem of power allocation in teams. Each team consists of two agents who try to split their available power between the tasks of communication and jamming the nodes of the other team. The agents have constraints on their total energy and instantaneous power usage. The cost function is the difference between the rates of erroneously transmitted bits of each team. We model the problem as a zero-sum differential game between the two teams and use {\\it{Isaacs'}} approach to obtain the necessary conditions for the optimal trajectories. This leads to a continuous-kernel power allocation game among the players. Based on the communications model, we present sufficient conditions on the physical parameters of the agents for the existence of a pure strategy Nash equilibrium (PSNE). Finally, we present simulation results for the case when the agents are holonomic.

Bhattacharya, Sourabh; Ba?ar, Tamer

2011-01-01T23:59:59.000Z

340

Dynamic fine-grained localization in Ad-Hoc networks of sensors  

Science Conference Proceedings (OSTI)

The recent advances in radio and em beddedsystem technologies have enabled the proliferation of wireless microsensor networks. Such wirelessly connected sensors are released in many diverse environments to perform various monitoring tasks. In many such ... Keywords: localization, location discovery, wireless sensor networks

Andreas Savvides; Chih-Chieh Han; Mani B. Strivastava

2001-07-01T23:59:59.000Z

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


341

Modular Topology Control and Energy Model for Wireless Ad Hoc Sensor Networks  

E-Print Network (OSTI)

to add a receive mode to our proposed model. The energy consumption rate, i.e., the power level machine may transit from the Idle state to the "Consume" state or the "Sleep" state. External processes shall invoke the transition to the Consume state if and only if any message is ready to be sent

Jay Yang, Shanchieh

342

Performance of Transmission Rate Changing in Ad-Hoc Networks May 2, 2007  

E-Print Network (OSTI)

of dynamic rate selection to conserve power and increase the lifetime of such a network. Dynamic rate's available battery power. Transmitting at a lower rate consumes less power, but causes data to travel more with no power management. In addition, the dynamic rate selection algorithm enabled 7.5 times more packets

Pittsburgh, University of

343

Protocols for multi-antenna ad-hoc wireless networking in interference environments  

E-Print Network (OSTI)

A fundamental question for the design of future wireless networks concerns the nature of spectrum management and the protocols that govern use of the spectrum. In the oligopoly model, spectrum is owned and centrally managed, ...

Hinton, Danielle A. (Danielle Ayodele), 1978-

2010-01-01T23:59:59.000Z

344

Mobile Ad Hoc Data Networks for Emergency Preparedness Telecommunications - Dynamic Power-Conscious Routing Concepts  

E-Print Network (OSTI)

this report, we focus on the Network Layer operation of routing and implications of power consumption for emergency MANETs. We discuss the bene#ts of power consciousness and conduct an initial investigation on the e#ects of energy-e#cient wireless routing in MANETs. We develop an initial dynamic power-conscious routing scheme #minimum power routing - MPR# that incorporates physical layer and link layer statistics to conservepower, while compensating for the propagation path loss, shadowing and fading e#ects, and interference environment at the intended receiver. The main idea of MPR is to select the path between a given source and destination that will require the least amount of total power expended, while still maintaining an acceptable signal-to-noise ratio #SNR# at each receiver. A #cost" function is assigned to every link re#ecting the transmitter power required to reliably communicate on that link. Routing decisions and cost updates are made based on feedback or information extracted from the received signal and special control packets. As an initial approach, we use the distributed Bellman-Ford algorithm to perform #shortest" path routing with the cost functions as the link distances. The resulting #shortest path" is the MPR path from a given source to a destination. We compare the performance of MPR to the common routing protocols of shortest distance routing with power control #SD-PC# and minimum hop routing with power control #MH-PC#, and present our preliminary results

Madhavi W. Subbarao

2000-01-01T23:59:59.000Z

345

The Limits of Motion Prediction Support for Ad hoc Wireless Network Performance  

E-Print Network (OSTI)

Company of Canada http://www.coverme. com/?MKT=MFC Blue Cross http://www.useblue.com/index. en.html Green http://www.coverme. com/?MKT=MFC Green Shield Canada http://www.greenshield.ca/ Sun Life Financial http://www.sunlife.ca/Plan/ Health/Health+insurance+summa ry?vgnLocale=en_CA Travel Guard Insurance http

Bush, Stephen F.

346

Applying Light Natural Language Processing to Ad-Hoc Cross Language Information Retrieval  

E-Print Network (OSTI)

Lioma,C. Macdonald,C. Plachouras,V. He,B. Ounis,I. In Accessing Multilingual Information Repositories: 6th Cross-Language Evaluation Forum, CLEF 2005, Vienna, Austria, Revised Selected Papers. Lecture Notes in Computer Science, Vol. 4022 LNCS, Springer

Lioma, C.

347

Mobile Grid Routing Algorithm in Mobile Ad Hoc Networks with Obstacles  

Science Conference Proceedings (OSTI)

Mobile grid provides mobile devices with a high reliability, performance and cost-efficiency. Physical limitations of the mobile devices make necessary the adaptation of the services that mobile grid can provide to the mobile devices. In the paper, we ...

Di Wu; Ning Tong; Keqiu Li

2006-11-01T23:59:59.000Z

348

ROSA: Distributed Joint Routing and Dynamic Spectrum Allocation in Cognitive Radio Ad Hoc Networks  

E-Print Network (OSTI)

, State University of New York at Buffalo, Buffalo, NY 14260, USA § Air Force Research Laboratory, RIGE the utilization efficiency of the 1 This work was supported by the U.S. Air Force Research Labora- tory under­29, 2009, Tenerife, Canary Islands, Spain. Copyright 2009 ACM 978-1-60558-616-9/09/10 ...$10.00. existing

Melodia, Tommaso

349

Report of the Ad Hoc Committee on fusion plasma research facilities  

SciTech Connect

This report surveys the need for Fusion Plasma Research Facilities (FPRF) in advancing research in several areas of plasma and atomic physics that are essential to the CTR program and describes several device options for FPRF's. The major conclusions of the report are that there is an urgent need to provide such facilities and that the most significant contributions to CTR that would be made through these facilities are in the development of plasma diagnostics and measurements of atomic processes. (auth)

1976-04-30T23:59:59.000Z

350

Ad-hoc cluster and workflow for parallel implementation of initial-stage evolutionary optimum design  

Science Conference Proceedings (OSTI)

Numerical optimization and especially topology and shape optimization are typically numerically very comprehensive due to implicit models, large number of variables, high non-linearity, possible infeasibility of candidate designs and related causes. ... Keywords: Cluster, Computational workflow, Parallelization, Topology and shape optimization

Damir Vu?ina; Željan Lozina; Igor Pehnec

2012-02-01T23:59:59.000Z

351

Proceedings of the AD HOC Workshop on Ceramics for Li/FeS{sub 2} batteries  

DOE Green Energy (OSTI)

Representatives from industry, the U.S. Advanced Battery Consortium (USABC), DOE, national laboratories, and other govt agencies met to develop recommendations and actions for accelerating the development of ceramic components critical to the successful introduction of the Li/FeS{sub 2} bipolar battery for electric vehicles. Most of the workshop is devoted to electrode materials, bipolar designs, separators, and bipolar plates. The bulk of this document is viewographs and is divided into: ceramics, USABC overview, SAFT`s Li/FeS{sub 2} USABC program, bipolar Li/FeS{sub 2} component development, design requirements for bipolar plates, separator design requirements, compatibility of ceramic insulators with lithium, characterization of MgO for use in separators, resistivity measurements of separators, sintered AlN separators for LiMS batteries, etc.

Not Available

1993-12-31T23:59:59.000Z

352

A Failure Self-recovery Strategy with Balanced Energy Consumption for Wireless Ad Hoc Networks  

E-Print Network (OSTI)

In energy constrained wireless sensor networks, it is significant to make full use of the limited energy and maximize the network lifetime even when facing some unexpected situation. In this paper, all sensor nodes are grouped into clusters, and for each cluster, it has a mobile cluster head to manage the whole cluster. We consider an emergent situation that one of the mobile cluster heads is broken down, and hence the whole cluster is consequently out of work. An efficient approach is proposed for recovering the failure cluster by selecting multiple static sensor nodes as the cluster heads to collect packets and transmit them to the sink node. Improved simulated annealing algorithm is utilized to achieve the uniform deployment of the cluster heads. The new cluster heads are dynamically changed in order to keep balanced energy consumption. Among the new cluster heads, packets are transmitted through multi-hop forwarding path which is cost-lowest path found by Dijkstra's algorithm. A balanced energy consumptio...

Qiu, Tie; Xia, Feng; Wu, Guowei; Zhou, Yu

2012-01-01T23:59:59.000Z

353

Participatory user centered design techniques for a large scale ad-hoc health information system  

Science Conference Proceedings (OSTI)

During mass casualty incidents, an enormous amount of data, including the vital signs of the patients, the location of the patients, and the location of the first responders must be gathered and communicated efficiently. The Advanced Health and Disaster ... Keywords: embedded medical systems, participatory design, triage

Tia Gao; Tammara Massey; Majid Sarrafzadeh; Leo Selavo; Matt Welsh

2007-06-01T23:59:59.000Z

354

NTT DATA: Overview of system approach at TREC-8 ad-hoc ...  

Science Conference Proceedings (OSTI)

... US states 50 www.yahoo.com Maryland, Kentucky, Illinois Currency names 221 www.bloomberg.com Euro, European Currency Unit, French Franc ...

2000-02-08T23:59:59.000Z

355

Core location-aided cluster-based routing protocol for mobile ad hoc networks  

Science Conference Proceedings (OSTI)

Instead of blindly searching for a route in the entire network, the location-based routing protocol uses the location information of mobile nodes to confine routing space into a smaller range that reduces routing overhead and broadcast storm. In this ... Keywords: GPS, MANET, cluster-based routing, geocasting, routing protocol

Tzay-Farn Shih; Hsu-Chun Yen

2006-07-01T23:59:59.000Z

356

Receiver initiated MAC design for ad hoc networks based on multiuser detection  

Science Conference Proceedings (OSTI)

Recent technological developments in code division multiple access (CDMA) with multiuser detection (MUD) make multiple packets reception a more appropriate model for the physical layer of future wireless networks. To take advantage of the new features, ...

Jinfang Zhang; Zbigniew Dziong; Francois Gagnon; Michel Kadoch

2008-07-01T23:59:59.000Z

357

Free-space-optical mobile ad hoc networks: Auto-configurable building blocks  

Science Conference Proceedings (OSTI)

Existence of line of sight (LOS) and alignment between the communicating antennas is one of the key requirements for free-space-optical (FSO) communication. To ensure uninterrupted data flow, auto-aligning transmitter and receiver modules are necessary. ... Keywords: Angular diversity, Auto-configurable, Free space optical communication

Murat Yuksel; Jayasri Akella; Shivkumar Kalyanaraman; Partha Dutta

2009-04-01T23:59:59.000Z

358

Report of the AD HOC Study Group on integrated versus dispersed fuel cycle facilities  

SciTech Connect

To provide isolation of strategic materials and confinement of nuclear wastes, the basic facilities considered in assessing the DFCF and IFCF were mixed plutonium and uranium oxide and HTGR fuel fabrication, fuel reprocessing, high- enrichment isotopic separation and interim waste storage. Reactors, low- enrichment isotopic separation, and low-enrichment uranium facilities were excluded. It is expected that the IFCF would attract uranium fuel fabrication and possibly reactors. An assumption was made for the study that the choice of either IFCF or DFCF would not alter the nuclear power generation pattern postulated to exist up to the year 2000. The advantages of IFCF are seen to outweigh disadvantages. (auth)

Kreiter, M.R.; Platt, A.M.

1975-04-01T23:59:59.000Z

359

Energy-aware real-time communication in wireless ad-hoc micro sensors network  

Science Conference Proceedings (OSTI)

Perfect functioning not only at hardware level but also at software level design is indispensable to quench the thirst of an ideal real time communication. From software perspective, in the timeless sensitive communication context, Real-Time Operating ... Keywords: energy awareness, real-time communication, real-time operating system, sensor network

Sohail Jabbar; Abid Ali Minhas

2009-12-01T23:59:59.000Z

360

Energy-Aware Adaptive Routing for Large-Scale Ad Hoc Networks  

E-Print Network (OSTI)

range are optimized analytically. By adjoining cells around hot spots and hot routes in the network neighboring cells to form proactive zones around hot spots and hot routes while the rest of the network and facilitates the handling of heterogeneous traffic via cell combining. Furthermore, the optimal cell size

Tong, Lang

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


361

An M/MMGI/1/K queuing model for IEEE 802.11 ad hoc networks  

Science Conference Proceedings (OSTI)

An M/MMGI/1/K queuing model is developed for the analysis of IEEE 802.11 DCF using RTS/CTS. Results are based on arbitrary contention conditions, namely, collision probabilities, transmission probabilities and contention window sizes vary arbitrarily ... Keywords: IEEE 802.11, performance analysis, queueing theory

Mustafa Özdemir; A. Bruce McDonald

2004-10-01T23:59:59.000Z

362

Web Service Composition Through Declarative Queries: The Case of Conjunctive Queries with Union and Negation  

E-Print Network (OSTI)

A web service operation can be seen as a function op: X1,...,Xn ? Y1,...,Ym having an input message (request) with n arguments (parts), and an output message (response) with m parts [4, Section 2.2]. For example, opB: Author ?{(ISBN, Title)} may implement a books search service, returning for a given author A a list of books authored by A. We propose to model such operations as relations with access pattern, here: B oio (ISBN, Author, Title), where ‘oio ’ indicates that a value for the second attribute must be given as input, while the other attribute values can be retrieved as output. In this way, a family of web service operations over k attributes can be concisely described as a relation R(A1,...,Ak) with an associated set of access patterns P?{i, o} k. Since we model web services as relations with access patterns, we can now use queries as a declarative specifications for web service composition: e.g., the query Q(I, A, T) ? ? B(I, A, T),C(I,A), ¬L(I) asks for books available through a store B which are contained in a catalog C, but not in the local library L. Let the only access patterns be B ioo, B oio, C oo, and L o. If we try to execute Q from left to right, neither pattern for B works since we either lack an ISBN I or an author A. However, Q is feasible since we can execute it by first calling C(I,A) which binds both I and A; after that, calling B ioo (or B oio) will work. Calling ¬L(I) first and then B does not work: a negated call can only filter out answers, but cannot produce any new variable bindings. 2. Formal Results We study the problem of deciding whether a query Q is feasible, i.e., whether there exists a logically equivalent query Q ? that can be executed observing the limited access patterns given by the web service (source) relations. Executability depends on the specific syntactic form of a query, while feasibility is a more “robust ” semantic notion, in-

Bertram Ludäscher; Alan Nash

2004-01-01T23:59:59.000Z

363

Characterizing statistical query learning: simplified notions and proofs  

Science Conference Proceedings (OSTI)

The Statistical Query model was introduced in [6] to handle noise in the well-known PAC model. In this model the learner gains information about the target concept by asking for various statistics about it. Characterizing the number of queries required ...

Balázs Szörényi

2009-10-01T23:59:59.000Z

364

The linguistic structure of English web-search queries  

Science Conference Proceedings (OSTI)

Web-search queries are known to be short, but little else is known about their structure. In this paper we investigate the applicability of part-of-speech tagging to typical English-language web search-engine queries and the potential value of these ...

Cory Barr; Rosie Jones; Moira Regelson

2008-10-01T23:59:59.000Z

365

Efficient top-k processing over query-dependent functions  

Science Conference Proceedings (OSTI)

We study the efficient evaluation of top-k queries over data items, where the score of each item is dynamically computed by applying an item-specific function whose parameter value is specified in the query. For example, online retail stores rank items ...

Lin Guo; Sihem Amer Yahia; Raghu Ramakrishnan; Jayavel Shanmugasundaram; Utkarsh Srivastava; Erik Vee

2008-08-01T23:59:59.000Z

366

Selectivity Estimation for Spatio-Temporal Queries to Moving Objects  

E-Print Network (OSTI)

omni@islab.kaist.ac.kr chungcw@cs.kaist.ac.kr Divisionof ComputerScience Department of Electrical of selection queries: one for historical positions of moving objects and the other for future positions the selection query efficiently, an accu- rate estimation of the selectivity is required. The selectivity

Chung, Chin-Wan

367

Characterizing the usability of interactive applications through query log analysis  

Science Conference Proceedings (OSTI)

People routinely rely on Internet search engines to support their use of interactive systems: they issue queries to learn how to accomplish tasks, troubleshoot problems, and otherwise educate themselves on products. Given this common behavior, we argue ... Keywords: query log analysis, usability

Adam Fourney; Richard Mann; Michael Terry

2011-05-01T23:59:59.000Z

368

Enhancing query translation with relevance feedback in translingual information retrieval  

Science Conference Proceedings (OSTI)

As an effective technique for improving retrieval effectiveness, relevance feedback (RF) has been widely studied in both monolingual and translingual information retrieval (TLIR). The studies of RF in TLIR have been focused on query expansion (QE), in ... Keywords: Query expansion, Relevance feedback, Translation enhancement, Translingual information retrieval

Daqing He; Dan Wu

2011-01-01T23:59:59.000Z

369

A natural language query interface to structured information  

Science Conference Proceedings (OSTI)

Accessing structured data such as that encoded in ontologies and knowledge bases can be done using either syntactically complex formal query languages like SPARQL or complicated form interfaces that require expensive customisation to each particular ... Keywords: conceptual search, querying, searching, user interfaces

Valentin Tablan; Danica Damljanovic; Kalina Bontcheva

2008-06-01T23:59:59.000Z

370

Agent-Based Spatial Query Optimization in a Grid Environment  

Science Conference Proceedings (OSTI)

Resource management and optimization among autonomous spatial databases in a grid environment is always a challenge task. In this paper, we introduce a BDI Agent model for cooperating complex spatial query optimization task in a grid environment. Spatial ... Keywords: BDI Agent, grid, spatial query optimization

Yufei Bai; Xiujun Ma; Kunqing Xie; Cuo Cai; Ke Li

2008-12-01T23:59:59.000Z

371

Scalable distributed indexing and query processing over Linked Data  

Science Conference Proceedings (OSTI)

Linked Data is becoming the core part of modern Web applications and thus efficient access to structured information expressed in RDF gains paramount importance. A number of efficient local RDF stores exist already, while distributed indexing and distributed ... Keywords: Decentralized data management, Distributed indexing, Distributed storage, Linked Data, Query processing, Structured queries

Marcel Karnstedt; Kai-Uwe Sattler; Manfred Hauswirth

2012-01-01T23:59:59.000Z

372

Selectivity Estimation of Window Queries for Line Segment Datasets  

E-Print Network (OSTI)

{499, Washington, DC, 1993. 11] J. Orenstein. Spatial query processing in an object- oriented database system- ples of Database Systems,pages 214{221, Washington, DC, 1993. 13] G. Proietti and C. FaloutsosSelectivity Estimation of Window Queries for Line Segment Datasets Guido Proietti Dept. of Computer

Faloutsos, Christos

373

Increasing ask query limit | OpenEI Community  

Open Energy Info (EERE)

Increasing ask query limit Increasing ask query limit Home > Groups > Utility Rate Rmckeel's picture Submitted by Rmckeel(297) Contributor 22 June, 2012 - 09:30 developer utility rate An NREL user who is trying to use the utility rate service was having an issue. He writes "I noticed that any rates past 10,000 are not accessible via json. For example, this query only returns two entries: http://en.openei.org/services/rest/utility_rates?version=latest&format=json_plain&offset=9998&limit=30&detail=basic". Twong mentioned "It looks like there's a default total max limit of 10000 results retrieved, even for special query pages in SemanticMediawiki. $smwgQMaxLimit Maximal number of results ever retrieved, even when using special query pages. Default: 10000"

374

Natural Gas EIA-176 Query System Readme(1999)  

Gasoline and Diesel Fuel Update (EIA)

176 Query System Readme 176 Query System Readme 1.0 INTRODUCTION TO THE EIA-176 FRONT END QUERY FACILITY This system provides a method of extracting and using the EIA-176 data, and saving the query results in various mediums and formats. There are pre-set data extractions available, which allow the user to select and run the most often-used queries. 1.1 Hardware Requirements The minimum hardware requirements are: - An IBM-compatible personal computer (PC) 386SX 16 MHZ with 2 megabytes RAM. (A 486DX 33MHZ with 4 megabytes RAM is recommended). - MS-DOS operating system (version 3.x or greater), or compatible, or Network operating system capable of emulating MS-DOS. - MS-DOS file handles should be set to at least 50 in the CONFIG.SYS. In Windows NT, this file is called CONFIG.NT.

375

VisTool: a Visual Tool for Querying Relational Databases  

E-Print Network (OSTI)

In this paper we describe VisTool, a prototype tool for querying relational databases by means of the visual query language VISIONARY. INTRODUCTION VISIONARY [1] is based on an iconic-diagrammatic paradigm used for both data and query representation. The external data model is called vision and is made up of the visual primitives of concept and association; the external query model is based on the definition of a dynamic and adaptive perspective for accessing data. The internal data model is relational, and the internal query model is SQL. The mapping between the visual and the relational worlds is established through an intermediate graph-based level. VISIONARY is mainly directed to naive and occasional users, who have no experience with data models and only have a general idea about the contents of the database; for this reason, the expressive power of VISIONARY is limited...

Francesca Benzi; Dario Maio; Stefano Rizzi

1998-01-01T23:59:59.000Z

376

Inferring query performance using pre-retrieval predictors  

E-Print Network (OSTI)

Abstract. The prediction of query performance is an interesting and important issue in Information Retrieval (IR). Current predictors involve the use of relevance scores, which are time-consuming to compute. Therefore, current predictors are not very suitable for practical applications. In this paper, we study a set of predictors of query performance, which can be generated prior to the retrieval process. The linear and non-parametric correlations of the predictors with query performance are thoroughly assessed on the TREC disk4 and disk5 (minus CR) collections. According to the results, some of the proposed predictors have significant correlation with query performance, showing that these predictors can be useful to infer query performance in practical applications. 1

Ben He; Iadh Ounis

2004-01-01T23:59:59.000Z

377

Learning to suggest: a machine learning framework for ranking query suggestions  

Science Conference Proceedings (OSTI)

We consider the task of suggesting related queries to users after they issue their initial query to a web search engine. We propose a machine learning approach to learn the probability that a user may find a follow-up query both useful and relevant, ... Keywords: machine learning, query log mining, query suggestion, search assistance

Umut Ozertem; Olivier Chapelle; Pinar Donmez; Emre Velipasaoglu

2012-08-01T23:59:59.000Z

378

Hourly analysis of a very large topically categorized web query log  

Science Conference Proceedings (OSTI)

We review a query log of hundreds of millions of queries that constitute the total query traffic for an entire week of a general-purpose commercial web search service. Previously, query logs have been studied from a single, cumulative view. In contrast, ... Keywords: query log analysis, web search

Steven M. Beitzel; Eric C. Jensen; Abdur Chowdhury; David Grossman; Ophir Frieder

2004-07-01T23:59:59.000Z

379

Continuous K-Nearest Neighbor Query for Moving Objects with Uncertain Velocity  

Science Conference Proceedings (OSTI)

One of the most important queries in spatio-temporal databases that aim at managing moving objects efficiently is the continuous K-nearest neighbor (CKNN) query. A CKNN query is to retrieve the K-nearest neighbors (KNNs) ... Keywords: K-nearest neighbors, continuous K-nearest neighbor query, moving objects, moving query object, spatio-temporal databases

Yuan-Ko Huang; Chao-Chun Chen; Chiang Lee

2009-03-01T23:59:59.000Z

380

Say What? Why users choose to speak their web queries Maryam Kamvar, Doug Beeferman  

E-Print Network (OSTI)

a higher probability of being typed than shorter queries. Index Terms: speech, voice, search, Google, query of voice web search (where the query is entered by speaking rather than by keyboard) is sparse, most likely and time in entering their query. Thus, in terms of query entry difficulty, we would expect the benefit

Pregibon, Daryl

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


381

Information Retrieval manuscript No. (will be inserted by the editor) When Do People Use Query Suggestion? A Query Suggestion Log Analysis  

E-Print Network (OSTI)

(Authors ’ version. The final publication is available at www.springerlink.com.) Abstract Query suggestion, which enables the user to revise a query with a single click, has become one of the most fundamental features of Web search engines. However, it has not been clear what circumstances cause the user to turn to query suggestion. In order to investigate when and how the user uses query suggestion, we analyzed three kinds of data sets obtained from a major commercial Web search engine, comprising approximately 126 million unique queries, 876 million query suggestions and 306 million action patterns of users. Our analysis shows that query suggestions are often used (1) when the original query is a rare query; (2) when the original query is a single-term query; (3) when query suggestions are unambiguous; (4) when query suggestions are generalizations or error corrections of the original query; and (5) after the user has clicked on several URLs in the first search result page. Our results suggest that search engines should provide better assistance especially when rare or single-term queries are input, and that they should dynamically provide query suggestions according to the searcher’s current state.

Katsumi Tanaka; Tetsuya Sakai

2012-01-01T23:59:59.000Z

382

Querying for Feature Extraction and Visualization in Climate Modeling  

SciTech Connect

The ultimate goal of data visualization is to clearly portray features relevant to the problem being studied. This goal can be realized only if users can effectively communicate to the visualization software what features are of interest. To this end, we describe in this paper two query languages used by scientists to locate and visually emphasize relevant data in both space and time. These languages offer descriptive feedback and interactive refinement of query parameters, which are essential in any framework supporting queries of arbitrary complexity. We apply these languages to extract features of interest from climate model results and describe how they support rapid feature extraction from large datasets.

Johnson, C. Ryan [University of Tennessee, Knoxville (UTK); Glatter, Markus [University of Tennessee, Knoxville (UTK); Kendall, Wesley [University of Tennessee, Knoxville (UTK); Huang, Jian [University of Tennessee, Knoxville (UTK); Hoffman, Forrest M [ORNL

2009-01-01T23:59:59.000Z

383

Dynamic plan migration for snapshot-equivalent continuous queries in data stream systems  

Science Conference Proceedings (OSTI)

A data stream management system executes a large number of continuous queries in parallel. As stream characteristics and query workload change over time, the plan initially installed for a continuous query may become inefficient. As a consequence, the ...

Jürgen Krämer; Yin Yang; Michael Cammert; Bernhard Seeger; Dimitris Papadias

2006-03-01T23:59:59.000Z

384

HDF5-FastQuery: An API for Simplifying Access to Data Storage,Retrieval, Indexing and Querying  

SciTech Connect

This work focuses on research and development activities that bridge a gap between fundamental data management technology index, query, storage and retrieval and use of such technology in computational and computer science algorithms and applications. The work has resulted in a streamlined applications programming interface (API) that simplifies data storage and retrieval using the HDF5 data I/O library, and eases use of the FastBit compressed bitmap indexing software for data indexing/querying. The API, which we call HDF5-FastQuery, will have broad applications in domain sciences as well as associated data analysis and visualization applications.

Bethel, E. Wes; Gosink, Luke; Shalf, John; Stockinger, Kurt; Wu,Kesheng

2006-06-15T23:59:59.000Z

385

Multiple Example Queries in Content-Based Image Retrieval  

Science Conference Proceedings (OSTI)

Content-Based Image Retrieval (cbir) is the practical class of techniques used for information retrieval from large image collections. Many CBIR systems allow users to specify their information need by providing an example image. This query-by-example ...

Seyed M. M. Tahaghoghi; James A. Thom; Hugh E. Williams

2002-09-01T23:59:59.000Z

386

TOP-K projection queries for probabilistic business processes  

Science Conference Proceedings (OSTI)

A Business Process (BP) consists of some business activities undertaken by one or more organizations in pursuit of some business goal. Tools for querying and analyzing BP specifications are extremely valuable for companies. In particular, given a BP ...

Daniel Deutch; Tova Milo

2009-03-01T23:59:59.000Z

387

Processing Private Queries over Untrusted Data Cloud through Privacy Homomorphism  

E-Print Network (OSTI)

Tong, Hong Kong SAR, China {haibo,xujl,csren,bchoi}@comp.hkbu.edu.hk Abstract--Query processing directory and another on anti-diabetic drugs, together give a higher confidence that the user is probably

Xu, Jianliang

388

Adaptive Support of Range Queries via Push-Pull Algorithms  

Science Conference Proceedings (OSTI)

In many real time interactive simulations the problem of interest management is that of filtering updates through application-specified range queries. This "associative' form of memory access is often implemented more simply as a reference memory access ...

Rob Minson; Georgios Theodoropoulos

2007-06-01T23:59:59.000Z

389

Using semantic knowledge to improve web query processing  

Science Conference Proceedings (OSTI)

Although search engines are very useful for obtaining information from the World Wide Web, users still have problems obtaining the most relevant information when processing their web queries. Prior research has attempted to use different types of knowledge ...

Jordi Conesa; Veda C. Storey; Vijayan Sugumaran

2006-05-01T23:59:59.000Z

390

Intuitive Interaction with Encrypted Query Execution in DataStorm  

Science Conference Proceedings (OSTI)

The encrypted execution of database queries promises powerful security protections, however users are currently unlikely to benefit without significant expertise. In this demonstration, we illustrate a simple workflow enabling users to design secure ...

Ken Smith; Ameet Kini; William Wang; Chris Wolf; M. David Allen; Andrew Sillers

2012-04-01T23:59:59.000Z

391

Processing nested complex sequence pattern queries over event streams  

Science Conference Proceedings (OSTI)

Complex event processing (CEP) has become increasingly important for tracking and monitoring applications ranging from health care, supply chain management to surveillance. These monitoring applications submit complex event queries to track sequences ...

Mo Liu; Medhabi Ray; Elke A. Rundensteiner; Daniel J. Dougherty; Chetan Gupta; Song Wang; Ismail Ari; Abhay Mehta

2010-09-01T23:59:59.000Z

392

EIA-176 Query System 2007 - Energy Information Administration  

U.S. Energy Information Administration (EIA)

You may download the data tables if you already have Microsoft Access 2000-2003 on your computer or download the query system via a zip file if you do not have ...

393

Query reformulation and refinement using NLP-based sentence clustering  

Science Conference Proceedings (OSTI)

We have developed an interactive query refinement tool that helps users search a knowledge base for solutions to problems with electronic equipment. The system is targeted towards non-technical users, who are often unable to formulate precise problem ...

Frédéric Roulland; Aaron Kaplan; Stefania Castellani; Claude Roux; Antonietta Grasso; Karin Pettersson; Jacki O'Neill

2007-04-01T23:59:59.000Z

394

Alta Vista: Simple Query "merde d'alors" - CECM  

E-Print Network (OSTI)

Tip: To use all these apples: +apple pie tart cookie torte muffin. Ignored: merde d alors:0. No documents match the query. The term does not appear in the index.

395

Form EIA-176 Query System Getting Started Guide Version 2  

U.S. Energy Information Administration (EIA)

1.0 Introduction 1.1 Purpose and Functions The EIA-176 Query System is a PC-based system for users to produce reports and extract data from the Energy Information ...

396

EIA 176 Query System, 2001 - Energy Information Administration  

U.S. Energy Information Administration (EIA)

The EIA-176 Query system is a Windows-based system which runs under Windows operating systems 95, 98, 2000, NT - 4.0 Service Pack 3 or later.

397

Form EIA-176 Query System - Energy Information Administration  

U.S. Energy Information Administration (EIA)

1.0 Introduction 1.1 Purpose and Functions The EIA-176 Query System is a PC-based system for users to produce reports and extract data from the Energy Information ...

398

On Graph Based Interaction for Semantic Query Languages  

Science Conference Proceedings (OSTI)

In the last years, several proposals have been presented concerning graphical query languages working on diagrammatic representations of semantic data models. Such proposals are mainly based on two different user interaction modalities, i.e., to allow ...

Giuseppe Santucci

1996-09-01T23:59:59.000Z

399

Appendix B – Pre-Selected Query Items - U.S. Energy ...  

U.S. Energy Information Administration (EIA)

Appendix B – Pre-Selected Query Items Description Memo Units Answers to Question in Part II about Alternative Fuel Vehicles This Query has the answers from

400

High Performance Visualization using Query-Driven Visualizationand Analytics  

Science Conference Proceedings (OSTI)

Query-driven visualization and analytics is a unique approach for high-performance visualization that offers new capabilities for knowledge discovery and hypothesis testing. The new capabilities akin to finding needles in haystacks are the result of combining technologies from the fields of scientific visualization and scientific data management. This approach is crucial for rapid data analysis and visualization in the petascale regime. This article describes how query-driven visualization is applied to a hero-sized network traffic analysis problem.

Bethel, E. Wes; Campbell, Scott; Dart, Eli; Shalf, John; Stockinger, Kurt; Wu, Kesheng

2006-06-15T23:59:59.000Z

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


401

Query Routing in Large-scale Digital Library Systems  

E-Print Network (OSTI)

Modern digital libraries require user-friendly and yet responsive access to the rapidly growing, heterogeneous, and distributed collection of information sources. However, the increasing volume and diversity of digital information available online have led to a growing problem that conventional data management systems do not have, namely #nding which information sources out of many candidate choices are the most relevant to answer a given user query.We refer to this problem as the query routing problem.

Ling Liu

1997-01-01T23:59:59.000Z

402

Comparing crowd-based, game-based, and machine-based approaches in initial query and query refinement tasks  

Science Conference Proceedings (OSTI)

Human computation techniques have demonstrated their ability to accomplish portions of tasks that machine-based techniques find difficult. Query refinement is a task that may benefit from human involvement. We conduct an experiment that evaluates the ...

Christopher G. Harris; Padmini Srinivasan

2013-03-01T23:59:59.000Z

403

Hourly analysis of a very large topically categorized web query log  

E-Print Network (OSTI)

We review a query log of hundreds of millions of queries that constitute the total query traffic for an entire week of a generalpurpose commercial web search service. Previously, query logs have been studied from a single, cumulative view. In contrast, our analysis shows changes in popularity and uniqueness of topically categorized queries across the hours of the day. We examine query traffic on an hourly basis by matching it against lists of queries that have been topically pre-categorized by human editors. This represents 13 % of the query traffic. We show that query traffic from particular topical categories differs both from the query stream as a whole and from other categories. This analysis provides valuable insight for improving retrieval effectiveness and efficiency. It is also relevant to the development of enhanced query disambiguation, routing, and caching algorithms.

Steven M. Beitzel; Eric C. Jensen; Abdur Chowdhury; David Grossman; Ophir Frieder

2004-01-01T23:59:59.000Z

404

Parallel Index and Query for Large Scale Data Analysis  

SciTech Connect

Modern scientific datasets present numerous data management and analysis challenges. State-of-the-art index and query technologies are critical for facilitating interactive exploration of large datasets, but numerous challenges remain in terms of designing a system for process- ing general scientific datasets. The system needs to be able to run on distributed multi-core platforms, efficiently utilize underlying I/O infrastructure, and scale to massive datasets. We present FastQuery, a novel software framework that address these challenges. FastQuery utilizes a state-of-the-art index and query technology (FastBit) and is designed to process mas- sive datasets on modern supercomputing platforms. We apply FastQuery to processing of a massive 50TB dataset generated by a large scale accelerator modeling code. We demonstrate the scalability of the tool to 11,520 cores. Motivated by the scientific need to search for inter- esting particles in this dataset, we use our framework to reduce search time from hours to tens of seconds.

Chou, Jerry; Wu, Kesheng; Ruebel, Oliver; Howison, Mark; Qiang, Ji; Prabhat,; Austin, Brian; Bethel, E. Wes; Ryne, Rob D.; Shoshani, Arie

2011-07-18T23:59:59.000Z

405

On concurrency control in sliding window queries over data streams  

E-Print Network (OSTI)

Work done while the author was visiting the University of Waterloo. Data stream systems execute a dynamic workload of long-running and one-time queries, with the streaming inputs typically bounded by sliding windows. For efficiency, windows may be advanced periodically by replacing the oldest part of the window with a batch of newly arrived data. Existing work on stream processing assumes that a window cannot be advanced while it is being accessed by a query. In this paper, we argue that concurrent processing of queries (reads) and window-slides (writes) is required by data stream systems in order to allow prioritized query scheduling and improve the freshness of answers. We prove that the traditional notion of conflict serializability is insufficient in this context and define stronger isolation levels that restrict the allowed serialization orders. We also design and experimentally evaluate a transaction scheduler that efficiently enforces the new isolation levels by taking advantage of the access patterns of sliding window queries. 1

Lukasz Golab; Kumar Gaurav Bijay; M. Tamer Özsu

2006-01-01T23:59:59.000Z

406

Answering natural language queries over linked data graphs: a distributional semantics approach  

Science Conference Proceedings (OSTI)

This paper demonstrates Treo, a natural language query mechanism for Linked Data graphs. The approach uses a distributional semantic vector space model to semantically match user query terms with data, supporting vocabulary-independent (or ... Keywords: distributional-compositional semantics, knowledge graphs, natural language queries, schema-agnostic queries, semantic search

André Freitas; Fabrício F. de Faria; Seán O'Riain; Edward Curry

2013-07-01T23:59:59.000Z

407

Interpretation of coordinations, compound generation, and result fusion for query variants  

Science Conference Proceedings (OSTI)

We investigate interpreting coordinations (e.g. word sequences connected with coordinating conjunctions such as "and" and "or") as logical disjunctions of terms to generate a set of disjunctionfree query variants for information retrieval (IR) queries. ... Keywords: compounds, query structure, query variants, result set fusion

Johannes Leveling

2013-07-01T23:59:59.000Z

408

Extensible/Rule Based Query Rewrite Optimization in Starburst Hamid Pirahesh  

E-Print Network (OSTI)

@cs.berkeley.edu, hasan@hpl.hp.com Abstract This paper describes the Query Rewrite facility of the Starburst extensible, suggesting that Query Rewrite in general --- and these rewrite rules in particular --- are an essential step during Query Rewrite. Although it is accepted doctrine that query languages should be declarative, we

Hellerstein, Joseph M.

409

SavvySearch: A MetaSearch Engine that Learns which Search Engines to Query  

E-Print Network (OSTI)

(query terms) and options for the search. Users typically enter two query terms. The options cover tracks long term performance of search engines on specific query terms to determine which are appropriate the interface for us. 3 #12; Figure 1: User interface to SavvySearch for entering a query 4 #12; Concurrency has

Howe, Adele E.

410

T-703: Cisco Unified Communications Manager Open Query Interface Lets  

NLE Websites -- All DOE Office Websites (Extended Search)

703: Cisco Unified Communications Manager Open Query Interface 703: Cisco Unified Communications Manager Open Query Interface Lets Remote Users Obtain Database Contents T-703: Cisco Unified Communications Manager Open Query Interface Lets Remote Users Obtain Database Contents August 26, 2011 - 3:45pm Addthis PROBLEM: A vulnerability was reported in Cisco Unified Communications Manager. A remote user can obtain database contents PLATFORM: Cisco Unified Communications Manager 6.x, 7.x, 8.0, 8.5 ABSTRACT: A remote user can obtain database contents, including authentication credentials. reference LINKS: SecurityTracker Alert ID: 1025971 Cisco Document ID: 113190 IMPACT ASSESSMENT: High Discussion: A vulnerability was reported in Cisco Unified Communications Manager. A remote user can obtain database contents. A remote user can access an open

411

Effective Graph Clustering for Path Queries in Digital Map Databases  

E-Print Network (OSTI)

In this paper, we present an experimental evaluation of graph clustering strategies in terms of their effectiveness in optimizing I/O for path query processing in digital map databases. Clustering optimization is attractive because it does not incurs any run-time cost, and is complimentary to many of the existing techniques in path query optimization. We first propose a novel graph clustering technique, called Spatial Partition Clustering (SPC), that creates balanced partitions of links based on the spatial proximity of their origin nodes. We then select three alternative clustering techniques from the literature, namely two-way partitioning, approximately topological clustering, and random clustering, to compare their performance in path query processing with SPC. Experimental evaluation indicates that our SPC performs the best for the high-locality graphs (such as GIS maps), whereas the two-way partitioning approach performs the best for no-locality random graphs. 1 Introduction 1....

Yun-Wu Huang; Ning Jing; Elke A. Rundensteiner

1996-01-01T23:59:59.000Z

412

Raising the IQ in full-text searching via intelligent querying  

SciTech Connect

Current Information Retrieval (IR) technologies allow for efficient access to relevant information, provided that user selected query terms coincide with the specific linguistical choices made by the authors whose works constitute the text-base. Therefore, the challenge is to enhance the limited searching capability of state-of-the-practice IR. This can be done either with augmented clients that overcome current server searching deficiencies, or with added capabilities that can augment searching algorithms on the servers. The technology being investigated is that of deductive databases, with a set of new techniques called cooperative answering. This technology utilizes semantic networks to allow for navigation between possible query search term alternatives. The augmented search terms are passed to an IR engine and the results can be compared. The project utilizes the OSTI Environment, Safety and Health Thesaurus to populate the domain specific semantic network and the text base of ES&H related documents from the Facility Profile Information Management System as the domain specific search space.

Kero, R.; Russell, L.; Swietlik, C. [Argonne National Lab., IL (United States); Morgan, C. [USDOE/Environment, Safety and Health (EH-5) (United States); Clayton, C.; Dunlap, K. [USDOE Office of Scientific and Technical Information, Oak Ridge, TN (United States)

1994-11-01T23:59:59.000Z

413

Layered Models Top-Down Querying of Normal Logic Programs  

Science Conference Proceedings (OSTI)

For practical applications, the use of top-down query-driven proof-procedures is essential for an efficient use and computation of answers using Logic Programs as knowledge bases. Additionally, abductive reasoning on demand is intrinsically a top-down ... Keywords: Relevance, Semantics, Smodels, XSB-XASP

Luís Moniz Pereira; Alexandre Miguel Pinto

2009-01-01T23:59:59.000Z

414

Data sampling control, compression and query in sensor networks  

Science Conference Proceedings (OSTI)

Nodes in wireless sensor networks have very limited storage capacity, computing ability and battery power. Node failure and communication link disconnection occur frequently, which means weak services of the network layer. Sensed data is inaccurate which ... Keywords: data accuracy, data compression, data sampling, energy efficiency, power limitation, query, sampling frequency control, sensor networks

Jinbao Li; Jianzhong Li

2007-04-01T23:59:59.000Z

415

Federated Querying Architecture with Clinical & Translational Health IT Application  

Science Conference Proceedings (OSTI)

We present a software architecture that federates data from multiple heterogeneous health informatics data sources owned by multiple organizations. The architecture builds upon state-of-the-art open-source Java and XML frameworks in innovative ways. ... Keywords: Clinical and translational health informatics, Federated query, Heterogeneous data sources, OSGi enterprise service bus, Web services

Oren E. Livne; N. Dustin Schultz; Scott P. Narus

2011-10-01T23:59:59.000Z

416

Towards the taxonomy-oriented categorization of yellow pages queries  

Science Conference Proceedings (OSTI)

Yellow pages search is a popular service that provides a means for finding businesses close to particular locations. The efficient search of yellow pages is becoming a rapidly evolving research area. The underlying data maintained in yellow pages search ... Keywords: Yellow pages query categorization, category filter, category mapping function, flexible framework

Zhisheng Li; Xiangye Xiao; Meng Wang; Chong Wang; Xufa Wang; Xing Xie

2012-03-01T23:59:59.000Z

417

Query-Independent learning to rank for RDF entity search  

Science Conference Proceedings (OSTI)

The amount of structured data is growing rapidly. Given a structured query that asks for some entities, the number of matching candidate results is often very high. The problem of ranking these results has gained attention. Because results in ... Keywords: information retrieval, learning to rank, semantic search

Lorand Dali; Blaž Fortuna; Thanh Tran Duc; Dunja Mladeni?

2012-05-01T23:59:59.000Z

418

DATA CONCERN AWARE QUERYING FOR THE INTEGRATION OF DATA SERVICES  

E-Print Network (OSTI)

DATA CONCERN AWARE QUERYING FOR THE INTEGRATION OF DATA SERVICES Muhammad Intizar Ali, Reinhard,dustdar}@infosys.tuwien.ac.at Keywords: Data Services, Database as a Service, Data Services Integration, Data Concerns, XQuery. Abstract: There is an increasing trend for organizations to publish data over the web using data services. The published data

Dustdar, Schahram

419

Integrating implicit answers with object-oriented queries  

E-Print Network (OSTI)

Queries in object-oriented datab;Lqcs are formulated against a class and retrieve instnnccls of the class sat,is-fying a certain predicate on the att,riblltes of the class. The presence of a class hierarchy, an integral part of any object-oriented data model, allows answers to be expressed implicitly in terms of classes and instances. This enables answers to be provided at different levels of abstraction. Shum and Muntz [SM88] presented a way of providing implicit expressions based on a taxonomy defined over the database. The algorithm presented in [SM88] is optimal in the length of the answer but the clarity of the answer is often poor. In this paper, the fo-cus is on coherent answers: implicit answers that are not necessarily optimal in the number of terms but are easy to comprehend. We show that a uniqlle coherent answer can be obtained efficiently in a top down nlanncr. Since the objective is to provide cohcrcnt, answers, and user queries are formulated by means of query operators to access the database, the standard query operators are redefined to obtain and manipulate coherent answers. Coherent answers are useful in coping with information complexity as they allow answers to be represented ab-stractly and are also a useful rctprescntation tool for complex information systems. 1

Hava T. Siegelmann

1991-01-01T23:59:59.000Z

420

Optimizing RDF(S) queries on cloud platforms  

Science Conference Proceedings (OSTI)

Scalable processing of Semantic Web queries has become a critical need given the rapid upward trend in availability of Semantic Web data. The MapReduce paradigm is emerging as a platform of choice for large scale data processing and analytics due to ... Keywords: hadoop, mapreduce, rdf(s), sparql

HyeongSik Kim, Padmashree Ravindra, Kemafor Anyanwu

2013-05-01T23:59:59.000Z

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


421

Scalable in situ scientific data encoding for analytical query processing  

Science Conference Proceedings (OSTI)

The process of scientific data analysis in high-performance computing environments has been evolving along with the advancement of computing capabilities. With the onset of exascale computing, the increasing gap between compute performance and I/O bandwidth ... Keywords: compression, exascale computing, indexing, query processing

Sriram Lakshminarasimhan; David A. Boyuka; Saurabh V. Pendse; Xiaocheng Zou; John Jenkins; Venkatram Vishwanath; Michael E. Papka; Nagiza F. Samatova

2013-06-01T23:59:59.000Z

422

Query and Predicate Emptiness in Description Logics Franz Baader  

E-Print Network (OSTI)

for basic members of the ALC family to un- decidable for ALC extended with functional roles (ALCF). Note for ALCF, which should be contrasted with the decidability of query entailment and containment in this DL with and without the UNA. An analogous statement fails for ALCF, e.g. because the ABox A = {f(a, b), f(a, b )}, f

Wolter, Frank

423

Mining Query Logs: Turning Search Usage Data into Knowledge  

Science Conference Proceedings (OSTI)

Web search engines have stored in their logs information about users since they started to operate. This information often serves many purposes. The primary focus of this survey is on introducing to the discipline of query mining by showing its foundations ...

Fabrizio Silvestri

2010-01-01T23:59:59.000Z

424

CQ-Buddy: Harnessing Peers For Distributed Continuous Query Processing  

E-Print Network (OSTI)

In this paper, we present the design and evaluation of CQ-Buddy, a peer-to-peer (p2p) continuous query (CQ) processing system that is distributed, and highly-scalable. CQ-Buddy exploits the differences in capabilities ...

Ng, Wee Siong

425

Secure quantum private information retrieval using phase-encoded queries  

Science Conference Proceedings (OSTI)

We propose a quantum solution to the classical private information retrieval (PIR) problem, which allows one to query a database in a private manner. The protocol offers privacy thresholds and allows the user to obtain information from a database in a way that offers the potential adversary, in this model the database owner, no possibility of deterministically establishing the query contents. This protocol may also be viewed as a solution to the symmetrically private information retrieval problem in that it can offer database security (inability for a querying user to steal its contents). Compared to classical solutions, the protocol offers substantial improvement in terms of communication complexity. In comparison with the recent quantum private queries [Phys. Rev. Lett. 100, 230502 (2008)] protocol, it is more efficient in terms of communication complexity and the number of rounds, while offering a clear privacy parameter. We discuss the security of the protocol and analyze its strengths and conclude that using this technique makes it challenging to obtain the unconditional (in the information-theoretic sense) privacy degree; nevertheless, in addition to being simple, the protocol still offers a privacy level. The oracle used in the protocol is inspired both by the classical computational PIR solutions as well as the Deutsch-Jozsa oracle.

Olejnik, Lukasz [CERN, 1211 Geneva 23, Switzerland and Poznan Supercomputing and Networking Center, Noskowskiego 12/14, PL-61-704 Poznan (Poland)

2011-08-15T23:59:59.000Z

426

Mining web query logs to analyze political issues  

Science Conference Proceedings (OSTI)

We present a novel approach to using anonymized web search query logs to analyze and visualize political issues. Our starting point is a list of politically annotated blogs (left vs. right). We use this list to assign a numerical political leaning to ... Keywords: opinion mining and sentiment analysis, partisanship, political leaning, web search logs

Ingmar Weber; Venkata Rama Kiran Garimella; Erik Borra

2012-06-01T23:59:59.000Z

427

Selectivity Estimation of Window Queries for Line Segment Datasets  

E-Print Network (OSTI)

Intl. Conf. on Information and Knowledge Management, pages 490--499, Washington, DC, 1993. [11] J 214--221, Washington, DC, 1993. [13] G. Proietti and C. Faloutsos. Accurate modeling of region dataSelectivity Estimation of Window Queries for Line Segment Datasets Guido Proietti 1 Christos

428

Maximizing Throughput for Queries over Streaming Sensor Data  

E-Print Network (OSTI)

of Computer Science The George Washington University Washington, DC, USA Email: {joegomes throughput for sliding window based multi-join queries over con- tinuous sensor data streams. We develop joining two unbounded streams. Therefore it is more sensible and useful to impose window predicates

Choi, Hyeong-Ah

429

Database design and querying within the fuzzy semantic model  

Science Conference Proceedings (OSTI)

Fuzzy semantic model (FSM) is a data model that uses basic concepts of semantic modeling and supports handling fuzziness, uncertainty and imprecision of real-world at the attribute, entity and class levels. The paper presents the principles and constructs ... Keywords: Database design, Flexible querying, Fuzzy database, Semantic modeling

Rafik Bouaziz; Salem Chakhar; Vincent Mousseau; Sudha Ram; Abdelkader Telmoudi

2007-11-01T23:59:59.000Z

430

Benefits of path summaries in an XML query optimizer supporting multiple access methods  

Science Conference Proceedings (OSTI)

We compare several optimization strategies implemented in an XML query evaluation system. The strategies incorporate the use of path summaries into the query optimizer, and rely on heuristics that exploit data statistics.We present experimental results ...

Attila Barta; Mariano P. Consens; Alberto O. Mendelzon

2005-08-01T23:59:59.000Z

431

Towards a characterization of order-invariant queries over tame structures  

Science Conference Proceedings (OSTI)

This work deals with the expressive power of logics on finite structures with access to an additional “arbitrary” linear order. The queries that can be expressed this way are the order-invariant queries for the logic. For the standard ...

Michael Benedikt; Luc Segoufin

2005-08-01T23:59:59.000Z

432

Natural Gas EIA-176 Query System Readme - U.S. Energy ...  

U.S. Energy Information Administration (EIA)

EIA-176 Query System Readme 1.0 INTRODUCTION TO THE EIA-176 FRONT END QUERY FACILITY This system provides a method of extracting and using the EIA-176 data, and ...

433

Efficient Range and Join Query Processing in Massively Distributed Peer-to-Peer Networks.  

E-Print Network (OSTI)

??Peer-to-peer (P2P) has become a modern distributed computing architecture that supports massively large-scale data management and query processing. Complex query operators such as range operator… (more)

Wang, Qiang

2008-01-01T23:59:59.000Z

434

The Framework for Approximate Queries on Simulation Data  

SciTech Connect

AQSim is a system intended to enable scientists to query and analyze a large volume of scientific simulation data. The system uses the state of the art in approximate query processing techniques to build a novel framework for progressive data analysis. These techniques are used to define a multi-resolution index, where each node contains multiple models of the data. The benefits of these models are two-fold: (1) they are compact representations, reconstructing only the information relevant to the analysis, and (2) the variety of models capture different aspects of the data which may be of interest to the user but are not readily apparent in their raw form. To be able to deal with the data interactively, AQSim allows the scientist to make an informed tradeoff between query response accuracy and time. In this paper, we present the framework of AQSim with a focus on its architectural design. We also show the results from an initial proof-of-concept prototype developed at LLNL. The presented framework is generic enough to handle more than just simulation data.

Abdulla, G; Baldwin, C; Critchlow, T; Kamimura, R; Lee, B; Musick, R; Snapp, R; Tang, N

2001-09-27T23:59:59.000Z

435

FastQuery: A Parallel Indexing System for Scientific Data  

SciTech Connect

Modern scientific datasets present numerous data management and analysis challenges. State-of-the- art index and query technologies such as FastBit can significantly improve accesses to these datasets by augmenting the user data with indexes and other secondary information. However, a challenge is that the indexes assume the relational data model but the scientific data generally follows the array data model. To match the two data models, we design a generic mapping mechanism and implement an efficient input and output interface for reading and writing the data and their corresponding indexes. To take advantage of the emerging many-core architectures, we also develop a parallel strategy for indexing using threading technology. This approach complements our on-going MPI-based parallelization efforts. We demonstrate the flexibility of our software by applying it to two of the most commonly used scientific data formats, HDF5 and NetCDF. We present two case studies using data from a particle accelerator model and a global climate model. We also conducted a detailed performance study using these scientific datasets. The results show that FastQuery speeds up the query time by a factor of 2.5x to 50x, and it reduces the indexing time by a factor of 16 on 24 cores.

Chou, Jerry; Wu, Kesheng; Prabhat,

2011-07-29T23:59:59.000Z

436

Energy and quality aware query processing in wireless sensor database systems  

Science Conference Proceedings (OSTI)

Query processing has been studied extensively in traditional database systems. However, few existing methods can be directly applied to wireless sensor database systems (WSDSs) due to their characteristics, such as decentralized nature, limited computational ... Keywords: Energy reservation, Energy-efficiency, Imagine chain, Multipath routing, Query optimization, Query processing, Space vector model, Wireless sensor database system, k-Partial cover set problem

Qingchun Ren; Qilian Liang

2007-05-01T23:59:59.000Z

437

Analysis of multiple query reformulations on the web: The interactive information retrieval context  

Science Conference Proceedings (OSTI)

This study examines the facets and patterns of multiple Web query reformulations with a focus on reformulation sequences. Based on IR interaction models, it was presumed that query reformulation is the product of the interaction between the user and ... Keywords: Interactive information retrieval, Query reformulation, Web search engine, Web searching

Soo Young Rieh; Hong (Iris) Xie

2006-05-01T23:59:59.000Z

438

Dependency-aware reordering for parallelizing query optimization in multi-core CPUs  

Science Conference Proceedings (OSTI)

The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evaluating redundant sub-plans. The number of alternative QEPs ... Keywords: multi-cores, parallel databases, query optimization

Wook-Shin Han; Jinsoo Lee

2009-06-01T23:59:59.000Z

439

"I know what you did last summer": query logs and user privacy  

Science Conference Proceedings (OSTI)

We investigate the subtle cues to user identity that may be exploited in attacks on the privacy of users in web search query logs. We study the application of simple classifiers to map a sequence of queries into the gender, age, and location of the user ... Keywords: k-anonymity, privacy, query log analysis

Rosie Jones; Ravi Kumar; Bo Pang; Andrew Tomkins

2007-11-01T23:59:59.000Z

440

Efficient processing of multiple continuous skyline queries over a data stream  

Science Conference Proceedings (OSTI)

Given a set of data objects, the skyline query returns the objects that are not dominated by others. Although skyline computation has been studied extensively for static data, there has been relatively less work on data streams. Recently, a few methods ... Keywords: Continuous query, Data stream, Multiple skyline query

Yu Won Lee; Ki Yong Lee; Myoung Ho Kim

2013-02-01T23:59:59.000Z

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


441

On efficiently processing nearest neighbor queries in a loosely coupled set of data sources  

Science Conference Proceedings (OSTI)

We propose a family of algorithms for processing nearest neighbor (NN) queries in an integration middleware that provides federated access to numerous loosely coupled, autonomous data sources connected through the internet. Previous approaches for parallel ... Keywords: data integration, distributed query processing, federated database system, kNN, nearest neighbors, parallel query processing

Thomas Schwarz; Markus Iofcea; Matthias Grossmann; Nicola Hönle; Daniela Nicklas; Bernhard Mitschang

2004-11-01T23:59:59.000Z

442

Blind chance: on potential trust friends query in mobile social networks  

Science Conference Proceedings (OSTI)

Potential-Trust-Friends-Query is an important query in mobile social network, as it enables users to discover and interact with others happen to be in their physical vicinity. In our context, we attempt to find top-k mobile users for such query. ... Keywords: check-in history, mobile social network, potential friends, trust

Jinzeng Zhang, Xiaofeng Meng

2013-06-01T23:59:59.000Z

443

Semantics and implementation of continuous sliding window queries over data streams  

Science Conference Proceedings (OSTI)

In recent years the processing of continuous queries over potentially infinite data streams has attracted a lot of research attention. We observed that the majority of work addresses individual stream operations and system-related issues rather than ... Keywords: Semantics, continuous queries, data streams, query optimization

Jürgen Krämer; Bernhard Seeger

2009-04-01T23:59:59.000Z

444

A Query-based Pre-retrieval Model Selection Approach to Information Retrieval  

E-Print Network (OSTI)

A Query-based Pre-retrieval Model Selection Approach to Information Retrieval Ben He and Iadh Ounis to the same cluster. 1 Introduction An information retrieval (IR) system receives a query from the user}@dcs.gla.ac.uk Abstract In this paper, we propose a query-based pre-retrieval approach to the model selection problem

Jose, Joemon M.

445

Applying Heuristics to Improve A Genetic Query Optimisation Process in Information Retrieval  

E-Print Network (OSTI)

Applying Heuristics to Improve A Genetic Query Optimisation Process in Information Retrieval L@irit.fr Abstract This work presents a genetic approach for query optimisation in information retrieval the genetic exploration process to the information retrieval task. Experiments with AP documents and queries

Paris-Sud XI, Université de

446

Efficient discrete-time simulations of continuous-time quantum query algorithms  

E-Print Network (OSTI)

The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuously in time. Interesting algorithms have been discovered in this model, such as an algorithm for evaluating nand trees more efficiently than any classical algorithm. Subsequent work has shown that there also exists an efficient algorithm for nand trees in the discrete query model; however, there is no efficient conversion known for continuous-time query algorithms for arbitrary problems. We show that any quantum algorithm in the continuous-time query model whose total query time is T can be simulated by a quantum algorithm in the discrete query model that makes O[T log(T) / log(log(T))] queries. This is the first upper bound that is independent of the driving operations (i.e., it holds even if the norm of the driving Hamiltonian is very large). A corollary is that any lower bound of T queries for a problem in the discrete-time query model immediately carries over to a lower bound of \\Omega[T log(log(T))/log (T)] in the continuous-time query model.

R. Cleve; D. Gottesman; M. Mosca; R. D. Somma; D. L. Yonge-Mallo

2008-11-26T23:59:59.000Z

447

Evaluation of a flowchart-based EHR query system: A case study of RetroGuide  

Science Conference Proceedings (OSTI)

Provision of query systems which are intuitive for non-experts has been recognized as an important informatics challenge. We developed a prototype of a flowchart-based analytical framework called RetroGuide that enables non-experts to formulate query ... Keywords: Biomedical informatics, Data warehouse, Evaluation, Informatics, Mixed-method, Query system, RetroGuide, SQL

Vojtech Huser; Scott P. Narus; Roberto A. Rocha

2010-02-01T23:59:59.000Z

448

Ontology-driven relational query formulation using the semantic and assertional capabilities of OWL-DL  

Science Conference Proceedings (OSTI)

This work investigates the extent to which domain knowledge, expressed in a domain ontology, can assist end-users in formulating relational queries that can be executed over a complex relational database. In this regard, an ontology-driven query formulation ... Keywords: Data retrieval, Domain knowledge, Information systems, Ontology, Query formulation

K. Munir; M. Odeh; R. Mcclatchey

2012-11-01T23:59:59.000Z

449

A safe-exit approach for efficient network-based moving range queries  

Science Conference Proceedings (OSTI)

Query processing on road networks has been extensively studied in recent years. However, the processing of moving queries on road networks has received little attention. This paper studies the efficient processing of moving range queries on road networks. ... Keywords: Spatial, Temporal databases

Duncan Yung; Man Lung Yiu; Eric Lo

2012-02-01T23:59:59.000Z

450

An Energy Efficient Path Finding Query Protocol in Wireless Sensor Networks  

Science Conference Proceedings (OSTI)

In many applications, the query mechanism would co-exist with the data collection at the same time. If these two mechanisms can be combined, the query could utilize some information from the data collection and get benefits on the robustness and stability. ... Keywords: Query, Data Collection, Sharing, Distributed, Self-adapting, CTP

Zhiqi Wang; Liang Chen; Zusheng Zhang; Fengqi Yu

2010-12-01T23:59:59.000Z

451

Automatic Reformulation of Children's Search Queries Maarten van Kalsbeek, Joost de Wit, Dolf Trieschnigg,  

E-Print Network (OSTI)

Terms Algorithms, Human Factors, Design Keywords Automatic Query Expansion, Search Behavior, 1 children may make. Most of the search engines offer only the possibility to enter a Boolean queryAutomatic Reformulation of Children's Search Queries Maarten van Kalsbeek, Joost de Wit, Dolf

Hiemstra, Djoerd

452

Efficient query recommendations in the long tail via center-piece subgraphs  

E-Print Network (OSTI)

We present a recommendation method based on the wellknown concept of center-piece subgraph, that allows for the time/space efficient generation of suggestions also for rare, i.e., long-tail queries. Our method is scalable with respect to both the size of datasets from which the model is computed and the heavy workloads that current web search engines have to deal with. Basically, we relate terms contained into queries with highly correlated queries in a query-flow graph. This enables a novel recommendation generation method able to produce recommendations for approximately 99 % of the workload of a real-world search engine. The method is based on a graph having term nodes, query nodes, and two kinds of connections: term-query and query-query. The first connects a term to the queries in which it is contained, the second connects two query nodes if the likelihood that a user submits the second query after having issued the first one is sufficiently high. On such large graph we need to compute the center-piece subgraph induced by terms contained into queries. In order to reduce the cost of the above computation, we introduce a novel and efficient method based on an inverted index representation of the model. We experiment our solution on two real-world query logs and we show that its effectiveness is comparable (and in some case better) than state-of-the-art methods for head-queries. More importantly, the quality of the recommendations generated remains very high also for long-tail queries, where other methods fail even to produce any suggestion. Finally, we extensively investigate scalability and efficiency issues and we show the viability of our method in real world search engines. 1.

Francesco Bonchi; Raffaele Perego; Hossein Vahabi; Rossano Venturini; Fabrizio Silvestri

2012-01-01T23:59:59.000Z

453

Online query answering with differential privacy: a utility-driven approach using Bayesian inference  

E-Print Network (OSTI)

Data privacy issues frequently and increasingly arise for data sharing and data analysis tasks. In this paper, we study the problem of online query answering under the rigorous differential privacy model. The existing interactive mechanisms for differential privacy can only support a limited number of queries before the accumulated cost of privacy reaches a certain bound. This limitation has greatly hindered their applicability, especially in the scenario where multiple users legitimately need to pose a large number of queries. To minimize the privacy cost and extend the life span of a system, we propose a utility-driven mechanism for online query answering using Bayesian statistical inference. The key idea is to keep track of the query history and use Bayesian inference to answer a new query using previous query answers. The Bayesian inference algorithm provides both optimal point estimation and optimal interval estimation. We formally quantify the error of the inference result to determine if it satisfies t...

Xiao, Yonghui

2012-01-01T23:59:59.000Z

454

QCS: a system for querying, clustering and summarizing documents.  

SciTech Connect

Information retrieval systems consist of many complicated components. Research and development of such systems is often hampered by the difficulty in evaluating how each particular component would behave across multiple systems. We present a novel hybrid information retrieval system--the Query, Cluster, Summarize (QCS) system--which is portable, modular, and permits experimentation with different instantiations of each of the constituent text analysis components. Most importantly, the combination of the three types of components in the QCS design improves retrievals by providing users more focused information organized by topic. We demonstrate the improved performance by a series of experiments using standard test sets from the Document Understanding Conferences (DUC) along with the best known automatic metric for summarization system evaluation, ROUGE. Although the DUC data and evaluations were originally designed to test multidocument summarization, we developed a framework to extend it to the task of evaluation for each of the three components: query, clustering, and summarization. Under this framework, we then demonstrate that the QCS system (end-to-end) achieves performance as good as or better than the best summarization engines. Given a query, QCS retrieves relevant documents, separates the retrieved documents into topic clusters, and creates a single summary for each cluster. In the current implementation, Latent Semantic Indexing is used for retrieval, generalized spherical k-means is used for the document clustering, and a method coupling sentence 'trimming', and a hidden Markov model, followed by a pivoted QR decomposition, is used to create a single extract summary for each cluster. The user interface is designed to provide access to detailed information in a compact and useful format. Our system demonstrates the feasibility of assembling an effective IR system from existing software libraries, the usefulness of the modularity of the design, and the value of this particular combination of modules.

Dunlavy, Daniel M.; Schlesinger, Judith D. (Center for Computing Sciences, Bowie, MD); O'Leary, Dianne P. (University of Maryland, College Park, MD); Conroy, John M. (Center for Computing Sciences, Bowie, MD)

2006-10-01T23:59:59.000Z

455

QCS : a system for querying, clustering, and summarizing documents.  

Science Conference Proceedings (OSTI)

Information retrieval systems consist of many complicated components. Research and development of such systems is often hampered by the difficulty in evaluating how each particular component would behave across multiple systems. We present a novel hybrid information retrieval system--the Query, Cluster, Summarize (QCS) system--which is portable, modular, and permits experimentation with different instantiations of each of the constituent text analysis components. Most importantly, the combination of the three types of components in the QCS design improves retrievals by providing users more focused information organized by topic. We demonstrate the improved performance by a series of experiments using standard test sets from the Document Understanding Conferences (DUC) along with the best known automatic metric for summarization system evaluation, ROUGE. Although the DUC data and evaluations were originally designed to test multidocument summarization, we developed a framework to extend it to the task of evaluation for each of the three components: query, clustering, and summarization. Under this framework, we then demonstrate that the QCS system (end-to-end) achieves performance as good as or better than the best summarization engines. Given a query, QCS retrieves relevant documents, separates the retrieved documents into topic clusters, and creates a single summary for each cluster. In the current implementation, Latent Semantic Indexing is used for retrieval, generalized spherical k-means is used for the document clustering, and a method coupling sentence ''trimming'', and a hidden Markov model, followed by a pivoted QR decomposition, is used to create a single extract summary for each cluster. The user interface is designed to provide access to detailed information in a compact and useful format. Our system demonstrates the feasibility of assembling an effective IR system from existing software libraries, the usefulness of the modularity of the design, and the value of this particular combination of modules.

Dunlavy, Daniel M.

2006-08-01T23:59:59.000Z

456

NAC Ad-Hoc Task Force on Planetary Defense August 17 and 20, 2010 1 NASA ADVISORY COUNCIL (NAC)  

E-Print Network (OSTI)

Reich, Reporter (Nature), Charles Miller, NASA HQ; and Dan McGarthy, Johnson Space Center Task Force in detail the wording and organization of their final report to the NAC, editing previous drafts

457

Greater Caribbean Energy and Environment Future. Ad hoc working group report, Key Biscayne, Florida, October 26-28, 1980  

SciTech Connect

This report of Workshop I (presented in outline form) by the Greater Caribbean Energy and Environment Foundation begin an intensive focus on the energy problems of the Caribbean. The process by which environmental assessments by tropical experts can be successfully integrated into energy decisions is by: (1) international loan institutions requiring or strongly recommending excellent assessments; (2) engineering awareness of total effects of energy projects; (3) governmental environmental consciousness-raising with regard to natural resource value and potential inadvertent and unnecessary resource losses during energy development; and (4) media participation. Section headings in the outline are: preamble; introduction; research tasks: today and twenty years hence; needed research, demonstration and information dissemination projects to get knowledge about Caribbean energy-environment used; summary; recommendations; generalized conclusions; and background literature. (JGB)

Thorhaug, A. (ed.)

1980-01-01T23:59:59.000Z

458

Opportunistic Routing in Ad Hoc Networks: How many relays should there be? What rate should nodes use?  

E-Print Network (OSTI)

Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters blindly broadcast without knowledge of the surrounding nodes, two fundamental design parameters are the node transmission probability and the transmission spectral efficiency. In this paper these parameters are selected to maximize end-to-end performance, characterized by the product of transmitter density, hop distance and rate. Due to the intractability of the problem as stated, an approximation function is examined which proves reasonably accurate. Our results show how the above design parameters should be selected based on inherent system parameters such as the path loss exponent and the noise level.

Blomer, Joseph

2010-01-01T23:59:59.000Z

459

Limitations of ad hoc "SKA+VLBI" configurations & the need to extend SKA to trans-continental dimensions  

E-Print Network (OSTI)

The angular resolution of the proposed Square Kilometre Array, SKA, must be extended towards the milliarcsecond scale if it is to resolve the distant starburst galaxies that are likely to dominate the radio source counts at micro and sub-microJy flux levels. This paper considers the best way of extending SKA's angular resolution towards the milliarcsecond scale. Two possible SKA-VLBI configurations have been investigated and simulated SKA and SKA-VLBI visibility data sets generated. The effects of non-uniform data weighting on the associated images are considered. The results suggest that the preferred option is for SKA to be extended to trans-continental dimensions. By retaining 50% of the array's collecting area within a region no larger than 50 km, the surface brightness sensitivity of the array at arcsec resolution is hardly compromised. In this configuration SKA's capabilities are impressive: in a single 12 hour run, between 100-1000 sources will be simultaneously detected and imaged with arcsecond, sub-arcsecond and milliarcsecond resolution.

M. A. Garrett

1999-08-31T23:59:59.000Z

460

On Secure Key Management in Mobile Ad Hoc Networks Dahai Xu Jeffrey Dwoskin Jianwei Huang Mung Chiang Ruby Lee  

E-Print Network (OSTI)

Chiang Ruby Lee Abstract--It is widely believed that although being more complex, a probabilistic key: dahaixu@research.att.com). J. Dwoskin, M. Chiang and R. Lee are with Department of Electrical Engineering

Chiang, Mung

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


461

Delay-Jitter aware slot assignment for Real-Time applications in wireless multimedia ad hoc sensor networks  

Science Conference Proceedings (OSTI)

This paper presents a distributed time slot assignment algorithm which adopts TDMA as medium access control, specially suited to support applications with tight delay, jitter and throughput requirements in convergecast traffic network, e.g. wireless ... Keywords: Congestion, Delay, Jitter, QoS, Sensor network

Liqiang Tao; Fengqi Yu

2012-09-01T23:59:59.000Z

462

Flashlight Jigsaw: An Exploratory Study of an Ad-Hoc Multi-Player Game on Public Displays  

E-Print Network (OSTI)

and system logs we explored the experiences and behaviors of players and spectators. We also investigated Collage [8] and the Dynamo [11] systems both supported cooperative sharing of information and media, a system that encourages socializing between people around the public display. A variety of input

Toronto, University of

463

MetaBrowser: A combined browsing, query, and analysis tool  

SciTech Connect

The MetaBrowser design is based on the premise that scientists should not be forced to learn new languages or commands for finding the data they are interested in and for selecting subsets of the data for further analysis. Furthermore, there should be a single system that permits browsing, query, and analysis of the data, so that the scientist does not have to switch between systems. The current version for the MetaBrowser was designed for the DOE CEDR (Comprehensive Epidemiological Data Resource) project, but the same principles can apply to other scientific disciplines. Browsing and query should be combined. It is quite natural for a user to explore the information in the database before deciding what subset of the data to select for further analysis. In general, if there is a large number of datasets (i.e. databases) in the system, then the user would want to find out information about the various datasets (called metadata), before choosing one or more datasets for further exploration. Thus, a metadatabase that holds information about datasets in the systems must exist.

Shoshani, A.; Szeto, E.

1991-04-01T23:59:59.000Z

464

Large-Scale Continuous Subgraph Queries on Streams  

SciTech Connect

Graph pattern matching involves finding exact or approximate matches for a query subgraph in a larger graph. It has been studied extensively and has strong applications in domains such as computer vision, computational biology, social networks, security and finance. The problem of exact graph pattern matching is often described in terms of subgraph isomorphism which is NP-complete. The exponential growth in streaming data from online social networks, news and video streams and the continual need for situational awareness motivates a solution for finding patterns in streaming updates. This is also the prime driver for the real-time analytics market. Development of incremental algorithms for graph pattern matching on streaming inputs to a continually evolving graph is a nascent area of research. Some of the challenges associated with this problem are the same as found in continuous query (CQ) evaluation on streaming databases. This paper reviews some of the representative work from the exhaustively researched field of CQ systems and identifies important semantics, constraints and architectural features that are also appropriate for HPC systems performing real-time graph analytics. For each of these features we present a brief discussion of the challenge encountered in the database realm, the approach to the solution and state their relevance in a high-performance, streaming graph processing framework.

Choudhury, Sutanay; Holder, Larry; Chin, George; Feo, John T.

2011-11-30T23:59:59.000Z

465

V-139: Cisco Network Admission Control Input Validation Flaw...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Sensitive Information U-270:Trend Micro Control Manager Input Validation Flaw in Ad Hoc Query Module Lets Remote Users Inject SQL Commands U-015: CiscoWorks Common Services Home...

466

Request an iPortal Account!  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

for collaboration . . . Web conferences without an 85 per month per user fee . . . IDW gives you a view into STARS and STRIPES . . . Train on BI and gain ad hoc query capability...

467

VISIONARY: a visual query language based on the user viewpoint approach  

E-Print Network (OSTI)

Query languages for RDBMSs lack in intuitive understanding; this precludes inexperienced users from taking advantage of them. The adoption of a visual interface can simplify the query formulation process by enabling users to interact with a friendly environment. In this work we propose a visual query language based on a hybrid iconic-diagrammatic paradigm, used for both data and query representation. The external data model is called vision and comprises the visual primitives of concept- represented by the combination of text and icon, and association- represented by a name and a multiplicity for each possible orientation. The external query model is based on the definition of a user viewpoint, which is a perspective for accessing data defined dynamically by selecting a concept of primary interest for formulating each query. 1

Francesca Benzi; Dario Maio; Stefano Rizzi

1996-01-01T23:59:59.000Z

468

Towards Optimal Multi-Dimensional Query Processing with BitmapIndices  

Science Conference Proceedings (OSTI)

Bitmap indices have been widely used in scientific applications and commercial systems for processing complex, multi-dimensional queries where traditional tree-based indices would not work efficiently. This paper studies strategies for minimizing the access costs for processing multi-dimensional queries using bitmap indices with binning. Innovative features of our algorithm include (a) optimally placing the bin boundaries and (b) dynamically reordering the evaluation of the query terms. In addition, we derive several analytical results concerning optimal bin allocation for a probabilistic query model. Our experimental evaluation with real life data shows an average I/O cost improvement of at least a factor of 10 for multi-dimensional queries on datasets from two different applications. Our experiments also indicate that the speedup increases with the number of query dimensions.

Rotem, Doron; Stockinger, Kurt; Wu, Kesheng

2005-09-30T23:59:59.000Z

469

U-038: BIND 9 Resolver crashes after logging an error in query.c |  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

8: BIND 9 Resolver crashes after logging an error in query.c 8: BIND 9 Resolver crashes after logging an error in query.c U-038: BIND 9 Resolver crashes after logging an error in query.c November 16, 2011 - 8:37am Addthis PROBLEM: BIND 9 Resolver crashes after logging an error in query.c. PLATFORM: Multiple version of BIND 9. Specific versions under investigation ABSTRACT: A remote server can cause the target connected client to crash. Organizations across the Internet are reporting crashes interrupting service on BIND 9 nameservers performing recursive queries. Affected servers crash after logging an error in query.c with the following message: "INSIST(! dns_rdataset_isassociated(sigrdataset))" Multiple versions are reported as being affected, including all currently supported release versions of ISC BIND 9. ISC is actively investigating the root cause and

470

V-204: A specially crafted query can cause BIND to terminate abnormally |  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

V-204: A specially crafted query can cause BIND to terminate V-204: A specially crafted query can cause BIND to terminate abnormally V-204: A specially crafted query can cause BIND to terminate abnormally July 27, 2013 - 4:35am Addthis PROBLEM: A specially crafted query that includes malformed rdata can cause named to terminate with an assertion failure while rejecting the malformed query. PLATFORM: BIND 9.7 ABSTRACT: A specially crafted query sent to a BIND nameserver can cause it to crash (terminate abnormally). REFERENCE LINKS: ISC Knowledge Base CVE-2013-4854 IMPACT ASSESSMENT: High DISCUSSION: BIND is an implementation of the Domain Name System (DNS) protocols. Authoritative and recursive servers are equally vulnerable. Intentional exploitation of this condition can cause a denial of service in all nameservers running affected versions of BIND 9. Access Control Lists do

471

Schwinger pair production in AdS2  

E-Print Network (OSTI)

We analyze the pair production of charged particles in two-dimensional Anti-de Sitter space (AdS_2) with a constant, uniform electric field. We compute the production rate both at a semi-classical level, viewing Schwinger pair production as a tunneling event, and at the full quantum level, by extracting the imaginary part of the one-loop amplitude. In contrast to the usual Schwinger pair production in flat space, pair production in AdS_2 requires a sufficiently large electric field E^2> M^2+1/4 in order to overcome the confining effect of the AdS geometry -- put in another way, the presence of an electric field E raises the Breitenlohner-Freedman bound to M^2 > -1/4 + E^2. For E greater than this threshold, the vacuum is unstable to production of charged pairs in the bulk. We expect our results to be helpful in constructing supersymmetric AdS_2 X S^2 perturbative string vacua, which enter in the near-horizon limit of extremal charged black holes. Although the generalized Breitenlohner-Freedman bound is obeyed in these cases, production of BPS particles at threshold is possible and relevant for AdS_2 fragmentation.

B. Pioline; J. Troost

2005-01-20T23:59:59.000Z

472

EIA-176 Query System 2006 - U.S. Energy Information Administration ...  

U.S. Energy Information Administration (EIA)

The query system application is a Windows-based system which runs under Windows operating systems 95, 98, 2000, NT - 4.0 Service Pack 3 or later.

473

Query Expansion Research and Application in Search Engine Based on Concepts Lattice.  

E-Print Network (OSTI)

??Formal concept analysis is increasingly applied to query expansion and data mining problems. In this paper I analyze and compare the current concept lattice construction… (more)

Cui, Jun

2009-01-01T23:59:59.000Z

474

Adaptive Range Counting and Other Frequency-Based Range Query Problems.  

E-Print Network (OSTI)

??We consider variations of range searching in which, given a query range, our goal is to compute some function based on frequencies of points that… (more)

Wilkinson, Bryan T.

2012-01-01T23:59:59.000Z

475

Event-Driven Dynamic Query Model for Sleep Study Outcomes Research.  

E-Print Network (OSTI)

??This research work presents a software solution, called PSG Query System, for sleep study clinicians and researchers as a part of an integrated effort for… (more)

Jain, Sulabh

2012-01-01T23:59:59.000Z

476

Central Charge for AdS_2 Quantum Gravity  

E-Print Network (OSTI)

Two-dimensional Maxwell-dilaton quantum gravity on AdS_2 with radius $\\ell$ and a constant electric field E is studied. In conformal gauge, this is equivalent to a CFT on a strip. In order to maintain consistent boundary conditions, the usual conformal diffeomorphisms must be accompanied by a certain U(1) gauge transformation. The resulting conformal transformations are generated by a twisted stress tensor, which has a central charge $c={3k E^2 \\ell^4/4}$ where k is the level of the U(1) current. This is an AdS_2 analog of the Brown-Henneaux formula $c = 3\\ell/2G$ for the central charge of quantum gravity on AdS_3.

Hartman, Thomas

2009-01-01T23:59:59.000Z

477

Central Charge for AdS_2 Quantum Gravity  

E-Print Network (OSTI)

Two-dimensional Maxwell-dilaton quantum gravity on AdS_2 with radius $\\ell$ and a constant electric field E is studied. In conformal gauge, this is equivalent to a CFT on a strip. In order to maintain consistent boundary conditions, the usual conformal diffeomorphisms must be accompanied by a certain U(1) gauge transformation. The resulting conformal transformations are generated by a twisted stress tensor, which has a central charge $c={3k E^2 \\ell^4/4}$ where k is the level of the U(1) current. This is an AdS_2 analog of the Brown-Henneaux formula $c = 3\\ell/2G$ for the central charge of quantum gravity on AdS_3.

Thomas Hartman; Andrew Strominger

2008-03-25T23:59:59.000Z

478

Post Hoc Evaluation of Hazardous Weather: Snowstorms in the Montréal, Québec, Area in March 2008  

Science Conference Proceedings (OSTI)

The post hoc evaluation of meteorological events that have severe consequences for individuals, property, economic activities, and the environment is a powerful analytical tool. The paper provides a factual and evidence-based analytical framework ...

Jacques Descurieux

2010-01-01T23:59:59.000Z

479

Supergravity at the boundary of AdS supergravity  

Science Conference Proceedings (OSTI)

We give a general analysis of AdS boundary conditions for spin-3/2 Rarita-Schwinger fields and investigate boundary conditions preserving supersymmetry for a graviton multiplet in AdS{sub 4}. Linear Rarita-Schwinger fields in AdS{sub d} are shown to admit mixed Dirichlet-Neumann boundary conditions when their mass is in the range 0{dictionary, Neumann boundary conditions in d=4 supergravity correspond to gauging the superconformal group of the three-dimensional CFT describing M2-branes, while N=1 supersymmetric mixed boundary conditions couple the CFT to N=1 superconformal topologically massive gravity.

Amsel, Aaron J.; Compere, Geoffrey [Department of Physics, University of California, Santa Barbara, California 93106 (United States)

2009-04-15T23:59:59.000Z

480

Compact AdS space, Brane geometry and the AdS/CFT correspondence  

E-Print Network (OSTI)

The AdS/CFT correspondence can be realized in spaces that are globally different but share the same asymptotic behavior. Two known cases are: a compact AdS space and the space generated by a large number of coincident branes. We discuss the physical consistency, in the sense of the Cauchy problem, of these two formulations. We show that the role of the boundary in the compact AdS space is equivalent to that of the flat asymptotic region in the brane space. We also show, by introducing a second coordinate chart for the pure AdS space, that a point at its spatial infinity corresponds to a horizon in the brane system.

Boschi-Filho, H; Boschi-Filho, Henrique; Braga, Nelson R. F.

2002-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "ad hoc query" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


481

Towards musical query-by-semantic-description using the CAL500 data set  

Science Conference Proceedings (OSTI)

Query-by-semantic-description (QBSD)is a natural paradigm for retrieving content from large databases of music. A major impediment to the development of good QBSD systems for music information retrieval has been the lack of a cleanly-labeled, publicly-available, ... Keywords: content-based music information retrieval, query-by-semantic-description, supervised multi-class classification

Douglas Turnbull; Luke Barrington; David Torres; Gert Lanckriet

2007-07-01T23:59:59.000Z

482

Reordering an index to speed query processing without loss of effectiveness  

Science Conference Proceedings (OSTI)

Following Long and Suel, we empirically investigate the importance of document order in search engines which rank documents using a combination of dynamic (query-dependent) and static (query-independent) scores, and use document-at-a-time (DAAT) processing. ... Keywords: efficiency and effectiveness, enterprise search, information retrieval, inverted files

David Hawking; Timothy Jones

2012-12-01T23:59:59.000Z

483

A knowledge infrastructure for intelligent query answering in location-based services  

Science Conference Proceedings (OSTI)

Intelligent query answering in Location-based Services refers to their capability to provide mobile users with personalized and contextualized answers. Personalization is expected to lead to answers that better match user's interests, as inferable from ... Keywords: Context-awareness, Contextualization, Location-based services, Ontology, Personalization, Query answering, User profile

Shijun Yu; Stefano Spaccapietra

2010-07-01T23:59:59.000Z

484

Rapid Development of Web-Based Query Interfaces for XML Datasets with QURSED  

E-Print Network (OSTI)

User Interfaces, XML, Query Interface. 1. INTRODUCTION Web-based query forms and reports (QFRs) allow and reports (QFRs). Each publication element can be classified into one of three types based on its structure, i.e. an article (journal), a book or an inproceedings (conference). While all types of publications

Petropoulos, Michalis

485

Inferring the demographics of search users: social data meets search queries  

Science Conference Proceedings (OSTI)

Knowing users' views and demographic traits offers a great potential for personalizing web search results or related services such as query suggestion and query completion. Such signals however are often only available for a small fraction of search ... Keywords: personalized search, social networks, user demographics

Bin Bi, Milad Shokouhi, Michal Kosinski, Thore Graepel

2013-05-01T23:59:59.000Z

486

Robust runtime optimization and skew-resistant execution of analytical SPARQL queries on pig  

Science Conference Proceedings (OSTI)

We describe a system that incrementally translates SPARQL queries to Pig Latin and executes them on a Hadoop cluster. This system is designed to work efficiently on complex queries with many self-joins over huge datasets, avoiding job failures even in ...

Spyros Kotoulas; Jacopo Urbani; Peter Boncz; Peter Mika

2012-11-01T23:59:59.000Z

487

Weakly-supervised discovery of named entities using web search queries  

Science Conference Proceedings (OSTI)

A seed-based framework for textual information extraction allows for weakly supervised extraction of named entities from anonymized Web search queries. The extraction is guided by a small set of seed named entities, without any need for handcrafted extraction ... Keywords: knowledge acquisition, named entities, query logs, unstructured text, weakly supervised information extraction

Marius Pa?ca

2007-11-01T23:59:59.000Z

488

FICSR: feedback-based inconsistency resolution and query processing on misaligned data sources  

Science Conference Proceedings (OSTI)

A critical reality in data integration is that knowledge from different sources may often be conflicting with each other. Conflict resolutioncan be costly and, if done without proper context, can be ineffective. In this paper, we propose a novel query-driven ... Keywords: conflicts, query processing, reasoning with misaligned data, relevance feedback, taxonomy

Yan Qi; K. Selçuk Candan; Maria Luisa Sapino

2007-06-01T23:59:59.000Z

489

Seeding simulated queries with user-study data forpersonal search evaluation  

Science Conference Proceedings (OSTI)

In this paper we perform a lab-based user study (n=21) of email re-finding behaviour, examining how the characteristics of submitted queries change in different situations. A number of logistic regression models are developed on the query data to explore ... Keywords: email re-finding, evaluation, personal search, user study

David Elsweiler; David E. Losada; José C. Toucedo; Ronald T. Fernandez

2011-07-01T23:59:59.000Z

490

ISABELA-QA: query-driven analytics with ISABELA-compressed extreme-scale scientific data  

Science Conference Proceedings (OSTI)

Efficient analytics of scientific data from extreme-scale simulations is quickly becoming a top-notch priority. The increasing simulation output data sizes demand for a paradigm shift in how analytics is conducted. In this paper, we argue that query-driven ... Keywords: compression, data reduction, data-intensive computing, high performance applications, query-driven analytics

Sriram Lakshminarasimhan; John Jenkins; Isha Arkatkar; Zhenhuan Gong; Hemanth Kolla; Seung-Hoe Ku; Stephane Ethier; Jackie Chen; C. S. Chang; Scott Klasky; Robert Latham; Robert Ross; Nagiza F. Samatova

2011-11-01T23:59:59.000Z

491

CoCache: query processing based on collaborative caching in P2P systems  

Science Conference Proceedings (OSTI)

In this paper, we propose CoCache, a P2P query processing architecture that enables sophisticated optimization techniques. CoCache is different from existing P2P query processing systems in three ways. First, a coordinator overlay network (CON) maintaining ...

Weining Qian; Linhao Xu; Shuigeng Zhou; Aoying Zhou

2005-04-01T23:59:59.000Z

492

Minimizing I/O Costs of Multi-Dimensional Queries with BitmapIndices  

Science Conference Proceedings (OSTI)

Bitmap indices have been widely used in scientific applications and commercial systems for processing complex,multi-dimensional queries where traditional tree-based indices would not work efficiently. A common approach for reducing the size of a bitmap index for high cardinality attributes is to group ranges of values of an attribute into bins and then build a bitmap for each bin rather than a bitmap for each value of the attribute. Binning reduces storage costs,however, results of queries based on bins often require additional filtering for discarding it false positives, i.e., records in the result that do not satisfy the query constraints. This additional filtering,also known as ''candidate checking,'' requires access to the base data on disk and involves significant I/O costs. This paper studies strategies for minimizing the I/O costs for ''candidate checking'' for multi-dimensional queries. This is done by determining the number of bins allocated for each dimension and then placing bin boundaries in optimal locations. Our algorithms use knowledge of data distribution and query workload. We derive several analytical results concerning optimal bin allocation for a probabilistic query model. Our experimental evaluation with real life data shows an average I/O cost improvement of at least a factor of 10 for multi-dimensional queries on datasets from two different applications. Our experiments also indicate that the speedup increases with the number of query dimensions.

Rotem, Doron; Stockinger, Kurt; Wu, Kesheng

2006-03-30T23:59:59.000Z

493

An approach to solve division-like queries in fuzzy object databases  

Science Conference Proceedings (OSTI)

The division operator is well known in the context of fuzzy relational databases. Fuzzy approaches to this operator can be found in the literature to solve flexible queries: these approaches try to compute to which extent each element of a candidate ... Keywords: Division, Flexible queries, Fuzzy object databases, Inclusion

Nicolás Marín; Carlos Molina; Olga Pons; M. Amparo Vila

2012-06-01T23:59:59.000Z

494

Evaluation of top-k OLAP queries using aggregate r–trees  

Science Conference Proceedings (OSTI)

A top-k OLAP query groups measures with respect to some abstraction level of interesting dimensions and selects the k groups with the highest aggregate value. An example of such a query is “find the 10 combinations of product-type ...

Nikos Mamoulis; Spiridon Bakiras; Panos Kalnis

2005-08-01T23:59:59.000Z

495

Group-based Query Learning for rapid diagnosis in time-critical situations  

E-Print Network (OSTI)

In query learning, the goal is to identify an unknown object while minimizing the number of "yes or no" questions (queries) posed about that object. We consider three extensions of this fundamental problem that are motivated by practical considerations in real-world, time-critical identification tasks such as emergency response. First, we consider the problem where the objects are partitioned into groups, and the goal is to identify only the group to which the object belongs. Second, we address the situation where the queries are partitioned into groups, and an algorithm may suggest a group of queries to a human user, who then selects the actual query. Third, we consider the problem of query learning in the presence of persistent query noise, and relate it to group identification. To address these problems we show that a standard algorithm for query learning, known as the splitting algorithm or generalized binary search, may be viewed as a generalization of Shannon-Fano coding. We then extend this result to t...

Bellala, Gowtham; Scott, Clayton

2009-01-01T23:59:59.000Z

496

Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching  

Science Conference Proceedings (OSTI)

Pivot-based algorithms are effective tools for proximity searching in metric spaces. They allow trading space overhead for number of distance evaluations performed at query time. With additional search structures (that pose extra space overhead) they ... Keywords: fixed queries tree, metric spaces, range search, similarity search

Edgar Chávez; José L. Marroquín; Gonzalo Navarro

2001-06-01T23:59:59.000Z

497

Efficient exact edit similarity query processing with the asymmetric signature scheme  

Science Conference Proceedings (OSTI)

Given a query string Q, an edit similarity search finds all strings in a database whose edit distance with Q is no more than a given threshold t. Most existing method answering edit similarity queries rely on a signature scheme to generate candidates ... Keywords: Q-gram, approximate pattern matching, edit distance, similarity join, similarity search

Jianbin Qin; Wei Wang; Yifei Lu; Chuan Xiao; Xuemin Lin

2011-06-01T23:59:59.000Z

498

A Customized Web Search Engine Using a Tiny WebSQL Query Language  

E-Print Network (OSTI)

and indexed to be stored in the search engine's database. When a user enters a #12; 7 search query After the user enters the keywords as the search query, the search engine will perform the search with the stemming, which is the grammatical variation of search terms such as "eat" and "eating". 3. It cannot

499

Shock Wave Collisions and Thermalization in AdS_5  

E-Print Network (OSTI)

We study heavy ion collisions at strong 't Hooft coupling using AdS/CFT correspondence. According to the AdS/CFT dictionary heavy ion collisions correspond to gravitational shock wave collisions in AdS_5. We construct the metric in the forward light cone after the collision perturbatively through expansion of Einstein equations in graviton exchanges. We obtain an analytic expression for the metric including all-order graviton exchanges with one shock wave, while keeping the exchanges with another shock wave at the lowest order. We read off the corresponding energy-momentum tensor of the produced medium. Unfortunately this energy-momentum tensor does not correspond to ideal hydrodynamics, indicating that higher order graviton exchanges are needed to construct the full solution of the problem. We also show that shock waves must completely stop almost immediately after the collision in AdS_5, which, on the field theory side, corresponds to complete nuclear stopping due to strong coupling effects, likely leading to Landau hydrodynamics. Finally, we perform trapped surface analysis of the shock wave collisions demonstrating that a bulk black hole, corresponding to ideal hydrodynamics on the boundary, has to be created in such collisions, thus constructing a proof of thermalization in heavy ion collisions at strong coupling.

Yuri V. Kovchegov

2010-11-02T23:59:59.000Z

500

C-AD Contact List  

NLE Websites -- All DOE Office Websites (Extended Search)

C-AD Organization Chart C-AD Organization Chart IFM North Organization Chart Information Contact Personnel C-AD Committees Meeting Room Reservation Technical Notes Status Information Operating Schedules Scheduling Physicist RHIC-AGS Machine Status RHIC Broadcast Accelerator Performances Department Contact Personnel Chair: Thomas Roser Associate Chair for Accelerators: Wolfram Fischer Associate Chair for Experiment Support & Facilities: Philip Pile Associate Chair for Accelerator R&D: Ilan Ben-Zvi Associate Chair for ESSHQ: Edward Lessard Assistant Chair for Administration: Stephanie LaMontagne Associate Chair for Accelerator Applications & Education: Derek I. Lowenstein Chief Electrical Engineer: Jon Sandberg Chief Mechanical Engineer: Joseph Tuozzolo Administrative Assistant: Lynanne DiFilippo