Particle Swarm Optimization (PSO) has recently emerged as a nature inspired algorithm for real parameter optimization. this article describes a method for improving the final accuracy and the convergence speed of PSO ...
详细信息
Particle Swarm Optimization (PSO) has recently emerged as a nature inspired algorithm for real parameter optimization. this article describes a method for improving the final accuracy and the convergence speed of PSO by adding a new coefficient to the position updating equation and modulating the inertia weight. this work also mathematically analyzes the effect of this modification on the PSO algorithm. the new algorithm has been shown to be statistically significantly better than four recent variants of PSO on a six functions test suite.
Due to the software aging phenomenon, understanding a program is increasingly difficult. Many high-level analysis methods have been developed to support program comprehension, some of them based on dataflow analysis. ...
详细信息
Due to the software aging phenomenon, understanding a program is increasingly difficult. Many high-level analysis methods have been developed to support program comprehension, some of them based on dataflow analysis. Conventional dataflow analysis infrastructures could be used as a basis to implement these reverse engineering methods. However, none of them meet specific reverse engineering requirements. In this tool demo we introduce MEMBRAIN, a dataflow analysis infrastructure for reverse engineering. A brief insight over this infrastructure is presented along with some essential implementation details. the demo also includes a practical usage example and a performance comparison in order to prove the tool usability.
Collecting entropy from various sources available within a regular PC and combining them in an entropy pool is often used as an alternative to pseudo random number generation. Cheaper than using a hardware true random...
详细信息
Collecting entropy from various sources available within a regular PC and combining them in an entropy pool is often used as an alternative to pseudo random number generation. Cheaper than using a hardware true random number generator (TRNG), this method offers a good approximation of a TRNG, commonly known as an unpredictable random number generator. the source of unpredictability is ultimately the human-computer interaction that, when complex enough, is irreproducible by an adversary. the present paper proposes a novel approach to combining the entropy from various sources in a data flow manner, thus increasing the degree of unpredictability. the result is a highly unpredictable random number generator, of potentially good quality.
Malicious code detection is one of the top subjects of interest for intrusion detection systems in today's computer security research areas. In this paper we propose a new heuristic method for detecting malicious ...
详细信息
Malicious code detection is one of the top subjects of interest for intrusion detection systems in today's computer security research areas. In this paper we propose a new heuristic method for detecting malicious code through system call matching, which also takes in consideration the time of the system call, by using an adaptive search for an extended Aho-Corasick automaton supporting a subset of the regular expressions language, through the use of a normalization technique known as the Bray-Curtis (Sorensen) distance. We will also discuss how this technique can be applied to enrich the set of existing rules from the knowledge base for improving the detection rate.
In this paper, we investigate the sizes of some approximate relational operations results, focusing on join, outer join and difference. We extend the notion of random database, in which the records are random vectors ...
详细信息
In this paper, we investigate the sizes of some approximate relational operations results, focusing on join, outer join and difference. We extend the notion of random database, in which the records are random vectors following a certain probability distribution, to heterogeneous random databases, in which each column can have its own unidimensional distribution. In this framework, we will investigate if the results already existing for the homogeneous databases remain true. Our approach follows three steps. First, we build up the histograms for some relational operations on heterogeneous tables with specific distributions, then we apply the chi square test of goodness of fit and, in the end, we prove the result that sets the limits for which the cardinality of the self-join can be approximated by a Poisson distribution.
In this paper we discuss the idea of combining old-fashioned computer Go with Monte Carlo Go. We introduce an analyze-after approach to random simulations. We also briefly present the other features of our present Mon...
详细信息
In this paper we discuss the idea of combining old-fashioned computer Go with Monte Carlo Go. We introduce an analyze-after approach to random simulations. We also briefly present the other features of our present Monte Carlo implementation with upper confidence trees. We then explain our approach to adding this implementation as a module in the GNU Go 3.6 engine, and finally show some preliminary results of the entire work, ideas for future work and conclusions.
As the field of cybersecurity research evolved in the past decades, machine learning-based approaches for malware identification have become more frequent. the paper proposes a method of identifying which kind of feat...
详细信息
As the field of cybersecurity research evolved in the past decades, machine learning-based approaches for malware identification have become more frequent. the paper proposes a method of identifying which kind of features are the most valuable in terms of creating a machine learning-based model used for Portable Executable (PE) malware detection, taking into consideration the development time needed to extract the information and the quality of the extracted data based on the Fscore. this paper provides guidance in choosing what feature types new researchers should focus on first for achieving good results in detecting malware whether they need to use a small number of features or do not have any limitations regarding this.
Symmetry breaking is a crucial technique to solve many graph problems. However, current state-of-the-art techniques break graph symmetries only partially, causing search algorithms to unnecessarily explore many isomor...
详细信息
ISBN:
(纸本)9781509057085
Symmetry breaking is a crucial technique to solve many graph problems. However, current state-of-the-art techniques break graph symmetries only partially, causing search algorithms to unnecessarily explore many isomorphic parts of the search space. We study properties of perfect symmetry breaking for graph problems. One promising and surprising result on small-sized graphs-up to order five- is that perfect symmetry breaking can be achieved using a compact propositional formula in which each literal occurs at most twice. At least for small graphs, perfect symmetry breaking can be expressed more compactly than the existing (partial) symmetry-breaking methods. We present several techniques to compute and analyze perfect symmetry-breaking formulas.
Partial words have been studied by Blanchet-Sadri et al., but bi-ideals or reccurrent words have been studied for centuries by many researchers. this paper gives a solution for some problems for partial reccurrent wor...
详细信息
ISBN:
(纸本)9781509057085
Partial words have been studied by Blanchet-Sadri et al., but bi-ideals or reccurrent words have been studied for centuries by many researchers. this paper gives a solution for some problems for partial reccurrent words. this paper gives an algorithm for a given finitely generated bi-ideal, how to construct a new basis of ultimately finitely generated bi-ideal, which generates the same given bi-ideal. the paper states that it is always possible to find a basis for a given finitely generated bi-ideal. the main results of this paper are presented in third section. At first, we show that if two irreduciable bi-ideals are different, they will differ in infinitely many places. this led to the statement that it is possible to fill the finite number of holes for a given finitely generated bi-ideal, but a counterexample shows that it is not possible for infinitely many holes.
the computation of self-intersection loci of parametrized surfaces is needed for constructing trimmed parametrizations and describing the topology of the considered surfaces in real settings. this paper presents two g...
详细信息
the computation of self-intersection loci of parametrized surfaces is needed for constructing trimmed parametrizations and describing the topology of the considered surfaces in real settings. this paper presents two general and efficient methods for determining self-intersection loci of rationally parametrized surfaces. One of the methods, based on regular systems, is capable of computingthe exact parametric locus of self-intersection of a given surface and the other, based on Grobner bases, can compute the minimal variety passing through the exact parametric locus. the relation between the results computed by the two methods is established and two algorithms for computing parametric loci of self-intersection are described. Experimental results and comparisons with some existing methods show that our algorithms have a good performance for parametrized surfaces.
暂无评论