• Journal of KIISE:Databases
• /
• v.31 no.1
• /
• pp.1-12
• /
• 2004

As network systems are developed rapidly and network architectures are more complex than before, it needs to use PBNM(Policy-Based Network Management) in network system. Generally, architecture of the PBNM consists of two hierarchical layers: management layer and enforcement layer. A security policy server in the management layer should be able to generate new policy, delete, update the existing policy and decide the policy when security policy is requested. And the security policy server should be able to analyze and manage the alert messages received from Policy enforcement system in the enforcement layer for the available information. In this paper, we propose an alert analyzer using data mining. First, in the framework of the policy-based network security management, we design and implement an alert analyzes that analyzes alert data stored in DBMS. The alert analyzer is a helpful system to manage the fault users or hosts. Second, we implement a data mining system for analyzing alert data. The implemented mining system can support alert analyzer and the high level analyzer efficiently for the security policy management. Finally, the proposed system is evaluated with performance parameter, and is able to find out new alert sequences and similar alert patterns.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.3
• /
• pp.451-461
• /
• 1994

For developing countries which are in infant state of data communication services or don`t have their own Packet Switched Public Data Network(PSPDN), we present the strategy to construct the public data communication network, which guarantees the easy diffusion of data communication services, agrees with trends of telecommunication technology, and maximizes the outcomes to investments. With analyzing the characteristics of telecommunication infrastructures and demands of data communication services in a developing country, we show that the introduction of ISDN is the best solution for constructing a public data network. We also suggest aggressive approach to realize the packet switching functions into ISDN switching system and the networking scenario consisting of three graceful steps, based on the evolution of network architectures. Finally we show that the TDX-10 ISDN switching system, which is designed especially for developing countries, is helpful to commence the data communication era.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.2
• /
• pp.312-320
• /
• 2012

In this study, we introduce a new design methodology of a granular-oriented self-organizing polynomial neural networks (GoSOPNNs) that is based on multi-layer perceptron with Context-based Polynomial Neurons (CPNs) or Polynomial Neurons (PNs). In contrast to the typical architectures encountered in polynomial neural networks (PNN), our main objective is to develop a methodological design strategy of GoSOPNNs as follows : (a) The 1st layer of the proposed network consists of Context-based Polynomial Neuron (CPN). In here, CPN is fully reflective of the structure encountered in numeric data which are granulated with the aid of Context-based Fuzzy C-Means (C-FCM) clustering method. The context-based clustering supporting the design of information granules is completed in the space of the input data while the build of the clusters is guided by a collection of some predefined fuzzy sets (so-called contexts) defined in the output space. (b) The proposed design procedure being applied at each layer of GoSOPNN leads to the selection of preferred nodes of the network (CPNs or PNs) whose local characteristics (such as the number of contexts, the number of clusters, a collection of the specific subset of input variables, and the order of the polynomial) can be easily adjusted. These options contribute to the flexibility as well as simplicity and compactness of the resulting architecture of the network. For the evaluation of performance of the proposed GoSOPNN network, we describe a detailed characteristic of the proposed model using a well-known learning machine data(Automobile Miles Per Gallon Data, Boston Housing Data, Medical Image System Data).

• The KIPS Transactions:PartD
• /
• v.11D no.3
• /
• pp.683-690
• /
• 2004

MND(Ministry of National Defense) has developed .nm AF(Ministry of National Defense Architecture Framework) to guarantee interoperability among defense information systems. Users can easily and consistently develop architecture products through MND AF. There is necessity for development if CADM(Core Architecture Data Model), which facilitate exchange, integration, and comparison for architecture data, to store architecture data from architecture products and reuse them. We developed CADM from defining entities and relationships that satisfy data requirement of each architecture product from MND AF. After we developed architecture products about MIMS(Military Intelligence Management System), and inserted these architecture data to CADM repository. we verified CADM entities and relationships through query. Through CABM which provides common data model for the whole my architectures, interoperability and integration among defense information systems ran be improved, and integrated defense information resources efficiently can be managed.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.9
• /
• pp.2269-2279
• /
• 1997

SVLIW (Superscalar VLIW) processor, a family of VLIW processors schedules very long instruction words at runtime. If a very long instruction word that is to be issued occurs data dependence relations and/or resource conflicts with those words that were under execution, a long NOP word is issued instead of the word until all the data dependence relations and/or resource conflicts have been resolved. Thus, LNOPs can be removed in object codes for SVLIW processors. In this paper, we measure an improvement of the cache hit ratio caused by removing LNOPs in the object code. We also analyze an improvement of the processor performance due to higher cache hit ratio of the processor. Benchmark tests promise that the performance of SVLIW processors is improved more than 5% compared with that of traditional VLIW processors.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.545-553
• /
• 2009

String matching is a fundamental element of an important category of modern packet processing applications which involve scanning the content flowing through a network for thousands of strings at the line rate. To keep pace with high network speeds, specialized hardware-based solutions are needed which should be efficient enough to maintain scalability in terms of speed and the number of strings. In this paper, a novel architecture based upon a recently proposed data structure called the Bloomier filter is proposed which can successfully support scalability. The Bloomier filter is a compact data structure for encoding arbitrary functions, and it supports approximate evaluation queries. By eliminating the Bloomier filter's false positives in a space efficient way, a simple yet powerful exact string matching architecture is proposed that can handle several thousand strings at high rates and is amenable to on-chip realization. The proposed scheme is implemented in reconfigurable hardware and we compare it with existing solutions. The results show that the proposed approach achieves better performance compared to other existing architectures measured in terms of throughput per logic cells per character as a metric.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.8
• /
• pp.664-674
• /
• 2001

In this paper, as a new category of fuzzy-neural networks architecture, we propose Fuzzy Polynomial Neural Networks (FPNN) and discuss a comprehensive design methodology related to its architecture. FPNN dwells on the ideas of fuzzy rule-based computing and neural networks. The FPNN architecture consists of layers with activation nodes based on fuzzy inference rules. Here each activation node is presented as Fuzzy Polynomial Neuron(FPN). The conclusion part of the rules, especially the regression polynomial, uses several types of high-order polynomials such as linear, quadratic and modified quadratic. As the premise part of the rules, both triangular and Gaussian-like membership functions are studied. It is worth stressing that the number of the layers and the nods in each layer of the FPNN are not predetermined, unlike in the case of the popular multilayer perceptron structure, but these are generated in a dynamic manner. With the aid of two representative time series process data, a detailed design procedure is discussed, and the stability is introduced as a measure of stability of the model for the comparative analysis of various architectures.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.54 no.4
• /
• pp.65-71
• /
• 2012

The objective of this study was to estimate surface runoff from rice paddy plots using an artificial neural network (ANN). A field experiment with three treatment levels was conducted in the NICS saemangum experimental field located in Iksan, Korea. The ANN model with the optimal network architectures, named Paddy1901 with 19 input nodes, 1 hidden layer with 16 neurons nodes, and 1 output node, was adopted to predict surface runoff from the plots. The model consisted of 7 parameters of precipitation, irrigation rate, ponding depth, average temperature, relative humidity, wind speed, and solar radiation on the daily basis. Daily runoff, as the target simulation value, was computed using a water balance equation. The field data collected in 2011 were used for training and validation of the model. The model was trained based on the error back propagation algorithm with sigmoid activation function. Simulation results for the independent training and testing data series showed that the model can perform well in simulating surface runoff from the study plots. The developed model has a main advantage that there is no requirement for any prior assumptions regarding the processes involved. ANN model thus can be a good tool to predict surface runoff from rice paddy fields.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.2 no.1
• /
• pp.43-48
• /
• 2002

This paper discusses the application of fuzzy-ARTMAP neural network to compensate the nonlinearity of satellite communication channel. The fuzzy-ARTMAP is the class of ART(adaptive resonance theory) architectures designed fur supervised loaming. It has capabilities not fecund in other neural network approaches, that includes a small number of parameters, no requirements fur the choice of initial weights, automatic increase of hidden units, and capability of adding new data without retraining previously trained data. By a match tracking process with vigilance parameter, fuzzy-ARTMAP neural network achieves a minimax teaming rule that minimizes predictive error and maximizes generalization. Thus, the system automatically leans a minimal number of recognition categories, or hidden units, to meet accuracy criteria. As a input-converting process for implementing fuzzy-ARTMAP equalizer, the sigmoid function is chosen to convert actual channel output to the proper input values of fuzzy-ARTMAP. Simulation studies are performed over satellite nonlinear channels. QPSK signals with Gaussian noise are generated at random from Volterra model. The performance of proposed fuzzy-ARTMAP equalizer is compared with MLP equalizer.

• Journal of Internet Computing and Services
• /
• v.19 no.2
• /
• pp.33-41
• /
• 2018

In recent years, technology is rapidly changing to support new service consumption and distribution models in multimedia service systems and hybrid delivery of media services is a key factor for enabling next generation multimedia services. This phenomenon can lead to rapidly increasing network traffic and ultimately has a direct and aggravating effect on the user's quality of service (QOS). To address the issue, we propose a novel system architecture to provide smart hybrid media services efficiently. The architecture is designed to apply the software-defined networking (SDN) method, detect changes in traffic, and combine the data, including user data, service features, and computation node status, to provide a service schedule that is suitable for the current state. To this end, the proposed architecture is based on 2-level scheduling, where Level-1 scheduling is responsible for the best network path and a computation node for processing the user request, whereas Level-2 scheduling deals with individual service requests that arrived at the computation node. This paper describes the overall concept of the architecture, as well as the functions of each component. In addition, this paper describes potential scenarios that demonstrate how this architecture could provide services more efficiently than current media-service architectures.