Search results for "Computation"

A local complexity based combination method for decision forests trained with high-dimensional data

2012

Accurate machine learning with high-dimensional data is affected by phenomena known as the “curse” of dimensionality. One of the main strategies explored in the last decade to deal with this problem is the use of multi-classifier systems. Several of such approaches are inspired by the Random Subspace Method for the construction of decision forests. Furthermore, other studies rely on estimations of the individual classifiers' competence, to enhance the combination in the multi-classifier and improve the accuracy. We propose a competence estimate which is based on local complexity measurements, to perform a weighted average combination of the decision forest. Experimental results show how thi…

GenClust: A genetic algorithm for clustering gene expression data

2005

Abstract Background Clustering is a key step in the analysis of gene expression data, and in fact, many classical clustering algorithms are used, or more innovative ones have been designed and validated for the task. Despite the widespread use of artificial intelligence techniques in bioinformatics and, more generally, data analysis, there are very few clustering algorithms based on the genetic paradigm, yet that paradigm has great potential in finding good heuristic solutions to a difficult optimization problem such as clustering. Results GenClust is a new genetic algorithm for clustering gene expression data. It has two key features: (a) a novel coding of the search space that is simple, …

Calcification is not the Achilles' heel of cold-water corals in an acidifying ocean

2015

Ocean acidification is thought to be a major threat to coral reefs: laboratory evidence and CO2 seep research has shown adverse effects on many coral species, although a few are resilient. There are concerns that cold-water corals are even more vulnerable as they live in areas where aragonite saturation (?ara) is lower than in the tropics and is falling rapidly due to CO2 emissions. Here, we provide laboratory evidence that net (gross calcification minus dissolution) and gross calcification rates of three common cold-water corals, Caryophyllia smithii, Dendrophyllia cornigera, and Desmophyllum dianthus, are not affected by pCO2 levels expected for 2100 (pCO2 1058 ?atm, ?ara 1.29), and nor a…

A fast and efficient modified sectional method for simulating multicomponent collisional kinetics

1999

A fast and efficient method for simulating the evolution of internally mixed multicomponent particle size distributions for aerosol coagulation and droplet coalescence is developed. The technique is based upon a bin-wise sectionalization of the particle mass domain and by imposing the condition of mass conservation for each component. The distribution of each species as a function of the total particle mass is represented in each mass bin as a two-parameter exponential function. Particles of a given mass are assumed to be internally homogeneously mixed. The method is shown to be numerically stable for a wide range of time steps. The numerical solution is compared with both analytical result…

Researches concerning the construction of ultrasonic gas filters

2018

The dual equivalence of equations and coequations for automata

2015

The transition structure α : X ? X A of a deterministic automaton with state set X and with inputs from an alphabet A can be viewed both as an algebra and as a coalgebra. We use this algebra-coalgebra duality as a common perspective for the study of equations and coequations. For every automaton ( X , α ) , we define two new automata: free ( X , α ) and cofree ( X , α ) representing, respectively, the greatest set of equations and the smallest set of coequations satisfied by ( X , α ) . Both constructions are shown to be functorial. Our main result is that the restrictions of free and cofree to, respectively, preformations of languages and to quotients A * / C of A * with respect to a congr…

What Will You Do Next? A Cognitive Model for Understanding Others’ Intentions Based on Shared Representations

2013

Goal-directed action selection is the problem of what to do next in order to progress towards goal achievement. This problem is computationally more complex in case of joint action settings where two or more agents coordinate their actions in space and time to bring about a common goal: actions performed by one agent influence the action possibilities of the other agents, and ultimately the goal achievement. While humans apparently effortlessly engage in complex joint actions, a number of questions remain to be solved to achieve similar performances in artificial agents: How agents represent and understand actions being performed by others? How this understanding influences the choice of ag…

Contextual neural-network based spectrum prediction for cognitive radio

2015

Cognitive radio is the technique of effective electromagnetic spectrum usage important for future wireless communication including 5G networks. Neural networks are nature-inspired computational models used to solve cognitive radio prediction problems. This paper presents the use of contextual Sigma-if neural network in prediction of channel states for cognitive radio. Our results indicate that Sigma-if neural network confirms better predictions than Multilayer Perceptron (MLP) network and decreases sensing time for the benefit of the increase of the effectiveness of e-m spectrum usage.

Distributed Pseudo-Gossip Algorithm and Finite-Length Computational Codes for Efficient In-Network Subspace Projection

2013

In this paper, we design a practical power-efficient algorithm for Wireless Sensor Networks (WSN) in order to obtain, in a distributed manner, the projection of an observed sampled spatial field on a subspace of lower dimension. This is an important problem that is motivated in various applications where there are well defined subspaces of interest (e.g., spectral maps in cognitive radios). As opposed to traditional Gossip Algorithms used for subspace projection, where separation of channel coding and computation is assumed, our algorithm combines binary finite-length Computational Coding and a novel gossip-like protocol with certain communication rules, achieving important savings in conve…

Intentional strategies that make co-actors more predictable: The case of signaling

2013

AbstractPickering & Garrod (P&G) explain dialogue dynamics in terms of forward modeling and prediction-by-simulation mechanisms. Their theory dissolves a strict segregation between production and comprehension processes, and it links dialogue to action-based theories of joint action. We propose that the theory can also incorporate intentional strategies that increase communicative success: for example, signaling strategies that help remaining predictable and forming common ground.