pinecone/core-2020-05-10-deduplication huggingface dataset:
Texture classification of proteins using support vector machines and bio-inspired metaheuristics

6th International Joint Conference, BIOSTEC 2013, Barcelona, Spain, February 11-14, 2013[Abstract] In this paper, a novel classification method of two-dimensional polyacrylamide gel electrophoresis images is presented. Such a method uses textural features obtained by means of a feature selection process for whose implementation we compare Genetic Algorithms and Particle Swarm Optimization. Then, the selected features, among which the most decisive and representative ones appear to be those related to the second order co-occurrence matrix, are used as inputs for a Support Vector Machine. The accuracy of the proposed method is around 94 %, a statistically better performance than the classification based on the entire feature set. This classification step can be very useful for discarding over-segmented areas after a protein segmentation or identification process
A two-armed bandit collective for hierarchical examplar based mining of frequent itemsets with applications to intrusion detection

Published version of a chapter in the book: Transactions on Computational Collective Intelligence XIV. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-662-44509-9_1In this paper we address the above problem by posing frequent item-set mining as a collection of interrelated two-armed bandit problems. We seek to find itemsets that frequently appear as subsets in a stream of itemsets, with the frequency being constrained to support granularity requirements. Starting from a randomly or manually selected examplar itemset, a collective of Tsetlin automata based two-armed bandit players - one automaton for each item in the examplar - learns which items should be included in the mined frequent itemset. A novel reinforcement scheme allows the bandit players to learn this in a decentralized and online manner by observing one itemset at a time. By invoking the latter procedure recursively, a progressively more fine granular summary of the itemset stream is produced, represented as a hierarchy of frequent item-sets. The proposed scheme is extensively evaluated using both artificial data as well as data from a real-world network intrusion detection application. The results are conclusive, demonstrating an excellent ability to find frequent itemsets. Also, computational complexity grows merely linearly with the cardinality of the examplar itemset. Finally, the hierarchical collections of frequent itemsets produced for network intrusion detection are compact, yet accurately describe the different types of network traffic present Over the last decades, frequent itemset mining has become a major area of research, with applications including indexing and similarity search, as well as mining of data streams, web, and software bugs. Although several efficient techniques for generating frequent itemsets with a minimum frequency have been proposed, the number of item-sets produced is in many cases too large for effective usage in real-life applications. Indeed, the problem of deriving frequent itemsets that are both compact and of high quality, remains to a large degree open
Undecidable properties of self-affine sets and multi-tape automata

We study the decidability of the topological properties of some objects
coming from fractal geometry. We prove that having empty interior is
undecidable for the sets defined by two-dimensional graph-directed iterated
function systems. These results are obtained by studying a particular class of
self-affine sets associated with multi-tape automata. We first establish the
undecidability of some language-theoretical properties of such automata, which
then translate into undecidability results about their associated self-affine
sets.Comment: 10 pages, v2 includes some corrections to match the published versio
Determinising Parity Automata

Parity word automata and their determinisation play an important role in
automata and game theory. We discuss a determinisation procedure for
nondeterministic parity automata through deterministic Rabin to deterministic
parity automata. We prove that the intermediate determinisation to Rabin
automata is optimal. We show that the resulting determinisation to parity
automata is optimal up to a small constant. Moreover, the lower bound refers to
the more liberal Streett acceptance. We thus show that determinisation to
Streett would not lead to better bounds than determinisation to parity. As a
side-result, this optimality extends to the determinisation of B\"uchi
automata
A Logical Characterization of Timed (non-)Regular Languages

CLTLoc (Constraint LTL over clocks) is a quantifier-free extension of LTL allowing variables behaving like clocks over real numbers. CLTLoc is in PSPACE [9] and its satisfiability can polynomially be reduced to a SMT problem, allowing a feasible implementation of a decision procedure. We used CLTLoc to capture the semantics of metric temporal logics over continuous time, such as Metric Interval Temporal Logic (MITL), resulting in the first successful implementation of a tool for checking MITL satisfiability [7]. In this paper, we assess the expressive power of CLTLoc, by comparing it with various temporal formalisms over dense time.When interpreted over timed words, CLTLoc is equivalent to Timed Automata. We also define a monadic theory of orders, extending the one introduced by Kamp, which is expressively equivalent to CLTLoc. We investigate a decidable extension with an arithmetical next operator, which allows the expression of timed non-ω-regular languages
Perturbation analysis in verification of Discrete-time Markov Chains

Perturbation analysis in probabilistic verification addresses the robustness and sensitivity problem for verification of stochastic models against qualitative and quantitative properties. We identify two types of perturbation bounds, namely non-asymptotic bounds and asymptotic bounds. Non-asymptotic bounds are exact, pointwise bounds that quantify the upper and lower bounds of the verification result subject to a given perturbation of the model, whereas asymptotic bounds are closed-form bounds that approximate non-asymptotic bounds by assuming that the given perturbation is sufficiently small. We perform perturbation analysis in the setting of Discrete-time Markov Chains. We consider three basic matrix norms to capture the perturbation distance, and focus on the computational aspect. Our main contributions include algorithms and tight complexity bounds for calculating both non-asymptotic bounds and asymptotic bounds with respect to the three perturbation distances. © 2014 Springer-Verlag
A nearly optimal upper bound for the self-stabilization time in Herman's algorithm

Self-stabilization algorithms are very important in designing fault-tolerant distributed systems. In this paper we consider Herman's self-stabilization algorithm and study its expected self-stabilization time. McIver and Morgan have conjectured the optimal upper bound being 0.148N 2, where N denotes the number of processors. We present an elementary proof showing a bound of 0.167N2, a sharp improvement compared with the best known bound 0.521N2. Our proof is inspired by McIver and Morgan's approach: we find a nearly optimal closed form of the expected stabilization time for any initial configuration, and apply the Lagrange multipliers method to give an upper bound of it. © 2014 Springer-Verlag
Generalized bisimulation metrics

International audienceThe pseudometric based on the Kantorovich lifting is one of the most popular notion of distance between probabilistic processes proposed in the literature. However, its application in verification is limited to linear properties. We propose a generalization which allows to deal with a wider class of properties, such as those used in security and privacy. More precisely, we propose a family of pseudometrics, parametrized on a notion of distance which depends on the property we want to verify. Furthermore, we show that the members of this family still characterize bisimilarity in terms of their kernel, and provide a bound on the corresponding distance between trace distributions. Finally, we study the instance corresponding to differential privacy, and we show that it has   a dual form, easier to compute. We also prove that the typical process-algebra constructs  are non-expansive, thus paving the way to a modular approach to verification
Bisimulations up-to: beyond first-order transition systems

International audienceThe bisimulation proof method can be enhanced by employing 'bisimulations up-to' techniques. A comprehensive theory of such enhancements has been developed for first-order (i.e., CCS-like) labelled transition systems (LTSs) and bisimilarity, based on the notion of compatible function for fixed-point theory. We transport this theory onto languages whose bisimilarity and LTS go beyond those of first-order models. The approach consists in exhibiting fully abstract translations of the more sophisticated LTSs and bisimilarities onto the first-order ones. This allows us to reuse directly the large corpus of up-to techniques that are available on first-order LTSs. The only ingredient that has to be manually supplied is the compatibility of basic up-to techniques that are specific to the new languages. We investigate the method on the pi-calculus, the lambda-calculus, and a (call-by-value) lambda-calculus with references
Strong completeness for iteration-free coalgebraic dynamic logics

We present a (co)algebraic treatment of iteration-free dynamic modal logics such as Propositional Dynamic Logic (PDL) and Game Logic (GL), both without star. The main observation is that the program/game constructs of PDL/GL arise from monad structure, and the axioms of these logics correspond to certain compatibilty requirements between the modalities and this monad structure. Our main contribution is a general soundness and strong completeness result for PDL-like logics for T-coalgebras where T is a monad and the "program" constructs are given by sequential composition, test, and pointwise extensions of operations of T
Magnetic Reconnection in Astrophysical Environments

Magnetic reconnection is a process that changes magnetic field topology in
highly conducting fluids. Traditionally, magnetic reconnection was associated
mostly with solar flares. In reality, the process must be ubiquitous as
astrophysical fluids are magnetized and motions of fluid elements necessarily
entail crossing of magnetic frozen in field lines and magnetic reconnection. We
consider magnetic reconnection in realistic 3D geometry in the presence of
turbulence. This turbulence in most astrophysical settings is of pre-existing
nature, but it also can be induced by magnetic reconnection itself. In this
situation turbulent magnetic field wandering opens up reconnection outflow
regions, making reconnection fast. We discuss Lazarian \& Vishniac (1999) model
of turbulent reconnection, its numerical and observational testings, as well as
its connection to the modern understanding of the Lagrangian properties of
turbulent fluids. We show that the predicted dependences of the reconnection
rates on the level of MHD turbulence make the generally accepted Goldreich \&
Sridhar (1995) model of turbulence self-consistent. Similarly, we argue that
the well-known Alfv\'en theorem on flux freezing is not valid for the turbulent
fluids and therefore magnetic fields diffuse within turbulent volumes.
  This is an element of magnetic field dynamics that was not accounted by
earlier theories. For instance, the theory of star formation that was
developing assuming that it is only the drift of neutrals that can violate the
otherwise perfect flux freezing, is affected and we discuss the consequences of
the turbulent diffusion of magnetic fields mediated by reconnection.Comment: review, to be published in the Lecture Notes of Physic
Interstellar MHD Turbulence and Star Formation

This chapter reviews the nature of turbulence in the Galactic interstellar
medium (ISM) and its connections to the star formation (SF) process. The ISM is
turbulent, magnetized, self-gravitating, and is subject to heating and cooling
processes that control its thermodynamic behavior. The turbulence in the warm
and hot ionized components of the ISM appears to be trans- or subsonic, and
thus to behave nearly incompressibly. However, the neutral warm and cold
components are highly compressible, as a consequence of both thermal
instability in the atomic gas and of moderately-to-strongly supersonic motions
in the roughly isothermal cold atomic and molecular components. Within this
context, we discuss: i) the production and statistical distribution of
turbulent density fluctuations in both isothermal and polytropic media; ii) the
nature of the clumps produced by thermal instability, noting that, contrary to
classical ideas, they in general accrete mass from their environment; iii) the
density-magnetic field correlation (or lack thereof) in turbulent density
fluctuations, as a consequence of the superposition of the different wave modes
in the turbulent flow; iv) the evolution of the mass-to-magnetic flux ratio
(MFR) in density fluctuations as they are built up by dynamic compressions; v)
the formation of cold, dense clouds aided by thermal instability; vi) the
expectation that star-forming molecular clouds are likely to be undergoing
global gravitational contraction, rather than being near equilibrium, and vii)
the regulation of the star formation rate (SFR) in such gravitationally
contracting clouds by stellar feedback which, rather than keeping the clouds
from collapsing, evaporates and diperses them while they collapse.Comment: 43 pages. Invited chapter for the book "Magnetic Fields in Diffuse
  Media", edited by Elisabete de Gouveia dal Pino and Alex Lazarian. Revised as
  per referee's recommendation
Magnetic Fields in the Milky Way

This chapter presents a review of observational studies to determine the
magnetic field in the Milky Way, both in the disk and in the halo, focused on
recent developments and on magnetic fields in the diffuse interstellar medium.
I discuss some terminology which is confusingly or inconsistently used and try
to summarize current status of our knowledge on magnetic field configurations
and strengths in the Milky Way. Although many open questions still exist, more
and more conclusions can be drawn on the large-scale and small-scale components
of the Galactic magnetic field. The chapter is concluded with a brief outlook
to observational projects in the near future.Comment: 22 pages, 5 figures, to appear in "Magnetic Fields in Diffuse Media",
  eds. E.M. de Gouveia Dal Pino and A. Lazaria
MHD Turbulence, Turbulent Dynamo and Applications

MHD Turbulence is common in many space physics and astrophysics environments.
We first discuss the properties of incompressible MHD turbulence. A
well-conductive fluid amplifies initial magnetic fields in a process called
small-scale dynamo. Below equipartition scale for kinetic and magnetic energies
the spectrum is steep (Kolmogorov -5/3) and is represented by critically
balanced strong MHD turbulence. In this paper we report the basic reasoning
behind universal nonlinear small-scale dynamo and the inertial range of MHD
turbulence. We measured the efficiency of the small-scale dynamo $C_E=0.05$,
Kolmogorov constant $C_K=4.2$ and anisotropy constant $C_A=0.63$ for MHD
turbulence in high-resolution direct numerical simulations. We also discuss
so-called imbalanced or cross-helical MHD turbulence which is relevant for in
many objects, most prominently in the solar wind. We show that properties of
incompressible MHD turbulence are similar to the properties of Alfv\'enic part
of MHD cascade in compressible turbulence. The other parts of the cascade
evolve according to their own dynamics. The slow modes are being cascaded by
Alfv\'enic modes, while fast modes create an independent cascade. We show that
different ways of decomposing compressible MHD turbulence into Alfv\'en, slow
and fast modes provide consistent results and are useful in understanding not
only turbulent cascade, but its interaction with fast particles.Comment: 61 pages, 31 figures, a chapter for "Lecture Notes in Physics", in
  pres
Analysis of Relevant Features for Pollen Classification

Part 9: Feature ExtractionInternational audienceThe correct classification of airborne pollen is relevant for medical treatment of allergies, and the regular manual process is costly and time consuming. Aiming at automatic processing, we propose a set of relevant image-based features for the recognition of top allergenic pollen taxa. The foundation of our proposal is the testing and evaluation of features that can properly describe pollen in terms of shape, texture, size and apertures. In this regard, a new flexible aperture detector is incorporated to the tests. The selected set is demonstrated to overcome the intra-class variance and inter-class similarity in a SVM classification scheme with a performance comparable to the state of the art procedures
Making RSA–PSS Provably Secure against Non-random Faults

International audienceRSA–CRT is the most widely used implementation for RSA signatures. However, deterministic and many probabilistic RSA signatures based on CRT are vulnerable to fault attacks. Nevertheless, Coron and Mandal (Asiacrypt 2009) show that the randomized PSS padding protects RSA signatures against random faults. In contrast, Fouque et al. (CHES 2012) show that PSS padding does not protect against certain non-random faults that can be injected in widely used implementations based on the Montgomery modular multiplication. In this paper, we prove the security of an infective countermeasure against a large class of non-random faults; the proof extends Coron and Mandal's result to a strong model where the adversary can choose the value of the faulty signatures modulo one of the prime factors of the RSA modulus. This fault model is clearly strictly more general than Coron and Mandal's, and it captures most of the non-random faults of Fouque et al. Such non-random faults induce, together with the infective countermeasure, more complex probability distributions than in the original proof; we analyze them using careful estimates of character sums over finite fields. The security proof is formally verified using appropriate extensions of EasyCrypt, and provides the first application of formal verification to provable (i.e. reductionist) security in the context of fault attacks
ICEPOLE: High-speed, hardware-oriented authenticated encryption

This paper introduces our dedicated authenticated encryption scheme ICEPOLE. ICEPOLE is a high-speed hardware-oriented scheme, suitable for high-throughput network nodes or generally any environment where specialized hardware (such as FPGAs or ASICs) can be used to provide high data processing rates. ICEPOLE-128 (the primary ICEPOLE variant) is very fast. On the modern FPGA device Virtex 6, a basic iterative architecture of ICEPOLE reaches 41 Gbits/s, which is over 10 times faster than the equivalent implementation of AES-128-GCM. The throughput-to-area ratio is also substantially better when compared to AES-128-GCM. We have carefully examined the security of the algorithm through a range of cryptanalytic techniques and our findings indicate that ICEPOLE offers high security level
A GRASPxELS for Scheduling of Job-Shop Like Manufacturing Systems and CO2 Emission Reduction

Part 1: Knowledge-Based SustainabilityInternational audienceThe issue of reducing CO2 emission and associated carbon footprint consumption for manufacturing scheduling is addressed. We focus our attention on a job-shop environment where machines can work at different speeds and therefore different energies consumed, i.e. CO2 emissions. It represents an extension of the classical job-shop scheduling problem, where each operation has to be executed by one machine and this machine can work at different speeds, problem which has been introduced by [1]. Energy-efficient scheduling of such type of manufacturing systems demands an optimization approach whose dual objectives are to minimize both the CO2 emissions and the makespan. To solve this new problem, a GRASPxELS is developed. New instances benchmark based on well know Laurence’s instances are introduced and numerical experiments are proposed trying to evaluate the method convergence. The performance is evaluated using the optimal solutions found after a strongly time consuming resolution based on a linear formulation of the problem
Integrated Procurement–Disassembly Problem

Part 1: Knowledge-Based SustainabilityInternational audienceThis paper proposes a novel problem called integrated pro- curement–disassembly problem. The problem combines vehicle routing problem and disassembly line balancing problem for collecting and dis- assembling End-of-Life (EOL) products, respectively. The integration of those problems is motivated by the necessity to reduce total cost in reverse supply chain context. After collecting the EOL products from suppliers, the disassembly process begins to release the demanded parts. The objective function aims to minimize the total cost consisting product collection and opening disassembly workstations. The constraints consider vehicle routing problem to supply the disassembly line with EOL products, disassembly line and balancing inventory coordinating those problems. The decision variables include trips sequences associated to collect the products, disassembly task assignment into workstations, and the inventory level
Programming Integrated Surgical Operations and Preventive Maintenance Activities

Part 2: Knowledge-Based ServicesInternational audienceThe operating theatre (OT) represents a significant component of the technical means centre. This facility is the largest cost and revenue centre. To be efficient, it needs an optimal operational pro- gramme, which takes into account maintenance activi- ties and not only surgical operations. To build such a programme, various methods have been used: mixed integer programming (MIP), three classic heuristics for Bin-Packing and a coupling of the first alterna- tive with a stochastic descent (SD). Then we compare the obtained results from generated data
Managing Requirements: For an Integrated Approach from System Engineering to Project Management

Part 1: Knowledge Discovery and SharingInternational audienceThis paper puts forward several evolutions in methodological approaches to « project management». Firstly, it aims to bring closer the founding models of different engineering approachesincluding systems engineering and project management recommendations to allow fora greater continuity and enhanced management coherence,from beginning to end of the project. It focuses on operating a generic process, called DECWAYS, based on handling management requirements:(1)analyze the requirements to arrive at a complete inventory of the final product ;(2)associate with each one of these requirements ,an « indicator » setting a target objective for completion, supplemented by a risk function detailing the risk at hand based on the deviation relative to this target objective; (3)share and allocate the responsibility for requirements follow-up between the project team leaders; (4) organize and coordinate the follow up of these indicators throughout the product development as proof of a good work management and,(5) finally, validate the total completion of the target objectivesthrough the final prediction/completion conformity of these indicators. Based on this, several operational recommendations are explained and the practicality of DECWAYS embodying these principles is demonstrated using an experimental example for the design/planning of an electronic key