Search results for "General Computer Science"

On the classification of visual patterns: systems analysis using detection experiments.

1977

Behavioral experiments are indispensable for the analysis of biological systems for cognition and recognition. When these are carried out as detection experiments three types of description can be used for the problem of visual pattern recognition which allow conclusions to be drawn on the operating function of the system. Provided that the signals to be recognized have additive noise superimposed on them, system description is possible: 1. on the basis on the probabilities of recognition and of mix-up,--2. through the analysis of the transformation of distribution densities of the noise,--3. by means of the measurable distances of the patterns from each other in feature space.-The analysis…

On the power of inductive inference from good examples

1993

Abstract The usual information in inductive inference available for the purposes of identifying an unknown recursive function f is the set of all input/output examples (x,f(x)),n eN. In contrast to this approach we show that it is considerably more powerful to work with finite sets of “good” examples even when these good examples are required to be effectively computable. The influence of the underlying numberings, with respect to which the identification has to be realized, to the capabilities of inference from good examples is also investigated. It turns out that nonstandard numberings can be much more powerful than Godel numberings.

3D high definition video coding on a GPU-based heterogeneous system

2013

H.264/MVC is a standard for supporting the sensation of 3D, based on coding from 2 (stereo) to N views. H.264/MVC adopts many coding options inherited from single view H.264/AVC, and thus its complexity is even higher, mainly because the number of processing views is higher. In this manuscript, we aim at an efficient parallelization of the most computationally intensive video encoding module for stereo sequences. In particular, inter prediction and its collaborative execution on a heterogeneous platform. The proposal is based on an efficient dynamic load balancing algorithm and on breaking encoding dependencies. Experimental results demonstrate the proposed algorithm's ability to reduce the…

Demand Response Service Certification and Customer Baseline Evaluation Using Blockchain Technology

2020

The use of Distributed Ledger Technologies such as Blockchain for certifying Demand Response services allows for the creation of a distributed system in which customers can communicate with the system operator to provide their flexibility, in a secure, transparent and traceable way. Blockchain technology also supports incentive mechanisms for users taking part in the service through the generation of utility tokens to recognize the user's contribution. This paper presents the experimental test of a novel methodology for Demand Response programs implementation by using the Blockchain technology. The latter is employed for defining a distributed Demand Response service and a new system for it…

Weights Space Exploration Using Genetic Algorithms for Meta-classifier in Text Document Classification

2012

Extracting string motif bases for quorum higher than two

2012

Bases of generators of motifs consisting of strings in which some positions can be occupied by a don’t care provide a useful conceptual tool for their description and a way to reduce the time and space involved in the discovery process. In the last few years, a few algorithms have been proposed for the extraction of a basis, building in large part on combinatorial properties of strings and their autocorrelations. Currently, the most efficient techniques for binary alphabets and quorum q = 2 require time quadratic in the length of the host string. The present paper explores properties of motif bases for quorum q ≥ 2, both with binary and general alphabets, by also showing that important resu…

Communication complexity in a 3-computer model

1996

It is proved that the probabilistic communication complexity of the identity function in a 3-computer model isO(√n).

2020

While most of opinion formation models consider static networks, a dynamic opinion formation model is proposed in this work. The so-called Temporal Threshold Page Rank Opinion Formation model (TTPROF) integrates temporal evolution in two ways. First, the opinion of the agents evolve with time. Second, the network structure is also time varying. More precisely, the relations between agents evolve with time. In the TTPROF model, a node is affected by part of its neighbor's opinions weighted by their Page Rank values. A threshold is introduced in order to limit the neighbors that can share their opinion. In other words, a neighbor influences a node if the difference between their opinions is b…

Tabu search for the dynamic Bipartite Drawing Problem

2018

Abstract Drawings of graphs have many applications and they are nowadays well-established tools in computer science in general, and optimization in particular. Project scheduling is one of the many areas in which representation of graphs constitutes an important instrument. The experience shows that the main quality desired for drawings of graphs is readability, and crossing reduction is a fundamental aesthetic criterion to achieve it. Incremental or dynamic graph drawing is an emerging topic in this context, where we seek to preserve the layout of a graph over successive drawings. In this paper, we target the edge crossing reduction in the context of incremental graph drawing. Specifically…

On enhancing the object migration automaton using the Pursuit paradigm

2017

Abstract One of the most difficult problems that is all-pervasive in computing is that of partitioning. It has applications in the partitioning of databases into relations, the realization of the relations themselves into sub-relations based on the partitioning of the attributes, the assignment of processes to processors, graph partitioning, and the task assignment problem, etc. The problem is known to be NP-hard. The benchmark solution for this for the Equi-Partitioning Problem (EPP) has involved the classic field of Learning Automata (LA), and the corresponding algorithm, the Object Migrating Automata (OMA) has been used in all of these application domains. While the OMA is a fixed struct…