bluuebunny/crossref_metadata_2025_split huggingface dataset:
Design and FPGA prototyping of a H.264/AVC main profile decoder for HDTV
Authors: Agostini Luciano V. , Azevedo Filho Arnaldo P. , Staehler Wagston T. , Rosa Vagner S. , Zatt Bruno , Pinto Ana Cristina M. , Porto Roger Endrigo , Bampi Sergio , Susin Altamiro A. 
Published: November 2010

AbstractThis paper presents the architecture, design, validation, and hardware prototyping of the main architectural blocks of main profile H.264/AVC decoder, namely the blocks: inverse transforms and quantization, intra prediction, motion compensation and deblocking filter, for a main profile H.264/AVC decoder. These architectures were designed to reach high throughputs and to be easily integrated with the other H.264/AVC modules. The architectures, all fully H.264/AVC compliant, were completely described in VHDL and further validated through simulations and FPGA prototyping. They were prototyped using a Digilent XUP V2P board, containing a Virtex-II Pro XC2VP30 Xilinx FPGA. The post place-and-route synthesis results indicate that the designed architectures are able to process 114 million samples per second and, in the worst case, they are able to process 64 HDTV frames (1080×1920) per second, allowing their use in H.264/AVC decoders targeting real time HDTV applications.
MI-SBTVD: A proposal for the brazilian digital television system SBTVD
Authors: Mendes Luciano L. , Brito José Marcos C. , Cardoso Fabbryccio A. , Guimarães Dayan A. , Lima Gustavo C. , Gomes Geraldo G. R. , Arantes Dalton S. , Souza Richard D. 
Published: November 2010

AbstractThe objective of this paper is to present a general overview of the Innovative Modulation System Project — MI-SBTVD — developed for the Brazilian Digital TV System. The MI-SBTVD Project includes an LDPC high performance error correcting code, an advanced transmit spatial diversity and an efficient multi-carrier modulation scheme. The building blocks of the system, its characteristics and most relevant innovations are presented. The performance of the whole system under different channels is compared with the performance of the present-day Digital Television standards. The complete system was implemented in FPGA using VHDL language and rapid prototyping tools for DSP algorithms.
The Brazilian digital television system access device architecture
Authors: de Carvalho Eduardo Rodrigues , de Barros Gil Garcia , de Paula Costa Laisa Caroline , Faria Regis Rossi Alves , Nunes Rogério Pernas , de Deus Lopes Roseli , Zuffo Marcelo Knörich 
Published: November 2010

AbstractIn early 2003, the Brazilian government accelerated the decision process on analog to digital transition of terrestrial TV broadcast infrastructure, naming this initiative The Brazilian Digital Television System (SBTVD). This paper describes the access device architecture we have proposed for the SBTVD, as well as related issues. We focused on several requirements among which: flexibility to support the social economical diversity enabling market implementations that can vary on cost, complexity and applications; digital inclusion targeting a minimal cost architecture providing a simple access device to information and services by convergent broadcast and point-to-point telecommunication means; and scalability targets incorporating state-of-the-art technology, considering emerging services and the current legacy analog TV infrastructure available in Brazil. We cover the following specific topics: an architecture overview considering scalability, interoperability and regional and international requirements, operating system and middleware interfaces, audio and video coding formats and associate standards, technical and economical analysis, usability and user interface consistency. Finally two prototypes for the outlined access device architecture are reported.
Domain engineering to ensure flexibility on interaction laws of multi-agent systems
Authors: Carvalho Gustavo R. , Paes Rodrigo B. , Lucena Carlos J. P. , Choren Ricardo 
Published: November 2010

AbstractLaw enforcement approaches have been proposed to promote dependability in open multi-agent systems. Interaction laws are defined and then enforced to promote predictability. As new software demands and requirements appear, the system and its interaction laws must evolve to support those changes. The purpose of domain engineering is to produce a set of reusable assets for a family of systems, which are then used to build concrete members of the family. Flexibility is the ease with which a system or component can be modified for use in applications other than those for which it was originally designed. In this paper, we discuss how the MLaw infrastructure was designed to support interaction law evolution providing support to produce a set of reusable laws for a family of systems. As an example, we have implemented two customizable applications in the area of electronic negotiation expressed as an open system environment.
Using agents and ontologies for application development on the semantic web
Authors: Blois Marcelo , Escobar Maurício , Choren Ricardo 
Published: November 2010

Abstract
The Semantic Web provides access to heterogeneous, distributed information, enabling software products to mediate between user needs and the information sources available. Agents are one of the most promising technologies for the development of Semantic Web software products. However, agent-based technologies will not become widespread until there are adequate infrastructures for the development of semantic multi-agent systems (MAS). Some challenges, such as turning software agents into practical abstractions for dealing with ontologies, taking advantage of the distributed nature of the Web to create distributed agents and making a seamless integration with existing Web tools, e.g. the browser, still need to be addressed. This paper describes the main features of the SemantiCore framework, an agent infrastructure to develop semantic MAS. A look at a benchmark Semantic Web application illustrates the SemantiCore potential as an infrastructure for the deployment of semantic agent applications.
Using Augmented State Kalman filter to localize multi autonomous underwater vehicles
Authors: Botelho Silvia , Neves Renato , Taddei Lorenzo , Oliveira Vinícius 
Published: November 2010

Abstract
The present paper describes a system for the construction of visual maps (“mosaics”) and motion estimation for a set of AUVs (Autonomous Underwater Vehicles). Robots are equipped with down-looking camera which is used to estimate their motion with respect to the seafloor and built an online mosaic. As the mosaic increases in size, a systematic bias is introduced in its alignment, resulting in an erroneous output. The theoretical concepts associated with the use of an Augmented State Kalman Filter (ASKF) were applied to optimally estimate both visual map and the fleet position.
Negotiating and enacting contracts for business networks
Authors: Rittgen Peter 
Published: November 2010

AbstractFlexibility is a major issue in business today and one answer to that is to organize work in networks of companies rather than within a single business. Cooperation between organizations is more easily established and adapted than reorganization of internal company structures. But how do we manage flexibility in such a network without sacrificing the minimum stability that is required for economic success? We suggest a method for coordinating interaction in a business network that provides three levels of flexibility: local ad-hoc change, global negotiated change and planned change. This method is based on the negotiation and enactment of process-based interorganizational contracts.
A method for model based test harness generation for component testing
Authors: Rocha Camila Ribeiro , Martins Eliane 
Published: November 2010

AbstractWe present a model-based testing approach that allows the automatic generation of test artifacts for component testing. A component interacts with its clients through provided interfaces, and request services from other components through its required interfaces. Generating a test artifact that acts as though it were the client of the component under test is the easiest part, and there already exists tools to support this task. But one needs also to create substitute of the server components, which is the hardest part. Although there are also tools to help with this task, it still requires manual effort. Our approach provides a systematic way to obtain such substitute components during test generation. Results of the application of the approach in a real world component are also presented.
Automatically composing reusable software components for mobile devices
Authors: White Jules , Schmidt Douglas C. , Wuchner Egon , Nechypurenko Andrey 
Published: November 2010

AbstractProduct-line architectures (PLAs) are an effective mechanism for facilitating the reuse of software components on different mobile devices. Mobile applications are typically delivered to devices using over-the-air provisioning services that allow a mobile phone to download and install software over a cellular network connection. Current techniques for automating product-line variant selection do not address the unique requirements (such as the need to consider resource constraints) of dynamically selecting a variant for overthe-air provisioning.This paper presents the following contributions to product-line variant selection for mobile devices: (1) it describes how a constraint solver can be used to dynamically select a product-line variant while adhering to resource constraints, (2) it presents architectures for automatically discovering device capabilities and mapping them to product-line feature models, (3) it includes results from experiments and field tests with an automated variant selector, and (4) it describes PLA design rules that can be used to increase the performance of automated constraint-based variant selection. Our empirical results show that fast automated variant selection from a feature model is possible if certain product-line design guidelines are followed.
Common coupling as a measure of reuse effort in kernel-based software with case studies on the creation of MkLinux and Darwin
Authors: Yu Liguo 
Published: November 2010

AbstractAn obstacle to software reuse is the large number of major modifications that frequently have to be made as a consequence of dependencies within the reused software components. In this paper, common coupling is categorized and used as a measure of the dependencies between software components. We compared common coupling in three operating systems, Linux, FreeBSD, and Mach, and related it to the reuse effort of these systems. The measure is evaluated by studying the creation of two operating systems, MkLinux which is based on the reuse of Linux and Mach, and Darwin which is based on the reuse of FreeBSD and Mach. We conclude that the way that common coupling is implemented in Linux kernel induces large dependencies between software components, which required more effort in order to be reused to produce MkLinux, while the common coupling implemented in the Mach and FreeBSD kernels induces few dependencies between software components, which required less effort in order to be reused to produce Darwin.
Quality aware software product line engineering
Authors: Etxeberria Leire , Sagardui Goiuria , Belategi Lorea 
Published: November 2010

AbstractMeeting and managing quality requirements such as performance, security… in a reuse context (software product line…) has a problematic that it is not found in single-systems. In this paper, an overview of aspects to consider is presented, including a review of existing approaches, as well as some conclusions, requirements and guidelines to address quality aspects in software product lines.
Statistical learning approaches for discriminant features selection
Authors: Giraldi Gilson A. , Rodrigues Paulo S. , Kitani Edson C. , Sato João R. , Thomaz Carlos E. 
Published: November 2010

AbstractSupervised statistical learning covers important models like Support Vector Machines (SVM) and Linear Discriminant Analysis (LDA). In this paper we describe the idea of using the discriminant weights given by SVM and LDA separating hyperplanes to select the most discriminant features to separate sample groups. Our method, called here as Discriminant Feature Analysis (DFA), is not restricted to any particular probability density function and the number of meaningful discriminant features is not limited to the number of groups. To evaluate the discriminant features selected, two case studies have been investigated using face images and breast lesion data sets. In both case studies, our experimental results show that the DFA approach provides an intuitive interpretation of the differences between the groups, highlighting and reconstructing the most important statistical changes between the sample groups analyzed.
Cooperative object manipulation in collaborative virtual environments
Authors: Pinho Marcio S. , Bowman Doug A. , Freitas Carla M. Dal Sasso 
Published: November 2010

AbstractCooperative manipulation refers to the simultaneous manipulation of a virtual object by multiple users in an immersive virtual environment (VE). In this work, we present techniques for cooperative manipulation based on existing single-user techniques. We discuss methods of combining simultaneous user actions, based on the separation of degrees of freedom between two users, and the awareness tools used to provide the necessary knowledge of the partner activities during the cooperative interaction process. We also present a framework for supporting the development of cooperative manipulation techniques, which are based on rules for combining single user interaction techniques. Finally, we report an evaluation of cooperative manipulation scenarios, the results indicating that, in certain situations, cooperative manipulation is more efficient and usable than singleuser manipulation.
A Machine Learning Approach to Automatic Music Genre Classification
Authors: Silla Carlos N. , Koerich Alessandro L. , Kaestner Celso A. A. 
Published: November 2010

AbstractThis paper presents a non-conventional approach for the automatic music genre classification problem. The proposed approach uses multiple feature vectors and a pattern recognition ensemble approach, according to space and time decomposition schemes. Despite being music genre classification a multi-class problem, we accomplish the task using a set of binary classifiers, whose results are merged in order to produce the final music genre label (space decomposition). Music segments are also decomposed according to time segments obtained from the beginning, middle and end parts of the original music signal (time-decomposition). The final classification is obtained from the set of individual results, according to a combination procedure. Classical machine learning algorithms such as Naïve-Bayes, Decision Trees, k Nearest-Neighbors, Support Vector Machines and Multi-Layer Perceptron Neural Nets are employed. Experiments were carried out on a novel dataset called Latin Music Database, which contains 3,160 music pieces categorized in 10 musical genres. Experimental results show that the proposed ensemble approach produces better results than the ones obtained from global and individual segment classifiers in most cases. Some experiments related to feature selection were also conducted, using the genetic algorithm paradigm. They show that the most important features for the classification task vary according to their origin in the music signal.
Soundscape Design Through Evolutionary Engines
Authors: Fornari José , Maia Adolfo , Manzolli Jônatas 
Published: November 2010

AbstractTwo implementations of an Evolutionary Sound Synthesis method using the Interaural Time Difference (ITD) and psychoacoustic descriptors are presented here as a way to develop criteria for fitness evaluation. We also explore a relationship between adaptive sound evolution and three soundscape characteristics: keysounds, key-signals and sound-marks. Sonic Localization Field is defined using a sound attenuation factor and ITD azimuth angle, respectively (Ii, Li). These pairs are used to build Spatial Sound Genotypes (SSG) and they are extracted from a waveform population set. An explanation on how our model was initially written in MATLAB is followed by a recent Pure Data (Pd) implementation. It also elucidates the development and use of: parametric scores, a triplet of psychoacoustic descriptors and the correspondent graphical user interface.
AcMus: an open, integrated platform for room acoustics research
Authors: Queiroz Marcelo , Iazzetta Fernando , Kon Fabio , Gomes Márcio Henrique A. , Figueiredo Fábio L. , Masiero Bruno , Ueda Leo K. , Dias Luciana , Torres Mário Henrique C. , Thomaz Leandro F. 
Published: November 2010

Abstract
This article describes the design, implementation, and experiences with AcMus, an open and integrated software platform for room acoustics research, which comprises tools for measurement, analysis, and simulation of rooms for music listening and production. Through use of affordable hardware, such as laptops, consumer audio interfaces and microphones, the software allows evaluation of relevant acoustical parameters with stable and consistent results, thus providing valuable information in the diagnosis of acoustical problems, as well as the possibility of simulating modifications in the room through analytical models. The system is open-source and based on a flexible and extensible Java plug-in framework, allowing for cross-platform portability, accessibility and experimentation, thus fostering collaboration of users, developers and researchers in the field of room acoustics.
Portuguese corpus-based learning using ETL
Authors: Milidiú Ruy Luiz , dos Santos Cícero Nogueira , Duarte Julio Cesar 
Published: November 2010

AbstractWe present Entropy Guided Transformation Learning models for three Portuguese Language Processing tasks: Part-of-Speech Tagging, Noun Phrase Chunking and Named Entity Recognition. For Part-of-Speech Tagging, we separately use the Mac-Morpho Corpus and the Tycho Brahe Corpus. For Noun Phrase Chunking, we use the SNR-CLIC Corpus. For Named Entity Recognition, we separately use three corpora: HAREM, MiniHAREM and LearnNEC06.For each one of the tasks, the ETL modeling phase is quick and simple. ETL only requires the training set and no handcrafted templates. ETL also simplifies the incorporation of new input features, such as capitalization information, which are sucessfully used in the ETL based systems. Using the ETL approach, we obtain state-of-the-art competitive performance in all six corpora-based tasks. These results indicate that ETL is a suitable approach for the construction of Portuguese corpus-based systems.
A privacy service for location-based collaboration among mobile users
Authors: Sacramento Vagner , Endler Markus , de Souza Clarisse 
Published: November 2010

AbstractThe potential loss of privacy due to the use of location based applications may be one of the greatest obstacles to their wider acceptance. Nevertheless, most research about privacy management to-date has not taken into consideration the complexity in the utilization of collaborative applications that may require users’ location sharing among participants. In this article, we propose a privacy service that helps users to maintain their privacy policy in a flexible and incremental way. We also carried out a qualitative evaluation study whose results illustrate several challenges that should be handled in the design of such a service.
Pre-processing for noise detection in gene expression classification data
Authors: Libralon Giampaolo Luiz , de Carvalho André Carlos Ponce de Leon Ferreira , Lorena Ana Carolina 
Published: November 2010

AbstractDue to the imprecise nature of biological experiments, biological data is often characterized by the presence of redundant and noisy data. This may be due to errors that occurred during data collection, such as contaminations in laboratorial samples. It is the case of gene expression data, where the equipments and tools currently used frequently produce noisy biological data. Machine Learning algorithms have been successfully used in gene expression data analysis. Although many Machine Learning algorithms can deal with noise, detecting and removing noisy instances from the training data set can help the induction of the target hypothesis. This paper evaluates the use of distance-based pre-processing techniques for noise detection in gene expression data classification problems. This evaluation analyzes the effectiveness of the techniques investigated in removing noisy data, measured by the accuracy obtained by different Machine Learning classifiers over the pre-processed data.
Turn off the graphics: designing non-visual interfaces for mobile phone games
Authors: Valente Luis , de Souza Clarisse Sieckenius , Feijó Bruno 
Published: November 2010

AbstractMobile phones are a widespread platform for ICT applications because they are highly pervasive in contemporary society. Hence, we can think of mobile gaming as a serious candidate to being a prominent form of entertainment in the near future. However, most games (for computers, console and mobile devices) make extensive use of the visual medium, which tends to exclude visually-impaired users from the play. While mobile gaming could potentially reach many visually-impaired users, who are very familiar with this technology, currently there seems to be only very few alternatives for this community. In an attempt to explore new interactive possibilities for such users, this work presents an initial study on non-visual interfaces for mobile phone games. It is based on Semiotic Engineering principles, emphasizing communication through aural, tactile and gestural signs, and deliberately excluding visual information. Results include a number of issues that can be incorporated to a wider research agenda on mobile gaming accessibility, both for the visually-impaired and sighted.
A basic equation for population dynamics with destruction of breeding habitats and its application to outbreak of cyprinid herpesvirus 3
Authors: Yamamura Norio , Telschow Arndt , Uchii Kimiko , Kawabata Zen'ichiro 
Published: November 2010

AbstractIn reproduction, many animal species migrate to local habitats that are appropriate for reproduction and for growth of newly born offspring. The examples are ubiquitous among crabs, freshwater fishes, amphibians, migratory birds, and sea animals. We propose a basic equation for population dynamics of such animals, assuming that the number of offspring is proportional to the area of the local breeding habitats as a first approximation. This equation is very simple to be solved analytically, and useful for representing environmental issues of habitat destruction and degradation. According to the equation, the adult density in breeding habitats increases temporarily during habitat destruction and returns to the original density afterwards. The temporal peak value is higher for a larger proportion of area with destruction, a higher temporal rate of destruction, and a higher survival probability of the adults. In contrast, habitat degradation results simply in a decrease of the adult density in breeding habitats. Using this equation, we will discuss the vulnerability of populations to epidemic diseases due to temporal local high densities with decreasing breeding habitats by human activities, exemplifying an outbreak of cyprinid herpesvirus 3 for wild carps in Lake Biwa.