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/2671181
Mitigation of Radiation Effects in SRAM-Based FPGAs for Space Applications
Felix Siegle; Tanya Vladimirova; Jørgen Ilstad; Omar Emam
<jats:p>The use of static random access memory (SRAM)-based field programmable gate arrays (FPGAs) in harsh radiation environments has grown in recent years. These types of programmable devices require special mitigation techniques targeting the configuration memory, the user logic, and the embedded RAM blocks. This article provides a comprehensive survey of the literature published in this rich research field during the past 10 years. Furthermore, it can also serve as a tutorial for space engineers, scientists, and decision makers who need an introduction to this topic.</jats:p>
Palabras clave: General Computer Science; Theoretical Computer Science.
Pp. 1-34
doi: 10.1145/2652481
Automated Generation of Music Playlists: Survey and Experiments
Geoffray Bonnin; Dietmar Jannach
<jats:p>Most of the time when we listen to music on the radio or on our portable devices, the order in which the tracks are played is governed by so-called playlists. These playlists are basically sequences of tracks that traditionally are designed manually and whose organization is based on some underlying logic or theme. With the digitalization of music and the availability of various types of additional track-related information on the Web, new opportunities have emerged on how to automate the playlist creation process. Correspondingly, a number of proposals for automated playlist generation have been made in the literature during the past decade. These approaches vary both with respect to which kind of data they rely on and which types of algorithms they use. In this article, we review the literature on automated playlist generation and categorize the existing approaches. Furthermore, we discuss the evaluation designs that are used today in research to assess the quality of the generated playlists. Finally, we report the results of a comparative evaluation of typical playlist generation schemes based on historical data. Our results show that track and artist popularity can play a dominant role and that additional measures are required to better characterize and compare the quality of automatically generated playlists.</jats:p>
Palabras clave: General Computer Science; Theoretical Computer Science.
Pp. 1-35
doi: 10.1145/2617756
A Survey on Antispoofing Schemes for Fingerprint Recognition Systems
Emanuela Marasco; Arun Ross
<jats:p>Several issues related to the vulnerability of fingerprint recognition systems to attacks have been highlighted in the biometrics literature. One such vulnerability involves the use of artificial fingers, where materials such as Play-Doh, silicone, and gelatin are inscribed with fingerprint ridges. Researchers have demonstrated that some commercial fingerprint recognition systems can be deceived when these artificial fingers are placed on the sensor; that is, the system successfully processes the ensuing fingerprint images, thereby allowing an adversary to spoof the fingerprints of another individual. However, at the same time, several countermeasures that discriminate between live fingerprints and spoof artifacts have been proposed. While some of these antispoofing schemes are hardware based, several software-based approaches have been proposed as well. In this article, we review the literature and present the state of the art in fingerprint antispoofing.</jats:p>
Palabras clave: General Computer Science; Theoretical Computer Science.
Pp. 1-36
doi: 10.1145/2659796
Supporting Novice to Expert Transitions in User Interfaces
Andy Cockburn; Carl Gutwin; Joey Scarr; Sylvain Malacria
<jats:p> Interface design guidelines encourage designers to provide high-performance mechanisms for expert users. However, research shows that many expert interface components are seldom used and that there is a tendency for users to persistently fail to adopt faster methods for completing their work. This article summarizes and organizes research relevant to supporting users in making successful transitions to expert levels of performance. First, we provide a brief introduction to the underlying human factors of skill acquisition relevant to interaction with computer systems. We then present our focus, which is a review of the state of the art in user interfaces that promote expertise development. The review of interface research is based around four domains of performance improvement: <jats:italic>intramodal improvement</jats:italic> that occurs as a factor of repetition and practice with a single method of interaction; <jats:italic>intermodal improvement</jats:italic> that occurs when users switch from one method to another that has a higher performance ceiling; <jats:italic>vocabulary extension</jats:italic> , in which the user broadens his or her knowledge of the range of functions available; and <jats:italic>task mapping</jats:italic> , which examines the ways in which users perform their tasks. The review emphasizes the relationship between interface techniques and the human factors that explain their relative success. </jats:p>
Palabras clave: General Computer Science; Theoretical Computer Science.
Pp. 1-36
doi: 10.1145/2656204
Cloud Computing
Toni Mastelic; Ariel Oleksiak; Holger Claussen; Ivona Brandic; Jean-Marc Pierson; Athanasios V. Vasilakos
<jats:p>Cloud computing is today’s most emphasized Information and Communications Technology (ICT) paradigm that is directly or indirectly used by almost every online user. However, such great significance comes with the support of a great infrastructure that includes large data centers comprising thousands of server units and other supporting equipment. Their share in power consumption generates between 1.1% and 1.5% of the total electricity use worldwide and is projected to rise even more. Such alarming numbers demand rethinking the energy efficiency of such infrastructures. However, before making any changes to infrastructure, an analysis of the current status is required. In this article, we perform a comprehensive analysis of an infrastructure supporting the cloud computing paradigm with regards to energy efficiency. First, we define a systematic approach for analyzing the energy efficiency of most important data center domains, including server and network equipment, as well as cloud management systems and appliances consisting of a software utilized by end users. Second, we utilize this approach for analyzing available scientific and industrial literature on state-of-the-art practices in data centers and their equipment. Finally, we extract existing challenges and highlight future research directions.</jats:p>
Palabras clave: General Computer Science; Theoretical Computer Science.
Pp. 1-36
doi: 10.1145/2635675
Opportunistic Routing in Wireless Networks: Models, Algorithms, and Classifications
Azzedine Boukerche; Amir Darehshoorzadeh
<jats:p>Opportunistic Routing (OR) is a new promising paradigm that has been proposed for wireless networks. OR has gained a lot of attention from the research communities for its ability to increase the performance of wireless networks. It benefits from the broadcast characteristic of wireless mediums to improve network performance. The basic function of OR is its ability to overhear the transmitted packet and to coordinate among relaying nodes. In OR, a candidate set is a potential group of nodes that is selected as the next-hop forwarders. Hence, each node in OR can use different potential paths to send packets toward the destination. Any of the candidates of a node that have received the transmitted packet may forward it. The decision of choosing the next forwarder is made by coordination between candidates that have successfully received the transmitted packet. In OR, by using a dynamic relay node to forward the packet, the transmission reliability and network throughput can be increased. In this article, we explain the fundamental idea of OR and its important issues by providing some examples. We then categorize each of the important issues and explain them in detail. Furthermore, we illustrate different protocols from each category and compare their benefits and drawbacks. Finally, some potential directions for future research in OR is explained.</jats:p>
Palabras clave: General Computer Science; Theoretical Computer Science.
Pp. 1-36
doi: 10.1145/2635673
A Survey of Interdependent Information Security Games
Aron Laszka; Mark Felegyhazi; Levente Buttyan
<jats:p>Risks faced by information system operators and users are not only determined by their own security posture, but are also heavily affected by the security-related decisions of others. This interdependence between information system operators and users is a fundamental property that shapes the efficiency of security defense solutions. Game theory is the most appropriate method to model the strategic interactions between these participants. In this survey, we summarize game-theoretic interdependence models, characterize the emerging security inefficiencies, and present mechanisms to improve the security decisions of the participants. We focus our attention on games with interdependent defenders and do not discuss two-player attacker-defender games. Our goal is to distill the main insights from the state of the art and to identify the areas that need more attention from the research community.</jats:p>
Palabras clave: General Computer Science; Theoretical Computer Science.
Pp. 1-38
doi: 10.1145/2642708
A Survey on Green-Energy-Aware Power Management for Datacenters
Fanxin Kong; Xue Liu
<jats:p>Megawatt-scale datacenters have emerged to meet the increasing demand for IT applications and services. The hunger for power brings large electricity bills to datacenter operators and causes significant impacts to the environment. To reduce costs and environmental impacts, modern datacenters, such as those of Google and Apple, are beginning to integrate renewable or green energy sources into their power supply. This article investigates the green-energy-aware power management problem for these datacenters and surveys and classifies works that explicitly consider renewable energy and/or carbon emission. Our aim is to give a full view of this problem. Hence, we first provide some basic knowledge on datacenters (including datacenter components, power infrastructure, power load estimation, and energy sources' operations), the electrical grid (including dynamic pricing, power outages, and emission factor), and the carbon market (including cap-and-trade and carbon tax). Then, we categorize existing research works according to their basic approaches used, including workload scheduling, virtual machine management, and energy capacity planning. Each category's discussion includes the description of the shared core idea, qualitative analysis, and quantitative analysis among works of this category.</jats:p>
Palabras clave: General Computer Science; Theoretical Computer Science.
Pp. 1-38
doi: 10.1145/2674024
Progress in Case-Based Planning
Daniel Borrajo; Anna Roubíčková; Ivan Serina
<jats:p>Case-based planning (CBP) is an approach to automated planning that tries to save computational effort by reusing previously found solutions. In 2001, Spalazzi published a survey of work in CBP; here, we present an updated overview of systems that have contributed to the evolution of the field or addressed some issues related to planning by reuse in a novel way. The article presents relevant planners so that readers gain insight into the operation of these systems. This analysis will allow readers to understand the approaches both in the quality of the solutions and in the complexity of finding them.</jats:p>
Palabras clave: General Computer Science; Theoretical Computer Science.
Pp. 1-39
doi: 10.1145/2619088
Survey of Temporal Information Retrieval and Related Applications
Ricardo Campos; Gaël Dias; Alípio M. Jorge; Adam Jatowt
<jats:p>Temporal information retrieval has been a topic of great interest in recent years. Its purpose is to improve the effectiveness of information retrieval methods by exploiting temporal information in documents and queries. In this article, we present a survey of the existing literature on temporal information retrieval. In addition to giving an overview of the field, we categorize the relevant research, describe the main contributions, and compare different approaches. We organize existing research to provide a coherent view, discuss several open issues, and point out some possible future research directions in this area. Despite significant advances, the area lacks a systematic arrangement of prior efforts and an overview of state-of-the-art approaches. Moreover, an effective end-to-end temporal retrieval system that exploits temporal information to improve the quality of the presented results remains undeveloped.</jats:p>
Palabras clave: General Computer Science; Theoretical Computer Science.
Pp. 1-41