• Communications for Statistical Applications and Methods
• /
• 제25권4호
• /
• pp.431-442
• /
• 2018

This paper highlights the computational explosion issues in the autoregressive moving average approach of frequency estimation of sinusoidal data with a large sample size. A new algorithm is proposed to circumvent the computational explosion difficulty in the conditional least-square estimation method. Notice that sinusoidal pattern can be generated by a non-invertible non-stationary autoregressive moving average (ARMA) model. The computational explosion is shown to be closely related to the non-invertibility of the equivalent ARMA model. Simulation studies illustrate the computational explosion phenomenon and show that the proposed algorithm can efficiently overcome computational explosion difficulty. Real data example of sunspot number is provided to illustrate the application of the proposed algorithm to the time series data exhibiting sinusoidal pattern.

• Nuclear Engineering and Technology
• /
• 제55권2호
• /
• pp.756-768
• /
• 2023

Neutron transport calculations are extremely challenging due to the high computational cost of large and complex problems. A multilevel octree grid algorithm (MLTG) of discrete ordinates method was developed to improve the modeling accuracy and simulation efficiency on 3-D Cartesian grids. The Balakovo-3 VVER-1000 neutron dosimetry benchmark is calculated to verify and validate this numerical technique. A simplified S₂ synthetic acceleration is used in the MLTG calculation method to improve the convergence of the source iterations. For the triangularly arranged fuel pins, we adopt a source projection algorithm to generate pin-by-pin source distributions of hexagonal assemblies. MLTG provides accurate geometric modeling and flexible fixed source description at a lower cost than traditional Cartesian grids. The total number of meshes is reduced to 1.9 million from the initial 9.5 million for the Balakovo-3 model. The numerical comparisons show that the MLTG results are in satisfactory agreement with the conventional S_N method and experimental data, within the root-mean-square errors of about 4% and 10%, respectively. Compared to uniform fine meshing, approximately 70% of the computational cost can be saved using the MLTG algorithm for the Balakovo-3 computational model.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.517-520
• /
• 2003

A quasi-optimization algorithm for generating a chain restaurant work scheduling (WS) is proposed based on Genetic Algorithm with fuzzy logic, where the whole weekly chain restaurant WS problem is decomposed to 7 daily WS problems and a combined weekly WS problem. Experimental result shows that a weekly schedule for 15 workers and 24 hours in a chain restaurant is produced in 6 minutes using the proposed algorithm implemented with C++ and executed on a PC(Athlon XP 1900+), where the quality of WS is satisfactorily evaluated by professional experts.

• 한국CDE학회논문집
• /
• 제6권3호
• /
• pp.174-183
• /
• 2001

This study proposes an improved genetic algorithm (GA) to derive solutions for facility layout problems having inner walls and passages. The proposed algorithm models the layout of facilities on a flour-segmented chromosome. Improved solutions are produced by employing genetic operations known as selection, crossover, inversion, mutation, and refinement of these genes for successive generations. All relationships between the facilities and passages are represented as an adjacency graph. The shortest path and distance between two facilities are calculated using Dijkstra's algorithm of graph theory. Comparative testing shows that the proposed algorithm performs better than other existing algorithm for the optimal facility layout design. Finally, the proposed algorithm is applied to ship compartment layout problems with the computational results compared to an actual ship compartment layout.

• 전자공학회논문지A
• /
• 제33A권5호
• /
• pp.1-9
• /
• 1996

In this paper, we propose an efficient computational algorithm that can reduce significantly the computational complexity of the ML optimum multiuser detector known as the most excellent detector in synchronous code division multiple access channels. The proposed detector uses the sequential detection algorithm based on the alternating maximization appraoch to obtain the ML estimates. As initial estimates for this sequential algorithm, we can use the estimated values obtained by the conventional single-user detector, the linear decorrelating multiuser detector, or the decorrelating decision-feedback muliuser detector, the linear decorrelating multiuser detector, or the decorrelating decision-feedback multiuser detector. We have performed computer simulations in order to see the convergence behaviors and the detection performance of the propsoed algorithm in terms of initial algorithms and the number of users, and then to compare the computational complexity with that of the ML optimum multiuser detector. From the results, we have seen that the proposed alternating maximization detector has nearly equal detction performance with that of the ML optimum multiuser detctor in only a few iteration.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2000년도 가을 학술발표회논문집
• /
• pp.40-47
• /
• 2000

One of the drawbacks of GA-based structural optimization is that the fitness evaluation of a population of hundreds of individuals requiring hundreds of structural analyses at each CA generation is computational too expensive. Therefore, a parallel genetic algorithm is developed for structural optimization on a cluster of personal computers in this paper. Based on the parallel genetic algorithm, a population at every generation is partitioned into a number of sub-populations equal to the number of slave computers. Parallelism is exploited at sub-population level by allocationg each sub-population to a slave computer. Thus, fitness of a population at each generation can be concurrently evaluated on a cluster of personal computers. For implementation of the algorithm a virtual distributed computing system in a collection of personal computers connected via a 100 Mb/s Ethernet LAN. The algorithm is applied to the minimum weight design of a steel structure. The results show that the computational time requied for serial GA-based structural optimization process is drastically reduced.

• Communications for Statistical Applications and Methods
• /
• 제7권1호
• /
• pp.47-54
• /
• 2000

This article is concerned with the algorithm for the Chebyshev estimation with/without linear equality and/or inequality constraints. The algorithm employs a linear scaling transformation scheme to reduce the computational burden which is induced when the data set is quite large. The convergence of the proposed algorithm is proved. And the updating and orthogonal decomposition techniques are considered to improve the computational efficiency and numerical stability.

• 한국컴퓨터산업학회논문지
• /
• 제5권9호
• /
• pp.1079-1088
• /
• 2004

일반적으로 코드 모션 알고리즘은 계산적 최적화와 레지스터 과부하와 연관되는 실행시간 최적화를 수행 한다. 본 논문은 계산적 최적화와 수명적 최적화에 더하여 코드의 크기를 고려하는 희소 코드 모션 알고리즘을 제안한다. 희소 코드 모션 알고리즘에서 BCM 알고리즘은 계산적으로 최적 코드 모션을 수행하고, LCM 알고리즘은 레지스터 과부하를 감소시킨다. 희소 코드 모션 알고리즘은 블필요한 코드 모션을 억제시키기 때문에 계산적으로나 수명적으로 최적인 알고리즘이다. 희소 코드 모션 알고리즘은 성능평가를 통하여 기존의 연구보다 프로그램의 능률 및 실행시간을 향상시켰다.

• 디지털산업정보학회논문지
• /
• 제9권1호
• /
• pp.95-102
• /
• 2013

This paper covers nulling algorithm. In this algorithm, we assume that nulling points are already known. In general, nulling algorithm using matrix equation was utilized. But, this algorithm is pointed out that computational complexity is disadvantage. So, we choose gradient method to reduce the computational complexity. In order to further reduce the computational complexity, we propose approximate gradient method using characteristic of trigonometric functions. The proposed method has same performance compared with conventional method while having half the amount of computation when the number of antenna and nulling point are 20 and 1, respectively. In addition, we could virtually eliminate the trigonometric functions arithmetic. Trigonometric functions arithmetic cause a big problem in actual implementation like FPGA processor(Field Programmable gate array). By utilizing the above algorithm in a multi-cell environment, beamforming gain can be obtained and interference can be reduced at same time. By the above results, the algorithm can show excellent performance in the cell boundary.

• 전산구조공학
• /
• 제2권2호
• /
• pp.85-92
• /
• 1989

이 논문은 C언어의 특성에 맞도록 skyline algorithm을 수정하여 제시하였다. 수정된 algorithm은 FORTRAN을 위한 종래의 algorithm에 비해서 프로그램의 구조를 개선하고 효율성을 높혀주는 이점이 있다. 강성행열의 조립과 분해를 단순화시키므로 프로그램의 실행시간이 현저히 단축된다. 장차 유한요소해석 프로그램의 개발에 실용적으로 활용될 수 있도록 C로 작성한 skyline algorithm의 원시프로그램 리스트를 수록하였다.