Abstract: In this article authors propose the analysis of the main information security audit methods: the active audit, the expert audit and the audit on conformity with standards applying SWOT-analysis. After this analysis authors make the suggestions for the future work in this area.

Keywords: information security, audit, threat, vulnerability, audit method, SWOT- analysis.

Link:

METHODS OF ANALYSIS FOR THE INFORMATION SECURITY AUDIT

Natalia Ivanova, Olga Korobulina, Pavel Burak

http://foibg.com/ibs_isc/ibs-18/ibs-18-p17.pdf

Abstract: The article describes a “native” algorithm for getting packet forwarding decision, based on considering a network to be an ionic gas. Therefore necessity for the information becomes a field intensity, with distribution function gradient showing the best forwarding way to bring the system to a minimal energy state and all the nodes having an equal information set. The proposed algorithm can be optimized on any of function parameters versus metrics only in classic routing algorithm.

Keywords: Packet forwarding, Boltzmann equation, Vlasov equation, Thermal grid, Kinetic algorithm

ACM Classification Keywords: C.2.2 Network Protocols - Routing protocols

Link:

OPTIMIZING ROUTING PROCESS WITH A KINETIC METHOD

Olexandr Kuzomin, Ievgen Kozlov

http://foibg.com/ibs_isc/ibs-18/ibs-18-p16.pdf

Abstract: Today together with actual designing and tests it is often used virtual methods of designing, which support prior calculations of parameters of the developed devices. Such parameters include reliability. For this purpose the virtual laboratory for computer-aided design, which is developed during joint project by V.M. Glushkov Institute of Cybernetics of NAS of Ukraine and Institute of Mathematics and Informatics of BAS, contains program unit for calculating reliability parameters of separate microelectronic components and whole devices. The program unit work is based on two computing method: the first one uses exponential distribution of failure probability and the second one – DN-distribution of failure probability. Presence of theoretical materials, computing methods description and other background materials lets to use this program unit not only for designing and scientific researches, but also in education process.

Keywords: Virtual Laboratory; Computer-Aided? Design; Reliability Calculation; Distributed System.

ACM Classification Keywords: J.6 Computer-Aided? Engineering – Computer-Aided? Design (CAD); K.4.3 Organizational Impacts – Computer-Supported? Collaborative Work.

Link:

CALCULATING OF RELIABILITY PARAMETERS OF MICROELECTRONIC COMPONENTS AND DEVICES BY MEANS OF VIRTUAL LABORATORY

Oleksandr Palagin, Peter Stanchev, Volodymyr Romanov, Krassimir Markov, Igor Galelyuka, Vitalii Velychko, Oleksandra Kovyriova, Oksana Galelyuka, Iliya Mitov, Krassimira Ivanova

http://foibg.com/ibs_isc/ibs-18/ibs-18-p15.pdf

Abstract: This paper presents a framework for distributed results in SOA environment. These distributed results are partially produced by a service and passed to a client program on demand. This approach is a novelty in SOA technology. Motivations for this new design is figured out and a sketch of implementation is outlined. A configuration for the new tool is suggested and finally its efficiency is compared to a conventional web service implementation.

Keywords: SOA, multiresulting, client-server, web services.

ACM Classification Keywords: D.2.11 Software Architectures

Link:

SOA PROTOCOL WITH MULTIRESULTING

Michał Plewka, Roman Podraza

http://foibg.com/ibs_isc/ibs-18/ibs-18-p14.pdf

Abstract: A system approach to estimation of guaranteed safe operation of complex engineering systems is proposed. The approach is based on timely and reliable detection, estimation, and forecast of risk factors and, on this basis, on timely elimination of the causes of abnormal situations before failures and other undesirable consequences occur. The principles that underlie the strategy of the guaranteed safety of CES operation provide a flexible approach to timely detection, recognition, forecast, and system diagnostic of risk factors and situations, to formulation and implementation of a rational decision in a practicable time within an unremovable time constraint.

Keywords: system approach, time constraints, multiple-factor l risks, abnormal mode, diagnostics, survivability, serviceability, safety

ACM Classification Keywords: H.4.2. INFORMATION SYSTEM APPLICATION: type of system strategy Conference topic: Applied Program Systems

Link:

SYSTEM APPROACH TO ESTIMATION OF GUARANTEED SAFE OPERATION OF COMPLEX ENGINEERING SYSTEMS

Nataliya Pankratova

http://foibg.com/ibs_isc/ibs-18/ibs-18-p13.pdf

Abstract: A novel approach to power reduction in VLSI arrays is proposed. This approach includes recognition of the similarities in architectures and power profiles of different types of arrays, adaptation of methods developed for one on others and component sharing when several arrays are embedded in the same system and mutually operated. Two types of arrays are discussed: Image Sensor pixel arrays and SRAM bitcell arrays. For both types of arrays, architectures and major sources of power consumption are presented and several examples of power reduction techniques are discussed. Similarities between the architectures and power components of the two types of arrays are displayed. A number of peripheral sharing techniques for systems employing both Image Sensors and SRAM arrays are proposed and discussed. Finally, a practical example of a smart image sensor with an embedded memory is given, using an Adaptive Bulk Biasing Control scheme. The peripheral sharing and power saving techniques used in this system are discussed. This example was implemented in a standard 90nm CMOS process and showed a 26% leakage reduction as compared to standard systems.

Keywords: VLSI Arrays, SRAM, Smart Image Sensors, Low Power, AB2C.

ACM Classification Keywords: B.3.1 Semiconductor Memories - SRAM, B.6 Logic Design – Memory Control and Access, B.7 Integrated Circuits – VLSI, E.1 Data Structures – Arrays, I.4.1 Digitization and Image Capture

Link:

LARGE VLSI ARRAYS – POWER AND ARCHITECTURAL PERSPECTIVES

Adam Teman, Orly Yadid-Pecht? and Alexander Fish

http://foibg.com/ibs_isc/ibs-18/ibs-18-p12.pdf

Abstract: The problem statement of disaster risk assessment, based on heterogeneous information (from satellites and in-situ data, and modelling data) is proposed, the problem solving method is grounded and considers its practical use for risk assessment of flooding in Namibia. The basis of the method is the ensemble approach to the heterogeneous data analysis with the use of the data fusion techniques and evaluation the probability density function of a natural disaster using this method.

Keywords: risk assessment, natural disasters, geospatial data, remote sensing, data fusion, ensemble data processing, probability density function, parametric statistics, maximum likelihood classifier, neural network classifier

ACM Classification Keywords: I.5 PATTERN RECOGNITION - I.5.1 Models – Neural nets; G.1 NUMERICAL ANALYSIS - G.1.8 Partial Differential Equations - Inverse problems; F. Theory of Computation - F.1.1 Models of Computation - Probabilistic computation; G.4 MATHEMATICAL SOFTWARE - Parallel and vector implementations; H. Information Systems - H.3 INFORMATION STORAGE AND RETRIEVAL - H.3.5 Online Information Services; I.4 IMAGE PROCESSING AND COMPUTER VISION - I.4.6 Segmentation - Pixel classification; I.4.8 Scene Analysis - Sensor fusion; J. Computer Applications - J.2 PHYSICAL SCIENCES AND ENGINEERING - Earth and atmospheric sciences

Link:

FLOOD RISK ASSESSMENT BASED ON GEOSPATIAL DATA

Nataliia Kussul, Sergii Skakun, Andrii Shelestov, Yarema Zyelyk

http://foibg.com/ibs_isc/ibs-18/ibs-18-p11.pdf

Abstract: Current status and perspectives of an interdisciplinary knowledge domain including informatics, computer science, control theory, and IT applications were analyzed. Scientific-and-methodological and applied problems of IT integration with existing and future industrial and socio-economical structures were stated.

Keywords: computer science, informatics, cybernetics, control theory, information technologies, control systems, information systems, industrial applications

ACM Classification Keywords: A.0 General Literature - Conference proceedings

Link:

INFLUENCE ANALYSIS OF INFORMATION TECHNOLOGIES ON PROGRESS IN CONTROL SYSTEMS FOR COMPLEX OBJECTS

Boris Sokolov, Rafael Yusupov, Michael Okhtilev, Oleg Maydanovich

http://foibg.com/ibs_isc/ibs-18/ibs-18-p10.pdf

Abstract. The article discusses the implementation of decision support systems in the selection of the type of sustainable development building that best suits the criteria of all the participants in the decision making prosess – investors, clients and the local government.

Keywords: green building, decision support systems, sustainability

Link:

USING THE GROUP MULTICHOICE DECISION SUPPORT SYSTEM FOR SOLVING SUSTAINABLE BUILDING PROBLEMS

Filip Andonov, Mariana Vassileva

http://foibg.com/ibs_isc/ibs-18/ibs-18-p09.pdf

Abstract: Different models of the source with side information can be considered when side information is known to the encoder, the decoder, both of them, none of them. In this paper, we investigate a generalized model of the discrete memoryless source with two-sided state information introduced by Cover and Chiang in Cover-Chiang, 2002, which includes the data compression problems mentioned above as special cases. We study the ratereliability- distortion function, which is understood as the minimum code rate for the encoding of the source messages under the requirement that the decoder reconstructs the messages at a desired distortion level with the error probability exponentially decreasing with the codeword length. In other words, the rate is considered as a function of a fixed distortion level and the error exponent. In this paper the upper bound on the rate-reliabilitydistortion function is obtained. The upper bounds on rate-reliability-distortion functions of the source with side information are derived as special cases for four possible situations - one of which coincides with known result while the three others were unknown.

Keywords: source with side information, rate-reliability-distortion function

ACM Classification Keywords: H.0 Information Systems - Conference proceedings

Link:

UPPER BOUND ON RATE-RELIABILITY-DISTORTION FUNCTION FOR SOURCE WITH TWO-SIDED STATE INFORMATION

Mariam Haroutunian, Arthur Muradyan

http://foibg.com/ibs_isc/ibs-18/ibs-18-p08.pdf

Abstract: An application oriented class of partially ordered sets is considered. Let P(n,k) denotes the set of all k -tuples with strictly increasing elements from the set N  {1,2,,n} and 1  k  n . Some properties of P(n,k) is studied in terms of partially ordered sets. An algorithm that constructs a set of non intersecting increasing chains that cover all elements of P(n,3) is brought. The number of these chains is the minimal possible: it equals to the width of P(n,3) , i.e. the largest cardinality of an antichain. Analogous to the Hansel’s well known algorithm for identification of monotone Boolean functions, the chains constructed for P(n,3) can be used for identification of monotone functions defined on P(n,3) .

Keywords: partially ordered sets, chain split.

ACM Classification Keywords: G.2.1 Discrete mathematics: Combinatorics

Link:

CHAIN SPLIT OF PARTIALLY ORDERED SET OF K-SUBSETS

Hasmik Sahakyan, Levon Aslanyan

http://foibg.com/ibs_isc/ibs-18/ibs-18-p07.pdf

Abstract: Synthetic biology is an emerging discipline that combines knowledge from various disciplines including molecular biology, engineering, and mathematics to design biological devices whose goal is to extend or modify the behavior of organisms and engineer them to achieve desired functions for broad applications. This paper provides a brief survey about the methods for altering the behavior of individual elements and the construction of complex networks in single-cell. In this review, we shown and analyze the recent advances in synthetic biology towards engineering complex living single-cell by designing genetic circuits to perform new tasks in bacteria behavior. Keywords: Synthetic biology, bacterial engineering, bacterial computation, natural computing

Link:

BACTERIAL TECHNOLOGY TO BUILD COMPUTERS: A SURVEY

Paula Cordero, Sandra Gómez, Rafael Gonzalo

http://foibg.com/ibs_isc/ibs-18/ibs-18-p06.pdf

Abstract: The detection and treatment of collisions has been the subject of study for many years, periodically appear new techniques and algorithms to solve. it This article presents a hardware alternative to the detection of collisions between two or more surfaces in real time taking advantage of the parallelism offered by FPGAs, applying on a Spanish billiard of three balls simulator. FPGAs (Field-Programming Gate Array) provide a highly flexible environment for the programmer, since its cells can be reprogrammed and executed with great ease, which allows them to be used for an enormous range of applications.

Keywords: Collision detect, 2D Graphics

ACM Classification Keywords: I.6. Simulation and Modelling, I.3 Computer Graphics

Link:

COLLISION DETECTION AND TREATMENT USING 2D RECONFIGURABLE HARDWARE

Alejandro Figueroa, Gustavo Méndez, Francisco J. Cisneros, Adriana Toni

http://foibg.com/ibs_isc/ibs-18/ibs-18-p05.pdf

Abstract: Transition P systems are a computational model based on the basic features of biological membranes and in the observation of biochemical processes. In this model, a membrane contains object multisets, which evolve following a determine set of evolution rules. The system changes from an initial configuration to another one performing a computation by applying these rules in a non-deterministic maximally parallel way. Previous works about the rule application algorithms follow a common pattern: to choose a rule applicable on the objects multiset, and to apply that rule a number of times. This pattern is repeated until there is no applicable rule. In this paper, we present an algorithm that proposes a new approach that consists of the following steps: (i) To analyze the antecedent rules to establish the applicability domains; (ii) to select some applicable rules depending on the objects multiset available inside the membrane. Unlike previous algorithms, this new approach always selects an applicable rule in each iteration, avoiding iterations with non-applicable rules. In addition, this is a bounded algorithm, which is a necessary condition that facilitates decision-making in membrane architecture design.

Keywords: Natural Computing, Membrane computing, Transition P System, Rules Application Algorithms.

ACM Classification Keywords: D. Software. D.1 Programming Techniques

Link:

A BOUNDED ALGORITHM BASED ON APPLICABILITY DOMAINS FOR THE APPLICATION OF ACTIVE RULES IN TRANSITION P-SYSTEMS

F. Javier Gil, Jorge A. Tejedor, Luis Fernández

http://foibg.com/ibs_isc/ibs-18/ibs-18-p04.pdf

Abstract: This paper presents a study about the time of the communication phase of the P System implemented as software. After presenting the membranes as software components, is studied how communicate with each other, running on the same processor or another. We study the times and delays that occur if communication takes place via network. It presents the theoretical formulas governing the study, empirical studies, and adjustment factors which depend on communications. Finally, some examples that show facts for some P System; the distribution of membranes on several computers improves global times.

Keywords: P System, Membrane Systems, and Natural Computation.

ACM Classification Keywords: F.1.2 Modes of Computation, I.6.1 Simulation Theory, H.1.1 Systems and Information Theory

Link:

COMMUNICATION LATENESS IN SOFTWARE MEMBRANES

Miguel Angel Peña, Jorge Tejedor, Juan B. Castellanos, Ginés Bravo

http://foibg.com/ibs_isc/ibs-18/ibs-18-p03.pdf

Abstract: Membrane computing is a recent area that belongs to natural computing. This field works on computational models based on nature's behavior to process the information. Recently, numerous models have been developed and implemented with this purpose. P-systems are the structures which have been defined, developed and implemented to simulate the behavior and the evolution of membrane systems which we find in nature. However no other technology has been used to simulate the behavior of the living cells. In this paper we present a proposal for a set of reactive robots that receives, process and learn from the living cells through the use of p-systems. When analyzing the properties of the proposed robot. we realize that we get interesting points compared to traditional p-systems.

Keywords: Autonomous robots, membrane computing, p-systerms, artificial intelligence.

Link:

INTELLIGENT P-SYSTEMS

Alberto Arteta , Angel Luis Castellanos, Jose Luis Sanchez

http://foibg.com/ibs_isc/ibs-18/ibs-18-p02.pdf

Abstract: As an example, we benchmark the Particle Swarm Optimization algorithm with a Differential Evolution on the noisefree Black Box Optimization Benchmark 2010 testbed. Each candidate solution is sampled uniformly in −5, 5 D , where D denotes the search space dimension, and the evolution is performed with a classical PSO algorithm and a classical DE/x/1 algorithm according to a random threshold. The maximum number of function evaluations is chosen as 105 times the search space dimension. This paper shows how to evaluate the performance of a given optimization algorithm a using the BBOB 2010.

Keywords: Benchmarking, Black-box optimization, Direct search, Evolutionary computation, Particle Swarm Optimizacin, Differential Evolution

Categories: G.1.6 Numerical Analysis: Optimization-global optimization, unconstrained optimization ; F.2.1 Analysis of Algorithms and Problem Complexity: Numerical Algorithms and Problems.

Link:

BENCHMARK OF PSO-DE USING BBOB 2010

Nuria Gómez Blas, Luis F. de Mingo

http://foibg.com/ibs_isc/ibs-18/ibs-18-p01.pdf

Abstract: Structure, behaviour and properties of acyclic programs are investigated in methodological and mahematical framework of compositional programming. Relations of acyclic programs to sequantial-parallel and chain programs (defined in the previous authors’ papers) are investigated: any acyclic program can be transformed to an equivalent sequential-parallel program with extra usages of basic subroutines but without extra names (informally, enlarging the executable code but not enlarging data); acyclic program can be transformed to an equivalent chain program with extra names but without extra basic sunroutine usages (informally, this enlarges data but does not not enlarge the executable code); sequential composition of two acyclic programs can be thansformed to an equivalent acyclic program with either complex internal interconnections (though without extra subroutines) or with one additional subroutine (though with simple interconnections).

Keywords: sequential composition, parallel composition, compositional programming, nominal function, acyclic program, sequential and parallel compositions.

ACM Classification Keywords: D.1.4 Sequential Programming, D.2.4 Software/Program Verification, F.3.2 Semantics of Programming Languages.

Link:

SOME PROPERTIES OF ACYCLIC COMPOSITIONAL PROGRAMS

Tetiana Parfirova, Vadim Vinnik

Abstract: Estimating of the Hurst exponent for experimental data playas a very important role in research of processes which show properties of self-affinity. There are many methods for estimating the Hurst exponent using time series. The aim of this work is to carry out the comparative analysis of statistical properties of estimates of the Hurst exponent obtained by different methods using short length model fractal time series (the number of values less than 4000). In the work the most common used methods for estimating the Hurst exponent are researched. They are: R / S -analysis, variance-time analysis, detrended fluctuation analysis (DFA) and wavelet-based estimation. The fractal Brownian motion that is constructed using biorthogonal wavelets has been chosen as a model random process which exhibit fractal properties. In the work the results of a numerical experiment are represented where the fractal Brown motion was modelled for the specified values of the exponent H. The values of Hurst exponent for the model realizations were varied within the whole interval of possible values 0 < H < 1.The lengths of the realizations were defined as 500, 1000, 2000 and 4000 values. The estimates of H were calculated for each generated time series using the methods mentioned above. Samples of estimates of the exponent H were obtained for each value of H and their statistical characteristics were researched. The results of the analysis have shown that the estimates of the Hurst exponent, which were obtained for the realisations of short length using the considered methods, are biased normal random variables. For each method the bias depends on the true value of degree of self-similarity of a process and a length of time series. Those estimates which are obtained by the DFA method and the wavelet transform have the minimal bias. Standard deviations of the estimates depend on the estimation method and decrease while the length of the series increases. Those estimates which are obtained by using the wavelet analysis have the minimal standard deviation.

Keywords: Hurst exponent, estimate of the Hurst exponent, self-similar stochastic process, time series, methods for estimating the Hurst exponent

ACM Classification Keywords: G.3 Probability and statistics - Time series analysis , Stochastic processes, G.1 Numerical analysis, G.1.2 Approximation - Wavelets and fractals

Link:

COMPARATIVE ANALYSIS OF STATISTICAL PROPERTIES OF THE HURST EXPONENT ESTIMATES OBTAINED BY DIFFERENT METHODS

Ludmila Kirichenko, Tamara Radivilova

http://foibg.com/ibs_isc/ibs-19/ibs-19-p56.pdf

Abstract: In this paper the Hamiltonian Rural Postman Problem is generalization of the Hamiltonian Travelling Salesman Problem is described. The offered modification of a classical method (Little’s method) allows to find exact solution of the Hamilton Rural Postman Problem or to detect that the task is unsolvable.

Keywords: Hamiltonian Rural Postman Problem, Hamiltonian cycle, branch and bound algorithm, Hamiltonian Traveling Salesman Problem

ACM Classification Keywords: G.2.2 - Mathematics of Computing - Discrete Mathematics - Graph Theory - Path and circuit problems

Link:

MODIFIED BRANCH AND BOUND ALGORITHM FOR SOLVING THE HAMILTONIAN RURAL POSTMAN PROBLEM

Andriy Morozov, Anatoliy Panishev

http://foibg.com/ibs_isc/ibs-19/ibs-19-p55.pdf

Abstract: Searching for cycling routes of minimum cost is an urgent task of transport nets designing, traffic flows routing, etc. Each locality, transport node can be the vertex of the graph, and each cut line, linking localities, − the edge of the graph. The edge’s cost represents distance, repair cost, channel bandwidth, circuit resistance, etc. If closed route reaches all vertexes of the graph exactly once, it is called Hamiltonian cycle (HC), and the task of searching for minimum cost is the Hamiltonian Traveling Salesman’s Problem (HTSP). HTSP is NP-hard and not always has a solution Майника, 1981. Algorithms delivering optimum to HTSP are described as an exhaustive search reduction. If restriction of visiting only once every vertex is taken off, then such task can be called Common Traveling Salesman Problem (CTSP). Besides completeness of the route is an additional restriction for this task. CTSP seems the generalization of HTSP Бондаренко, 2004. For every linked graph always the CTSP’s set of solutions is not empty, and it allows using approximate algorithms and heuristics. The authors have no data about exact methods, bringing optimum of closed CTSP. This article offers exact algorithm of CTSP solution, bringing the cycle of minimum cost, which includes all vertexes of the graph at least once and contains the less number of edges.

Keywords: TSP, Traveling Salesman Problem, Hamiltonian cycle, closed route, optimal route, exact algorithm.

ACM Classification Keywords: Algorithms, Theory.

Link:

CYCLE ROUTES OPTIMIZATION FOR NOT FULL GRAPH

Anatoly Panishev, Anton Levchenko

http://foibg.com/ibs_isc/ibs-19/ibs-19-p54.pdf

Аннотация: Статья посвящена некоторым вопросам теории мультимножеств. Введены основные определения, касающиеся теории мультимножеств. Построена решетка мультимножеств. Показана роль законов поглощения при построении решетки мультимножеств. Кроме того, частичное упорядоченное множество мультимножеств вложено в две полные решетки, одна из которых построена путем обобщения понятия мультимножества (допускается бесконечная кратность элементов основы).

Ключевые слова: мультимножество, решетка мультимножеств, полная решетка мультимножеств.

ACM Classification Keywords: F.4.1 Mathematical Logic, G.2.1 Combinatorics, H.2.4 Systems – Relational databases.

Link:

СТРУКТУРА ЧАСТИЧНО УПОРЯДОЧЕННОГО СЕМЕЙСТВА МУЛЬТИМНОЖЕСТВ

Дмитрий Буй, Юлия Богатырёва

http://foibg.com/ibs_isc/ibs-19/ibs-19-p48.pdf

Abstract: Application of Pareto optimization based method of solving observability problem in aerodynamics is developed and considered. The error distribution of derivative approximation is investigated. The method takes into account the distribution of derivative approximation error. Systems with linear control are considered. The software for observation problem solving and research of considered method is developed and described. Results of method investigation with different data errors on generated data and on real flight data are given.

Keywords: Observability problem, Pareto optimization, aerodynamics, derivative approximation.

ACM Classification Keywords: I.6 Simulation and Modeling

Link:

APPLICATION OF PARETO OPTIMIZATION APPROACH TO OBSERVABILITY PROBLEM IN LINEAR AERODYNAMIC MODELS

Andriy Zavorotnyy, Veda Kasyanyuk

http://foibg.com/ibs_isc/ibs-19/ibs-19-p53.pdf

Abstract: In the paper the constrained folding problem is investigated for programmable logic array (PLA) of special architecture type. Constraints applied to folding are given which are imposed by the used PLA structural features A PLA simple folding algorithm is presented which takes into account the PLA structure peculiarities.

Keywords: design automation, area optimization, PLA structure folding.

ACM Classification Keywords: B.6.3 Logic Design: Design Aids – Optimization; B.7.2 Integrated circuits: Design Aids –Layout. Conference topic: Mathematical methods research of complex systems.

Link:

SIMPLE CONSTRAINED FOLDING OF PROGRAMMABLE LOGIC ARRAYS OF SPECIAL TYPE

Liudmila Cheremisinova, Irina Loginova

http://foibg.com/ibs_isc/ibs-19/ibs-19-p52.pdf

Abstract: The problem under consideration is to reduce the area of the layout of regular VLSI structures by means of their folding. A novel reformulation of the folding problem as the Boolean satisfiability problem solved with any standard SAT-solver is proposed. The method is developed that allows creating a Boolean equation presenting folding problem in CNF form.

Keywords: design automation, area optimization, VLSI structure folding.

ACM Classification Keywords: B.6.3 Logic Design: Design Aids – Optimization; B.7.2 Integrated circuits: Design Aids –Layout.

Link:

MULTIPLE FOLDING OF VLSI REGULAR STRUCTURE VIA BOOLEAN SATISFIABILITY

Liudmila Cheremisinova

http://foibg.com/ibs_isc/ibs-19/ibs-19-p51.pdf