Search results for " Computer Science"
showing 10 items of 3983 documents
Cognitive Mimetics for Designing Intelligent Technologies
2018
Design mimetics is an important method of creation in technology design. Here, we review design mimetics as a plausible approach to address the problem of how to design generally intelligent technology. We argue that design mimetics can be conceptually divided into three levels based on the source of imitation. Biomimetics focuses on the structural similarities between systems in nature and technical solutions for solving design problems. In robotics, the sensory-motor systems of humans and animals are a source of design solutions. At the highest level, we introduce the concept of cognitive mimetics, in which the source for imitation is human information processing. We review and discuss so…
A Generic Approach to Scheduling and Checkpointing Workflows
2018
This work deals with scheduling and checkpointing strategies to execute scientific workflows on failure-prone large-scale platforms. To the best of our knowledge, this work is the first to target fail-stop errors for arbitrary workflows. Most previous work addresses soft errors, which corrupt the task being executed by a processor but do not cause the entire memory of that processor to be lost, contrarily to fail-stop errors. We revisit classical mapping heuristics such as HEFT and MinMin and complement them with several checkpointing strategies. The objective is to derive an efficient trade-off between checkpointing every task (CkptAll), which is an overkill when failures are rare events, …
Data Mining in Cancer Research [Application Notes
2010
This article is not intended as a comprehensive survey of data mining applications in cancer. Rather, it provides starting points for further, more targeted, literature searches, by embarking on a guided tour of computational intelligence applications in cancer medicine, structured in increasing order of the physical scales of biological processes.
Density-functional tight-binding for beginners
2009
This article is a pedagogical introduction to density-functional tight-binding (DFTB) method. We derive it from the density-functional theory, give the details behind the tight-binding formalism, and give practical recipes for parametrization: how to calculate pseudo-atomic orbitals and matrix elements, and especially how to systematically fit the short-range repulsions. Our scope is neither to provide a historical review nor to make performance comparisons, but to give beginner's guide for this approximate, but in many ways invaluable, electronic structure simulation method--now freely available as an open-source software package, hotbit.
Speeding up of microstructure reconstruction: II. Application to patterns of poly-dispersed islands
2015
We report a fast, efficient and credible statistical reconstruction of any two-phase patterns of islands of miscellaneous shapes and poly-dispersed in sizes. In the proposed multi-scale approach called a weighted doubly-hybrid, two different pairs of hybrid descriptors are used. As the first pair, we employ entropic quantifiers, while correlation functions are the second pair. Their competition allows considering a wider spectrum of morphological features. Instead of a standard random initial configuration, a synthetic one with the same number of islands as that of the target is created by a cellular automaton. This is the key point for speeding-up of microstructure reconstruction, making u…
On conditional probabilities and their canonical extensions to Boolean algebras of compound conditionals
2023
In this paper we investigate canonical extensions of conditional probabilities to Boolean algebras of conditionals. Before entering into the probabilistic setting, we first prove that the lattice order relation of every Boolean algebra of conditionals can be characterized in terms of the well-known order relation given by Goodman and Nguyen. Then, as an interesting methodological tool, we show that canonical extensions behave well with respect to conditional subalgebras. As a consequence, we prove that a canonical extension and its original conditional probability agree on basic conditionals. Moreover, we verify that the probability of conjunctions and disjunctions of conditionals in a rece…
On utilizing dependence-based information to enhance micro-aggregation for secure statistical databases
2011
Published version of an article in the journal: Pattern Analysis and Applications. Also available from the publisher at: http://dx.doi.org/10.1007/s10044-011-0199-9 We consider the micro-aggregation problem which involves partitioning a set of individual records in a micro-data file into a number of mutually exclusive and exhaustive groups. This problem, which seeks for the best partition of the micro-data file, is known to be NP-hard, and has been tackled using many heuristic solutions. In this paper, we would like to demonstrate that in the process of developing micro-aggregation techniques (MATs), it is expedient to incorporate information about the dependence between the random variable…
Extracting modular-based backbones in weighted networks
2021
Abstract Networks are an adequate representation for modeling and analyzing a great variety of complex systems. However, understanding networks with millions of nodes and billions of connections can be pretty challenging due to memory and time constraints. Therefore, selecting the relevant nodes and edges of these large-scale networks while preserving their core information is a major issue. In most cases, the so-called backbone extraction methods are based either on coarse-graining or filtering approaches. Coarse-graining techniques reduce the network size by gathering similar nodes into super-nodes, while filter-based methods eliminate nodes or edges according to a statistical property.In…
Two-view “cylindrical decomposition” of binary images
2001
This paper describes the discrete cylindrical algebraic decomposition (DCAD) construction along two orthogonal views of binary images. The combination of two information is used to avoid ambiguities for image recognition purposes. This algorithm associates an object connectivity graph to each connected component, allowing a complete description of the structuring information. Moreover, an easy and compact representation of the scene is achieved by using strings in a five letter alphabet. Examples on complex digital images are also provided. © 2001 Elsevier Science Inc.
Representing 2D Digital Objects
2000
The paper describes the combination a multi-views approach to represent connected components of 2D binary images. The approach is based on the Object Connectivity Graph (OCG), which is a sub-graph of the connectivity graph generated by the Discrete Cylindrical Algebraic Decomposition(DCAD) performed in the 2D discrete space. This construction allows us to find the number of connected components, to determine their connectivity degree, and to solve visibility problem. We show that the CAD construction, when performed on two orthogonal views, supply information to avoid ambiguities in the interpretation of each image component. The implementation of the algorithm is outlined and the computati…