• Journal of Internet Computing and Services
• /
• v.10 no.1
• /
• pp.19-31
• /
• 2009

Network management involves configuring and operating various network elements in a suitable manner. Generally, a network management system can perform basic functionalities such as configuration management, performance management, and fault management. Due to the open structure of the Internet, the volume of network traffic and the network equipment used have increased in size and complexity. Therefore, it is expensive and time consuming to develop a network management program for heterogeneous network equipment in an SNMP.based network. In order to facilitate the management of network environments and the control of heterogeneous devices in an efficient manner, we propose an Active Network Management System (ANMS) comprising an automatic generator that uses triggers to generate a network management program. The concept of triggers can be represented through event condition action rules performed in response to a change in the status of a network environment. The proposed ANMS comprises basic components for real time network management and also includes an automatic generator (AG). When the ANMS is monitoring network elements that are newly added or changed, a trigger rule is activated and these components are then able to collaborate and automatically generate a new network management program by using the information provided along with the SNMP libraries. Our method is useful for expanding the network structure and replacing network equipment. Through experiments, we have proved that our ANMS is useful when new network objects are added or changed in the network environment to expand the network structure. Further, we have verified that our ANMS system reduces the time and cost required to develop a network management program as compared to the manual method used in existing network management systems.

• The Journal of the Korea Contents Association
• /
• v.18 no.5
• /
• pp.554-565
• /
• 2018

This study is to think a new arena of collective play culture at the university campus festival for digital generation used to be individually consuming play in cyberspace. While cyberia is virtual cultural space by providing gigantic platforms in which producers and consumers meet, this space has characterized as individuality and disembodiment, that is why recalling the collective play culture at the off-line. This article is to examine the characteristics and meaning of the recent campus festivals during the history of Korean college festivals, and to analyze proposals of play-contents applied by various theories. The 2016-7' proposals include several kind of board game and experimental theatre sublimed philosophical reflection, which shows a kind of attempt to escape from the cultural industrial logic, however they are characterized by Ilinx(drinking culture) and Alea(board game) emphasized more than Agon, and Mimicry combined with paidia rule strongly. Under the neoliberalism, college students' gloomy reality is represented emasculating of the structure of competitions in the context of an unreal world and Mimicry of experience stay in front of the limen before entering the embodiment.

• Journal of Korea Water Resources Association
• /
• v.41 no.4
• /
• pp.433-444
• /
• 2008

In recent, the integrated water resources management should consider not only existing management objects such as water supply, power generation, and instream flows but also new management objects such as water quantity, water quality, and water habitats which management system is large and complex. Moreover, integrated basin plan or operation are needed for solving conflicts problems between basins and between water usages and to maximize water resources usages. To increase use of optimization method for actual operation and apply various objects, a reservoir operation rule was developed and the KModSim's hydrologic states for integrated water resources management were tested in this study. The simulation results show that the developed operation rules applied in hydrologic states good represent the actual storages of both the Yongdam and the Daecheong Reservoirs so, it is possible to improve the water allocation method usually used in the basin management and manage the integrated basin water resources if new operating rules are applied in optimized programming.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.12
• /
• pp.1-9
• /
• 2009

A full adders is an important component in applications of digital signal processors and microprocessors. Thus it is imperative to improve the power dissipation and operating speed for designing a full adder. We propose a new adder with modified version of conventional static CMOS and pass transistor logic. The carry-out generation circuit of the proposed full adder is different from the conventional XOR-XNOR structure. The output Cout of module III is generated from input A, B and Cin directly without passing through module I as in conventional structure. Thus output Cout is faster by reducing operation step. The proposed module III uses the static CMOS logic style, which results full-swing operation and good driving capability. The proposed 1bit full adder has the advantages over the conventional static CMOS, CPL, TGA, TFA, HPSC, 14T, and TSAC logic. The delay time is improved by 4.3% comparing to the best value known. PDP(power delay product) is improved by 9.8% comparing to the best value. Simulation has been carried out using a $0.18{\mu}m$ CMOS design rule for simulation purposes. The physical design has been verified using HSPICE.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.7 no.3
• /
• pp.43-54
• /
• 1997

Knowledge acquisition is one of the most difficult problems in designing fuzzy systems. As application domains of fuzzy systems become larger and more complex, it is more difficult to find the relations among the system's input- outpiit variables. Moreover, it takes a lot of efforts to formulate expert's knowledge about complex systems' control actions by linguistic variables. Another difficulty is to define and adjust membership functions properly. Soin conventional fuzzy systems, the membership functions should be adjusted to improve the system performance. This is time-consuming process. In this paper, we suggest a new approach to design a fuzzy system. We design a fuzzy system using two neural networks, Kohonen neural network and backpropagation neural network, which generate fuzzy rules automatically and construct inference network. Since fuzzy inference is performed based on fuzzy relation in this approach, we don't need the membership functions of each variable. Therefore it is unnecessary to define and adjust membership functions and we can get fuzzy rules automatically. The design process of fuzzy system becomes simple. The proposed approach is applied to a simulated automatic car speed control system. We can be sure that this approach not only makes the design process of fuzzy systems simple but also produces appropriate inference results.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2615-2628
• /
• 1997

In this paper, a new codebook design algorithm is proposed. It uses a DCT map based on two-dimensional discrete cosine of transform (2D DCT) and finite state vector quantizer (FSVQ) when the vector quantizer is designed for image transmission. We make the map by dividing input image according to edge quantity, then by the map, the significant features of training image are extracted by using the 2D DCT. A master codebook of FSVQ is generated by partitioning the training set using binary tree based on tree-structure. The state codebook is constructed from the master codebook, and then the index of input image is searched at not master codebook but state codebook. And, because the coding of index is important part for high speed digital transmission, it converts fixed length codes to variable length codes in terms of entropy coding rule. The huffman coding assigns transmission codes to codes of codebook. This paper proposes single-side growing huffman tree to speed up huffman code generation process of huffman tree. Compared with the pairwise nearest neighbor (PNN) and classified VQ (CVQ) algorithm, about Einstein and Bridge image, the new algorithm shows better picture quality with 2.04 dB and 2.48 dB differences as to PNN, 1.75 dB and 0.99 dB differences as to CVQ respectively.

• Journal of Internet Computing and Services
• /
• v.13 no.4
• /
• pp.45-52
• /
• 2012

T cells induce immune responses and thereby eliminate infected micro-organisms when peptides from the microbial proteins are bound to HLAs in the host cell surfaces, It is known that the more stable the binding of peptide to HLA is, the stronger the T cell response gets to remove more effectively the source of infection. Accordingly, if peptides (HLA binder) which can be bound stably to a certain HLA are found, those peptieds are utilized to the development of peptide vaccine to prevent infectious diseases or even to cancer. However, HLA is highly polymorphic so that HLA has a large number of alleles with some frequencies even in one population. Therefore, it is very inefficient to find the peptides stably bound to a number of HLAs by testing random possible peptides for all the various alleles frequent in the population. In order to solve this problem, computational methods have recently been developed to predict peptides which are stably bound to a certain HLA. These methods could markedly decrease the number of candidate peptides to be examined by biological experiments. Accordingly, this paper not only introduces a method of machine learning to predict peptides binding to an HLA, but also suggests a new prediction model so called 'knowledge-based genetic algorithm' that has never been tried for HLA binding peptide prediction. Although based on genetic algorithm (GA). it showed more enhanced performance than GA by incorporating expert knowledge in the process of the algorithm. Furthermore, it could extract rules predicting the binding peptide of the HLA alleles common in Koreans.

• Journal of KIISE:Software and Applications
• /
• v.26 no.11
• /
• pp.1314-1323
• /
• 1999

컴퓨터의 사용이 일반화됨에 따라 데이타를 생성하고 수집하는 것이 용이해졌다. 이에 따라 데이타로부터 자동적으로 유용한 지식을 얻는 기술이 필요하게 되었다. 데이타 마이닝에서 얻어진 지식은 정확성과 이해성을 충족해야 한다. 본 논문에서는 데이타 마이닝을 위하여 퍼지 결정트리에 기반한 효율적인 퍼지 규칙을 생성하는 알고리즘을 제안한다. 퍼지 결정트리는 ID3와 C4.5의 이해성과 퍼지이론의 추론과 표현력을 결합한 방법이다. 특히, 퍼지 규칙은 속성 축에 평행하게 판단 경계선을 결정하는 방법으로는 어려운 속성 축에 평행하지 않는 경계선을 갖는 패턴을 효율적으로 분류한다. 제안된 알고리즘은 첫째, 각 속성 데이타의 히스토그램 분석을 통해 적절한 소속함수를 생성한다. 둘째, 주어진 소속함수를 바탕으로 ID3와 C4.5와 유사한 방법으로 퍼지 결정트리를 생성한다. 또한, 유전자 알고리즘을 이용하여 소속함수를 조율한다. IRIS 데이타, Wisconsin breast cancer 데이타, credit screening 데이타 등 벤치마크 데이타들에 대한 실험 결과 제안된 방법이 C4.5 방법을 포함한 다른 방법보다 성능과 규칙의 이해성에서 보다 효율적임을 보인다.Abstract With an extended use of computers, we can easily generate and collect data. There is a need to acquire useful knowledge from data automatically. In data mining the acquired knowledge needs to be both accurate and comprehensible. In this paper, we propose an efficient fuzzy rule generation algorithm based on fuzzy decision tree for data mining. We combine the comprehensibility of rules generated based on decision tree such as ID3 and C4.5 and the expressive power of fuzzy sets. Particularly, fuzzy rules allow us to effectively classify patterns of non-axis-parallel decision boundaries, which are difficult to do using attribute-based classification methods.In our algorithm we first determine an appropriate set of membership functions for each attribute of data using histogram analysis. Given a set of membership functions then we construct a fuzzy decision tree in a similar way to that of ID3 and C4.5. We also apply genetic algorithm to tune the initial set of membership functions. We have experimented our algorithm with several benchmark data sets including the IRIS data, the Wisconsin breast cancer data, and the credit screening data. The experiment results show that our method is more efficient in performance and comprehensibility of rules compared with other methods including C4.5.

• Journal of IKEEE
• /
• v.23 no.2
• /
• pp.727-734
• /
• 2019

This paper confirms whether the movement or specific operation of the muscles in the process of transferring a person from the brain can find a signal showing an essential feature of a certain part of the brain. As a rule, the occurrence of EEG(Electroencephalogram) changes when a signal is received from a specific action or from an induced action. These signals are very vague and difficult to distinguish from the naked eye. Therefore, it is necessary to define a signal for analysis before classification. The EEG form can be divided into the alpha, beta, delta, theta and gamma regions in the frequency ranges. The specific size of these signals does not reflect the exact behavior or intention, since the band or energy difference of the activated frequencies varies depending on the EEG measurement domain. However, if different actions are performed in a specific method, it is possible to classify the movement based on EEG activity and to determine the EEG tendency affecting the movement. Therefore, in this article, we first study the EEG expression pattern based on the activation of the left and right biceps EMG, and then we determine whether there is a significant difference between the EEG due to the activation of the left and right muscles through EEG. If we can find the EEG classification criteria in accordance with the EMG activation, it can help to understand the form of the transmitted signal in the process of transmitting signals from the brain to each muscle. In addition, we can use a lot of unknown EEG information through more complex types of brain signal generation in the future.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.5
• /
• pp.93-106
• /
• 2006

With the rapid growth of the wireless Internet communication, a new generation of mobile devices have made possible the broad distribution of mobile digital contents, such as image, music, video, games and applications over the wireless Internet. Mobile devices are rapidly becoming the major means to extend communication channels without copy Protection, usage rule controlling and authentication. As a result, mobile digital contents may be illegally altered, copied and distributed among unauthorized mobile devices. In this paper, we take a look at Open Mobile Alliance (OMA) DRM v2.0 in general, its purpose and function. The OMA is uniquely the focal point for development of an open standard for mobile DRM. Next we introduces features for an active content and illustrates the difference between an active content and an inactive content. Enabling fast rendering of an active content, we propose an OMA-based DRM framework. This framework include the following: 1) Extending DCF Header for supporting an selective encryption, 2) Content encryption key management, 3) Rendering API for an active content. Experimental results show that the proposed framework is able to render an active content fast enough to satisfy Quality of Experience. %is framework has been proposed for a mobile device environment, but it is also applicable to other devices, such as portable media players, set-top boxes, or personal computer.