• Title/Summary/Keyword: Solution Representation

Search Result 311, Processing Time 0.02 seconds

Decomposition of Interference Hyperspectral Images Based on Split Bregman Iteration

  • Wen, Jia;Geng, Lei;Wang, Cailing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.7
    • /
    • pp.3338-3355
    • /
    • 2018
  • Images acquired by Large Aperture Static Imaging Spectrometer (LASIS) exhibit obvious interference stripes, which are vertical and stationary due to the special imaging principle of interference hyperspectral image (IHI) data. As the special characteristics above will seriously affect the intrinsic structure and sparsity of IHI, decomposition of IHI has drawn considerable attentions of many scientists and lots of efforts have been made. Although some decomposition methods for interference hyperspectral data have been proposed to solve the above problem of interference stripes, too many times of iteration are necessary to get an optimal solution, which will severely affect the efficiency of application. A novel algorithm for decomposition of interference hyperspectral images based on split Bregman iteration is proposed in this paper, compared with other decomposition methods, numerical experiments have proved that the proposed method will be much more efficient and can reduce the times of iteration significantly.

OPTIMAL SHAPE DESIGN OF A S-SHAPED SUBSONIC INTAKE USING NURBS (NURBS를 이용한 S형 천음속 흡입관 최적 설계)

  • Lee B.J.;Kim C.
    • Journal of computational fluids engineering
    • /
    • v.11 no.1 s.32
    • /
    • pp.57-66
    • /
    • 2006
  • An optimal shape design approach is presented for a subsonic S-shaped intake using aerodynamic sensitivity analysis. Two-equation turbulence model is employed to capture strong counter vortices in the S-shaped duct more precisely. Sensitivity analysis is performed for the three-dimensional Navier-Stokes equations coupled with two-equation turbulence models using a discrete adjoint method For code validation, the result of the flow solver is compared with experiment data and other computational results of bench marking test. To study the influence oj turbulence models and grid refinement on the duct flow analysis, the results from several turbulence models are compared with one another and the minimum number of grid points, which can yield an accurate solution is investigated The adjoint variable code is validated by comparing the complex step derivative results. To realize a sufficient and flexible design space, NURBS equations are introduced as a geometric representation and a new grid modification technique, Least Square NURBS Grid Approximation is applied With the verified flow solver, the sensitivity analysis code and the geometric modification technique, the optimization of S-shaped intake is carried out and the enhancement of overall intake performance is achieved The designed S-shaped duct is tested in several off-design conditions to confirm the robustness of the current design approach. As a result, the capability and the efficiency of the present design tools are successfully demonstrated in three-dimensional highly turbulent internal flow design and off-design conditions.

Evolutionary Neural Network based on DNA coding method for Time series prediction (시계열 예측을 위한 DNA코딩 기반의 신경망 진화)

  • 이기열;이동욱;심귀보
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.10 no.4
    • /
    • pp.315-323
    • /
    • 2000
  • In this paper, we propose a method of constructing neural networks using bio-inpired emergent and evolutionary concepts. This method is algorithm that is based on the characteristics of the biological DNA and growth of plants, Here is, we propose a constructing method to make a DNA coding method for production rule of L-system. L-system is based on so-called the parallel rewriting nechanism. The DNA coding method has no limitation in expressing the produlation the rule of L-system. Evolutionary algotithms motivated by Darwinaian natural selection are population based searching methods and the high performance of which is highly dependent on the representation of solution space. In order to verify the effectiveness of our scheme, we apply it one step ahead prediction of Mackey-Glass time series, Sunspot data and KOSPI data.

  • PDF

GEP-based Framework for Immune-Inspired Intrusion Detection

  • Tang, Wan;Peng, Limei;Yang, Ximin;Xie, Xia;Cao, Yang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.6
    • /
    • pp.1273-1293
    • /
    • 2010
  • Immune-inspired intrusion detection is a promising technology for network security, and well known for its diversity, adaptation, self-tolerance, etc. However, scalability and coverage are two major drawbacks of the immune-inspired intrusion detection systems (IIDSes). In this paper, we propose an IIDS framework, named GEP-IIDS, with improved basic system elements to address these two problems. First, an additional bio-inspired technique, gene expression programming (GEP), is introduced in detector (corresponding to detection rules) representation. In addition, inspired by the avidity model of immunology, new avidity/affinity functions taking the priority of attributes into account are given. Based on the above two improved elements, we also propose a novel immune algorithm that is capable of integrating two bio-inspired mechanisms (i.e., negative selection and positive selection) by using a balance factor. Finally, a pruning algorithm is given to reduce redundant detectors that consume footprint and detection time but do not contribute to improving performance. Our experimental results show the feasibility and effectiveness of our solution to handle the scalability and coverage problems of IIDS.

Elite-initial population for efficient topology optimization using multi-objective genetic algorithms

  • Shin, Hyunjin;Todoroki, Akira;Hirano, Yoshiyasu
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.14 no.4
    • /
    • pp.324-333
    • /
    • 2013
  • The purpose of this paper is to improve the efficiency of multi-objective topology optimization using a genetic algorithm (GA) with bar-system representation. We proposed a new GA using an elite initial population obtained from a Solid Isotropic Material with Penalization (SIMP) using a weighted sum method. SIMP with a weighted sum method is one of the most established methods using sensitivity analysis. Although the implementation of the SIMP method is straightforward and computationally effective, it may be difficult to find a complete Pareto-optimal set in a multi-objective optimization problem. In this study, to build a more convergent and diverse global Pareto-optimal set and reduce the GA computational cost, some individuals, with similar topology to the local optimum solution obtained from the SIMP using the weighted sum method, were introduced for the initial population of the GA. The proposed method was applied to a structural topology optimization example and the results of the proposed method were compared with those of the traditional method using standard random initialization for the initial population of the GA.

A Study on File Allocation Algorithm in Distributed Computer Systems (분산 컴퓨터 시스템에 있어서의 화일 할당 알고리듬에 관한 연구)

  • Hong, Jin-Pyo;Lim, Chae-Tak
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.2
    • /
    • pp.118-125
    • /
    • 1990
  • An optimal file allocation algorithm which seeks optimal solution of file allocation problem for efficient management and operation of information files in distributed computer system is proposed. Since file allocation time in practical applications that have many computer sites is tool long, the problem size has to be reduced and computation time is improved by using preassignment conditio. A new method which calculate appriasal value for accurrate value for accurrate representation of assigned state is proposed and the selection criteria to candidate nodes for rapid determination of allocation are given. By using selection criteria, file allocation is determined and final appraisal value represent total cost of assigned state.

  • PDF

Mobile Access Network Design (이동통신 액세스망 설계)

  • Kim, Hu-Gon;Paik, Chun-Hyun;Kwon, Jun-Hyuk;Chung, Yong-Joo
    • Korean Management Science Review
    • /
    • v.24 no.2
    • /
    • pp.127-142
    • /
    • 2007
  • This study deals with the optimal design of mobile access network connecting base stations(BSs) and mobile switching centers(MSCs). Generally mobile operators constitute their access networks by leasing communication lines. Using the characteristic of leased line rate based on administration region, we build an optimization model for mobile access network design which has much smaller number of variables than the existing researches. And we develop a GUI based optimization tool integrating the well-known softwares such as MS EXCEL. MS VisualBasic, MS PowerPoint and Ip_solve, a freeware optimization software. Employing the current access network configuration of a Korean mobile carrier, this study using the optimization tool obtain an optimal solution for both single MSC access network and nation-wide access network. Each optimal access network achieves 7.45% and 9.49% save of lease rate, respectively. Considering the monthly charge and total amount of lease line rate, our optimization tool provides big amount of save in network operation cost. Besides the graphical representation of access networks makes the operator easily understand and compare current and optimal access networks.

Critical Micelle Concentration Expressed in Molarity or Mole Fraction and Its Relation to Thermodynamic Potentials (몰농도 또는 몰분율로 표시되는 임계 미셀 농도와 열역학적 포텐셜과의 관계)

  • Kim, Hong-Un;Lim, kyung-Hee
    • Journal of the Korean Applied Science and Technology
    • /
    • v.18 no.4
    • /
    • pp.325-331
    • /
    • 2001
  • The critical micelle concentration (CMC) at which micelles start to form from a surfactant solution is usually measured in terms of conventional concentration units. However, the thermodynamic potentials are expressed in terms of mole fraction $X_{CMC}$ and $X_{CMC}$ cannot be directly measured experimentally. The Gibbs free energy, ${\Delta}G^{\ast}_{mic}$, in particular is related to $X_{CMC}$ through ${\Delta}G^{\ast}_{mic}$ = $RTlnX_{CMC}$. When it comes to CMC, the molar CMC, $C_{CMC}$, differs only by the proportionality $C^{-1}_{w}$ with $C_{w}$ being the molarity of water. Hence, $C_{CMC}$ is found to be a proper representation of CMC. However, in calculation of ${\Delta}G^{\ast}_{mic}$ and other thermodynamic potentials from the CMC, $X_{CMC}$ or $C_{CMC}/C_{w}$ should be used.

Singular Cell Integral of Green's tensor in Integral Equation EM Modeling (적분방정식 전자탐사 모델링에서 Green 텐서의 특이 적분)

  • Song Yoonho;Chung Seung-Hwan
    • Geophysics and Geophysical Exploration
    • /
    • v.3 no.1
    • /
    • pp.13-18
    • /
    • 2000
  • We describe the concept of the singularity in the integral equation of electromagnetic (EM) modeling in comparison with that in the integral representation of electric fields in EM theory, which would clarify the singular integral problems of the Green's tensor. We have also derived and classified the singular integrals of the Green's tensors in 3-D, 2.5-D and 2-D as well as in the thin sheet integral equations of the EM scattering problem, which have the most important effect on the accuracy of the numerical solution of the problems.

  • PDF

Shipyard Spatial Scheduling Solution using Genetic Algorithms

  • Yoon Duck Young;Ranjan Varghese
    • Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
    • /
    • 2004.11a
    • /
    • pp.35-39
    • /
    • 2004
  • In a shipyard, there exist various critical decision making components pertaining to various production hindrances. The most prominent one is best-fit spatial arrangement for the minimal spatial occupancy with better pick-ability for the erection of the ship in the dock. During the present research, a concept have been conceived to evade the gap between the identification oj inter-relationships among a set of blocks to be included on a pre-erection area, and a detailed graphical layout of their positions, is called an Optimal Block Relationship Diagram A research has been performed on generation of optimal (or near Optimal) that is, with minimal scrap area. An effort has been made in the generation of optimal (or near-optimal) Optimal Block Relationship Diagram with the Goldberg's Genetic Algorithms with a representation and a set of operators are 'trained' specifically for this application. The expected result to date predicts very good solutions to test problems involving innumerable different blocks to place. The suggested algorithm could accept input from an erection sequence generator program which assists the user in defining the nature and strength of the relationships among blocks, and could produce input suitable for use in a detailed layout stage.

  • PDF