• Title/Summary/Keyword: optimization problem

Search Result 4,342, Processing Time 0.026 seconds

Development of Mobile System Based on Android for Tunnel Face Mapping (터널 막장 매핑을 위한 안드로이드 기반의 모바일 시스템 개발)

  • Park, Sung Wook;Kim, Hong Gyun;Bae, Sang Woo;Kim, Chang Yong;Yoo, Wan Kyu;Lee, Jin Duk
    • The Journal of Engineering Geology
    • /
    • v.24 no.3
    • /
    • pp.343-351
    • /
    • 2014
  • Tunnel face mapping plays an important role in risk analysis and infrastructure support decisions during tunnel construction. In this study, a digital mapping system using a mobile device is employed instead of existing face-mapping methods that rely upon face mapping sheets. The mobile device is then connected to the main server in the field, where a tunnel-specific database is compiled automatically. This information provides real-time feedback on the tunnel face to construction personnel and engineers, thus allowing for rapid assessment of tunnel face stability and infrastructure needs. The Douglas-Peucker algorithm, among others, is employed to resolve problems arising from the detailed mapping and speed problem by data accumulation. This system is expected to raise program optimization through field verification and additional functional improvements.

A Optimization of Fire Safety Design in Multiplex Cinema Theater (국내 복합상영관 시설의 방재대책에 관한 연구)

  • 허준호;윤명오
    • Fire Science and Engineering
    • /
    • v.16 no.2
    • /
    • pp.43-50
    • /
    • 2002
  • 21C, Multiplex Cinema Theater is made from movie industry developed and become a place where we can spend our free time and consuming. But, theater users, who are many and unspecified persons, are short of information on the Multiplex Cinema Theater, so that they may be injured or killed at the occurrence of fire accident. Particularly, Multiplex Cinema Theater is a place that underground space or top floor in highrise building had many people in theaters. However, this problem is difficult to solve that to protect human being and properties at the occurrence of fire accident in the Multiplex Cinema Theater, In order to overcome such problems, Multiplex Cinema Theater need fire protection solutions facilities concerning particulars to pay attention to the safety on a fire and evacuation. This study analysed Multiplex Cinema Theater concept and computer simulation for risk point.

Constrained Spatiotemporal Independent Component Analysis and Its Application for fMRI Data Analysis

  • Rasheed, Tahir;Lee, Young-Koo;Lee, Sung-Young;Kim, Tae-Seong
    • Journal of Biomedical Engineering Research
    • /
    • v.30 no.5
    • /
    • pp.373-380
    • /
    • 2009
  • In general, Independent component analysis (ICA) is a statistical blind source separation technique, used either in spatial or temporal domain. The spatial or temporal ICAs are designed to extract maximally independent sources in respective domains. The underlying sources for spatiotemporal data (sequence of images) can not always be guaranteed to be independent, therefore spatial ICA extracts the maximally independent spatial sources, deteriorating the temporal sources and vice versa. For such data types, spatiotemporal ICA tries to create a balance by simultaneous optimization in both the domains. However, the spatiotemporal ICA suffers the problem of source ambiguity. Recently, constrained ICA (c-ICA) has been proposed which incorporates a priori information to extract the desired source. In this study, we have extended the c-ICA for better analysis of spatiotemporal data. The proposed algorithm, i.e., constrained spatiotemporal ICA (constrained st-ICA), tries to find the desired independent sources in spatial and temporal domains with no source ambiguity. The performance of the proposed algorithm is tested against the conventional spatial and temporal ICAs using simulated data. Furthermore, its performance for the real spatiotemporal data, functional magnetic resonance images (fMRI), is compared with the SPM (conventional fMRI data analysis tool). The functional maps obtained with the proposed algorithm reveal more activity as compared to SPM.

Skin Penetration and Local Irritation of Ethyl Glycolate, a Potential Transdermal Prodrug (경피용 프로드럭인 에칠 글리콜레이트의 국소자극 및 피부투과성)

  • Yang, Sung-Woon;Ha, Yong-Ho;Kim, Johng-Kap;Choi, Young-Wook
    • YAKHAK HOEJI
    • /
    • v.40 no.2
    • /
    • pp.155-162
    • /
    • 1996
  • Hyperkeratinization is a dermatologic disorder, which is due to the increase of corneocyte cohesion force. Glycolic acid, an alpha hydroxy acid(AHA), has been used to breakdown the hyperkeratinization processes. However, it has a problem of skin irritation when applied topically, due to the strong acidity especially in high concentration. A molecular optimization of glycolic acid has been tried to reduce the skin irritation by the way of prodrug formation. Ethyl glycolate was synthesized by the esterification of glycolic acid with ethanol in acidic conditions in the presence of sulfuric acid, and examined under the spectroscopic trials, such as UV, IR, $^1H$-NMR, and GC-MS. The physicochemical and biopharmaceutical properties of the prodrug were also evaluated. Through the toxicological tests of both skin irritation and eye mucous irritation, it has been proved that ethyl glycolate was less irritant than glycolic acid, since the pH value of synthetic prodrug was higher than that of glycolic acid. In the penetration test through nude mouse skin by diffusion cell, ethyl glycolate was continuously hydrolyzed to glycolic acid, which was assayed form the receptor compartment. It was obtained that the penetrated amount of ethyl glycolate was five times higher than that of glycolic acid. These results suggest that ethyl glycolate might be a successful prodrug of glycolic acid to reduce the skin irritation and to increase the skin penetration as well.

  • PDF

Estimation of Probability Density Function of Tidal Elevation Data using the Double Truncation Method (이중 절단 기법을 이용한 조위자료의 확률밀도함수 추정)

  • Jeong, Shin-Taek;Cho, Hong-Yeon;Kim, Jeong-Dae;Hui, Ko-Dong
    • Journal of Korean Society of Coastal and Ocean Engineers
    • /
    • v.20 no.3
    • /
    • pp.247-254
    • /
    • 2008
  • The double-peak normal distribution function (DPDF) suggested by Cho et al.(2004) has the problems that the extremely high and low tidal elevations are frequently generated in the Monte-Carlo simulation processes because the upper and lower limits of the DPDF are unbounded in spite of the excellent goodness-offit results. In this study, the modified DPDF is suggested by introducing the upper and lower value parameters and re-scale parameters in order to remove these problems. These new parameters of the DPDF are optimally estimated by the non-linear optimization problem solver using the Levenberg-Marquardt scheme. This modified DPDF can remove completely the unrealistically generated tidal levations and give a slightly better fit than the existing DRDF. Based on the DPDF's characteristic power, the over- and under estimation problems of the design factors are also automatically intercepted, too.

Algorithm for Arthmetic Optimization using Carry-Save Adders (캐리-세이브 가산기를 이용한 연산 최적화 알고리즘)

  • Eom, Jun-Hyeong;Kim, Tae-Hwan
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.12
    • /
    • pp.1539-1547
    • /
    • 1999
  • 캐리-세이브 가산기 (CSA)는 회로 설계 과정에서 빠른 연산 수행을 위해 가장 널리 이용되는 연산기 중의 하나이다. 그러나, 현재까지 산업체에서 CSA를 이용한 설계는 설계자의 경험에 따른 수작업에 의존하고 있고 그 결과 최적의 회로를 만들기 위해 매우 많은 시간과 노력이 소비되고 있다. 이에 따라 최근 CSA를 기초로 하는 회로 합성 자동화 기법에 대한 연구의 필요성이 대두되고 있는 상황에서, 본 논문은 연산 속도를 최적화하는 효율적인 CSA 할당 알고리즘을 제안한다. 우리는 CSA 할당 문제를 2단계로 접근한다: (1) 연산식의 멀티 비트 입력들만을 고려하여 최소 수행 속도 (optimal-delay)의 CSA 트리를 할당한다; (2) (1)에서 구한 CSA 트리의 수행 속도 증가가 최소화 (minimal increase of delay) 되는 방향으로 CSA들의 캐리 입력 포트들에 나머지 싱글 비트 입력들을 배정한다. 실제 실험에서 우리의 제안된 알고리즘을 적용하여 연산식들의 회로 속도를 회로 면적의 증가 없이 상당한 수준까지 줄일 수 있었다.Abstract Carry-save-adder (CSA) is one of the most widely used implementations for fast arithmetics in industry. However, optimizing arithmetic circuits using CSAs is mostly carried out by the designer manually based on his/her design experience, which is a very time-consuming and error-prone task. To overcome this limitation, in this paper we propose an effective synthesis algorithm for solving the problem of finding an allocation of CSAs with a minimal timing for an arithmetic expression. Specifically, we propose a two step approach: (1) allocating a delay-optimal CSA tree for the multi-bit inputs of the arithmetic expression and (2) determining the assignment of the single-bit inputs to carry inputs of the CSAs which leads to a minimal increase of delay of the CSA tree obtained in step (1). For a number of arithmetic expressions, we found that our approach is very effective, reducing the timing of the circuits significantly without increasing the circuit area.

The Role of the Cauchy Probability Distribution in a Continuous Taboo Search (연속형 타부 탐색에서 코시 확률 분포의 역할)

  • Lee, Chang-Yong;Lee, Dong-Ju
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.8
    • /
    • pp.591-598
    • /
    • 2010
  • In this study, we propose a new method for generating candidate solutions based on the Cauchy probability distribution in order to complement the shortcoming of the solutions generated by the normal distribution. The Cauchy probability distribution has infinite mean and variance, and it has rather large probability in the tail region relative to the normal distribution. Thus, the Cauchy distribution can yield higher probabilities of generating candidate solutions of large-varied variables, which in turn has an advantage of searching wider area of variable space. In order to compare and analyze the performance of the proposed method against the conventional method, we carried out an experiment using benchmarking problems of real valued function. From the result of the experiment, we found that the proposed method based on the Cauchy distribution outperformed the conventional one for all benchmarking problems, and verified its superiority by the statistical hypothesis test.

Breast Cytology Diagnosis using a Hybrid Case-based Reasoning and Genetic Algorithms Approach

  • Ahn, Hyun-Chul;Kim, Kyoung-Jae
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2007.05a
    • /
    • pp.389-398
    • /
    • 2007
  • Case-based reasoning (CBR) is one of the most popular prediction techniques for medical diagnosis because it is easy to apply, has no possibility of overfitting, and provides a good explanation for the output. However, it has a critical limitation - its prediction performance is generally lower than other artificial intelligence techniques like artificial neural networks (ANNs). In order to obtain accurate results from CBR, effective retrieval and matching of useful prior cases for the problem is essential, but it is still a controversial issue to design a good matching and retrieval mechanism for CBR systems. In this study, we propose a novel approach to enhance the prediction performance of CBR. Our suggestion is the simultaneous optimization of feature weights, instance selection, and the number of neighbors that combine using genetic algorithms (GAs). Our model improves the prediction performance in three ways - (1) measuring similarity between cases more accurately by considering relative importance of each feature, (2) eliminating redundant or erroneous reference cases, and (3) combining several similar cases represent significant patterns. To validate the usefulness of our model, this study applied it to a real-world case for evaluating cytological features derived directly from a digital scan of breast fine needle aspirate (FNA) slides. Experimental results showed that the prediction accuracy of conventional CBR may be improved significantly by using our model. We also found that our proposed model outperformed all the other optimized models for CBR using GA.

  • PDF

A Study on Genetic Algorithm and Stereo Matching for Object Depth Recognition (물체의 위치 인식을 위한 유전 알고리즘과 스테레오 정합에 관한 연구)

  • Hong, Seok-Keun;Cho, Seok-Je
    • Journal of Navigation and Port Research
    • /
    • v.32 no.5
    • /
    • pp.355-361
    • /
    • 2008
  • Stereo matching is one of the most active research areas in computer vision. In this paper, we propose a stereo matching scheme using genetic algorithm for object depth recognition. The proposed approach considers the matching environment as an optimization problem and finds the optimal solution by using an evolutionary strategy. Accordingly, genetic operators are adapted for the circumstances of stereo matching. An individual is a disparity set. Horizontal pixel line of image is considered as a chromosome. A cost function is composed of certain constraints which are commonly used in stereo matching. Since the cost function consists of intensity, similarity and disparity smoothness, the matching process is considered at the same time in each generation. The LoG(Laplacian of Gaussian) edge is extracted and used in the determination of the chromosome. We validate our approach with experimental results on stereo images.

A Study on Efficiency of Energy Conversion for a Piezoelectric Power Harvesting Using Polyvinylidene Fluorid Film (PVDF 필름을 이용한 효과적인 에너지 하베스팅에 관한 연구)

  • Hur, Won-Young;Lee, Tae-Yong;Lee, Kyung-Chun;Hwang, Hyun-Suk;Song, Joon-Tae
    • Journal of the Korean Institute of Electrical and Electronic Material Engineers
    • /
    • v.24 no.5
    • /
    • pp.422-426
    • /
    • 2011
  • Piezoelectric materials can be used to convert mechanical energy into electrical energy. In this study, we investigated the possibility of harvesting from mechanical vibration force using a high efficient piezoelectric material-polyvinylidene fluoride (PVDF). A piezoelectric energy harvesting system consists of rectifier, filter capacitor, resistance. The experiments were carried out with impacting force to PVDF film with the thickness of 1 ${\mu}m$. The output power was measured with change in the load resistance value from 100 ${\Omega}$ to 2.2 $M{\Omega}$. The highest power was obtained under optimization by selection of suitable resistive load and capacitance. A power of 0.3082 ${\mu}W/mm^2$ was generated at the external vibration force of 5 N (10 Hz) across a 1 $M{\Omega}$ optimal resistor. Also, the maximum power of 0.345 ${\mu}W/mm^2$ was generated at 22 ${\mu}F$ and 1 $M{\Omega}$. The developed system was expected at a solution to overcome the critical problem of making up small size energy harvester.