• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.1137-1139
• /
• 1987

We discuss several issues related to the sorting algorithms on hypercube machine. The efficiencies of the algorithms are compared under the simpler assumption and the load balancing problem arising from the various algorithms and the data distribution is also discussed.

• 대한전기학회논문지
• /
• 제36권12호
• /
• pp.839-847
• /
• 1987

The probabilistic production cost is calculated by the Expected Incremental Generation Cost Curve(EIGC) method based on the multi-state and multi-block operating conditions. For this, A new algorithm for determining production cost by the EIGC and the generation availability curve (GAC) had been developed in order to realize better economic olad dispatch and better reliability for power system operation. The simpler method for determining the EIGC and the GAC is proposed for convenience and saving in computation time.

• Communications for Statistical Applications and Methods
• /
• 제4권1호
• /
• pp.177-183
• /
• 1997

A data-adaptive order selection procedure is proposed for local polynomial nonparametric regression. For each given polynomial order, bias and variance are estimated and the adaptive polynomial order that has the smallest estimated mean squared error is selected locally at each location point. To estimate mean squared error, empirical bias estimate of Ruppert (1995) and local polynomial variance estimate of Ruppert, Wand, Wand, Holst and Hossjer (1995) are used. Since the proposed method does not require fitting polynomial model of order higher than the model order, it is simpler than the order selection method proposed by Fan and Gijbels (1995b).

• 한국윤활학회:학술대회논문집
• /
• 한국윤활학회 1990년도 제11회 학술강연회초록집
• /
• pp.73-91
• /
• 1990

Incompressible turbulent flow in a single cavity of the stepped multi-cavity labyrinth seal is numerically analyzed to investigate an effect of the shaft speed on the leakage. SIMPLER algorithm is used to solve governing equations, and low-Reynolds k-$\varepsilon$ turbulence model as outlined by Launder and Sharma is adopted to predict turbulent flow. Pressure drops for the cavity with and without the groove are evaluated for four different Reynolds numbersand three different shaft speeds.

• Tribology and Lubricants
• /
• 제6권2호
• /
• pp.27-33
• /
• 1990

Incompressible turbulent flow in a single cavity of the stepped multi-cavity labyrinth seal is numerically analyzed to investigate an effect of the shaft speed on the leakage. SIMPLER algorithm is used to solve governing equations, and low-Reynolds k-$\varepsilon$ turbulence model as outlined by Launder and Sharma is adopted to predict turbulent flow. Pressure drops for the cavity with and without the groove are evaluated for four different Reynolds numbers and three different shaft speeds.

• 한국정보디스플레이학회:학술대회논문집
• /
• 한국정보디스플레이학회 2003년도 International Meeting on Information Display
• /
• pp.702-705
• /
• 2003

We reported the result of driving PDP's in selective erase scheme and three wall charge states. Compared to the selective write driving scheme, the selective erase scheme achieved flicker free half-ON state with much simpler driving waveforms than the selective write scheme. We believed that this improvement was possible since the cells entering the address period with enough wall charges to modulate easily with.

• Journal of the Korean Data and Information Science Society
• /
• 제18권4호
• /
• pp.1135-1143
• /
• 2007

The singular value decomposition and the spectral decomposition are the useful methods in the area of matrix computation for multivariate techniques such as principal component analysis and multidimensional scaling. These techniques aim to find a simpler geometric structure for the data points. The singular value decomposition and the spectral decomposition are the methods being used in these techniques for this purpose. In this paper, the singular value decomposition and the spectral decomposition are compared.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2002년도 ICCAS
• /
• pp.38.3-38
• /
• 2002

$\textbullet$ The topological map using a thinning needs much simpler computation than that using a Voronoi. $\textbullet$ A thinning can provide much information on the environment (additional nodes). $\textbullet$ Each node created in a local map is considered as temporary and redundant nodes are discarded. $\textbullet$ A global topological map can be built fast and correctly through a thinning algorithm. $\textbullet$ Path planning can be easily achieved with a topological map.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(2)
• /
• pp.136-139
• /
• 2000

In this paper, we propose a prime code and a new cryptographic algorithm for encryption and decryption as its application. The characteristics of prime numbers with irregular distribution and uniqueness are used to generate the prime code. Based on the prime code, an encryption algorithm for secret key is presented. Since the algorithm requires simpler operations than existing encryption such as DES, the burden for hardware implementation of the encryption and decryption process is alleviated.

• ETRI Journal
• /
• 제28권6호
• /
• pp.790-792
• /
• 2006

The performance of a turbo decoder depends strongly on the number of iterations in its decoding process. It is necessary to stop the decoding process at an appropriate moment to alleviate the serious burden, in terms of both the computational speed and latency, part of which is associated with too many iterations. In this letter, we introduce a criterion for finding the opportune moment to stop the decoding process, called a hard decision aided criterion based on bit interleaved parity, which is known to have much simpler hardware logic, compared with other schemes, and does not lead to any significant performance degradation.