name stringlengths 10 10 | title stringlengths 22 113 | abstract stringlengths 282 2.29k | fulltext stringlengths 15.3k 85.1k | keywords stringlengths 87 585 |
|---|---|---|---|---|
train_C-41 | Evaluating Adaptive Resource Management for Distributed Real-Time Embedded Systems | A challenging problem faced by researchers and developers of distributed real-time and embedded (DRE) systems is devising and implementing effective adaptive resource management strategies that can meet end-to-end quality of service (QoS) requirements in varying operational conditions. This paper presents two contribut... | 1. INTRODUCTION
Achieving end-to-end real-time quality of service (QoS)
is particularly important for open distributed real-time and
embedded (DRE) systems that face resource constraints, such
as limited computing power and network bandwidth.
Overutilization of these system resources can yield unpredictable
and unstabl... | real-time video distribution system;dynamic environment;hybrid system;video encoding/decoding;quality of service;streaming service;hybrid adaptive resourcemanagement middleware;distributed real-time embedded system;distribute real-time embed system;adaptive resource management;service end-to-end quality;hybrid control ... |
train_C-42 | Demonstration of Grid-Enabled Ensemble Kalman Filter Data Assimilation Methodology for Reservoir Characterization | Ensemble Kalman filter data assimilation methodology is a popular approach for hydrocarbon reservoir simulations in energy exploration. In this approach, an ensemble of geological models and production data of oil fields is used to forecast the dynamic response of oil wells. The Schlumberger ECLIPSE software is used fo... | 1. INTRODUCTION
Grid computing [1] is an emerging collaborative
computing paradigm to extend institution/organization
specific high performance computing (HPC) capabilities
greatly beyond local resources. Its importance stems from
the fact that ground breaking research in strategic
application areas such as bioscience ... | pooling license;grid-enabling;ensemble kalman filter;and gridway;cyberinfrastructure development project;tigre grid computing environment;grid computing;hydrocarbon reservoir simulation;gridway metascheduler;enkf;datum assimilation methodology;high performance computing;tigre;energy exploration;tigre grid middleware;st... |
train_C-44 | MSP: Multi-Sequence Positioning of Wireless Sensor Nodes∗ | Wireless Sensor Networks have been proposed for use in many location-dependent applications. Most of these need to identify the locations of wireless sensor nodes, a challenging task because of the severe constraints on cost, energy and effective range of sensor devices. To overcome limitations in existing solutions, w... | 1 Introduction
Although Wireless Sensor Networks (WSN) have shown
promising prospects in various applications [5], researchers
still face several challenges for massive deployment of such
networks. One of these is to identify the location of
individual sensor nodes in outdoor environments. Because of
unpredictable flow... | marginal distribution;node localization;multi-sequence positioning;listen-detect-assemble-report protocol;event distribution;range-based approach;spatiotemporal correlation;localization;node sequence process;distribution-based location estimation;massive uva-based deploment;wireless sensor network |
train_C-45 | StarDust: A Flexible Architecture for Passive Localization in Wireless Sensor Networks | The problem of localization in wireless sensor networks where nodes do not use ranging hardware, remains a challenging problem, when considering the required location accuracy, energy expenditure and the duration of the localization phase. In this paper we propose a framework, called StarDust, for wireless sensor netwo... | 1 Introduction
Wireless Sensor Networks (WSN) have been envisioned
to revolutionize the way humans perceive and interact with
the surrounding environment. One vision is to embed tiny
sensor devices in outdoor environments, by aerial
deployments from unmanned air vehicles. The sensor nodes form
a network and collaborate... | range;unique mapping;performance;image processing;connectivity;localization;scene labeling;probability;sensor node;aerial vehicle;consistency;wireless sensor network;corner-cube retro-reflector |
train_C-46 | TSAR: A Two Tier Sensor Storage Architecture Using Interval Skip Graphs | Archival storage of sensor data is necessary for applications that query, mine, and analyze such data for interesting features and trends. We argue that existing storage systems are designed primarily for flat hierarchies of homogeneous sensor nodes and do not fully exploit the multi-tier nature of emerging sensor netw... | 1. Introduction
1.1 Motivation
Many different kinds of networked data-centric sensor
applications have emerged in recent years. Sensors in these applications
sense the environment and generate data that must be processed,
filtered, interpreted, and archived in order to provide a useful
infrastructure to its users. To a... | analysis;archival storage;datum separation;sensor datum;index method;homogeneous architecture;flash storage;metada;distributed index structure;interval skip graph;interval tree;spatial scoping;geographic hash table;separation of datum;flooding;multi-tier sensor network;wireless sensor network;archive |
train_C-48 | Multi-dimensional Range Queries in Sensor Networks∗ | In many sensor networks, data or events are named by attributes. Many of these attributes have scalar values, so one natural way to query events of interest is to use a multidimensional range query. An example is: List all events whose temperature lies between 50◦ and 60◦ , and whose light levels lie between 10 and 15.... | 1. INTRODUCTION
In wireless sensor networks, data or events will be named
by attributes [15] or represented as virtual relations in a
distributed database [18, 3]. Many of these attributes will
have scalar values: e.g., temperature and light levels, soil
moisture conditions, etc. In these systems, we argue, one
natural... | datacentric storage system;multi-dimensional range query;multidimensional range query;event insertion;querying cost;query flooding;indexing technique;dim;distributed datum structure;asymptotic behavior;locality-preserving geographic hash;sensor network;geographic routing;centralized index;normal event distribution;effi... |
train_C-49 | Evaluating Opportunistic Routing Protocols with Large Realistic Contact Traces | Traditional mobile ad-hoc network (MANET) routing protocols assume that contemporaneous end-to-end communication paths exist between data senders and receivers. In some mobile ad-hoc networks with a sparse node population, an end-to-end communication path may break frequently or may not exist at any time. Many routing ... | 1. INTRODUCTION
Mobile opportunistic networks are one kind of delay-tolerant
network (DTN) [6]. Delay-tolerant networks provide service
despite long link delays or frequent link breaks. Long link delays
happen in networks with communication between nodes at a great
distance, such as interplanetary networks [2]. Link br... | contact trace;opportunistic network;route;epidemic protocol;frequent link break;end-to-end path;prophet;transfer probability;replication strategy;mobile opportunistic network;delay-tolerant network;random mobility model;direct-delivery protocol;simulation;realistic mobility trace;past encounter and transitivity history... |
train_C-50 | CenWits: A Sensor-Based Loosely Coupled Search and Rescue System Using Witnesses | This paper describes the design, implementation and evaluation of a search and rescue system called CenWits. CenWits uses several small, commonly-available RF-based sensors, and a small number of storage and processing devices. It is designed for search and rescue of people in emergency situations in wilderness areas. ... | 1. INTRODUCTION
Search and rescue of people in emergency situation in a
timely manner is an extremely important service. It has
been difficult to provide such a service due to lack of timely
information needed to determine the current location of a
person who may be in an emergency situation. With the
emergence of perv... | intermittent network connectivity;gp receiver;pervasive computing;connected network;satellite transmitter;emergency situation;search and rescue;witness;beacon;location tracking system;rf transmitter;group and partition;sensor network;hiker |
train_C-52 | Fairness in Dead-Reckoning based Distributed Multi-Player Games | In a distributed multi-player game that uses dead-reckoning vectors to exchange movement information among players, there is inaccuracy in rendering the objects at the receiver due to network delay between the sender and the receiver. The object is placed at the receiver at the position indicated by the dead-reckoning ... | 1. INTRODUCTION
In a distributed multi-player game, players are normally
distributed across the Internet and have varying delays to each other
or to a central game server. Usually, in such games, the players are
part of the game and in addition they may control entities that make
up the game. During the course of the g... | fairness;dead-reckoning vector;export error;network delay;budget based algorithm;clock synchronization;distribute multi-player game;bucket synchronization;mean error;distributed multi-player game;quantization;dead-reckon;scheduling algorithm;accuracy |
train_C-53 | Globally Synchronized Dead-Reckoning with Local Lag for Continuous Distributed Multiplayer Games | Dead-Reckoning (DR) is an effective method to maintain consistency for Continuous Distributed Multiplayer Games (CDMG). Since DR can filter most unnecessary state updates and improve the scalability of a system, it is widely used in commercial CDMG. However, DR cannot maintain high consistency, and this constrains its ... | 1. INTRODUCTION
Nowadays, many distributed multiplayer games adopt replicated
architectures. In such games, the states of entities are changed not
only by the operations of players, but also by the passing of time
[1, 2]. These games are referred to as Continuous Distributed
Multiplayer Games (CDMG). Like other distrib... | local lag;physical clock;time warp;usability and fairness;continuous replicate application;network transmission delay;distribute multi-player game;accurate state;gs-dr-ll;dead-reckon;multiplayer game;consistency;correction |
train_C-54 | Remote Access to Large Spatial Databases | Enterprises in the public and private sectors have been making their large spatial data archives available over the Internet. However, interactive work with such large volumes of online spatial data is a challenging task. We propose two efficient approaches to remote access to large spatial data. First, we introduce a ... | 1. INTRODUCTION
In recent years, enterprises in the public and private
sectors have provided access to large volumes of spatial data
over the Internet. Interactive work with such large volumes
of online spatial data is a challenging task. We have been
developing an interactive browser for accessing spatial online
datab... | large spatial datum;sand;datum visualization;remote access;internet;datum management;web browser;gi;dynamic network infrastructure;client/server;spatial query evaluation;client-server architecture;peer-to-peer;centralized peer-to-peer approach;internet-enabled database management system;network latency |
train_C-55 | Context Awareness for Group Interaction Support | In this paper, we present an implemented system for supporting group interaction in mobile distributed computing environments. First, an introduction to context computing and a motivation for using contextual information to facilitate group interaction is given. We then present the architecture of our system, which con... | 1. INTRODUCTION
Today"s computing environments are characterized by an
increasing number of powerful, wirelessly connected mobile
devices. Users can move throughout an environment while
carrying their computers with them and having remote access to
information and services, anytime and anywhere. New situations
appear, ... | software framework;xml configuration file;context awareness;location sense;event-condition-action;fifth contextdimension group-context;contextaware;group interaction;sensor fusion;mobility system |
train_C-56 | A Hierarchical Process Execution Support for Grid Computing | Grid is an emerging infrastructure used to share resources among virtual organizations in a seamless manner and to provide breakthrough computing power at low cost. Nowadays there are dozens of academic and commercial products that allow execution of isolated tasks on grids, but few products support the enactment of lo... | 1. INTRODUCTION
Grid computing is a model for wide-area distributed and
parallel computing across heterogeneous networks in
multiple administrative domains. This research field aims to
promote sharing of resources and provides breakthrough
computing power over this wide network of virtual
organizations in a seamless ma... | distributed computing;parallel computing;distribute middleware;parallel execution;grid computing;process support;hierarchical process execution;grid architecture;process execution;distributed system;process description;distributed scheduling;scheduling algorithm;distributed application;distributed process;distributed e... |
train_C-57 | Congestion Games with Load-Dependent Failures: Identical Resources | We define a new class of games, congestion games with loaddependent failures (CGLFs), which generalizes the well-known class of congestion games, by incorporating the issue of resource failures into congestion games. In a CGLF, agents share a common set of resources, where each resource has a cost and a probability of ... | 1. INTRODUCTION
We study the effects of resource failures in congestion
settings. This study is motivated by a variety of situations
in multi-agent systems with unreliable components, such as
machines, computers etc. We define a model for congestion
games with load-dependent failures (CGLFs) which provides
simple and n... | potential function;nash equilibrium;nondecreasing cost function;resource cost function;pure strategy nash equilibrium;load-dependent failure;load-dependent resource failure;identical resource;real-valued function;failure probability;localeffect game;congestion game |
train_C-58 | A Scalable Distributed Information Management System∗ | We present a Scalable Distributed Information Management System (SDIMS) that aggregates information about large-scale networked systems and that can serve as a basic building block for a broad range of large-scale distributed applications by providing detailed views of nearby information and summary views of global inf... | 1. INTRODUCTION
The goal of this research is to design and build a Scalable
Distributed Information Management System (SDIMS) that aggregates
information about large-scale networked systems and that can serve
as a basic building block for a broad range of large-scale distributed
applications. Monitoring, querying, and ... | autonomous dht;temporal heterogeneity;administrative isolation;distribute hash table;lazy re-aggregation;write-dominated attribute;large-scale networked system;update-upk-downj strategy;information management system;freepastry framework;tunable spatial replication;distributed hash table;aggregation management layer;dis... |
train_C-61 | Authority Assignment in Distributed Multi-Player Proxy-based Games | We present a proxy-based gaming architecture and authority assignment within this architecture that can lead to better game playing experience in Massively Multi-player Online games. The proposed game architecture consists of distributed game clients that connect to game proxies (referred to as communication proxies) w... | 1. INTRODUCTION
In Massively Multi-player On-line Games (MMOG), game
clients who are positioned across the Internet connect to
a game server to interact with other clients in order to be
part of the game. In current architectures, these
interactions are direct in that the game clients and the servers
exchange game mess... | cheat-proof mechanism;latency compensation;role playing game;artificial latency;mmog;central-server architecture;assignment of authority;authority;proxy-based game architecture;first person shooter;communication proxy;distribute multi-player game;client authoritative approach;authority assignment;multi-player online ga... |
train_C-62 | Network Monitors and Contracting Systems: Competition and Innovation | Today"s Internet industry suffers from several well-known pathologies, but none is as destructive in the long term as its resistance to evolution. Rather than introducing new services, ISPs are presently moving towards greater commoditization. It is apparent that the network"s primitive system of contracts does not ali... | 1. INTRODUCTION
Many studies before us have noted the Internet"s resistance to new
services and evolution. In recent decades, numerous ideas have
been developed in universities, implemented in code, and even
written into the routers and end systems of the network, only to
languish as network operators fail to turn them... | monitor;clean-slate architectural design;contracting system;verifiable monitor;innovation;contract;routing policy;network monitor;routing stagequality;contractible monitor;commoditization;smart market;incentive |
train_C-65 | Shooter Localization and Weapon Classification with Soldier-Wearable Networked Sensors | The paper presents a wireless sensor network-based mobile countersniper system. A sensor node consists of a helmetmounted microphone array, a COTS MICAz mote for internode communication and a custom sensorboard that implements the acoustic detection and Time of Arrival (ToA) estimation algorithms on an FPGA. A 3-axis c... | 1. INTRODUCTION
The importance of countersniper systems is underscored
by the constant stream of news reports coming from the
Middle East. In October 2006 CNN reported on a new
tactic employed by insurgents. A mobile sniper team moves
around busy city streets in a car, positions itself at a good
standoff distance from ... | 1degree trajectory precision;weapon type;weapon classification;range;sensorboard;trajectory;internode communication;datum fusion;acoustic source localization;sensor network;caliber estimation accuracy;helmetmounted microphone array;caliber;caliber estimation;wireless sensor network-based mobile countersniper system;sel... |
train_C-66 | Heuristics-Based Scheduling of Composite Web Service Workloads | Web services can be aggregated to create composite workflows that provide streamlined functionality for human users or other systems. Although industry standards and recent research have sought to define best practices and to improve end-to-end workflow composition, one area that has not fully been explored is the sche... | 1. INTRODUCTION
Web services can be composed into workflows to provide
streamlined end-to-end functionality for human users or other systems.
Although previous research efforts have looked at ways to
intelligently automate the composition of web services into workflows
(e.g. [1, 9]), an important remaining problem is t... | qo;service request;scheduling service;qos-defined limit;multi-tiered system;end-to-end workflow composition;workflows;multi-organisation environment;business process workflow;web service;streamlined functionality;business value metric;scheduling agent;heuristic;schedule |
train_C-67 | A Holistic Approach to High-Performance Computing: Xgrid Experience | The Ringling School of Art and Design is a fully accredited fouryear college of visual arts and design. With a student to computer ratio of better than 2-to-1, the Ringling School has achieved national recognition for its large-scale integration of technology into collegiate visual art and design education. We have fou... | 1. INTRODUCTION
Grid computing does not have a single, universally accepted
definition. The technology behind grid computing model is not
new. Its roots lie in early distributed computing models that date
back to early 1980s, where scientists harnessed the computing
power of idle workstations to let compute intensive a... | render;multimedia;xgrid environment;xgrid;nonlinear video editing;macintosh os x;grid computing;large-scale integration of technology;web production;animation;digital video application;rendezvous;design;visual art;highperformance computing;design education;high-end graphic;mac os x;operating system;cluster |
train_C-68 | An Evaluation of Availability Latency in Carrier-based Vehicular ad-hoc Networks | On-demand delivery of audio and video clips in peer-to-peer vehicular ad-hoc networks is an emerging area of research. Our target environment uses data carriers, termed zebroids, where a mobile device carries a data item on behalf of a server to a client thereby minimizing its availability latency. In this study, we qu... | 1. INTRODUCTION
Technological advances in areas of storage and wireless
communications have now made it feasible to envision on-demand delivery
of data items, for e.g., video and audio clips, in vehicular
peer-topeer networks. In prior work, Ghandeharizadeh et al. [10]
introduce the concept of vehicles equipped with a
... | naive random replacement policy;zebroid;vehicular network;termed zebroid;audio and video clip;mobility;car density;storage per device;datum carrier;latency;simplified instantiation of zebroid;automaton;availability latency;repository size;markov model;zebroid simplified instantiation;mobile device;peer-to-peer vehicula... |
train_C-69 | pTHINC: A Thin-Client Architecture for Mobile Wireless Web | Although web applications are gaining popularity on mobile wireless PDAs, web browsers on these systems can be quite slow and often lack adequate functionality to access many web sites. We have developed pTHINC, a PDA thinclient solution that leverages more powerful servers to run full-function web browsers and other a... | 1. INTRODUCTION
The increasing ubiquity of wireless networks and
decreasing cost of hardware is fueling a proliferation of mobile
wireless handheld devices, both as standalone wireless Personal
Digital Assistants (PDA) and popular integrated PDA/cell
phone devices. These devices are enabling new forms of
mobile computi... | pervasive web;remote display;pda thinclient solution;system usability;web browser;thin-client computing;mobility;full-function web browser;pthinc;seamless mobility;functionality;thin-client;local pda web browser;web application;video playback;screen resolution;web browsing performance;high-fidelity display;mobile wirel... |
train_C-71 | A Point-Distribution Index and Its Application to Sensor-Grouping in Wireless Sensor Networks | We propose ι, a novel index for evaluation of point-distribution. ι is the minimum distance between each pair of points normalized by the average distance between each pair of points. We find that a set of points that achieve a maximum value of ι result in a honeycomb structure. We propose that ι can serve as a good in... | 1. INTRODUCTION
A wireless sensor network (WSN) consists of a large number of
in-situ battery-powered sensor nodes. A WSN can collect the data
about physical phenomena of interest [1]. There are many
potential applications of WSNs, including environmental monitoring and
surveillance, etc. [1][11].
In many application s... | sensor-grouping;sensor group;fault tolerance;sleeping configuration protocol;surveillance;redundancy;sensor coverage;incremental coverage quality algorithm;node-deduction process;point-distribution index;wireless sensor network;honeycomb structure |
train_C-72 | GUESS: Gossiping Updates for Efficient Spectrum Sensing | Wireless radios of the future will likely be frequency-agile, that is, supporting opportunistic and adaptive use of the RF spectrum. Such radios must coordinate with each other to build an accurate and consistent map of spectral utilization in their surroundings. We focus on the problem of sharing RF spectrum data amon... | 1. INTRODUCTION
There has recently been a huge surge in the growth of
wireless technology, driven primarily by the availability of
unlicensed spectrum. However, this has come at the cost
of increased RF interference, which has caused the Federal
Communications Commission (FCC) in the United States to
re-evaluate its st... | coordinate spectrum sense;coordinated sensing;cognitive radio;spatially decaying aggregate;rf interference;spectrum allocation;opportunistic spectrum sharing;innetwork aggregation;incremental algorithm;rf spectrum;spectrum sensing;incremental gossip protocol;fm aggregation;gossip protocol |
train_C-74 | Adapting Asynchronous Messaging Middleware to ad-hoc Networking | The characteristics of mobile environments, with the possibility of frequent disconnections and fluctuating bandwidth, have forced a rethink of traditional middleware. In particular, the synchronous communication paradigms often employed in standard middleware do not appear to be particularly suited to ad-hoc environme... | 1. INTRODUCTION
With the increasing popularity of mobile devices and their
widespread adoption, there is a clear need to allow the
development of a broad spectrum of applications that operate
effectively over such an environment. Unfortunately, this is far
from simple: mobile devices are increasingly heterogeneous
in t... | mobile ad-hoc network;asynchronous messaging middleware;context awareness;epidemic protocol;message-oriented middleware;message orient middleware;asynchronous communication;middleware for mobile computing;mobile ad-hoc environment;cross-layering;group communication;application level routing;java messaging service;epide... |
train_C-75 | Composition of a DIDS by Integrating Heterogeneous IDSs on Grids | This paper considers the composition of a DIDS (Distributed Intrusion Detection System) by integrating heterogeneous IDSs (Intrusion Detection Systems). A Grid middleware is used for this integration. In addition, an architecture for this integration is proposed and validated through simulation. | 1. INTRODUCTION
Solutions for integrating heterogeneous IDSs (Intrusion Detection
Systems) have been proposed by several groups [6],[7],[11],[2].
Some reasons for integrating IDSs are described by the IDWG
(Intrusion Detection Working Group) from the IETF (Internet
Engineering Task Force) [12] as follows:
• Many IDSs a... | system integration;gridsim grid simulator;heterogeneous intrusion detection system;distributed intrusion detection system;grid middleware;intrusion detection system;grid service for intrusion detection;ids integration;grid;open grid service architecture;integration of ids;computational grid;grid intrusion detection arc... |
train_C-76 | Assured Service Quality by Improved Fault Management Service-Oriented Event Correlation | The paradigm shift from device-oriented to service-oriented management has also implications to the area of event correlation. Today"s event correlation mainly addresses the correlation of events as reported from management tools. However, a correlation of user trouble reports concerning services should also be perform... | 1. INTRODUCTION
In huge networks a single fault can cause a burst of failure
events. To handle the flood of events and to find the root
cause of a fault, event correlation approaches like rule-based
reasoning, case-based reasoning or the codebook approach
have been developed. The main idea of correlation is to
condense... | service level agreement;qos;fault management;process management framework;customer service management;service management;service-oriented management;event correlation;rule-based reasoning;case-based reasoning;service-oriented event correlation |
train_C-77 | Tracking Immediate Predecessors in Distributed Computations | A distributed computation is usually modeled as a partially ordered set of relevant events (the relevant events are a subset of the primitive events produced by the computation). An important causality-related distributed computing problem, that we call the Immediate Predecessors Tracking (IPT) problem, consists in ass... | 1. INTRODUCTION
A distributed computation consists of a set of processes
that cooperate to achieve a common goal. A main
characteristic of these computations lies in the fact that the
processes do not share a common global memory, and
communicate only by exchanging messages over a
communication network. Moreover, messa... | immediate predecessor tracking;relevant event;causality track;transitive reduction;ipt protocol;timestamp;message-pass;hasse diagram;piggybacking;immediate predecessor;tracking causality;common global memory;message transfer delay;checkpointing problem;control information;vector timestamp;distributed computation;vector... |
train_C-78 | An Architectural Framework and a Middleware for Cooperating Smart Components | In a future networked physical world, a myriad of smart sensors and actuators assess and control aspects of their environments and autonomously act in response to it. Examples range in telematics, traffic management, team robotics or home automation to name a few. To a large extent, such systems operate proactively and... | 1. INTRODUCTION
In recent years we have seen the continuous improvement
of technologies that are relevant for the construction of
distributed embedded systems, including trustworthy visual,
auditory, and location sensing [11], communication and
processing. We believe that in a future networked physical
world a new clas... | smart sensor;sensor and actuator;corba;dissemination quality;sentient object;event channel;real-time entity;generic event architecture;gear architecture;soft real-time channel;temporal constraint;event-based system;cosmic middleware;middleware architecture;cortex;temporal validity;event-base communication;componentbase... |
train_C-79 | A Cross-Layer Approach to Resource Discovery and Distribution in Mobile ad-hoc Networks | This paper describes a cross-layer approach to designing robust P2P system over mobile ad-hoc networks. The design is based on simple functional primitives that allow routing at both P2P and network layers to be integrated to reduce overhead. With these primitives, the paper addresses various load balancing techniques.... | 1. INTRODUCTION
Mobile ad-hoc networks (MANETs) consist of mobile nodes that
autonomously establish connectivity via multi-hop wireless
communications. Without relying on any existing, pre-configured
network infrastructure or centralized control, MANETs are useful
in situations where impromptu communication facilities ... | manet routing protocol;resource discovery;query packet;mobile ad-hoc network;manet p2p system;manet;neighbor discovery protocol;concurrent update;replica invalidation;invalidation packet;route discovery message;validation mesh;hybrid discovery scheme;negative feedback |
train_C-80 | Consistency-preserving Caching of Dynamic Database Content | With the growing use of dynamic web content generated from relational databases, traditional caching solutions for throughput and latency improvements are ineffective. We describe a middleware layer called Ganesh that reduces the volume of data transmitted without semantic interpretation of queries or results. It achie... | 1. INTRODUCTION
An increasing fraction of web content is dynamically generated
from back-end relational databases. Even when database content
remains unchanged, temporal locality of access cannot be exploited
because dynamic content is not cacheable by web browsers or by
intermediate caching servers such as Akamai mirr... | natural chunk boundary;read-write operation;bboard benchmark;content addressable storage;redundancy;relational database system;database cache;relational database;reciperesultset;temporal locality;caching dynamic database content;jdbc driver;bandwidth optimization;wide area network;database content;proxy;resultset objec... |
train_C-81 | Adaptive Duty Cycling for Energy Harvesting Systems | Harvesting energy from the environment is feasible in many applications to ameliorate the energy limitations in sensor networks. In this paper, we present an adaptive duty cycling algorithm that allows energy harvesting sensor nodes to autonomously adjust their duty cycle according to the energy availability in the env... | 1. INTRODUCTION
Energy supply has always been a crucial issue in designing
battery-powered wireless sensor networks because the lifetime and
utility of the systems are limited by how long the batteries are able to
sustain the operation. The fidelity of the data produced by a sensor
network begins to degrade once sensor... | sampling frequency;energy harvest;energy harvesting system;duty cycling rate;low power design;harvesting-aware power management;solar panel;duty cycle;performance scaling;power scaling;energy neutral operation;sensor network;energy tracking;storage buffer;environmental energy;power management;network latency |
train_C-83 | Concept and Architecture of a Pervasive Document Editing and Managing System | Collaborative document processing has been addressed by many approaches so far, most of which focus on document versioning and collaborative editing. We address this issue from a different angle and describe the concept and architecture of a pervasive document editing and managing system. It exploits database technique... | 1. INTRODUCTION
Text documents are a valuable resource for virtually any enterprise
and organization. Documents like papers, reports and general
business documentations contain a large part of today"s (business)
knowledge. Documents are mostly stored in a hierarchical folder
structure on file servers and it is difficul... | collaborative layouting;restriction;hierarchical file system;computer support collaborative work;cscw;computer supported collaborative work;real-time server component;text editing;collaborative document;pervasive document edit and management system;real-time transaction;character insertion;granularity;pervasive documen... |
train_C-84 | Selfish Caching in Distributed Systems: A Game-Theoretic Analysis | We analyze replication of resources by server nodes that act selfishly, using a game-theoretic approach. We refer to this as the selfish caching problem. In our model, nodes incur either cost for replicating resources or cost for access to a remote replica. We show the existence of pure strategy Nash equilibria and inv... | 1. INTRODUCTION
Wide-area peer-to-peer file systems [2,5,22,32,33], peer-to-peer
caches [15, 16], and web caches [6, 10] have become popular over
the last few years. Caching1
of files in selected servers is widely
used to enhance the performance, availability, and reliability of
these systems. However, most such system... | caching problem;nash equilibrium;remote replica;social utility;submodularity;peer-to-peer file system;demand distribution;game-theoretic model;cache;anarchy price;aggregation effect;network topology;game-theoretic approach;distribute system;group strategyproofness;instrumentation server;price of anarchy;primal-dual tec... |
train_H-35 | AdaRank: A Boosting Algorithm for Information Retrieval | In this paper we address the issue of learning to rank for document retrieval. In the task, a model is automatically created with some training data and then is utilized for ranking of documents. The goodness of a model is usually evaluated with performance measures such as MAP (Mean Average Precision) and NDCG (Normal... | 1. INTRODUCTION
Recently ‘learning to rank" has gained increasing attention in
both the fields of information retrieval and machine learning. When
applied to document retrieval, learning to rank becomes a task as
follows. In training, a ranking model is constructed with data
consisting of queries, their corresponding r... | support vector machine;trained ranking model;rankboost;weak ranker;ranking model tuning;ranking model;boost;novel learning algorithm;learn to rank;training process;machine learning;new learning algorithm;document retrieval;information retrieval;re-weighted training datum |
train_H-37 | Relaxed Online SVMs for Spam Filtering | Spam is a key problem in electronic communication, including large-scale email systems and the growing number of blogs. Content-based filtering is one reliable method of combating this threat in its various forms, but some academic researchers and industrial practitioners disagree on how best to filter spam. The former... | 1. INTRODUCTION
Electronic communication is increasingly plagued by
unwanted or harmful content known as spam. The most well
known form of spam is email spam, which remains a major
problem for large email systems. Other forms of spam are
also becoming problematic, including blog spam, in which
spammers post unwanted co... | logistic regression;support vector machine;feature mapping;bayesian method;hyperplane;link spam;spam filter;incremental update;link analysis;machine learning technique;blog;spam filtering;content-based spam detection;splog;content-based filtering |
train_H-38 | DiffusionRank: A Possible Penicillin for Web Spamming | While the PageRank algorithm has proven to be very effective for ranking Web pages, the rank scores of Web pages can be manipulated. To handle the manipulation problem and to cast a new insight on the Web structure, we propose a ranking algorithm called DiffusionRank. DiffusionRank is motivated by the heat diffusion ph... | 1. INTRODUCTION
While the PageRank algorithm [13] has proven to be very
effective for ranking Web pages, inaccurate PageRank
results are induced because of web page manipulations by
people for commercial interests. The manipulation problem is
also called the Web spam, which refers to hyperlinked pages
on the World Wide... | link stuffing;web graph;group-to-group relation;keyword stuffing;gaussian kernel smoothing;ranking;diffusionrank;pagerank;equal voting ability;random graph;web spam;link community;machine learning;link analysis;seed selection algorithm |
train_H-40 | Cross-Lingual Query Suggestion Using Query Logs of Different Languages | Query suggestion aims to suggest relevant queries for a given query, which help users better specify their information needs. Previously, the suggested terms are mostly in the same language of the input query. In this paper, we extend it to cross-lingual query suggestion (CLQS): for a query in one language, we suggest ... | 1. INTRODUCTION
Query suggestion is a functionality to help users of a search
engine to better specify their information need, by narrowing
down or expanding the scope of the search with synonymous
queries and relevant queries, or by suggesting related queries that
have been frequently used by other users. Search engin... | bidding term;benchmark;target language query log;map;query expansion;query suggestion;query log;cross-language information retrieval;query translation;search engine advertisement;search engine;keyword bidding;monolingual query suggestion |
train_H-41 | HITS on the Web: How does it Compare? | This paper describes a large-scale evaluation of the effectiveness of HITS in comparison with other link-based ranking algorithms, when used in combination with a state-ofthe-art text retrieval algorithm exploiting anchor text. We quantified their effectiveness using three common performance measures: the mean reciproc... | 1. INTRODUCTION
Link graph features such as in-degree and PageRank have
been shown to significantly improve the performance of text
retrieval algorithms on the web. The HITS algorithm is also
believed to be of interest for web search; to some degree,
one may expect HITS to be more informative that other
link-based feat... | mean reciprocal rank;scale and relevance;quantitative measure;hit;breadth-first search crawl;mean average precision;link-based feature;rank;ranking;map;link graph;pagerank;ndcg;mrr;normalized discounted cumulative gain measurement;feature selection;query specificity;bm25f;crawled web page;hyperlink analysis |
train_H-42 | HITS Hits TRECExploring IR Evaluation Results with Network Analysis | We propose a novel method of analysing data gathered from TREC or similar information retrieval evaluation experiments. We define two normalized versions of average precision, that we use to construct a weighted bipartite graph of TREC systems and topics. We analyze the meaning of well known - and somewhat generalized ... | 1. INTRODUCTION
Evaluation is a primary concern in the Information
Retrieval (IR) field. TREC (Text REtrieval Conference) [12,
15] is an annual benchmarking exercise that has become a
de facto standard in IR evaluation: before the actual
conference, TREC provides to participants a collection of
documents and a set of t... | trec;systems-topic graph;hit;social network analysis;mean average precision;link analysis technique;web search engine implementation;pagerank;network analysis;information retrieval evaluation experiment;inlink;ir evaluation;hit algorithm;kleinberg' hit algorithm;human assessor;weighted bipartite graph;stemming |
train_H-43 | Combining Content and Link for Classification using Matrix Factorization | The world wide web contains rich textual contents that are interconnected via complex hyperlinks. This huge database violates the assumption held by most of conventional statistical methods that each web page is considered as an independent and identical sample. It is thus difficult to apply traditional mining or learn... | 1. INTRODUCTION
With the advance of the World Wide Web, more and more
hypertext documents become available on the Web. Some examples of
such data include organizational and personal web pages (e.g, the
WebKB benchmark data set, which contains university web pages),
research papers (e.g., data in CiteSeer), online news ... | low-dimensional factor space;web mining problem;classification;combining content and link;linkage adjacency matrix;content information;authority information;joint factorization;relationship;link structure;factor analysis;asymmetric relationship;document-term matrix;cocitation similarity;webkb and cora benchmark;text co... |
train_H-44 | A Time Machine for Text Search | Text search over temporally versioned document collections such as web archives has received little attention as a research problem. As a consequence, there is no scalable and principled solution to search such a collection as of a specified time t. In this work, we address this shortcoming and propose an efficient sol... | 1. INTRODUCTION
In this work we address time-travel text search over
temporally versioned document collections. Given a keyword
query q and a time t our goal is to identify and rank
relevant documents as if the collection was in its state as of
time t.
An increasing number of such versioned document
collections is avai... | text search;inverted file index;sublist materialization;temporal text index;time-travel text search;timestamped information feed;open source search-engine nutch;collaborative authoring environment;validity time-interval;web archive;approximate temporal coalescing;temporal search;versioned document collection;indexing r... |
train_H-45 | Query Performance Prediction in Web Search Environments | Current prediction techniques, which are generally designed for content-based queries and are typically evaluated on relatively homogenous test collections of small sizes, face serious challenges in web search environments where collections are significantly more heterogeneous and different types of retrieval tasks exi... | 1. INTRODUCTION
Query performance prediction has many applications in a variety
of information retrieval (IR) areas such as improving retrieval
consistency, query refinement, and distributed IR. The importance
of this problem has been recognized by IR researchers and a
number of new methods have been proposed for predi... | homogenous test collection;web search environment;kl-divergence;content-based and named-page finding;jensen-shannon divergence;weighted information gain;trec document collection;query performance prediction;content-based query;robustness score probabilitydensity classifier;web search;gov2 collection;wig;ranking robustn... |
train_H-46 | Broad Expertise Retrieval in Sparse Data Environments | Expertise retrieval has been largely unexplored on data other than the W3C collection. At the same time, many intranets of universities and other knowledge-intensive organisations offer examples of relatively small but clean multilingual expertise data, covering broad ranges of expertise areas. We first present two mai... | 1. INTRODUCTION
An organization"s intranet provides a means for exchanging
information between employees and for facilitating employee
collaborations. To efficiently and effectively achieve this, it is necessary
to provide search facilities that enable employees not only to access
documents, but also to identify expert... | language model;broad expertise retrieval;expertise search;expert finding task;expert colleague;bayes' theorem;organizational structure;baseline model;intranet search;trec enterprise track;baseline expertise retrieval method;co-occurrence;expert find;generative language modeling;sparse datum environment;topicality and o... |
train_H-47 | A Semantic Approach to Contextual Advertising | Contextual advertising or Context Match (CM) refers to the placement of commercial textual advertisements within the content of a generic web page, while Sponsored Search (SS) advertising consists in placing ads on result pages from a web search engine, with ads driven by the originating query. In CM there is usually a... | 1. INTRODUCTION
Web advertising supports a large swath of today"s Internet
ecosystem. The total internet advertiser spend in US alone
in 2006 is estimated at over 17 billion dollars with a growth
rate of almost 20% year over year. A large part of this
market consists of textual ads, that is, short text messages
usually... | pay-per-click;semantics;contextual advertising;matching mechanism;semantic-syntactic matching;match;keyword matching;document classifier;ad relevance;contextual advertise;topical distance;top-k ad;hierarchical taxonomy class |
train_H-48 | A New Approach for Evaluating Query Expansion: Query-Document Term Mismatch | The effectiveness of information retrieval (IR) systems is influenced by the degree of term overlap between user queries and relevant documents. Query-document term mismatch, whether partial or total, is a fact that must be dealt with by IR systems. Query Expansion (QE) is one method for dealing with term mismatch. IR ... | 1. INTRODUCTION
In our domain,1
and unlike web search, it is very
important for attorneys to find all documents (e.g., cases) that
are relevant to an issue. Missing relevant documents may
have non-trivial consequences on the outcome of a court
proceeding. Attorneys are especially concerned about missing
relevant docume... | evaluation;document processing;query expansion;relevant document;query-document term mismatch;information retrieval;information search;document expansion |
train_H-49 | Performance Prediction Using Spatial Autocorrelation | Evaluation of information retrieval systems is one of the core tasks in information retrieval. Problems include the inability to exhaustively label all documents for a topic, nongeneralizability from a small number of topics, and incorporating the variability of retrieval systems. Previous work addresses the evaluation... | 1. INTRODUCTION
In information retrieval, a user poses a query to a system.
The system retrieves n documents each receiving a
realvalued score indicating the predicted degree of relevance.
If we randomly select pairs of documents from this set, we
expect some pairs to share the same topic and other pairs to
not share t... | query ranking;spatial autocorrelation;predictor predictive power;predictor relationship;language model score;ranking of query;regularization;autocorrelation;performance prediction;information retrieval;zero relevance judgment;cluster hypothesis;predictive power of predictor;relationship of predictor |
train_H-50 | An Outranking Approach for Rank Aggregation in Information Retrieval | Research in Information Retrieval usually shows performance improvement when many sources of evidence are combined to produce a ranking of documents (e.g., texts, pictures, sounds, etc.). In this paper, we focus on the rank aggregation problem, also called data fusion problem, where rankings of documents, searched into... | 1. INTRODUCTION
A wide range of current Information Retrieval (IR)
approaches are based on various search models (Boolean,
Vector Space, Probabilistic, Language, etc. [2]) in order to
retrieve relevant documents in response to a user request. The
result lists produced by these approaches depend on the
exact definition ... | rank aggregation;multiple criterion framework;metasearch engine;combsum and combmnz strategy;ir model;datum fusion;decision rule;multiple criterium approach;outrank method;information retrieval;datum fusion problem;outranking approach;majoritarian method |
train_H-52 | Vocabulary Independent Spoken Term Detection | We are interested in retrieving information from speech data like broadcast news, telephone conversations and roundtable meetings. Today, most systems use large vocabulary continuous speech recognition tools to produce word transcripts; the transcripts are indexed and query terms are retrieved from the index. However, ... | 1. INTRODUCTION
The rapidly increasing amount of spoken data calls for
solutions to index and search this data.
The classical approach consists of converting the speech to
word transcripts using a large vocabulary continuous speech
recognition (LVCSR) tool. In the past decade, most of the
research efforts on spoken dat... | vocabulary independent system;out-of-vocabulary;vocabulary;indexing timestamp;phonetic index;oov search;speech retrieval;speak term detection;speech datum retrieval;index merging;automatic speech recognition;speech recognizer;word index;phonetic transcript;spoken term detection |
train_H-53 | Context Sensitive Stemming for Web Search | Traditionally, stemming has been applied to Information Retrieval tasks by transforming words in documents to the their root form before indexing, and applying a similar transformation to query terms. Although it increases recall, this naive strategy does not work well for Web Search since it lowers precision and requi... | 1. INTRODUCTION
Web search has now become a major tool in our daily lives
for information seeking. One of the important issues in Web
search is that user queries are often not best formulated to
get optimal results. For example, running shoe is a query
that occurs frequently in query logs. However, the query
running sh... | stem;language model;bigram language model;head word detection;context sensitive document matching;lovin stemmer;porter stemmer;web search;candidate generation;query segmentation;unigram language model;context sensitive query stemming;stemming |
train_H-54 | Knowledge-intensive Conceptual Retrieval and Passage Extraction of Biomedical Literature | This paper presents a study of incorporating domain-specific knowledge (i.e., information about concepts and relationships between concepts in a certain domain) in an information retrieval (IR) system to improve its effectiveness in retrieving biomedical literature. The effects of different types of domain-specific kno... | 1. INTRODUCTION
Biologists search for literature on a daily basis. For most
biologists, PubMed, an online service of U.S. National Library of
Medicine (NLM), is the most commonly used tool for searching
the biomedical literature. PubMed allows for keyword search by
using Boolean operators. For example, if one desires d... | keyword search;document collection;document map;domain-specific knowledge;retrieval model;biomedical document;document retrieval;query concept;conceptual ir model;passage-level information retrieval;passage map;passage extraction;aspect map |
train_H-60 | A Frequency-based and a Poisson-based Definition of the Probability of Being Informative | This paper reports on theoretical investigations about the assumptions underlying the inverse document frequency (idf ). We show that an intuitive idf -based probability function for the probability of a term being informative assumes disjoint document events. By assuming documents to be independent rather than disjoin... | 1. INTRODUCTION AND BACKGROUND
The inverse document frequency (idf ) is one of the most
successful parameters for a relevance-based ranking of
retrieved objects. With N being the total number of
documents, and n(t) being the number of documents in which
term t occurs, the idf is defined as follows:
idf(t) := − log
n(t)... | idf;informativeness;document disjointness;poisson distribution;probability theory;probabilistic information retrieval;information theory;independence assumption;inverse document frequency;information retrieval;poisson-based probability;collection space;frequency-based probability;noise probability;probability function;... |
train_H-61 | Impedance Coupling in Content-targeted Advertising | The current boom of the Web is associated with the revenues originated from on-line advertising. While search-based advertising is dominant, the association of ads with a Web page (during user navigation) is becoming increasingly important. In this work, we study the problem of associating ads with a Web page, referred... | 1. INTRODUCTION
The emergence of the Internet has opened up new
marketing opportunities. In fact, a company has now the possibility
of showing its advertisements (ads) to millions of people at a
low cost. During the 90"s, many companies invested heavily
on advertising in the Internet with apparently no concerns
about t... | paid placement strategy;web;bayesian network model;bayesian network;keyword targeted advertising;expansion term;ad and keyword;knn;on-line advertising;matching strategy;ad placement strategy;advertise;content-targeted advertising;impedance coupling strategy |
train_H-62 | Implicit User Modeling for Personalized Search | Information retrieval systems (e.g., web search engines) are critical for overcoming information overload. A major deficiency of existing retrieval systems is that they generally lack user modeling and are not adaptive to individual users, resulting in inherently non-optimal retrieval performance. For example, a touris... | 1. INTRODUCTION
Although many information retrieval systems (e.g., web search
engines and digital library systems) have been successfully deployed,
the current retrieval systems are far from optimal. A major
deficiency of existing retrieval systems is that they generally lack user
modeling and are not adaptive to indiv... | interactive ir;personalize search;user model;interactive retrieval;query expansion;personalized web search;user-centered adaptive information retrieval;personalize information retrieval;implicit feedback;search accuracy;implicit user modeling;information retrieval system;retrieval performance;query refinement |
train_H-63 | Location based Indexing Scheme for DAYS | Data dissemination through wireless channels for broadcasting information to consumers is becoming quite common. Many dissemination schemes have been proposed but most of them push data to wireless channels for general consumption. Push based broadcast [1] is essentially asymmetric, i.e., the volume of data being highe... | 1. INTRODUCTION
Wireless data dissemination is an economical and efficient
way to make desired data available to a large number of mobile or
static users. The mode of data transfer is essentially asymmetric,
that is, the capacity of the transfer of data (downstream
communication) from the server to the client (mobile u... | wireless broadcast datum mapping;location base service;datum stage;indexing scheme;pull based datum access;wireless datum dissemination;tree structure;day;wireless datum broadcast;datum broadcast system;location dependent datum;ldd;location based service;index;wireless channel;mapping of wireless broadcast datum;mobile... |
train_H-64 | Machine Learning for Information Architecture in a Large Governmental Website | This paper describes ongoing research into the application of machine learning techniques for improving access to governmental information in complex digital libraries. Under the auspices of the GovStat Project, our goal is to identify a small number of semantically valid concepts that adequately spans the intellectual... | 1. INTRODUCTION
The GovStat Project is a joint effort of the University
of North Carolina Interaction Design Lab and the
University of Maryland Human-Computer Interaction Lab1
.
Citing end-user difficulty in finding governmental information
(especially statistical data) online, the project seeks to
create an integrated... | machine learn;information architecture;interface design;multiway classification;access;bureau of labor statistics;bls collection;data-driven approach;digital library;k-means clustering;machine learning technique;eigenvalue;complex digital library;supervised and unsupervised learning technique |
train_H-69 | Ranking Web Objects from Multiple Communities | Vertical search is a promising direction as it leverages domainspecific knowledge and can provide more precise information for users. In this paper, we study the Web object-ranking problem, one of the key issues in building a vertical search engine. More specifically, we focus on this problem in cases when objects lack... | 1. INTRODUCTION
Despite numerous refinements and optimizations, general
purpose search engines still fail to find relevant results for
many queries. As a new trend, vertical search has shown
promise because it can leverage domain-specific knowledge
and is more effective in connecting users with the
information they wan... | duplicate photo detection algorithm;algorithm;image search query;score fusion method;nonlinear fusion method;multiple web forum;rank photo;domain specific knowledge;web object;rank;high-quality photo search;ranking function;image search;web object-ranking problem;web object-ranking;vertical search |
train_H-73 | Unified Utility Maximization Framework for Resource Selection | This paper presents a unified utility framework for resource selection of distributed text information retrieval. This new framework shows an efficient and effective way to infer the probabilities of relevance of all the documents across the text databases. With the estimated relevance information, resource selection c... | 1. INTRODUCTION
Conventional search engines such as Google or AltaVista use
ad-hoc information retrieval solution by assuming all the
searchable documents can be copied into a single centralized
database for the purpose of indexing. Distributed information
retrieval, also known as federated search [1,4,7,11,14,22] is
d... | distributed document retrieval;resource selection;retrieval and result merging;unified utility maximization model;distributed text information retrieval resource selection;semi-supervised learning;resource representation;logistic transformation model;distribute information retrieval;hidden web content;resource selectio... |
train_H-77 | Automatic Extraction of Titles from General Documents using Machine Learning | In this paper, we propose a machine learning approach to title extraction from general documents. By general documents, we mean documents that can belong to any one of a number of specific genres, including presentations, book chapters, technical papers, brochures, reports, and letters. Previously, methods have been pr... | 1. INTRODUCTION
Metadata of documents is useful for many kinds of document
processing such as search, browsing, and filtering. Ideally,
metadata is defined by the authors of documents and is then used
by various systems. However, people seldom define document
metadata by themselves, even when they have convenient
metad... | machine learn;formatting information;metada of document;title extraction;language independence;linguistic feature;usefulness of extracted title;extracted title usefulness;genre;classifier;automatic title extraction;information extraction;model generality;metada extraction;search;document retrieval;comparison between mo... |
train_H-79 | Beyond PageRank: Machine Learning for Static Ranking | Since the publication of Brin and Page"s paper on PageRank, many in the Web community have depended on PageRank for the static (query-independent) ordering of Web pages. We show that we can significantly outperform PageRank using features that are independent of the link structure of the Web. We gain a further boost in... | 1. INTRODUCTION
Over the past decade, the Web has grown exponentially in size.
Unfortunately, this growth has not been isolated to good-quality
pages. The number of incorrect, spamming, and malicious (e.g.,
phishing) sites has also grown rapidly. The sheer number of both
good and bad pages on the Web has led to an incr... | ranknet;relevance;static rank;visitation popularity;search engine;pagerank;regression;adversarial classification;feature-based ranking;information retrieval;machine learning;static ranking |
train_H-81 | Distance Measures for MPEG-7-based Retrieval | In visual information retrieval the careful choice of suitable proximity measures is a crucial success factor. The evaluation presented in this paper aims at showing that the distance measures suggested by the MPEG-7 group for the visual descriptors can be beaten by general-purpose measures. Eight visual MPEG-7 descrip... | 1. INTRODUCTION
The MPEG-7 standard defines - among others - a set of
descriptors for visual media. Each descriptor consists of a feature
extraction mechanism, a description (in binary and XML format)
and guidelines that define how to apply the descriptor on different
kinds of media (e.g. on temporal media). The MPEG-7... | similarity measurement;performance indicator;visual media;content-base video retrieval;media collection;distance measurement;distance measure;mpeg-7;visual descriptor;mpeg-7-based retrieval;meehl index;visual information retrieval;similarity perception;human similarity perception;content-base image retrieval;predicate-... |
train_H-82 | Downloading Textual Hidden Web Content Through Keyword Queries | An ever-increasing amount of information on the Web today is available only through search interfaces: the users have to type in a set of keywords in a search form in order to access the pages from certain Web sites. These pages are often referred to as the Hidden Web or the Deep Web. Since there are no static links to... | 1. INTRODUCTION
Recent studies show that a significant fraction of Web content
cannot be reached by following links [7, 12]. In particular, a large
part of the Web is hidden behind search forms and is reachable
only when users type in a set of keywords, or queries, to the forms.
These pages are often referred to as the... | textual database;independence estimator;hidden web;hide web crawl;generic-frequency policy;deep web crawler;query selection;query-selection policy;adaptive algorithm;crawling policy;adaptive policy;keyword query;deep web;hidden web crawler |
train_H-83 | Estimating the Global PageRank of Web Communities | Localized search engines are small-scale systems that index a particular community on the web. They offer several benefits over their large-scale counterparts in that they are relatively inexpensive to build, and can provide more precise and complete search capability over their relevant domains. One disadvantage such ... | 1. INTRODUCTION
Localized search engines are small-scale search engines
that index only a single community of the web. Such
communities can be site-specific domains, such as pages within
the cs.utexas.edu domain, or topic-related
communitiesfor example, political websites. Compared to the web graph
crawled and indexed ... | algorithm;localized search engine;web community;experimentation;subgraph;link-based ranking;topic-specific domain;large-scale search engine;local domain;global pagerank;crawling problem;global graph |
train_H-84 | Event Threading within News Topics | With the overwhelming volume of online news available today, there is an increasing need for automatic techniques to analyze and present news to the user in a meaningful and efficient manner. Previous research focused only on organizing news stories by their topics into a flat hierarchy. We believe viewing a news topic... | 1. INTRODUCTION
News forms a major portion of information disseminated in the
world everyday. Common people and news analysts alike are very
interested in keeping abreast of new things that happen in the news,
but it is becoming very difficult to cope with the huge volumes
of information that arrives each day. Hence th... | dependency recall;topic detection;correct granularity;flatcluster;thread;simple thresholding;mapping function;temporal locality;event threading;seminal event;time ordering;cluster;topic cluster;inter-related event;quick overview;directed edge;dependency precision;hidden markov model;cluster of topic;dependency;cosine s... |
train_H-85 | Learning User Interaction Models for Predicting Web Search Result Preferences | Evaluating user preferences of web search results is crucial for search engine development, deployment, and maintenance. We present a real-world study of modeling the behavior of web search users to predict web search result preferences. Accurate modeling and interpretation of user behavior has important applications t... | 1. INTRODUCTION
Relevance measurement is crucial to web search and to
information retrieval in general. Traditionally, search relevance is
measured by using human assessors to judge the relevance of
query-document pairs. However, explicit human ratings are
expensive and difficult to obtain. At the same time, millions o... | precision measure;relevance measurement;recall measure;predictive model;induce weight;clickthrough;top relevant document position;search abuse detection;predictive behavior model;low recall;information retrieval;predict relevance preference;position of top relevant document;explicit relevance judgment;user preference;i... |
train_H-87 | Robustness of Adaptive Filtering Methods In a Cross-benchmark Evaluation | This paper reports a cross-benchmark evaluation of regularized logistic regression (LR) and incremental Rocchio for adaptive filtering. Using four corpora from the Topic Detection and Tracking (TDT) forum and the Text Retrieval Conferences (TREC) we evaluated these methods with non-stationary topics at various granular... | 1. INTRODUCTION
Adaptive filtering (AF) has been a challenging research topic in
information retrieval. The task is for the system to make an
online topic membership decision (yes or no) for every
document, as soon as it arrives, with respect to each pre-defined
topic of interest. Starting from 1997 in the Topic Detect... | logistic regression;adaptive filter;gaussian;topic track;validation set;cost function;topic detection;statistical learning;posterior probability;sigmoid function;information retrieval;relevance feedback;optimization criterion;cross-benchmark evaluation;topic tracking;bias;systematic method for parameter tuning across m... |
train_H-88 | Controlling Overlap in Content-Oriented XML Retrieval | The direct application of standard ranking techniques to retrieve individual elements from a collection of XML documents often produces a result set in which the top ranks are dominated by a large number of elements taken from a small number of highly relevant documents. This paper presents and evaluates an algorithm t... | 1. INTRODUCTION
The representation of documents in XML provides an
opportunity for information retrieval systems to take
advantage of document structure, returning individual document
components when appropriate, rather than complete
documents in all circumstances. In response to a user query, an
XML information retrie... | baseline retrieval;inex;extended tree traversal routine;ideal gain vector;xml ir;xml cumulated gain metric;priority queue;cumulated gain;multitext system;term frequency vector;rank;sog quantization;xml;information retrieval;time complexity;xcg metric reward retrieval;re-ranking algorithm |
train_H-90 | Context-Sensitive Information Retrieval Using Implicit Feedback | A major limitation of most existing retrieval models and systems is that the retrieval decision is made based solely on the query and document collection; information about the actual user and search context is largely ignored. In this paper, we study how to exploit implicit feedback information, including previous que... | 1. INTRODUCTION
In most existing information retrieval models, the retrieval
problem is treated as involving one single query and a set of documents.
From a single query, however, the retrieval system can only have
very limited clue about the user"s information need. An optimal
retrieval system thus should try to explo... | kl-divergence retrieval model;context-sensitive language;long-term context;interactive retrieval;trec datum set;query expansion;mean average precision;fixed coefficient interpolation;query history information;implicit feedback information;current query;query history;context;retrieval accuracy;relevance feedback;clickth... |
train_H-92 | Improving Web Search Ranking by Incorporating User Behavior Information | We show that incorporating user behavior data can significantly improve ordering of top results in real web search setting. We examine alternatives for incorporating feedback into the ranking process and explore the contributions of user feedback compared to other common web search features. We report results of a larg... | 1. INTRODUCTION
Millions of users interact with search engines daily. They issue
queries, follow some of the links in the results, click on ads, spend
time on pages, reformulate their queries, and perform other
actions. These interactions can serve as a valuable source of
information for tuning and improving web search... | feedback;implicit relevance feedback;document;web search rank;web search;ranking;score;user interaction;information;information retrieval;user behavior;relevance feedback;result |
train_H-95 | Handling Locations in Search Engine Queries | This paper proposes simple techniques for handling place references in search engine queries, an important aspect of geographical information retrieval. We address not only the detection, but also the disambiguation of place references, by matching them explicitly with concepts at an ontology. Moreover, when a query do... | 1. INTRODUCTION
Search engine queries are often associated with geographical
locations, either explicitly (i.e. a location reference is given as part of
the query) or implicitly (i.e. the location reference is not present in
the query string, but the query clearly has a local intent [17]). One
of the concerns of geogra... | tokenization scheme;geographical type expression;geographical information retrieval;search engine query;text mine;disambiguation result;search query;geographic ontology;place reference;spelling correction mechanism;named entity recognition algorithm;web search engine;geographic context;query string;textual string;geogr... |
train_H-96 | A Study of Factors Affecting the Utility of Implicit Relevance Feedback | Implicit relevance feedback (IRF) is the process by which a search system unobtrusively gathers evidence on searcher interests from their interaction with the system. IRF is a new method of gathering information on user interest and, if IRF is to be used in operational IR systems, it is important to establish when it p... | 1. INTRODUCTION
Information Retrieval (IR) systems are designed to help searchers
solve problems. In the traditional interaction metaphor employed by
Web search systems such as Yahoo! and MSN Search, the system
generally only supports the retrieval of potentially relevant documents
from the collection. However, it is a... | implicit relevance feedback;top-ranking sentence;query modification term;interactive query expansion feature;varying complexity;explicit rf system;medium complexity;high complexity whilst;proportion feedback;moderate complexity whilst;search task complexity;browse-based result interface;search precision;relevance feedb... |
train_H-97 | Feature Representation for Effective Action-Item Detection | E-mail users face an ever-growing challenge in managing their inboxes due to the growing centrality of email in the workplace for task assignment, action requests, and other roles beyond information dissemination. Whereas Information Retrieval and Machine Learning techniques are gaining initial acceptance in spam filte... | 1. INTRODUCTION
E-mail users are facing an increasingly difficult task of
managing their inboxes in the face of mounting challenges that result from
rising e-mail usage. This includes prioritizing e-mails over a range
of sources from business partners to family members, filtering and
reducing junk e-mail, and quickly m... | document detection;svm;feature selection;sentence-level classifier;n-gram;information retrieval;action-item detection;text classification;e-mail;automated model selection;chi-squared feature selection;document ranking;embedded cross-validation;sentence detection;genre-classification;topic-driven text classification;spe... |
train_H-98 | Using Asymmetric Distributions to Improve Text Classifier Probability Estimates | Text classifiers that give probability estimates are more readily applicable in a variety of scenarios. For example, rather than choosing one set decision threshold, they can be used in a Bayesian risk model to issue a run-time decision which minimizes a userspecified cost function dynamically chosen at prediction time... | 1. INTRODUCTION
Text classifiers that give probability estimates are more flexible
in practice than those that give only a simple classification or even a
ranking. For example, rather than choosing one set decision
threshold, they can be used in a Bayesian risk model [8] to issue a
runtime decision which minimizes the ... | classifier combination;parametric model;maximum likelihood estimate;text classification;asymmetric laplace distribution;asymmetric gaussian;cost-sensitive learn;decision threshold;logistic regression framework;posterior function;active learn;class-conditional density;symmetric distribution;text classifier;information r... |
train_I-37 | A Framework for Agent-Based Distributed Machine Learning and Data Mining | This paper proposes a framework for agent-based distributed machine learning and data mining based on (i) the exchange of meta-level descriptions of individual learning processes among agents and (ii) online reasoning about learning success and learning progress by learning agents. We present an abstract architecture t... | 1. INTRODUCTION
In the areas of machine learning and data mining (cf. [14,
17] for overviews), it has long been recognised that
parallelisation and distribution can be used to improve learning
performance. Various techniques have been suggested in
this respect, ranging from the low-level integration of
independently de... | unsupervise cluster;distributed clustering application;multiagent learn;framework and architecture;meta-reasoning;unsupervised clustering;agent;bayesian classifier;frameworks and architecture;historical information;distribute machine learn;individual learning process;machine learning;consensusbased method;autonomous le... |
train_I-38 | Bidding Algorithms for a Distributed Combinatorial Auction | Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions. However, most of the existing winner determination algorithms for combinatorial auctions are centralized. The PAUSE auction is one of a few efforts to release the auctioneer from having to do all the work (it might... | 1. INTRODUCTION
Both the research and practice of combinatorial auctions
have grown rapidly in the past ten years. In a
combinatorial auction bidders can place bids on combinations of
items, called packages or bidsets, rather than just
individual items. Once the bidders place their bids, it is necessary
to find the all... | task and resource allocation;bidding algorithm;pause auction;progressive adaptive user selection environment;branch-on-bid tree;combinatorial auction;agent;coordination;search tree;branch and bound search;distributed allocation;combinatorial optimization problem;revenue-maximizing solution |
train_I-42 | A Complete Distributed Constraint Optimization Method For Non-Traditional Pseudotree Arrangements | Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instances, including ADOPT and DPOP, arrange agents into a traditional pseudotree structure. We introduce an extension to the DPOP algorithm that h... | 1. INTRODUCTION
Many historical problems in the AI community can be
transformed into Constraint Satisfaction Problems (CSP). With the
advent of distributed AI, multi-agent systems became a popular way
to model the complex interactions and coordination required to
solve distributed problems. CSPs were originally extende... | cross-edged pseudotree;teamwork coordination;distributed constraint optimization;job shop scheduling;agent;pseudotree arrangement;multi-agent coordination;edge-traversal heuristic;maximum sequential path cost;multi-valued utility function;distribute constraint satisfaction and optimization;multi-agent system;resource a... |
train_I-43 | Dynamics Based Control with an Application to Area-Sweeping Problems | In this paper we introduce Dynamics Based Control (DBC), an approach to planning and control of an agent in stochastic environments. Unlike existing approaches, which seek to optimize expected rewards (e.g., in Partially Observable Markov Decision Problems (POMDPs)), DBC optimizes system behavior towards specified syst... | 1. INTRODUCTION
Planning and control constitutes a central research area in
multiagent systems and artificial intelligence. In recent years, Partially
Observable Markov Decision Processes (POMDPs) [12] have
become a popular formal basis for planning in stochastic
environments. In this framework, the planning and contro... | dynamics base control;target dynamics;partially observable markov decision problem;reward function;tag game;stochastic environment;area-sweeping problem;environment design level;user level;extended markov tracking;dynamics based control;control;game of tag;multi-agent system;action-selection randomization;agent level;s... |
train_I-45 | Implementing Commitment-Based Interactions∗ | Although agent interaction plays a vital role in MAS, and messagecentric approaches to agent interaction have their drawbacks, present agent-oriented programming languages do not provide support for implementing agent interaction that is flexible and robust. Instead, messages are provided as a primitive building block.... | 1. INTRODUCTION
Agents are social, and agent interaction plays a vital role in
multiagent systems. Consequently, design and implementation of agent
interaction is an important research topic.
The standard approach for designing agent interactions is
messagecentric: interactions are defined by interaction protocols that... | social commitment;commitment machine;interaction goal;race condition;agent interaction;agent-oriented programming language;bdi-style plan;bdi;commitment-based interaction;messagecentric approach;agent orient program language;herme design;belief desire intention;netbill interaction;turn tracking;commitment machine frame... |
train_I-46 | Modular Interpreted Systems | We propose a new class of representations that can be used for modeling (and model checking) temporal, strategic and epistemic properties of agents and their teams. Our representations borrow the main ideas from interpreted systems of Halpern, Fagin et al.; however, they are also modular and compact in the way concurre... | 1. INTRODUCTION
The logical foundations of multi-agent systems have received
much attention in recent years. Logic has been used to represent
and reason about, e.g., knowledge [7], time [6], cooperation and
strategic ability [3]. Lately, an increasing amount of research has
focused on higher level representation langua... | temporal and strategic logic;synchronous concurrent program;reactive module;model methodology;multi-agent system;higher level representation language;kripke structure;modeling methodology;open computational system;branching time;alternating-time temporal logic;model checking;computation tree logic ctl;model check;modul... |
train_I-47 | Operational Semantics of Multiagent Interactions | The social stance advocated by institutional frameworks and most multi-agent system methodologies has resulted in a wide spectrum of organizational and communicative abstractions which have found currency in several programming frameworks and software platforms. Still, these tools and frameworks are designed to support... | 1. INTRODUCTION
The suitability of agent-based computing to manage the
complex patterns of interactions naturally occurring in the
development of large scale, open systems, has become one
of its major assets over the last few years [26, 24, 15].
Particularly, the organizational or social stance advocated by
institution... | social interaction;operational semantics;organizational and communicative abstraction;organizational programming language;structural operational semantics;multi-agent interaction connector-based model;connector-based model of multi-agent interaction;institutional framework;pre-defined abstraction;formal execution seman... |
train_I-48 | Normative System Games | We develop a model of normative systems in which agents are assumed to have multiple goals of increasing priority, and investigate the computational complexity and game theoretic properties of this model. In the underlying model of normative systems, we use Kripke structures to represent the possible transitions of a m... | 1. INTRODUCTION
Normative systems, or social laws, have proved to be an attractive
approach to coordination in multi-agent systems [13, 14, 10, 15, 1].
Although the various approaches to normative systems proposed in
the literature differ on technical details, they all share the same
basic intuition that a normative sy... | social law;constraint;goal;decision making;normative system game;normative system;desirable objective;complexity;kripke structure;logic;computational complexity;game;game theoretic property;ordinal utility;multi-agent system;computation tree logic;nash implementation;multiple goal of increasing priority |
train_I-49 | A Multilateral Multi-issue Negotiation Protocol | In this paper, we present a new protocol to address multilateral multi-issue negotiation in a cooperative context. We consider complex dependencies between multiple issues by modelling the preferences of the agents with a multi-criteria decision aid tool, also enabling us to extract relevant information on a proposal a... | 1. INTRODUCTION
Multi-issue negotiation protocols represent an important
field of study since negotiation problems in the real world
are often complex ones involving multiple issues. To date,
most of previous work in this area ([2, 3, 19, 13]) dealt
almost exclusively with simple negotiations involving
independent issu... | multi-criterion decision make;decision making;automate negotiation;multi-agent system;cooperative agent;modelling;myriad;multilateral negotiation;negotiation protocol;automated negotiation;multi-issue negotiation;crisis management;negotiation strategy |
train_I-50 | Agents, Beliefs, and Plausible Behavior in a Temporal Setting | Logics of knowledge and belief are often too static and inflexible to be used on real-world problems. In particular, they usually offer no concept for expressing that some course of events is more likely to happen than another. We address this problem and extend CTLK (computation tree logic with knowledge) with a notio... | 1. INTRODUCTION
Notions like time, knowledge, and beliefs are very
important for analyzing the behavior of agents and multi-agent
systems. In this paper, we extend modal logics of time and
knowledge with a concept of plausible behavior: this notion
is added to the language of CTLK [19], which is a
straightforward combi... | belief notion;notion of plausibility;semantics;notion of belief;belief;plausibility notion;plausibility;reasoning;indistinguishability;logic;temporal logic;plausibility update operator;framework;multi-agent system;computation tree logic |
train_I-51 | Learning and Joint Deliberation through Argumentation in Multi-Agent Systems | In this paper we will present an argumentation framework for learning agents (AMAL) designed for two purposes: (1) for joint deliberation, and (2) for learning from communication. The AMAL framework is completely based on learning from examples: the argument preference relation, the argument generation policy, and the ... | 1. INTRODUCTION
Argumentation frameworks for multi-agent systems can be used
for different purposes like joint deliberation, persuasion,
negotiation, and conflict resolution. In this paper we will present an
argumentation framework for learning agents, and show that it can be
used for two purposes: (1) joint deliberati... | group;case-base reason;learning agent;multi-agent learn;case-based policy;argumentation framework;predictive accuracy;argumentation;learning from communication;argumentation protocol;multi-agent system;collaboration;joint deliberation |
train_I-52 | A Unified and General Framework for Argumentation-based Negotiation | This paper proposes a unified and general framework for argumentation-based negotiation, in which the role of argumentation is formally analyzed. The framework makes it possible to study the outcomes of an argumentation-based negotiation. It shows what an agreement is, how it is related to the theories of the agents, w... | 1. INTRODUCTION
Roughly speaking, negotiation is a process aiming at
finding some compromise or consensus between two or several
agents about some matters of collective agreement, such
as pricing products, allocating resources, or choosing
candidates. Negotiation models have been proposed for the
design of systems able... | outcome;belief;agent;argumentation-based negotiation;concession notion;argument;information;argumentation;decision making mechanism;negotiation;framework;solution;theory;notion of concession |
train_I-53 | A Randomized Method for the Shapley Value for the Voting Game | The Shapley value is one of the key solution concepts for coalition games. Its main advantage is that it provides a unique and fair solution, but its main problem is that, for many coalition games, the Shapley value cannot be determined in polynomial time. In particular, the problem of finding this value for the voting... | 1. INTRODUCTION
Coalition formation, a key form of interaction in multi-agent
systems, is the process of joining together two or more agents so as
to achieve goals that individuals on their own cannot, or to achieve
them more efficiently [1, 11, 14, 13]. Often, in such situations,
there is more than one possible coalit... | mean of reaching consensus;approximation;unique and fair solution;polynomial time;reaching consensus mean;generating function;coalition formation;shapley value;game-theory;cooperative game theory;interaction;multi-agent system;randomised method |
train_I-54 | Approximate and Online Multi-Issue Negotiation | This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors. There are m > 1 issues for negotiation where each issue is viewed as a pie of size one. The issues are indivisible (i.e., individual issues... | 1. INTRODUCTION
Negotiation is a key form of interaction in multiagent systems. It
is a process in which disputing agents decide how to divide the
gains from cooperation. Since this decision is made jointly by the
agents themselves [20, 19, 13, 15], each party can only obtain what
the other is prepared to allow them. N... | gain from cooperation;disputing agent;protocol;approximation;relative error;online computation;indivisible issue;game-theory;equilibrium;negotiation;strategy;key form of interaction;multiagent system;time constraint;interaction key form |
train_I-55 | Searching for Joint Gains in Automated Negotiations Based on Multi-criteria Decision Making Theory | It is well established by conflict theorists and others that successful negotiation should incorporate creating value as well as claiming value. Joint improvements that bring benefits to all parties can be realised by (i) identifying attributes that are not of direct conflict between the parties, (ii) tradeoffs on attr... | 1. INTRODUCTION
Given that negotiation is perhaps one of the oldest activities in
the history of human communication, it"s perhaps surprising that
conducted experiments on negotiations have shown that negotiators
more often than not reach inefficient compromises [1, 21]. Raiffa
[17] and Sebenius [20] provide analyses o... | concession;mediator;uncertainty;multi-criterion decision make;automate negotiation;integrative negotiation;inefficient compromise;dilemma;deadlock situation;creating value;claiming value;mcdm;incomplete information;negotiation |
train_I-56 | Unifying Distributed Constraint Algorithms in a BDI Negotiation Framework | This paper presents a novel, unified distributed constraint satisfaction framework based on automated negotiation. The Distributed Constraint Satisfaction Problem (DCSP) is one that entails several agents to search for an agreement, which is a consistent combination of actions that satisfies their mutual constraints in... | 1. INTRODUCTION
At the core of many emerging distributed applications is the
distributed constraint satisfaction problem (DCSP) - one which
involves finding a consistent combination of actions (abstracted as
domain values) to satisfy the constraints among multiple agents
in a shared environment. Important application e... | algorithm;agent negotiation;constraint;resource restriction;privacy requirement;shared environment;bdi;uma;mediation;backtracking;negotiation;dcsp;belief-desireintention model;distribute constraint satisfaction problem |
train_I-57 | Rumours and Reputation: Evaluating Multi-Dimensional Trust within a Decentralised Reputation System | In this paper we develop a novel probabilistic model of computational trust that explicitly deals with correlated multi-dimensional contracts. Our starting point is to consider an agent attempting to estimate the utility of a contract, and we show that this leads to a model of computational trust whereby an agent must ... | 1. INTRODUCTION
The role of computational models of trust within multi-agent
systems in particular, and open distributed systems in general, has
recently generated a great deal of research interest. In such systems,
agents must typically choose between interaction partners, and in
this context trust can be viewed to pr... | dirichlet distribution;rumour propogation;double counting;datum fusion;overconfidence;multi-dimensional trust;trust model;probability theory;reputation system;correlation;rumour propagation;heuristic;anonymity |
train_I-58 | An Efficient Heuristic Approach for Security Against Multiple Adversaries | In adversarial multiagent domains, security, commonly defined as the ability to deal with intentional threats from other agents, is a critical issue. This paper focuses on domains where these threats come from unknown adversaries. These domains can be modeled as Bayesian games; much work has been done on finding equili... | 1. INTRODUCTION
In many multiagent domains, agents must act in order to
provide security against attacks by adversaries. A common issue that
agents face in such security domains is uncertainty about the
adversaries they may be facing. For example, a security robot may
need to make a choice about which areas to patrol, ... | heuristic approach;game theory;security of agent system;decomposition for multiple adversary;bayesian game;agent system security;patrolling domain;bayesian and stackelberg game;bayes-nash equilibrium;adversarial multiagent domain;mixed-integer linear program;np-hard;agent security via approximate policy |
train_I-59 | An Agent-Based Approach for Privacy-Preserving Recommender Systems | Recommender Systems are used in various domains to generate personalized information based on personal user data. The ability to preserve the privacy of all participants is an essential requirement of the underlying Information Filtering architectures, because the deployed Recommender Systems have to be accepted by pri... | 1. INTRODUCTION
Information Filtering (IF) systems aim at countering
information overload by extracting information that is
relevant for a given user out of a large body of information
available via an information provider. In contrast to
Information Retrieval (IR) systems, where relevant information
is extracted based... | privacy;secure multi-party computation;privacy-preserving recommender system;information filter;recommender system;multi-agent system;distributed artificial intelligence-multiagent system;trusted software;java security model;feature-based approach;learning-based approach;trust;information search;multi-agent system tech... |
train_I-60 | On the Benefits of Cheating by Self-Interested Agents in Vehicular Networks | As more and more cars are equipped with GPS and Wi-Fi transmitters, it becomes easier to design systems that will allow cars to interact autonomously with each other, e.g., regarding traffic on the roads. Indeed, car manufacturers are already equipping their cars with such devices. Though, currently these systems are a... | 1. INTRODUCTION
As technology advances, more and more cars are being
equipped with devices, which enable them to act as
autonomous agents. An important advancement in this
respect is the introduction of ad-hoc communication networks
(such as Wi-Fi), which enable the exchange of information
between cars, e.g., for locat... | artificial social system;chaos;vehicular network;intelligent agent;journey length;social network;self-interested agent;selfinterested agent;agent-base deploy application |
train_I-61 | Distributed Agent-Based Air Traffic Flow Management | Air traffic flow management is one of the fundamental challenges facing the Federal Aviation Administration (FAA) today. The FAA estimates that in 2005 alone, there were over 322,000 hours of delays at a cost to the industry in excess of three billion dollars. Finding reliable and adaptive solutions to the flow managem... | 1. INTRODUCTION
The efficient, safe and reliable management of our ever
increasing air traffic is one of the fundamental challenges
facing the aerospace industry today. On a typical day, more
than 40,000 commercial flights operate within the US airspace
[14]. In order to efficiently and safely route this air traffic,
c... | reinforcement learning;air traffic control;optimization;new method of estimating agent reward;reinforcement learn;traffic flow;congestion;deployment strategy;multiagent system;future atm concept evaluation tool |
train_I-62 | A Q-decomposition and Bounded RTDP Approach to Resource Allocation | This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition approach is proposed when the resources which are already shared among the agents, but the actions made by an agent may influence the reward ... | 1. INTRODUCTION
This paper aims to contribute to solve complex stochastic
resource allocation problems. In general, resource
allocation problems are known to be NP-Complete [12]. In such
problems, a scheduling process suggests the action (i.e.
resources to allocate) to undertake to accomplish certain tasks,
according t... | planning agent;real-time dynamic programming;heuristic search;reward separated agent;stochastic environment;marginal revenue;markov decision process;complex stochastic resource allocation problem;marginal revenue bound;resource management;resource allocation;q-decomposition |
train_I-63 | Combinatorial Resource Scheduling for Multiagent MDPs | Optimal resource scheduling in multiagent systems is a computationally challenging task, particularly when the values of resources are not additive. We consider the combinatorial problem of scheduling the usage of multiple resources among agents that operate in stochastic environments, modeled as Markov decision proces... | 1. INTRODUCTION
The tasks of optimal resource allocation and scheduling
are ubiquitous in multiagent systems, but solving such
optimization problems can be computationally difficult, due to
a number of factors. In particular, when the value of a set of
resources to an agent is not additive (as is often the case with
re... | multiagent system;multiagent plan;resource-scheduling;optimal allocation;markov decision process;utility function;resource;resource allocation;scheduling;discrete-time scheduling problem;resource-scheduling algorithm;task and resource allocation in agent system;optimal resource scheduling;optimization problem;combinato... |
train_I-64 | Organizational Self-Design in Semi-dynamic Environments | Organizations are an important basis for coordination in multiagent systems. However, there is no best way to organize and all ways of organizing are not equally effective. Attempting to optimize an organizational structure depends strongly on environmental features including problem characteristics, available resource... | 1. INTRODUCTION
In this paper, we are primarily interested in the organizational
design of a multiagent system - the roles enacted by the agents,
∗Primary author is a student
the coordination between the roles and the number and assignment
of roles and resources to the individual agents. The organizational
design is co... | organization;organizational-self design;task and resource allocation;agent spawning;robustness;organizational structure;extended hierarchical task structure;environment modeling;composition;task analysis;coordination;simulation;multiagent system;organizational self-design |
train_I-65 | Graphical Models for Online Solutions to Interactive POMDPs | We develop a new graphical representation for interactive partially observable Markov decision processes (I-POMDPs) that is significantly more transparent and semantically clear than the previous representation. These graphical models called interactive dynamic influence diagrams (I-DIDs) seek to explicitly model the s... | 1. INTRODUCTION
Interactive partially observable Markov decision processes
(IPOMDPs) [9] provide a framework for sequential decision-making
in partially observable multiagent environments. They generalize
POMDPs [13] to multiagent settings by including the other agents"
computable models in the state space along with t... | influence diagram;multiagent environment;influence diagram network;dynamic influence diagram;multiplexer;independence structure;dependency link;decision-make;online sequential decision-making;interactive dynamic influence diagram;nash equilibrium profile;agent online;network of influence diagram;policy link;multi-agent ... |
train_I-66 | Letting loose a SPIDER on a network of POMDPs: Generating quality guaranteed policies | Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the significant complexity of solving distributed POMDPs, particularly as we scale up the numbers of agents, one popular approach has focused on appro... | 1. INTRODUCTION
Distributed Partially Observable Markov Decision Problems
(Distributed POMDPs) are emerging as a popular approach for
modeling sequential decision making in teams operating under
uncertainty [9, 4, 1, 2, 13]. The uncertainty arises on account of
nondeterminism in the outcomes of actions and because the ... | quality guaranteed approximation;policy search;branch and bound heuristic search technique;globally optimal solution;distributed partially observable markov decision problem;global optimality;network structure;heuristic;partially observable markov decision process;distributed sensor network;pomdp;approximate solution;m... |
train_I-68 | On Opportunistic Techniques for Solving Decentralized Markov Decision Processes with Temporal Constraints | Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve. In this paper, we improve a state-of-the-art heuristic solution method for DEC-MDPs, called OC-DEC-MDP, that has recently been shown to scal... | 1. INTRODUCTION
The development of algorithms for effective coordination of
multiple agents acting as a team in uncertain and time critical domains
has recently become a very active research field with potential
applications ranging from coordination of agents during a hostage
rescue mission [11] to the coordination of... | locally optimal solution;rescue mission;agent-coordination problem;decentralized partially observable markov decision process;decentralize markov decision process;temporal constraint;decision-theoretic model;multiplication;policy iteration;heuristic performance;probability function propagation;opportunity cost;value fu... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.