• Journal of Astronomy and Space Sciences
• /
• 제17권2호
• /
• pp.249-256
• /
• 2000

It has been developed to calculate fuel budget for a geostationary communication and broadcasting satellite. It is quite essential that the pre-launch fuel budget estimation must account for the deterministic transfer and drift orbit maneuver requirements. After on-station, the calculation of satellite lifetime should be based on the estimation of remaining fuel and assessment of actual performance. These estimations step from the proper algorithms to produce the prediction of satellite lifetime. This paper concentrates on the fuel estimation method that was studied for calculation of the propellant budget by using the given algorithms. Applications of this method are discussed for a communication and broadcasting satellite.

• 대한산업공학회지
• /
• 제24권4호
• /
• pp.559-569
• /
• 1998

Cellular manufacturing system (CMS) has been recognized as an alternative to improve manufacturing productivity in conventional batch-type manufacturing systems through reducing set-up times, work-in-process inventories and throughput times by means of group technology. Most of the studies on the design of CMS assumed that each part has a unique process plan, and that its demand is known as a deterministic value despite of the probabilistic nature of the real world problems. This study suggests an approach for designing CMS, considering both alternative process plans and uncertain demand. A mathematical model is presented to show how to minimize the expected amortized and operating costs satisfying these two relaxations. Four heuristic algorithms are developed based on tabu search which is well suited for getting an optimal or near-optimal solution. Example problems are carried out to illustrate the heuristic algorithms and each of them is compared with the deterministic counterpart.

• 대한전자공학회논문지SD
• /
• 제40권8호
• /
• pp.610-618
• /
• 2003

테스터를 사용하는 테스트 방법이 매우 비싸고 동작속도에서의 테스트가 어려운 상황에서 BIST의 출현 은 이러한 난점을 해결하는 좋은 방법이다. 하지만, 이러한 BIST에도 해결해야 할 문제점들이 많다. 의사 무작위 테스트시 패턴 카운터와 비트 카운터의 역할이 단순히 카운팅만 하는데 한정되어 있으므로 이들 카운터를 패턴을 생성하는 역할에도 이용함으로써 BIST의 효율을 증대시키고자 한다. 새로운 BIST 구조는 LFSR이 아닌 카운터로 패턴을 생성하고 LFSR로 이의 동작을 무작위하게 또는 의도적으로 조정함으로써 다른 테스트 성능의 저하 없이 테스트 하드웨어를 축소하는 방법을 제안한다. 결정 테스트를 위한 하드웨어가 너무 크게 되는 단점을 해결하고자 본 논문에서의 실험은 실험결과에서 의사 무작위 테스트와 결정 테스트의 성능을 고장검출을, 테스트 시간과 하드웨어 관련 인자들로 표현한다.

• 경영과학
• /
• 제17권2호
• /
• pp.175-187
• /
• 2000

The stochastic vehicle routing problem (VRP) is a problem of growing importance since it includes a reality that the deterministic VRP does not have. The stochastic VRP arises whenever some elements of the problem are random. Common examples are stochastic service quantities and stochastic travel times. The solution methodologies for the stochastic VRP are very intricate and regarded as computationally intractable. Even heuristics are hard to develope and implement. On possible way of solving it is to apply a solution for the deterministic VRP. This paper presents a performance evaluation of four simple heuristic for the deterministic VRP is a stochastic environment. The heuristics are modified to consider the time window constraints. The computational results show that some of them perform very well in different cases of the stochastic VRP.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.301-302
• /
• 2007

A speech enhancement algorithm based on both a decomposition of speech into deterministic and stochastic components and a psychoacoustic model is proposed. Noisy speech is decomposed into deterministic and stochastic components, and then each component is enhanced preserving its individual characteristics. A psychoacoustic model is taken into account when enhancing the stochastic component. Simulation results show that the proposed algorithm performs better than some of the more popular algorithms.

• ETRI Journal
• /
• 제15권3_4호
• /
• pp.47-59
• /
• 1994

A capacity expansion planning problem with buy-or-lease decisions is considered. Demands for capacity are deterministic and are given period-dependently at each period. Capacity additions occur by buying or leasing a capacity, and leased capacity at any period is reconverted to original source after a fixed length of periods, say, lease period. All cost functions (buying, leasing and idle costs) are assumed to be concave. And shortages of capacity and disposals are not considered. The properties of an optimal solution are characterized. This is then used in a tree search algorithm for the optimal solution and other two algorithms for a near-optimal solution are added. And these algorithms are illustrated with numerical examples.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권4호
• /
• pp.711-725
• /
• 2013

A heuristic with multi-byte suffix matching plays an important role in real pattern matching algorithms. By skipping many characters at a time in the process of comparing a given pattern with the text, the pattern matching algorithm based on a heuristic with multi-byte suffix matching shows a faster average search time than algorithms based on deterministic finite automata. Based on various experimental results and simulations, the previous works show that the pattern matching algorithms with multi-byte suffix matching performs well. However, there have been limited studies on the mathematical model for analyzing the performance in a standard manner. In this paper, we propose a new probabilistic model, which evaluates the performance of a heuristic with multi-byte suffix matching in an average-case search. When the theoretical analysis results and experimental results were compared, the proposed probabilistic model was found to be sufficient for evaluating the performance of a heuristic with suffix matching in the real pattern matching algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권10호
• /
• pp.5079-5099
• /
• 2018

Regarding to the huge number of connections and the large flow of data on the Internet, Intrusion Detection System (IDS) has a difficulty to detect attacks. Moreover, irrelevant and redundant features influence on the quality of IDS precisely on the detection rate and processing cost. Feature Selection (FS) is the important technique, which gives the issue for enhancing the performance of detection. There are different works have been proposed, but a map for understanding and constructing a state of the FS in IDS is still need more investigation. In this paper, we introduce a survey of feature selection algorithms for intrusion detection system. We describe the well-known approaches that have been proposed in FS for IDS. Furthermore, we provide a classification with a comparative study between different contribution according to their techniques and results. We identify a new taxonomy for future trends and existing challenges.

• 대한의용생체공학회:의공학회지
• /
• 제29권3호
• /
• pp.231-238
• /
• 2008

Nelder-Mead downhill simplex method (DSM), a kind of deterministic optimization algorithms, has been used extensively for magnetoencephalography(MEG) dipolar source localization problems because it dose not require any functional differentiation. Like many other deterministic algorithms, however, it is very sensitive to the choice of initial positions and it can be easily trapped in local optima when being applied to complex inverse problems with multiple simultaneous sources. In this paper, some modifications have been made to make up for DSM's limitations and improve the accuracy of DSM. First of all, initial point determination method for DSM using magnetic fields on the sensor surface was proposed. Secondly, Univariant-DSM combined DSM with univariant method was proposed. To verify the performance of the proposed method, it was applied to simulated MEG data and practical MEG measurements.

• 한국산업융합학회 논문집
• /
• 제25권3호
• /
• pp.467-476
• /
• 2022

The Bank of Korea raised the benchmark interest rate by a quarter percentage point to 1.75 percent per year, and analysts predict that South Korea's policy rate will reach 2.00 percent by the end of calendar year 2022. Furthermore, because market volatility has been significantly increased by a variety of factors, including rising rates, inflation, and market volatility, many investors have struggled to meet their financial objectives or deliver returns. Banks and financial institutions are attempting to provide Robo-Advisors to manage client portfolios without human intervention in this situation. In this regard, determining the best hyper-parameter combination is becoming increasingly important. This study compares some activation functions of the Deep Deterministic Policy Gradient(DDPG) and Twin-delayed Deep Deterministic Policy Gradient (TD3) Algorithms to choose a sequence of actions that maximizes long-term reward. The DDPG and TD3 outperformed its benchmark index, according to the results. One reason for this is that we need to understand the action probabilities in order to choose an action and receive a reward, which we then compare to the state value to determine an advantage. As interest in machine learning has grown and research into deep reinforcement learning has become more active, finding an optimal hyper-parameter combination for DDPG and TD3 has become increasingly important.