Search results for " data"

Entre big data et big brother

2017

Chap. 40; National audience

Computation of the area in the discrete plane: Green’s theorem revisited

2017

International audience; The detection of the contour of a binary object is a common problem; however, the area of a region, and its moments, can be a significant parameter. In several metrology applications, the area of planar objects must be measured. The area is obtained by counting the pixels inside the contour or using a discrete version of Green's formula. Unfortunately, we obtain the area enclosed by the polygonal line passing through the centers of the pixels along the contour. We present a modified version of Green's theorem in the discrete plane, which allows for the computation of the exact area of a two-dimensional region in the class of polyominoes. Penalties are introduced and …

2013

Currently, a growing number of programs become available in statistical software for multiple imputation of missing values. Among others, two algorithms are mainly implemented: Expectation Maximization (EM) and Multiple Imputation by Chained Equations (MICE). They have been shown to work well in large samples or when only small proportions of missing data are to be imputed. However, some researchers have begun to impute large proportions of missing data or to apply the method to small samples. A simulation was performed using MICE on datasets with 50, 100 or 200 cases and four or eleven variables. A varying proportion of data (3% - 63%) was set as missing completely at random and subsequent…

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…

In vivo detection, RNA-binding properties and characterization of the RNA-binding domain of the p7 putative movement protein from carnation mottle ca…

1999

Biochemical and structural characterization studies on the p7 putative movement protein from a Spanish isolate of carnation mottle carmovirus (CarMV) have been conducted. The CarMV p7 gene was fused to a sequence coding for a six-histidine tag and expressed in bacteria, allowing the purification of CarMV p7 and the production of a specific antiserum. This antiserum led to the immunological identification of CarMV p7 in infected leaf tissue from the experimental host Chenopodium quinoa. Putative nucleic acid-binding properties of the CarMV p7 have been explored and demonstrated with both electrophoretic mobility shift and RNA-protein blot in vitro assays using digoxigenin-labeled riboprobes.…

Isolation of the Endothelin B Receptor from Bovine Lung Structure, Signal Sequence, and Binding Site

1995

Bovine lung endothelin-B receptor has been isolated in good yield with a new procedure involving the use of endothelin-1 coupled to iminobiotin with a long spacer and avidin-agarose affinity chromatography. Contrary to previous reports, evidence has been obtained that the native form of this receptor corresponds to the full-length transcript expected on the basis of cDNA clones. The binding of endothelin to a variety of shortened fragments of the full receptor suggests that the long N-terminal sequence of this receptor has very little influence on the binding of endothelin and that the main determinants of the endothelin binding site might be constituted by residues in the sixth, and possib…

Self-assembly of bioelastomeric structures from solutions: Mean-field critical behavior and Flory-Huggins free energy of interactions

1993

Elastic and quasi-elastic light scattering studies were performed on aqueous solutions of poly (Val-Pro-Gly-Gly), a representative synthetic bioelastomer that differs from the previously studied poly (Val-Pro-Gly-Val-Gly) by the deletion of the hydrophobic Val in position four. When the spinodal line was approached from the region of thermodynamic stability, the intensity of light scattered by fluctuations, and the related lifetime and correlation length, were observed to diverge with mean-field critical exponents for both systems. Fitting of the experimental data allowed determining the spinodal and binodal (coexistence) lines that characterize the phase diagrams of the two systems, and it…

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…