• Title/Summary/Keyword: binary optimization

Search Result 238, Processing Time 0.027 seconds

An Informal Analysis of Diffusion, Global Optimization Properties in Langevine Competitive Learning Neural Network (Langevine 경쟁학습 신경회로망의 확산성과 대역 최적화 성질의 근사 해석)

  • Seok, Jin-Wuk;Cho, Seong-Won;Choi, Gyung-Sam
    • Proceedings of the KIEE Conference
    • /
    • 1996.07b
    • /
    • pp.1344-1346
    • /
    • 1996
  • In this paper, we discuss an informal analysis of diffusion, global optimization properties of Langevine competitive learning neural network. In the view of the stochastic process, it is important that competitive learning gurantee an optimal solution for pattern recognition. We show that the binary reinforcement function in Langevine competitive learning is a brownian motion as Gaussian process, and construct the Fokker-Plank equation for the proposed neural network. Finally, we show that the informal analysis of the proposed algorithm has a possiblity of globally optimal. solution with the proper initial condition.

  • PDF

Optimal sensor placement under uncertainties using a nondirective movement glowworm swarm optimization algorithm

  • Zhou, Guang-Dong;Yi, Ting-Hua;Zhang, Huan;Li, Hong-Nan
    • Smart Structures and Systems
    • /
    • v.16 no.2
    • /
    • pp.243-262
    • /
    • 2015
  • Optimal sensor placement (OSP) is a critical issue in construction and implementation of a sophisticated structural health monitoring (SHM) system. The uncertainties in the identified structural parameters based on the measured data may dramatically reduce the reliability of the condition evaluation results. In this paper, the information entropy, which provides an uncertainty metric for the identified structural parameters, is adopted as the performance measure for a sensor configuration, and the OSP problem is formulated as the multi-objective optimization problem of extracting the Pareto optimal sensor configurations that simultaneously minimize the appropriately defined information entropy indices. The nondirective movement glowworm swarm optimization (NMGSO) algorithm (based on the basic glowworm swarm optimization (GSO) algorithm) is proposed for identifying the effective Pareto optimal sensor configurations. The one-dimensional binary coding system is introduced to code the glowworms instead of the real vector coding method. The Hamming distance is employed to describe the divergence of different glowworms. The luciferin level of the glowworm is defined as a function of the rank value (RV) and the crowding distance (CD), which are deduced by non-dominated sorting. In addition, nondirective movement is developed to relocate the glowworms. A numerical simulation of a long-span suspension bridge is performed to demonstrate the effectiveness of the NMGSO algorithm. The results indicate that the NMGSO algorithm is capable of capturing the Pareto optimal sensor configurations with high accuracy and efficiency.

Analysis of Joint Multiband Sensing-Time M-QAM Signal Detection in Cognitive Radios

  • Tariq, Sana;Ghafoor, Abdul;Farooq, Salma Zainab
    • ETRI Journal
    • /
    • v.34 no.6
    • /
    • pp.892-899
    • /
    • 2012
  • We analyze a wideband spectrum in a cognitive radio (CR) network by employing the optimal adaptive multiband sensing-time joint detection framework. This framework detects a wideband M-ary quadrature amplitude modulation (M-QAM) primary signal over multiple nonoverlapping narrowband Gaussian channels, using the energy detection technique so as to maximize the throughput in CR networks while limiting interference with the primary network. The signal detection problem is formulated as an optimization problem to maximize the aggregate achievable secondary throughput capacity by jointly optimizing the sensing duration and individual detection thresholds under the overall interference imposed on the primary network. It is shown that the detection problems can be solved as convex optimization problems if certain practical constraints are applied. Simulation results show that the framework under consideration achieves much better performance for M-QAM than for binary phase-shift keying or any real modulation scheme.

MPEG-4 BIFS Optimization for Interactive T-DMB Content (지상파 DMB 컨텐츠의 MPEG-4 BIFS 최적화 기법)

  • Cha, Kyung-Ae
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.12 no.1
    • /
    • pp.54-60
    • /
    • 2007
  • The Digital Multimedia Broadcasting(DMB) system is developed to offer high quality multimedia content to the mobile environment. The system adopts the MPEG-4 standard for the main video, audio and other media format. For providing interactive contents, it also adopts the MPEG-4 scene description that refers to the spatio-temporal specifications and behaviors of individual objects. With more interactive contents, the scene description also needs higher bitrate. However, the bandwidth for allocating meta data, such as scene description is restrictive in the mobile environment. On one hand, the DMB terminal renders each media stream according to the scene description. Thus the binary format for scene(BIFS) stream corresponding to the scene description should be decoded and parsed in advance when presenting media data. With this reasoning, the transmission delay of the BIFS stream would cause the delay in transmitting whole audio-visual scene presentations, although the audio or video streams are encoded in very low bitrate. This paper presents the effective optimization technique in adapting the BIFS stream into the expected bitrate without any waste in bandwidth and avoiding transmission delays inthe initial scene description for interactive DMB content.

  • PDF

Simultaneous Optimization of Gene Selection and Tumor Classification Using Intelligent Genetic Algorithm and Support Vector Machine

  • Huang, Hui-Ling;Ho, Shinn-Ying
    • Proceedings of the Korean Society for Bioinformatics Conference
    • /
    • 2005.09a
    • /
    • pp.57-62
    • /
    • 2005
  • Microarray gene expression profiling technology is one of the most important research topics in clinical diagnosis of disease. Given thousands of genes, only a small number of them show strong correlation with a certain phenotype. To identify such an optimal subset from thousands of genes is intractable, which plays a crucial role when classify multiple-class genes express models from tumor samples. This paper proposes an efficient classifier design method to simultaneously select the most relevant genes using an intelligent genetic algorithm (IGA) and design an accurate classifier using Support Vector Machine (SVM). IGA with an intelligent crossover operation based on orthogonal experimental design can efficiently solve large-scale parameter optimization problems. Therefore, the parameters of SVM as well as the binary parameters for gene selection are all encoded in a chromosome to achieve simultaneous optimization of gene selection and the associated SVM for accurate tumor classification. The effectiveness of the proposed method IGA/SVM is evaluated using four benchmark datasets. It is shown by computer simulation that IGA/SVM performs better than the existing method in terms of classification accuracy.

  • PDF

Design of Modal Transducer in 2D Structure Using Multi-Layered PVDF Films Based on Electrode Pattern Optimization (다층 압전 필름의 전극 패턴 최적화를 통한 2차원 구조물에서의 모달 변환기 구현)

  • 유정규;김지철;김승조
    • Journal of KSNVE
    • /
    • v.8 no.4
    • /
    • pp.632-642
    • /
    • 1998
  • A method based on finite element discretization is developed for optimizing the polarization profile of PVDF film to create the modal transducer for specific modes. Using this concept, one can design the modal transducer in two-dimensional structure having arbitrary geometry and boundary conditions. As a practical means for implementing this polarization profile without repoling the PVDF film the polarization profile is approximated by optimizing electrode patterns, lamination angles, and poling directions of the multi-layered PVDF transducer. This corresponds to the approximation of a continuous function using discrete values. The electrode pattern of each PVDF layer is optimized by deciding the electrode of each finite element to be used or not. Genetic algorithm, suitable for discrete problems, is used as an optimization scheme. For the optimization of each layers lamination angle, the continuous lamination angle is encoded into discrete value using binary 5 bit string. For the experimental demonstration, a modal sensor for first and second modes of cantilevered composite plate is designed using two layers of PVDF films. The actuator is designed based on the criterion of minimizing the system energy in the control modes under a given initial condition. Experimental results show that the signals from residual modes are successfully reduced using the optimized multi-layered PVDF sensor. Using discrete LQG control law, the modal peaks of first and second modes are reduced in the amount of 12 dB and 4 dB, resepctively.

  • PDF

Simulation and Optimization Study on the Pressure-Swing Distillation of Ethanol-Benzene Azeotrope (Ethanol-Benzene 공비혼합물의 분리를 위한 압력변환 증류공정의 전산모사)

  • Park, Hoey Kyung;Kim, Dong Sun;Cho, JungHo
    • Korean Chemical Engineering Research
    • /
    • v.53 no.4
    • /
    • pp.450-456
    • /
    • 2015
  • In the present study, modelling and optimization of ethanol-benzene separation process were performed using pressure-swing distillation. Order to obtain a reliable results, vapour-liquid equilibrium (VLE) experiments of ethanol-benzene binary system were performed. The parameters of thermodynamic equation were determined using experimental data and the regression. The pressure-swing distillation process optimization was performed to obtain high purity ethanol and high purity benzene into a low-high pressure columns configuration and a high-low pressure columns configuration. The heat duty values of the reboiler from simulation were compared, and the process was optimized to minimize the heat duty.

A Hybrid Parallel Genetic Algorithm for Reliability Optimal Design of a Series System (직렬시스템의 신뢰도 최적 설계를 위한 Hybrid 병렬 유전자 알고리즘 해법)

  • Kim, Ki-Tae;Jeon, Geon-Wook
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.33 no.2
    • /
    • pp.48-55
    • /
    • 2010
  • Reliability has been considered as a one of the major design measures in various industrial and military systems. The main objective is to suggest a mathematical programming model and a hybrid parallel genetic algorithm(HPGA) for the problem that determines the optimal component reliability to maximize the system reliability under cost constraint in this study. Reliability optimization problem has been known as a NP-hard problem and normally formulated as a mixed binary integer programming model. Component structure, reliability, and cost were computed by using HPGA and compared with the results of existing meta-heuristic such as Ant Colony Optimization(ACO), Simulated Annealing(SA), Tabu Search(TS) and Reoptimization Procedure. The global optimal solutions of each problem are obtained by using CPLEX 11.1. The results of suggested algorithm give the same or better solutions than existing algorithms, because the suggested algorithm could paratactically evolved by operating several sub-populations and improving solution through swap and 2-opt processes.

A Cloud-Edge Collaborative Computing Task Scheduling and Resource Allocation Algorithm for Energy Internet Environment

  • Song, Xin;Wang, Yue;Xie, Zhigang;Xia, Lin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.6
    • /
    • pp.2282-2303
    • /
    • 2021
  • To solve the problems of heavy computing load and system transmission pressure in energy internet (EI), we establish a three-tier cloud-edge integrated EI network based on a cloud-edge collaborative computing to achieve the tradeoff between energy consumption and the system delay. A joint optimization problem for resource allocation and task offloading in the threetier cloud-edge integrated EI network is formulated to minimize the total system cost under the constraints of the task scheduling binary variables of each sensor node, the maximum uplink transmit power of each sensor node, the limited computation capability of the sensor node and the maximum computation resource of each edge server, which is a Mixed Integer Non-linear Programming (MINLP) problem. To solve the problem, we propose a joint task offloading and resource allocation algorithm (JTOARA), which is decomposed into three subproblems including the uplink transmission power allocation sub-problem, the computation resource allocation sub-problem, and the offloading scheme selection subproblem. Then, the power allocation of each sensor node is achieved by bisection search algorithm, which has a fast convergence. While the computation resource allocation is derived by line optimization method and convex optimization theory. Finally, to achieve the optimal task offloading, we propose a cloud-edge collaborative computation offloading schemes based on game theory and prove the existence of Nash Equilibrium. The simulation results demonstrate that our proposed algorithm can improve output performance as comparing with the conventional algorithms, and its performance is close to the that of the enumerative algorithm.

The Optimal Deployment Problem of Air Defense Artillery for Missile Defense (미사일 방어를 위한 방공포대 최적 배치 문제)

  • Kim, Jae-Kwon;Seol, Hyeonju
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.39 no.1
    • /
    • pp.98-104
    • /
    • 2016
  • With the development of modern science and technology, weapon systems such as tanks, submarines, combat planes, radar are also dramatically advanced. Among these weapon systems, the ballistic missile, one of the asymmetric forces, could be considered as a very economical means to attack the core facilities of the other country in order to achieve the strategic goals of the country during the war. Because of the current ballistic missile threat from the North Korea, establishing a missile defense (MD) system becomes one of the major national defense issues. This study focused on the optimization of air defense artillery units' deployment for effective ballistic missile defense. To optimize the deployment of the units, firstly this study examined the possibility of defense, according to the presence of orbital coordinates of ballistic missiles in the limited defense range of air defense artillery units. This constraint on the defense range is originated from the characteristics of anti-ballistic missiles (ABMs) such as PATRIOT. Secondly, this study proposed the optimized mathematical model considering the total covering problem of binary integer programming, as an optimal deployment of air defense artillery units for defending every core defense facility with the least number of such units. Finally, numerical experiments were conducted to show how the suggested approach works. Assuming the current state of the Korean peninsula, the study arbitrarily set ballistic missile bases of the North Korea and core defense facilities of the South Korea. Under these conditions, numerical experiments were executed by utilizing MATLAB R2010a of the MathWorks, Inc.