• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.632-635
• /
• 2015

Proposal algorithm in this thesis introduced cells, units of router group, for distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm. As a result of performance analysis comparing with existing genetic algorithm through experiments, the proposal algorithm was found superior in terms of costs and delay time. Furthermore, time for routing an alternative path was reduced in proposal algorithm, in case that a network was damaged in existing optimal path algorithm, Dijkstra algorithm, and the proposal algorithm was designed to route an alternative path faster than Dijkstra algorithm, as it has a 2nd shortest path in cells of the damaged network. The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.4
• /
• pp.575-594
• /
• 2010

In this study, we propose a space search algorithm (SSA) and then introduce a hybrid optimization of fuzzy inference systems based on SSA and information granulation (IG). In comparison with "conventional" evolutionary algorithms (such as PSO), SSA leads no.t only to better search performance to find global optimization but is also more computationally effective when dealing with the optimization of the fuzzy models. In the hybrid optimization of fuzzy inference system, SSA is exploited to carry out the parametric optimization of the fuzzy model as well as to realize its structural optimization. IG realized with the aid of C-Means clustering helps determine the initial values of the apex parameters of the membership function of fuzzy model. The overall hybrid identification of fuzzy inference systems comes in the form of two optimization mechanisms: structure identification (such as the number of input variables to be used, a specific subset of input variables, the number of membership functions, and polyno.mial type) and parameter identification (viz. the apexes of membership function). The structure identification is developed by SSA and C-Means while the parameter estimation is realized via SSA and a standard least square method. The evaluation of the performance of the proposed model was carried out by using four representative numerical examples such as No.n-linear function, gas furnace, NO.x emission process data, and Mackey-Glass time series. A comparative study of SSA and PSO demonstrates that SSA leads to improved performance both in terms of the quality of the model and the computing time required. The proposed model is also contrasted with the quality of some "conventional" fuzzy models already encountered in the literature.

• Journal of KIISE:Software and Applications
• /
• v.31 no.6
• /
• pp.829-839
• /
• 2004

Methods based on integer programming have been shown to be very effective in solving various crew pairing optimization problems. However, their applicability is limited to problems with linear constraints and objective functions. Also, those methods often require an unacceptable amount of time and/or memory resources given problems of larger scale. Heuristic methods such as neighborhood search, on the other hand, can handle large-scaled problems without too much difficulty and can be applied to problems having any form of objective functions and constraints. However, neighborhood search often gets stuck at local optima when faced with complex search spaces. This paper presents ,i hybrid algorithm of neighborhood search and integer programming, which nicely combines the advantages of both methods. The hybrid algorithm has been successfully tested on a large-scaled crew pairing optimization problem for a real subway line.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.1
• /
• pp.42-47
• /
• 2010

Many contests by micro mouse was celebrated of which maze search algorithms performance are compared. That is used in various forms based on left(right) weight method, euclidean algorithm method, hill climbing method. However we feel uncomfortable to test algorithms performance through direct development of programs or hardwares as no software platform to test in maze search algorithms. In this research we develop of a platform for maze search algorithms that is easily to produce various forms of maze that are hard to be realized by hardware, to apply algorithms, and evaluate the seek time, operation count, steps and performance. The platform is consist of main layer, interface layer, user layer which has merit to apply and replace easily algorithms. We verified that the maze search algorithm can be applied even in the development and experiment of algorithm by evaluating and analyzing its performance through the experiment of platform.

• Journal of Satellite, Information and Communications
• /
• v.9 no.3
• /
• pp.121-126
• /
• 2014

ETRI(Electronics and Telecommunication Research Institute) has joined National GNSS Research Center program of Defense Acquisition Program Administration and Agency for Defense Development in 2010. The research subject is technology for MSAR(Military Search and Rescue) system configuration. In this project, we analyses the ways in order to improve the accuracy, reliability, availability for MSAR system from M&S(Modeling and Simulation). The MSAR System M&S Software can be used for performance analysis of new elements, such as ground elements and satellite elements without any hardware development. In this paper, after introduction of the architecture design and functional scope of the simulator, the performance analysis result for MSAR M&S software is presented.

• Proceedings of the Korean Society of Medical Physics Conference
• /
• 2002.09a
• /
• pp.65-67
• /
• 2002

A PC based software, the RTP Research Tool Box (RTB), was developed for IMRT optimization research. The software was consisted of an image module, a beam registration module, a dose calculation module, a dose optimization module and a dose display module. The modules and the Graphical User Interface (GUI) were designed to easily amendable by negotiating the speed of performing tasks. Each module can be easily replaced to new functions for research purpose. IDL 5.5 (RSI, USA) language was used for this software. Five major modules enable one to perform the research on the dose calculation, on the dose optimization and on the objective function. The comparison of three cost functions, such as the uncomplicated tumor control probability (UTCP), the physical objective function and the pseudo-biological objective function, which was designed in this study, were performed with the RTB. The optimizations were compared to the simulated annealing and the gradient search optimization technique for all of the optimization objective functions. No significant differences were found among the objective functions with the dose gradient search technique. But the DVH analysis showed that the pseudo-biological objective function is superior to the physical objective function when with the simulated annealing for the optimization.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.3
• /
• pp.211-217
• /
• 2019

In this study, we compare and analyze the attributes of the software development cost model according to the shape parameters change of the Type-2 Gumbel lifetime distribution using the NHPP model. In order to analyze the software failure phenomena, the parametric estimation is applied to the maximum likelihood estimation method, and the nonlinear equations are calculated using the bisection method. As a result, when the attributes of the cost curves according to the change of shape parameters are compared, it is found that the larger the number of shape parameters, the lower the software development cost and the faster the release time. Through this study, it is expected that it will be helpful for the software developers to search for the development cost according to the software shape parameters change, and also to provide the necessary information for the attributes of the software development cost.

• Journal of Distribution Science
• /
• v.11 no.2
• /
• pp.45-55
• /
• 2013

Purpose - The development and implementation of OSS (Open Source Software) led to a dramatic change in corporate IT infrastructure, from system server to smart phone, because the performance, reliability, and security functions of OSS are comparable to those of commercial software. Today, OSS has become an indispensable tool to cope with the competitive business environment and the constantly-evolving IT environment. However, the use of OSS is insufficient in small and medium-sized companies and software houses. This study examines the need for OSS Intermediaries in the Software Distribution Channel. It is expected that the role of the OSS Intermediary will be reduced with the improvement of the distribution process. The purpose of this research is to prove that OSS Intermediaries increase the efficiency of the software distribution market. Research design, Data, and Methodology - This study presents the analysis of data gathered online to determine the extent of the impact of the intermediaries on the OSS market. Data was collected using an online survey, conducted by building a personal search robot (web crawler). The survey period lasted 9 days during which a total of 233,021 data points were gathered from sourceforge.net and Apple's App store, the two most popular software intermediaries in the world. The data collected was analyzed using Google's Motion Chart. Results - The study found that, beginning 2006, the production of OSS in the Sourceforge.net increased rapidly across the board, but in the second half of 2009, it dropped sharply. There are many events that can explain this causality; however, we found an appropriate event to explain the effect. It was seen that during the same period of time, the monthly production of OSS in the App store was increasing quickly. The App store showed a contrasting trend to software production. Our follow-up analysis suggests that appropriate intermediaries like App store can enlarge the OSS market. The increase was caused by the appearance of B2C software intermediaries like App store. The results imply that OSS intermediaries can accelerate OSS software distribution, while development of a better online market is critical for corporate users. Conclusion - In this study, we analyzed 233,021 data points on the online software marketplace at Sourceforge.net. It indicates that OSS Intermediaries are needed in the software distribution market for its vitality. It is also critical that OSS intermediaries should satisfy certain qualifications to play a key role as market makers. This study has several interesting implications. One implication of this research is that the OSS intermediary should make an effort to create a complementary relationship between OSS and Proprietary Software. The second implication is that the OSS intermediary must possess a business model that shares the benefits with all the participants (developer, intermediary, and users).The third implication is that the intermediary provides an OSS of high quality like proprietary software with a high level of complexity. Thus, it is worthwhile to examine this study, which proves that the open source software intermediaries are essential in the software distribution channel.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.5
• /
• pp.388-396
• /
• 2003

In this paper, a fast motion search algorithm that performs motion search for variable blocks in integer pixel unit is proposed. The proposed method is based on the successive elimination algorithm (SEA) using sum norms to find the best estimate of motion vector and obtains the best estimate of the motion vectors of blocks, including 16${\times}$8, 8${\times}$16, and 8${\times}$8, by searching eight pixels around the best motion vector of 16${\times}$16 block obtained from all candidates. And the motion vectors of blocks, including 8${\times}$4, 4${\times}$8, and 4${\times}$4, is obtained by searching eight pixels around the best motion vector of 8${\times}$8 block. The proposed motion search is applied to the H.264 encoder that performs variable blocks motion estimation (ME). In terms of computational complexity, the proposed search algorithm for motion estimation (ME) calculates motion vectors in about 23.8 times speed compared with the spiral full search without early termination and 4.6 times speed compared with the motion estimation method using hierarchical sum of absolute difference (SAD) of 4${\times}$4 blocks, while it shows 0.1dB∼0.4dB peak signal-to-noise ratio (PSNR) drop in comparison to the spiral full search.

• Journal of Software Engineering Society
• /
• v.23 no.4
• /
• pp.151-163
• /
• 2010

In the defense software domain where large-scale software products in various application areas need to be built, reusing software is regarded as one of the important practices to build software products efficiently and economically. There have been many efforts to apply various methods to support software reuse in the defense software domain. However, developers in the defense software domain still experience many difficulties and face obstacles in reusing software assets. In this paper, we analyze practical problems of software reuse in the defense software domain, and define core requirements to solve those problems. To meet these requirements, we are currently developing the Component Grid system, a reuse-support system that provides a developer-centric software reuse environment. We have designed an architecture of Component Grid, and defined essential elements of the architecture. We have also developed the core approaches for developing the Component Grid system: a semantic-tagging-based requirement tracing method, a reuse-knowledge representation model, a social-network-based asset search method, a web-based asset management environment, and a wiki-based collaborative and participative knowledge construction and refinement method. We expect that the Component Grid system will contribute to increase the reusability of software assets in the defense software domain by providing the environment that supports transparent and efficient sharing and reuse of software assets.