Catálogo de publicaciones - revistas

Compartir en
redes sociales


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

Tabla de contenidos

P2P group management systems

Timo Koskela; Otso Kassinen; Erkki Harjula; Mika Ylianttila

<jats:p>Peer-to-Peer (P2P) networks are becoming eminent platforms for both distributed computing and interpersonal communication. Their role in contemporary multimedia content delivery and communication systems is strong, as witnessed by many popular applications and services. Groups in P2P systems can originate from the relations between humans, or they can be defined with purely technical criteria such as proximity. In this article, we present a conceptual analysis of P2P group management systems. We illustrate how groups are formed using different P2P system architectures, and analyze the advantages and disadvantages of using each P2P system architecture for implementing P2P group management. The evaluation criteria in the analysis are performance, robustness, fairness, suitability for battery-powered devices, scalability, and security. The outcome of the analysis facilitates the selection of an appropriate P2P system architecture for implementing P2P group management in both further research and prototype development.</jats:p>

Palabras clave: General Computer Science; Theoretical Computer Science.

Pp. 1-25

Bidirectional associative memories

Maria Elena Acevedo-Mosqueda; Cornelio Yáñez-Márquez; Marco Antonio Acevedo-Mosqueda

<jats:p>Bidirectional Associative Memories (BAM) are systems that allow to associate pairs of patterns. Once a memory has learned, patterns can be recalled in two directions. BAMs have many applications in pattern recognition and image processing. The aim of this survey is to present several models of BAM throughout time, since Kosko [1988] proposed the first model; followed by those works based on or inspired by it, trying to improve recall capacity; to some recent one-shot models—such as Morphological BAM and Alpha-Beta BAM—which are of particular interest, given their superior performance.</jats:p>

Palabras clave: General Computer Science; Theoretical Computer Science.

Pp. 1-30

A systematic approach to classify design-time global scheduling techniques

Angeliki Kritikakou; Francky Catthoor; Vasilios Kelefouras; Costas Goutis

<jats:p>The scheduling problem is an important partially solved topic related to a wide range of scientific fields. As it applies to design-time mapping on multiprocessing platforms emphasizing on ordering in time and assignment in place, significant improvements can be achieved. To support this improvement, this article presents a complete systematic classification of the existing scheduling techniques solving this problem in a (near-)optimal way. We show that the proposed approach covers any global scheduling technique, including also future ones. In our systematic classification a technique may belong to one primitive class or to a hybrid combination of such classes. In the latter case the technique is efficiently decomposed into more primitive components each one belonging to a specific class. The systematic classification assists in the in-depth understanding of the diverse classes of techniques which is essential for their further improvement. Their main characteristics and structure, their similarities and differences, and the interrelationships of the classes are conceived. In this way, our classification provides guidance for contributing in novel ways to the broad domain of global scheduling techniques.</jats:p>

Palabras clave: General Computer Science; Theoretical Computer Science.

Pp. 1-30

Polygon mesh repairing

Marco Attene; Marcel Campen; Leif Kobbelt

<jats:p>Nowadays, digital 3D models are in widespread and ubiquitous use, and each specific application dealing with 3D geometry has its own quality requirements that restrict the class of acceptable and supported models. This article analyzes typical defects that make a 3D model unsuitable for key application contexts, and surveys existing algorithms that process, repair, and improve its structure, geometry, and topology to make it appropriate to case-by-case requirements.</jats:p> <jats:p>The analysis is focused on polygon meshes, which constitute by far the most common 3D object representation. In particular, this article provides a structured overview of mesh repairing techniques from the point of view of the application context. Different types of mesh defects are classified according to the upstream application that produced the mesh, whereas mesh quality requirements are grouped by representative sets of downstream applications where the mesh is to be used. The numerous mesh repair methods that have been proposed during the last two decades are analyzed and classified in terms of their capabilities, properties, and guarantees. Based on these classifications, guidelines can be derived to support the identification of repairing algorithms best-suited to bridge the compatibility gap between the quality provided by the upstream process and the quality required by the downstream applications in a given geometry processing scenario.</jats:p>

Palabras clave: General Computer Science; Theoretical Computer Science.

Pp. 1-33

Synthesis and optimization of reversible circuits—a survey

Mehdi Saeedi; Igor L. Markov

<jats:p>Reversible logic circuits have been historically motivated by theoretical research in low-power electronics as well as practical improvement of bit manipulation transforms in cryptography and computer graphics. Recently, reversible circuits have attracted interest as components of quantum algorithms, as well as in photonic and nano-computing technologies where some switching devices offer no signal gain. Research in generating reversible logic distinguishes between circuit synthesis, postsynthesis optimization, and technology mapping. In this survey, we review algorithmic paradigms—search based, cycle based, transformation based, and BDD based—as well as specific algorithms for reversible synthesis, both exact and heuristic. We conclude the survey by outlining key open challenges in synthesis of reversible and quantum logic, as well as most common misconceptions.</jats:p>

Palabras clave: General Computer Science; Theoretical Computer Science.

Pp. 1-34

A survey on ear biometrics

Ayman Abaza; Arun Ross; Christina Hebert; Mary Ann F. Harrison; Mark S. Nixon

<jats:p>Recognizing people by their ear has recently received significant attention in the literature. Several reasons account for this trend: first, ear recognition does not suffer from some problems associated with other non-contact biometrics, such as face recognition; second, it is the most promising candidate for combination with the face in the context of multi-pose face recognition; and third, the ear can be used for human recognition in surveillance videos where the face may be occluded completely or in part. Further, the ear appears to degrade little with age. Even though current ear detection and recognition systems have reached a certain level of maturity, their success is limited to controlled indoor conditions. In addition to variation in illumination, other open research problems include hair occlusion, earprint forensics, ear symmetry, ear classification, and ear individuality.</jats:p> <jats:p>This article provides a detailed survey of research conducted in ear detection and recognition. It provides an up-to-date review of the existing literature revealing the current state-of-art for not only those who are working in this area but also for those who might exploit this new approach. Furthermore, it offers insights into some unsolved ear recognition problems as well as ear databases available for researchers.</jats:p>

Palabras clave: General Computer Science; Theoretical Computer Science.

Pp. 1-35

Offline arabic handwritten text recognition

Mohammad Tanvir Parvez; Sabri A. Mahmoud

<jats:p>Research in offline Arabic handwriting recognition has increased considerably in the past few years. This is evident from the numerous research results published recently in major journals and conferences in the area of handwriting recognition. Features and classifications techniques utilized in recent research work have diversified noticeably compared to the past. Moreover, more efforts have been diverted, in last few years, to construct different databases for Arabic handwriting recognition. This article provides a comprehensive survey of recent developments in Arabic handwriting recognition. The article starts with a summary of the characteristics of Arabic text, followed by a general model for an Arabic text recognition system. Then the used databases for Arabic text recognition are discussed. Research works on preprocessing phase, like text representation, baseline detection, line, word, character, and subcharacter segmentation algorithms, are presented. Different feature extraction techniques used in Arabic handwriting recognition are identified and discussed. Different classification approaches, like HMM, ANN, SVM, k-NN, syntactical methods, etc., are discussed in the context of Arabic handwriting recognition. Works on Arabic lexicon construction and spell checking are presented in the postprocessing phase. Several summary tables of published research work are provided for used Arabic text databases and reported results on Arabic character, word, numerals, and text recognition. These tables summarize the features, classifiers, data, and reported recognition accuracy for each technique. Finally, we discuss some future research directions in Arabic handwriting recognition.</jats:p>

Palabras clave: General Computer Science; Theoretical Computer Science.

Pp. 1-35

A survey of cost-sensitive decision tree induction algorithms

Susan Lomax; Sunil Vadera

<jats:p>The past decade has seen a significant interest on the problem of inducing decision trees that take account of costs of misclassification and costs of acquiring the features used for decision making. This survey identifies over 50 algorithms including approaches that are direct adaptations of accuracy-based methods, use genetic algorithms, use anytime methods and utilize boosting and bagging. The survey brings together these different studies and novel approaches to cost-sensitive decision tree learning, provides a useful taxonomy, a historical timeline of how the field has developed and should provide a useful reference point for future research in this field.</jats:p>

Palabras clave: General Computer Science; Theoretical Computer Science.

Pp. 1-35

Virtualization

Michael Pearce; Sherali Zeadally; Ray Hunt

<jats:p>Although system virtualization is not a new paradigm, the way in which it is used in modern system architectures provides a powerful platform for system building, the advantages of which have only been realized in recent years, as a result of the rapid deployment of commodity hardware and software systems. In principle, virtualization involves the use of an encapsulating software layer (Hypervisor or Virtual Machine Monitor) which surrounds or underlies an operating system and provides the same inputs, outputs, and behavior that would be expected from an actual physical device. This abstraction means that an ideal Virtual Machine Monitor provides an environment to the software equivalent to the host system, but which is decoupled from the hardware state. Because a virtual machine is not dependent on the state of the physical hardware, multiple virtual machines may be installed on a single set of hardware. The decoupling of physical and logical states gives virtualization inherent security benefits. However, the design, implementation, and deployment of virtualization technology have also opened up novel threats and security issues which, while not particular to system virtualization, take on new forms in relation to it. Reverse engineering becomes easier due to introspection capabilities, as encryption keys, security algorithms, low-level protection, intrusion detection, or antidebugging measures can become more easily compromised. Furthermore, associated technologies such as virtual routing and networking can create challenging issues for security, intrusion control, and associated forensic processes. We explain the security considerations and some associated methodologies by which security breaches can occur, and offer recommendations for how virtualized environments can best be protected. Finally, we offer a set of generalized recommendations that can be applied to achieve secure virtualized implementations.</jats:p>

Palabras clave: General Computer Science; Theoretical Computer Science.

Pp. 1-39

Sequential pattern mining -- approaches and algorithms

Carl H. Mooney; John F. Roddick

<jats:p>Sequences of events, items, or tokens occurring in an ordered metric space appear often in data and the requirement to detect and analyze frequent subsequences is a common problem. Sequential Pattern Mining arose as a subfield of data mining to focus on this field. This article surveys the approaches and algorithms proposed to date.</jats:p>

Palabras clave: General Computer Science; Theoretical Computer Science.

Pp. 1-39