• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.44 no.3
• /
• pp.39-44
• /
• 2007

In this paper, satellite searching and tracking method for the satellite antenna in naval vessels system are proposed. For fast searching satellite, Wide Range Search(WRS) algorithm is proposed where the signal strength of side-lobe is utilized as well as that of main-lobe. Satellite tracking algorithm to stabilize satellite antenna is based on conical-scanning which is accomplished by the use of the sub-reflector located in front of the focus of the reflector. The sub-reflector rotates about a slightly tilted axis by means of a motor and shapes the antenna beam to utilize stabilization. To show the validity of the proposed method, an experimental example is represented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2C
• /
• pp.10-15
• /
• 2005

In this paper, a simple but fast and reliable technique for the complex dielectric constant measurement of non-magnetic materials is introduced using a measured transmission coefficient (S21) and a genetic algorithm as an inversion process at microwave frequencies. In this experiment, it has been found that the transmission method is less susceptible with the measurement errors than that of the reflection method and the genetic algorithm can be efficiently used as a search technique. The suggested technique is validated with known and unknown conductor-loaded lossy materials and the conductor-loaded PCB at X-band.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.1112-1115
• /
• 2000

본 논문에서는 One-bit 변환을 기반으로 한 고속의 가변 블록 크기 움직임 예측 알고리즘을 제안한다. 제안된 방법은 블록 내의 평균값을 이용하여 8bit 화소값을 1bit로 변환한 후 움직임 예측을 수행한다. One-bit 변환을 통한 영상의 단순화는 움직임 추정의 계산적 부담을 감소시켜 빠른 탐색을 가능하게 한다. 그리고 블록 내의 움직임 정도를 미리 판별하여 이를 기반으로 한 적응적 탐색이 불필요한 탐색을 제거하고 움직임이 큰 블록에서는 정합과정을 심화시켜 보다 정확한 움직임 예측을 수행한다. 본 제안된 방식을 가지고 실험한 결과 한 프레임당 적은 수의 블록으로 고정된 크기의 블록을 가진 전역 탐색 블록 정합 알고리즘(full search block matching algorithm; FSBMA)보다 예측 에러를 적게 발생시켜 평균적으로 0.5dB 정도의 PSNR 개선을 가져왔다. 특히, 움직임이 많은 영상에서 뛰어난 효과를 나타냈다.

• Journal of Korea Multimedia Society
• /
• v.22 no.5
• /
• pp.588-600
• /
• 2019

Each year Malaria affects over 200 million people worldwide. Particularly, African continent is highly hit by this disease. According to many researches, this continent is ideal for Anopheles mosquitoes which transmit Malaria parasites to thrive. Rainfall volume is one of the major factor favoring the development of these Anopheles in the tropical Sub-Sahara Africa (SSA). However, the surveillance, monitoring and reporting of this epidemic is still poor and bureaucratic only. In our paper, we proposed a method to fast monitor and report Malaria instances by using Social Network Systems (SNS) and precipitation volume in Nigeria. We used Twitter search Application Programming Interface (API) to live-stream Twitter messages mentioning Malaria, preprocessed those Tweets and classified them into Malaria cases in Nigeria by using Support Vector Machine (SVM) classification algorithm and compared those Malaria cases with average precipitation volume. The comparison yielded a correlation of 0.75 between Malaria cases recorded by using Twitter and average precipitations in Nigeria. To ensure the certainty of our classification algorithm, we used an oversampling technique and eliminated the imbalance in our training Tweets.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.2
• /
• pp.82-90
• /
• 2002

BDD have become widely used for various CAD applications because Boolean functions can be represented uniquely and compactly by using BDD. The size of the BDD representation for a function is very sensitive to the choice of orderings on the input variable. Therefore, it is very important to find a good variable ordering which minimize the size of the BDD. Since finding an optimal ordering is NP-complete, several heuristic algorithms have been proposed to find good variable orderings. In this paper, we propose a variable ordering algorithm, Faster-${\mu}$0, based on the ${\mu}$0(microcanonical optimization). In the Faster-${\mu}$0 algorithm, the initialization phase is replaced with a shifting phase to produce better solutions in a fast local search. We find values for algorithm parameters experimentally and the proposed algorithm has been experimented on well known benchmark circuits and shows superior performance compared to various existing algorithms.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.29 no.4
• /
• pp.73-92
• /
• 1987

Formulation of the geometric optimization for truss structures based on the elasticity theory turn out to be the nonlinear programming problem which has to deal with the cross-sectional area of the member and the coordinates of its nodes simultaneously. A few techniques have been proposed and adopted for the analysis of this nonlinear programming problem for the time being. These techniques, however, bear some limitations on truss shapes, loading conditions and design criteria for the practical application to real structures. A generalized algorithm for the geometric optimization of the truss structures, which can eliminate the above mentioned limitations, is developed in this study. The algorithm proposed utilizes the two-levels technique. In the first level which consists of two phases, the cross-sectional area of the truss member is optimized by transforming the nonlinear problem into SUMT, and solving SUMT utilizing the modified Newton Raphson method. In the second level, which also consists of two phases the geometric shape is optimized utillzing the unindirectional search technique of the Powell method which make it possible to minimize only the objective functlon. The algorithm proposed in this study is numerically tested for several truss structures with various shapes, loading conditions and design criteria, and compared with the results of the other algorithms to examine its applicability and stability. The numerical comparisons show that the two- levels algorithm proposed in this study is safely applicable to any design criteria, and the convergency rate is relatively fast and stable compared with other iteration methods for the geometric optimization of truss structures. It was found for the result of the shape optimization in this study to be decreased greatly in the weight of truss structures in comparison with the shape optimization of the truss utilizing the algorithm proposed with the other area optimum method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.11
• /
• pp.2158-2165
• /
• 2007

In this paper, a Modified Fuzzy C-Means algorithm with Gaussian Weights(MFCM_GW) is presented for nonlinear blind channel equalization. The proposed algorithm searches the optimal channel output states of a nonlinear channel from the received symbols, based on the Bayesian likelihood fitness function and Gaussian weighted partition matrix instead of a conventional Euclidean distance measure. Next, the desired channel states of a nonlinear channel are constructed with the elements of estimated channel output states, 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 those of a simplex genetic algorithm(GA), a hybrid genetic algorithm(GA merged with simulated annealing(SA): GASA), and a previously developed version of MFCM. It is shown that a relatively high accuracy and fast search speed has been achieved.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.1
• /
• pp.33-40
• /
• 2019

This study focuses on a job-shop scheduling problem with the objective of minimizing total tardiness for the job orders that have different due dates and different process flows. We suggest the dispatching rule based scheduling algorithm to generate fast and efficient schedule. First, we show the delay schedule can be optimal for total tardiness measure in some cases. Based on this observation, we expand search space for selecting the job operation to explore the delay schedules. That means, not only all job operations waiting for process but also job operations not arrived at the machine yet are considered to be scheduled when a machine is available and it is need decision for the next operation to be processed. Assuming each job operation is assigned to the available machine, the expected total tardiness is estimated, and the job operation with the minimum expected total tardiness is selected to be processed in the machine. If this job is being processed in the other machine, then machine should wait until the job arrives at the machine. Simulation experiments are carried out to test the suggested algorithm and compare with the results of other well-known dispatching rules such as EDD, ATC and COVERT, etc. Results show that the proposed algorithm, MET, works better in terms of total tardiness of orders than existing rules without increasing the number of tardy jobs.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.8
• /
• pp.81-87
• /
• 1999

In general, feature detection and tracking algorithms is classified by EBGM using Garbor-jet, NNC-R and STK algorithm using pixel eigenvalue. In those algorithms, EBGM and NCC-R detect features with feature model, but STK algorithm has a characteristics of an automatic feature selection. In this paper, to solve the initial problem of NR tracking in STK algorithm, we detected features using STK algorithm in modelled feature region and tracked features with NR method. In tracking, to improve the tracking accuracy for features by NR method, we proposed BMA-NR method. We evaluated that BMA-NR method was superior to NBMA-NR in that feature tracking accuracy, since BMA-NR method was able to solve the local minimum problem due to search window size of NR.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1483-1492
• /
• 1996

In this paper, related on the postal business with the GIS(Geographics Information System), it discusses design and implementation of the PROS(Postal Route Optimization System) model and its main module, the shortest path generation algorithm, for supporting to postal route managements. It explains examples requirements of postal route system, and suggests the efficient PROS model using our developed shortest path generation algorithm. Because the shortest path algorithm adopts not only consider the Dijkstra algorithm of graph theory, but also the method with the direction property, PROS can be implemented with fast and efficient route search. PROS is mainly constituted of the Shortest Generator, the Isochronal Area Generator, and the Path Rearrangement Generator. It also exploits the GIS engine and the spatial DBMS (Data Base Management System) for processing coordinates in the map and geographical features. PROS can be used in the management of postal delivery business and delivery area and route, and in the rearrangement of route. In the near future, it can be also applied to commercial delivery businesses, guides of routs and traffic informations, and auto navigation system with GPS(Global Positioning System).