• Journal of the Korean Institute of Navigation
• /
• v.16 no.1
• /
• pp.1-12
• /
• 1992

In this study, the self test-system for the marine Gyrocompass was developed and the obtained results are summarized as follows : 1) Utilizing the newly developed self-test system, the time length for observing the transient state of Gyrocompass reading which has been over 4 hours can be reduced to less than 20 minutes. In addition, the dynamic characteristics of the Gyrocompass can be measured within 2 hours after starting the system. 2) Prior test and diagnosis was done by checking all parameters recurrently with period of 2.5minutes. 3) Testing and diagnosis results was shown in graphic mode and could be transmitted to INMARSAT unit using personal computer. 4) The results of the newly designed trouble algorithm for the system was found to be applicable under arbitrary given conditions.

• Proceedings of the KIEE Conference
• /
• 2001.10a
• /
• pp.88-90
• /
• 2001

This paper proposes a driving scheme for 6/6 single-phase SRM. The driving scheme is very simple and inexpensive. By use of this scheme, simple power devices based on low switching losses enable to high efficiency SRM drive. Starting, One of the main problem in single-phase SRM is overcome by a new starling algorithm with one hall sensor and a parting magnet. The proposed single-phase SRM has a high efficiency and robust drive characteristics compared to that of a universal motor.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.949-951
• /
• 2015

본 연구는 맥파속도를 측정 하는데 간단한 방법으로 1채널 심전도 데이터와 4채널 광전식 용적맥파를 이용하여 취득한 데이터를 분석하는 알고리즘을 제안한다. 심전도의 R 피크점과 좌우 지첨, 족첨에서 발생하는 4 채널 맥파신호간 시간차를 이용하여 맥파 전달시간을 구하고 팔, 다리 길이로 나눠서 맥파전달속도를 구한다. 알고리즘은 심전도 R 피크점 검출, 4 채널 맥파에서의 피크점 검출 이후 검출된 피크정보를 이용하여 맥파의 시작지점인 기시점을 검출하는 간단한 방법을 개발하였고, 4 가지 맥파형태에 검출알고리즘을 적용하여 검증 하였다. 본 연구에서 개발한 방법으로 간단히 맥파속도를 측정하여 동맥경화나 고혈압, 당뇨 등 심혈관 관련 연구의 기반이 될 수 있을 것으로 사료된다.

• International Journal of Computer Science & Network Security
• /
• v.21 no.2
• /
• pp.198-204
• /
• 2021

Glioma is one of the common types of brain tumors starting in the brain's glial cell. These tumors are classified into low-grade or high-grade tumors. Physicians analyze the stages of brain tumors and suggest treatment to the patient. The status of the tumor has an importance in the treatment. Nowadays, computerized systems are used to analyze and classify brain tumors. The accurate grading of the tumor makes sense in the treatment of brain tumors. This paper aims to develop a classification of low-grade glioma and high-grade glioma using a deep learning algorithm. This system utilizes four transfer learning algorithms, i.e., AlexNet, GoogLeNet, ResNet18, and ResNet50, for classification purposes. Among these algorithms, ResNet18 shows the highest classification accuracy of 97.19%.

• Current Optics and Photonics
• /
• v.6 no.5
• /
• pp.473-478
• /
• 2022

To overcome the capture-range problem in phase-diversity phase retrieval (PDPR), a geometrical-optics initial-estimate method is proposed to avoid a local minimum and to improve the accuracy of laser-wavefront measurement. We calculate the low-order aberrations through the geometrical-optics model, which is based on the two spot images in the propagation path of the laser, and provide it as a starting guess for the PDPR algorithm. Simulations show that this improves the accuracy of wavefront recovery by 62.17% compared to other initial values, and the iteration time with our method is reduced by 28.96%. That is, this approach can solve the capture-range problem.

• Journal of Information Technology Services
• /
• v.21 no.6
• /
• pp.127-145
• /
• 2022

Luna Coin, which ranked eighth in the global market capitalization and established itself as a super-large stablecoin, plunged overnight, shocking the market. Therefore, this study proposed the direction of Korea's stablecoin regulation, focusing on the Terra-Luna situation, starting with the question of whether the stable coin's value, 'stability', can be trusted. The whole story of the Terra-Luna incident was examined in depth and the problems were pointed out, and the direction of domestic stable coin regulation was described based on overseas cases. In the absence of any legal guidelines for stablecoin at the moment, we hope that this study will provide a minimum stabilizer in the virtual asset market and help protect investors.

• International Journal of Computer Science & Network Security
• /
• v.24 no.1
• /
• pp.45-51
• /
• 2024

The subject of navigation has drawn a large interest in the last few years. The navigation within a city is to find the path between two points, source location and destination location. In many cities, solving the routing problem is very essential as to find the route between different locations (starting location (source) and an ending location (destination)) in a fast and efficient way. This paper considers streets with diagonal streets. Such streets pose a problem in determining the directions of the route to be followed. The paper presents a solution for the path planning using the reconfigurable mesh (R-Mesh). R-Mesh is a parallel platform that has very fast solutions to many problems and can be deployed in moving vehicles and moving robots. This paper presents a solution that is very fast in computing the routes.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.620-626
• /
• 2004

For general nonlinear processes, it is difficult to control with a linear model-based control method and nonlinear controls are considered. Among the numerous approaches suggested, the most rigorous approach is to use dynamic optimization. Many general engineering problems like control, scheduling, planning etc. are expressed by functional optimization problem and most of them can be changed into dynamic programming (DP) problems. However the DP problems are used in just few cases because as the size of the problem grows, the dynamic programming approach is suffered from the burden of calculation which is called as 'curse of dimensionality'. In order to avoid this problem, the Neuro-Dynamic Programming (NDP) approach is proposed by Bertsekas and Tsitsiklis (1996). To get the solution of seriously nonlinear process control, the interest in NDP approach is enlarged and NDP algorithm is applied to diverse areas such as retailing, finance, inventory management, communication networks, etc. and it has been extended to chemical engineering parts. In the NDP approach, we select the optimal control input policy to minimize the value of cost which is calculated by the sum of current stage cost and future stages cost starting from the next state. The cost value is related with a weight square sum of error and input movement. During the calculation of optimal input policy, if the approximate cost function by using simulation data is utilized with Bellman iteration, the burden of calculation can be relieved and the curse of dimensionality problem of DP can be overcome. It is very important issue how to construct the cost-to-go function which has a good approximate performance. The neural network is one of the eager learning methods and it works as a global approximator to cost-to-go function. In this algorithm, the training of neural network is important and difficult part, and it gives significant effect on the performance of control. To avoid the difficulty in neural network training, the lazy learning method like k-nearest neighbor method can be exploited. The training is unnecessary for this method but requires more computation time and greater data storage. The pH neutralization process has long been taken as a representative benchmark problem of nonlin ar chemical process control due to its nonlinearity and time-varying nature. In this study, the NDP algorithm was applied to pH neutralization process. At first, the pH neutralization process control to use NDP algorithm was performed through simulations with various approximators. The global and local approximators are used for NDP calculation. After that, the verification of NDP in real system was made by pH neutralization experiment. The control results by NDP algorithm was compared with those by the PI controller which is traditionally used, in both simulations and experiments. From the comparison of results, the control by NDP algorithm showed faster and better control performance than PI controller. In addition to that, the control by NDP algorithm showed the good results when it applied to the cases with disturbances and multiple set point changes.

• Journal of KIISE:Software and Applications
• /
• v.29 no.1_2
• /
• pp.80-90
• /
• 2002

Clustering is a useful technique for grouping data points such that points within a single group/cluster have similar characteristics. Many clustering algorithms have been developed and used in engineering applications including pattern recognition and image processing etc. Recently, it has drawn increasing attention as one of important techniques in data mining. However, clustering algorithms such as K-means and Fuzzy C-means suffer from difficulties. Those are the needs to determine the number of clusters apriori and the clustering results depending on the initial set of clusters which fails to gain desirable results. In this paper, we propose a new clustering algorithm, which solves mentioned problems. In our method we use evolutionary algorithm to solve the local optima problem that clustering converges to an undesirable state starting with an inappropriate set of clusters. We also adopt a new measure that represents how well data are clustered. The measure is determined in terms of both intra-cluster dispersion and inter-cluster separability. Using the measure, in our method the number of clusters is automatically determined as the result of optimization process. And also, we combine heuristic that is problem-specific knowledge with a evolutionary algorithm to speed evolutionary algorithm search. We have experimented our algorithm with several sets of multi-dimensional data and it has been shown that one algorithm outperforms the existing algorithms.

• Journal of Biomedical Engineering Research
• /
• v.29 no.4
• /
• pp.307-315
• /
• 2008

In this paper, we developed a visual-auditory cue software for reading training of motor speech disorder patients. Motor speech disorder patients can use the visual and/or auditory cues for reading training and improving their symptom. The software provides some sentences with visual-auditory cues. Our sentences used for reading training are adequately comprised on modulation training according to a professional advice in speech therapy field. To ameliorate reading skills we developed two algorithms, first one is automatically searching the starting time of speech spoken by patients and the other one is removing auditory-cue from the recorded speech that recorded at the same time. The searching of speech starting time was experimented by 10 sentences per 6 subjects in four kinds of noisy environments thus the results is that $7.042{\pm}8.99[ms]$ error was detected. The experiment of the cancellation algorithm of auditory-cue was executed from 6 subjects with 1 syllable speech. The result takes improved the speech recognition rate $25{\pm}9.547[%]$ between before and after cancellation of auditory-cue in speech. User satisfaction index of the developed program was estimated as good.