• 한국전자통신학회논문지
• /
• 제5권3호
• /
• pp.233-238
• /
• 2010

본 논문에서는 무선 망 설계에 필요한 전자파 전파 특성 예측을 위한 방법 중 하나인 광선 추적법을 이용하여 2차원 불규칙 조면에서의 전파 특성 조사하기 위한 이산 광선 추적법을 제안 하였다. 이 방법은 불규칙 조면과 광선 추적에도 이산화 방법을 적용한다. 제안한 방법은 불규칙 조면 생성에 컴퓨터 메모리를 절약할 수 있으며, 광선 추적에 소요되는 계산 시간을 단축 할 수가 있다. 2차원 불규칙 조면에 대해 이산 광선 추적법을 적용하여 전계 분포에 대한 수치 계산을 행하였으며, 이산 광선 추적법의 유효성에 대해서도 조사하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.887-890
• /
• 1998

We present a novel multi-resolution block matching algorithm (BMA) for fast motion estimation. At the coarsest level, a full search BMA (FSBMA) is performed for searching complex or random motion. Concurrently, spatial correlation of motion vector (MV) field is used for searching continuous motion. Here we present an efficient method for searching full resolution MVs without MV decimation even at the coarsest leve. After the coarsest level search, two or three initial MV candidates are chosen for the next level. At the further levels, the MV candidates are refined within much smaller search areas. Simulation results show that in comparison with FSBMA, the proposed BMA achieves a speed-up factor over 710 with minor PSNR degradation of 0.2dB at most, under a normal MPEG2 coding environment. Furthermore, our scheme is also suitable for hardware implementation due to regular data-flow.

• 디지털산업정보학회논문지
• /
• 제9권4호
• /
• pp.135-141
• /
• 2013

String matching is one of the key algorithms in network security and many areas could be benefit from a faster string matching algorithm. Based on the most efficient string matching algorithm in sual applications, the Boyer-Moore (BM) algorithm, a novel algorithm called RQS is proposed. RQS utilizes an improved bad character heuristic to achieve bigger shift value area and an enhanced good suffix heuristic to dramatically improve the worst case performance. The two heuristics combined with a novel determinant condition to switch between them enable RQS achieve a higher performance than BM both under normal and worst case situation. The experimental results reveal that RQS appears efficient than BM many times in worst case, and the longer the pattern, the bigger the performance improvement. The performance of RQS is 7.57~36.34% higher than BM in English text searching, 16.26~26.18% higher than BM in uniformly random text searching, and 9.77% higher than BM in the real world Snort pattern set searching.

• 한국정보통신학회논문지
• /
• 제13권7호
• /
• pp.1422-1428
• /
• 2009

독립형 무선 인지 시스템은 보통 채널에 대한 면허를 가지는 기사용자가 사용하지 않는 빈 채널을 사용하는 2차 사용자로서 동작한다. 기존연구에서는 이와 같은 2차 사용자가 가용한 채널을 찾을 때, 순차 혹은 무작위로 채널을 선택하여 기사용자의 사용 유무를 확인하였다. 하지만 이러한 방법은 무선 채널의 특성에 맞지 않다. 그러므로 본 논문에서는 이전에 채널을 기사용자가 사용한 경우를 고려하여 가중치 값을 결정하고, 각 채널별 상태 값 중에서 작은 순서대로 채널을 선택함으로써 빈 채널을 찾는데 소요되는 시간을 줄이는 방법을 제안하고, 2차 사용자의 평균 채널 찾기 시간과 평균 전송 횟수의 관점에서 순차적, 무작위적 방법과 그 성능을 비교 분석 한다.

• 한국소음진동공학회논문집
• /
• 제12권6호
• /
• pp.478-487
• /
• 2002

This paper presents a hybrid method to compute the solutions of an optimization Problem. The present hybrid algorithm is the synthesis of an artificial life algorithm and the random tabu search method. The artificial life algorithm has the most important feature called emergence. The emergence is the result of dynamic interaction among the individuals consisting of the system and is not found in an individual. The conventional artificial life algorithm for optimization is a stochastic searching algorithm using the feature of artificial life. Emergent colonies appear at the optimum locations in an artificial ecology. And the locations are the optimum solutions. We combined the feature of random-tabu search method with the conventional algorithm. The feature of random-tabu search method is to divide any given region into sub-regions. The enhanced artificial life algorithm (EALA) not only converge faster than the conventional artificial life algorithm, but also gives a more accurate solution. In addition, this algorithm can find all global optimum solutions. The enhanced artificial life algorithm is applied to the optimum design of high-speed, short journal bearings and its usefulness is verified through an optimization problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권1호
• /
• pp.114-130
• /
• 2020

Balinese calendar is defined as a unique calendar system for combining solar-based and lunar-based system and assuming local system. It is considered as guidance of Balinese societies' activities management, starting from meeting arrangement, wedding ceremony, to religious ceremonies. Practically, it has developed in the form of printed Balinese calendar and electronic Balinese calendar, either web or mobile application. The core of the function is to find out the day with its various characteristics in the Balinese Calendar. In general, society usually asks the religious leader to find out the day in detail. The technology of NLP combined with models of pattern discoveries supports the arrangement of the interaction model in searching the good day in Balinese Calendar to equip the conventional searching system in the previous applications. This study will design a dialog model with AIML method in multi-parameter basis; therefore, the users will be dynamically able to use the searching content in various ways by chatting in similar with consulting to a religious leader. This model will be applied in a chatbot basis service in telegram machine. The addition of the context recognition section into 4 paterns has been successfully improve the ability of AIML to recognize input patterns with many criteria. Based on the testing with 50 random input patterns obtained a success rate of 92.5%.

• Annals of Clinical Neurophysiology
• /
• 제8권1호
• /
• pp.44-47
• /
• 2006

Background: The present study used magnetoencephalography (MEG) to investigate the neural substrates for modified version of Treisman's visual search task. Methods: Two volunteers who gave informed consent participated MEG experiment. One was 27- year old male and another was 24-year-old female. All were right handed. Experiment were performed using a 306-channel biomagnetometer (Neuromag LTD). There were three task conditions in this experiment. The first was searching an open circle among seven closed circles (open condition). The second was searching a closed circle among seven uni-directionally open circles (closed condition). And the third was searching a closed circle among seven eight-directionally open circles (random (closed) condition). In one run, participants performed one task condition so there were three runs in one session of experiment. During one session, 128 trials were performed during every three runs. One participant underwent one session of experiment. The participant pressed button when they found targets. Magnetic source localization images were generated using software programs that allowed for interactive identification of a common set of fiduciary points in the MRI and MEG coordinate frames. Results: In each participant we can found activations of anterior cingulate, primary visual and association cortices, posterior parietal cortex and brain areas in the vicinity of thalamus. Conclusions: we could find activations corresponding to anterior and posterior visual attention systems.

• Journal of information and communication convergence engineering
• /
• 제5권1호
• /
• pp.35-41
• /
• 2007

In this paper, a modified Fuzzy C-Means (MFCM) algorithm is presented for nonlinear blind channel equalization. The proposed MFCM searches the optimal channel output states of a nonlinear channel, based on the Bayesian likelihood fitness function instead of a conventional Euclidean distance measure. In its searching procedure, all of the possible desired channel states are constructed with the elements of estimated channel output states. The desired state with the maximum Bayesian fitness is selected and placed at the center of a Radial Basis Function (RBF) equalizer to reconstruct transmitted symbols. In the simulations, binary signals are generated at random with Gaussian noise. The performance of the proposed method is compared with that of a hybrid genetic algorithm (GA merged with simulated annealing (SA): GASA), and the relatively high accuracy and fast searching speed are achieved.

• ETRI Journal
• /
• 제45권1호
• /
• pp.119-130
• /
• 2023

We propose a quantized gradient search algorithm that can achieve global optimization by monotonically reducing the quantization step with respect to time when quantization is composed of integer or fixed-point fractional values applied to an optimization algorithm. According to the white noise hypothesis states, a quantization step is sufficiently small and the quantization is well defined, the round-off error caused by quantization can be regarded as a random variable with identically independent distribution. Thus, we rewrite the searching equation based on a gradient descent as a stochastic differential equation and obtain the monotonically decreasing rate of the quantization step, enabling the global optimization by stochastic analysis for deriving an objective function. Consequently, when the search equation is quantized by a monotonically decreasing quantization step, which suitably reduces the round-off error, we can derive the searching algorithm evolving from an optimization algorithm. Numerical simulations indicate that due to the property of quantization-based global optimization, the proposed algorithm shows better optimization performance on a search space to each iteration than the conventional algorithm with a higher success rate and fewer iterations.

• 전기학회논문지P
• /
• 제65권4호
• /
• pp.292-297
• /
• 2016

The first-order plus dead time(FOPDT) and second-order plus dead time(SOPDT), which describes a linear monotonic process quite well in most chemical and industrial processes and is often sufficient for PID and IMC controller tuning. This paper presents an application of heuristic harmony search(HS) optimization algorithm to the identification of linear continuous time-delay systems from step response. This recently developed HS algorithm is conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. The effectiveness of the proposed identification method has been demonstrated through a number of simulation examples.