• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.7
• /
• pp.49-58
• /
• 1997

In process planning for pocket machining, the selection of tool size, tool path, overlap distance, and the calculation of machining time are very important factors to obtain the optimal process planning result. Among those factors, the tool size is the most important one because the others depend on tool size. And also, it is not easy to determine the optimal tool size even though the shape of pocket is simple. Therefore, the optimal selection of tool size is the most essential task in process planning for machining a pocket. This paper presents a method for selecting optimal toos in pocket machining. The branch and bound method is applied to select the optimal tools which minimize the machining time by using the range of feasible tools and the breadth-first search.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.16 no.5
• /
• pp.564-581
• /
• 2016

We present an efficient hardware prime generator that generates a prime p by combining trial division and Fermat test in parallel. Since the execution time of this parallel combination is greatly influenced by the number k of the smallest odd primes used in the trial division, it is important to determine the optimal k to create the fastest parallel combination. We present probabilistic analysis to determine the optimal k and to estimate the expected running time for the parallel combination. Our analysis is conducted in two stages. First, we roughly narrow the range of optimal k by using the expected values for the random variables used in the analysis. Second, we precisely determine the optimal k by using the exact probability distribution of the random variables. Our experiments show that the optimal k and the expected running time determined by our analysis are precise and accurate. Furthermore, we generalize our analysis and propose a guideline for a designer of a hardware prime generator to determine the optimal k by simply calculating the ratio of M to D, where M and D are the measured running times of a modular multiplication and an integer division, respectively.

• The Journal of Information Systems
• /
• v.27 no.3
• /
• pp.123-140
• /
• 2018

Purpose The purpose of this study is to explore the optimal trading frequency which is useful for stock price prediction by using deep learning for charting image data. We also want to identify the appropriate time for accurate forecasting of stock price when performing pattern analysis. Design/methodology/approach In order to find the optimal trading frequency patterns and forecast timings, this study is performed as follows. First, stock price data is collected using OpenAPI provided by Daishin Securities, and candle chart images are created by data frequency and forecasting time. Second, the patterns are generated by the charting images and the learning is performed using the CNN. Finally, we find the optimal trading frequency patterns and forecasting timings. Findings According to the experiment results, this study confirmed that when the 10 minute frequency data is judged to be a decline pattern at previous 1 tick, the accuracy of predicting the market frequency pattern at which the market decreasing is 76%, which is determined by the optimal frequency pattern. In addition, we confirmed that forecasting of the sales frequency pattern at previous 1 tick shows higher accuracy than previous 2 tick and 3 tick.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.1
• /
• pp.1-5
• /
• 2014

In this paper, we propose an optimal fixed-lag FIR (Finite-Impulse-Response) smoother for a class of discrete time-varying state-space signal models. The proposed fixed-lag FIR smoother is linear with respect to inputs and outputs on the recent finite horizon and estimates the delayed state so that the variance of the estimation error is minimized with the unbiased constraint. Since the proposed smoother is derived with system inputs, it can be adapted to feedback control system. Additionally, the proposed smoother can give more general solution than the optimal FIR filter, because it reduced to the optimal FIR filter by setting the fixed-lag size as zero. A numerical example is presented to illustrate the performance of the proposed smoother by comparing with an optimal FIR filter and a conventional fixed-lag Kalman smoother.

• Journal of the Korean Society for Precision Engineering
• /
• v.13 no.4
• /
• pp.163-173
• /
• 1996

Stereolithography is a process used to rapidly produce polymer components directly form a computer representation of the part. There are several considerations to be made for the efficient use of the process. Especially, the build-up orientation of part critically affects the part accuracy, total build time and the volume of support structures. The purpose of tis study is to determine the optimal build-up part orientation for the SLA process with improving part accuracy, and minimizing total build time and the volume of support structures. The forst factor is related to the area of surfaces whioch have staircase protrusions after solidification, the second factor is related to the total number of layers, and the third factor is related to the area of the surfaces which need to be supported with support structures. An algorithm is developed to calculate the staircase area, quantifying the process errors by the volume of materials supposed to be removed or added to the part, and the optimal layer thickness for the SLA system which can handle the variable layer thickness. So the optima l part orientation is determined based on the user's selections of primary criter- ion and the optimal thickness of layers is calculated at any part orientations.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.622-624
• /
• 2005

This paper proposes a time series prediction method for the nonllinear system using the fuzzy system and its genetic algorithm, At first, we obtain the optimal fuzzy membership function using the genetic algorithm. With the optimal fuzzy rules and its input differences, a better time prediction series system may be obtained. We obtain a good result for the time prediction of the electric load.

• Spatial Information Research
• /
• v.17 no.3
• /
• pp.361-370
• /
• 2009

As the increasing interests of spatial information for different application area such as disaster management, there are many researches and development of indoor spatial data models and real-time evacuation management systems. The application requires to determine and optical paths in emergency situation, to support evacuees and rescuers. The optimal path in this study is defined to guide rescuers, So, the path is from entrance to the disaster site (room), not from rooms to entrances in the building. In this study, we propose a time-dependent optimal routing algorithm to develop real-time evacuation systems. The network data that represents navigable spaces in building is used for routing the optimal path. Associated information about environment (for example, number of evacuees or rescuers, capacity of hallways and rooms, type of rooms and so on) is assigned to nodes and edges in the network. The time-dependent optimal path is defined after concerning environmental information on the positions of evacuees (for avoiding places jammed with evacuees) and rescuer at each time slot. To detect the positions of human beings in a building per time period, we use the results of evacuation simulation system to identify the movement patterns of human beings in the emergency situation. We use the simulation data of five or ten seconds time interval, to determine the optimal route for rescuers.

• International Journal of Automotive Technology
• /
• v.6 no.1
• /
• pp.71-77
• /
• 2005

This paper presents a systematic approach which determines the optimal period to minimize performance measure subject to the schedulability constraints of a real-time control system by formulating the scheduling problem as an optimal problem. The performance measure is derived from the summation of end-to-end response times of processed I/Os scheduled by the static cyclic method. The schedulability constraint is specified in terms of allowable resource utilization. At first, a uniprocessor case is considered and then it is extended to a distributed system connected through a communication link, local-inter network, UN. This approach is applied to the design of an automotive body control system in order to validate the feasibility through a real example. By using the approach, a set of optimal periods can easily be obtained without complex and advanced methods such as branch and bound (B&B) or simulated annealing.

• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.2
• /
• pp.156-161
• /
• 1997

In this thesis, based on Genetic Algorithm, a new route search algorithm is presented to search an optimal route between the origin and the destination in intelligent route guidance systems in order to minimize the route traveling time. The proposed algorithm is effectively employed to complex road networks which have diverse turn constrains, time-delay constraints due to cross signals, and stochastic traffic volume. The algorithm is also shown to significantly promote search efficiency by changing the population size of path individuals that exist in each generation through the concept of age and lifetime to each path individual. A virtual road-traffic network with various turn constraints and traffic volume is simulated, where the suggested algorithm promptly produces not only an optimal route to minimize the route cost but also the estimated travel time for any pair of the origin and the destination, while effectively avoiding turn constraints and traffic jam.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.514-518
• /
• 2003

In this paper, we investigate three dimensional optimal evasive maneuver patterns for air-to-surface attack missiles against proportionally navigated anti-air defense missiles. Interception error of the defense missile can be generated by evasive maneuver of the attack missile during the time of flight for which the defense missile intercepts the attack missile. Time varying weighted sum of the inverse of these interception errors forms a performance index to be minimized. Direct parameter optimization technique using CFSQP is adopted to get the attack missile's optimal evasive maneuver patterns according to parameter changes of both the attack missile and the defense missile such as maneuver limit and time constant of autopilot approximated by the 1st order lag system. The overall shape of resultant optimal evasive maneuver to enhance the survivability of air-to-surface missiles against proportionally navigated anti-air missiles is a kind of deformed barrel roll.