Search results for "Data type"
showing 10 items of 1183 documents
A Formal Model for Developing of the self-Diagosing and Self-Repairing 8-Bits Microprocessor, and Its Investigation Using Simulation
1986
Abstract The complete model of functional diagnostics is theoretically described. It specifies the conditions, which must be satisfied if the system to be self-diagnosable. The general principles of constructing self-diagnosable systems are enumerated. The model enables the realization of self-renewal, too. The model has been developed on the basis of the works by Preparata, Metze, Chien (1967) and Hakimi, Amin (1974) . The model contains a method of diagnostics completely separeted from the physical structure of the system. Recent results (Gruber, 1978; Swiatek, 1982) indicate that it is only necessary to know the set of transformations realized by the circuit. The model has been applied t…
Power Grid Integration and Use-Case Study of Acid-Base Flow Battery Technology
2021
There are many different types of energy storage systems (ESS) available and the functionality that they can provide is extensive. However, each of these solutions come with their own set of drawbacks. The acid-base flow battery (ABFB) technology aims to provide a route to a cheap, clean and safe ESS by means of providing a new kind of energy storage technology based on reversible dissociation of water via bipolar electrodialysis. First, the main characteristics of the ABFB technology are described briefly to highlight its main advantages and drawbacks and define the most-competitive use-case scenarios in which the technology could be applied, as well as analyze the particular characteristi…
Fast Algorithms for Pseudoarboricity
2015
The densest subgraph problem, which asks for a subgraph with the maximum edges-to-vertices ratio d∗, is solvable in polynomial time. We discuss algorithms for this problem and the computation of a graph orientation with the lowest maximum indegree, which is equal to ⌈d∗⌉. This value also equals the pseudoarboricity of the graph. We show that it can be computed in O(|E| √ log log d∗) time, and that better estimates can be given for graph classes where d∗ satisfies certain asymptotic bounds. These runtimes are achieved by accelerating a binary search with an approximation scheme, and a runtime analysis of Dinitz’s algorithm on flow networks where all arcs, except the source and sink arcs, hav…
A new compact formulation for the discrete p-dispersion problem
2017
Abstract This paper addresses the discrete p -dispersion problem (PDP) which is about selecting p facilities from a given set of candidates in such a way that the minimum distance between selected facilities is maximized. We propose a new compact formulation for this problem. In addition, we discuss two simple enhancements of the new formulation: Simple bounds on the optimal distance can be exploited to reduce the size and to increase the tightness of the model at a relatively low cost of additional computation time. Moreover, the new formulation can be further strengthened by adding valid inequalities. We present a computational study carried out over a set of large-scale test instances i…
Bio-inspired security analysis for IoT scenarios
2020
Computer security has recently become more and more important as the world economy dependency from data has kept growing. The complexity of the systems that need to be kept secure calls for new models capable of abstracting the interdependencies among heterogeneous components that cooperate at providing the desired service. A promising approach is attack graph analysis, however, the manual analysis of attack graphs is tedious and error prone. In this paper we propose to apply the metabolic network model to attack graph analysis, using three interacting bio-inspired algorithms: topological analysis, flux balance analysis, and extreme pathway analysis. A developed framework for graph building…
A bio-inspired approach to attack graphs analysis
2018
Computer security has recently become more and more important as the world economy dependency from data has kept growing. The complexity of the systems that need to be kept secure calls for new models capable of abstracting the interdependencies among heterogeneous components that cooperate at providing the desired service. A promising approach is attack graph analysis, however the manual analysis of attack graphs is tedious and error prone. In this paper we propose to apply the metabolic network model to attack graphs analysis, using three interacting bio-inspired algorithms: topological analysis, flux balance analysis, and extreme pathway analysis. A developed framework for graph building…
New Trends in Graph Mining
2010
Searching for repeated features characterizing biological data is fundamental in computational biology. When biological networks are under analysis, the presence of repeated modules across the same network (or several distinct ones) is shown to be very relevant. Indeed, several studies prove that biological networks can be often understood in terms of coalitions of basic repeated building blocks, often referred to as network motifs.This work provides a review of the main techniques proposed for motif extraction from biological networks. In particular, main intrinsic difficulties related to the problem are pointed out, along with solutions proposed in the literature to overcome them. Open ch…
Protein-protein interaction network querying by a "focus and zoom" approach
2008
We propose an approach to network querying in protein-protein interaction networks based on bipartite graph weighted matching. An algorithm is presented that first “focuses” the potentially relevant portion of the target graph by performing a global alignment of this one with the query graph, and then “zooms” on the actual matching nodes by considering their topological arrangement, hereby obtaining a (possibly) approximated occurrence of the query graph within the target graph. Approximation is related to node insertions, node deletions and edge deletions possibly intervening in the query graph. The technique manages networks of arbitrary topology. Moreover, edge labels are used to represe…
A Coclustering Approach for Mining Large Protein-Protein Interaction Networks
2012
Several approaches have been presented in the literature to cluster Protein-Protein Interaction (PPI) networks. They can be grouped in two main categories: those allowing a protein to participate in different clusters and those generating only nonoverlapping clusters. In both cases, a challenging task is to find a suitable compromise between the biological relevance of the results and a comprehensive coverage of the analyzed networks. Indeed, methods returning high accurate results are often able to cover only small parts of the input PPI network, especially when low-characterized networks are considered. We present a coclustering-based technique able to generate both overlapping and nonove…
A Robust Generic Method for Grid Detection in White Light Microscopy Malassez Blade Images in the Context of Cell Counting
2015
AbstractIn biology, cell counting is a primary measurement and it is usually performed manually using hemocytometers such as Malassez blades. This work is tedious and can be automated using image processing. An algorithm based on Fourier transform filtering and the Hough transform was developed for Malassez blade grid extraction. This facilitates cell segmentation and counting within the grid. For the present work, a set of 137 images with high variability was processed. Grids were accurately detected in 98% of these images.