• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.47-56
• /
• 2003

According to rapidly developed mobile terminals and network in the play environment for multimedia presentation, different end-to-end QoS situations appear. Then the generation of transcoding path algorithm was reviewed to transcode a source'data satisfying the needed QoS from a destination and play it considering given transcoders and network. This method used only workload as a parameter although two parameters, workload and throughput, were needed to process multimedia stream in a transcoder, Therefore generated transcoding path with this method had additional calculation to check playability whether it was safisfed the QoS of a destination or not. To solve the problem this paper suggests T algorithm with evaluation function using isochronous property that is needed for multimedia stream to arrive a destination. That means, most playable path is selected with heuristic search based isochronous property between many transcoding paths. Using the suggested algorithm, a transcoding path can be generated faster to play the multimedia data with different end-to-end QoS in real-time transmission.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.75-80
• /
• 2003

In this paper, we designed add current scan system basically. Although NDT system using AC method in now days had problem with limit of detection rate and limit of device organization, in this paper, we made up these problem so that designed device smaller than system used, reduction of cost of system organization and precision of measuring crack. Also, AC leakage flux system had high accuracy about minute crack in the surface and advantage of designing system easily so that we designed system for concerning about crack of surface. Furthermore, it can be able to detect exact crack of reference in wide area by using DSP320C31 chip to reduce the time of measuring crack.

• The KIPS Transactions:PartA
• /
• v.10A no.1
• /
• pp.59-68
• /
• 2003

3-D data modeling of a volumetric scattered data is highly demanded for geological structure inspection, environment visualization and supersonic testing. The data used in these area are generally irregularly scattered in a volume data space, which are much different from the structured points data (cuberille data) used in Marching cube algorithm. In this paper, first we explore a volume modeling method for the scattered data based on tetrahedral domain. Next we propose a method for solving the ambiguity of tetrahedral domain decision using asymptotic decider criterion. Last we implement a simple visualization system based on the proposed asymptotic decider criterion and compare it with a system based on sphere criterion. In deciding tetrahedral domain, sphere criterion considers only positional values but asymptotic decider criterion considers not only positional values but also functional values, so asymptotic decider criterion is more accurate on deciding tetrahedral domain than sphere criterion.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.2
• /
• pp.596-605
• /
• 1997

The synamic systrm emplohing the self-squared function, , $f(Z)=z^2+c$, provides the Mandelbrot set which classifies constants c using the divergence of the sequence starting from the origin.To speed-up the generation of Mandelbrot set images, two approaches , called as the divide-and-conquer technique and the triangular boundary tracing technique, have been developed.However , the divede-and-conquer technique genrates sequences of some pixels that so not affect graphical representations of the Mandelbrot set.The triangular boundary tracing tech-mique does noot represent some 8-connected components of the Mandelbrost set.In this paper, we prorose a new ;method which solves the 8-connectivity problem of triangular boundary tracing technique.This algorithm considers the divergence for only pixels which are essential to the graphical repressentation of the Mandelbrot set.It also foves good representations for 8-connected components like hairly structures.

• Journal of Intelligence and Information Systems
• /
• v.3 no.2
• /
• pp.1-9
• /
• 1997

These papers propose an evolutionary algorithm for re-using output of waste fuel of light water reactor system in nuclear power plants. Evolutionary algorithm is useful for optimization of the large space problem. The wastes contain several re-useable elements, and they should be carefully selected and blended to satisfy requirements as input material to the heavy water nuclear reactor system. This problem belongs to a NP-hard like the 0/1 Knapsack problem. Two evolutionary strategies are used as a, pp.oximation algorithms in the highly constrained combinatorial optimization problem. One is the traditional strategy, using random operator with evaluation function, and the other is heuristic based search that uses the vector operator reducing between goal and current status. We also show the method, which performs the feasible teat and solution evaluation by using the vectorized data in problem. Finally, We compare the simulation results of using random operator and vector operator for such combinatorial optimization problems.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1759-1769
• /
• 1997

The Error BackPropagation (EBP) algorithm for multi-layered neural networks is widely used in various areas such as associative memory, speech recognition, pattern recognition and robotics, etc. Nevertheless, many researchers have continuously published papers about improvements over the original EBP algorithm. The main reason for this research activity is that EBP is exceeding slow when the number of neurons and the size of training set is large. In this study, we developed new learning speed acceleration methods using variable learning rate, variable momentum rate and variable slope for the sigmoid function. During the learning process, these parameters should be adjusted continuously according to the total error of network, and it has been shown that these methods significantly reduced learning time over the original EBP. In order to show the efficiency of the proposed methods, first we have used binary data which are made by random number generator and showed the vast improvements in terms of epoch. Also, we have applied our methods to the binary-valued Monk's data, 4, 5, 6, 7-bit parity checker and real-valued Iris data which are famous benchmark training sets for machine learning.

• The KIPS Transactions:PartA
• /
• v.15A no.1
• /
• pp.45-52
• /
• 2008

In this paper we define a vulnerable code to symbolic link exploit and propose a technique to detect this using program analysis. The existing methods to solve symbolic link exploit is for protecting it, on accessing a temporary file they should perform an investigation whether the file is attacked by symbolic link exploit. If programmers miss the investigation, the program may be revealed to symbolic link exploit. Because our technique detects all the vulnerable codes to symbolic link exploit, it helps programmers keep the program safety. Our technique add two type qualifiers to the existing type system to analyze vulnerable codes to symbolic link exploit, it detects the vulnerable codes using type checking including the added type qualifiers. Our technique detects all the vulnerable codes to symbolic link exploit automatically, it has the advantage of saving costs of modifying and of overviewing all codes because programmers apply the methods protecting symbolic link exploit to only the detected codes as vulnerable. We experiment our analyzer with widely used programs. In our experiments only a portion of all the function fopen() is analyzed as the vulnerabilities to symbolic link exploit. It shows that our technique is useful to diminish modifying codes.

• Journal of Intelligence and Information Systems
• /
• v.14 no.3
• /
• pp.59-76
• /
• 2008

In this paper, we propose an agent architecture called L-CAA that is quite effective in real-time dynamic environments. L-CAA is an extension of CAA, the behavior-based agent architecture which was also developed by our research group. In order to improve adaptability to the changing environment, it is extended by adding reinforcement learning capability. To obtain stable performance, however, behavior selection and execution in the L-CAA architecture do not entirely rely on learning. In L-CAA, learning is utilized merely as a complimentary means for behavior selection and execution. Behavior selection mechanism in this architecture consists of two phases. In the first phase, the behaviors are extracted from the behavior library by checking the user-defined applicable conditions and utility of each behavior. If multiple behaviors are extracted in the first phase, the single behavior is selected to execute in the help of reinforcement learning in the second phase. That is, the behavior with the highest expected reward is selected by comparing Q values of individual behaviors updated through reinforcement learning. L-CAA can monitor the maintainable conditions of the executing behavior and stop immediately the behavior when some of the conditions fail due to dynamic change of the environment. Additionally, L-CAA can suspend and then resume the current behavior whenever it encounters a higher utility behavior. In order to analyze effectiveness of the L-CAA architecture, we implement an L-CAA-enabled agent autonomously playing in an Unreal Tournament game that is a well-known dynamic virtual environment, and then conduct several experiments using it.

• The Journal of Engineering Geology
• /
• v.21 no.1
• /
• pp.1-13
• /
• 2011

Joint roughness is one of the most important parameters in analysis of rock slope stability. Especially in probabilistic analysis, the random properties of joint roughness influence the probability of slope failure. Therefore, a large dataset on joint roughness is required for the probabilistic analysis but the traditional direct measurement of roughness in the field has some limitations. Terrestrial LiDAR has advantagess over traditional direct measurement in terms of cost and time. JRC (Joint Roughness Coefficient) was calculated from statistical parameters which are known from quantitative methods of converting the roughness of the material surface into JRC. The mean, standard deviation and distribution function of JRC were obtained, and we found that LiDAR is useful in obtaining large dataset for random variables.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2834-2851
• /
• 1997

In this paper, a design and implementation of VHDL compiler front-end, aims at supporting the full-set of VHDL '87 & '93 LRM and carring out the preprocessing of VHDL-to-C, is described. The VHDL compiler front-end includes 1)the symbol tree of analyzed data to represent the hierarchy, the scope and visibility, the overloading and homograph, the concurrent multiple stacks in VHDL, 2)the data structure and supportig routies to deal with the objects, the type and subtype, the attribute and operation in VHDL, 3)the analysis of the concurrent/sequential statements, the behavior/structural descriptions, of semantic token and the propagation of symbol & type to improve the registration and retrieval procedure of analyzed data. In the experiments with Validation Suite, the VHDL compiler front-end could support the full-set specification of VHDL LRM '87 & '93; and in the experiments to asses the performance of symantic token for the VHDL hierachy/visibility/concurrency/semantic checking, the improvement of about 20-30% could be achieved.