• The KIPS Transactions:PartB
• /
• v.12B no.5 s.101
• /
• pp.595-606
• /
• 2005

The scale of game development are rapidly increasing as the blockbuster games which cost $7\~20$ billion won, often appear on the markets. The game mechanics which is concentrated on technological elements of the game, necessarily requires the management of quality. In this paper, we propose a computer simulator for the quality evaluation of game mechanics which can analyze the quality accurately and economically in the design phase. The proposed simulator provides Petri net[7,8] and Smalltalk[9] for convenient modeling. The simulator gives the realistic evaluation like play test because it uses the realistic data of gameplay environment such as player action-pattern, game world map, and item DB but the previous evaluation methods can not consider the realistic gameplay environment and can only cover a limited scope of evaluation. To prove good performance of the proposed simulator, we have 80 simulations for the quality evaluation of the game mechanics of Dungeon & Dragon[13,14] in a given world map. The simulation results show that the proposed simulator can evaluate the faultlessness, optimization, and play balance of the game mechanics and gives better good performance than other evaluation methods.

• The KIPS Transactions:PartB
• /
• v.10B no.6
• /
• pp.665-672
• /
• 2003

This paper describes a speech synthesis technique by concatenating unit phoneme. At that time, a major problem is that discontinuity is happened from connection part between unit phonemes, especially from connection part between unit phonemes recorded by different persons. To solve the problem, this paper uses clustered diphone, and proposes a spectral smoothing technique, not only using formant trajectory and distribution characteristic of spectrum but also reflecting human's acoustic characteristic. That is, the proposed technique performs unit phoneme clustering using distribution characteristic of spectrum at connection part between unit phonemes and decides a quantity and a scope for the smoothing by considering human's acoustic characteristic at the connection part of unit phonemes, and then performs the spectral smoothing using weights calculated along a time axes at the border of two diphones. The proposed technique removes the discontinuity and minimizes the distortion which can be occurred by spectrum smoothing. For the purpose of the performance evaluation, we test on five hundred diphones which are extracted from twenty sentences recorded by five persons, and show the experimental results.

• The KIPS Transactions:PartD
• /
• v.13D no.2 s.105
• /
• pp.215-222
• /
• 2006

The importance of mobile software test is being addressed to improve the productivity and reliability of the software. Test automation technique based on mobile platform is required for effective application of mobile software test. That is, a technique is needed to generate test case for mobile platform API. When test case generated, software productivity and reliability are improved, while test duration and cost are decreased. In this paper, we identified test case generation scope through previous works about test automation, suggested keyword driven method, a test case generation technique on J2ME platform, and recognized that proposed method can be applicable to generating test case based on J2ME platform.

• The KIPS Transactions:PartC
• /
• v.14C no.1 s.111
• /
• pp.45-54
• /
• 2007

As one of the most threatening attacks, DDoS attack makes distributed multiple agents consume some critical resources at the target within the short time, thus the extent and scope of damage is serious. Against the problems, the existing defenses focus on detection, traceback (identification), and filtering. Especially, in the hierarchical networks, the traffic congestion of a specific node could incur the normal traffic congestion of overall lower nodes, and also block the control traffic for notifying the attack detection and identifying the attack agents. In this paper, we introduce a DDoS attack tolerant network structure using a hierarchical overlay for hierarchical networks, which can convey the control traffic for defense such as the notification for attack detection and identification, and detour the normal traffic before getting rid of attack agents. Lastly, we analyze the overhead of overlay construction, the possibility of speedy detection notification, and the extent of normal traffic transmission in the attack case through simulation.

• Journal of Digital Contents Society
• /
• v.17 no.3
• /
• pp.203-210
• /
• 2016

Korean is free of omission of sentence elements and modifying scope, so managing it on morphological analyzer is better than parser. In this paper, we propose functional expansion methods of the morphological analyzer to ease the burden of parsing. This method is a longest phrase matching method. When the series of several morpheme have one syntax category by processing of Unknown-words, Compound verbs, Compound nouns, Numbers and Symbols, our method combines them into a syntactic unit. And then, it is to treat by giving them a semantic features as syntax unit. The proposed morphological analysis method removes unnecessary morphological ambiguities and deceases results of morphological analysis, so improves accuracy of tagger and parser. By empirical results, we found that our method deceases 73.4% of Parsing tree and 52.4% of parsing time on average.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.6
• /
• pp.555-568
• /
• 2000

The World Wide Web has become the largest virtual system that is almost universal in scope. In recent research, it has become effective to utilize idle hosts existing in the World Wide Web for running applications that require a substantial amount of computation. This novel computing paradigm has been referred to as the advent of global computing. In this paper, we implement and propose a mobile object-based global computing framework called Tiger, whose primary goal is to present novel object-oriented programming libraries that support distribution, dispatching, migration of objects and concurrency among computational activities. The programming libraries provide programmers with access, location and migration transparency for distributed and mobile objects. Tiger's second goal is to provide a system supporting requisites for a global computing environment - scalability, resource and location management. The Tiger system and the programming libraries provided allow a programmer to easily develop an objectoriented parallel and distributed application using globally extended computing resources. We also present the improvement in performance gained by conducting the experiment with highly intensive computations such as parallel fractal image processing and genetic-neuro-fuzzy algorithms.

• The KIPS Transactions:PartD
• /
• v.16D no.2
• /
• pp.237-248
• /
• 2009

Recently, based on dynamic location or mobility of moving object, many researches on pattern mining methods actively progress to extract more available patterns from various moving patterns for development of location based services. The performance of moving pattern mining depend on how analyze and process the huge set of spatio-temporal data. Some of traditional spatio-temporal pattern mining methods[1-6,8-11]have proposed to solve these problem, but they did not solve properly to reduce mining execution time and minimize required memory space. Therefore, in this paper, we propose new spatio-temporal pattern mining method which extract the sequential and periodic frequent moving patterns efficiently from the huge set of spatio-temporal moving data. The proposed method reduces mining execution time of $83%{\sim}93%$ rate on frequent moving patterns mining using the moving sequence tree which generated from historical data of moving objects based on hash tree. And also, for minimizing the required memory space, it generalize the detained historical data including spatio-temporal attributes into the real world scope of space and time using spatio-temporal concept hierarchy.

• The KIPS Transactions:PartA
• /
• v.10A no.3
• /
• pp.181-188
• /
• 2003

We propose a heuristic on-line scheduling algorithm for the IRIS (Increasing Reward with Increasing Service) tasks, which has low computation complexity and produces total reward approximated to that of previous on-line optimal algorithms. The previous on-line optimal algorithms for IRIS tasks perform scheduling on all tasks in a system to maximize total reward. Therefore, the complexities of these algorithms are too high to apply them to practical systems handling many tasks. The proposed algorithm doesn´t perform scheduling on all tasks in a system, but on (constant) W´s tasks selected by a predefined task selection policy. The proposed algorithm is based on task selection policies that define how to select tasks to be scheduled. We suggest two simple and intuitive selection policies and a generalized selection policy that integrates previous two selection policies. By narrowing down scheduling scope to only W´s selected tasks, the computation complexity of proposed algorithm can be reduced to O(Wn). However, simulation results for various cases show that it is closed to O(W) on the average.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.4
• /
• pp.30-38
• /
• 2015

IT security service provides customers with the capability of protecting the networked information asset and infrastructures, and the scope of security service is expanding from a technology-intensive task to a comprehensive protection system for IT environment. To improve the quality of this service, a research model which help assess the quality is required. Several research models have been proposed and used in various service areas, but few cases are found for IT security service. In this work, a research model for the IT security quality has been proposed, based on research models such as SERVQUAL and E-S-QUAL. With the proposed model, factors which affect the service quality and the best quality measure have been identified. And the feasibility of using quantitative measures for quality has been examined. For analysis, structural equation modeling and various statistical methods such as principal component analysis were used. The result shows that satisfaction is the most significant measure affected by the proposed quality factors. Two quality factors, fulfillment and empathy, are the main determinants of the service quality. This leads to a strategy of quality improvement based on factors of emotion and perception, not of technology. The quantitative measures are considered as promising alternative measures, when combined with other measures. In order to design reliable quantitative measures, more work should be done on target processing time and users' expectation. It is hoped that work of this research will provide efficient tools and methods to improve the quality of IT security service and help future research works for other IT service areas.

• KIPS Transactions on Software and Data Engineering
• /
• v.10 no.7
• /
• pp.251-256
• /
• 2021

Software Product Line Engineering (SPLE) has been known as an efficient and effective software reuse methodology. One of the key activities of SPLE is scoping analysis, which determines the range of the features to be developed as reusable assets. Although several scoping methods has been reported, they are not sufficient to apply them to the defense domain. In this paper, we present a scoping method applicable to the defense domain, and present a case study for applying SPLE to inertial navigation weapon system. At first, the proposed method determines the range of candidate features to be applied for the platform. The range is then adjusted from the perspective of product benefit. The final range of features is decided through considering the total cost of a product line. We will demonstrate and evaluate the applicability of the proposed method by showing how we can decide the scope of features to be engineered for the navigation software product line.