• Title/Summary/Keyword: 0/1 Constraints

Search Result 253, Processing Time 0.027 seconds

Optimization of a System Reliability by Zero-One Programming with GUB Structure (GUB 구조를 갖는 0-1 프로그래밍에 의한 시스템 신뢰성의 최적화)

  • Lee, Jae-Uk;Chun, Koo-Chae;Gen, Mitsuo
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.2
    • /
    • pp.124-131
    • /
    • 1989
  • This paper showed that the system reliability optimization problem with sereval failure modes at each subsystem can be treated as efficient computational algorithm proposed here. This algorithm was developed by considering a generalized upper bounding which always exists in constraints when the system reliability optimization problem may be reformulated as 0-1 integer programming problem. We demonstrated the optimal allocation of redundant units for system reliability by using the proposed algorithm. Our algorithm is superior to others in terms of number of iterations and variables used.

  • PDF

Application of Quadratic Algebraic Curve for 2D Collision-Free Path Planning and Path Space Construction

  • Namgung, Ihn
    • International Journal of Control, Automation, and Systems
    • /
    • v.2 no.1
    • /
    • pp.107-117
    • /
    • 2004
  • A new algorithm for planning a collision-free path based on an algebraic curve as well as the concept of path space is developed. Robot path planning has so far been concerned with generating a single collision-free path connecting two specified points in a given robot workspace with appropriate constraints. In this paper, a novel concept of path space (PS) is introduced. A PS is a set of points that represent a connection between two points in Euclidean metric space. A geometry mapping (GM) for the systematic construction of path space is also developed. A GM based on the 2$^{nd}$ order base curve, specifically Bezier curve of order two is investigated for the construction of PS and for collision-free path planning. The Bezier curve of order two consists of three vertices that are the start, S, the goal, G, and the middle vertex. The middle vertex is used to control the shape of the curve, and the origin of the local coordinate (p, $\theta$) is set at the centre of S and G. The extreme locus of the base curve should cover the entire area of actual workspace (AWS). The area defined by the extreme locus of the path is defined as quadratic workspace (QWS). The interference of the path with obstacles creates images in the PS. The clear areas of the PS that are not mapped by obstacle images identify collision-free paths. Hence, the PS approach converts path planning in Euclidean space into a point selection problem in path space. This also makes it possible to impose additional constraints such as determining the shortest path or the safest path in the search of the collision-free path. The QWS GM algorithm is implemented on various computer systems. Simulations are carried out to measure performance of the algorithm and show the execution time in the range of 0.0008 ~ 0.0014 sec.

Adaptive Hyperspectral Image Classification Method Based on Spectral Scale Optimization

  • Zhou, Bing;Bingxuan, Li;He, Xuan;Liu, Hexiong
    • Current Optics and Photonics
    • /
    • v.5 no.3
    • /
    • pp.270-277
    • /
    • 2021
  • The adaptive sparse representation (ASR) can effectively combine the structure information of a sample dictionary and the sparsity of coding coefficients. This algorithm can effectively consider the correlation between training samples and convert between sparse representation-based classifier (SRC) and collaborative representation classification (CRC) under different training samples. Unlike SRC and CRC which use fixed norm constraints, ASR can adaptively adjust the constraints based on the correlation between different training samples, seeking a balance between l1 and l2 norm, greatly strengthening the robustness and adaptability of the classification algorithm. The correlation coefficients (CC) can better identify the pixels with strong correlation. Therefore, this article proposes a hyperspectral image classification method called correlation coefficients and adaptive sparse representation (CCASR), based on ASR and CC. This method is divided into three steps. In the first step, we determine the pixel to be measured and calculate the CC value between the pixel to be tested and various training samples. Then we represent the pixel using ASR and calculate the reconstruction error corresponding to each category. Finally, the target pixels are classified according to the reconstruction error and the CC value. In this article, a new hyperspectral image classification method is proposed by fusing CC and ASR. The method in this paper is verified through two sets of experimental data. In the hyperspectral image (Indian Pines), the overall accuracy of CCASR has reached 0.9596. In the hyperspectral images taken by HIS-300, the classification results show that the classification accuracy of the proposed method achieves 0.9354, which is better than other commonly used methods.

FAR-IR GALACTIC EMISSION MAP AND COSMIC OPTICAL BACKGROUND

  • Matsuoka, Y.
    • Publications of The Korean Astronomical Society
    • /
    • v.27 no.4
    • /
    • pp.353-356
    • /
    • 2012
  • We present new constraints on the cosmic optical background (COB) obtained from an analysis of the Pioneer 10/11 Imaging Photopolarimeter (IPP) data. After careful examination of the data quality, the usable measurements free from the zodiacal light are integrated into sky maps at the blue (${\sim}0.44{\mu}m$) and red (${\sim}0.64{\mu}m$) bands. Accurate starlight subtraction was achieved by referring to all-sky star catalogs and a Galactic stellar population synthesis model down to 32.0 mag. We find that the residual light is separated into two components: one component shows a clear correlation with the thermal $100{\mu}m$ brightness, whilst the other shows a constant level in the lowest $100{\mu}m$ brightness region. The presence of the second component is significant after all the uncertainties and possible residual light in the Galaxy are taken into account, thus it most likely has an extragalactic origin (i.e., the COB). The derived COB brightness is ($(1.8{\pm}0.9){\times}10^{-9}$ and $(1.2{\pm}0.9){\times}10^{-9}\;erg\;s^{-1}\;cm^{-2}\;sr^{-1}\;{\AA}^{-1}$ in the blue and red spectral regions, respectively, or $7.9{\pm}4.0$ and $7.7{\pm}5.8\;nW\;m^{-2}\;sr^{-1}$. Based on a comparison with the integrated brightness of galaxies, we conclude that the bulk of the COB is comprised of normal galaxies which have already been resolved by the current deepest observations. There seems to be little room for contributions from other populations including "first stars" at these wavelengths. On the other hand, the first component of the IPP residual light represents the diffuse Galactic light (DGL)-scattered starlight by the interstellar dust. We derive the mean DGL-to-$100{\mu}m$ brightness ratios of $2.1{\times}10^{-3}$ and $4.6{\times}10^{-3}$ at the two bands, which are roughly consistent with previous observations toward denser dust regions. Extended red emission in the diffuse interstellar medium is also confirmed.

Early Chemical Evolution of the Milky Way Revealed by Ultra Metal-Poor ([Fe/H] < -4.0) Stars

  • Jeong, MiJi;Lee, Young Sun
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.44 no.1
    • /
    • pp.68.2-68.2
    • /
    • 2019
  • Chemical abundance ratios of ultra metal-poor (UMP; [Fe/H] < -4.0) stars can provide important constraints on the early chemical enrichment of the Milky Way (MW), associated with the nucleosynthesis processes that occurred during the evolution of their progenitors, which are presumably the first generation of stars. Despite their importance, only about thirty UMP stars have been discovered thus far. In an effort to identify such stars additionally, we selected UMP candidates from low-resolution (R ~ 2000) spectra from the Sloan Digital Sky Survey and Large Sky Area Multi-Object Fibre Spectroscopic Telescope (LAMOST), and obtained with Gemini/GRACES high-resolution (R ~ 40,000) spectra of 15 UMP candidates. In this study, we present the results of the chemical abundance analysis of the UMP candidates. Furthermore, we compare the abundance patterns of our UMP stars with those of various metal-poor stars from literature to understand the early chemical evolution of the MW.

  • PDF

MIXED INTEGER PROGRAMMING MODELS FOR DISPATCHING VEHICLES AT A CONTAINER TERMINAL

  • ZHANG LI WEI;YE RONG;HUANG SHELL YING;HSU WEN JING
    • Journal of applied mathematics & informatics
    • /
    • v.17 no.1_2_3
    • /
    • pp.145-170
    • /
    • 2005
  • This paper presents scheduling models for dispatching vehicles to accomplish a sequence of container jobs at the container terminal, in which the starting times as well as the order of vehicles for carrying out these jobs need to be determined. To deal with this scheduling problem, three mixed 0-1 integer programming models, Model 1, Model 2 and Model 3 are provided. We present interesting techniques to reformulate the two mixed integer programming models, Model 1 and Model 2, as pure 0-1 integer programming problems with simple constraint sets and present a lower bound for the optimal value of Model 1. Model 3 is a complicated mixed integer programming model because it involves a set of non-smooth constraints, but it can be proved that its solutions may be obtained by the so-called greedy algorithm. We present numerical results showing that Model 3 is the best among these three models and the greedy algorithm is capable of solving large scale problems.

The study On An Reservoir Development Method of small Islands Using 0-1 Integer Programming (0-1 정수 계획법을 이용한 도서지역 상수원 개발 방법에 관한 연구)

  • Joo, Ki-See;Park, Seong-Hyeon;Nam, Tek-Keun
    • Proceedings of KOSOMES biannual meeting
    • /
    • 2005.11a
    • /
    • pp.185-190
    • /
    • 2005
  • This study is to determine an optimal reservoir among many alternative proposals in order to obtain the maximized efficiency under the limited budget. There are many alternative proposals which deal with problems to assign reservoir such as water conversion establishment construction, subterranean water, reservoir, submarine pipeline, water bort, and marine water saving base construction. In this paper, the new model to assign the most reasonable alternative is introduced using 0-1 integer programming. This proposed model has not been applied in the optimal reservoir selection problem yet. This paper will contribute to determine the most reasonable alternative to minimize budget under constraints. Also, this proposal model can be applied to other reservoir selection problem in other regions.

  • PDF

The Study on a Reservoir Environment Development Method of Coast Small Islands using 0-1 Integer Programming (0-1 정수 계획법을 이용한 해양 도서지역 상수원 환경 개발 방법에 관한 연구)

  • Joo, K.S.;Park, S.H.
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.13 no.2 s.29
    • /
    • pp.127-132
    • /
    • 2007
  • This study is to determine an optimal reservoir among many alternative proposals in order to obtain the maximized efficiency under the limited budget. There are many alternative proposals which deal with problems to assign reservoir such as water conversion establishment construction, subterranean water, reservoir, submarine pipeline, water boat, and marine water saving base construction. In this paper, the new model to assign the most reasonable alternative is introduced using 0-1 integer programming. This proposed model has not been applied in the optimal reservoir selection problem yet. This paper will contribute to determine the most reasonable alternative to minimize budget under constraints. Also, this proposal model can be applied to other reservoir selection problem in other regions.

  • PDF

Optimum design of broadband RAM(Radar Absorbing Material)'s using multi-layer dielectrics (다층유전체를 이용한 광대역 전파흡수체 최적 설계)

  • 남기진;이상설
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.1
    • /
    • pp.70-78
    • /
    • 1995
  • In order to implement broadband RAM's(Radar Absorbing Materials) made up of multiple dielectricl layers, the design variables such as the dielectrci constaints, the depths and the loss tangents of dielectric are optimized. The wave impedances regarding the reflective wave are found in dielectrics, input impedances and reflection coefficients with multiple dielectric layers are derived from the transmission line circuit theory. Finally, minimum average reflective power and optimum design variables are obtained by applying the numerical technique, called modified Powell method. In case of four dielectric layers with inequality constraints in design variables, a quite favourable and feasible result with the total depth of 1.1 cm, the average reflective power of 0.85% over the bradband frequency range is obtained for a specific example.

  • PDF

A study on the pulp and paper mills waste water Recycling by VSEP membrane system (진동막 분리장치를 이용한 제지폐수의 재이용에 관한 연구)

  • 지은상;김재우;신대윤
    • Journal of environmental and Sanitary engineering
    • /
    • v.16 no.1
    • /
    • pp.40-46
    • /
    • 2001
  • Conventional membrane systems was difficult to treatment for pulp and paper mills waste warter. Technological advances in membrane filtration systems have created opportunity for pulp and paper mills to treat effluent streams in order to meet stricter environmental constraints. "Vibratory Shear Enhanced Processing(VSEP)" developed by new logic international makes if possible to filter effluent streams without the fouling problems exhibited by conventional membrane systems. Various kinds of waste water occurred to and paper mills experiment with "VSEP" set up conventional membrane. The results were as followes : Excepting ultra filter($0.1{\mu}\textrm{m}$ Teflon, C-100, G-50), Nano filter(NTR-7450, DS-5, PVD-1) and reverse osmosis(ACM-4) was treated with very excellent weight of treatment, electric conductivity, removal COD, TDS, turbidity.

  • PDF