Catálogo de publicaciones - revistas
ACM Computing Surveys (CSUR)
Resumen/Descripción – provisto por la editorial en inglés
A journal of the Association for Computing Machinery (ACM), which publishes surveys, tutorials, and special reports on all areas of computing research. Volumes are published yearly in four issues appearing in March, June, September, and December.Palabras clave – provistas por la editorial
No disponibles.
Disponibilidad
Institución detectada | Período | Navegá | Descargá | Solicitá |
---|---|---|---|---|
No detectada | desde mar. 1969 / hasta dic. 2023 | ACM Digital Library |
Información
Tipo de recurso:
revistas
ISSN impreso
0360-0300
ISSN electrónico
1557-7341
Editor responsable
Association for Computing Machinery (ACM)
País de edición
Estados Unidos
Fecha de publicación
1969-
Cobertura temática
Tabla de contenidos
doi: 10.1145/2906152
Socializing the Semantic Gap
Xirong Li; Tiberio Uricchio; Lamberto Ballan; Marco Bertini; Cees G. M. Snoek; Alberto Del Bimbo
<jats:p>Where previous reviews on content-based image retrieval emphasize what can be seen in an image to bridge the semantic gap, this survey considers what people tag about an image. A comprehensive treatise of three closely linked problems (i.e., image tag assignment, refinement, and tag-based image retrieval) is presented. While existing works vary in terms of their targeted tasks and methodology, they rely on the key functionality of tag relevance, that is, estimating the relevance of a specific tag with respect to the visual content of a given image and its social context. By analyzing what information a specific method exploits to construct its tag relevance function and how such information is exploited, this article introduces a two-dimensional taxonomy to structure the growing literature, understand the ingredients of the main works, clarify their connections and difference, and recognize their merits and limitations. For a head-to-head comparison with the state of the art, a new experimental protocol is presented, with training sets containing 10,000, 100,000, and 1 million images, and an evaluation on three test sets, contributed by various research groups. Eleven representative works are implemented and evaluated. Putting all this together, the survey aims to provide an overview of the past and foster progress for the near future.</jats:p>
Palabras clave: General Computer Science; Theoretical Computer Science.
Pp. 1-39
doi: 10.1145/2938639
Target Tracking for Sensor Networks
Éfren L. Souza; Eduardo F. Nakamura; Richard W. Pazzi
<jats:p>Target-tracking algorithms typically organize the network into a logical structure (e.g., tree, cluster, or faces) to enable data fusion and reduce communication costs. These algorithms often predict the target’s future position. In addition to using position forecasts for decision making, we can also use such information to save energy by activating only the set of sensors nearby the target’s trajectory. In this work, we survey of the state of the art of target-tracking techniques in sensor networks. We identify three different formulations for the target-tracking problem and classify the target-tracking algorithms based on common characteristics. Furthermore, for the sake of a better understanding of the target-tracking process, we organize this process in six components: target detection, node cooperation, position computation, future-position estimation, energy management, and target recovery. Each component has different solutions that affect the target-tracking performance.</jats:p>
Palabras clave: General Computer Science; Theoretical Computer Science.
Pp. 1-31
doi: 10.1145/2933232
A Survey on Wireless Indoor Localization from the Device Perspective
Jiang Xiao; Zimu Zhou; Youwen Yi; Lionel M. Ni
<jats:p>With the marvelous development of wireless techniques and ubiquitous deployment of wireless systems indoors, myriad indoor location-based services (ILBSs) have permeated into numerous aspects of modern life. The most fundamental functionality is to pinpoint the location of the target via wireless devices. According to how wireless devices interact with the target, wireless indoor localization schemes roughly fall into two categories: device based and device free. In device-based localization, a wireless device (e.g., a smartphone) is attached to the target and computes its location through cooperation with other deployed wireless devices. In device-free localization, the target carries no wireless devices, while the wireless infrastructure deployed in the environment determines the target’s location by analyzing its impact on wireless signals.</jats:p> <jats:p>This article is intended to offer a comprehensive state-of-the-art survey on wireless indoor localization from the device perspective. In this survey, we review the recent advances in both modes by elaborating on the underlying wireless modalities, basic localization principles, and data fusion techniques, with special emphasis on emerging trends in (1) leveraging smartphones to integrate wireless and sensor capabilities and extend to the social context for device-based localization, and (2) extracting specific wireless features to trigger novel human-centric device-free localization. We comprehensively compare each scheme in terms of accuracy, cost, scalability, and energy efficiency. Furthermore, we take a first look at intrinsic technical challenges in both categories and identify several open research issues associated with these new challenges.</jats:p>
Palabras clave: General Computer Science; Theoretical Computer Science.
Pp. 1-31
doi: 10.1145/2963147
A Survey of Measures and Methods for Matching Geospatial Vector Datasets
Emerson M. A. Xavier; Francisco J. Ariza-López; Manuel A. Ureña-Cámara
<jats:p> The field of Geographical Information Systems (GIS) has experienced a rapid and ongoing growth of available sources for geospatial data. This growth has demanded more data integration in order to explore the benefits of these data further. However, many data providers implies many points of view for the same phenomena: geospatial features. We need sophisticated procedures aiming to find the correspondences between two vector datasets, a process named <jats:italic>geospatial data matching</jats:italic> . Similarity measures are key-tools for matching methods, so it is interesting to review these concepts together. This article provides a survey of 30 years of research into the measures and methods facing geospatial data matching. Our survey presents related work and develops a common taxonomy that permits us to compare measures and methods. This study points out relevant issues that may help to discover the potential of these approaches in many applications, like data integration, conflation, quality evaluation, and data management. </jats:p>
Palabras clave: General Computer Science; Theoretical Computer Science.
Pp. 1-34
doi: 10.1145/2940295
Survey
Panagiotis Kokkinos; Dimitris Kalogeras; Anna Levin; Emmanouel Varvarigos
<jats:p>We study the virtual machine live migration (LM) and disaster recovery (DR) from a networking perspective, considering long-distance networks, for example, between data centers. These networks are usually constrained by limited available bandwidth, increased latency and congestion, or high cost of use when dedicated network resources are used, while their exact characteristics cannot be controlled. LM and DR present several challenges due to the large amounts of data that need to be transferred over long-distance networks, which increase with the number of migrated or protected resources. In this context, our work presents the way LM and DR are currently being performed and their operation in long-distance networking environments, discussing related issues and bottlenecks and surveying other works. We also present the way networks are evolving today and the new technologies and protocols (e.g., software-defined networking, or SDN, and flexible optical networks) that can be used to boost the efficiency of LM and DR over long distances. Traffic redirection in a long-distance environment is also an important part of the whole equation, since it directly affects the transparency of LM and DR. Related works and solutions both from academia and the industry are presented.</jats:p>
Palabras clave: General Computer Science; Theoretical Computer Science.
Pp. 1-36
doi: 10.1145/2946802
Performance and Security Improvements for Tor
Mashael Alsabah; Ian Goldberg
<jats:p>Tor [Dingledine et al. 2004] is the most widely used anonymity network today, serving millions of users on a daily basis using a growing number of volunteer-run routers. Since its deployment in 2003, there have been more than three dozen proposals that aim to improve its performance, security, and unobservability. Given the significance of this research area, our goal is to provide the reader with the state of current research directions and challenges in anonymous communication systems, focusing on the Tor network. We shed light on the design weaknesses and challenges facing the network and point out unresolved issues.</jats:p>
Palabras clave: General Computer Science; Theoretical Computer Science.
Pp. 1-36
doi: 10.1145/2963143
The Six Pillars for Building Big Data Analytics Ecosystems
Shadi Khalifa; Yehia Elshater; Kiran Sundaravarathan; Aparna Bhat; Patrick Martin; Fahim Imam; Dan Rope; Mike Mcroberts; Craig Statchuk
<jats:p>With almost everything now online, organizations look at the Big Data collected to gain insights for improving their services. In the analytics process, derivation of such insights requires experimenting-with and integrating different analytics techniques, while handling the Big Data high arrival velocity and large volumes. Existing solutions cover bits-and-pieces of the analytics process, leaving it to organizations to assemble their own ecosystem or buy an off-the-shelf ecosystem that can have unnecessary components to them. We build on this point by dividing the Big Data Analytics problem into six main pillars. We characterize and show examples of solutions designed for each of these pillars. We then integrate these six pillars into a taxonomy to provide an overview of the possible state-of-the-art analytics ecosystems. In the process, we highlight a number of ecosystems to meet organizations different needs. Finally, we identify possible areas of research for building future Big Data Analytics Ecosystems.</jats:p>
Palabras clave: General Computer Science; Theoretical Computer Science.
Pp. 1-36
doi: 10.1145/2938370
Out-of-Band Covert Channels—A Survey
Brent Carrara; Carlisle Adams
<jats:p> A novel class of covert channel, out-of-band covert channels, is presented by extending Simmons’ <jats:italic>prisoners’ problem</jats:italic> . This new class of covert channel is established by surveying the existing covert channel, device-pairing, and side-channel research. Terminology as well as a taxonomy for out-of-band covert channels is also given. Additionally, a more comprehensive adversarial model based on a knowledgeable passive adversary and a capable active adversary is proposed in place of the current adversarial model, which relies on an oblivious passive adversary. Last, general protection mechanisms are presented, and an argument for a general measure of “covertness” to effectively compare covert channels is given. </jats:p>
Palabras clave: General Computer Science; Theoretical Computer Science.
Pp. 1-36
doi: 10.1145/2954930
User Intent in Multimedia Search
Christoph Kofler; Martha Larson; Alan Hanjalic
<jats:p> Today's multimedia search engines are expected to respond to queries reflecting a wide variety of information needs from users with different goals. The topical dimension (“what” the user is searching for) of these information needs is well studied; however, the <jats:italic>intent</jats:italic> dimension (“why” the user is searching) has received relatively less attention. Specifically, intent is the <jats:italic>“immediate reason, purpose, or goal”</jats:italic> that motivates a user to query a search engine. We present a thorough survey of multimedia information retrieval research directed at the problem of enabling search engines to respond to user intent. The survey begins by defining intent, including a differentiation from related, often-confused concepts. It then presents the key conceptual models of search intent. The core is an overview of intent-aware approaches that operate at each stage of the multimedia search engine pipeline (i.e., indexing, query processing, ranking). We discuss intent in conventional text-based search wherever it provides insight into multimedia search intent or intent-aware approaches. Finally, we identify and discuss the most important future challenges for intent-aware multimedia search engines. Facing these challenges will allow multimedia information retrieval to recognize and respond to user intent and, as a result, fully satisfy the information needs of users. </jats:p>
Palabras clave: General Computer Science; Theoretical Computer Science.
Pp. 1-37
doi: 10.1145/2933241
Biometric Recognition in Automated Border Control
Ruggero Donida Labati; Angelo Genovese; Enrique Muñoz; Vincenzo Piuri; Fabio Scotti; Gianluca Sforza
<jats:p>The increasing demand for traveler clearance at international border crossing points (BCPs) has motivated research for finding more efficient solutions. Automated border control (ABC) is emerging as a solution to enhance the convenience of travelers, the throughput of BCPs, and national security. This is the first comprehensive survey on the biometric techniques and systems that enable automatic identity verification in ABC. We survey the biometric literature relevant to identity verification and summarize the best practices and biometric techniques applicable to ABC, relying on real experience collected in the field. Furthermore, we select some of the major biometric issues raised and highlight the open research areas.</jats:p>
Palabras clave: General Computer Science; Theoretical Computer Science.
Pp. 1-39