the proceedings contain 19 papers. the topics discussed include: a survey of model-based methods for global optimization;parallel multi-objective evolutionary algorithms;artificial bee colony optimization approach to d...
ISBN:
(纸本)9789612640934
the proceedings contain 19 papers. the topics discussed include: a survey of model-based methods for global optimization;parallel multi-objective evolutionary algorithms;artificial bee colony optimization approach to develop strategies for the iterated prisoner’s dilemma;sensitivity analysis of the bee colony optimization algorithm;experimental algorithmics applied to on-line machine learning;disadvantages of statistical comparison of stochastic optimization algorithms;the impact of quality indicators on the rating of multi-objective evolutionary algorithms;building ensembles of surrogates by optimal convex combination;a heuristic for the job shop scheduling problem;and on the application of complex network analysis for metaheuristics.
In this paper an extensive investigation of the recent status on evaluating reliability of two-terminal networks (i.e., from an input or source S to an output or terminus T) is presented. the algorithms for evaluating...
详细信息
ISBN:
(纸本)9781538619346
In this paper an extensive investigation of the recent status on evaluating reliability of two-terminal networks (i.e., from an input or source S to an output or terminus T) is presented. the algorithms for evaluating the reliability for this type of network can be divided into exact and approximate ones, the approximate ones covering upper and lower bounds as well. the exact algorithms have relied, in their early stages, on the inclusion-exclusion principle applied to the union of all paths from S to T. Using directly the inclusion-exclusion principle however turns out to be toilsome, in the sense that it requires checking a number of cases depending exponentially on the number of paths from S to T. Other examples or categories of exact algorithms include: minimal path/cut enumeration, binary tree methods, brute-force enumeration, decomposition/factoring, reductions and decompositions, and sum of disjoint products. In the case of large networks such algorithms cannot be applied. After establishing theoretically that the reliability of two terminal networks is #P-complete, attention was drawn on approximate algorithms. Here some examples are: Monte Carlo, randomly seeded genetic algorithms, efficient binary tree algorithms (heuristically searching for the most important minimal cuts), as well as many upper and lower bounds. Moore and Shannon introduced in the mid-50's a particular class of two-terminal networks, known as hammock networks, which we shall use as an example. Hammock networks are potentially important to applications in nanoelectronics as well as in biology. We conclude by arguing that radically out-of-the-box approximations and/or bounds are needed if we want to progress towards analyzing biological-sized two-terminal networks.
Martin Kotyrba, Eva Volna, Zuzana Vaclavikova, Michal Janosek, Martin Zacek, Ivan Zelinka; Preface of the 7thinternational Symposium on Intelligent Systems and
Martin Kotyrba, Eva Volna, Zuzana Vaclavikova, Michal Janosek, Martin Zacek, Ivan Zelinka; Preface of the 7thinternational Symposium on Intelligent Systems and
Finding and extracting crypto algorithms in binary code is often a tedious reverse engineering task. A significant amount of manual work is required when unknown implementations are used. this is especially true for m...
详细信息
ISBN:
(纸本)9781467348799;9781467348805
Finding and extracting crypto algorithms in binary code is often a tedious reverse engineering task. A significant amount of manual work is required when unknown implementations are used. this is especially true for malware that contains variants of existing or even completely new algorithms. So far, no flexible and generic crypto detection framework exists that can support analysts in this task. the framework must be able to handle various heuristics that each are ideal to detect specific types of cryptographic algorithms. In addition, a suitable set of heuristics must be selected that can identify a wide range of crypto algorithms from various classes since the type of crypto implemented in a binary is not always known. In this paper, we present the architecture of CIS, the Crypto Intelligence System, that fulfills the requirements for such a framework. Furthermore, we evaluate different heuristics for the real-world usage in the framework. the overall evaluation, using real programs, shows that CIS simplifies the job of an analysts significantly with a high detection and low false positive ratio.
Network function Virtualization (NFV) is a promising technology that decouples network functions from the hardware. Virtual Network functions (VNFs) can form service function chains (SFCs) and be orchestrated like int...
详细信息
In this paper we investigate the relations between knitting and computer science. We show that the two disciplines share many concepts. Computer science, in particular algorithm theory, can suggest a lot of powerful t...
详细信息
ISBN:
(纸本)9783540729136
In this paper we investigate the relations between knitting and computer science. We show that the two disciplines share many concepts. Computer science, in particular algorithm theory, can suggest a lot of powerful tools that can be used both in descriptive and prescriptive ways and that apparently have not yet been used for creative knitting. the obtained results are short (optimal size) recursive descriptions for complex patterns;creation of new complex recursive patterns;and the application of three-valued algebra operations to combine and create a wide variety of new patterns.
the proceedings contain 6 papers. the topics discussed include: physics dependent de-featuring, is it a prerequisite for mesh generation?;the multiscale challenges in modeling fracture of metals;convergent error-contr...
the proceedings contain 6 papers. the topics discussed include: physics dependent de-featuring, is it a prerequisite for mesh generation?;the multiscale challenges in modeling fracture of metals;convergent error-controlled mesh adaptation;direct numerical simulation for 3D imaging;GEOGRAM: a library of geometric algorithms;and variances reduction in random homogenization: special quasirandom structures.
Methods based on Rapidly-exploring Random Trees (RRTs) have been in use in robotics to solve motion planning problems for nearly two decades. On the other hand, in the membrane computing framework, models based on Enz...
详细信息
ISBN:
(纸本)9781538619346
Methods based on Rapidly-exploring Random Trees (RRTs) have been in use in robotics to solve motion planning problems for nearly two decades. On the other hand, in the membrane computing framework, models based on Enzymatic Numerical P systems (ENPS) have been applied to robot controllers. these controllers handle the power of motors according to motion commands usually generated by planning algorithms, but today there is a lack of planning algorithms based on membrane computing for robotics. Withthis motivation, we provide a new variant of ENPS called Random Enzymatic Numerical P systems with Proteins and Shared Memory (RENPSM) addressed to implement RRT algorithms and we illustrate it by presenting a model for path planning of mobile robots based on the bidirectional RRT algorithm. A software for RENPSM has been developed within the Robot Operating System (ROS) and simulation experiments have been conducted by means of the Pioneer 3-DX robot simulation platform.
Locating faults in meshed dc microgrids poses challenges due to low impedance offered by the de network. In this paper, an on-line fault location scheme which can he implemented as an additional feature in a relay is ...
详细信息
ISBN:
(纸本)9781538617892
Locating faults in meshed dc microgrids poses challenges due to low impedance offered by the de network. In this paper, an on-line fault location scheme which can he implemented as an additional feature in a relay is proposed. the algorithm is developed to determine fault location based on voltage and current transients. Both line to line and monopole ground faults are analysed separately and algorithms are developed based on the rate of change of current. Direct short circuit faults are located using transient measurements captured locally, while communication based technique is utilized to locate the impedance faults. the developed fault location technique is also capable of estimating the fault resistance accurately. the algorithm is validated on a +/- 600 V meshed dc grid, for boththe types of faults under wide range of fault impedance at different fault locations.
In the video game "7 Billion Humans", the player is requested to direct a group of workers to various destinations by writing a program that is executed simultaneously on each worker. While the game is quite...
详细信息
暂无评论