Sample records for ad hoc queries

  1. Distributed services for mobile ad hoc networks

    E-Print Network [OSTI]

    Cao, Guangtong

    2005-11-01T23:59:59.000Z

    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...

  2. access ad hoc: Topics by E-print Network

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    the channel utilization of multihop wireless networks. Keywords: Mobile ad hoc networks, medium access control, this is not necessarily true in a mobile ad hoc network (MANET)...

  3. IT Licentiate theses Ad Hoc Routing Protocol

    E-Print Network [OSTI]

    Flener, Pierre

    IT Licentiate theses 2005-004 Ad Hoc Routing Protocol Validation OSKAR WIBLING UPPSALA UNIVERSITY SWEDEN Dissertation for the degree of Licentiate of Technology in Computer Science at Uppsala University

  4. Virtual infrastructure for wireless ad hoc networks

    E-Print Network [OSTI]

    Gilbert, Seth, 1976-

    2007-01-01T23:59:59.000Z

    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 ...

  5. Distributed algorithms for mobile ad hoc networks

    E-Print Network [OSTI]

    Malpani, Navneet

    2001-01-01T23:59:59.000Z

    We first present two new leader election algorithms for mobile ad hoc networks. The algorithms ensure that eventually each connected component of the topology graph has exactly one leader. The algorithms are based on a routing algorithm called TORA...

  6. Clock synchronization for mobile ad hoc networks

    E-Print Network [OSTI]

    Chandra, Rajan

    2013-02-22T23:59:59.000Z

    Time Protocol) used in wired networks (e.g. Internet) to Mobile Ad Hoc Networks (MANets). It may also be achieved by developing other algorithms that achieve clock synchronization and may be suitable for MANets. Using the Network Time Protocol (NTP...

  7. Dynamic address allocation protocols for Mobile ad hoc networks

    E-Print Network [OSTI]

    Patchipulusu, Praveena

    2001-01-01T23:59:59.000Z

    Address allocation is an important issue in Mobile ad hoc networks. This thesis proposes solutions to assign unique IP addresses to nodes participating in Mobile ad hoc networks and evaluates the proposed solutions. Address allocation protocols...

  8. Mapping subtasks with multiple versions on an ad hoc grid

    E-Print Network [OSTI]

    Maciejewski, Anthony A.

    Mapping subtasks with multiple versions on an ad hoc grid S. Shivle a , P. Sugavanam a , H; Mapping; Resource allocation; Task scheduling 1. Introduction and problem statement An ad hoc grid; accepted 15 April 2005 Available online 16 June 2005 Abstract An ad hoc grid is a heterogeneous computing

  9. Adaptive Scheduling in Ad Hoc and Cellular Wireless Networks

    E-Print Network [OSTI]

    Tan, Choo Chin

    2013-01-01T23:59:59.000Z

    organization wireless networks and wireless mobile ad-hocfor heterogeneous wireless network”, in Proc. of IEEER. Khalaf, “Ad hoc wireless networks with mobile backbones,”

  10. ITA CONFERENCE 1569048773 THREAT MODELLING FOR MOBILE AD HOC AND SENSOR NETWORKS 1 Threat Modelling for Mobile Ad Hoc and

    E-Print Network [OSTI]

    Sen, Sevil

    ITA CONFERENCE 1569048773 THREAT MODELLING FOR MOBILE AD HOC AND SENSOR NETWORKS 1 Threat Modelling. Chivers, Olwen Worthington and Pankaj Rohatgi Abstract-- This paper introduces a threat model for ad hoc and mobile ad hoc networks (MANETS). It identifies threat categories, modes of use, and a variety of threats

  11. Geography-informed Energy Conservation for Ad Hoc Routing

    E-Print Network [OSTI]

    Xu, Ya; Heidemann, John; Estrin, D

    2001-01-01T23:59:59.000Z

    Geography-informed Energy Conservation for Ad Hoc Routingof network lifetime, energy conservation, and data deliverypowers node off for energy conservation while G A F - m a

  12. Money Market Mutual Funds: An Experiement in Ad Hoc Deregulation

    E-Print Network [OSTI]

    Rosen, Kenneth T.; Katz, Lawrence

    1981-01-01T23:59:59.000Z

    of the market. A full deregulation of the deposit marketsity range. Full deregulation of financial institutions will,periment in ad hoc deregulation. -29- APPENDIX 1 . §Money

  13. Maximizing the throughput of large ad hoc wireless networks

    E-Print Network [OSTI]

    Hua, Yingbo; Huang, Yi; J, Garcia-Luna-Aceves J

    2006-01-01T23:59:59.000Z

    The transport capacity of wireless networks over fadingimprovement of ad hoc wireless networks using directionalThe capacity of wireless networks,” IEEE Trans. Inform.

  14. Reception-Aware Power Control in Ad Hoc Mobile Networks

    E-Print Network [OSTI]

    Mans, Bernard

    Reception-Aware Power Control in Ad Hoc Mobile Networks Nirisha Shrestha and Bernard Mans Macquarie resource in ad hoc mobile networks, mak- ing power control a popular, yet crucial, technique. The network of power control non-trivial. For sake of simplicity, most existing power control protocols only consider

  15. Stimulating Cooperative Diversity in Wireless Ad Hoc Networks through Pricing

    E-Print Network [OSTI]

    Adve, Raviraj

    Stimulating Cooperative Diversity in Wireless Ad Hoc Networks through Pricing Naveen Shastry in commercial wireless ad hoc networks. For the relay, cooperation represents both a real cost of energy a pricing game that stimulates cooperation via reimbursements to the relay. Specifically, given the price

  16. Multipath Routing Based Secure Data Transmission in Ad Hoc Networks

    E-Print Network [OSTI]

    Delgado-Frias, José G.

    Multipath Routing Based Secure Data Transmission in Ad Hoc Networks Li Zhao and José G. Delgado in the networks. In this paper, we present and evaluate a scheme, in which multipath routing combined the single path DSR. Index Terms--security, data transmission, multipath routing, ad hoc networks I

  17. Poster: -Graphs: Flexible Topology Control in Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Williamson, Carey

    Poster: -Graphs: Flexible Topology Control in Wireless Ad Hoc Networks Ashikur Rahman Department networks. Most algorithms strive to reduce energy consumption by cre- ating a sparse topology with few long of topologies and provides the flexibility to network

  18. ad hoc unmanned: Topics by E-print Network

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Abdel Ilah of the Unmanned Aerial Vehicle (UAV) Ad-Hoc net- work, the layered architecture is not flexible enough to achieve in the first three layers based on the aircraft...

  19. Nomadic Communications AA 2009/10 Vehicular Ad Hoc Networks

    E-Print Network [OSTI]

    Lo Cigno, Renato Antonio

    Nomadic Communications AA 2009/10 Vehicular Ad Hoc Networks 90% of this material is reproduced brakes before a collision Some 40% more do not brake effectively Road Accidents 41.600 fatalities 1

  20. Nomadic Communications AA 2010/11 Vehicular Ad Hoc Networks

    E-Print Network [OSTI]

    Lo Cigno, Renato Antonio

    Nomadic Communications AA 2010/11 Vehicular Ad Hoc Networks 90% of this material is reproduced brakes before a collision Some 40% more do not brake effectively Road Accidents 41.600 fatalities 1

  1. Nomadic Communications AA 2010/11 Vehicular Ad Hoc Networks

    E-Print Network [OSTI]

    Lo Cigno, Renato Antonio

    Nomadic Communications AA 2010/11 Vehicular Ad Hoc Networks 90% of this material is reproduced% of passengers vehicles and 26% of trucks do not activate brakes before a collision Some 40% more do not brake

  2. Nomadic Communications AA 2009/10 Vehicular Ad Hoc Networks

    E-Print Network [OSTI]

    Lo Cigno, Renato Antonio

    Nomadic Communications AA 2009/10 Vehicular Ad Hoc Networks 90% of this material is reproduced% of passengers vehicles and 26% of trucks do not activate brakes before a collision Some 40% more do not brake

  3. User level routing for mobile ad hoc networks

    E-Print Network [OSTI]

    Virk, Navjot

    2001-01-01T23:59:59.000Z

    Many routing protocols have been proposed for mobile ad hoc networks. Traditionally routing protocols have been implemented in the kernel of the operating system. The main reasons for this are performance and security. This research explores...

  4. Modular Anomaly Detection for Smartphone Ad hoc Communication

    E-Print Network [OSTI]

    by the infrastructure-based technologies there are no major deploy- ments of ad hoc networks in every day scenarios, or rendered useless due to damages. Thus, message dissemination in disaster area networks using a phone

  5. Truthful resource management in wireless ad hoc networks

    E-Print Network [OSTI]

    Cai, Jianfeng

    2005-11-01T23:59:59.000Z

    In wireless mobile ad hoc networks (MANETs), cooperation cannot be an im- plicit assumption anymore. Each profit-oriented network node has the intention to be selfish due to limited resource possession. In this dissertation, we investigate...

  6. Connectivity Based Location Estimation Scheme for Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Ramanathan, Parameswaran "Parmesh"

    Connectivity Based Location Estimation Scheme for Wireless Ad Hoc Networks Niveditha Sundaram. The loca- tion estimates rely on neighborhood relationships gathered by each user through message, form factors, energy consumption, etc., providing GPS support may not be feasible even in outdoor

  7. Smaller Connected Dominating Sets in Ad Hoc and Sensor Networks

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Smaller Connected Dominating Sets in Ad Hoc and Sensor Networks based on Coverage by Two be broadcasting, where the size of the set greatly impacts on energy consumption. Obtaining small sets is thus is considered. In our new definition, a node u is not dominant if there exists in its 2- hop neighborhood

  8. 1 Antenna Beamforming and Power Control for Ad Hoc Networks

    E-Print Network [OSTI]

    Ramanathan, Ram

    1 Antenna Beamforming and Power Control for Ad Hoc Networks RAM RAMANATHAN BBN Technologies power, spreading code, and antenna beams. By controlling these transceiver parameters adaptively, coding, etc.) can also yield benefits, we shall focus on antenna and power control as they have been

  9. A Power Control MAC Protocol for Ad Hoc Networks

    E-Print Network [OSTI]

    A Power Control MAC Protocol for Ad Hoc Networks Eun-Sun Jung Dept. of Computer Science Texas A This paper presents a power control MAC protocol that al- lows nodes to vary transmit power level on a per control. The main idea of these power control schemes is to use different power lev- els for RTS

  10. Topology Control in Wireless Ad Hoc and Sensor PAOLO SANTI

    E-Print Network [OSTI]

    Chen, Yuanzhu Peter

    - works to reduce energy consumption, which is essential to extend the network operational time. The goal, with the purpose of maintaining some global graph property (e.g., connectivity) while reducing energy consumption and Phrases: Connectivity, Energy consumption, Sensor networks, Topol- ogy control, Wireless ad hoc networks 1

  11. Managing Concurrent Execution of Transactions in Mobile Ad-hoc

    E-Print Network [OSTI]

    Gruenwald, Le

    : an Energy-Efficient Approach Zhaowen Xing University of Oklahoma School of Computer Science 110 West Boyd Systems: an Energy-Efficient Approach Abstract. A Mobile Ad-hoc Network (MANET) is a collection of mobile. In order to provide timely and correct results for multiple concurrent transactions, energy-efficient

  12. A Locationaided Poweraware Routing Protocol in Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Nahrstedt, Klara

    ­hop wireless ad­hoc networks, designing energy­efficient rout­ ing protocols is critical since nodes are power be mobile, demanding the energy­efficient routing protocol to be fully distributed and adaptive­ spect to end­to­end energy­efficient routes. Finally, preliminary simulation results are presented

  13. Energy Aware Implementation of an Ad Hoc Routing Protocol

    E-Print Network [OSTI]

    Brown, Timothy X.

    Energy Aware Implementation of an Ad Hoc Routing Protocol by Shweta Bhandare Scriptor B in Telecommunications Department of InterDisciplinary Telecommunications 2003 #12;This thesis entitled: Energy Aware mentioned discipline. #12;iii Scriptor, Shweta Bhandare (M.S., Telecommunications) Energy Aware

  14. Spatial Interference Mitigation for Multiple Input Multiple Output Ad Hoc Networks: MISO Gains

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Spatial Interference Mitigation for Multiple Input Multiple Output Ad Hoc Networks: MISO Gains beamforming for a multiple input single output (MISO) ad hoc network to increase the density of successful

  15. TDROP: A routing protocol for physically hierarchical ad hoc mobile networks

    E-Print Network [OSTI]

    Ahmed, Zaheer

    2000-01-01T23:59:59.000Z

    Many protocols for routing in mobile ad hoc networks have been proposed. None of these protocols differentiates mobile nodes based on their physical characteristics and also there is only one proposal for connecting ad hoc networks together to form...

  16. Node Localisation in Wireless Ad Hoc Networks Jon Arnold, Nigel Bean, Miro Kraetzl, Matthew Roughan

    E-Print Network [OSTI]

    Roughan, Matthew

    Node Localisation in Wireless Ad Hoc Networks Jon Arnold, Nigel Bean, Miro Kraetzl, Matthew Roughan, Australia Email:{nigel.bean,matthew.roughan}@adelaide.edu.au Abstract-- Wireless ad hoc networks often

  17. Wireless ad hoc networks Acknowledgement: Slides borrowed from Richard Y. Yang @ Yale

    E-Print Network [OSTI]

    Gao, Jie

    are not flexible. ­ Vulnerable to attacks. · Ad hoc networks· Ad hoc networks ­ Flexible, easy to deploy, cheaper · Optimal power assignment /transmission range · Optimal scheduling & multi-hop routing · Node are staticWireless ad hoc networks Acknowledgement: Slides borrowed from Richard Y. Yang @ Yale #12

  18. Mapping of Subtasks with Multiple Versions in a Heterogeneous Ad Hoc Grid Environment

    E-Print Network [OSTI]

    Maciejewski, Anthony A.

    Mapping of Subtasks with Multiple Versions in a Heterogeneous Ad Hoc Grid Environment Sameer Shivle. Index Terms-- ad hoc grid, communication scheduling, mapping, resource allocation, task scheduling. 1 in the ad hoc grid. It is also assumed that a static mapping that maps the subtasks to these M machines

  19. Static Mapping of Subtasks in a Heterogeneous Ad Hoc Grid Environment

    E-Print Network [OSTI]

    Maciejewski, Anthony A.

    Static Mapping of Subtasks in a Heterogeneous Ad Hoc Grid Environment Sameer Shivle1 , Ralph to efficiently map tasks to machines in an ad hoc grid so as to minimize the energy consumed due to communication University George T. Abell Endowment. Abstract An ad hoc grid is a heterogeneous computing and communication

  20. Enhancing the Security of On-demand Routing in Ad Hoc Networks

    E-Print Network [OSTI]

    California at Santa Cruz, University of

    Enhancing the Security of On-demand Routing in Ad Hoc Networks Zhenjiang Li1 and J.J. Garcia, to be truly effective, communication over such networks should be secure. The attacks to an ad hoc network can Springer-Verlag Berlin Heidelberg 2005 #12;Enhancing the Security of On-demand Routing in Ad Hoc Networks

  1. Transportation Plan Ad Hoc Working Group | Department of Energy

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011 Strategic2Uranium Transferon theTed DonatEnergyDepartment of EnergyPlan Ad Hoc

  2. FaultTolerant Distributed Algorithms in Sparse Ad Hoc Wireless Networks

    E-Print Network [OSTI]

    Fault­Tolerant Distributed Algorithms in Sparse Ad Hoc Wireless Networks (SPAWN) BETTINA WEISS communication technologies, wireless ad hoc networks are increasingly commonplace nowadays. Spontaneous (``ad wireless sensor networks and disaster area communication systems. It is also a major enabling technology

  3. A Multiobjective Performance Evaluation Framework for Routing in Wireless Ad Hoc

    E-Print Network [OSTI]

    Jaffrès-Runser, Katia

    network when delay, robustness and energy are considered. I. INTRODUCTION Wireless ad hoc and sensor to transmission delay [8], energy consumption [9] or fairness [10] are added on top of its main design goalA Multiobjective Performance Evaluation Framework for Routing in Wireless Ad Hoc Networks Katia

  4. ad-hoc wireless environments: Topics by E-print Network

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    the state-ofthe -art of the ad hoc networking technology in four areas: routing, medium access control, multicasting, and security. Where possible, comparison between the...

  5. Constructing Minimum-Energy Broadcast Trees In Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Liang, Weifa

    algorithm, power awareness, ad hoc networks, energy consumption optimization, broad- cast and multicastConstructing Minimum-Energy Broadcast Trees In Wireless Ad Hoc Networks Weifa Liang Department related to power consump- tion in this kind of network. One is the minimum-energy broadcast tree problem

  6. Reliable and Energy-Efficient Routing for Static Wireless Ad Hoc Networks with Unreliable Links

    E-Print Network [OSTI]

    Wang, Yu

    Reliable and Energy-Efficient Routing for Static Wireless Ad Hoc Networks with Unreliable Links, Yanwei Wu, Student Member, IEEE, and Yong Qi, Member, IEEE Abstract--Energy efficient routing and power. In this paper, we address the problem of energy efficient reliable routing for wireless ad hoc networks

  7. Low-Cost Truthful Multicast in Selfish and Rational Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Li, Xiang-Yang

    en- joy a more flexible composition. A wireless ad hoc network is a collection of radio devices limited transmission power. One of the dis- tinctive features of wireless networks is that the signal sent1 Low-Cost Truthful Multicast in Selfish and Rational Wireless Ad Hoc Networks Weizhao Wang Xiang

  8. A Cross-Layer Framework for Exploiting Virtual MISO Links in Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Krishnamurthy, Srikanth

    A Cross-Layer Framework for Exploiting Virtual MISO Links in Mobile Ad Hoc Networks Gentian requiring the deployment of physical antenna arrays. Virtual MISO entails the simultaneous transmission. We present a novel multilayer approach for exploiting virtual MISO links in ad hoc networks

  9. A Token Ring Protocol for Dynamic Ad-hoc Wireless Environments

    SciTech Connect (OSTI)

    Top, P; Kohlhepp, V; Dowla, F

    2005-09-30T23:59:59.000Z

    A wireless ad-hoc networking protocol is presented. The protocol is designed to be flexible, easy to use and adaptable to a wide variety of potential applications. The primary considerations in design are small code size, guaranteed bandwidth access, limited delay, and error resilience in a highly dynamic ad-hoc environment. These considerations are achieved through the use of token ring protocol.

  10. DELAR: Device/Energy/Load Aware Relaying in Heterogenous Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Zhang, Yanchao

    - newable energy sources. In DELAR the heterogeneity of nodal energy capabilities or device types, nodalDELAR: Device/Energy/Load Aware Relaying in Heterogenous Wireless Ad Hoc Networks Wei Liu Energy conservation is of great importance for mobile ad hoc networks in which most nodes are equipped

  11. Energy-ef cient Cache Replacement Policies for Cooperative Caching in Mobile Ad Hoc Network

    E-Print Network [OSTI]

    Chan, Edward

    Energy-ef cient Cache Replacement Policies for Cooperative Caching in Mobile Ad Hoc Network dynamically. Most existing cache strategies perform replacement independently, and they seldom consider coordinated replacement and energy saving issues in the context of a mobile ad hoc network. In this paper, we

  12. Energy Efficient Adaptation of Multicast Protocols in Power Controlled Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Prasanna, Viktor K.

    on energy efficiency in ad hoc networks. In this paper, we assume a more practical model for power controlEnergy Efficient Adaptation of Multicast Protocols in Power Controlled Wireless Ad Hoc Networks to power controlled networks is presented. Wireless nodes are assumed to have transmis- sion power control

  13. Joint Routing and Server Selection for Multiple Description Video Streaming in Ad Hoc Networks

    E-Print Network [OSTI]

    Hou, Y. Thomas

    Joint Routing and Server Selection for Multiple Description Video Streaming in Ad Hoc Networks ad hoc networks. In this paper, we study the important problem of joint routing and server selection by the proposed approach over existing server selection schemes. This justifies the importance of jointly

  14. Cross-Layer Design for Energy-Efficient Secure Multicast Communications in Ad Hoc Networks

    E-Print Network [OSTI]

    Poovendran, Radha

    Cross-Layer Design for Energy-Efficient Secure Multicast Communications in Ad Hoc Networks Loukas, University of Washington, Seattle, WA Abstract-- We consider the problem of secure multicast in an energy network operation in an wireless ad hoc environment. Energy is a physical layer parameter, while security

  15. ADHOC MAC: a new, flexible and reliable MAC architecture for ad-hoc networks

    E-Print Network [OSTI]

    Borgonovo, Flaminio

    ADHOC MAC: a new, flexible and reliable MAC architecture for ad-hoc networks F. Borgonovo, A, make the design of a prompt, efficient, flexible, and reliable MAC very difficult. An ad hoc network.e., transmissions that reach all terminals within the range allowed by the transmitting power. Due to radio range

  16. PCQoS: Power Controlled QoS in Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Gomez-Castellanos, Javier

    Department of Electrical Engineering National University of Mexico, D.F., 04510 Email: {javierg@cs.dartmouth.edu Abstract--Mobile Ad hoc networks typically use a common transmission power approach for the discoveryS differentiation to applications in wireless ad hoc networks. I. INTRODUCTION The impact of transmission power

  17. On the Connectivity in One-Dimensional Ad Hoc Wireless Networks with a Forbidden Zone

    E-Print Network [OSTI]

    On the Connectivity in One-Dimensional Ad Hoc Wireless Networks with a Forbidden Zone Xiaodong Hu1 This paper investigates the connectivity in one-dimensional ad hoc wireless networks with a forbidden zone. We derive the probability of the wireless networks which are composed of exactly m clusters by means

  18. Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc

    E-Print Network [OSTI]

    Caragiannis, Ioannis

    Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc Networks Stavros Technology Institute and Dept. of Computer Engineering and Informatics University of Patras, 26500 Rio, Greece Abstract. Energy is a scarce resource in ad hoc wireless networks and it is of paramount

  19. Fully Distributed Trust Model based on Trust Graph for Mobile Ad hoc Networks

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    University of Technology, France. bouabdal@hds.utc.fr Abstract A mobile ad hoc network (MANET) is a wireless pre-existing in- frastructure; all networking operations (routing, mobility management, and so onFully Distributed Trust Model based on Trust Graph for Mobile Ad hoc Networks Mawloud Omar, Yacine

  20. The Quest for Security in Mobile Ad Hoc Networks \\Lambda JeanPierre Hubaux

    E-Print Network [OSTI]

    Bencsáth, Boldizsár

    network to work without any external management or configuration. Although not all mobile ad hoc networksThe Quest for Security in Mobile Ad Hoc Networks \\Lambda Jean­Pierre Hubaux Institute for Computer Communications and Applications Swiss Federal Institute of Technology -- Lausanne CH­1015, Switzerland Jean

  1. The Quest for Security in Mobile Ad Hoc Networks Jean-Pierre Hubaux

    E-Print Network [OSTI]

    Capkun, Srdjan

    management or con guration. Although not all mobile ad hoc networks are self-organized, this propertyThe Quest for Security in Mobile Ad Hoc Networks Jean-Pierre Hubaux Institute for Computer Communications and Applications Swiss Federal Institute of Technology ­ Lausanne CH-1015, Switzerland Jean

  2. Report of the Ad Hoc Committee on Washington Natural Resource Agency Reform

    E-Print Network [OSTI]

    Borenstein, Elhanan

    Report of the Ad Hoc Committee on Washington Natural Resource Agency Reform February 16, 2010 of the Environment (CoEnv) to make useful contributions to the Governor's natural resource agency reform initiative. As a result, the Washington Natural Resource Agency Reform ad hoc Committee was established and given

  3. Hop-Reservation Multiple Access (HRMA) for Ad-Hoc Networks

    E-Print Network [OSTI]

    California at Santa Cruz, University of

    Hop-Reservation Multiple Access (HRMA) for Ad-Hoc Networks Zhenyu Tang and J. J. Garcia (HRMA) for wireless ad-hoc networks (multi-hop packet radio networks) is introduced, specified and analyzed. HRMA is based on simple half-duplex, very-slow frequency-hopping spread spectrum (FHSS) radios

  4. HopReservation Multiple Access (HRMA) for AdHoc Networks \\Lambda

    E-Print Network [OSTI]

    California at Santa Cruz, University of

    Hop­Reservation Multiple Access (HRMA) for Ad­Hoc Networks \\Lambda Zhenyu Tang and J. J. Garcia (HRMA) for wireless ad­hoc networks (multi­hop packet radio networks) is introduced, specified and analyzed. HRMA is based on simple half­duplex, very­slow frequency­hopping spread spectrum (FHSS) radios

  5. Energy-Efficient Reliable Routing Considering Residual Energy in Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Langendoen, Koen

    Energy-Efficient Reliable Routing Considering Residual Energy in Wireless Ad Hoc Networks Javad minimum energy routing (RMER). RMECR addresses three important requirements of ad hoc networks: energy-efficiency energy of nodes as well as quality of links to find energy-efficient and reliable routes that increase

  6. MobiSN: Semantics-based Mobile Ad Hoc Social Network Framework

    E-Print Network [OSTI]

    Li, Juan "Jen"

    MobiSN: Semantics-based Mobile Ad Hoc Social Network Framework Juan Li Department of Computer.khan@ndsu.edu Abstract--Mobile ad hoc social networks are self-configuring social networks that connect users using mobile devices, such as laptops, PDAs, and cellular phones. These social networks facilitate users

  7. Degree Distribution and Hopcount in Wireless Ad-hoc Networks R. Hekmat, P. Van Mieghem

    E-Print Network [OSTI]

    Van Mieghem, Piet

    Degree Distribution and Hopcount in Wireless Ad-hoc Networks R. Hekmat, P. Van Mieghem Delft focus in this article is on the degree distribution and hopcount in these networks. The results that the degree distribution in wireless ad-hoc networks is binomial for low values of the mean degree. Further

  8. Progressive Network Coding for Message-Forwarding in Ad-Hoc Wireless Networks

    E-Print Network [OSTI]

    Chen, Yuanzhu Peter

    . This paper considers the multi-hop transmission prob- lem in wireless ad-hoc networks. In a three-node sce of multi- hop transmission. The new framework, exploiting the technology of progressive network codingProgressive Network Coding for Message-Forwarding in Ad-Hoc Wireless Networks Xingkai Bao and Jing

  9. A Special-Purpose Peer-to-Peer File Sharing System for Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Lindemann, Christoph

    application scenarios include sharing traffic and weather data by car-to-car communication in a wideA Special-Purpose Peer-to-Peer File Sharing System for Mobile Ad Hoc Networks Alexander Klemm-to-peer (P2P) file sharing for mobile ad hoc networks (MANET) requires the construction of a search algorithm

  10. Inducing Spatial Clustering in MAC Contention for Spread Spectrum Ad Hoc Networks

    E-Print Network [OSTI]

    de Veciana, Gustavo

    . Our premise is that such networks are well suited to meet quality of service and energy efficiency promise towards achieving high spatial reuse, QoS, and energy efficiency in spread spectrum ad hoc goals. At least two other objectives are critical in some ad hoc network applications: energy efficiency

  11. On the Effectiveness of Monitoring for Intrusion Detection in Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Chen, Ing-Ray

    to that of the experimental testbed. Simulations of larger (50-node) ad hoc networks indicate that monitoring-based intrusion evaluations of IDTs are based on small testbed configura- tions, or simulations which do not incorporate any on monitoring- based intrusion detection for ad hoc networks. Experimental results show that, even for a simple

  12. Securing Ad Hoc Wireless Networks Against Data Injection Attacks Using Firewalls

    E-Print Network [OSTI]

    Kasera, Sneha Kumar

    Securing Ad Hoc Wireless Networks Against Data Injection Attacks Using Firewalls Jun Cheol Park-- We propose to secure ad hoc networks against data injection attacks by placing firewall functionality] simulations. Our results show that our algorithm can find near-optimal solutions. Based on a simple analysis

  13. Fuzzy Trust Recommendation Based on Collaborative Filtering for Mobile Ad-hoc Networks

    E-Print Network [OSTI]

    Zhang, Yi

    Fuzzy Trust Recommendation Based on Collaborative Filtering for Mobile Ad-hoc Networks Junhai Luo1--Mobile ad-hoc networks (MANETs) are based on the cooperative and trust characteristic of the mobile nodes focused on building up trust among distributed network nodes to simulate cooperation and improving

  14. A Trust-based Architecture for Managing Certificates in Vehicular Ad hoc Networks

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    propose a secure and distributed public key infrastructure for vehicular ad hoc networks VANETs basedA Trust-based Architecture for Managing Certificates in Vehicular Ad hoc Networks Tahani Gazdar authority CA. We conducted a set of simulations in which we evaluate the efficiency and the stability

  15. Preventing Wormhole Attacks on Wireless Ad Hoc Networks: A Graph Theoretic Approach

    E-Print Network [OSTI]

    Lazos, Loukas

    then propose a Local Broad- cast Key (LBK) based method to secure an ad hoc network from wormhole attacks simulation results to illustrate our theory. Index Terms-- wormhole, security, vulnerability, ad hoc net a decentralized realization for LBK establishment, and provide an analytical evaluation of the security level

  16. E-Print Network 3.0 - ad hoc cloud Sample Search Results

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    any ad hoc combination of physical processes... . 21. Adding 10% in mass of 10 y m water ice particles to the cloud of Fig 2 ( Y y m, ) reduces... Warming Early Mars with...

  17. Self-securing Ad Hoc Wireless Networks Haiyun Luo, Petros Zerfos, Jiejun Kong, Songwu Lu, Lixia Zhang

    E-Print Network [OSTI]

    Lu, Songwu

    evaluate the solution through simulation and implementation. 1. Introduction Mobile ad hoc networkingSelf-securing Ad Hoc Wireless Networks Haiyun Luo, Petros Zerfos, Jiejun Kong, Songwu Lu, Lixia wireless channel. However, the nature of ad hoc networks makes them vulner- able to security attacks

  18. Randomized location service in Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Bhattacharya, Sangeeta

    2003-01-01T23:59:59.000Z

    I 3. Pcrccntagc of outdated values for Algorithm II 4. Pcrccntage of outdated values for Algorithm III. , 5. Distribution of query' results lor Algorithm I with grid size 300x300m 7 6. Distribution ol' query results (or Algonthm I with gnd size... 500x500m . . . . . . z 7. Distribution of query results for Algorithm I with grid size 750x750m . . . . , . 8. Distribution of query results for Algorithm I with grid size 1000x I 000m . . 9. Distribution of query results for Algorithm II with grid...

  19. Route duration modeling for mobile ad-hoc networks Michael Pascoe-Chalke Javier Gomez

    E-Print Network [OSTI]

    Gomez-Castellanos, Javier

    of Electrical Engineering, Metropolitan Autonomous University, Mexico City, Mexico e-mail: milo@xanum.uam.mx 123-hoc Net- works (VANETs), Wireless Sensor Networks (WSNs) and Mobile Ad-hoc Networks (MANETs). In MANETs. Pascoe-Chalke (&) Á J. Gomez Á V. Rangel Department of Electrical Engineering, National Autonomous

  20. Service Provision in Disconnected Mobile Ad hoc Networks Nicolas Le Sommer

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Service Provision in Disconnected Mobile Ad hoc Networks Nicolas Le Sommer Valoria Laboratory, University of South Brittany Nicolas.Le-Sommer@univ-ubs.fr Abstract With the proliferation of mobiles devices

  1. Autonomous Undersea Systems Network (AUSNet) Protocols To Support Ad-Hoc AUV Communications

    E-Print Network [OSTI]

    semi-autonomous networked robots. Emerging flexible low bandwidth, energy efficient architectures opposed to network support) data transmissions. Current efforts are focused on transitionAutonomous Undersea Systems Network (AUSNet) ­ Protocols To Support Ad-Hoc AUV Communications

  2. Online Policies for Opportunistic Virtual MISO Routing in Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Rossi, Michele

    Online Policies for Opportunistic Virtual MISO Routing in Wireless Ad Hoc Networks Cristiano in virtual multiple input single output (MISO) trans- missions and space-time block codes have been proposed

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

    E-Print Network [OSTI]

    Tetteh, William Nii Adjetey

    2007-01-01T23:59:59.000Z

    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 ...

  4. Mobile Codes Localization in Ad hoc Networks: a Comparative Study of Centralized and Distributed Approaches

    E-Print Network [OSTI]

    Zafoune, Youcef; kanawati, Rushed; 10.5121/ijcnc.2010.2213

    2010-01-01T23:59:59.000Z

    This paper presents a new approach in the management of mobile ad hoc networks. Our alternative, based on mobile agent technology, allows the design of mobile centralized server in ad hoc network, where it is not obvious to think about a centralized management, due to the absence of any administration or fixed infrastructure in these networks. The aim of this centralized approach is to provide permanent availability of services in ad hoc networks which are characterized by a distributed management. In order to evaluate the performance of the proposed approach, we apply it to solve the problem of mobile code localization in ad hoc networks. A comparative study, based upon a simulation, of centralized and distributed localization protocols in terms of messages number exchanged and response time shows that the centralized approach in a distributed form is more interesting than a totally centralized approach.

  5. Energy-Efficient Distributed Constructions of Minimum Spanning Tree for Wireless Ad-hoc

    E-Print Network [OSTI]

    Khan, Maleq

    1 Energy-Efficient Distributed Constructions of Minimum Spanning Tree for Wireless Ad-hoc Networks of a class of simple and local algorithms called Nearest Neighbor Tree (NNT) algorithms for energy-efficient

  6. Quality of Service (QoS) security in mobile ad hoc networks

    E-Print Network [OSTI]

    Lu, Bin

    2006-10-30T23:59:59.000Z

    With the rapid proliferation of wireless networks and mobile computing applications, Quality of Service (QoS) for mobile ad hoc networks (MANETs) has received increased attention. Security is a critical aspect of QoS provisioning in the MANET...

  7. ad-hoc vehicular network: Topics by E-print Network

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    12 13 14 15 16 17 18 19 20 21 22 23 24 25 Next Page Last Page Topic Index 1 Information Sharing in Vehicular Ad Hoc Networks. Open Access Theses and Dissertations Summary: ??The...

  8. An On-demand Minimum Energy Routing Protocol for a Wireless Ad Hoc Network

    E-Print Network [OSTI]

    An On-demand Minimum Energy Routing Protocol for a Wireless Ad Hoc Network Sheetalkumar Doshi of an on-demand minimum energy routing protocol and suggests mechanisms for their imple- mentation. We of an on-demand minimum energy routing protocol in terms of energy savings with an existing on-demand ad

  9. An Energy-Aware On-Demand Routing Protocol for Ad-Hoc Wireless Networks

    E-Print Network [OSTI]

    Veerayya, Mallapur

    2008-01-01T23:59:59.000Z

    An ad-hoc wireless network is a collection of nodes that come together to dynamically create a network, with no fixed infrastructure or centralized administration. An ad-hoc network is characterized by energy constrained nodes, bandwidth constrained links and dynamic topology. With the growing use of wireless networks (including ad-hoc networks) for real-time applications, such as voice, video, and real-time data, the need for Quality of Service (QoS) guarantees in terms of delay, bandwidth, and packet loss is becoming increasingly important. Providing QoS in ad-hoc networks is a challenging task because of dynamic nature of network topology and imprecise state information. Hence, it is important to have a dynamic routing protocol with fast re-routing capability, which also provides stable route during the life-time of the flows. In this thesis, we have proposed a novel, energy aware, stable routing protocol named, Stability-based QoS-capable Ad-hoc On-demand Distance Vector (SQ-AODV), which is an enhancement...

  10. An Adaptive Routing Mechanism For Ad Hoc Wireless Sensor Jane E Tateson and Ian W Marshall, BTexact

    E-Print Network [OSTI]

    Haddadi, Hamed

    An Adaptive Routing Mechanism For Ad Hoc Wireless Sensor Networks Jane E Tateson and Ian W Marshall for a network of ad hoc wireless sensor nodes. The mechanism enables sensor nodes to minimize route cost by varying their transmission range, and by experimenting with the neighbours from which they forward data

  11. Power Control MAC Protocol Analysis and Improvement for Ad Hoc Networks Ping Ding, JoAnne Holliday, Aslihan Celik

    E-Print Network [OSTI]

    Holliday, JoAnne

    Power Control MAC Protocol Analysis and Improvement for Ad Hoc Networks Ping Ding, JoAnne Holliday power control protocols have been proposed to address the limited power supplies in ad hoc networks in the same transmission. In this paper, we review different power control MAC protocols, and analyze

  12. Energy-Aware Secure Multicast Communication In Wireless Ad-Hoc Networks Loukas Lazos, and Radha Poovendran

    E-Print Network [OSTI]

    Lazos, Loukas

    Energy-Aware Secure Multicast Communication In Wireless Ad-Hoc Networks Loukas Lazos, and Radha Poovendran Abstract-- In this paper we address the problem of efficiently securing multicast communication in energy constrained wireless ad hoc networks. We show that existing scalable key distribution techniques

  13. A Ferry-based Intrusion Detection Scheme for Sparsely Connected Ad Hoc Networks M. Chuah, P.Yang, J. Han

    E-Print Network [OSTI]

    Chuah, Mooi-Choo "Mooi"

    A Ferry-based Intrusion Detection Scheme for Sparsely Connected Ad Hoc Networks M. Chuah, P.Yang, J University Bethlehem, PA 18015 Abstract-- Several intrusion detection approaches have been proposed in sparse ad hoc networks. In this paper, we propose a ferry-based intrusion detection and mitigation (FBIDM

  14. Trust-and Clustering-Based Authentication Services in Mobile Ad Hoc Edith C. H. Ngai and Michael R. Lyu

    E-Print Network [OSTI]

    Lyu, Michael R.

    distributed systems, security in ad hoc networks is based on the use of a key management system. Specific key the network. The new solution is evaluated through simulation and implementation, and the resultsTrust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith C. H. Ngai

  15. Route Throughput Analysis with Spectral Reuse for Multi-Rate Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Tseng, Yu-Chee

    networks (MANETs) have received a lot of attention for its flexible network architecture. While many network (MANET) is a flexible and dynamic architecture that is attractive due to its ease in network1 Route Throughput Analysis with Spectral Reuse for Multi-Rate Mobile Ad Hoc Networks Lien-Wu Chen

  16. Location Discovery using Ad Hoc Anand S. Gajparia and Po Wah Yau

    E-Print Network [OSTI]

    Dent, Alexander W.

    worker. Such a scenario would also vastly reduce the time and cost of stock-taking. Instead of itemising items of stock in a warehouse. We suppose that the stock items contain devices capable of forming an ad hoc network. When a warehouse worker wishes to locate an item in the ware- house, the stock items

  17. Opportunistic Routing in Wireless Ad Hoc Networks: Upper Bounds for the Packet

    E-Print Network [OSTI]

    Mans, Bernard

    routing, in a realistic network model where link conditions are variable. We analyze the performance1 Opportunistic Routing in Wireless Ad Hoc Networks: Upper Bounds for the Packet Propagation Speed to the destination. In this paper, we provide upper bounds on the packet propaga- tion speed for opportunistic

  18. Load and Energy Aware Topology Control in Wireless Ad-hoc Networks

    E-Print Network [OSTI]

    Rahman, A.K.M. Ashikur

    of (energy efficient) relays. However, using the same set of relays all the time causes some nodes to becomeLoad and Energy Aware Topology Control in Wireless Ad-hoc Networks Tandra Chakraborty, Fazlay Rabbi a family of connected topology with (possibly) disjoint relay sets. Thus, by creating different energy

  19. PATTERN-BASED COLLABORATION IN AD-HOC TEAMS THROUGH MESSAGE ANNOTATION

    E-Print Network [OSTI]

    Dustdar, Schahram

    PATTERN-BASED COLLABORATION IN AD-HOC TEAMS THROUGH MESSAGE ANNOTATION Daniel Schall, Robert: Collaboration Patterns, Message Annotation, Coordination Support, Interaction Patterns Abstract: In this paper we present a specification for annotating messages to enable computer-supported message processing

  20. Using Energy-Efficient Overlays to Reduce Packet Error Rates in Wireless Ad-Hoc Networks

    E-Print Network [OSTI]

    Khan, Bilal

    the problem of how to balance Western Michigan University, MI. John Jay College of Criminal Justice, City1 Using Energy-Efficient Overlays to Reduce Packet Error Rates in Wireless Ad-Hoc Networks A. Al-Fuqaha G. Ben Brahim M. Guizani B. Khan Abstract-- In this paper we present new energy-efficient tech

  1. Delay and Capacity Trade-offs in Mobile Ad Hoc Networks: A Global Perspective

    E-Print Network [OSTI]

    Chen, Yuanzhu Peter

    Mazumdar, Ness Shroff School of Electrical and Computer Engineering Purdue University West Lafayette, IN 47907, USA Email: {gsharma,shroff}@ecn.purdue.edu Department of Electrical and Computer Engineering the delay and capacity trade-offs in mobile ad hoc networks. This line of investigation started

  2. Energy consumption models for ad-hoc mobile Emmanuel Lochin1

    E-Print Network [OSTI]

    Lochin, Emmanuel

    1 Energy consumption models for ad-hoc mobile terminals Emmanuel Lochin1 Anne Fladenmuller1 Jean describes a set of experiments based on ACPI BIOS measurements which evaluate the energy consumption of an IEEE802.11 wireless net- work interface. Based on our ACPI measurements, two models of energy

  3. Using Variable-Range Transmission Power Control in Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Gomez-Castellanos, Javier

    Using Variable-Range Transmission Power Control in Wireless Ad Hoc Networks Javier Gomez and Andrew control on the physical and network connectivity, network capacity, and power savings of wireless multihop networks based, not on common-range which is prevalent today, but on variable-range power control. Index

  4. Power Control and Clustering in Ad Hoc Networks Vikas Kawadia and P. R. Kumar

    E-Print Network [OSTI]

    Kawadia, Vikas

    Power Control and Clustering in Ad Hoc Networks Vikas Kawadia and P. R. Kumar Department consider the problem of power control when nodes are non-homogeneously dispersed in space. In such situations, one seeks to employ per packet power control depending on the source and destination

  5. Revisiting multimedia streaming in mobile ad hoc Peng Xue Surendar Chandra

    E-Print Network [OSTI]

    Chandra, Surendar

    setups to show that there is a mis-match between expectations of the local system designers the resource consumed without a major revamp of existing operating systems or requiring special hardware. We im, multimedia streaming, resource management 1. MOTIVATION -OBSERVED SYSTEM BE- HAVIOR Mobile ad hoc networking

  6. 14. A TAXONOMY OF DATA COMMUNICATION PROTOCOLS FOR VEHICULAR AD HOC NETWORKS

    E-Print Network [OSTI]

    Stojmenovic, Ivan

    1 14. A TAXONOMY OF DATA COMMUNICATION PROTOCOLS FOR VEHICULAR AD HOC NETWORKS Yousef efficiency. In this paper, we provide the first known taxonomy of VANET data communication protocols, based, vehicle connectivity, urgency, and message contents. The taxonomy provides fundamental blocks in VANET

  7. Non-Blocking, Localized Routing Algorithm for Balanced Energy Consumption in Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Lee, Ben

    1 Non-Blocking, Localized Routing Algorithm for Balanced Energy Consumption in Mobile Ad Hoc relevant nodes but also to balance individual battery levels. Unbalanced energy usage will result achieves a trade-off between balanced energy consumption and shortest routing delay, and at the same time

  8. Energy-Balanced Cooperative Routing in Multihop Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Wang, Yu

    Energy-Balanced Cooperative Routing in Multihop Wireless Ad Hoc Networks Siyuan Chen Minsu Huang. In this paper, we aim to study the impact of cooperative routing on balancing the energy distribution among their transmission power, our cooperative routing method can balance the energy among neighboring nodes and maximize

  9. Ad Hoc Categories and Geospatial Ontology Position Paper for COSIT Ontology Workshop

    E-Print Network [OSTI]

    Bennett, Brandon

    1 Ad Hoc Categories and Geospatial Ontology Position Paper for COSIT Ontology Workshop Jeffrey S and Geospatial Ontology There is a dependence relationship which exists between the domain of contraband prevention and geospatial ontology, namely the former domain would not exist if there were not also entities

  10. ENERGY-AWARE SECURE MULTICAST COMMUNICATION IN AD-HOC NETWORKS USING GEOGRAPHIC LOCATION INFORMATION

    E-Print Network [OSTI]

    Lazos, Loukas

    ENERGY-AWARE SECURE MULTICAST COMMUNICATION IN AD-HOC NETWORKS USING GEOGRAPHIC LOCATION INFORMATION Loukas Lazos, Radha Poovendran Network Security and Cryptography Laboratory University by NSF grant ANI-0093187 and ARO grant DAAD-190210242 ABSTRACT The problem of securing multicast

  11. On the Energy Efficiency of Cognitive Radios -A Study of the Ad Hoc Wireless LAN Scenario

    E-Print Network [OSTI]

    Namboodiri, Vinod

    and determine if its usage can prove energy efficient in portable devices. Through this work we makeOn the Energy Efficiency of Cognitive Radios - A Study of the Ad Hoc Wireless LAN Scenario Anm of achieving better communication performance on selected spectrum. The benefits in terms of reduced energy

  12. An Approach to Minimal Power Routing and Scheduling in Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Massachusetts at Amherst, University of

    's fixed power level that is used, leading to data loss. The problem that we address is primarily a routingAn Approach to Minimal Power Routing and Scheduling in Wireless Ad Hoc Networks Sugata Hazarika # Jim Kurose # Dennis Goeckel + # Department of Computer Science + Department. of Electrical Engineering

  13. PERFORMANCE OF DISTRIBUTED UTILITY-BASED POWER CONTROL FOR WIRELESS AD HOC NETWORKS

    E-Print Network [OSTI]

    Kuzmanovic, Aleksandar

    PERFORMANCE OF DISTRIBUTED UTILITY-BASED POWER CONTROL FOR WIRELESS AD HOC NETWORKS Jianwei Huang network. The users exchange prices that reflect their loss in utility due to interference. The prices are then used to determine optimal (utility maximizing) power levels for each user. We present simulation

  14. An Approach to Minimal Power Routing and Scheduling in Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Massachusetts at Amherst, University of

    's fixed power level that is used, leading to data loss. The problem that we address is primarily a routingAn Approach to Minimal Power Routing and Scheduling in Wireless Ad Hoc Networks Sugata Hazarika Jim Kurose Dennis Goeckel Department of Computer Science Department. of Electrical Engineering University

  15. The Upper Bound of Capacity for A Concurrent-transmission-based Ad-hoc Network

    E-Print Network [OSTI]

    Tseng, Yu-Chee

    1 The Upper Bound of Capacity for A Concurrent-transmission-based Ad-hoc Network with Single National Chiao-Tung University, Hsin-Chu, 30010 Taiwan Department of Communication Engineering National Chiao-Tung University, Hsin-Chu, 30010 Taiwan Department of Information and Computer Engineering Chung

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

    E-Print Network [OSTI]

    of opportunistic ad hoc communication scenarios is unlikely on a large scale. Part of it is due to business models and application layer services, such as security, can be designed (offline) to do an efficient use of the resources. Real- time adaptation can further minimise their impact on the energy consumption, increasing

  17. Trust and Exclusion in Vehicular Ad Hoc Networks: An Economic Incentive Model based Approach

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Trust and Exclusion in Vehicular Ad Hoc Networks: An Economic Incentive Model based Approach Nadia, and lowers the overall data reception ratio in the network. To tackle this, we propose a new incentive model with exclusion for malicious nodes called VIME. VIME is inspired from the signaling theory from economics

  18. Route Duration in Mobile Ad hoc Networks Michael Pascoe*, Javier Gomez, Victor Rangel

    E-Print Network [OSTI]

    Gomez-Castellanos, Javier

    of Electrical Engineering National University of Mexico, Mexico City, Mexico Email: {michael to the limited transmission range of wireless network interfaces, multiple network interlinks or "hops" mayRoute Duration in Mobile Ad hoc Networks Michael Pascoe*, Javier Gomez, Victor Rangel Department

  19. An On-demand Minimum Energy Routing Protocol for a Wireless Ad Hoc Network

    E-Print Network [OSTI]

    Brown, Timothy X.

    An On-demand Minimum Energy Routing Protocol for a Wireless Ad Hoc Network Sheetalkumar Doshi the necessary features of an on-demand minimum energy routing protocol and suggests mechanisms the performance of an on-demand minimum energy routing protocol in terms of energy savings with an existing on

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

    E-Print Network [OSTI]

    Jay Yang, Shanchieh

    Modular Topology Control and Energy Model for Wireless Ad Hoc Sensor Networks Niranjan in a harsh terrain typically are battery operated and, therefore, require energy efficient network protocols. In order to ease the analysis of the energy usage of proposed network protocols, this paper proposes

  1. A MAC Layer Protocol for Priority-based Reliable Multicast in Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Demirbas, Murat

    A MAC Layer Protocol for Priority-based Reliable Multicast in Wireless Ad Hoc Networks Murat Abstract RTS-CTS handshake based protocols achieve "reliable unicast" by eliminating the hidden node. Here we present a simple, light-weight, and self- stabilizing MAC protocol, namely Busy Elimination

  2. The Degree of Participation Concept in Ad Hoc Networks Youssef Iraqi and Raouf Boutaba

    E-Print Network [OSTI]

    Boutaba, Raouf

    categories: table-driven routing and source-initiated on-demand rout- ing. Examples of the first category of routing protocols are: AODV (Ad hoc On-Demand Distance Vector) routing [11]; DSR (Dynamic Source Routing mecha- nism. This can be driven by an energy saving policy for ex- ample. Special resource management

  3. A SOLUTION TO HIDDEN TERMINAL PROBLEM OVER A SINGLE CHANNEL IN WIRELESS AD HOC NETWORKS

    E-Print Network [OSTI]

    Latchman, Haniph A.

    A SOLUTION TO HIDDEN TERMINAL PROBLEM OVER A SINGLE CHANNEL IN WIRELESS AD HOC NETWORKS Hongqiang.ufl.edu and fanggece.ufl.edu ABSTRACT In multihop wireless networks, hidden terminal problem is common and leads to the hidden terminal problem may lead to an unacceptable quality of these services. Therefore, solving

  4. Improved Power-Delay Trade-off in Wireless Ad Hoc Networks Using Opportunistic Routing

    E-Print Network [OSTI]

    Lee, Yong Hoon

    Improved Power-Delay Trade-off in Wireless Ad Hoc Networks Using Opportunistic Routing Won power- delay trade-off than the conventional routing while providing up to a logarithmic boost that the power can be reduced at the expense of increased delay for both scenarios, but better trade-off can

  5. Asymptotic Outage Analysis of General Motion-Invariant Ad Hoc Networks

    E-Print Network [OSTI]

    Haenggi, Martin

    Asymptotic Outage Analysis of General Motion-Invariant Ad Hoc Networks Riccardo Giacomelli Dept Krishna Ganti Dept. of Electrical and Computer Eng. University of Texas at Austin Austin, TX, USA E-mail: rganti@austin.utexas.edu Martin Haenggi Dept. of Electrical Engineering University of Notre Dame Notre

  6. Amorphous Placement and Retrieval of Sensory Data in Sparse Mobile AdHoc Networks

    E-Print Network [OSTI]

    a distributed repository of spatiotemporal sensory data. Prior research in which sensor networks are viewedAmorphous Placement and Retrieval of Sensory Data in Sparse Mobile Ad­Hoc Networks HANY MORCOS AZER the least communication overhead (power). We show that the use of Data Centric Storage (DCS), or directed

  7. Amorphous Placement and Retrieval of Sensory Data in Sparse Mobile Ad-Hoc Networks

    E-Print Network [OSTI]

    a distributed repository of spatiotemporal sensory data. Prior research in which sensor networks are viewedAmorphous Placement and Retrieval of Sensory Data in Sparse Mobile Ad-Hoc Networks HANY MORCOS AZER the least communication overhead (power). We show that the use of Data Centric Storage (DCS), or directed

  8. Impact of Jitter-based Techniques on Flooding over Wireless Ad hoc Networks: Model and Analysis

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Impact of Jitter-based Techniques on Flooding over Wireless Ad hoc Networks: Model and Analysis Philippe.Jacquet@inria.fr Emmanuel Baccelli INRIA, France Emmanuel.Baccelli@inria.fr Abstract--Jitter. This paper investigates on the impact of the standardized jitter mechanism on network-wide packet

  9. Maximizing the Number of Broadcast Operations in Random Geometric Ad-Hoc Wireless Networks

    E-Print Network [OSTI]

    Calamoneri, Tiziana

    static ad-hoc wireless networks whose nodes, equipped with the same initial battery charge, may dynamically change their transmission range. When a node v transmits with range r(v), its battery charge of a node depends, in turn, on the energy power supplied to the node. In particular, the power Pv required

  10. Energy savings in wireless ad hoc sensor networks as a result of network synchronisation

    E-Print Network [OSTI]

    Haddadi, Hamed

    Energy savings in wireless ad hoc sensor networks as a result of network synchronisation Antonio of oceanographic monitoring using a collegiate-managed autonomous network of energy-conscious wireless sensors. We-to-node synchronised transmissions in order to reduce overhearing and therefore reduce energy expenses. SSSNP (Self

  11. TCP Performance over Mobile Ad-hoc Networks -A Quantitative Study

    E-Print Network [OSTI]

    Park, Seung-Jong "Jay"

    gaining maturity, some researchers have lately shifted focus to the transport layer performance in ad-hoc networks [8], [9], [10]. Since TCP (Transmission Control Protocol) is by far the most used transport pro notification (ELFN) to the source from the link failure point. The source, upon receiving the ELFN freezes TCP

  12. DEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS

    E-Print Network [OSTI]

    Hou, Y. Thomas

    1 DEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS Arun Avudainayagam of functioning and available resources. In this paper, we propose a Device and Energy Aware Routing protocol-powered nodes and battery-powered nodes. We embed both the energy and the device awareness into the routing

  13. EAGR: Energy Aware Greedy Routing Scheme for Wireless Ad hoc Networks Sachin Sharma

    E-Print Network [OSTI]

    Dharmaraja, S.

    EAGR: Energy Aware Greedy Routing Scheme for Wireless Ad hoc Networks Sachin Sharma Tejas Networks Delhi, New Delhi, India (email: dharmar@maths.iitd.ac.in) Abstract This paper presents Energy Aware distributed nodes that communicate over a wireless link. In this paper we present a scalable, Energy Aware

  14. A Mobility and Energy-aware Hierarchical Intrusion Detection System for Mobile ad hoc Networks

    E-Print Network [OSTI]

    Stavrakakis, Ioannis

    A Mobility and Energy-aware Hierarchical Intrusion Detection System for Mobile ad hoc Networks consumption. The proposed architecture adopts and enhances the Mobility and Energy Aware Clustering Algorithm and energy of nodes in the cluster formation in order to improve detection accuracy and re- duce energy

  15. Minimum-Energy Topology Control Algorithms in Ad Hoc Joseph Y. Halpern Li (Erran) Li

    E-Print Network [OSTI]

    Halpern, Joseph Y.

    for an extended period of time. In order to accomplish this without a renewable energy source, energy conservationMinimum-Energy Topology Control Algorithms in Ad Hoc Networks1 Joseph Y. Halpern Li (Erran) Li Dept Holmdel, NJ 07733 halpern@cs.cornell.edu erranlli@dnrc.bell-labs.com August 7, 2004 1 Based on "Minimum-Energy

  16. Effect of Vehicle Mobility on Connectivity of Vehicular Ad Hoc Networks

    E-Print Network [OSTI]

    Zhou, Xiangyun "Sean"

    Effect of Vehicle Mobility on Connectivity of Vehicular Ad Hoc Networks Salman Durrani, Xiangyun equivalent speed parameter and develop an analytical model to explain the effect of vehicle mobility vehicle speed and it decreases as the standard deviation of the vehicle speed increases. Using

  17. Secure Group-based Information Sharing in Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Wang, Yu

    efforts such as joint intrusion detection. As an example, Phoenix Joint Terrorism Task Forces have information. Therefore, in an integrated ad hoc network, group-based data access must be controlled through. First, even with Elliptic Curve Cryptography, symmetric encryption still has its unique advantages

  18. Ad-Hoc Association-Rule Mining within the Data Warehouse Svetlozar Nestorov

    E-Print Network [OSTI]

    Nestorov, Svetlozar

    Ad-Hoc Association-Rule Mining within the Data Warehouse Svetlozar Nestorov Department of Computer software systems. Association-rule mining, which captures co-occurrence patterns within data, has attracted considerable efforts from data warehousing researchers and practitioners alike. Unfortunately, most data mining

  19. Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking

    E-Print Network [OSTI]

    Sirer, Emin Gun

    Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking protocols re- quires knowledge of the energy consumption behavior of actual wireless interfaces. But little practical information is available about the energy consumption behavior of well-known wireless network

  20. Abstract --Developing software for mobile or ad hoc scenarios is very cost intensive. Different software and

    E-Print Network [OSTI]

    Steimann, Friedrich

    for an appropriate development support for devices with short life cycles. Third-party solutions often do not reachAbstract -- Developing software for mobile or ad hoc scenarios is very cost intensive. Different processors and big memories are available in principle, they con- sume a great amount of valuable battery

  1. Distributed Broadcast Scheduling in Mobile Ad Hoc Networks with Unknown Guang Tan, Stephen A. Jarvis, James W. J. Xue, and Simon D. Hammond

    E-Print Network [OSTI]

    Jarvis, Stephen

    Distributed Broadcast Scheduling in Mobile Ad Hoc Networks with Unknown Topologies Guang Tan. In this paper we study the distributed broadcast schedul- ing problem in ad hoc networks. In broadcasting is a fundamental communication task in mobile ad hoc networks, and minimizing broadcasting time (or latency

  2. Abstract--A mobile ad hoc network is a wireless communication network which does not rely on a fixed

    E-Print Network [OSTI]

    Lyu, Michael R.

    hoc networks. We propose a secure public key authentication service based on a trust model nodes in the networks. We perform an overall evaluation of our proposed approach by simulations distributed systems, security in ad hoc networks is based on the use of a key management system

  3. PNNI routing support for ad hoc mobile networking: A flat architecture

    SciTech Connect (OSTI)

    Martinez, L.; Sholander, P.; Tolendino, L.

    1997-12-01T23:59:59.000Z

    This contribution extends the Outside Nodal Hierarchy List (ONHL) procedures described in ATM Form Contribution 97-0766. These extensions allow multiple mobile networks to form either an ad hoc network or an extension of a fixed PNNI infrastructure. This contribution covers the simplest case where the top-most Logical Group Nodes (LGNs), in those mobile networks, all reside at the same level in a PNNI hierarchy. Future contributions will cover the general case where those top-most LGNs reside at different hierarchy levels. This contribution considers a flat ad hoc network architecture--in the sense that each mobile network always participates in the PNNI hierarchy at the preconfigured level of its top-most LGN.

  4. PNNI routing support for ad hoc mobile networking: The multilevel case

    SciTech Connect (OSTI)

    Martinez, L.; Sholander, P.; Tolendino, L.

    1998-01-01T23:59:59.000Z

    This contribution extends the Outside Nodal Hierarchy List (ONHL) procedures described in ATM Forum Contributions 97-0766 and 97-0933. These extensions allow multiple mobile networks to form either an ad hoc network or an extension of a fixed PNNI infrastructure. A previous contribution (97-1073) covered the simplest case where the top-most Logical Group Nodes (LGNs), in those mobile networks, all resided at the same level in a PNNI hierarchy. This contribution covers the more general case wherein those top-most LGNs may reside at different PNNI hierarchy levels. Both of the SNL contributions consider flat ad hoc network architectures in the sense that each mobile network always participates in the PNNI hierarchy at the pre-configured level of its top-most LGN.

  5. Constructing Path Efficient and Energy Aware Virtual Multicast Backbones in Static Ad Hoc Wireless Networks

    E-Print Network [OSTI]

    Acharya, Tamaghna; Roy, Rajarshi; 10.5121/ijwmn.2010.2210

    2010-01-01T23:59:59.000Z

    For stationary wireless ad hoc networks, one of the key challenging issues in routing and multicasting is to conserve as much energy as possible without compromising path efficiency measured as end-to-end delay. In this paper, we address the problem of path efficient and energy aware multicasting in static wireless ad hoc networks. We propose a novel distributed scalable algorithm for finding a virtual multicast backbone (VMB). Based on this VMB, we have further developed a multicasting scheme that jointly improves path efficiency and energy conservation. By exploiting inherent broadcast advantage of wireless communication and employing a more realistic energy consumption model for wireless communication which not only depends on radio propagation losses but also on energy losses in transceiver circuitry, our simulation results show that the proposed VMB-based multicasting scheme outperforms existing prominent tree based energy conserving, path efficient multicasting schemes.

  6. A Data Synchronization Service for Ad Hoc Groups Terry Coatta, Norman C. Hutchinson, Andrew Warfield and Joseph H. T. Wong

    E-Print Network [OSTI]

    Warfield, Andrew

    A Data Synchronization Service for Ad Hoc Groups Terry Coatta, Norman C. Hutchinson, Andrew: norm@cs.ubc.ca Computer Laboratory, University of Cambridge, Cambridge, United Kingdom Email: andrew

  7. Protocoles distribues de contr^ole d'acc`es au medium pour reseaux ad hoc fortement charges

    E-Print Network [OSTI]

    Coupechoux, Marceau

    ´es Distributed MAC Protocols for Heavily Loaded Ad Hoc Networks Marceau Coupechoux Th`ese pr´esent´ee `a l juin 2004 #12;c Copyright by Marceau Coupechoux, 2005. All Rights Reserved #12;Remerciements Je

  8. A Scheduling Policy for Dense and Highly Mobile Ad Hoc Networks Marceau Coupechoux*, Christian Bonnet*, and Vinod Kumar

    E-Print Network [OSTI]

    Coupechoux, Marceau

    A Scheduling Policy for Dense and Highly Mobile Ad Hoc Networks Marceau Coupechoux*º, Christian, cbonnet@eurecom.fr ºResearch and Innovation, Alcatel CIT, Marcoussis France, {marceau

  9. Power control in reactive routing protocol for Mobile Ad Hoc Network

    E-Print Network [OSTI]

    Heni, Maher

    2012-01-01T23:59:59.000Z

    The aim of this work is to change the routing strategy of AODV protocol (Ad hoc On Demand Vector) in order to improve the energy consumption in mobile ad hoc networks (MANET). The purpose is to minimize the regular period of HELLO messages generated by the AODV protocol used for the research, development and maintenance of routes. This information is useful to have an idea about battery power levels of different network hosts. After storing this information, the node elect the shortest path following the classical model used this information to elect safest path (make a compromise) in terms of energy. Transmitter node does not select another node as its battery will be exhausted soon. Any node of the network can have the same information's about the neighborhoods as well as other information about the energy level of the different terminal to avoid routing using a link that will be lost due to an exhausted battery of a node in this link. Analytical study and simulations by Jist/SWANS have been conducted to no...

  10. An Overview of Mobile Ad Hoc Networks for the Existing Protocols and Applications

    E-Print Network [OSTI]

    Al-Omari, Saleh Ali K; 10.5121/jgraphhoc.2010.2107

    2010-01-01T23:59:59.000Z

    Mobile Ad Hoc Network (MANET) is a collection of two or more devices or nodes or terminals with wireless communications and networking capability that communicate with each other without the aid of any centralized administrator also the wireless nodes that can dynamically form a network to exchange information without using any existing fixed network infrastructure. And it's an autonomous system in which mobile hosts connected by wireless links are free to be dynamically and some time act as routers at the same time, and we discuss in this paper the distinct characteristics of traditional wired networks, including network configuration may change at any time, there is no direction or limit the movement and so on, and thus needed a new optional path Agreement (Routing Protocol) to identify nodes for these actions communicate with each other path, An ideal choice way the agreement should not only be able to find the right path, and the Ad Hoc Network must be able to adapt to changing network of this type at any...

  11. Managing Real-Time Database Transactions in Mobile Ad-Hoc Networks ** Le Gruenwald Shankar M. Banik Chuo N. Lau Matilde Montealegre

    E-Print Network [OSTI]

    Gruenwald, Le

    Managing Real-Time Database Transactions in Mobile Ad-Hoc Networks ** Le Gruenwald Shankar M. Banik, transaction management, ad-hoc networks. 1. INTRODUCTION Rapid developments in wireless technology have enabled mobile users to access data from different sites. The Mobile MultiDatabase Management Systems

  12. Performance Analysis of Contention Window Cheating Misbehaviors in Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Kalaiarasi, R; Pari, S Neelavathy; Sridharan, D

    2010-01-01T23:59:59.000Z

    Mobile Ad Hoc Network (MANET) is a collection of nodes that can be rapidly deployed as a multi-hop network without the aid of any centralized administration. Misbehavior is challenged by bandwidth and energy efficient medium access control and fair share of throughput. Node misbehavior plays an important role in MANET. In this survey, few of the contention window misbehavior is reviewed and compared. The contention window cheating either minimizes the active communication of the network or reduces bandwidth utilization of a particular node. The classification presented is in no case unique but summarizes the chief characteristics of many published proposals for contention window cheating. After getting insight into the different contention window misbehavior, few of the enhancements that can be done to improve the existing contention window are suggested. The purpose of this paper is to facilitate the research efforts in combining the existing solutions to offer more efficient methods to reduce contention win...

  13. Optimal Power Control for Concurrent Transmissions of Location-aware Mobile Cognitive Radio Ad Hoc Networks

    E-Print Network [OSTI]

    Song, Yi

    2011-01-01T23:59:59.000Z

    In a cognitive radio (CR) network, CR users intend to operate over the same spectrum band licensed to legacy networks. A tradeoff exists between protecting the communications in legacy networks and maximizing the throughput of CR transmissions, especially when CR links are unstable due to the mobility of CR users. Because of the non-zero probability of false detection and implementation complexity of spectrum sensing, in this paper, we investigate a sensing-free spectrum sharing scenario for mobile CR ad hoc networks to improve the frequency reuse by incorporating the location awareness capability in CR networks. We propose an optimal power control algorithm for the CR transmitter to maximize the concurrent transmission region of CR users especially in mobile scenarios. Under the proposed power control algorithm, the mobile CR network achieves maximized throughput without causing harmful interference to primary users in the legacy network. Simulation results show that the proposed optimal power control algori...

  14. Distributed Stochastic Power Control in Ad-hoc Networks: A Nonconvex Case

    E-Print Network [OSTI]

    Yang, Lei; Zhang, Junshan; Li, Jason H

    2011-01-01T23:59:59.000Z

    Utility-based power allocation in wireless ad-hoc networks is inherently nonconvex because of the global coupling induced by the co-channel interference. To tackle this challenge, we first show that the globally optimal point lies on the boundary of the feasible region, which is utilized as a basis to transform the utility maximization problem into an equivalent max-min problem with more structure. By using extended duality theory, penalty multipliers are introduced for penalizing the constraint violations, and the minimum weighted utility maximization problem is then decomposed into subproblems for individual users to devise a distributed stochastic power control algorithm, where each user stochastically adjusts its target utility to improve the total utility by simulated annealing. The proposed distributed power control algorithm can guarantee global optimality at the cost of slow convergence due to simulated annealing involved in the global optimization. The geometric cooling scheme and suitable penalty pa...

  15. A Multipath Energy-Aware On demand Source Routing Protocol for Mobile Ad-Hoc Networks

    E-Print Network [OSTI]

    Chettibi, Saloua

    2009-01-01T23:59:59.000Z

    Energy consumption is the most challenging issue in routing protocol design for mobile ad-hoc networks (MANETs), since mobile nodes are battery powered. Furthermore, replacing or recharging batteries is often impossible in critical environments such as in military or rescue missions. In a MANET, the energy depletion of a node does not affect the node itself only, but the overall network lifetime. In this paper, we present multipath and energy-aware on demand source routing (MEA-DSR) protocol, which exploits route diversity and information about batteries-energy levels for balancing energy consumption between mobile nodes. Simulation results, have shown that MEA-DSR protocol is more energy efficient than DSR in almost mobility scenarios.

  16. A Comprehensive Energy Conservation Solution for Mobile Ad Hoc Networks John A. Stine and Gustavo de Veciana

    E-Print Network [OSTI]

    de Veciana, Gustavo

    A Comprehensive Energy Conservation Solution for Mobile Ad Hoc Networks John A. Stine and Gustavo, TX 78712 Abstract- Multiple energy conserving approaches have been proposed for wireless networks Routing (NSR)1 , that these types of energy conservation mechanisms can be managed si- multaneously. We

  17. Abstract-Mobile Ad Hoc NETworks (MANETs) are an emerging class of network architectures that are characterized

    E-Print Network [OSTI]

    Perkins, Dmitri

    of fixed infrastructure. The primary motivation for such networks is increased flexibility and mobilityAbstract- Mobile Ad Hoc NETworks (MANETs) are an emerging class of network architectures that are characterized by their highly dynamic topology, limited resources (i. e., bandwidth and power), and lack

  18. A Power-Aware Technique to Manage Real-Time Database Transactions in Mobile Ad-Hoc Networks **

    E-Print Network [OSTI]

    Gruenwald, Le

    1 A Power-Aware Technique to Manage Real-Time Database Transactions in Mobile Ad-Hoc Networks ** Le@ou.edu; smbanik@ou.edu) ** This work is partially supported by the National Science Foundation grant No. EIA connectivity is required. Techniques that manage database transactions in MANET need to address additional

  19. With respect to energy balance in mobile ad hoc networks, there have been active researches proposing energy-aware

    E-Print Network [OSTI]

    Yu, Chansu

    ABSTRACT With respect to energy balance in mobile ad hoc networks, there have been active of energy-related metrics to find the most energy- balancing route in route discovery procedure. However there have been few works touching the energy balance during data transmission that is addressed

  20. Enhancing the Support of Multi-Hopping in an IEEE 802.11 Ad-Hoc Hanem A. Eladly

    E-Print Network [OSTI]

    Chen, Thomas M.

    Enhancing the Support of Multi-Hopping in an IEEE 802.11 Ad-Hoc Network Hanem A. Eladly SMU, Dept of EE, PO Box 750338, Dallas, TX, USA heladly@mail.smu.edu Thomas M. Chen SMU, Dept of EE, PO Box 750338, Dallas, TX, USA tchen@mail.smu.edu Abstract Previous studies have proved that the performance of IEEE 802

  1. Design Considerations for an On-Demand Minimum Energy Routing Protocol for a Wireless Ad Hoc Network

    E-Print Network [OSTI]

    Brown, Timothy X.

    1 Design Considerations for an On-Demand Minimum Energy Routing Protocol for a Wireless Ad Hoc- demand minimum energy routing protocol and suggests mechanisms for their implementation. We highlight of an 'energy aware' link cache for storing this information. We also compare the performance of an on-demand

  2. Abstract--Wireless Sensor Network (WSN) is an emerging special type of ad-hoc wireless networks technology. It is

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Abstract-- Wireless Sensor Network (WSN) is an emerging special type of ad-hoc wireless networks the needs for special type of applications where Wireless Sensor Networks (WSN) can play an important role that differentiate it from other types of wireless networks. These differences raise new challenges to be overcome

  3. Energy-Efficient Data Broadcasting in Mobile Ad-Hoc Networks** Le Gruenwald, Muhammad Javed, Meng Gu

    E-Print Network [OSTI]

    Gruenwald, Le

    is supported in part by National Science Foundation grant No. EIA-9973465 Abstract Energy saving is the mostEnergy-Efficient Data Broadcasting in Mobile Ad-Hoc Networks** Le Gruenwald, Muhammad Javed, Meng is the main method of information dissemination in wireless networks as its cost is independent of the number

  4. 228 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 7, NO. 2, APRIL 1999 Ad Hoc Mobility Management with

    E-Print Network [OSTI]

    Haas, Zygmunt J.

    the construction of UQS through the balanced incomplete block designs. The average cost, due to call loss is sometimes necessary to reduce the cost of mobility management. Index Terms--Ad hoc network, balanced on the average cost, we investigate the tradeoff between the system reliability and the cost of location updates

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

    E-Print Network [OSTI]

    Cui, Jun-Hong

    acoustic link capacity, are significantly different from ground-based mo- bile ad-hoc networks (MANET-disciplinary efforts of acoustic communication, signal pro- cessing and mobile acoustic network protocol design. I investigations, e.g., for marine incidents (especially involved with chemi- cal pollution and oil spill

  6. Power-Aware Routing in Mobile Ad Hoc Networks Suesh Singh and Mke Woo C. S. Mghavendra

    E-Print Network [OSTI]

    Han, Richard Y.

    in energy con- sumption obtained by using PAMAS, our MAC layer pr- tocol). Furthermore, using these new) or Wow insurance companies to tie claims horn the field. Building such ad hoc networks poses to be energy conserving so that battery fife is maximized. Several technologies are being developed to achieve

  7. Ad-hoc On-Demand Distance Vector Routing Charles E. Perkins

    E-Print Network [OSTI]

    Han, Richard Y.

    -hoc networks. Each Mobile Host operates as a specialized router, and routes are obtained as needed i.e., on

  8. Real-Time Spatio-Temporal Query Processing in Mobile Ad-Hoc Sensor Networks

    E-Print Network [OSTI]

    that has multiple sensors (e.g., mo- tion sensors, acoustic sensors, infrared light emitting diodes, and pa

  9. RealTime SpatioTemporal Query Processing in Mobile AdHoc Sensor Networks

    E-Print Network [OSTI]

    that has multiple sensors (e.g., mo­ tion sensors, acoustic sensors, infrared light emitting diodes,

  10. Spectrum Sharing between Cooperative Relay and Ad-hoc Networks: Dynamic Transmissions under Computation and Signaling Limitations

    E-Print Network [OSTI]

    Sun, Yin; Li, Yunzhou; Zhou, Shidong; Xu, Xibin

    2010-01-01T23:59:59.000Z

    This paper studies a spectrum sharing scenario between an uplink cognitive relay network (CRN) and some nearby low power ad-hoc networks. In particular, the dynamic resource allocation of the CRN is analyzed, which aims to minimize the average interfering time with the ad-hoc networks subject to a minimal average uplink throughput constraint. A long term average rate formula is considered, which is achieved by a half-duplex decode-and-forward (DF) relay strategy with multi-channel transmissions. Both the source and relay are allowed to queue their data, by which they can adjust the transmission rates flexibly based on sensing and predicting the channel state and ad-hoc traffic. The dynamic resource allocation of the CRN is formulated as a non-convex stochastic optimization problem. By carefully analyzing the optimal transmission time scheduling, it is reduced to a stochastic convex optimization problem and solved by the dual optimization method. The signaling and computation processes are designed carefully t...

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

    E-Print Network [OSTI]

    Chettibi, Saloua

    2009-01-01T23:59:59.000Z

    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

  12. Qunits: queried units in database search

    E-Print Network [OSTI]

    Nandi, Arnab

    2009-01-01T23:59:59.000Z

    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...

  13. A State-of-the-art Survey on IDS for Mobile Ad-Hoc Networks and Wireless Mesh Networks

    E-Print Network [OSTI]

    Deb, Novarun; Chaki, Nabendu

    2011-01-01T23:59:59.000Z

    An Intrusion Detection System (IDS) detects malicious and selfish nodes in a network. Ad hoc networks are often secured by using either intrusion detection or by secure routing. Designing efficient IDS for wireless ad-hoc networks that would not affect the performance of the network significantly is indeed a challenging task. Arguably, the most common thing in a review paper in the domain of wireless networks is to compare the performances of different solutions using simulation results. However, variance in multiple configuration aspects including that due to different underlying routing protocols, makes the task of simulation based comparative evaluation of IDS solutions somewhat unrealistic. In stead, the authors have followed an analytic approach to identify the gaps in the existing IDS solutions for MANETs and wireless mesh networks. The paper aims to ease the job of a new researcher by exposing him to the state of the art research issues on IDS. Nearly 80% of the works cited in this paper are published ...

  14. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS: SPECIAL ISSUES ON WIRELESS AD HOC NETWORKS 1 Principles and Protocols for Power Control in

    E-Print Network [OSTI]

    Kawadia, Vikas

    Principles and Protocols for Power Control in Wireless Ad Hoc Networks Vikas Kawadia and P. R. Kumar-- Transmit power control is a prototypical example of a cross-layer design problem. The transmit power level consumption. The challenge is to determine where in the architecture the power control problem

  15. An Intrusion Detection Tool for AODV-based Ad hoc Wireless Networks

    E-Print Network [OSTI]

    California at Santa Barbara, University of

    University of California, Santa Barbara {vigna,sumitg,kavitha,ebelding,kemm}@cs.ucsb.edu Abstract Mobile ad. These techniques prevent a range of attacks against routing protocols but are expensive to de- ploy on energy the stream of audit data to identify evidence of the occurrence of the modeled attacks. Misuse and anomaly

  16. An Intrusion Detection Tool for AODV-based Ad hoc Wireless Networks

    E-Print Network [OSTI]

    Belding-Royer, Elizabeth M.

    University of California, Santa Barbara vigna,sumitg,kavitha,ebelding,kemm¡ @cs.ucsb.edu Abstract Mobile ad. These techniques prevent a range of attacks against routing protocols but are expensive to de- ploy on energy "signatures") that are matched against the stream of audit data to identify evidence of the oc- currence

  17. Ad hoc cloud computing 

    E-Print Network [OSTI]

    McGilvary, Gary Andrew

    2014-11-27T23:59:59.000Z

    Commercial and private cloud providers offer virtualized resources via a set of co-located and dedicated hosts that are exclusively reserved for the purpose of offering a cloud service. While both cloud models appeal to ...

  18. The "Hot Potato" Case: Challenges in Multiplayer Pervasive Games Based on Ad hoc Mobile Sensor Networks and the Experimental Evaluation of a Prototype Game

    E-Print Network [OSTI]

    Chatzigiannakis, Ioannis; Akribopoulos, Orestis; Logaras, Marios; Kokkinos, Panagiotis; Spirakis, Paul

    2010-01-01T23:59:59.000Z

    In this work, we discuss multiplayer pervasive games that rely on the use of ad hoc mobile sensor networks. The unique feature in such games is that players interact with each other and their surrounding environment by using movement and presence as a means of performing game-related actions, utilizing sensor devices. We discuss the fundamental issues and challenges related to these type of games and the scenarios associated with them. We also present and evaluate an example of such a game, called the "Hot Potato", developed using the Sun SPOT hardware platform. We provide a set of experimental results, so as to both evaluate our implementation and also to identify issues that arise in pervasive games which utilize sensor network nodes, which show that there is great potential in this type of games.

  19. (KOSEF) (2010-0015846) . Recently, among P2P(Peer-to-Peer) systems in MANET(Mobile Ad-hoc Network), double-layered super-peer systems

    E-Print Network [OSTI]

    Yang, Sung-Bong

    , Wendi Heinzelman, "ed. Mobile Ad Hoc Networks: Energy-Efficient Real-Time Data Communications", Springer-peer systems, there are the MOB system considers the mobility of peers, the Energy system considers the energy of peers, and the Hybrid system considers both mobility and energy for selecting super peers during

  20. Accelerating Network Traffic Analytics Using Query-DrivenVisualization

    SciTech Connect (OSTI)

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

    2006-07-29T23:59:59.000Z

    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.

  1. Advanced Query for Query Developers

    E-Print Network [OSTI]

    Shull, Kenneth R.

    at the front of the row and using the Action drop down menu. HOT Tip! Only Private queries can be saved or private. HOT Tip! Save your queries into a Favorites folder by selecting them in the check box to another user. You should save a Public query as a Private one and then can save/share it with another user

  2. Intrusion detection in mobile ad hoc networks

    E-Print Network [OSTI]

    Sun, Bo

    2005-08-29T23:59:59.000Z

    .Zone-BasedIntrusionDetectionSystem(ZBIDS)...... 25 1. ZBIDSFramework.................... 25 D.InternalModeloftheIDSAgent............... 29 1. DataCollectionModule................. 30 2. DetectionEngine..................... 31 3. Local Aggregation and Correlation Engine (LACE) . . 32 4. Global... have been widely regarded as being part of the solution to protect today?s computer systems. Research on IDSs began with a report by Anderson [9] followed by Denning?s seminal paper [10], which lays the foundation for most of the current intrusion...

  3. Ad Hoc Assessment Committee Meeting Notes

    E-Print Network [OSTI]

    O'Laughlin, Jay

    learning outcomes · Modify the template to include space to provide information on results achieved from on university learning outcomes and template categories/directions using a "hover" feature · Simplify criteria and program benchmarks o Student interview processes, including HAC requirements o Survey

  4. Adaptive protocols for mobile ad hoc networks

    E-Print Network [OSTI]

    Holland, Gavin Douglas

    2005-02-17T23:59:59.000Z

    . We investigate new link layer mechanisms that dynamically monitor and adapt to changes in link quality, including a protocol that uses common control messages to form a tight feedback control loop for adaptation of the link data rate to best match... of the presence of multirate links. We then investigate the performance of iv TCP, showing how communication outages caused by link failures and routing delays can be very detrimental to its performance. In response, we present a solution to this problem that uses...

  5. Smart & Connected Ad-Hoc Committee

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    used to advance the utilization of demand response ready equipment on utility load-management and load- shaping programs Objectives of Specification Development To apply the...

  6. Communication Algorithms for Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Viqar, Saira

    2012-10-19T23:59:59.000Z

    .4 Jittering trajectories : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 37 3.5 Uniform neighbor discovery block diagram. Each BNDP instance has a message processing (MP) automaton associated with it. : : : : : : : : : : 38 3.6 Hexagonal...

  7. Clock synchronization for mobile ad hoc networks 

    E-Print Network [OSTI]

    Chandra, Rajan

    2013-02-22T23:59:59.000Z

    As mobile networking advances, there is a need for services such as clock synchronization that improve performance and support the development of higher-level applications. This can be achieved by adapting existing algorithms (such as the Network...

  8. Consistent Query Answering Of Conjunctive Queries Under Primary Key Constraints

    E-Print Network [OSTI]

    Pema, Enela

    2014-01-01T23:59:59.000Z

    Queries and Primary Key Constraints . . . . . . . . . .of Employee w.r.t. the primary key SSN ? {name, salary} . .query answering under primary keys: a characterization of

  9. Query Optimization Techniques Class Hierarchies

    E-Print Network [OSTI]

    Mannheim, Universität

    Query Optimization Techniques Exploiting Class Hierarchies Sophie Cluet 1 Guido Moerkotte 2 1 INRIA Since the introduction of object base management systems (OBMS), many query optimization techniques tailored for object query languages have been proposed. They adapt known optimization techniques

  10. Indexing and Querying Avishek Anand

    E-Print Network [OSTI]

    Nejdl, Wolfgang

    ("spears" AND "britney") OR ("lady" AND "gaga") Phrase queries -- entire phrase present in the same order

  11. Smithsonian/NASA ADS Physics/Geophysics Abstract Service Find Similar Abstracts (with default settings below)

    E-Print Network [OSTI]

    Mojahedi, Mohammad

    Smithsonian/NASA ADS Physics/Geophysics Abstract Service · Find Similar Abstracts (with default | Query Form | Preferences | HELP | FAQ Physics/Geophysics arXiv e-prints Send Query Reset #12;

  12. Query Racing: Fast Completeness Certification of Query Results

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    in an untrusted DBMS. Our main contribution is the concept of "Query Race": we split up a general query require neither previous knowledge of queries nor specific support by the DBMS. We validate our approach been performed is a much harder task, if we intend to maintain DBMS-level efficiency. Many proposal can

  13. HYPERION/ODS MODIFYING CANNED QUERIES

    E-Print Network [OSTI]

    Suzuki, Masatsugu

    HYPERION/ODS MODIFYING CANNED QUERIES **Quick review of the Hyperion Query Pane: Sections: Where, Criteria, Views and Joins. Hyperion/ODS ­ Modifying Canned Queries 1 #12;What Canned Queries are Available Note: Go to http://ods.binghamton.edu to view the canned query support documentation for detailed

  14. Query | Department of Energy

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011 Strategic2 OPAM615_CostNSAR - TProcuring SolarNo. 195 -PuebloEnergy AprilQuerylQuery

  15. On Cartesian trees and range minimum queries

    E-Print Network [OSTI]

    Demaine, Erik D.

    We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the range minimum query problem, a Cartesian tree ...

  16. Universit at Konstanz Query Deforestation

    E-Print Network [OSTI]

    Scholl, Marc H.

    Universit¨ at Konstanz Query Deforestation Torsten Grust Marc H. Scholl Konstanzer Schriften: http://www.informatik.uni--konstanz.de/Schriften #12; Query Deforestation Torsten Grust Marc H. Scholl pursues the goal of employing foldr­build deforestation for the derivation of eOEcient streaming programs

  17. Ad Hoc Committee on Employment Policies May 4, 2000

    E-Print Network [OSTI]

    Chou, James

    for Service Contracts P. Proposed Benefits and Perquisites for Long Term Casuals ii #12;Executive Summary - 1

  18. INDOOR POSITIONING AN AD-HOC POSITIONING SYSTEM Rainer Mautz

    E-Print Network [OSTI]

    to enable continuous tracking of the location of devices in all environments. Highly accurate, reliable 3D computers, printers, or simple tags with wireless radio connections that are `intelligent' enough to be able

  19. A Benchmarking System for Mobile Ad Hoc Network Routing Protocols

    E-Print Network [OSTI]

    Hiranandani, Daniel

    2012-01-01T23:59:59.000Z

    Limited. High-level smart meter data tra?c analysis, 2010. [2x2) equipped with smart energy meters that are able toas ?xed data sinks in smart energy meter networks [18] or

  20. Maximizing the throughput of large ad hoc wireless networks

    E-Print Network [OSTI]

    Hua, Y; Huang, Y; Garcia-Luna-Aceves, J J

    2006-01-01T23:59:59.000Z

    multi-input, single-output (MISO) protocol. During eachthe maximum throughput of the MISO protocol, in bits-meters/s/ Hz/node, is C MISO = (n ? 1) A log 2 1 + 2n P T ? h

  1. Throughput Analysis of Wireless Ad-Hoc Cognitive Radio Networks 

    E-Print Network [OSTI]

    Banaei, Armin

    2014-04-25T23:59:59.000Z

    In this dissertation we consider the throughput performance of cognitive radio networks and derive the optimal sensing and access schemes for secondary users that maximizes their sum-throughput while guaranteeing certain ...

  2. Probabilistic Power Management for Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Li, Baochun

    mode to conserve energy, if they do not participate as sources or destinations of active connections of the local neighborhood within its range. Connectivity is still maintained due to the natural routing networks. Recent work has shown that, by appropri- ately powering off nodes, energy may be significantly

  3. Distributed Mobility Transparent Broadcast in Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Sikdar, Biplab

    and highly adaptive to node mobility. It does not demand any neighborhood information and incurs little£ciency and alleviated interference; on the other hand, the proposed protocol achieves network energy balance by randomly- mum Connected Dominating Set (MCDS) should be elected as relay nodes, and identifying the MCDS

  4. Topology Control in Ad Hoc Wireless Networks Using Cooperative Communication

    E-Print Network [OSTI]

    Wu, Jie

    energy consumption within its 2-hop neighborhood without losing connectivity under the CC model such that the resulting topology is strongly connected and the total energy expenditure for achieving the strong connectivity is minimized. In order to reduce the energy consumption, we take advantage of a physical layer

  5. Age Matters: Efficient Route Discovery in Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Grossglauser, Matthias

    part) by the National Competence Center in Research on Mobile Information and Communication Systems, resources such as bandwidth and bat- tery power are usually severely constrained in such networks. Therefore incur less overhead at the expense of higher route setup latency. Hybrid routing protocols [7, 6

  6. A Full Scale Wireless Ad Hoc Network Test Bed

    E-Print Network [OSTI]

    Brown, Timothy X.

    that are bench top, indoor, fixed outdoor, and mobile outdoor. Bench top test beds employ MAC filtering, RF and propagation of the outdoor environment. Full scale outdoor test beds are often restricted to fixed sites [1 features: 1. Test bed results are reproducible. 2. The test bed provides a common platform for testing

  7. A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks

    E-Print Network [OSTI]

    Wu, Jie

    -to-date") before the broadcast process or a reactive process (i.e., "on-the- fly") during the broadcast process

  8. Broadcasting in Ad Hoc Networks Based on Self-Pruning

    E-Print Network [OSTI]

    Wu, Jie

    and maintained through either a proactive process (i.e., "up-to-date") or a reactive process (i.e., "on

  9. PERFORMANCE EVALUATION OF AD HOC PROTOCOLS FOR UNDERWATER NETWORKS

    E-Print Network [OSTI]

    amongst Unmanned Underwater Vehicles (UUVs). Underwater networks face extreme challenges of low bandwidth amongst Unmanned Underwater Vehicles (UUVs). Underwater networks face extreme challenges of low bandwidth that the movement of underwater vehicles is not random and that it can be predicted or it is known beforehand

  10. Smart Services for Ad Hoc Databases University of Washington

    E-Print Network [OSTI]

    or resources. · The initial investment required to design and populate a database is also costly. Developing Capital estimated that 90% of all business data is maintained in spreadsheets [12]. Permission to copy data-base from lists of addresses of nearby schools, locations of resources (e.g., ambulances

  11. Enabling Disconnected Transitive Communication in Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Chaudhuri, Soma

    are no longer explicitly aware of their presence, much the way the electric motor exists in the world today into multiple clusters, with connectivity available within each partition but not across partitions. Freeing

  12. Topology management protocols in ad hoc wireless sensor networks

    E-Print Network [OSTI]

    Kim, Hogil

    2009-05-15T23:59:59.000Z

    A wireless sensor network (WSN) is comprised of a few hundred or thousand au-tonomous sensor nodes spatially distributed over a particular region. Each sensornode is equipped with a wireless communication device, a small microprocessor, anda battery...

  13. RTS/CTS-Induced Congestion in Ad Hoc Wireless LANs

    E-Print Network [OSTI]

    Carruthers, Jeffrey

    . Figure 1 depicts a conceptual "throughput versus load" curve for a network. In the presence of congestion to zero as the load increases, i.e. it follows the "Congested" curve in Figure 1 instead of following a certain point, the network throughput decreases with increasing load instead of maintaining its peak value

  14. Geographic multicasting in wireless ad-hoc networks

    E-Print Network [OSTI]

    Gopalakrishnan, Dhilip

    1998-01-01T23:59:59.000Z

    . A. The Network Model . B. Basic Principles C. The Geocast-Routing Protocol 1. Details of the Algorithm . 2. Partial Link Reversal Scheme . 3. Creation of the DAG 4. Maintenance of the DAG D. The Geocast - Multicast Protocol 1. Geocast... I Geocast-Routing: Message Types 19 LIST OF FIGURES FIGURE Page An Illustration 13 Directed Acyclic Graph 17 Creation of the Network DAG 20 Link Failure Without Link Reversals Link Failure With Link Reversals . . 21 23 Partition Detection...

  15. A Statistical Framework for Intrusion Detection in Ad Hoc Networks

    E-Print Network [OSTI]

    Sarkar, Saswati

    with limited processing power. The overall framework provides a good balance between complexity and performance means of electronic com- munication in areas where establishing infrastructure like base stations etc. [5], [6]. These intrusions leverage system vulnerabilities. There are two ways to prevent

  16. Continuum Equilibria for Routing in Dense Ad-hoc Networks

    E-Print Network [OSTI]

    Lucioles, B.P. 93, 06902 Sophia-Antipolis Cedex, France. Email: Eitan.Altman@sophia.inria.fr Pierre Bernhard I3S, Universit´e de Nice-Sophia Antipolis and CNRS 940 Route des Colles, B.P. 145, 06903 Sophia.P. 93, 06902 Sophia-Antipolis Cedex, France. Email: Alonso.Silva@sophia.inria.fr Merouane Debbah SUPELEC

  17. Capacity of Wireless Ad Hoc Networks Using Practical Directional Antennas

    E-Print Network [OSTI]

    , which is called MC-MDA network. The capacity in MC-MDA network is derived under arbitrary and random of side lobe and back lobe into account. We derive the capacity upper-bounds of MC-MDA networks decreases when s increases. Moreover, we compare the network capacity of MC-MDA using the simplified antenna

  18. The COMPOW Protocol for Power Control in Ad Hoc Networks

    E-Print Network [OSTI]

    Kawadia, Vikas

    .S Sreenivas and P.R. Kumar The Power Control problem · How do we choose the right transmit power level ­ Power;3 Affects battery life · Higher power transmission is unnecessary if the receiver is close of links is critical · Find a way to ensure bidirectionality without breaking existing protocols

  19. A Cooperative Communication Protocol for Wireless Ad-hoc Networks

    E-Print Network [OSTI]

    , MMII. All rights reserved. The author hereby grants to MIT permission to reproduce and distribute in the network layer, where all nodes act as routers to relay messages. Cooperative transmission takes this idea. He was quick to o#11;er solutions when I worked my way into a corner, and constantly prompted me

  20. Truthful resource management in wireless ad hoc networks 

    E-Print Network [OSTI]

    Cai, Jianfeng

    2005-11-01T23:59:59.000Z

    for the public afiairs. This is reasonable because the network-wide energy saving is beneflcial for each node. Then, Pfvj = ^Pvi;vk + ^Pvk;vi+1 (3.1) vj is the winner of an auction and vk is the node of the second best bid. . After a redirection ends, another.... As an overhearing node vj competes to be the redirector within a hop, it needs to report to upstream node, vi, the minimum power Pvi;vj and listen to the downstream node, vi+1, to get the minimum power Pvj;vi+1. Since the payofi for a redirector is equal...

  1. Performance Evaluation of Energy Efficient Ad Hoc Routing Protocols

    E-Print Network [OSTI]

    Wang, Yu

    28223, USA {lcao2, tdahlber, ywang32}@uncc.edu Abstract-- Energy aware routing protocols metric and aim to save energy consumption per packet. However, such protocols do not take the nodes' energy capacity into account. Thus, the energy consumption is not fair among nodes in the network

  2. Performance Evaluation of Ad Hoc Routing Protocols for Military Communications

    E-Print Network [OSTI]

    Bouras, Christos

    in an environment without a fixed infrastructure, the nodes are mobile, the wireless medium has its own limitations are search-and-rescue operations, military deployment in hostile environment, and several types of police of these networks. The nodes act as routers in an environment without a fixed infrastructure, the nodes are mobile

  3. Power Efficient Broadcasting with Cooperative Diversity in Ad hoc Networks

    E-Print Network [OSTI]

    Krishnamurthy, Srikanth

    - munications can help combat interference and fading and hence, significantly improve the reliability-Output (MISO) system, a Single-Input Multi-Output (SIMO) system or a Multi-Input Multi- Output (MIMO) system exploits the broadcast nature of the wireless channel to emulate a MISO system. Nodes par- ticipating

  4. A Benchmarking System for Mobile Ad Hoc Network Routing Protocols

    E-Print Network [OSTI]

    Hiranandani, Daniel

    2012-01-01T23:59:59.000Z

    Grid Node Density Map . . . . . . . . . . . . . . . . .9: Smart Energy Grid Node Density Map DSDV maintainng a

  5. Routing in Vehicular Ad Hoc Networks: A Survey

    E-Print Network [OSTI]

    Wang, Yu

    have already begun to invest inter-vehicle networks. Audi, BMW, DaimlerChrysler, Fiat, Renault focuses on providing wireless access for the vehicular environment. According to the official IEEE 802

  6. Throughput Analysis of Wireless Ad-Hoc Cognitive Radio Networks

    E-Print Network [OSTI]

    Banaei, Armin

    2014-04-25T23:59:59.000Z

    In this dissertation we consider the throughput performance of cognitive radio networks and derive the optimal sensing and access schemes for secondary users that maximizes their sum-throughput while guaranteeing certain quality of service...

  7. Security Communications Protocol Ad Hoc Working Group | Department of

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33Frequently AskedEnergy SmallImplementingSecurity SymposiumSecuring the Nation's GridEnergy

  8. Section 180(c) Ad Hoc Working Group | Department of Energy

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011 Strategic2Uranium Transfer to FundPreparedContinuing Appropriations Act |

  9. Security Communications Protocol Ad Hoc Working Group | Department of

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011 Strategic2Uranium Transfer to FundPreparedContinuing AppropriationsWLANs

  10. Top-N Query: Query Language, Distance Function and Processing Strategies

    E-Print Network [OSTI]

    Meng, Weiyi

    Top-N Query: Query Language, Distance Function and Processing Strategies Yuxi Chen, Weiyi Meng@cs.binghamton.edu Abstract. The top-N query problem is to find the N results that satisfy the query condition the best and products are sold on the Internet. This paper addresses three important issues related to the top-N query

  11. Contextual Query Using Bell Tests

    E-Print Network [OSTI]

    Joao Barros; Zeno Toffano; Youssef Meguebli; Bich-Liên Doan

    2013-09-30T23:59:59.000Z

    Tests are essential in Information Retrieval and Data Mining in order to evaluate the effectiveness of a query. An automatic measure tool intended to exhibit the meaning of words in context has been developed and linked with Quantum Theory, particularly entanglement. "Quantum like" experiments were undertaken on semantic space based on the Hyperspace Analogue Language (HAL) method. A quantum HAL model was implemented using state vectors issued from the HAL matrix and query observables, testing a wide range of windows sizes. The Bell parameter S, associating measures on two words in a document, was derived showing peaks for specific window sizes. The peaks show maximum quantum violation of the Bell inequalities and are document dependent. This new correlation measure inspired by Quantum Theory could be promising for measuring query relevance.

  12. Reporting Tools Course ID: FMS121

    E-Print Network [OSTI]

    Shull, Kenneth R.

    Reporting Tools Course ID: FMS121 PS Query 03/31/2009 © 2009 Northwestern University FMS121 0 Introduction to Query For Query Developers Query is an ad-hoc reporting tool that allows you to retrieve data will have access to both query viewer and query manager pages. #12;Reporting Tools Course ID: FMS121 PS

  13. Reporting Tools Course ID: FMS121

    E-Print Network [OSTI]

    Shull, Kenneth R.

    Reporting Tools Course ID: FMS121 PS Query 03/31/2009 © 2009 Northwestern University FMS121 0 Introduction to Query For Query Viewers Query is an ad-hoc reporting tool that allows you to retrieve data will have access to both query viewer and query manager pages. #12;Reporting Tools Course ID: FMS121 PS

  14. Constrained Querying of Multimedia Databases

    E-Print Network [OSTI]

    Vitter, Jeffrey Scott; Natsev, Apostol; Smith, John R.; Chang, Yuan-Chi; Li, Chung-Sheng

    2001-01-01T23:59:59.000Z

    for joining fuzzy result sets. 1.3.1. Multimedia querying The problem of searching multimedia data has received considerable attention in the last few years. The early image query systems, such as IBM’s QBIC,14,15,3 MIT’s Photobook,16,5 the Virage system,4 etc... size size distance motion directional motion motion positional order order order length 0.1 0.3 0.6 0.5 0.5 0.50.50.50.5 Figure 3. Example of a concept representation from the sports video domain. 4. RESEARCH ISSUES In this section, we investigate...

  15. On Querying OBO Ontologies Using a DAG Pattern Query Language

    E-Print Network [OSTI]

    Gupta, Amarnath

    }@sdsc.edu Abstract. The Open Biomedical Ontologies (OBO) is a consortium that serves as a repository of ontologies and query evaluation techniques for the retrieval and manip- ulation of graph-structured data have been investigated since the late 80s [1,2], through the era of object-oriented data models [3,4,5] up to the more

  16. IT Licentiate theses Query Authentication and

    E-Print Network [OSTI]

    Flener, Pierre

    IT Licentiate theses 2008-002 Query Authentication and Data Confidentiality in Wireless Sensor of Licentiate of Philosophy in Computer Science at Uppsala University 2008 #12;Query Authentication and Data

  17. Assisting Web Search Using Query Suggestion Based on Word Similarity Measure and Query Modification

    E-Print Network [OSTI]

    Ng, Yiu-Kai Dennis

    . For example, when the word "Tiger" is entered by a user, current web search engines are mostly focusedAssisting Web Search Using Query Suggestion Based on Word Similarity Measure and Query Modification search engines is query suggestion (QS), which assists users in formulating keyword queries by suggesting

  18. Dynamic Query Forms for Database Queries Liang Tang, Tao Li, Yexi Jiang, and Zhiyuan Chen

    E-Print Network [OSTI]

    Li, Tao

    queries on databases. However, the creation of customized queries totally depends on users' manual editing. Different from traditional document retrieval, users in database · Liang Tang, Tao Li, and Yexi Jiang1 Dynamic Query Forms for Database Queries Liang Tang, Tao Li, Yexi Jiang, and Zhiyuan Chen

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

    SciTech Connect (OSTI)

    Wu, Jerry; Wu, Kesheng

    2011-04-18T23:59:59.000Z

    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.

  20. Query Answering in Data Integration Systems

    E-Print Network [OSTI]

    Salloum, Mariam

    2011-01-01T23:59:59.000Z

    the AbeBooks.com data collection. Data Integration Systemquery plans for data integration. In Data Engineering, 2002.Recursive query plans for data integration. Journal of Logic

  1. Query

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011 Strategic2 OPAM615_CostNSAR - TProcuring SolarNo. 195 -PuebloEnergy AprilQueryl

  2. BayesDB : querying the probable implications of tabular data

    E-Print Network [OSTI]

    Baxter, Jay

    2014-01-01T23:59:59.000Z

    BayesDB, a Bayesian database table, lets users query the probable implications of their tabular data as easily as an SQL database lets them query the data itself. Using the built-in Bayesian Query Language (BQL), users ...

  3. Reverse Top-k Queries [DRAFT VERSION

    E-Print Network [OSTI]

    Reverse Top-k Queries [DRAFT VERSION] Akrivi Vlachou # , Christos Doulkeridis # , Yannis Kotidis become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries have been mainly studied from the perspective of the user

  4. Fault Tolerant Evaluation of Continuous Selection Queries over Sensor Data

    E-Print Network [OSTI]

    Lazaridis, Iosif; Han, Qi; Mehrotra, Sharad; Venkatasubramanian, Nalini

    2009-01-01T23:59:59.000Z

    Evaluation of Continuous Selection Queries over Sensor Dataevaluation of continuous selection queries (CSQs) over sensor-sensor suffices and there is no Fault Tolerant Evaluation of

  5. Classifying Web Search Queries to Identify High Revenue Generating Customers

    E-Print Network [OSTI]

    Jansen, James

    searching, the set of terms for which a user searches is called the query. If a user enters a query and then clicks on a result, these query terms are embedded within the URL that is passed from the search engineClassifying Web Search Queries to Identify High Revenue Generating Customers Adan Ortiz-Cordova 329

  6. Learning Semantic Query Suggestions Edgar Meij1

    E-Print Network [OSTI]

    de Rijke, Maarten

    Learning Semantic Query Suggestions Edgar Meij1 , Marc Bron1 , Laura Hollink2 , Bouke Huurnink1 , and Maarten de Rijke1 1 ISLA, University of Amsterdam, Science Park 107, 1098 XG Amsterdam {edgar

  7. Querying Schemas With Access Restrictions

    E-Print Network [OSTI]

    Benedikt, Michael; Ley, Clemens

    2012-01-01T23:59:59.000Z

    We study verification of systems whose transitions consist of accesses to a Web-based data-source. An access is a lookup on a relation within a relational database, fixing values for a set of positions in the relation. For example, a transition can represent access to a Web form, where the user is restricted to filling in values for a particular set of fields. We look at verifying properties of a schema describing the possible accesses of such a system. We present a language where one can describe the properties of an access path, and also specify additional restrictions on accesses that are enforced by the schema. Our main property language, AccLTL, is based on a first-order extension of linear-time temporal logic, interpreting access paths as sequences of relational structures. We also present a lower-level automaton model, Aautomata, which AccLTL specifications can compile into. We show that AccLTL and A-automata can express static analysis problems related to "querying with limited access patterns" that h...

  8. Failure Analysis in Query Construction: Data and Analysis from A Large Sample of Web Queries

    E-Print Network [OSTI]

    Jansen, James

    ­ more details are on its Web site. Excite searches are based on the exact terms that a user enters in the query, however, capitalization is disregarded. Stemming is not available. Multiple term searches return,473 queries from 18,113 users of Excite, a major Web search engine. Given that many digital libraries

  9. Query Plans for Conventional and Temporal Queries Involving Duplicates and Ordering

    E-Print Network [OSTI]

    Snodgrass, Richard T.

    substantially from built- in temporal support in the DBMS. To achieve this, temporal query representation for providing temporal support both via a stand-alone temporal DBMS and via a layer on top of a conventional DBMS. By capturing duplicate removal and retention and order preservation for all queries, as well

  10. Query optimization in nested relational databases

    E-Print Network [OSTI]

    Rathakrishnan, Balaji

    1992-01-01T23:59:59.000Z

    120 75 Fig. 5. Example for nest 20 this does not apply to nests involving multiple attributes [5]. 3. An unnest operator is an inverse of the nest operator. That is, p[&'](~[&'= &](ff)) = & 4. A nest operator is not always an inverse... IV THE EXTENDED RECURSIVE ALGEBRA . A. The algebra 1 2 3 4 16 16 16 16 18 20 22 24 24 27 28 29 29 34 39 43 44 44 CHAPTER Page V QUERY OPTIMIZATION IN RELATIONAL DATABASES . . 54 A. Steps in query processing . B. Algebraic...

  11. Query-based database policy assurance using semantic web technologies

    E-Print Network [OSTI]

    Soltren, José Hiram

    2009-01-01T23:59:59.000Z

    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, ...

  12. Querying Provenance Information in Distributed Environments Jing Zhao*, Yogesh Simmhan

    E-Print Network [OSTI]

    Prasanna, Viktor K.

    provenance repository shared by that collaboration, while a smart power grid workflow that makes city formalize: provenance retrieval query and provenance filter query. Our problem is motivated by Smart

  13. On the Equivalence of Distributed Systems with Queries and Communication$

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    On the Equivalence of Distributed Systems with Queries and Communication$ Serge Abiteboula , Balder a common goal, such as eval- uating some query. We study the equivalence of such systems. We model for performing tasks such as sending, receiving and querying data. As our model is quite general, the equivalence

  14. On the Equivalence of Distributed Systems with Queries and Communication

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    On the Equivalence of Distributed Systems with Queries and Communication Serge Abiteboul INRIA, such as evaluate some query. We study the equivalence of such systems. We model a dis- tributed system such as sending, receiving and querying data. As our model is quite general, the equivalence problem turns out

  15. Roadmap Query for Sensor Network Assisted Navigation in Dynamic Environments

    E-Print Network [OSTI]

    Lu, Chenyang

    Roadmap Query for Sensor Network Assisted Navigation in Dynamic Environments Sangeeta Bhattacharya approach that integrates a roadmap based navigation algorithm with a novel WSN query protocol called Roadmap Query (RQ). RQ enables collection of frequent, up-to- date information about the surrounding

  16. Asymmetric Structure-Preserving Subgraph Queries for Large Graphs

    E-Print Network [OSTI]

    Choi, Byron "Koon Kau"

    Asymmetric Structure-Preserving Subgraph Queries for Large Graphs Zhe Fan1 Byron Choi1 Jianliang Xu the novel cyclic group based encryption so that query processing is transformed into a series of private are effective. I. INTRODUCTION Subgraph queries (via subgraph isomorphism) are a fun- damental and powerful

  17. A Study of Query Length Avi Arampatzis1

    E-Print Network [OSTI]

    Arampatzis, Avi

    length, and fit power-law and Poisson distribu- tions to four different query sets. We provide and a power-law distribution for longer queries, that better fits real query length distributions than earlier proposals. Categories and Subject Descriptors: H.3 [Information Storage and Re- trieval]: H.3.3 Information

  18. A Simple Model for Classifying Web Queries by User Intent

    E-Print Network [OSTI]

    Rosso, Paolo

    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

  19. Query Suggestions for Mobile Search: Understanding Usage Patterns

    E-Print Network [OSTI]

    Tomkins, Andrew

    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

  20. XQzip: Querying Compressed XML Using Structural Indexing

    E-Print Network [OSTI]

    Ng, Wilfred Siu Hung

    effective XML compressors, such as XMill, have been recently proposed to solve this data inflation problem years, many XML compressors have been proposed to solve this data inflation problem. There are two types, they do not address the problem of running queries on com- pressed XML data. More recently, some

  1. Query Deforestation Torsten Grust Marc H. Scholl

    E-Print Network [OSTI]

    Grust, Torsten

    Query Deforestation Torsten Grust Marc H. Scholl 68/1998 Faculty of Mathematics and Computer foldr­build deforestation for the derivation of eOEcient streaming programs â?? programs that do the deforestation idea amenable to a wide range of type constructors and operators. In addition to the removal

  2. Variable Interactions in Query-Driven Visualization

    SciTech Connect (OSTI)

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

    2007-10-25T23:59:59.000Z

    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.

  3. EuroSPI 2009 -1 Software provides an increasing part of the added value of modern automation systems and

    E-Print Network [OSTI]

    automation systems and thus becomes more complex. System requirements may change even late in the development process, lead to ad-hoc modifications of the product and require systematic (and automated) testing approaches. However, unit tests for automation software have to consider the interac- tion with hardware

  4. Query-Efficient Locally Decodable Codes of Subexponential Length

    E-Print Network [OSTI]

    Chee, Yeow Meng; Ling, San; Wang, Huaxiong; Zhang, Liang Feng

    2010-01-01T23:59:59.000Z

    We develop the algebraic theory behind the constructions of Yekhanin (2008) and Efremenko (2009), in an attempt to understand the ``algebraic niceness'' phenomenon in $\\mathbb{Z}_m$. We show that every integer $m = pq = 2^t -1$, where $p$, $q$ and $t$ are prime, possesses the same good algebraic property as $m=511$ that allows savings in query complexity. We identify 50 numbers of this form by computer search, which together with 511, are then applied to gain improvements on query complexity via Itoh and Suzuki's composition method. More precisely, we construct a $3^{\\lceil r/2\\rceil}$-query LDC for every positive integer $rLDC for every integer $r\\geq 104$, both of length $N_{r}$, improving the $2^r$ queries used by Efremenko (2009) and $3\\cdot 2^{r-2}$ queries used by Itoh and Suzuki (2010). We also obtain new efficient private information retrieval (PIR) schemes from the new query-efficient LDCs.

  5. A Software Framework for Mobile Ad hoc Data Communications Using Legacy Voice-Centric Tactical Radios

    E-Print Network [OSTI]

    Xie, Geoffrey

    of constructive interdependence. As noted in the Net-Centric Operational Environment Joint Integrating Concept by the Net-Centric Environment Joint Functional Concept [NCE05], are the ability to collaborate, synchronize such as those operating in Iraq have very limited data communication capabilities between soldiers. Tactical

  6. AUTONOMOUS UNDERSEA SYSTEMS NETWORK (AUSNET) PROTOCOLS TO SUPPORT AD-HOC AUV COMMUNICATIONS

    E-Print Network [OSTI]

    (as opposed to network support) data transmissions. Next steps in this effort will focus on store to support a dynamically evolving topology of truly semi-autonomous networked robots. Emerging flexible low bandwidth, energy efficient architectures and protocols will enable more effective networked subsurface

  7. Design and analysis of distributed primitives for mobile ad hoc networks

    E-Print Network [OSTI]

    Chen, Yu

    2006-10-30T23:59:59.000Z

    by the network, which poses a serious challenge for the design and analysis of reliable protocols. In this work, three different approaches are used to handle mobility. The first part of the dissertation employs the simple technique of ignoring the mobility...

  8. A Self-Organizing Heuristic for Building Optimal Heterogeneous Ad-Hoc Sensor Networks

    E-Print Network [OSTI]

    Minai, Ali A.

    with equal power, which means that they all have the same transmission radius. Such homoge- neous networks-making about transmission power. However, in sufficiently dense networks (or in networks with significant amount of work on heterogeneous networks, mainly due to their flexibility and better fit into potential

  9. Fault Tolerance Techniques for Wireless Ad Hoc Sensor Networks Farinaz Koushanfar

    E-Print Network [OSTI]

    poten- tial to provide inexpensive and pervasive bridge between physical and computational worlds and actuators that have significantly higher fault rates than the traditional semiconductor integrated circuits

  10. Role-Based Multicast in Highly Mobile but Sparsely Connected Ad Hoc Networks

    E-Print Network [OSTI]

    Briesemeister, Linda

    airbag ig- nition. Then, it can report the accident instantly to equipped vehicles nearby. We present

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

    SciTech Connect (OSTI)

    Not Available

    1993-12-31T23:59:59.000Z

    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.

  12. MISPAR: Mitigating Stealthy Packet Dropping in Locally-Monitored Multi-hop Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Bagchi, Saurabh

    partial neighborhood communication to detect misbehavior such as packet drop or delay. However, local-constrained, not only on energy but on bandwidth and computation as well. This limitation presents an additional loss of data or degradation of network functionality, say through disrupting network connectivity

  13. A New Power-Aware Distributed Topology Control Algorithm for Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Sethu, Harish

    and versatile topology control algorithms that reduces energy costs while preserving connectivity. In this paper,k instead of wi,j while also preserving graph connectivity. The Directed Relative Neighborhood Graph (DRNG the topology of the network to save energy by choosing a smaller number of neighbors with which it communicates

  14. Cooperative Energy Spanners: Energy-Efficient Topology Control in Cooperative Ad Hoc Networks

    E-Print Network [OSTI]

    Wang, Yu

    connected topology control prob- lem, which aims to find a connected topology such that the total energy) which aims to obtain a strongly-connected topology with minimum total energy consumption. They first the energy consumption using CC model. The first algorithm (DTCC) uses 2-hop neighborhood information of each

  15. Efficient Broadcasting using Packet History in Mobile Ad-Hoc Spiros Agathos1

    E-Print Network [OSTI]

    Papapetrou, Evaggelos

    this problem. Among them, the class of algorithms that construct on-demand a connected dominating set, known as dominant pruning, yields an improved performance. Dominant pruning algorithms capitalize on neighborhood [3] and made clear that the limited bandwidth and energy resources necessitate the design

  16. UAV surveillance using multihop ad-hoc wireless networks: a demonstrator

    E-Print Network [OSTI]

    Boucherie, Richard J.

    Critical infrastructures such as power plants, large industrial areas, harbours, rail- way emplacements of living. The number of threats that may disrupt the normal functioning of these infrastructures is growing increases, more cameras and man- power are needed to cover greater areas, increasing costs. In recent years

  17. Comparison of two wireless ad hoc routing protocols on a hardware test-bed

    E-Print Network [OSTI]

    Brown, Timothy X.

    and are equipped with wireless ethernet cards. To maximize the lifetime of the node, conservation of battery power.g. at the operating system level, physical level, and MAC level. Energy can be conserved at the routing level by designing cross-layered protocols and deploying low-power routing algorithms that use the power cost

  18. 2004 David Malan, Harvard University 1 CodeBlue: An Ad Hoc Sensor Network

    E-Print Network [OSTI]

    Malan, David J.

    software Shared-key encryption and MAC layer based on SKIPJACK Power-aware, multihop routing protocol of patient status is difficult Current systems are paper-, phone-, radio-based Sensor nets have potential Publish/subscribe data delivery model Sensor nodes publish vital signs, location, identity Rescue

  19. A Scalable Model for Channel Access Protocols in Multihop Ad Hoc Networks

    E-Print Network [OSTI]

    California at Santa Cruz, University of

    @soe.ucsc.edu ABSTRACT A new modeling framework is introduced for the analytical study of medium access control (MAC be modeled individually, i.e., it allows a per-node setup of many layer-specific parameters. Moreover methodologies; C.4 [Performance of Systems]: Modeling Techniques; C.2.5 [Local and Wide-Area Net- works]: Access

  20. Collaborative Sensing via Local Negotiations in Ad Hoc Networks of Smart Cameras

    E-Print Network [OSTI]

    Qureshi, Faisal Z.

    to the lack of any centralized control. Categories and Subject Descriptors H.4 [Information Systems protocol that al- lows cameras nodes to setup collaborative tasks in a purely distributed manner. Camera-contained vision systems, with increasingly sophisticated image sensors, on-board processing and stor- age

  1. Ad-Hoc And Personal Ontologies: A Prototyping Approach to Ontology Engineering

    E-Print Network [OSTI]

    Richards, Debbie

    and formal techniques that can be equated to the Waterfall system development life cycle. However, in domains]. Agile software development offers a major alternative to the traditional Waterfall system development life cycle model and process. While some fear that agile methods may not scale up or may result

  2. Design and analysis of distributed primitives for mobile ad hoc networks 

    E-Print Network [OSTI]

    Chen, Yu

    2006-10-30T23:59:59.000Z

    , 39, 24, 2, 1, 12, 15, 14, 13, 16 and has length 82. The bold nodes in this sequence are a65 , a40 and the neighbors of a40 . We now consider the construction of a family of graphs, a34a207a35 , a12 a53 a144a66a109a81a149a113a109a17a141a59a141a59a141... graph satisfying a32a1a33 15 Fig. 4. Construction of a34a2a35 and a40a41a39 a53 a40a74a143a172a48a73a44 a154 a144a45a49a148a141a13a8 . Note that each a167 a39 satis es a32a1a33 with respect to a40a71a39a90a109a93a65a38a39 and a9 , and the xed point...

  3. A PROBABILITY COLLECTIVES APPROACH TO WEIGHTED CLUSTERING ALGORITHMS FOR AD HOC NETWORKS

    E-Print Network [OSTI]

    Ross, Kevin

    personnel or soldiers on the battlefield. It is an inefficient use of power, battery life, and bandwidth

  4. Geodesic packet routing over self-organizing mobile ad-hoc

    E-Print Network [OSTI]

    Julien, Christine

    by devices with severe constraints on processing power, battery life, and bandwidth. Manuscript received

  5. Benefit-based Data Caching in Ad Hoc Networks Bin Tang, Himanshu Gupta, Samir Das

    E-Print Network [OSTI]

    Gupta, Himanshu

    network by reducing the access latency and bandwidth usage. However, designing effi- cient distributed. The computing devices could be conventional computers (e.g., PDA, laptop, or PC) or backbone routing platforms in bandwidth as well as battery energy. The problem of cache placement is particularly challenging when each

  6. On Physical Carrier Sensing in Wireless Ad Hoc Xue Yang and Njtin Vaidya

    E-Print Network [OSTI]

    Chen, Yuanzhu Peter

    of Illinois at Urbana-Champaign Department of Electrical and Computer Engineering. and Coordinated Science. While channel utilization is determined by MAC overhead, physical carrier sense has been used suffer a significant loss. 1. INTRODUCTION Two fundamental aspects of wireless communication make

  7. Providing Location Security in Vehicular Ad-hoc Networks Gongjun Yan, Stephan Olariu, Michele C. Weigle

    E-Print Network [OSTI]

    Weigle, Michele

    integrity in VANET. In our approach, we use network cells as security as well as communication units-cell position information integrity as well. Vehicles request that their neighbors or vehicles in oncoming on accurate location information. It is, therefore, imperative to provide mechanisms that ensure the integrity

  8. Get more than just ad hoc methods--discover a sound theoretical framework! Boris Mirkin

    E-Print Network [OSTI]

    Mirkin, Boris

    through trial-and-error. Even the most popular clustering methods -- K-Means for partitioning the data set that not only closes gaps in K-Means and Ward methods, but also extends the meth- ods into areas of current Bivariate Analysis Feature Space and Data Scatter Preprocessing and Standardizing Mixed Data K-MEANS

  9. Simultaneous localization and tracking in wireless ad-hoc sensor networks

    E-Print Network [OSTI]

    Taylor, Christopher J. (Christopher Jorgen)

    2005-01-01T23:59:59.000Z

    In this thesis we present LaSLAT, a sensor network algorithm that uses range measurements between sensors and a moving target to simultaneously localize the sensors, calibrate sensing hardware, and recover the target's ...

  10. Proactive Route Maintenance in Wireless Ad Hoc Fei Dai and Jie Wu

    E-Print Network [OSTI]

    Wu, Jie

    . Reactive (i.e., on- demand) protocols such as DSR [4] and AODV [5] do not up- date routing information

  11. Fuzzy Routing in Ad Hoc Networks Gasim Alandjani and Eric E. Johnson

    E-Print Network [OSTI]

    Johnson, Eric E.

    of Electrical and Computer Engineering New Mexico State University ejohnson@nmsu.edu Abstract Routing discovery and packet forwarding. In wired net- works, bandwidth is high and network topology is rela- tively in the net- work so that the next hop for an arriving packet can be computed quickly at each router

  12. Achieving Robust Protocols for Mobile Ad Hoc Networks John P. Mullen

    E-Print Network [OSTI]

    Mullen, John

    School of Electrical and Computer Engineering New Mexico State University Las Cruces, NM 88003 Abstract time to time, opt to not participate in the net. Because the topology frequently changes, a MANET has backbone created by these routers, in spite of the nets dynamic topology [1, 2]. At this time, virtually

  13. Ad hoc wireless networks with femto-cell deployment: a study 

    E-Print Network [OSTI]

    Bharucha, Zubin Rustam

    2010-01-01T23:59:59.000Z

    Nowadays, with a worldwide market penetration of over 50% in the mobile telecommunications sector, there is also an unrelenting demand from the subscribers for ever increasing transmission rates and availability of ...

  14. Ad-hoc wireless network coverage with networked robots that cannot localize

    E-Print Network [OSTI]

    Correll, Nikolaus

    We study a fully distributed, reactive algorithm for deployment and maintenance of a mobile communication backbone that provides an area around a network gateway with wireless network access for higher-level agents. Possible ...

  15. PMW: a Robust Clustering Algorithm for Mobile Ad-hoc Networks Zhaowen Xing and Le Gruenwald

    E-Print Network [OSTI]

    Gruenwald, Le

    are managed by a node in the cluster, called cluster head, has been proven to be a promising approach. Many calculating the weight utilized to determine whether a node is eligible to be a cluster head, these algorithms either consider only one metric (like mobility or power of nodes), or rely on some metric collected from

  16. A Transparent Collaborative Integration Approach for Ad Hoc Product Data Jingzhi Guo

    E-Print Network [OSTI]

    Guo, Jingzhi

    and buy refrigerators. Now if SME1 (buyer) encodes the refrigerator in Voc1 as: the refrigerator in Voc2 as: silver

  17. Multipath Routing in Ad Hoc Networks An-I Andy Wang Geoffrey H. Kuenning Peter Reiher

    E-Print Network [OSTI]

    Wang, Andy

    way to recover from frequent network failures, balance load and energy resources among network nodes table entries to become out of date before ever being used. Newer on-demand approaches maintain table. However, such approaches are still inefficient, since mobility can frequently break those on-demand routes

  18. Exploiting Overhearing: Flow-Aware Routing for Improved Lifetime in Ad Hoc Networks

    E-Print Network [OSTI]

    Mans, Bernard

    of the schemes claiming to be energy-efficient neglect this cost by only focusing on energy costs due to local whether a more traffic-conscious routing scheme works better in improving the energy-efficiency Shrestha, Bernard Mans Department of Computing, Macquarie University Sydney, NSW 2109 Australia Email

  19. Short Paper: A Reservation MAC Protocol for Ad-Hoc Underwater Acoustic Sensor Networks

    E-Print Network [OSTI]

    Roy, Sumit

    to shore or surface buoys equipped with RF modems and signif- icant battery power; the other fixed are interconnected us- ing acoustic communications for cost effective data trans- port. The acoustic channel, however and mobile non-gateway nodes are typically much more power limited. MAC protocol design for such a network

  20. Distributed CA-based PKI for Mobile Ad hoc Networks using Elliptic Curve Cryptography

    E-Print Network [OSTI]

    Gaj, Krzysztof

    Zouridaki1, Brian L. Mark1 , Kris Gaj1, Roshan K. Thomas2 1 George Mason University, Electrical and Computer for several reasons: (1) lack of a fixed infrastructure; (2) a centralized certification authority (CA of nodes vary in time; (4) nodes often have limited transmission and computational power, storage

  1. Energy Efficiency in the Mobile Ad Hoc Networking Approach to Monitoring Farm Animals

    E-Print Network [OSTI]

    Aickelin, Uwe

    ,709,000. The beef and veal consumption in 2002 was on average 19.7kg per capita in UK and 19.6kg in EU [3 that the proposed approach is feasible and the proposed optimizations considerably decrease the energy consumption

  2. PERFORMANCE ANALYSIS OF POWER-AWARE ROUTE SELECTION PROTOCOLS IN MOBILE AD HOC NETWORKS

    E-Print Network [OSTI]

    California at Santa Cruz, University of

    , a hybrid protocol like the CMMBCR (Conditional Max-Min Battery Capacity Routing) mechanism has been devised-Max Battery Cost Routing) scheme tries to consider the remaining battery power of nodes to prolong- gardless of the remaining battery power of nodes. Since the transmission network2002: submitted to World

  3. Energy-Limited vs. Interference-Limited Ad Hoc Network Capacity

    E-Print Network [OSTI]

    Jindal, Nihar

    , signal and interference power increase proportionally while thermal noise power remains constant. Thus are thermal noise and multi- user interference. If the power of each simultaneous trans- mission is increased-limited, and any further increase in transmission power provides essentially no benefit. On the other hand, thermal

  4. On the Performance of Collision Avoidance Protocols in Ad-Hoc Networks

    E-Print Network [OSTI]

    Paterakis, Michael

    the dialogue-based scheme. Examples of such protocols are: MACA [1], MACAW [2], DBTMA [3], FPRP [5], HRMA [7

  5. A Location-aided Power-aware Routing Protocol in Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Li, Baochun

    hard problem due to two important fac- tors: First, the nodes may be mobile, demanding the energy-efficient algorithms, we are able to derive critical global properties with re- spect to end-to-end energy-efficient. Such observations pose significant challenges to design energy-efficient packet routing protocols while still ac

  6. Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks

    E-Print Network [OSTI]

    Calamoneri, Tiziana

    networks where nodes have the same initial battery charge and they may dynamically change their transmission range at every time slot. When a node v transmits with range r(v), its battery charge is decreased-Verlag Berlin Heidelberg 2007 #12;248 T. Calamoneri et al. supplied to the node. In particular, the power Pv

  7. An Integrated Approach to Service Selection in Mobile Ad Hoc Networks Zhuoyao Zhang, Weiwei Sun

    E-Print Network [OSTI]

    Loo, Boon Thau

    potential value (PV). The PV is determined by both the service dependent information (semantic facts perceived at the application layer) and device dependent information (battery level, current load, network

  8. The Design and Performance Evaluation of a Proactive Multipath Routing Protocol for Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Trinder, Phil

    in Libya, and the Cultural Affairs in London, for the financial support during my study. I would like in Libya, also to my father (Allah bless his soul). ii #12;Declaration I hereby declare that the work

  9. Comparison of Two Intrusion Detection Schemes for Sparsely Connected Ad Hoc Networks M. Chuah, P. Yang

    E-Print Network [OSTI]

    Chuah, Mooi-Choo "Mooi"

    ] uses a variant of Telsa [8] to provide source authentication for DSR. All the above approaches suggest

  10. Energy-Efficient Geographic Routing in Ad-hoc Wireless Networks

    E-Print Network [OSTI]

    Haddadi, Hamed

    applied to minimize the number of hops however the energy consumption is not considered. In this paper, we based on the optimal transmission range, which minimizes the total energy consumption of the transmission (summation of energy consumption of all hops). Furthermore, based on ORF, we propose the Optimal

  11. Ad-Hoc Real-time Agent Networks Summer Research Institute

    E-Print Network [OSTI]

    to interference and unreliable wireless medium Enables PHY-layer security #12;Micro- Controller PIC18F8720 Power => robustness, adaptivity #12;Research Results On-line calibration of analog sensor interfaces Compensates

  12. A Unified Channel-Network Coding Treatment for User Cooperation in Wireless Ad-Hoc Networks

    E-Print Network [OSTI]

    Li, Tiffany Jing

    beneficial for wireless systems, since while an individual channel operating alone may be useless due communicating with a common destination. We take a cross-layer approach and leverage the technologies from both channel coding has long been established as a fundamental technology for protecting bit streams from being

  13. Asplund et al. Wireless Ad Hoc Dissemination for Search and Rescue Proceedings of the 7th

    E-Print Network [OSTI]

    is now fully decentralized and relies on text communication to achieve energy efficiency. Keywords FOSS infrastructure and prevalence of electricity blackouts seems an obvious premise when planning for emergency

  14. Evaluation of a Stastical Technique to Mitigate Malicious Control Packets in Ad Hoc Networks

    E-Print Network [OSTI]

    Boppana, Rajendra V.

    traffic over TCP, we show that the rate control mechanism is very effective in detecting and mitigating. Intrusion detection systems [22] address DoS as part of a variety of other security attacks can be launched by malicious nodes without generating unusually high traffic. This makes the detection

  15. Performance Analysis of Transactional Traffic in Mobile Ad-hoc Networks

    E-Print Network [OSTI]

    Cheng, Yufei

    2014-05-31T23:59:59.000Z

    are expected to present different characteristics and pose different requirements for transport protocols as well as routing protocols. The canonical transport protocol to carry transactional traffic is HTTP on TCP, there are several drawbacks for TCP to better... contribution from the ResiliNets group we have mod- eled DSDV routing protocol [19], 3D–Gauss-Markov mobility model [20], TDMA MAC protocol, DSR routing protocol [21], and HTTP traffic generator [22], TCP Westwood and Westwood+ [23]. This thesis demonstrates...

  16. Reliable Routing in Vehicular Ad hoc Networks Gongjun Yan1 Nathalie Mitton2 Xu Li2

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    range (e.g., mandated by the Federal Communications Commission in the United States), routing paths topology is constantly changing and the wireless communication links are inherently unstable, due to high) that provides vehicle-to-vehicle and vhicle-to-roadside wireless communications. It was first introduced

  17. Using Vision-Based Driver Assistance to Augment Vehicular Ad-Hoc Network Communication

    E-Print Network [OSTI]

    Beauchemin, Steven S.

    a Vision-Based Driver Assistance (VBDA) system that monitors the environment surrounding the vehicle using in the surrounding environment. The concept of a CCWS has been introduced, studied and validated by a number adoption of the Wireless Access in Vehicular Environments (WAVE) set of standards in production vehicles

  18. Abstract--High node mobility and transient connectivity in Vehicular Ad Hoc NETworks have introduced numerous

    E-Print Network [OSTI]

    Leung, Kin K.

    and the special characteristics and technical challenges that they exhibit. They offer a tempting solution algorithms and data dissemination for VANETs. Specifically, we propose a cross- layer approach to the link smoothed average of the signal strength of every packet received by a specific sender. In order to moni

  19. A Distributed Policy Enforcement Architecture for Mobile Ad-Hoc Networks

    E-Print Network [OSTI]

    Yang, Junfeng

    of the architecture using a multitude of tech- niques. We define a threat model and a security analysis based on that threat model. We conduct a preliminary evaluation of the system using the GloMoSim simulator. Through simulations, we show that our solution incurs minimal overhead in terms of network band- width and latency

  20. assisted query reformulation: Topics by E-print Network

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Summary: Terms Algorithms, Human Factors, Design Keywords Automatic Query Expansion, Search Behavior, 1 children may make. Most of the search engines offer only the possibility...

  1. ask queries | OpenEI Community

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directedAnnualProperty Edit withTianlinPapersWindey Wind GeneratingZhongshengZiboZongshenask queries Home

  2. HDF5-FastQuery: Accelerating Complex Queries on HDF Datasets UsingFast Bitmap Indices

    SciTech Connect (OSTI)

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

    2005-12-07T23:59:59.000Z

    Large scale scientific data is often stored in scientific data formats such as FITS, netCDF and HDF. These storage formats are of particular interest to the scientific user community since they provide multi-dimensional storage and retrieval. However, one of the drawbacks of these storage formats is that they do not support semantic indexing which is important for interactive data analysis where scientists look for features of interests such as ''Find all supernova explosions where energy >105 and temperature >106''. In this paper we present a novel approach called HDF5-FastQuery to accelerate the data access of large HDF5 files by introducing multi-dimensional semantic indexing. Our implementation leverages an efficient indexing technology called ''bitmapindexing'' that has been widely used in the database community. Bitmapindices are especially well suited for interactive exploration of large-scale read-only data. Storing the bitmap indices into the HDF5 file has the following advantages: (a) Significant performance speedup of accessing subsets of multi-dimensional data and (b) portability of the indices across multiple computer platforms. We will present an API that simplifies the execution of queries on HDF5 files for general scientific applications and data analysis. The design is flexible enough to accommodate the use of arbitrary indexing technology for semantic range queries. We will also provide a detailed performance analysis of HDF5-FastQuery for both synthetic and scientific data. The results demonstrate that our proposed approach for multi-dimensional queries is up to a factor of 2 faster than HDF5.

  3. HDF5-FastQuery: Accelerating Complex Queries on HDF Datasets usingFast Bitmap Indices

    SciTech Connect (OSTI)

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

    2006-03-30T23:59:59.000Z

    Large scale scientific data is often stored in scientific data formats such as FITS, netCDF and HDF. These storage formats are of particular interest to the scientific user community since they provide multi-dimensional storage and retrieval. However, one of the drawbacks of these storage formats is that they do not support semantic indexing which is important for interactive data analysis where scientists look for features of interests such as ''Find all supernova explosions where energy > 10{sup 5} and temperature > 10{sup 6}''. In this paper we present a novel approach called HDF5-FastQuery to accelerate the data access of large HDF5 files by introducing multi-dimensional semantic indexing. Our implementation leverages an efficient indexing technology called bitmap indexing that has been widely used in the database community. Bitmap indices are especially well suited for interactive exploration of large-scale read only data. Storing the bitmap indices into the HDF5 file has the following advantages: (a) Significant performance speedup of accessing subsets of multi-dimensional data and (b) portability of the indices across multiple computer platforms. We will present an API that simplifies the execution of queries on HDF5 files for general scientific applications and data analysis. The design is flexible enough to accommodate the use of arbitrary indexing technology for semantic range queries. We will also provide a detailed performance analysis of HDF5-FastQuery for both synthetic and scientific data. The results demonstrate that our proposed approach for multi-dimensional queries is up to a factor of 2 faster than HDF5.

  4. The Case for Fine-Grained Stream Provenance Boris Glavic #

    E-Print Network [OSTI]

    Tatbul, Nesime

    ). This limitation was imposed by high-throughput requirements and an anticipated lack of application demand for more generation Provenance retrieval Relevant events & queries Lifetime Retrieval Response times Ad-hoc human queries, all events retention period for indicators Point & Analytic queries offline Event ware- housing

  5. Article ID: Query Translation on the Fly in Deep Web

    E-Print Network [OSTI]

    Article ID: Query Translation on the Fly in Deep Web Integration Jiang Fangjiao, Jia Linlin, Meng users to access the desired information, many researches have dedicated to the Deep Web (i.e. Web databases) integration. We focus on query translation which is an important part of the Deep Web integration

  6. Declarative Network Monitoring with an Underprovisioned Query Processor Frederick Reiss

    E-Print Network [OSTI]

    California at Irvine, University of

    interest in bringing the power of declarative queries to passive network monitors [8, 15]. Declar- ative network monitoring setup. real-time data on the status of their networks, network moni- tors need, or parallel hardware [29]. Other systems construct queries by connecting blocks of highly-optimized special

  7. A NOVEL MULTIMEDIA RETRIEVAL TECHNIQUE: PROGRESSIVE QUERY (WHY WAIT?)

    E-Print Network [OSTI]

    Gabbouj, Moncef

    A NOVEL MULTIMEDIA RETRIEVAL TECHNIQUE: PROGRESSIVE QUERY (WHY WAIT?) Serkan Kiranyaz and Moncef@cs.tut.fi, moncef.gabbouj@tut.fi ABSTRACT One of the challenges in the development of content-based multimedia who are accustomed to making queries and thus retrieving any multimedia item from a large scale

  8. Multimedia reporting: building multimedia presentations with query answers

    E-Print Network [OSTI]

    Celentano, Augusto

    Multimedia reporting: building multimedia presentations with query answers Augusto Celentano,ogaggi}@dsi.unive.it Abstract. A multimedia report is a multimedia presentation which integrates data returned by one or more queries to a multimedia database, thus extending the concept of report familiar in traditional structured

  9. Fuzzy Queries in Multimedia Database Systems Ronald Fagin

    E-Print Network [OSTI]

    Fagin, Ron

    Fuzzy Queries in Multimedia Database Systems Ronald Fagin IBM Almaden Research Center Sati Jose, CA differencesbetween multimedia databases (which may contain complicated objects, such as images), and traditional typos of queries. Wr example, in a multimedia databaseit is reasonable and natural to ask for images

  10. Data Models and Query Languages for Linked Geospatial Data

    E-Print Network [OSTI]

    Koubarakis, Manolis

    Data Models and Query Languages for Linked Geospatial Data Manolis Koubarakis, Manos Karpathiotakis,mk,kkyzir,charnik,sioutis}@di.uoa.gr Abstract. The recent availability of geospatial information as linked open data has generated new interest in geospatial query processing and reasoning, a topic with a long tradition of research in the areas

  11. Comp 5311 Database Management Systems 4. Structured Query Language

    E-Print Network [OSTI]

    Papadias, Dimitris

    ;5 Query 1: Find the total number of copies in stock for each poet SELECT poet, SUM (copies_in_stock) as sum FROM writer GROUP BY poet poet sum Douglas Livingstone 23 Mongane Wally 13 poet book copies Wally Must Weep 8 Mongane Wally A Tough Tale 2 #12;6 Query 2: For each poet, find the max, min, avg

  12. On Efficient Matching of Streaming XML Documents and Queries

    E-Print Network [OSTI]

    Lakshmanan, Laks V.S.

    On Efficient Matching of Streaming XML Documents and Queries Laks V.S. Lakshmanan 1 and P. Sailaja­commerce, and supply­chain management require the ability to manage large sets of specifications of prod­ ucts and.g., a document that is streaming by) is quite small compared to the number of registered queries (which can

  13. Glacier: A Query-to-Hardware Compiler Rene Mueller

    E-Print Network [OSTI]

    Teubner, Jens

    Glacier: A Query-to-Hardware Compiler Rene Mueller rene.mueller@inf.ethz.ch Jens Teubner jens systems. In this demonstration we show Glacier, a library and a compiler that can be employed to implement streaming queries as hardware circuits on FPGAs. Glacier consists of a library of compositional hardware

  14. Approximate Querying in Wireless Sensor Networks Yuzhen Liu Weifa Liang

    E-Print Network [OSTI]

    Liang, Weifa

    of queries in such a database efficiently and effectively. To reduce the energy consumption in sensor Science Australian National University Canberra, ACT 0200, Australia Abstract-In this paper, we study. We build a series of nearly optimal representative routing trees for query evaluation, where

  15. Efficient Complex Query Support for Multiversion XML Documents

    E-Print Network [OSTI]

    Zhang, Donghui

    in supporting complex queries on XML data (e.g., regular path expressions, structural projections, DIFF queries-0070135, IIS-9907477, EIA- 9983445, and the Department of Defense. #12;ideal solution is a version on their repositories of multiversion documents. Specialty warehouses and archives that monitor and collect content from

  16. View-Based Query Processing: On the Relationship Between Rewriting,

    E-Print Network [OSTI]

    Calvanese, Diego

    amounts to computing the tuples satisfying the query in all databases consistent with the views. Rewriting in the setting of semistructured databases, and in particular for the basic query class in this setting, i-0311326, IIS-9908435, IIS-9978135, EIA-0086264, and ANI-0216467, by US-Israel BSF grant 9800096, by Texas

  17. Managing and Querying Transaction-time Databases under Schema Evolution

    E-Print Network [OSTI]

    Zaniolo, Carlo

    Managing and Querying Transaction-time Databases under Schema Evolution Hyun J. Moon UCLA hjmoon of a relational database in XML, whereby the evolution of the schema and its underly- ing database are given is that schema evolution is transparent to the user: she writes queries against the current schema while

  18. A Foundation for Conventional and Temporal Query Optimization

    E-Print Network [OSTI]

    Snodgrass, Richard T.

    substantially from built-in temporal support in the DBMS. To achieve this, temporal query representation DBMS architectures and ones where the temporal support is obtained via a layer on top of a conventional DBMS. This foundation captures duplicates and ordering for all queries, as well as coalescing

  19. Indexing and Querying XML Data for Regular Path Expressions

    E-Print Network [OSTI]

    Moon, Bongki

    by generating interactive site maps [19]. To retrieve XML and semi-structured data, several query languages have of XML data sources from docu- ments to databases and object repositories. The common featuresIndexing and Querying XML Data for Regular Path Expressions £ Quanzhong Li Bongki Moon Dept

  20. Energy-Efficient Aggregate Query Evaluation in Sensor Networks

    E-Print Network [OSTI]

    Liang, Weifa

    Energy-Efficient Aggregate Query Evaluation in Sensor Networks Zhuoyuan Tu and Weifa Liang efficiently. This paper considers the aggregate query evaluation in a sensor network database to the base station, which is called in-network aggregation. In other words, a tree rooted at the base station

  1. Compressed bitmap indices for efficient query processing

    SciTech Connect (OSTI)

    Wu, Kesheng; Otoo, Ekow; Shoshani, Arie

    2001-09-30T23:59:59.000Z

    Many database applications make extensive use of bitmap indexing schemes. In this paper, we study how to improve the efficiencies of these indexing schemes by proposing new compression schemes for the bitmaps. Most compression schemes are designed primarily to achieve good compression. During query processing they can be orders of magnitude slower than their uncompressed counterparts. The new schemes are designed to bridge this performance gap by reducing compression effectiveness and improving operation speed. In a number of tests on both synthetic data and real application data, we found that the new schemes significantly outperform the well-known compression schemes while using only modestly more space. For example, compared to the Byte-aligned Bitmap Code, the new schemes are 12 times faster and it uses only 50 percent more space. The new schemes use much less space(<30 percent) than the uncompressed scheme and are faster in a majority of the test cases.

  2. EXPLORING PERFORMANCE LANDSCAPE OF UNSTRUCTURED SEARCH SCHEMES

    E-Print Network [OSTI]

    Huang, Hong

    Klipsch School of Electrical and Computer Engineering, New Mexico State University, USA {hhuang, rgopal of on-demand routing protocols in wireless ad hoc networks [1], event query in sensor nets [2

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

    E-Print Network [OSTI]

    Tomkins, Andrew

    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 on an aggregate level factors that are correlated with a decision to speak a web search query rather than type it

  4. Cost-based Optimization of Complex Scientific Queries Ruslan Fomkin and Tore Risch

    E-Print Network [OSTI]

    Risch, Tore

    producing Higgs bosons [18] by applying scientific theories expressed as cuts. These complex queries need

  5. Secure quantum private information retrieval using phase-encoded queries

    E-Print Network [OSTI]

    Olejnik, L

    2011-01-01T23:59:59.000Z

    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...

  6. Compact Data Structures with Fast Queries Daniel K. Blandford

    E-Print Network [OSTI]

    .5 Decoding Multiple Gamma Codes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.6 Rank of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Thesis Committee: Guy E. Blelloch, chair fast queries (and updates) to the data. This thesis describes compact representations of several types

  7. CUCS00400 Automatic Classification of Text Databases Through Query Probing

    E-Print Network [OSTI]

    and focused results than when searching a more general text database. Other services (e.g., Copernic 3://www.searchengineguide.com/ 3 http://www.copernic.com/ 1 #12; databases with queries to determine an approximation

  8. Consumer Query Health Profile Saint Alphonsus Regional Medical Center

    E-Print Network [OSTI]

    Barrash, Warren

    Consumer Query Health Profile Saint Alphonsus Regional Medical Center Query resulted in 570 BSU Classified and Non-Classified employees that participated in the Fall 2004 Health Risk Appraisal. Non.2% 9.6% 7.7% 9.0% Heart Disease 2.3% 2.3% 2.6% 3.1% No Primary Care Physician 33.0% 31.8% 30.0% 24

  9. Query-Driven Visualization and Analysis

    SciTech Connect (OSTI)

    Ruebel, Oliver; Bethel, E. Wes; Prabhat, Mr.; Wu, Kesheng

    2012-11-01T23:59:59.000Z

    This report focuses on an approach to high performance visualization and analysis, termed query-driven visualization and analysis (QDV). QDV aims to reduce the amount of data that needs to be processed by the visualization, analysis, and rendering pipelines. The goal of the data reduction process is to separate out data that is "scientifically interesting'' and to focus visualization, analysis, and rendering on that interesting subset. The premise is that for any given visualization or analysis task, the data subset of interest is much smaller than the larger, complete data set. This strategy---extracting smaller data subsets of interest and focusing of the visualization processing on these subsets---is complementary to the approach of increasing the capacity of the visualization, analysis, and rendering pipelines through parallelism. This report discusses the fundamental concepts in QDV, their relationship to different stages in the visualization and analysis pipelines, and presents QDV's application to problems in diverse areas, ranging from forensic cybersecurity to high energy physics.

  10. CRAWLING DEEP WEB CONTENT THROUGH QUERY FORMS Jun Liu, Zhaohui Wu, Lu Jiang, Qinghua Zheng, Xiao Liu

    E-Print Network [OSTI]

    Shamos, Michael I.

    CRAWLING DEEP WEB CONTENT THROUGH QUERY FORMS Jun Liu, Zhaohui Wu, Lu Jiang, Qinghua Zheng, Xiao: Deep Web, Deep Web Surfacing, Minimum Executable Pattern, Adaptive Query Abstract: This paper proposes-based Deep Web adaptive query method. The query method extends query interface from single textbox to MEP set

  11. Parallel Index and Query for Large Scale Data Analysis

    SciTech Connect (OSTI)

    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

    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.

  12. Supersymmetric Warped AdS in Extended Topologically Massive Supergravity

    E-Print Network [OSTI]

    Nihat Sadik Deger; Ali Kaya; Henning Samtleben; Ergin Sezgin

    2014-05-22T23:59:59.000Z

    We determine the most general form of off-shell N=(1,1) supergravity field configurations in three dimensions by requiring that at least one off-shell Killing spinor exists. We then impose the field equations of the topologically massive off-shell supergravity and find a class of solutions whose properties crucially depend on the norm of the auxiliary vector field. These are spacelike-squashed and timelike-stretched AdS_3 for the spacelike and timelike norms, respectively. At the transition point where the norm vanishes, the solution is null warped AdS_3. This occurs when the coefficient of the Lorentz-Chern-Simons term is related to the AdS radius by $\\mu\\ell=2$. We find that the spacelike-squashed AdS_3 can be modded out by a suitable discrete subgroup of the isometry group, yielding an extremal black hole solution which avoid closed timelike curves.

  13. Implementing measurements and optimizing queries for the quantum hidden subgroup problem

    E-Print Network [OSTI]

    Shakeel, Asif

    2011-01-01T23:59:59.000Z

    we will refer to as the “slate” of the query. Let us writeand arbitrary in the slate (state of the response registera “character query”: its slate is a particular character of

  14. E ective Query Size Estimation Using Neural Networks Hongjun Lu Rudy Setiono 1

    E-Print Network [OSTI]

    Setiono, Rudy

    ;ectively compare di#11;erent query execution plans to select the optimal one. Along with the evolution of DBMS technology, accurate size estimation of query results assumes greater and greater importance

  15. Adding New Functionality

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOE Office511041cloth DocumentationProducts (VAP) VAP7-0973 1 IntroductionActinideAdding New Functionality When a

  16. TreeQ-VISTA: An Interactive Tree Visualization Tool with Functional Annotation Query Capabilities

    E-Print Network [OSTI]

    2007-01-01T23:59:59.000Z

    TreeQ-VISTA: An Interactive Tree Visualization Tool withto-use multiplatform interactive tool designed for querying

  17. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1 An In-Network Querying Framework for Wireless

    E-Print Network [OSTI]

    Demirbas, Murat

    -network querying in a distributed, lightweight, resilient and energy-efficient manner. We address these challenges by exploiting location information and geometry of the network and propose an in-network querying framework our framework to achieve complex range-based querying. To this end, we use a multi

  18. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1 An In-Network Querying Framework for Wireless

    E-Print Network [OSTI]

    Demirbas, Murat

    -network querying in a distributed, lightweight, resilient and energy-efficient manner. We address these challenges by exploiting location information and geometry of the network and propose an in-network querying framework of inquiries, we further extend our framework to achieve complex range-based querying. To this end, we use

  19. Mining Approximate Functional Dependencies and Concept Similarities to Answer Imprecise Queries

    E-Print Network [OSTI]

    Kambhampati, Subbarao

    . Example: Suppose a user is searching a car database for "sedans". Since most sedans have unique model names, the user must convert the general query sedan to queries binding the attribute Model. To find all sedans in the database, the user must iteratively change her search criteria and submit queries

  20. SEEDEEP: A System for Exploring and Querying Scientific Deep Web Data Sources

    E-Print Network [OSTI]

    Agrawal, Gagan

    SEEDEEP: A System for Exploring and Querying Scientific Deep Web Data Sources Fan Wang Gagan that are hidden behind query forms, thus forming what is re- ferred to as the deep web. In this paper, we propose SEEDEEP, a System for Exploring and quErying scientific DEEP web data sources. SEEDEEP is able

  1. SEARCHING FOR MULTIMEDIA: AN ANALYSIS OF AUDIO, VIDEO, AND IMAGE WEB QUERIES

    E-Print Network [OSTI]

    Jansen, James

    search engine. From this data set, terms were used to identify queries for audio, image, and video multimedia files by searching for file extensions and matching the filename to terms in the query (WittenSEARCHING FOR MULTIMEDIA: AN ANALYSIS OF AUDIO, VIDEO, AND IMAGE WEB QUERIES Bernard J. Jansen

  2. A Protein Patent Query System Powered By Kleisli Jing Chen Limsoon Wong Louxin Zhang

    E-Print Network [OSTI]

    Wong, Limsoon

    A Protein Patent Query System Powered By Kleisli Jing Chen Limsoon Wong Louxin Zhang Bio effectively query protein patents. This system uses Kleisli to tie to­ gether the following sources to answer queries on protein patents that are considerably more demanding than simple free­text search: (1

  3. A SingleQuery BiDirectional Probabilistic Roadmap Planner with Lazy Collision Checking

    E-Print Network [OSTI]

    LaValle, Steven M.

    1 A Single­Query Bi­Directional Probabilistic Roadmap Planner with Lazy Collision Checking Gildardo probabilistic roadmap (PRM) planner that is: single­query --it does not pre­compute a roadmap, but uses the two the robot's free space by concurrently building a roadmap made of two trees rooted at the query

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

    E-Print Network [OSTI]

    Hiemstra, Djoerd

    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

  5. Public Key Encryption that Allows PIR Queries Eyal Kushilevitz

    E-Print Network [OSTI]

    Public Key Encryption that Allows PIR Queries Dan Boneh Eyal Kushilevitz Rafail Ostrovsky William E to create a public- key encryption scheme for Alice that allows PIR searching over encrypted documents. Our allows for Single-Database PIR writing with sublinear communication complexity, which we consider

  6. Secure quantum private information retrieval using phase-encoded queries

    SciTech Connect (OSTI)

    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

    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.

  7. Privacy-preserving Queries over Relational Databases Femi Olumofin

    E-Print Network [OSTI]

    Goldberg, Ian

    @cs.uwaterloo.ca Abstract--We explore how Private Information Retrieval (PIR) can help users keep their sensitive with PIR by hiding sensitive constants contained in the predicates of a query. Experimental results to provide such information. The problem addressed by private information retrieval (PIR) [4], [13

  8. Public Key Encryption that Allows PIR Queries Eyal Kushilevitz

    E-Print Network [OSTI]

    Ostrovsky, Rafail

    Public Key Encryption that Allows PIR Queries Dan Boneh Eyal Kushilevitz Rafail Ostrovsky William E. In this paper, we show how to create a public-key encryption scheme for Alice that allows PIR searching over allows for Single-Database PIR writing with sublinear communication complexity, which we consider

  9. Taxonomy and synthesis of Web services querying languages

    E-Print Network [OSTI]

    Bitar, Ibrahim El; Roudies, Ounsa

    2012-01-01T23:59:59.000Z

    Most works on Web services has focused on discovery, composition and selection processes of these kinds of services. Other few works were interested in how to represent Web services search queries. However, these queries cannot be processed by ensuring a high level of performance without being adequately represented first. To this end, different query languages were designed. Even so, in the absence of a standard, these languages are quite various. Their diversity makes it difficult choosing the most suitable language. In fact, this language should be able to cover all types of preferences or requirements of clients such as their functional, nonfunctional,temporal or even specific constraints as is the case of geographical or spatial constraints and meet their needs and preferences helping to provide them the best answer. It must also be mutually simple and imposes no restrictions or at least not too many constraints in terms of prior knowledge to use and also provide a formal or semi-formal queries presentat...

  10. DATA CONCERN AWARE QUERYING FOR THE INTEGRATION OF DATA SERVICES

    E-Print Network [OSTI]

    Dustdar, Schahram

    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

  11. Facilitating Document Annotation using Content and Querying Value

    E-Print Network [OSTI]

    Hristidis, Vagelis

    content management software (e.g., Microsoft SharePoint), allow users to share documents and annotate1 Facilitating Document Annotation using Content and Querying Value Eduardo J. Ruiz #1 , Vagelis the generation of the structured metadata by identifying documents that are likely to contain informa- tion

  12. DBDOC: Querying and Browsing Databases and Interrelated Documents

    E-Print Network [OSTI]

    Ordonez, Carlos

    ]: Database Administra- tion--Data warehouse and repository General Terms Management, Documentation, Design 1 to describe this structured data. Managing semi- structured sources, such as documents, text files, web pagesDBDOC: Querying and Browsing Databases and Interrelated Documents Carlos Garcia-Alvarado University

  13. From Structured Documents to Novel Query Facilities \\Lambda

    E-Print Network [OSTI]

    Abiteboul, Serge

    ) can bring a lot of benefit to documents management, e.g., recovery, concurrency control and high levelFrom Structured Documents to Novel Query Facilities \\Lambda V. Christophides, S. Abiteboul, S.Schollg@inria.fr February 29, 1996 Abstract Structured documents (e.g., SGML) can benefit a lot from database support

  14. PET: Reducing Database Energy Cost via Query Optimization

    E-Print Network [OSTI]

    Tu, Yicheng

    PET: Reducing Database Energy Cost via Query Optimization Zichen Xu The Ohio State University xuz@ece.osu.edu Yi-Cheng Tu The University of South Florida ytu@cse.usf.edu Xiaorui Wang The Ohio State University xwang@ece.osu.edu ABSTRACT Energy conservation is a growing important issue in designing mod- ern

  15. A New ClientServer Architecture for Distributed Query Processing

    E-Print Network [OSTI]

    with an essentially ``free'' backward reduction capability is proposed. We explore in detail the benefits and costsA New Client­Server Architecture for Distributed Query Processing Zhe Li Kenneth A. Ross Computer Science Department Computer Science Department Columbia University Columbia University New York, NY 10027

  16. Multi-Query Feedback Motion Planning with LQR-Roadmaps

    E-Print Network [OSTI]

    Jackson, Daniel

    Multi-Query Feedback Motion Planning with LQR-Roadmaps Anirudha Majumdar School of Engineering "roadmap", with each segment representing a locally optimal trajectory of the system and a continuous) - and for parameterized finite-time invariance around a trajectory, as well as a "roadmap" construction al- gorithm

  17. 0 500 1000 1500 2000 2500 3000 UniqueQueries(%)

    E-Print Network [OSTI]

    Albrecht, Jeannie

    90 100 110 Percentcomplete(%) Elapsed time (sec) Kudzu BitTorrent Kudzu: A Self Balancing P2P File strategies · Kudzu takes Gnutella's decentralized model and imposes a self-governing structure on top of it Architecture Query Propagation · A Kudzu network is comprised of a set of functionally homogeneous peers · New

  18. Towards Efficient Query Processing on Massive Time-Evolving Graphs

    E-Print Network [OSTI]

    Miller, John A.

    Email: {ar, ara, laks, jam}@cs.uga.edu Abstract--Time evolving graph (TEG) is increasingly being used on massive TEGs is central to building powerful analytic applications for these domains. Unfortunately effective for processing massive TEGs. Towards designing scalable mechanisms for answering TEG queries

  19. IMPLEMENTATION OF INTENTION-DRIVEN SEARCH PROCESSES BY SPARQL QUERIES

    E-Print Network [OSTI]

    Mirbel, Isabelle

    IMPLEMENTATION OF INTENTION-DRIVEN SEARCH PROCESSES BY SPARQL QUERIES Olivier Corby INRIA Sophia Antipolis, BP 93, FR-06902 Sophia Antipolis, Cedex France olivier.corby@sophia.inria.fr Catherine Faron-Zucker I3S, Universit´e de Nice Sophia, CNRS, BP 121, FR-06903 Sophia Antipolis, Cedex France catherine

  20. STQL --A SPATIO-TEMPORAL QUERY LANGUAGE Martin Erwig

    E-Print Network [OSTI]

    Erwig, Martin

    evolutions of spatial objects over time. We consider spatio- temporal operations that are particularly useful is to provide a DBMS data model and query language capable of handling such time-dependent geome- tries. Thereby. Our modeling also includes the sim- pler, discrete case where temporal evolutions are stepwise

  1. Adaptable Query Optimization and Evaluation in Temporal Middleware

    E-Print Network [OSTI]

    Snodgrass, Richard T.

    that such data- base applications may benefit substantially from built-in temporal support in the DBMS the DBMS proper or as a source level translation from temporal queries to conventional SQL. This paper proposes a new approach: using a middleware component on top of a conventional DBMS. This component accepts

  2. The Michigan Benchmark: A Microbenchmark for XML Query Processing Systems

    E-Print Network [OSTI]

    Runapongsa, Kanda

    The Michigan Benchmark: A Microbenchmark for XML Query Processing Systems£ Kanda Runapongsa Jignesh The University of Michigan, Ann Arbor, MI 48109, USA krunapon, jignesh, jag, shurug @eecs is called the Michigan benchmark. In the Michigan benchmark, we primarily attempt to capture the rich

  3. Context-Aware Query Classification Huanhuan Cao1

    E-Print Network [OSTI]

    Yang, Qiang

    Context-Aware Query Classification Huanhuan Cao1 Derek Hao Hu2 Dou Shen3 Daxin Jiang4 Jian-Tao Sun {derekhh, qyang}@cse.ust.hk 3,4 {doushen, djiang, jtsun}@microsoft.com ABSTRACT Understanding users' search become one of the most popular tools for Web users to find their desired information. As a result

  4. SMALL PCPS WITH LOW QUERY Prahladh Harsha and Madhu Sudan

    E-Print Network [OSTI]

    Harsha, Prahladh

    SMALL PCPS WITH LOW QUERY COMPLEXITY Prahladh Harsha and Madhu Sudan Abstract. Most known. #12; 2 Harsha & Sudan Subsequently much success has been achieved in improving the parameters of PCPs of Friedl & Sudan (1995), who indicate that NP has PCPs with nearly quadratic size complexity and in which

  5. SMALL PCPS WITH LOW QUERY Prahladh Harsha and Madhu Sudan

    E-Print Network [OSTI]

    Sudan, Madhu

    SMALL PCPS WITH LOW QUERY COMPLEXITY Prahladh Harsha and Madhu Sudan Abstract. Most known;2 Harsha & Sudan Subsequently much success has been achieved in improving the parameters of PCPs of Friedl & Sudan (1995), who indicate that NP has PCPs with nearly quadratic size complexity and in which

  6. Indexing Distributed Complex Data for Complex Queries Egemen Tanin

    E-Print Network [OSTI]

    Samet, Hanan

    of the Digital Government, databases can use many ideas from this domain for scalable exchange of data are fundamental to many data management systems. Their mechanisms heavily rely on creating globally known mappingsIndexing Distributed Complex Data for Complex Queries Egemen Tanin Department of Computer Science

  7. Supergravity at the boundary of AdS supergravity

    SciTech Connect (OSTI)

    Amsel, Aaron J.; Compere, Geoffrey [Department of Physics, University of California, Santa Barbara, California 93106 (United States)

    2009-04-15T23:59:59.000Z

    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{<=}|m|<1/2l{sub AdS}. We also demonstrate that mixed boundary conditions are allowed for larger masses when the inner product is 'renormalized' accordingly with the action. We then use the results obtained for |m|=1/l{sub AdS} to explore supersymmetric boundary conditions for N=1 AdS{sub 4} supergravity in which the metric and Rarita-Schwinger fields are fluctuating at the boundary. We classify boundary conditions that preserve boundary supersymmetry or superconformal symmetry. Under the AdS/CFT 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.

  8. New Massive Gravity and AdS_4 counterterms

    E-Print Network [OSTI]

    Dileep P. Jatkar; Aninda Sinha

    2011-04-06T23:59:59.000Z

    We show that the recently proposed DBI extension of new massive gravity emerges naturally as a counterterm in AdS$_4$. The resulting on-shell Euclidean action is independent of the cut-off at zero temperature. We also find that the same choice of counterterm gives the usual area law for the AdS$_4$ Schwarzschild black hole entropy in a cut-off independent manner. The parameter values of the resulting counterterm action correspond to a $c=0$ theory in the context of AdS$_3$/CFT$_2$. We rewrite this theory in terms of the gauge field that is used to recast 3D gravity as a Chern-Simons theory.

  9. VIQI: A New Approach for Visual Interpretation of Deep Web Query Interfaces

    E-Print Network [OSTI]

    Boughamoura, Radhouane; Omri, Mohamed Nazih

    2012-01-01T23:59:59.000Z

    Deep Web databases contain more than 90% of pertinent information of the Web. Despite their importance, users don't profit of this treasury. Many deep web services are offering competitive services in term of prices, quality of service, and facilities. As the number of services is growing rapidly, users have difficulty to ask many web services in the same time. In this paper, we imagine a system where users have the possibility to formulate one query using one query interface and then the system translates query to the rest of query interfaces. However, interfaces are created by designers in order to be interpreted visually by users, machines can not interpret query from a given interface. We propose a new approach which emulates capacity of interpretation of users and extracts query from deep web query interfaces. Our approach has proved good performances on two standard datasets.

  10. Branes in AdS and pp-wave spacetimes

    E-Print Network [OSTI]

    Kostas Skenderis; Marika Taylor

    2002-07-03T23:59:59.000Z

    We find half supersymmetric AdS-embeddings in AdS_5 x S^5 corresponding to all quarter BPS orthogonal intersections of D3-branes with Dp-branes. A particular case is the Karch-Randall embedding AdS_4 x S^2. We explicitly prove that these embeddings are supersymmetric by showing that the kappa symmetry projections are compatible with half of the target space Killing spinors and argue that all these cases lead to AdS/dCFT dualities involving a CFT with a defect. We also find an asymptotically AdS_4 x S^2 embedding that corresponds to a holographic RG-flow on the defect. We then consider the pp-wave limit of the supersymmetric AdS-embeddings and show how it leads to half supersymmetric D-brane embeddings in the pp-wave background. We systematically analyze D-brane embeddings in the pp-wave background along with their supersymmetry. We construct all supersymmetric D-branes wrapped along the light-cone using operators in the dual gauge theory: the open string states are constructed using defect fields. We also find supersymmetric D1 (monopoles) and D3 (giant gravitons) branes that wrap only one of the light-cone directions. These correspond to non-perturbative states in the dual gauge theory.

  11. Flexible quantum private queries based on quantum key distribution

    E-Print Network [OSTI]

    Fei Gao; Bin Liu; Qiao-Yan Wen; Hui Chen

    2011-11-07T23:59:59.000Z

    We present a flexible quantum-key-distribution-based protocol for quantum private queries. Similar to M. Jakobi et al's protocol [Phys. Rev. A 83, 022301 (2011)], it is loss tolerant, practical and robust against quantum memory attack. Furthermore, our protocol is more flexible and controllable. We show that, by adjusting the value of $\\theta$, the average number of the key bits Alice obtains can be located on any fixed value the users wanted for any database size. And the parameter $k$ is generally smaller (even $k=1$ can be achieved) when $\\theta<\\pi/4$, which implies lower complexity of both quantum and classical communications. Furthermore, the users can choose a smaller $\\theta$ to get better database security, or a larger $\\theta$ to obtain a lower probability with which Bob can correctly guess the address of Alice's query.

  12. ObjectGlobe: Ubiquitous Query Processing on the Internet

    E-Print Network [OSTI]

    Kemper, Alfons

    for scalable Internet applications, such as business-to-business (B2B) e-commerce systems like SAP's "mySAP capabilities. The goal of the ObjectGlobe project is to establish an open market place in which data and query on the Internet. One of the main challenges in the design of such an open system is to ensure privacy and security

  13. Wilson lines for AdS_5 black strings

    E-Print Network [OSTI]

    Kiril Hristov; Stefanos Katmadas

    2014-12-03T23:59:59.000Z

    We describe a simple method of extending AdS_5 black string solutions of 5d gauged supergravity in a supersymmetric way by addition of Wilson lines along a circular direction in space. When this direction is chosen along the string, and due to the specific form of 5d supergravity that features Chern-Simons terms, the existence of magnetic charges automatically generates conserved electric charges in a 5d analogue of the Witten effect. Therefore we find a rather generic, model-independent way of adding electric charges to already existing solutions with no backreaction from the geometry or breaking of any symmetry. We use this method to explicitly write down more general versions of the Benini-Bobev black strings and comment on the implications for the dual field theory and the similarities with generalizations of the Cacciatori-Klemm black holes in AdS_4.

  14. Broadcasting Based on Dominated Connecting Sets with MPR in a Realistic Environment for WSNs & AD-HOC

    E-Print Network [OSTI]

    Boyer, Edmond

    the redundancy, such as MPR (MultiPoint Relay) or DS-MPR (Connected Dominating Sets with MPR). These methods and existence of obstacles. This paper focuses on DS-MPR. Firstly, we test it in a realistic environment to show Sensor Networks; Broadcasting; Connected Dominating Sets; MultiPoint Relay; Lognormal model. 1

  15. Cluster-Based Semi-Asynchronous Power-Saving Protocols for Multi-hop Ad Hoc Networks

    E-Print Network [OSTI]

    Tseng, Yu-Chee

    applied to a multi-hop MANET. I. INTRODUCTION Since most mobile devices do not have plug-in power, battery

  16. A highly reliable multi-path routing scheme for ad hoc wireless FEI DAI and JIE WU

    E-Print Network [OSTI]

    Wu, Jie

    and suffer from high overhead. Reactive (i.e. on- demand) protocols such as DSR [9] and AODV [17] do

  17. Routing in HF Ad-Hoc WANs Eric E. Johnson, Zibin Tang, Manikanden Balakrishnan, Huiyan Zhang, and Srugun Sreepuram

    E-Print Network [OSTI]

    Johnson, Eric E.

    , and Srugun Sreepuram Klipsch School of Electrical and Computer Engineering1 New Mexico State University are emerging as a means to interconnect wired subnetworks in various mo- bile and contingency applications

  18. Multi-Cluster Protocol for Ad Hoc Mobile Underwater Acoustic Networks Francisco Salv-Garau and Milica Stojanovic

    E-Print Network [OSTI]

    Stojanovic, Milica

    @coitt.es, millitsa@mit.edu Abstract- An autonomous network of underwater vehicles is considered in which of connectivity, successful transmission rate, average delay and energy consumption. Simulation analysis is used Underwater Vehicles. I. INTRODUCTION Autonomous operations future naval capability (AOFNC) calls

  19. A Multiple Access Protocol with Collision Avoidance and Multi-CTS Candidates for Multi-channel Ad-hoc Networks

    E-Print Network [OSTI]

    Kuzmanovic, Aleksandar

    HRMA[7] and RICH-DP[8] utilize frequency hopping. In HRMA, pairs of nodes that have successfully hop following the common hop sequence. It is proved that HRMA completely solves the hidden terminal

  20. Attacking the Asokan-Ginzboorg Protocol for Key Distribution in an Ad-Hoc Bluetooth Network Using CORAL 

    E-Print Network [OSTI]

    Steel, G.; Maidl, M.; Bundy, Alan

    We describe Coral, a counterexample finder for incorrect inductive conjectures. By devising a first-order version of Paulson's formalism for cryptographic protocol analysis, we are able to use Coral to attack protocols which may have an unbounded...

  1. LA-DCF: A New Multiple Access Protocol for Ad-Hoc Wireless Richard Akester & Stephen Hailes

    E-Print Network [OSTI]

    Haddadi, Hamed

    during backoff, the host "freezes" the backoff timer. Once the carrier is sensed idle again, the backoff-to-end transport protocol, but this can take too long to detect the loss and take action, causing channel variations in delay affects the calculation of round trip times in transport protocols. Also, they are only

  2. An Energy-Aware Simulation Model and Transaction Protocol for Dynamic Workload Distribution in Mobile Ad Hoc Networks1

    E-Print Network [OSTI]

    Pedram, Massoud

    An Energy-Aware Simulation Model and Transaction Protocol for Dynamic Workload Distribution an energy-aware network transaction protocol that dynamically redistributes the computational workload among for detailed evaluation of the performance of different energy management policies in a MANET. Next it presents

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

    SciTech Connect (OSTI)

    Thorhaug, A. (ed.)

    1980-01-01T23:59:59.000Z

    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)

  4. FastQuery: A Parallel Indexing System for Scientific Data

    SciTech Connect (OSTI)

    Chou, Jerry; Wu, Kesheng; Prabhat,

    2011-07-29T23:59:59.000Z

    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.

  5. Lorentzian AdS geometries, wormholes, and holography

    SciTech Connect (OSTI)

    Arias, Raul E.; Silva, Guillermo A. [IFLP-CONICET and Departamento de Fisica Facultad de Ciencias Exactas, Universidad Nacional de La Plata , CC 67, 1900, La Plata (Argentina); Botta Cantcheff, Marcelo [Theory Division, CERN, 1211 Geneva 23 (Switzerland); IFLP-CONICET and Departamento de Fisica Facultad de Ciencias Exactas, Universidad Nacional de La Plata , CC 67, 1900, La Plata (Argentina)

    2011-03-15T23:59:59.000Z

    We investigate the structure of two-point functions for the quantum field theory dual to an asymptotically Lorentzian Anti de Sitter (AdS) wormhole. The bulk geometry is a solution of five-dimensional second-order Einstein-Gauss-Bonnet gravity and causally connects two asymptotically AdS spacetimes. We revisit the Gubser-Klebanov-Polyakov-Witten prescription for computing two-point correlation functions for dual quantum field theories operators O in Lorentzian signature and we propose to express the bulk fields in terms of the independent boundary values {phi}{sub 0}{sup {+-}} at each of the two asymptotic AdS regions; along the way we exhibit how the ambiguity of normalizable modes in the bulk, related to initial and final states, show up in the computations. The independent boundary values are interpreted as sources for dual operators O{sup {+-}} and we argue that, apart from the possibility of entanglement, there exists a coupling between the degrees of freedom living at each boundary. The AdS{sub 1+1} geometry is also discussed in view of its similar boundary structure. Based on the analysis, we propose a very simple geometric criterion to distinguish coupling from entanglement effects among two sets of degrees of freedom associated with each of the disconnected parts of the boundary.

  6. Jet Quenching via Gravitational Radiation in Thermal AdS

    E-Print Network [OSTI]

    Edward Shuryak; Ho-Ung Yee; Ismail Zahed

    2011-10-04T23:59:59.000Z

    We argue that classical bulk gravitational radiation effects in AdS/CFT, previously ignored because of their subleading nature in the 1/Nc-expansion, are magnified by powers of large Lorentz factors gamma for ultrarelativistic jets, thereby dominating other forms of jet energy loss in holography at finite temperature. We make use of the induced gravitational self-force in thermal AdS5 to estimate its effects. In a thermal medium, relativistic jets may loose most of their energy through longitudinal drag caused by the energy accumulated in their nearby field as they zip through the strongly coupled plasma.

  7. AdS_6 solutions of type II supergravity

    E-Print Network [OSTI]

    Fabio Apruzzi; Marco Fazzi; Achilleas Passias; Dario Rosa; Alessandro Tomasiello

    2015-02-28T23:59:59.000Z

    Very few AdS_6 x M_4 supersymmetric solutions are known: one in massive IIA, and two IIB solutions dual to it. The IIA solution is known to be unique; in this paper, we use the pure spinor approach to give a classification for IIB supergravity. We reduce the problem to two PDEs on a two-dimensional space Sigma. M_4 is then a fibration of S^2 over Sigma; the metric and fluxes are completely determined in terms of the solution to the PDEs. The results seem likely to accommodate near-horizon limits of (p,q)-fivebrane webs studied in the literature as a source of CFT_5's. We also show that there are no AdS_6 solutions in eleven-dimensional supergravity.

  8. AdS_6 solutions of type II supergravity

    E-Print Network [OSTI]

    Fabio Apruzzi; Marco Fazzi; Achilleas Passias; Dario Rosa; Alessandro Tomasiello

    2015-04-03T23:59:59.000Z

    Very few AdS_6 x M_4 supersymmetric solutions are known: one in massive IIA, and two IIB solutions dual to it. The IIA solution is known to be unique; in this paper, we use the pure spinor approach to give a classification for IIB supergravity. We reduce the problem to two PDEs on a two-dimensional space Sigma. M_4 is then a fibration of S^2 over Sigma; the metric and fluxes are completely determined in terms of the solution to the PDEs. The results seem likely to accommodate near-horizon limits of (p,q)-fivebrane webs studied in the literature as a source of CFT_5's. We also show that there are no AdS_6 solutions in eleven-dimensional supergravity.

  9. The Mixed Phase of Charged AdS Black holes

    E-Print Network [OSTI]

    Piyabut Burikham; Chatchai Promsiri

    2015-01-20T23:59:59.000Z

    We study the mixed phase of charged AdS black hole and radiation when the total energy is fixed below the threshold to produce a stable charged black hole branch. The coexistence conditions for the charged AdS black hole and radiation are derived for the generic case when radiation particles carry charge. The phase diagram of the mixed phase is demonstrated for both fixed potential and charge ensemble. In the dual gauge picture, they correspond to the mixed phase of quark-gluon plasma~(QGP) and hadron gas in the fixed chemical potential and density ensemble respectively. In the nuclei and heavy ion collisions at intermediate energies, the mixed phase of exotic QGP and hadron gas could be produced. The mixed phase will condensate and evaporate into the hadron gas as the fireball expands.

  10. Higher derivative effects for 4d AdS gravity

    E-Print Network [OSTI]

    Jelena Smolic; Marika Taylor

    2013-02-13T23:59:59.000Z

    Motivated by holography, we explore higher derivative corrections to four-dimensional Anti-de Sitter (AdS) gravity. We point out that in such a theory the variational problem is generically not well-posed given only a boundary condition for the metric. However, when one evaluates the higher derivative terms perturbatively on a leading order Einstein solution, the equations of motion are always second order and therefore the variational problem indeed requires only a boundary condition for the metric. The equations of motion required to compute the spectrum around the corrected background are still generically higher order, with the additional boundary conditions being associated with new operators in the dual conformal field theory. We discuss which higher derivative curvature invariants are expected to arise in the four-dimensional action from a top-down perspective and compute the corrections to planar AdS black holes and to the spectrum around AdS in various cases. Requiring that the dual theory is unitary strongly constrains the higher derivative terms in the action, as the operators associated with the extra boundary conditions generically have complex conformal dimensions and non-positive norms.

  11. Quintessence and effective AdS brane geometries

    E-Print Network [OSTI]

    K. Priyabrat Pandey; Abhishek K. Singh; Sunita Singh; Supriya Kar

    2014-07-25T23:59:59.000Z

    A geometric torsion dynamics leading to an effective curvature in a second order formalism on a D4-brane is revisited with a renewed interest. We obtain two effective $AdS_4$ brane geometries on a vacuum created pair of $(D{\\bar D})_3$-brane. One of them is shown to describe an AdS Schwarzschild spinning black hole and the other is shown to describe a spinning black hole bound state. It is argued that a D-instanton in a vacuum created anti D3-brane within a pair may describe a quintessence. It may seen to incorporate a varying vacuum energy density in a brane universe. We consider the effective curvature scalar on $S^1\\times S^1$ to analyze torsion-less geometries on a vacuum created pair of $(D{\\bar D})_2$-brane. The emergent $AdS_3$ brane is shown to describe a Schwarzschild and a Reissner-Nordstrom (RN) geometries in presence of extra dimension(s).

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

    SciTech Connect (OSTI)

    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

    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.

  13. Quantum strings in AdS5 x S5 and AdS/CFT duality

    E-Print Network [OSTI]

    A. A. Tseytlin

    2009-09-23T23:59:59.000Z

    We review some recent progress in understanding the spectrum of energies/dimensions of strings/operators in AdS5 x S5 -- planar N=4 super Yang-Mills correspondence. We consider leading strong coupling corrections to the energy of lightest massive string modes in AdS5 x S5, which should be dual to members of the Konishi operator multiplet in the SYM theory. This determines the general structure of strong-coupling expansion of the anomalous dimension of the Konishi operator. Following arXiv:0906.4294 we use 1-loop results for semiclassical string states to extract information about the leading coefficients in this expansion.

  14. Tractable hypergraph properties for constraint satisfaction and conjunctive queries

    E-Print Network [OSTI]

    Marx, Dániel

    2009-01-01T23:59:59.000Z

    An important question in the study of constraint satisfaction problems (CSP) is understanding how the graph or hypergraph describing the incidence structure of the constraints influences the complexity of the problem. For binary CSP instances (i.e., where each constraint involves only two variables), the situation is well understood: the complexity of the problem essentially depends on the treewidth of the graph of the constraints. However, this is not the correct answer if constraints with unbounded number of variables are allowed, and in particular, for CSP instances arising from query evaluation problems in database theory. Formally, if H is a class of hypergraphs, then let CSP(H) be CSP restricted to instances whose hypergraph is in H. Our goal is to characterize those classes of hypergraphs for which CSP(H) is polynomial-time solvable or fixed-parameter tractable, parameterized by the number of variables. Note that in the applications related to database query evaluation, we usually assume that the numbe...

  15. Large-Scale Continuous Subgraph Queries on Streams

    SciTech Connect (OSTI)

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

    2011-11-30T23:59:59.000Z

    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.

  16. Web search queries can predict stock market volumes

    E-Print Network [OSTI]

    Bordino, Ilaria; Caldarelli, Guido; Cristelli, Matthieu; Ukkonen, Antti; Weber, Ingmar

    2011-01-01T23:59:59.000Z

    We live in a computerized and networked society where many of our actions leave a digital trace and affect other people's actions. This has lead to the emergence of a new data-driven research field: mathematical methods of computer science, statistical physics and sociometry provide insights on a wide range of disciplines ranging from social science to human mobility. A recent important discovery is that query volumes (i.e., the number of requests submitted by users to search engines on the www) can be used to track and, in some cases, to anticipate the dynamics of social phenomena. Successful exemples include unemployment levels, car and home sales, and epidemics spreading. Few recent works applied this approach to stock prices and market sentiment. However, it remains unclear if trends in financial markets can be anticipated by the collective wisdom of on-line users on the web. Here we show that trading volumes of stocks traded in NASDAQ-100 are correlated with the volumes of queries related to the same sto...

  17. AdS String: Classical Solutions and Moduli Dynamics

    E-Print Network [OSTI]

    Antal Jevicki; Kewang Jin

    2010-01-29T23:59:59.000Z

    We review some recent work and techniques for constructing dynamical string solutions in AdS spacetime. These solutions generalize the folded string and multi-spike solutions of GKP and Kruczenski. The methods developed for constructing these dynamical solutions are based on Pohlmeyer reduction to integrable sinh-Gordon type equations. The integrability of the equations is seen as the crucial tool for reconstruction of the string configurations. We discuss the physical meaning of these dynamical spike solutions and the question of their moduli space.

  18. AdS Chern-Simons Gravity induces Conformal Gravity

    E-Print Network [OSTI]

    Rodrigo Aros; Danilo E. Diaz

    2013-12-25T23:59:59.000Z

    The leitmotif of this paper is the question of whether four- and higher even-dimensional Conformal Gravities do have a Chern-Simons pedigree. We show that Weyl gravity can be obtained as dimensional reduction of a five-dimensional Chern-Simons action for a suitable (gauged-fixed, tractor-like) five-dimensional AdS connection. The gauge-fixing and dimensional reduction program admits a readily generalization to higher dimensions for the case of certain conformal gravities obtained by contractions of the Weyl tensor.

  19. Entanglement Entropy and Duality in AdS(4)

    E-Print Network [OSTI]

    Ioannis Bakas; Georgios Pastras

    2015-03-02T23:59:59.000Z

    Small variations of the entanglement entropy \\delta S and the expectation value of the modular Hamiltonian \\delta E are computed holographically for circular entangling curves in the boundary of AdS(4), using gravitational perturbations with general boundary conditions in spherical coordinates. Agreement with the first law of thermodynamics, \\delta S = \\delta E, requires that the line element of the entangling curve remains constant. In this context, we also find a manifestation of electric-magnetic duality for the entanglement entropy and the corresponding modular Hamiltonian, following from the holographic energy-momentum/Cotton tensor duality.

  20. Entanglement Entropy and Duality in AdS(4)

    E-Print Network [OSTI]

    Bakas, Ioannis

    2015-01-01T23:59:59.000Z

    Small variations of the entanglement entropy \\delta S and the expectation value of the modular Hamiltonian \\delta E are computed holographically for circular entangling curves in the boundary of AdS(4), using gravitational perturbations with general boundary conditions in spherical coordinates. Agreement with the first law of thermodynamics, \\delta S = \\delta E, requires that the line element of the entangling curve remains constant. In this context, we also find a manifestation of electric-magnetic duality for the entanglement entropy and the corresponding modular Hamiltonian, following from the holographic energy-momentum/Cotton tensor duality.

  1. Entanglement Entropy and Duality in AdS(4)

    E-Print Network [OSTI]

    Ioannis Bakas; Georgios Pastras

    2015-04-30T23:59:59.000Z

    Small variations of the entanglement entropy \\delta S and the expectation value of the modular Hamiltonian \\delta E are computed holographically for circular entangling curves in the boundary of AdS(4), using gravitational perturbations with general boundary conditions in spherical coordinates. Agreement with the first law of thermodynamics, \\delta S = \\delta E, requires that the line element of the entangling curve remains constant. In this context, we also find a manifestation of electric-magnetic duality for the entanglement entropy and the corresponding modular Hamiltonian, following from the holographic energy-momentum/Cotton tensor duality.

  2. Towards Hybrid Online On-Demand Querying of Realtime Data with Stateful Complex Event Processing

    E-Print Network [OSTI]

    Prasanna, Viktor K.

    that is frequently accessed (hot data) is on fast storage compared to less-frequently accessed data (warm and cold like e- commerce and energy industry require both online and on- demand queries to be performed over to support scalable data storage and on-demand querying over large volumes of data. These systems usually

  3. Static Checking of Dynamically Generated Queries in Database Applications Carl Gould, Zhendong Su, and Premkumar Devanbu

    E-Print Network [OSTI]

    Devanbu, Prem

    , WHOLESALE, and TYPE, among others. The RETAIL and WHOLESALE columns are both of type in- teger, indicatingBound != null) { query += "WHOLESALE > " + lowerBound + " AND "; } query += "TYPE IN (" + get to be executed is: SELECT '$' || (RETAIL/100) FROM INVENTORY WHERE WHOLESALE > 595 AND TYPE IN (SELECT TY

  4. TQuEST: Threshold Query Execution for Large Sets of Time Series

    E-Print Network [OSTI]

    Kriegel, Hans-Peter

    TQuEST: Threshold Query Execution for Large Sets of Time Series Johannes AÃ?falg, Hans-Peter Kriegel TQuEST, a powerful query processor for time series databases. TQuEST supports a novel but very useful times. 1 Introduction In this paper, we present TQuEST, a powerful analysis tool for time series

  5. Join Synopses for Approximate Query Answering Swarup Acharya Phillip B. Gibbons Viswanath Poosala Sridhar Ramaswamy

    E-Print Network [OSTI]

    Gibbons, Phillip B.

    optimizer to estimate plan costs; such an application demands very fast response times but not exact answers to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full solely on providing exact answers to queries, in a manner that seeks to minimize response time

  6. Figure 1. IDVL interface showing 12 documents returned for "El Nio" query along with different multimedia

    E-Print Network [OSTI]

    Wactlar, Howard D.

    to evaluate them. We aggregate and integrate video content on-demand to enable summarization and visualization that provides the users with coherent responses to their queries in a useful broader context, perhaps library, i.e., metadata, to return a set of video documents in response to a user query, as shown

  7. Query Planning for Searching Inter-Dependent Deep-web Databases

    E-Print Network [OSTI]

    Agrawal, Gagan

    Query Planning for Searching Inter-Dependent Deep-web Databases Fan Wang1 , Gagan Agrawal1 query forms, thus forming what is referred to as the deep web. It is de- sirable to have systems data retrieval from the deep web. However, such systems need to address the following challenges. First

  8. Query Planning for Searching Inter-dependent Deep-Web Databases

    E-Print Network [OSTI]

    Jin, Ruoming

    Query Planning for Searching Inter-dependent Deep-Web Databases Fan Wang1 , Gagan Agrawal1 query forms, thus forming what is referred to as the deep web. It is de- sirable to have systems data retrieval from the deep web. However, such systems need to address the following challenges. First

  9. Real time search on the web: Queries, topics, and economic value Bernard J. Jansen a,

    E-Print Network [OSTI]

    Jansen, James

    examine aggregate usage of the search engine, including number of users, queries, and terms. We term interest in a topic and the polling nature of real time queries. Concerning search topics geographical affinity, pointing to a location-based aspect to real time search. In terms of economic value, we

  10. Probabilistic Roadmaps of Trees for Parallel Computation of Multiple Query Roadmaps

    E-Print Network [OSTI]

    Kavraki, Lydia E.

    Probabilistic Roadmaps of Trees for Parallel Computation of Multiple Query Roadmaps Mert Akinc sample-based method primarily designed for multiple query planning (the Probabilistic Roadmap Method the Probabilistic Roadmap of Trees (PRT), uses a tree algorithm as a subroutine for PRM. The nodes of the PRM

  11. Rethinking Query Processing for Energy Efficiency: Slowing Down to Win the Race

    E-Print Network [OSTI]

    Patel, Jignesh

    Rethinking Query Processing for Energy Efficiency: Slowing Down to Win the Race Willis Lang of an energy efficiency metric along with traditional performance metrics. This change is fueled by the growing, real, and urgent demand for energy-efficient database processing. Database query processing engines

  12. Learning ReadOnce Formulas with Queries Dana Angluin \\Lambda Lisa Hellerstein y Marek Karpinski z

    E-Print Network [OSTI]

    Hellerstein, Lisa

    ­once formulas [26]. We also show that no polynomial time algorithm using only membership queries or only kinds of queries. The main results are a polynomial time algorithm for exact identification of monotone on the notion of a minimally adequate teacher [1]). Our results improve on Valiant's previous results for read

  13. DDT: A Distributed Data Structure for the Support of P2P Range Query

    E-Print Network [OSTI]

    Ricci, Laura

    DDT: A Distributed Data Structure for the Support of P2P Range Query Davide Carff, Massimo Coppola expressivity by maintenance a distributed index of resources. We propose the Distributed Digest Trie (DDT) a distributed data structure which is based on a trie structure. The DDT im- proves the DHT query expressivity

  14. Submitted EDBT 2002, paper ID: 239 Ecient Complex Query Support for Multiversion XML Documents

    E-Print Network [OSTI]

    Tsotras, Vassilis J.

    recent interest in supporting complex queries on XML data (e.g., regular path expressions, structural, Riverside, CA 92521. tsotras@cs.ucr.edu. This work was partially supported by NSF grants IIS-9907477, EIA and queries on their repositories of multiversion documents. Specialty warehouses and archives that monitor

  15. Integrating and Querying Source Code of Programs Working on a Database

    E-Print Network [OSTI]

    Ordonez, Carlos

    management system (DBMS). As a result, we present QDPC, a novel system that allows the inte- gration and flexible querying within a DBMS of source code and a database's schema. The integration focuses on obtain a DBMS. These sum- marization tables are then analyzed with SQL queries to find matches that are related

  16. Algebra-to-SQL Query Translation for Spatio-Temporal Databases

    E-Print Network [OSTI]

    Libre de Bruxelles, Université

    of transforming the queries expressed for the conceptual schema into an operational query for a target DBMS or GIS their applications, such specifications must be translated into the operational model of current DBMS or GIS who have little technical knowledge of the underlying DBMS or GIS software. #12;The MurMur project

  17. Peer-to-Peer Spatial Queries in Sensor Networks Murat Demirbas Hakan Ferhatosmanoglu

    E-Print Network [OSTI]

    Demirbas, Murat

    .ohio-state.edu Abstract Sensor networks, that consist of potentially several thou- sands of nodes each with sensing (heat for monitoring spatial information about a region of interest. Although spatial query execution has been studied. For achieving minimal energy consumption and minimal response time, our query processing model en- sures

  18. PeertoPeer Spatial Queries in Sensor Networks Murat Demirbas Hakan Ferhatosmanoglu

    E-Print Network [OSTI]

    Demirbas, Murat

    ,hakang@cis.ohio­state.edu Abstract Sensor networks, that consist of potentially several thou­ sands of nodes each with sensing (heat for monitoring spatial information about a region of interest. Although spatial query execution has been studied. For achieving minimal energy consumption and minimal response time, our query processing model en­ sures

  19. Query Optimization as a Datalog Program Mengmeng Liu, Zachary G. Ives, and Boon Thau Loo

    E-Print Network [OSTI]

    Loo, Boon Thau

    Query Optimization as a Datalog Program Mengmeng Liu, Zachary G. Ives, and Boon Thau Loo University is that of specifying the transformation rules and search process of a query optimizer [1]. In certain emerging domains universally understood than the languages used in transformational optimizers like those generated by Volcano

  20. Privacy-Preserving Query over Encrypted Graph-Structured Data in Cloud Computing

    E-Print Network [OSTI]

    Hou, Y. Thomas

    Privacy-Preserving Query over Encrypted Graph-Structured Data in Cloud Computing Ning Cao, Zhenyu, Chicago, IL 60616 Email: {cong, kren}@ece.iit.edu Abstract-- In the emerging cloud computing paradigm of privacy-preserving query over encrypted graph-structured data in cloud computing (PPGQ), and establish

  1. Localization in indoor environments by querying omnidirectional visual maps using perspective images

    E-Print Network [OSTI]

    Barreto, Joao

    , not only speeds up the process of acquiring data for creating the map, but also favors scalabilityLocalization in indoor environments by querying omnidirectional visual maps using perspective. The localization is achieved by querying a database of omnidirectional images that constitutes a detailed visual

  2. Joint Video and Text Parsing for Understanding Events and Answering Queries

    E-Print Network [OSTI]

    Zhu, Song Chun

    1 Joint Video and Text Parsing for Understanding Events and Answering Queries Kewei Tu, Meng Meng to process video and text jointly for understanding events and answering user queries. Our framework produces) in the video and text. The knowledge representation of our framework is based on a spatial-temporal-causal And

  3. Scattering States in AdS/CFT

    SciTech Connect (OSTI)

    Fitzpatrick, A.Liam; /Boston U.; Kaplan, Jared; /SLAC

    2012-02-14T23:59:59.000Z

    We show that suitably regulated multi-trace primary states in large N CFTs behave like 'in' and 'out' scattering states in the flat-space limit of AdS. Their transition matrix elements approach the exact scattering amplitudes for the bulk theory, providing a natural CFT definition of the flat space S-Matrix. We study corrections resulting from the AdS curvature and particle propagation far from the center of AdS, and show that AdS simply provides an IR regulator that disappears in the flat space limit.

  4. Small Hairy Black Holes in Global AdS Spacetime

    E-Print Network [OSTI]

    Pallab Basu; Jyotirmoy Bhattacharya; Sayantani Bhattacharyya; R. Loganayagam; Shiraz Minwalla; V. Umesh

    2010-05-16T23:59:59.000Z

    We study small charged black holes in global AdS spacetime in the presence of a charged massless minimally coupled scalar field. In a certain parameter range these black holes suffer from well known superradiant instabilities. We demonstrate that the end point of the resultant tachyon condensation process is a hairy black hole which we construct analytically in a perturbative expansion in the black hole radius. At leading order our solution is a small undeformed RNAdS black hole immersed into a charged scalar condensate that fills the AdS `box'. These hairy black hole solutions appear in a two parameter family labelled by their mass and charge. Their mass is bounded from below by a function of their charge; at the lower bound a hairy black hole reduces to a regular horizon free soliton which can also be thought of as a nonlinear Bose condensate. We compute the microcanonical phase diagram of our system at small mass, and demonstrate that it exhibits a second order `phase transition' between the RNAdS black hole and the hairy black hole phases.

  5. AdS/Ricci-flat correspondence

    E-Print Network [OSTI]

    Marco M. Caldarelli; Joan Camps; Blaise Goutéraux; Kostas Skenderis

    2014-04-18T23:59:59.000Z

    We present a comprehensive analysis of the AdS/Ricci-flat correspondence, a map between a class of asymptotically locally AdS spacetimes and a class of Ricci-flat spacetimes. We provide a detailed derivation of the map, discuss a number of extensions and apply it to a number of important examples, such as AdS on a torus, AdS black branes and fluids/gravity metrics. In particular, the correspondence links the hydrodynamic regime of asymptotically flat black $p$-branes or the Rindler fluid with that of AdS. It implies that this class of Ricci-flat spacetimes inherits from AdS a generalized conformal symmetry and has a holographic structure. We initiate the discussion of holography by analyzing how the map acts on boundary conditions and holographic 2-point functions.

  6. Querying Multiple Sets of Discovered Rules Rule mining is an important data mining task that has been

    E-Print Network [OSTI]

    Liu, Bing

    operating on multiple rulebases because many practically important data mining queries naturally requireQuerying Multiple Sets of Discovered Rules ABSTRACT Rule mining is an important data mining task querying of multiple data mining rulebases to retrieve interesting rules. In this paper, we propose a new

  7. Social Media Ad Metrics Definitions

    E-Print Network [OSTI]

    Collins, Gary S.

    these metrics to encourage growth through consistency. Social media speaks to a new way of understanding howSocial Media Ad Metrics Definitions Released May 2009 #12;Social Media Metrics Definitions © 2008 & Social Media Committee. About the IAB's User-Generated Content & Social Media Committee: The User

  8. Adding Value to Agricultural Products

    E-Print Network [OSTI]

    Anderson, David P.; Hanselka, Daniel

    2009-06-01T23:59:59.000Z

    and some of the viscera into menudo or tripas. Booker Packing Company, Caviness Packing Company and J&B Foods are some of the compa- nies adding value to meat successfully in spite of processing costs. A recent survey of such companies indicated...

  9. Private Database Queries Using Quantum States with Limited Coherence Times

    E-Print Network [OSTI]

    Tad Hogg; Li Zhang

    2009-03-31T23:59:59.000Z

    We describe a method for private database queries using exchange of quantum states with bits encoded in mutually incompatible bases. For technology with limited coherence time, the database vendor can announce the encoding after a suitable delay to allow the user to privately learn one of two items in the database without the ability to also definitely infer the second item. This quantum approach also allows the user to choose to learn other functions of the items, such as the exclusive-or of their bits, but not to gain more information than equivalent to learning one item, on average. This method is especially useful for items consisting of a few bits by avoiding the substantial overhead of conventional cryptographic approaches.

  10. Matching of correlators in AdS_3/CFT_2

    E-Print Network [OSTI]

    Marika Taylor

    2007-09-12T23:59:59.000Z

    Recently exact agreement has been found between three-point correlators of chiral operators computed in string theory on AdS_3 x S^3 x T^4 with NS-NS flux and those computed in the symmetric orbifold CFT. However, it has also been shown that these correlators disagree with those computed in supergravity, under any identification of single particle operators which respects the symmetries. In this note we resolve this disagreement: the key point is that mixings with multi-particle operators are not suppressed even at large N in extremal correlators. Allowing for such mixings, orbifold/string theory operators and supergravity operators can be matched such that both non-extremal and extremal three point functions agree, giving further evidence for the non-renormalization of the chiral ring.

  11. AdS strings with torsion: Noncomplex heterotic compactifications

    SciTech Connect (OSTI)

    Frey, Andrew R.; Lippert, Matthew [California Institute of Technology, Mail Code 452-48, Pasadena, California 91125 (United States); University of Kentucky, Lexington, Kentucky 40506, USA and University of Louisville, Louisville, Kentucky 40292 (United States)

    2005-12-15T23:59:59.000Z

    Combining the effects of fluxes and gaugino condensation in heterotic supergravity, we use a ten-dimensional approach to find a new class of four-dimensional supersymmetric AdS{sub 4} compactifications on almost-Hermitian manifolds of SU(3) structure. Computation of the torsion allows a classification of the internal geometry, which for a particular combination of fluxes and condensate, is nearly Kaehler. We argue that all moduli are fixed, and we show that the Kaehler potential and superpotential proposed in the literature yield the correct AdS{sub 4} radius. In the nearly Kaehler case, we are able to solve the H Bianchi identity using a nonstandard embedding. Finally, we point out subtleties in deriving the effective superpotential and understanding the heterotic supergravity in the presence of a gaugino condensate.

  12. The Analytic Bootstrap and AdS Superhorizon Locality

    E-Print Network [OSTI]

    A. Liam Fitzpatrick; Jared Kaplan; David Poland; David Simmons-Duffin

    2013-01-24T23:59:59.000Z

    We take an analytic approach to the CFT bootstrap, studying the 4-pt correlators of d > 2 dimensional CFTs in an Eikonal-type limit, where the conformal cross ratios satisfy |u| 2\\Delta_\\phi + 2n for each integer n as l -> infinity. We show how the rate of approach is controlled by the twist and OPE coefficient of the leading twist operator in the \\phi x \\phi OPE, and we discuss SCFTs and the 3d Ising Model as examples. Additionally, we show that the OPE coefficients of other large spin operators appearing in the OPE are bounded as l -> infinity. We interpret these results as a statement about superhorizon locality in AdS for general CFTs.

  13. Vortex hair on AdS black holes

    E-Print Network [OSTI]

    Gregory, Ruth; Kubiznak, David; Mann, Robert B; Wills, Danielle

    2014-01-01T23:59:59.000Z

    We analyse vortex hair for charged rotating asymptotically AdS black holes in the abelian Higgs model. We give analytical and numerical arguments to show how the vortex interacts with the horizon of the black hole, and how the solution extends to the boundary. The solution is very close to the corresponding asymptotically flat vortex, once one transforms to a frame that is non-rotating at the boundary. We show that there is a Meissner effect for extremal black holes, with the vortex flux being expelled from sufficiently small black holes. The phase transition is shown to be first order in the presence of rotation, but second order without rotation. We comment on applications to holography.

  14. Construction of Query Concepts in a Document space based on Data Mining Techniques

    E-Print Network [OSTI]

    Chang, Y.; Kim, M.; Ounis, I.

    Chang,Y. Kim,M. Ounis,I. In Proceedings of the 6th International Conference On Flexible Query Answering Systems (FQAS 2004), Lecture Notes in Artificial Intelligence, June 24-26 2004, Lyon, France. Sun Microsystems Inc.

  15. Top-K Queries on Uncertain Data: On Score Distribution and Typical Answers

    E-Print Network [OSTI]

    Ge, Tingjian

    2009-01-01T23:59:59.000Z

    Uncertain data arises in a number of domains, including data integration and sensor networks. Top-k queries that rank results according to some user-defined score are an important tool for exploring large uncertain data ...

  16. CORI Project: 2008-44 30 June 2010 Coastal Habitat Mapping Query Manual

    E-Print Network [OSTI]

    GIS Query]. 5. Determining the mapped distribution and shoreline length of the canopy kelps Macrocystis (giant kelp), Nereocystis (bull kelp), and Alaria fistulosa (dragon kelp) (MAC, NER, and ALF biobands

  17. A Semantic Perspective on Query Log Analysis Katja Hofmann Maarten de Rijke Bouke Huurnink Edgar Meij

    E-Print Network [OSTI]

    de Rijke, Maarten

    A Semantic Perspective on Query Log Analysis Katja Hofmann Maarten de Rijke Bouke Huurnink Edgar Meij ISLA, University of Amsterdam k.hofmann@uva.nl, mdr@science.uva.nl bhuurnink@uva.nl, edgar

  18. AEI-2008-085 The Classical Exchange Algebra of AdS5 S5

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    AEI-2008-085 The Classical Exchange Algebra of AdS5 × S5 String Theory Marc Magro Universit´e de matrix of AdS5× S5 string theory in the Green-Schwarz formulation is determined by using a first the pure spinor description of AdS5 × S5 string theory. These results are compared to the one obtained by A

  19. On Rotating and Oscillating Four-Spin Strings in AdS5 X S5

    E-Print Network [OSTI]

    Kamal L. Panigrahi; Pabitra M. Pradhan

    2012-10-26T23:59:59.000Z

    We study rigidly rotating strings in AdS5 X S5 background with one spin along AdS5 and three angular momenta along S5. We find dispersion relations among various charges and interpret them as giant magnon and spiky string solutions in various limits. Further we present an example of oscillating string which oscillates in the radial direction of the AdS5 and at the same time rotates in S5.

  20. On Rotating and Oscillating Four-Spin Strings in AdS5 X S5

    E-Print Network [OSTI]

    Panigrahi, Kamal L

    2012-01-01T23:59:59.000Z

    We study rigidly rotating strings in AdS5 X S5 background with one spin along AdS5 and three angular momenta along S5. We find dispersion relations among various charges and interpret them as giant magnon and spiky string solutions in various limits. Further we present an example of oscillating string which oscillates in the radial direction of the AdS5 and at the same time rotates in S5.

  1. Kaolin AD | Open Energy Information

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page onYou are now leaving Energy.gov You are now leaving Energy.gov You are8COaBulkTransmissionSitingProcess.pdfGetecGtelInteriasIowa: EnergyKanabec County,Kaolin AD Jump to: navigation,

  2. Fermilab Today - Classified Ad Policy

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOEThe Bonneville Power AdministrationField8,Dist. CategoryFebruaryFebruaryInThe, 2015 spacer7,, 20150,2,Aug.Ad

  3. Fermilab Today | Classifieds Ad Form

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOEThe Bonneville Power AdministrationField8,Dist. CategoryFebruaryFebruaryInThe, 2015Ads Subscribe |

  4. Adding structure to agent programming languages

    E-Print Network [OSTI]

    Zachmann, Gabriel

    Zachmann (Computer Graphics) #12;Adding structure to agent programming languages Peter Novák, Jürgen Dix

  5. The inside outs of AdS(3)/CFT(2): Exact AdS wormholes with entangled CFT duals

    E-Print Network [OSTI]

    Gautam Mandal; Ritam Sinha; Nilakash Sorokhaibam

    2014-11-03T23:59:59.000Z

    We present the complete family of solutions of 3D gravity (Lambda<0) with two asymptotically AdS exterior regions. The solutions are constructed from data at the two boundaries, which correspond to two independent and arbitrary stress tensors T_R, \\bar T_R, and T_L, \\bar T_L. The two exteriors are smoothly joined on to an interior region through a regular horizon. We find CFT duals of these geometries which are entangled states of two CFT's. We compute correlators between general operators at the two boundaries and find perfect agreement between CFT and bulk calculations. We calculate and match the CFT entanglement entropy (EE) with the holographic EE which involves geodesics passing through the wormhole. We also compute a holographic, non-equilibrium entropy for the CFT using properties of the regular horizon. The construction of the bulk solutions here uses an exact version of Brown-Henneaux type diffeomorphisms which are asymptotically nontrivial and transform the CFT states by two independent unitary operators on the two sides. Our solutions provide an infinite family of explicit examples of the ER=EPR relation of Maldacena and Susskind [arXiv:1306.0533].

  6. Online Effects of Offline Ads Diane Lambert

    E-Print Network [OSTI]

    Tomkins, Andrew

    a methodology for assessing how ad campaigns in offline media such as print, audio and TV affect online in-in-difference estimation, Lift, Causal Modeling, Bootstrapping 1. INTRODUCTION Loosely speaking, an ad is effective was conducted in an offline medium such as print, radio or TV. That is, one measure of offline ad effectiveness

  7. Topics in network communications

    E-Print Network [OSTI]

    Cannons, Jillian Leigh

    2008-01-01T23:59:59.000Z

    Int. Workshop on Evaluation of Wireless Ad Hoc, Sensor andon Performance Evaluation of Wireless Ad Hoc, Sensor and

  8. Tunneling between the giant gravitons in AdS5 x S5

    E-Print Network [OSTI]

    Julian Lee

    2001-04-05T23:59:59.000Z

    I consider the giant gravitons in AdS5 x S5. By numerical simulation, I show a strong indication that there is no instanton solution describing the direct tunneling between the giant graviton in the S5 and its dual counterpart in the AdS5. I argue that it supports the supersymmetry breaking scenario suggested in hep-th/0008015

  9. Using Bitmap Indexing Technology for Combined Numerical and TextQueries

    SciTech Connect (OSTI)

    Stockinger, Kurt; Cieslewicz, John; Wu, Kesheng; Rotem, Doron; Shoshani, Arie

    2006-10-16T23:59:59.000Z

    In this paper, we describe a strategy of using compressedbitmap indices to speed up queries on both numerical data and textdocuments. By using an efficient compression algorithm, these compressedbitmap indices are compact even for indices with millions of distinctterms. Moreover, bitmap indices can be used very efficiently to answerBoolean queries over text documents involving multiple query terms.Existing inverted indices for text searches are usually inefficient forcorpora with a very large number of terms as well as for queriesinvolving a large number of hits. We demonstrate that our compressedbitmap index technology overcomes both of those short-comings. In aperformance comparison against a commonly used database system, ourindices answer queries 30 times faster on average. To provide full SQLsupport, we integrated our indexing software, called FastBit, withMonetDB. The integrated system MonetDB/FastBit provides not onlyefficient searches on a single table as FastBit does, but also answersjoin queries efficiently. Furthermore, MonetDB/FastBit also provides avery efficient retrieval mechanism of result records.

  10. An Application of Multivariate Statistical Analysis for Query-Driven Visualization

    SciTech Connect (OSTI)

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

    2010-03-01T23:59:59.000Z

    Abstract?Driven by the ability to generate ever-larger, increasingly complex data, there is an urgent need in the scientific community for scalable analysis methods that can rapidly identify salient trends in scientific data. Query-Driven Visualization (QDV) strategies are among the small subset of techniques that can address both large and highly complex datasets. This paper extends the utility of QDV strategies with a statistics-based framework that integrates non-parametric distribution estimation techniques with a new segmentation strategy to visually identify statistically significant trends and features within the solution space of a query. In this framework, query distribution estimates help users to interactively explore their query's solution and visually identify the regions where the combined behavior of constrained variables is most important, statistically, to their inquiry. Our new segmentation strategy extends the distribution estimation analysis by visually conveying the individual importance of each variable to these regions of high statistical significance. We demonstrate the analysis benefits these two strategies provide and show how they may be used to facilitate the refinement of constraints over variables expressed in a user's query. We apply our method to datasets from two different scientific domains to demonstrate its broad applicability.

  11. QuerySpaces on Hadoop for the ATLAS EventIndex

    E-Print Network [OSTI]

    Hrivnac, Julius; The ATLAS collaboration; Cranshaw, Jack; Glasman, Claudia; Favareto, Andrea; Prokoshin, Fedor

    2015-01-01T23:59:59.000Z

    Hadoop-based implementation of the adaptive query engine serving as the back-end for the ATLAS EventIndex. The QuerySpaces implementation handles both original data and search results providing fast and efficient mechanisms for new user queries using already accumulated knowledge for optimisation. Detailed description and statistics about user requests are collected in HBase tables and HDFS files. Requests are associated to their results and a graph of relations between them is created to be used to find the most efficient way of providing answers to new requests The environment is completely transparent to users and is accessible over several command-line interfaces, a Web Service and a programming API.

  12. QuerySpaces on Hadoop for the ATLAS EventIndex

    E-Print Network [OSTI]

    Hrivnac, Julius; The ATLAS collaboration; Cranshaw, Jack; Favareto, Andrea; Prokoshin, Fedor; Glasman, Claudia; Toebbicke, Rainer

    2015-01-01T23:59:59.000Z

    A Hadoop-based implementation of the adaptive query engine serving as the back-end for the ATLAS EventIndex. The QuerySpaces implementation handles both original data and search results providing fast and efficient mechanisms for new user queries using already accumulated knowledge for optimization. Detailed descriptions and statistics about user requests are collected in HBase tables and HDFS files. Requests are associated to their results and a graph of relations between them is created to be used to find the most efficient way of providing answers to new requests The environment is completely transparent to users and is accessible over several command-line interfaces, a Web Service and a programming API.

  13. University Policy No.: AD2530 Classification: Administration

    E-Print Network [OSTI]

    Victoria, University of

    University Policy No.: AD2530 Classification: Administration PHOTOCOPY AND FACSIMILE (FAX may be obtained through library managed machines or through the use of personal accounts. 1

  14. ammonia synthesis ad: Topics by E-print Network

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    spin fields in AdS(5) HEP - Theory (arXiv) Summary: Free arbitrary spin massless and self-dual massive fields propagating in AdS5 are investigated. We study totally...

  15. Query complexity for searching multiple marked states from an unsorted database

    E-Print Network [OSTI]

    Bin Shang

    2006-04-10T23:59:59.000Z

    An important and usual problem is to search all states we want from a database with a large number of states. In such, recall is vital. Grover's original quantum search algorithm has been generalized to the case of multiple solutions, but no one has calculated the query complexity in this case. We will use a generalized algorithm with higher precision to solve such a search problem that we should find all marked states and show that the practical query complexity increases with the number of marked states. In the end we will introduce an algorithm for the problem on a ``duality computer'' and show its advantage over other algorithms.

  16. DMQL: A Data Mining Query Language for Relational Databases \\Lambda Jiawei Han Yongjian Fu Wei Wang Krzysztof Koperski Osmar Zaiane

    E-Print Network [OSTI]

    Fu, Yongjian

    DMQL: A Data Mining Query Language for Relational Databases \\Lambda Jiawei Han Yongjian Fu Wei Wang@cs.sfu.ca Abstract The emerging data mining tools and systems lead naturally to the demand of a powerful data mining. This motivates us to design a data mining query language, DMQL, for mining different kinds of knowledge

  17. Web Intelligence and Agent Systems: An International Journal 0 (2010) 10 1 Selecting Queries from Sample to Crawl

    E-Print Network [OSTI]

    Lu, Jianguo

    2010-01-01T23:59:59.000Z

    Queries from Sample to Crawl Deep Web Data Sources Yan Wang a Jianguo Lu a,c Jie Liang a Jessica Chen crawl a deep web data source using a set of sample documents. Crawling deep web is the process of collecting data from search interfaces by issuing queries. One of the major challenges in crawling deep web

  18. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 30, NO. 2, FEBRUARY 2012 433 Secure Cooperative Data Storage and Query

    E-Print Network [OSTI]

    Zhang, Rui

    mobile-sink visit. Despite rapid progress in storage technology, this approach remains economically Cooperative Data Storage and Query Processing in Unattended Tiered Sensor Networks Rui Zhang, Student Member. Such a cooperative data storage and query processing paradigm offers a number of advantages over traditional

  19. AdS (In)stability: Lessons From The Scalar Field

    E-Print Network [OSTI]

    Pallab Basu; Chethan Krishnan; P. N. Bala Subramanian

    2015-01-29T23:59:59.000Z

    We argued in arXiv:1408.0624 that the quartic scalar field in AdS has features that could be instructive for answering the gravitational stability question of AdS. Indeed, the conserved charges identified there have recently been observed in the full gravity theory as well. In this paper, we continue our investigation of the scalar field in AdS and provide evidence that in the Two-Time Formalism (TTF), even for initial conditions that are far from quasi-periodicity, the energy in the higher modes at late times is exponentially suppressed in the mode number. Based on this and some related observations, we argue that there is no thermalization in the scalar TTF model within time-scales that go as $\\sim 1/\\epsilon^2$, where $\\epsilon$ measures the initial amplitude (with only low-lying modes excited). It is tempting to speculate that the result holds also for AdS collapse.

  20. Duality invariance of $s \\ge 3/2$ fermions in AdS

    E-Print Network [OSTI]

    S. Deser; D. Seminara

    2014-09-11T23:59:59.000Z

    We show that in D=4 AdS, $s\\ge 3/2$ partially massless (PM) fermions retain the duality invariances of their flat space massless counterparts. They have tuned ratios $ {m^2}/{M^2}\

  1. Splitting of Folded Strings in AdS_4*CP^3

    E-Print Network [OSTI]

    Jun-Bao Wu

    2012-08-04T23:59:59.000Z

    We study classically splitting of two kinds of folded string solutions in AdS_4*CP^3. Conserved charges of the produced fragments are computed for each case. We find interesting patterns among these conserved charges.

  2. Inflation in AdS/CFT

    SciTech Connect (OSTI)

    Freivogel, Ben; /Stanford U., Phys. Dept. /LBL, Berkeley; Hubeny, Veronika E.; /LBL, Berkeley /Durham U., Dept. of Math.; Maloney, Alexander; /Stanford U., Phys. Dept.; Myers, Rob; /Perimeter Inst. Theor. Phys. /Waterloo U.; Rangamani, Mukund; /LBL, Berkeley /Durham U., Dept. of Math.; Shenker, Stephen; /Stanford U., Phys. Dept.

    2005-10-07T23:59:59.000Z

    We study the realization of inflation within the AdS/CFT correspondence. We assume the existence of a string landscape containing at least one stable AdS vacuum and a (nearby) metastable de Sitter state. Standard arguments imply that the bulk physics in the vicinity of the AdS minimum is described by a boundary CFT. We argue that large enough bubbles of the dS phase, including those able to inflate, are described by mixed states in the CFT. Inflating degrees of freedom are traced over and do not appear explicitly in the boundary description. They nevertheless leave a distinct imprint on the mixed state. Analytic continuation allows us, in principle, to recover a large amount of nonperturbatively defined information about the inflating regime. Our work also shows that no scattering process can create an inflating region, even by quantum tunneling, since a pure state can never evolve into a mixed state under unitary evolution.We study the realization of inflation within the AdS/CFT correspondence. We assume the existence of a string landscape containing at least one stable AdS vacuum and a (nearby) metastable de Sitter state. Standard arguments imply that the bulk physics in the vicinity of the AdS minimum is described by a boundary CFT. We argue that large enough bubbles of the dS phase, including those able to inflate, are described by mixed states in the CFT. Inflating degrees of freedom are traced over and do not appear explicitly in the boundary description. They nevertheless leave a distinct imprint on the mixed state. Analytic continuation allows us, in principle, to recover a large amount of nonperturbatively defined information about the inflating regime. Our work also shows that no scattering process can create an inflating region, even by quantum tunneling, since a pure state can never evolve into a mixed state under unitary evolution.

  3. AdS black hole solutions in dilatonic Einstein-Gauss-Bonnet gravity

    SciTech Connect (OSTI)

    Maeda, Kei-ichi [Department of Physics, Waseda University, Shinjuku, Tokyo 169-8555 (Japan); Advanced Research Institute for Science and Engineering, Waseda University, Shinjuku, Tokyo 169-8555 (Japan); Ohta, Nobuyoshi [Department of Physics, Kinki University, Higashi-Osaka, Osaka 577-8502 (Japan); Sasagawa, Yukinori [Department of Physics, Waseda University, Shinjuku, Tokyo 169-8555 (Japan)

    2011-02-15T23:59:59.000Z

    We find that anti-de Sitter (AdS) spacetime with a nontrivial linear dilaton field is an exact solution in the effective action of the string theory, which is described by gravity with the Gauss-Bonnet curvature terms coupled to a dilaton field in the string frame without a cosmological constant. The AdS radius is determined by the spacetime dimensions and the coupling constants of curvature corrections. We also construct the asymptotically AdS black hole solutions with a linear dilaton field numerically. We find these AdS black holes for hyperbolic topology and in dimensions higher than four. We discuss the thermodynamical properties of those solutions. Extending the model to the case with the even-order higher Lovelock curvature terms, we also find the exact AdS spacetime with a nontrivial dilaton. We further find a cosmological solution with a bounce of three-dimensional space and a solitonic solution with a nontrivial dilaton field, which is regular everywhere and approaches an asymptotically AdS spacetime.

  4. Voronoi-based Geospatial Query Processing with MapReduce Afsin Akdogan, Ugur Demiryurek, Farnoush Banaei-Kashani, and Cyrus Shahabi

    E-Print Network [OSTI]

    Shahabi, Cyrus

    Voronoi-based Geospatial Query Processing with MapReduce Afsin Akdogan, Ugur Demiryurek, Farnoush Angeles, CA 90089 [aakdogan, demiryur, banaeika, shahabi]@usc.edu Abstract Geospatial queries (GQ) have of parallel geospatial query processing with the MapReduce programming model. Our proposed approach creates

  5. A lattice-based query system for assessing the quality of hydro-ecosystems

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    A lattice-based query system for assessing the quality of hydro-ecosystems Agn`es Braud1 Cristina used for building a hierarchy of site pro- files which are annotated by hydro in the project. This paper presents an application of Galois lattices to the hydro-ecological domain, focussing

  6. Public Key Encryption that Allows PIR Queries Dan Boneh # Eyal Kushilevitz + Rafail Ostrovsky #

    E-Print Network [OSTI]

    Public Key Encryption that Allows PIR Queries Dan Boneh # Eyal Kushilevitz + Rafail Ostrovsky a public­key encryption scheme for Alice that allows PIR searching over encrypted documents. Our solution­trivially small communication complexity. The main technique of our solution also allows for Single­Database PIR

  7. Topic Distillation with Query-Dependent Link Connections and Page Characteristics

    E-Print Network [OSTI]

    Wu, Mingfang

    6 Topic Distillation with Query-Dependent Link Connections and Page Characteristics MINGFANG WU about a topic. Finding such results is called topic distillation. Previous research has shown statistics. This article presents a new approach to improve topic distillation by exploring the use

  8. MQuery: A Visual Query Language for Multimedia, Timeline, and Simulation Data

    E-Print Network [OSTI]

    California at Los Angeles, University of

    MQuery: A Visual Query Language for Multimedia, Timeline, and Simulation Data John David N. Dionisio Alfonso F. C'ardenas Computer Science Department University of California, Los Angeles July 25 of California, Los Angeles Los Angeles, CA 90024 U.S.A. Phone: (310) 825­7550 Fax: (310) 825­2273 e

  9. MQuery: A Visual Query Language for Multimedia, Timeline, and Simulation Data

    E-Print Network [OSTI]

    California at Los Angeles, University of

    MQuery: A Visual Query Language for Multimedia, Timeline, and Simulation Data John David N. Dionisio Alfonso F. Cardenas Computer Science Department University of California, Los Angeles July 25 of California, Los Angeles Los Angeles, CA 90024 U.S.A. Phone: (310) 825-7550 Fax: (310) 825-2273 e

  10. DEVise: Integrated Querying and Visual Exploration of Large Datasets (DEMO ABSTRACT)

    E-Print Network [OSTI]

    Liblit, Ben

    DEVise: Integrated Querying and Visual Exploration of Large Datasets (DEMO ABSTRACT) M. Livny, R of large tabular datasets (possibly containing or referencing multi­ media objects) from several sources meta­data summarizing the entire dataset, to large subsets of the actual data, to individual data

  11. TS-IDS Algorithm For Query Selection in the Deep Web Crawling

    E-Print Network [OSTI]

    Lu, Jianguo

    TS-IDS Algorithm For Query Selection in the Deep Web Crawling Yan Wang1 , Jianguo Lu2 , and Jessica. The deep web crawling is the process of collecting data items inside a data source hidden behind searchable of documents and terms involved, calls for new approximation algorithms for efficient deep web data crawling

  12. MobiEyes: Distributed Processing of Continuously Moving Queries on Moving Objects in a Mobile System

    E-Print Network [OSTI]

    Liu, Ling

    System Bugra Gedik and Ling Liu College of Computing, Georgia Institute of Technology {bgedik queries on moving objects in a centralized lo- cation monitoring system. Surprisingly, very few have of MobiEyes, a distributed real-time location monitoring system in a mobile environment. Mobieyes utilizes

  13. Site-To-Site (S2S) Searching with Query Routing Using Distributed Registrars

    E-Print Network [OSTI]

    King, Kuo Chin Irwin

    Site-To-Site (S2S) Searching with Query Routing Using Distributed Registrars Wan Yeung Wong Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin, Hong Kong wywong@cse.cuhk.edu.hk Irwin King Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin

  14. Site-Based Dynamic Pruning for Query Processing in Search Engines

    E-Print Network [OSTI]

    Ulusoy, �zgür

    Site-Based Dynamic Pruning for Query Processing in Search Engines Ismail Sengor Altingovde, Engin Demir, Fazli Can, �zgür Ulusoy Computer Engineering Department, Bilkent University, Ankara 06800, Turkey {ismaila, endemir, canf, oulusoy}@cs.bilkent.edu.tr ABSTRACT Web search engines typically index

  15. GeoDec: A Framework to Effectively Visualize and Query Geospatial Data for Decision-Making

    E-Print Network [OSTI]

    Shahabi, Cyrus

    GeoDec: A Framework to Effectively Visualize and Query Geospatial Data for Decision-Making Cyrus-to-end system that enables geospatial decision-making by virtualizing the real-world geolocations. With GeoDec, first the geolocation of interest is rapidly and realistically simulated and all relevant geospatial

  16. Data Integration for Querying Geospatial Isabel F. Cruz and Huiyong Xiao

    E-Print Network [OSTI]

    Cruz, Isabel F.

    Data Integration for Querying Geospatial Sources Isabel F. Cruz and Huiyong Xiao Department of Computer Science University of Illinois at Chicago {ifc | hxiao}@cs.uic.edu Abstract. Geospatial data and is critical in emergency management. However, geospatial data are distributed, complex, and heterogeneous due

  17. VISUAL QUERY OF TIME-DEPENDENT 3D WEATHER IN A GLOBAL GEOSPATIAL

    E-Print Network [OSTI]

    Shaw, Chris

    1 VISUAL QUERY OF TIME-DEPENDENT 3D WEATHER IN A GLOBAL GEOSPATIAL ENVIRONMENT William Ribarsky and Spatial Analysis Technologies, Georgia Institute of Technology This Technical Report is a draft WEATHER IN A GLOBAL GEOSPATIAL ENVIRONMENT William Ribarsky, Nickolas Faust, Zachary Wartell, Christopher

  18. Breaking POET Authentication with a Single Query Jian Guo, Jeremy Jean, Thomas Peyrin, and Lei Wang

    E-Print Network [OSTI]

    Breaking POET Authentication with a Single Query Jian Guo, J´er´emy Jean, Thomas Peyrin, and Lei article, we describe a very practical and simple attack on the au- thentication part of POET authenticated encryption mode proposed at FSE 2014. POET is a provably secure scheme that was designed to resist various

  19. Locality sensitive hashing: a comparison of hash function types and querying mechanisms Loic Pauleve,a

    E-Print Network [OSTI]

    Boyer, Edmond

    . The comparison of random projections, lattice quantizers, k-means and hierarchical k-means reveal algorithms such as a k-means quantizer have been shown to provide excellent vector search performanceLocality sensitive hashing: a comparison of hash function types and querying mechanisms Lo

  20. Optimizing Data Replication for Expanding Ring-based Queries in Wireless Sensor

    E-Print Network [OSTI]

    Krishnamachari, Bhaskar

    Optimizing Data Replication for Expanding Ring-based Queries in Wireless Sensor Networks Bhaskar are disseminated using expand- ing rings. We obtain closed-form approximations for the expected energy costs such as changes, movements and failures of nodes in the net- work). Randomized storage can also provide for a more