• Title/Summary/Keyword: partial optimization

Search Result 255, Processing Time 0.023 seconds

AERODYNAMIC SHAPE OPTIMIZATION OF THE SUPERSONIC IMPULSE TURBINE USING CFD AND GENETIC ALGORITHM (CFD와 유전알고리즘을 이용한 초음속 충동형 터빈의 공력형상 최적화)

  • Lee E.S.
    • Journal of computational fluids engineering
    • /
    • v.10 no.2
    • /
    • pp.54-59
    • /
    • 2005
  • For the improvement of aerodynamic performance of the turbine blade in a turbopump for the liquid rocket engine, the optimization of turbine profile shape has been studied. The turbine in a turbopump in this study is a partial admission of impulse type, which has twelve nozzles and supersonic inflow. Due to the separated nozzles and supersonic expansion, the flow field becomes complicate and shows oblique shocks and flow separation. To increase the blade power, redesign ol the blade shape using CFD and optimization methods was attempted. The turbine cascade shape was represented by four design parameters. For optimization, a genetic algorithm based upon non-gradient search hue been selected as an optimizer. As a result, the final blade has about 4 percent more blade power than the initial shape.

Using Ant Colony Optimization to Find the Best Precautionary Measures Framework for Controlling COVID-19 Pandemic in Saudi Arabia

  • Alshamrani, Raghad;Alharbi, Manal H.
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.10
    • /
    • pp.352-358
    • /
    • 2022
  • In this paper, we study the relationship between infection rates of covid 19 and the precautionary measures and strict protocols taken by Saudi Arabia to combat the spread of the coronavirus disease and minimize the number of infected people. Based on the infection rates and the timetable of precautionary measures, the best framework of precautionary measures was identified by applying the traveling salesman problem (TSP) that relies on ant colony optimization (ACO) algorithms. The proposed algorithm was applied to daily infected cases data in Saudi Arabia during three periods of precautionary measures: partial curfew, whole curfew, and gatherings penalties. The results showed the partial curfew and the whole curfew for some cities have the minimum total cases over other precautionary measures. The gatherings penalties had no real effect in reducing infected cases as the other two precautionary measures. Therefore, in future similar circumstances, we recommend first applying the partial curfew and the whole curfew for some cities, and not considering the gatherings penalties as an effective precautionary measure. We also recommend re-study the application of the grouping penalty, to identify the reasons behind the lack of its effectiveness in reducing the number of infected cases.

An Algorithm of Solution for the Exceptional Field Problem in the Speculative Partial Redundancy Elimination(SPRE) Optimization (추론적 부분 중복 제거의 최적화 예외 영역 문제 해결 알고리즘)

  • Shin, Hyun-Deok;Ahn, Heui-Hak
    • The KIPS Transactions:PartA
    • /
    • v.13A no.6 s.103
    • /
    • pp.489-494
    • /
    • 2006
  • This paper improves the algorithms for Speculative Partial Redundancy Elimination(SPRE) proposed by Knoop et al. This research brings up an issue concerning a field to which SPRE cannot be applied, and suggests a solution to the problem. The Improved SPRE algorithm performs the execution speed optimization based on the information on the execution frequency from profiling and the memory space optimization.

An Algorithm for Resource-Unconstrained Earliness-Tardiness Problem with Partial Precedences (자원 제약이 없는 환경에서 부분 우선순위를 고려한 Earliness-Tardiness 최적 일정계획 알고리즘)

  • Ha, Byung-Hyun
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.38 no.2
    • /
    • pp.141-157
    • /
    • 2013
  • In this paper, we consider the minimization of the total weighted earliness-tardiness penalty of jobs, regarding the partial precedences between jobs. We present an optimal scheduling algorithm in O(n(n+m log m)) where n is the number of jobs and m is the number of partial precedences. In the algorithm, the optimal schedule is constructed iteratively by considering each group of contiguous jobs as a block that is represented by a tree.

A Practical Improvement to the Partial Redundancy Elimination in SSA Form

  • Park, Jong-Soo;Lee, Jae-Jin
    • Journal of Computing Science and Engineering
    • /
    • v.2 no.3
    • /
    • pp.301-320
    • /
    • 2008
  • Partial redundancy elimination (PRE) is an interesting compiler optimization because of its effectiveness and generality. Among many PRE algorithms, the one in static single assignment form (SSAPRE) has benefits over other bit-vector-based PRE algorithms. It preserves the properties of the SSA form after PRE and exploits the sparsity of the SSA form, resulting in reduced analysis and optimization time. This paper presents a practical improvement of the SSAPRE algorithm that further reduces the analysis and optimization time. The underlying idea is removing unnecessary ${\Phi}$'s during the ${\Phi}$-Insertion phase that is the first step of SSAPRE. We classify the expressions into three categories: confined expressions, local expressions, and the others. We show that unnecessary ${\Phi}$'s for confined and local expressions can be easily detected and removed. We implement our locality-based SSAPRE algorithm in a C compiler and evaluate its effectiveness with 20 applications from SPEC benchmark suites. In our measurements, on average 91 of ${\Phi}$'s identified by the original demand-driven SSAPRE algorithm are unnecessary for PRE. Pruning these unnecessary ${\Phi}$'s in the ${\Phi}$-Insertion phase makes our locality-based SSAPRE algorithm 1.8 times faster, on average, than the original SSAPRE algorithm.

The Design of Optimized Type-2 Fuzzy Neural Networks and Its Application (최적 Type-2 퍼지신경회로망 설계와 응용)

  • Kim, Gil-Sung;Ahn, Ihn-Seok;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.8
    • /
    • pp.1615-1623
    • /
    • 2009
  • In order to develop reliable on-site partial discharge (PD) pattern recognition algorithm, we introduce Type-2 Fuzzy Neural Networks (T2FNNs) optimized by means of Particle Swarm Optimization(PSO). T2FNNs exploit Type-2 fuzzy sets which have a characteristic of robustness in the diverse area of intelligence systems. Considering the on-site situation where it is not easy to obtain voltage phases to be used for PRPDA (Phase Resolved Partial Discharge Analysis), the PD data sets measured in the laboratory were artificially changed into data sets with shifted voltage phases and added noise in order to test the proposed algorithm. Also, the results obtained by the proposed algorithm were compared with that of conventional Neural Networks(NNs) as well as the existing Radial Basis Function Neural Networks (RBFNNs). The T2FNNs proposed in this study were appeared to have better performance when compared to conventional NNs and RBFNNs.

SOLVING OF SECOND ORDER NONLINEAR PDE PROBLEMS BY USING ARTIFICIAL CONTROLS WITH CONTROLLED ERROR

  • Gachpazan, M.;Kamyad, A.V.
    • Journal of applied mathematics & informatics
    • /
    • v.15 no.1_2
    • /
    • pp.173-184
    • /
    • 2004
  • In this paper, we find the approximate solution of a second order nonlinear partial differential equation on a simple connected region in $R^2$. We transfer this problem to a new problem of second order nonlinear partial differential equation on a rectangle. Then, we transformed the later one to an equivalent optimization problem. Then we consider the optimization problem as a distributed parameter system with artificial controls. Finally, by using the theory of measure, we obtain the approximate solution of the original problem. In this paper also the global error in $L_1$ is controlled.

Partial Transmit Sequence Optimization Using Improved Harmony Search Algorithm for PAPR Reduction in OFDM

  • Singh, Mangal;Patra, Sarat Kumar
    • ETRI Journal
    • /
    • v.39 no.6
    • /
    • pp.782-793
    • /
    • 2017
  • This paper considers the use of the Partial Transmit Sequence (PTS) technique to reduce the Peak-to-Average Power Ratio (PAPR) of an Orthogonal Frequency Division Multiplexing signal in wireless communication systems. Search complexity is very high in the traditional PTS scheme because it involves an extensive random search over all combinations of allowed phase vectors, and it increases exponentially with the number of phase vectors. In this paper, a suboptimal metaheuristic algorithm for phase optimization based on an improved harmony search (IHS) is applied to explore the optimal combination of phase vectors that provides improved performance compared with existing evolutionary algorithms such as the harmony search algorithm and firefly algorithm. IHS enhances the accuracy and convergence rate of the conventional algorithms with very few parameters to adjust. Simulation results show that an improved harmony search-based PTS algorithm can achieve a significant reduction in PAPR using a simple network structure compared with conventional algorithms.

Optimization of process variables in batch-type MOD process (일괄처리방식을 이용한 MOD 공정의 변수 최적화)

  • Chung, Kook-Chae;Yoo, Jai-Moo;Ko, Jae-Woong;Kim, Young-Kuk;Wang, X.L.;Dou, S.X.
    • Progress in Superconductivity and Cryogenics
    • /
    • v.8 no.1
    • /
    • pp.23-25
    • /
    • 2006
  • Optimization of process variables, including oxygen and water partial pressure and also an nesting temperature, was performed in batch-type process to fabricate YBCO films on LaAlO3 single crystal. In this work, YBCO oxide powder was used as a starting precursor for metal-organic deposition(MOD)method. The precursor films were fabricated in batch furnace and they were converted to the epitaxial YBCO films at the same furnace with varying the process variables. The oxygen partial pressure was varied from 100ppm to 2000ppm and the water partial pressure from 1.2% to 12.2%. The window for optimal P(O2) was narrow about 700ppm for batch-type process. YBCO films in bathc-thype MOD process were optimized at 740-770oC and P(H2O) of 2.3%-7.3%.

Processing of Code Optimization in CTOC (CTOC에서 코드 최적화 수행)

  • Kim, Ki-Tae;Yoo, Weon-Hee
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.5
    • /
    • pp.687-697
    • /
    • 2007
  • Although the Java bytecode has numerous advantages, there are also shortcomings such as slow execution speed and difficulty in analysis. Therefore, in order for the Java class file to be effectively executed under the execution environment such as the network, it is necessary to convert it into optimized code. We implemented CTOC for transforming to optimized code. In Optimization, SSA Form that distinguish variable by assignment is used to determine value and type statically. Copy propagation, dead code elimination optimization is applied to SSA Form. However, existing SSA Form is related to variable than expression. Therefore, in this paper, to performing optimization to SSA Form expression, after performing copy propagation and dead code elimination, in addition to that, partial redundant expression elimination is performed

  • PDF