Search results for " algorithms"
showing 10 items of 612 documents
Multiobjective Optimal Reconfiguration of MV Networks with Different Earthing Systems
2010
The paper deals with the traditional problem of multiobjective optimal reconfiguration applied to power distribution systems considering the safety issue in the formulation. The applications are devoted to the solution of the posed problem in networks in which coexist energy sources with unearthed neutral point and resonant earthed neutral point. After a brief review of the most recent papers on optimal reconfiguration, the paper outlines the safety problem and provides a solution to the multiobjective problem using the Non dominated Sorting Genetic Algorithm II aiming at: minimal power losses operation, safety check at distribution substations and load balancing among the HV/MV transformer…
An Optimization Package for Electrical Distribution Network Reconfiguration
2008
Identification of Key miRNAs in Regulation of PPI Networks
2020
In this paper, we explore the interaction between miRNA and deregulated proteins in some pathologies. Assuming that miRNA can influence mRNA and consequently the proteins regulation, we explore this connection by using an interaction matrix derived from miRNA-target data and PPI network interactions. From this interaction matrix and the set of deregulated proteins, we search for the miRNA subset that influences the deregulated proteins with a minimum impact on the not deregulated ones. This regulation problem can be formulated as a complex optimization problem. In this paper, we have tried to solve it by using the Genetic Algorithm Heuristic. As the main result, we have found a set of miRNA…
A New Class of Searchable and Provably Highly Compressible String Transformations
2019
The Burrows-Wheeler Transform is a string transformation that plays a fundamental role for the design of self-indexing compressed data structures. Over the years, researchers have successfully extended this transformation outside the domains of strings. However, efforts to find non-trivial alternatives of the original, now 25 years old, Burrows-Wheeler string transformation have met limited success. In this paper we bring new lymph to this area by introducing a whole new family of transformations that have all the "myriad virtues" of the BWT: they can be computed and inverted in linear time, they produce provably highly compressible strings, and they support linear time pattern search direc…
A Neuro-Genetic Approach to Real-Time Visual Grasp Synthesis
2007
Grasping is an essential prerequisite for an agent, either human or robotic, to manipulate various kinds of objects present in the world. It is a fact that we would like robots to have the same skills as we do. However, despite the construction of human-hand-like robotic effectors, much work is still to be done in order to give robots the capability to grasp and manipulate objects. The goal of this work is to automatically perform grasp synthesis of unknown planar objects. In other words, we must compute points on the object's boundary to be reached by the robotic fingers such that the resulting grasp, among infinite possibilities, optimizes some given criteria. The space of possible config…
Composite laminates buckling optimization through Levy based Ant Colony Optimization
2010
In this paper, the authors propose the use of the Levy probability distribution as leading mechanism for solutions differentiation in an efficient and bio-inspired optimization algorithm, ant colony optimization in continuous domains, ACOR. In the classical ACOR, new solutions are constructed starting from one solution, selected from an archive, where Gaussian distribution is used for parameter diversification. In the proposed approach, the Levy probability distributions are properly introduced in the solution construction step, in order to couple the ACOR algorithm with the exploration properties of the Levy distribution. The proposed approach has been tested on mathematical test functions…
An Embedded Processor for Metabolic Networks Optimization
2011
In recent years biological processes modelling and simulation have become two key issues in analyzing complex cellular systems. The computational requirements suggest to investigate alternative solutions to the common supercomputers and clusters in order to optimize and overcome computational bottleneck. The goal of this work is the design and the realization of an embedded processor for metabolic networks optimization in order to examine their behaviour and robustness under malfunctions of one or more nodes. The embedded processor has been prototyped on the Celoxica RC203E board, equipped with programmable FPGA technologies. A case studied outlining the E. Coli bacteria metabolic network i…
3D Map Computation from Historical Stereo Photographs of Florence
2018
The analysis of early photographic sources is fundamental for documenting and understanding the evolution of a city so rich in history and art as Florence. Indeed, by the 1860s several photographers used to work in town, and their images (often obtained through stereoscopic set-ups) can help us to reconstruct Florence in 3D as it was by the time of the Italian unification. The first and most delicate part of such reconstruction process is the computation of disparity maps from the historical stereo pairs. This is a very challenging task for fully-automatic computer vision algorithms, since XIX century photographs are affected by several problems—ranging from superficial damages to asynchron…
Modeling Efficient and Effective Communications in VANET through Population Protocols
2021
Vehicular Ad-hoc NETworks (VANETs) enable a countless set of next-generation applications thanks to the technological progress of the last decades. These applications rely on the assumption that a simple network of vehicles can be extended with more complex and powerful network infrastructure, in which several Road Side Units (RSUs) are employed to achieve application-specific goals. However, this assumption is not always satisfied as in many real-world scenarios it is unfeasible to have a conspicuous deployment of RSUs, due to both economic and environmental constraints. With the aim to overcome this limitation, in this paper we investigate how the only Vehicle-to-Vehicle (V2V) communicati…
Iterative Reconstruction of Signals on Graph
2020
We propose an iterative algorithm to interpolate graph signals from only a partial set of samples. Our method is derived from the well known Papoulis-Gerchberg algorithm by considering the optimal value of a constant involved in the iteration step. Compared with existing graph signal reconstruction algorithms, the proposed method achieves similar or better performance both in terms of convergence rate and computational efficiency.