scholarly journals An Efficient Algorithm for the Split K-Layer Circular Topological Via Minimization Problem

VLSI Design ◽  
1996 ◽  
Vol 4 (1) ◽  
pp. 41-51
Author(s):  
J. S. Huang ◽  
Y. H. Chin
Keyword(s):  
Heuristic Algorithm ◽  
Minimization Problem ◽  
Efficient Algorithm ◽  
Optimal Solution ◽  
Experimental Results ◽  
Optimal Solutions ◽  
General Will

The split k-layer (k ≥ 2) circular topological via minimization (k-CTVM) problem is reconsidered here. The problem is finding a topological routing of the n nets, using k available layers, such that the total number of vias is minimized. The optimal solution of this problem is solved in O(n2k+1) time. However, such an algorithm is inefficient even for n ≥ 8 and k ≥ 2. A heuristic algorithm with complexity of O(k n4) is presented. When the experimental results of this algorithm and that of an exhaustive algorithm are compared, the same number of optimal solutions is obtained from this heuristic algorithm for all permutations of 1) n = 8 with k = 2 or 3, and 2) n = 10 with k = 3. For other cases, the number of optimal solutions from this algorithm depends on the permutations been selected; and this number, in general, will increase as k increases.

Research on Second Distribution of Real Value Detectors Based on Heuristic Movement

2014 ◽  
Vol 1049-1050 ◽  
pp. 1506-1513
Author(s):  
Tian Bo Wang ◽  
Feng Bin Zhang ◽  
Chun He Xia
Keyword(s):  
Theoretical Analysis ◽  
Anomaly Detection ◽  
Heuristic Algorithm ◽  
Negative Selection ◽  
Optimal Solution ◽  
Detection Algorithm ◽  
Experimental Results ◽  
Generalization Ability ◽  
Real Value ◽  
Omission Rate

Traditional anomaly detection algorithm has improved to some degree the mechanism of negative selection. However, there still remain many problems such as the randomness of detector generation, incompleteness of self-set and the generalization ability of detectors, which would cause a lot of loopholes in non-self-space. This paper proposes a heuristic algorithm based on the second distribution of real value detectors for the remains of loopholes of the non-self-space in the first distribution. The algorithm proposed can distribute real value detectors through omission data based on the methods of partition and movement. A method is then proposed to solve the problem on how to get the optimal solution to the parameters related in the algorithm. Theoretical analysis and experimental results prove the universality and effectiveness of the method. It is found that the algorithm can effectively avoid the generation of loopholes and thus reduce the omission rate of detector sets.

Salp swarm algorithm with crossover scheme and Lévy flight for global optimization

2021 ◽  
pp. 1-12
Author(s):  
Heming Jia ◽  
Chunbo Lang
Keyword(s):  
Global Optimization ◽  
Heuristic Algorithm ◽  
Experimental Results ◽  
High Dimensional ◽  
Lévy Flight ◽  
Test Functions ◽  
Levy Flight ◽  
Salp Swarm Algorithm ◽  
Swarm Algorithm ◽  
Accuracy And Stability

Salp swarm algorithm (SSA) is a meta-heuristic algorithm proposed in recent years, which shows certain advantages in solving some optimization tasks. However, with the increasing difficulty of solving the problem (e.g. multi-modal, high-dimensional), the convergence accuracy and stability of SSA algorithm decrease. In order to overcome the drawbacks, salp swarm algorithm with crossover scheme and Lévy flight (SSACL) is proposed. The crossover scheme and Lévy flight strategy are used to improve the movement patterns of salp leader and followers, respectively. Experiments have been conducted on various test functions, including unimodal, multimodal, and composite functions. The experimental results indicate that the proposed SSACL algorithm outperforms other advanced algorithms in terms of precision, stability, and efficiency. Furthermore, the Wilcoxon’s rank sum test illustrates the advantages of proposed method in a statistical and meaningful way.

scholarly journals A Multi-Resolution Approach to GAN-Based Speech Enhancement

2021 ◽  
Vol 11 (2) ◽  
pp. 721
Author(s):  
Hyung Yong Kim ◽  
Ji Won Yoon ◽  
Sung Jun Cheon ◽  
Woo Hyun Kang ◽  
Nam Soo Kim
Keyword(s):  
Speech Enhancement ◽  
Optimal Solution ◽  
Experimental Results ◽  
Generative Adversarial Networks ◽  
The Real ◽  
Multi Scale ◽  
Adversarial Networks ◽  
Speech Characteristics ◽  
Conventional Methods ◽  
Convex Property

Recently, generative adversarial networks (GANs) have been successfully applied to speech enhancement. However, there still remain two issues that need to be addressed: (1) GAN-based training is typically unstable due to its non-convex property, and (2) most of the conventional methods do not fully take advantage of the speech characteristics, which could result in a sub-optimal solution. In order to deal with these problems, we propose a progressive generator that can handle the speech in a multi-resolution fashion. Additionally, we propose a multi-scale discriminator that discriminates the real and generated speech at various sampling rates to stabilize GAN training. The proposed structure was compared with the conventional GAN-based speech enhancement algorithms using the VoiceBank-DEMAND dataset. Experimental results showed that the proposed approach can make the training faster and more stable, which improves the performance on various metrics for speech enhancement.

scholarly journals Temporal concatenation for Markov decision processes

2021 ◽  
pp. 1-28
Author(s):  
Ruiyang Song ◽  
Kuang Xu
Keyword(s):  
Markov Decision Processes ◽  
Large Scale ◽  
Optimal Solution ◽  
Upper Bounds ◽  
Black Box ◽  
Decision Processes ◽  
Optimal Solutions ◽  
Wide Range ◽  
Markov Decision ◽  
Speed Up

We propose and analyze a temporal concatenation heuristic for solving large-scale finite-horizon Markov decision processes (MDP), which divides the MDP into smaller sub-problems along the time horizon and generates an overall solution by simply concatenating the optimal solutions from these sub-problems. As a “black box” architecture, temporal concatenation works with a wide range of existing MDP algorithms. Our main results characterize the regret of temporal concatenation compared to the optimal solution. We provide upper bounds for general MDP instances, as well as a family of MDP instances in which the upper bounds are shown to be tight. Together, our results demonstrate temporal concatenation's potential of substantial speed-up at the expense of some performance degradation.

The Location Problem of Given and Indivisible Different Units

1970 ◽  
Vol 2 (3) ◽  
pp. 341-356
Author(s):  
G. Jándy
Keyword(s):  
Exact Solution ◽  
Heuristic Algorithm ◽  
Network Flow ◽  
Location Problem ◽  
Optimal Solution ◽  
Type Problem ◽  
Distribution Problem ◽  
Enumeration Algorithm ◽  
Weighted Distribution ◽  
Partial Enumeration

In cases where certain simplifications are allowed, the location optimisation of given and indivisible different economic units may be modelled as a bi-value weighted distribution problem. The paper presents a heuristic algorithm for this network-flow-type problem and also a partial enumeration algorithm for deriving the exact solution. But it is also pointed out that an initial sub-optimal solution can quickly be improved with a derivation on a direct line only, if the exact solution is not absolutely essential. A numerical example is used to illustrate the method of derivation on a direct line starting with an upper bound given by a sub-optimal solution.

Application of Immune Genetic Algorithm in Survey Data Processing

2012 ◽  
Vol 241-244 ◽  
pp. 1737-1740
Author(s):  
Wei Chen
Keyword(s):  
Genetic Algorithm ◽  
Immune System ◽  
Data Processing ◽  
Survey Data ◽  
Heuristic Algorithm ◽  
Experimental Results ◽  
Immune Genetic Algorithm ◽  
Basic Principles ◽  
Immune Operator ◽  
Biological Immune System

The immune genetic algorithm is a kind of heuristic algorithm which simulates the biological immune system and introduces the genetic operator to its immune operator. Conquering the inherent defects of genetic algorithm that the convergence direction can not be easily controlled so as to result in the prematureness；it is characterized by a better global search and memory ability. The basic principles and solving steps of the immune genetic algorithm are briefly introduced in this paper. The immune genetic algorithm is applied to the survey data processing and experimental results show that this method can be practicably and effectively applied to the survey data processing.

FINITELY SUBSEQUENTIAL TRANSDUCERS

2003 ◽  
Vol 14 (06) ◽  
pp. 983-994 ◽  
Author(s):  
CYRIL ALLAUZEN ◽  
MEHRYAR MOHRI
Keyword(s):  
Speech Recognition ◽  
Finite Number ◽  
Efficient Algorithm ◽  
Experimental Results ◽  
Theoretical Formulation ◽  
Large Vocabulary ◽  
Finite State Transducers ◽  
Finite State ◽  
Large Vocabulary Speech Recognition

Finitely subsequential transducers are efficient finite-state transducers with a finite number of final outputs and are used in a variety of applications. Not all transducers admit equivalent finitely subsequential transducers however. We briefly describe an existing generalized determinization algorithm for finitely subsequential transducers and give the first characterization of finitely subsequentiable transducers, transducers that admit equivalent finitely subsequential transducers. Our characterization shows the existence of an efficient algorithm for testing finite subsequentiability. We have fully implemented the generalized determinization algorithm and the algorithm for testing finite subsequentiability. We report experimental results showing that these algorithms are practical in large-vocabulary speech recognition applications. The theoretical formulation of our results is the equivalence of the following three properties for finite-state transducers: determinizability in the sense of the generalized algorithm, finite subsequentiability, and the twins property.

scholarly journals Neutrosophic Number Optimization Models and Their Application in the Practical Production Process

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Angyan Tu ◽  
Jun Ye ◽  
Bing Wang
Keyword(s):  
Production Process ◽  
Optimal Solution ◽  
Optimization Models ◽  
Optimal Solutions ◽  
Practical Applications ◽  
Linear And Nonlinear Programming ◽  
Constrained Conditions ◽  
Minimum Objective Function ◽  
Maximum Minimum ◽  
Neutrosophic Number

In order to simplify the complex calculation and solve the difficult solution problems of neutrosophic number optimization models (NNOMs) in the practical production process, this paper presents two methods to solve NNOMs, where Matlab built-in function “fmincon()” and neutrosophic number operations (NNOs) are used in indeterminate environments. Next, the two methods are applied to linear and nonlinear programming problems with neutrosophic number information to obtain the optimal solution of the maximum/minimum objective function under the constrained conditions of practical productions by neutrosophic number optimization programming (NNOP) examples. Finally, under indeterminate environments, the fit optimal solutions of the examples can also be achieved by using some specified indeterminate scales to fulfill some specified actual requirements. The NNOP methods can obtain the feasible and flexible optimal solutions and indicate the advantage of simple calculations in practical applications.

scholarly journals Realtime production scheduling and control systems in smart industry

Impact ◽  
2020 ◽  
Vol 2020 (8) ◽  
pp. 60-61
Author(s):  
Wei Weng
Keyword(s):  
Control Systems ◽  
Real Time ◽  
Production Scheduling ◽  
Production Control ◽  
Optimal Solution ◽  
Scheduling Problem ◽  
Optimal Solutions ◽  
Scheduling Problems ◽  
Smart Industry ◽  
And Control

For a production system, 'scheduling' aims to find out which machine/worker processes which job at what time to produce the best result for user-set objectives, such as minimising the total cost. Finding the optimal solution to a large scheduling problem, however, is extremely time consuming due to the high complexity. To reduce this time to one instance, Dr Wei Weng, from the Institute of Liberal Arts and Science, Kanazawa University in Japan, is leading research projects on developing online scheduling and control systems that provide near-optimal solutions in real time, even for large production systems. In her system, a large scheduling problem will be solved as distributed small problems and information of jobs and machines is collected online to provide results instantly. This will bring two big changes: 1. Large scheduling problems, for which it tends to take days to reach the optimal solution, will be solved instantly by reaching near-optimal solutions; 2. Rescheduling, which is still difficult to be made in real time by optimization algorithms, will be completed instantly in case some urgent jobs arrive or some scheduled jobs need to be changed or cancelled during production. The projects have great potential in raising efficiency of scheduling and production control in future smart industry and enabling achieving lower costs, higher productivity and better customer service.

Using API Call Sequences for IoT Malware Classification Based on Convolutional Neural Networks

2021 ◽  
Vol 31 (04) ◽  
pp. 587-612
Author(s):  
Qianguang Lin ◽  
Ni Li ◽  
Qi Qi ◽  
Jiabin Hu
Keyword(s):  
Time Series ◽  
Time Series Data ◽  
Comprehensive Evaluation ◽  
Optimal Solution ◽  
Classification Problem ◽  
Experimental Results ◽  
Series Data ◽  
Chi Square ◽  
Malware Classification ◽  
Model Training

Internet of Things (IoT) devices built on different processor architectures have increasingly become targets of adversarial attacks. In this paper, we propose an algorithm for the malware classification problem of the IoT domain to deal with the increasingly severe IoT security threats. Application executions are represented by sequences of consecutive API calls. The time series of data is analyzed and filtered based on the improved information gains. It performs more effectively than chi-square statistics, in reducing the sequence lengths of input data meanwhile keeping the important information, according to the experimental results. We use a multi-layer convolutional neural network to classify various types of malwares, which is suitable for processing time series data. When the convolution window slides down the time sequence, it can obtain higher-level positions by collecting different sequence features, thereby understanding the characteristics of the corresponding sequence position. By comparing the iterative efficiency of different optimization algorithms in the model, we select an algorithm that can approximate the optimal solution to a small number of iterations to speed up the convergence of the model training. The experimental results from real world IoT malware sample show that the classification accuracy of this approach can reach more than 98%. Overall, our method has demonstrated practical suitability for IoT malware classification with high accuracies and low computational overheads by undergoing a comprehensive evaluation.

Sign in / Sign up

Export Citation Format

Share Document