• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.394-396
• /
• 2006

When developing a new GPS receiver module, the essential problems are evaluation of reliable algorithms, software debugging, and performance comparison between algorithms to find optimal solution. Most GPS receiver modules nowadays use a correlator to track signals from satellites and an MCU (Micro Controller Unit) to control operations of the entire module. The problem of software evaluation from MCU is very difficult, due to limitation of MCU resources and low ability of interfacing with user. Normally, user has to expense special tool kit for a limiting access to MCU but it is also hard to use. This article introduces an implementation of a GPS receiver test bed using correlator GP2021 interfacing with ISA (Industry Standard Architecture) PC bus. This way can give user complete control and visibility into the operation of the receiver, then user can easily debug program and test algorithms. For this article, the least square method is implemented to test the hardware and software performance.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.7
• /
• pp.695-701
• /
• 2008

In this paper, we propose the efficient Doppler removal method using map-based partial-time common intermediate frequency removal technique. In the proposed algorithm, the 2-stage carrier removal process was used. First, the component of common intermediate frequency is removed. Next the component of Doppler was removed with averaging and approximation. For the evaluation of the proposed algorithm, The real-time software GPS L1 C/A-code receiver was implemented. When the proposed algorithms are used, 12 tracking channels with 3 track arm(early, prompt, late) is operated real-time on PC using a Intel Pentium-III 1.0GHz CPU. Also, the requirement of memory was less than 2Mbytes. The real-time software GNSS receiver using the proposed algorithms provides the navigation solution with below 10 meter rms error. Especially, in spited of using the various approximations for implementing the algorithms, the high sensitivity capability (able to track the weak signal with -159dBm) was achieved.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.14 no.24
• /
• pp.53-69
• /
• 1991

This paper is concerned with software developments for scheduling and sequencing of FMS. The scheduling algorithms are developed for 3 types of FMS:single machine type FMS, flowshop type FMS. assembly line type FMS. For the single machine type FMS. full enumeration algorithm is used. For the flowshop type FMS heuristic algorithms are developed. For the assembly type FMS the exsisting PERT/CPM algorithm is applied. Numerical examples are presented for illustration of each algorithm. Each soft ware program list are attached as appendices.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.3
• /
• pp.321-331
• /
• 2003

Experimental software datasets describing software projects in terms of their complexity and development time have been the subject of intensive modeling. A number of various modeling methodologies and modeling designs have been proposed including such approaches as neural networks, fuzzy, and fuzzy neural network models. In this study, we introduce the concept of the Rule-based fuzzy polynomial neural networks (RFPNN) as a hybrid modeling architecture and discuss its comprehensive design methodology. The development of the RFPNN dwells on the technologies of Computational Intelligence (CI), namely fuzzy sets, neural networks, and genetic algorithms. The architecture of the RFPNN results from a synergistic usage of RFNN and PNN. RFNN contribute to the formation of the premise part of the rule-based structure of the RFPNN. The consequence part of the RFPNN is designed using PNN. We discuss two kinds of RFPNN architectures and propose a comprehensive learning algorithm. In particular, it is shown that this network exhibits a dynamic structure. The experimental results include well-known software data such as the NASA dataset concerning software cost estimation and the one describing software modules of the Medical Imaging System (MIS).

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.3
• /
• pp.635-642
• /
• 2018

In the Era of the Fourth Industrial Revolution, we live in huge amounts of software. However, as software increases, software vulnerabilities are also increasing. Therefore, it is important to detect and remove software vulnerabilities. Currently, many researches have been studied to predict and detect software security problems, but it takes a long time to detect and does not have high prediction accuracy. Therefore, in this paper, we describe a method for efficiently predicting software vulnerabilities using machine learning algorithms. In addition, various machine learning algorithms are compared through experiments. Experimental results show that the k-nearest neighbors prediction model has the highest prediction rate.

• IE interfaces
• /
• v.12 no.4
• /
• pp.540-550
• /
• 1999

In evolutionary algorithm, there exist various models for the evolution of the population with respect to schemes and strategies for reproduction. In the application of the algorithm to a specific problem, one model suitable to the problem is to be properly chosen and a program expert or a software is needed to help implement and test a designed algorithm. In this study, the software for simple evolutionary algorithms(SEA) with one population is developed. The software is designed as an application framework type, so that it may be friendly, allow users to add some program, and operate under the environment of Windows. For this, hierarchical classes for components of SEA are first designed by means of an object-oriented approach and then a library for SEA is built by them. With the library, developed is an application framework that can generate a frame code for an application program. The software proposed here can be used as a generalized tool for solving problems in a wide range of domains.

• ETRI Journal
• /
• v.32 no.3
• /
• pp.486-489
• /
• 2010

This letter presents a modified Pegasos algorithm for graph-based dependency parsing. We show that the modified Pegasos algorithm outperforms the margin infused relaxed and passive aggressive algorithms in three languages.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.1
• /
• pp.38-48
• /
• 2006

Several software programs such as Bobby and A-Prompt developed based on the W3C's WCAG 1.0 guidelines have been employed to evaluate the accessibility of web sites. Although these programs make an evaluation of web accessibility easy and objective, many researchers pointed out that the results of web accessibility are lack of reliability. Therefore, this study is intended to suggest the modified algorithms for evaluating web accessibility focused on the 'images' and 'tables'. To verify them, we compared the accessibility of the Korean governmental web sites with new and current algorithms, respectively. The results show that the suggested algorithms are more accurate than the existent one.

• Industrial Engineering and Management Systems
• /
• v.14 no.1
• /
• pp.11-21
• /
• 2015

The purpose of this research is to develop algorithms using the Differential Evolution Algorithm (DE) to solve a multi-objective, sources and stages location-allocation problem. The development process starts from the design of a standard DE, then modifies the recombination process of the DE in order improve the efficiency of the standard DE. The modified algorithm is called modified DE. The proposed algorithms have been tested with one real case study (large size problem) and 2 randomly selected data sets (small and medium size problems). The computational results show that the modified DE gives better solutions and uses less computational time than the standard DE. The proposed heuristics can find solutions 0 to 3.56% different from the optimal solution in small test instances, while differences are 1.4-3.5% higher than that of the lower bound generated by optimization software in medium and large test instances, while using more than 99% less computational time than the optimization software.

• Computers and Concrete
• /
• v.9 no.4
• /
• pp.293-310
• /
• 2012

This paper discusses a new constitutive model called the high-rate brittle microplane (HRBM) model and also presents the details of a new software package called the Virtual Materials Laboratory (VML). The VML software package was developed to address the challenges of fitting complex material models such as the HRBM model to material property test data and to study the behavior of those models under a wide variety of stress- and strain-paths. VML employs Continuous Evolutionary Algorithms (CEA) in conjunction with gradient search methods to create automatic fitting algorithms to determine constitutive model parameters. The VML code is used to fit the new HRBM model to a well-characterized conventional strength concrete called WES5000. Finally, the ability of the new HRBM model to provide high-fidelity simulations of material property experiments is demonstrated by comparing HRBM simulations to laboratory material property data.