Recursos de colección

Universidad Nacional de La Plata (75.867 recursos)

Este servicio se brinda en el marco del Proyecto de Enlace de Bibliotecas (PrEBi) y significa una novedosa iniciativa en pos de la difusión a través de Internet, dentro y fuera del ámbito de la Universidad, de los conocimientos que en ella se generan para servir como vehículo de promoción y jerarquización. Los objetivos que se han planteados para SeDiCI son sumamente ambiciosos e incluyen la difusion electrónica de tesis, tesinas y disertaciones pero también de otros tipos de creaciones intelectuales, pretendiendo abarcar la ciencia, la tecnología y el arte buscando modos de presentación no solo de objetos en forma de documentos de texto sino también otros medios multimediales aptos para creaciones no documentales.

vol. 04, no. 01

Mostrando recursos 1 - 12 de 12

  1. Dynamic tuning of parallel/distributed applications

    Morajko, Anna
    The thesis addresses the problem of automatic and dynamic tuning of parallel and distributed applications. Our objective is to help developers in the process of improving the application performance. The work presents a whole solution that deals with the issues of automatic and dynamic application improvement. In this approach, an application is monitored, its performance bottlenecks are detected, solutions are given and the application is modified on the fly

  2. High performance VLSI signal processing: Innovative architectures and algorithms. Volume 2 - Systems design and applications. Edited by K. J. Ray Liu and Kung Yao. IEEE Press, 1998

    Villagarcía Wanza, Horacio A.
    One of the major breakthroughs in VLSI technology has been its ability to implement signal processing algorithms and architectures onto cost-effective ASIC and DSP chips. Works in this area are highly interdisciplinary; they involve interaction among areas such as VLSI and circuit design, computer architecture, signal processing, communications and computer-aided design. The editors collect in two volumes much of the research efforts and findings that have made the high performance implementation of signal processing possible in the '90s.

  3. HTSN: a complex workflow model based on colored Petri net

    Zhu, Haiping; Li, Peigen; Zhang, Guojun
    Traditional workflow models have obvious shortcomings in describing complex workflows. Such complexity is due not only to the hierarchical property of business process, but also to the complicated dependencies among tasks. In this paper, we first introduce a conceptual task model based on UML class graph. Then we apply colored Petri nets to model task interfaces and composite task versions which form Task State Nets (TSNs) and Task Version Nets (TVNs). The main advantage is that they explicitly express all task interfaces´ internal states and thus they can easily describe the complex control dependencies. Next we further combine TSN/TVN with...

  4. ALENA

    Corbalán, Leonardo C.; Lanzarini, Laura Cristina; De Giusti, Armando Eduardo
    Evolving neural arrays (ENA) have proved to be capable of learning complex behaviors, i.e., problems whose solution requires strategy learning. For this reason, they present many applications in various areas such as robotics and process control. Unlike conventional methods "based on a single neural network" ENAs are made up of a set of networks organized as an array. Each of them represents a part of the expected solution. This work describes a new method, ALENA, that enhances the solutions obtained by solving the main deficiencies of ENA since it eases the obtaining of specialized components, does not require the explicit...

  5. A GRASP algorithm with tree based local search for designing a survivable wide area network backbone

    Cancela, Héctor; Robledo, Franco; Rubino, Gerardo
    System survivability is the ability to give service in spite of failures of some of the components. To assure survivability is an important goal when designing a communications network backbone, to ensure that it can resist to failures in the switch sites as well as in the connection lines. Previous work has employed a Greedy Randomized Adaptive Search Procedure (GRASP), based on path algorithms, to build low cost network topologies which comply with heterogeneous node-connectivity requirements, which can model the survivability goals. In this work, we present another variant of the GRASP procedure, based on a tree search, which obtains good...

  6. Integrating defeasible argumentation with fuzzy ART neural networks for pattern classification

    Gómez, Sergio Alejandro; Chesñevar, Carlos Iván
    Many classification systems rely on clustering techniques in which a collection of training examples is provided as an input, and a number of clusters c1, modelling some concept C results as an output, such that every cluster ci is labelled as positive or negative. Given a new, unlabelled instance enew, the above classification is used to determine to which particular cluster ci this new instance belongs. In such a setting clusters can overlap, and a new unlabelled instance can be assigned to more than one cluster with conflicting labels. In the literature, such a case is usually solved non-deterministically by making a...

  7. Towards a metric suite for OCL expressions expressed within UML/OCL models

    Reynoso, Luis A.; Genero Bocco, Marcela; Piattini Velthuis, Mario
    UML models quality is clearly a crucial issue that must be evaluated at the initial stages of object-oriented software development, in order to get software products with better quality. This fact is corroborated by the huge amount of metrics that have appeared in the literature related to the measurement of UML diagrams at a high level design stage. Most of these metrics are focused on the measurement of internal quality attributes such as structural complexity, coupling, size, etc. However, none of the proposed metrics take into account the added complexity involved when a UML model are complemented by expressions written...

  8. Activation and termination detection on distributed systems

    Baraldi, Waldemar A.; Scarpa, Diego; Ponzoni, Ignacio; Ardenghi, Jorge Raúl
    Facing the different approaches to process activation and global termination detection on distributed systems, this paper performs a practical comparison between the mainly opposed centralized and distributed models. Firstly, they were implemented to solve both the activation and termination detection problems. Based on processing performance and communication overhead metrics, both systems were evaluated running on various parametrized environments. As a result, we present the values obtained and the final conclusions. The overall design was made following an object oriented methodology, which was coded using C++. The inter-process communication was carried out using the PVM libraries.

  9. Reasoning about protocols using Dijkstra´s calculus

    Singh, Awadhesh Kumar; Bandyopadhyay, Anup Kumar
    A mathematical model for the specification and verification of a data link layer protocol is proposed. The weakest precondition calculus, developed by Dijkstra, originally for sequential programs, has been chosen for this purpose. It is demonstrated that the wp-calculus provides a basis, not only for the modeling but also, for a straightforward and thorough analysis of large and complex distributed systems like data link layer protocol. This analysis contributes to the understanding of the system and could lead to an improvement in the design. The technique has been illustrated by describing the sliding window protocol.

  10. On improved deformable template matching for polygonal objects

    Luo, Jianshu; Tang, Zeying; Lu, Hanqing
    In this paper, an improvement of deformable template matching algorithm for polygonal objects in grayscale images using two-dimensional deformable templates along orthogonal curves is presented. In the process of pre-computing extensions of the deformable template along orthogonal curves, the novel matching approach incorporates adapting knowledge-specific template discretization techniques appropriate for different polygonal objects and minimizing the improved internal and external energy terms containing inter-shape information of polygonal objects. In our application, this energy optimization problem of the deformable template is efficiently solved by a genetic algorithm (GA). Our algorithm has been successfully applied on synthetic images and real images. The...

  11. CBS: constraint-based approach for scheduling in bluetooth networks

    Yu, Shengsheng; Zhou, Jingli; Jiang, Gang
    In Bluetooth networks, devices are organized into small piconets and large scatternets, and each node acts as the role of master, slave or gateway. Due to dynamic topology changes, different bandwidth available and unpredictable interference of media in Bluetooth networks, the congestion of data flow will inevitably emerges on the link, and the gateway has to switch between piconets on a time division basis, so its presence in the different piconet has to be controlled by scheduling mechanism such as inter- and intra -piconet scheduling. However, the time division in gateways will limit the network capacity and introduce bottleneck points...

  12. Index structures for distributed text databases

    Marin Cahiuan, Juan Mauricio
    The Web has became an obiquitous resource for distributed computing making it relevant to investigate new ways of providing efficient access to services available at dedicated sites. Efficiency is an ever-increasing demand which can be only satisfied with the development of parallel algorithms which are efficient in practice. This tutorial paper focuses on the design, analysis and implementation of parallel algorithms and data structures for widely-used text database applications on the Web. In particular we describe parallel algorithms for inverted files and suffix arrays structures that are suitable for implementing search engines. Algorithmic design is effected on top of the...

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.