• Journal of the Korea Society of Computer and Information
• /
• v.7 no.2
• /
• pp.53-58
• /
• 2002

the popularity of uses for internet has been needed to information security. thereforce, intrusion, information leakage and modification, change or intentional efflux to computer system aspects of information security have been resulted in requirement of intrusion detection from outer at user authentication. this problem Presents design of PUM(Processing Unit Module) which analyze both the host log generated by sever host systems that various case for intellectualized intrusion method and network_packet on networks in large scale network.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.4
• /
• pp.661-671
• /
• 1998

It is important to minimize the number of disk accesses which is necessary to transfer data in disk into main memory when processing transactions in physical database design. A vertical file partitioning method is used to reduce the number of disk accesses by partitioning relations vertically and accessing only necessay fragments. In this paper, SOFM(Self-Organizing Feature Maps) network is used to solve vertical partitioning problems. This paper shows that SOFM network is efficient in solving vertical partitioning problem by comparing approximate solution of SOFM network with optimal solution of N-ary branch and bound method. And this paper presents a heuristic algorithm for allocating duplicate attributes to vertically partitioned fragments. As branch and bound method requires particularly much computing time to solve large-sized problems, it is shown that SOFM network is able to overcome this limitation of branch and bound method and solve large-sized problems efficiently in a short time.

• Proceedings of the KOR-KST Conference
• /
• 2000.02a
• /
• pp.89-115
• /
• 2000

Traffic signal setting policies and traffic assignment procedures are mutually dependent. The combined signal control and traffic assignment problem deals with this interaction. With the total travel time minimization objective, gradient based local search methods are implemented. Deterministic user equilibrium is the selected user route choice rule, Webster's delay curve is the link performance function, and green time per cycle ratios are decision variables. Three implemented solution codes resulting in six variations include intersections operating under multiphase operation with overlapping traffic movements. For reference, the iterative approach is also coded and all codes are tested in four example networks at five demand levels. The results show the numerical gradient estimation procedure performs best although the simplified local searches show reducing the large network computational burden. Demand level as well as network size affects the relative performance of the local and iterative approaches. As demand level becomes higher, (1) in the small network, the local search tends to outperform the iterative search and (2) in the large network, vice versa.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.1
• /
• pp.1-17
• /
• 1996

There have been considerable researches for solving large-scale separable convex optimization ptoblems. In this paper we present a method for large-scale nonseparable smooth convex optimization problems with block-angular linear constraints. One of them is occurred in reconfiguration of the virtual path network which finds the routing path and assigns the bandwidth of the path for each traffic class in ATM (Asynchronous Transfer Mode) network [1]. The solution is approximated by solving a sequence of the block-angular structured separable quadratic programming problems. Bundle-based decomposition method [10, 11, 12]is applied to each large-scale separable quadratic programming problem. We implement the method and present some computational experiences.

• Proceedings of the Korean Society of Agricultural Engineers Conference
• /
• 2005.10a
• /
• pp.695-699
• /
• 2005

Propriety of PERT network for planning and management in large-scale systems was investigated. We also review the example of small and middle size system to compare the appropriateness of PERT analysis method. For comparing the appropriateness of PERT analysis method the calculation time, and the variances were estimated. Eventualy, we proposed the criteria of PERT analysis method for planning and management large-scale systems.

• Communications of the Korean Mathematical Society
• /
• v.10 no.3
• /
• pp.735-750
• /
• 1995

We present a domain decomposition algorithm for solving large sparse linear systems of equations arising from queuing networks. Such techniques are attractive since the problems in subdomains can be solved independently by parallel processors. Many of the methods proposed so far use some form of the preconditioned conjugate gradient method to deal with one large interface problem between subdomains. However, in this paper, we propose a "nested" domain decomposition method where the subsystems governing the interfaces are small enough so that they are easily solvable by direct methods on machines with many parallel processors. Convergence of the algorithms is also shown.lso shown.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.337-341
• /
• 1995

This paper presents a robust control scheme using a multilayer network for the robot manipulator operating under the sea which has large uncertainties such as the buoyancy and the added mass/moment of inertia. The multilayer neural network acts as a compensator of the conventional sliding mode controller to maintain the control performance when the initial assumptions of uncertainty bounds are not valid. By the computer simulation results, the proposed control scheme dose not effectively compensate large uncertainties, but also reduces the steady stare error of the conventional sliding mode controller.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.37-42
• /
• 1992

The main purpose of the paper is to derive asymptotic formulae for performance characteristics(throughput, delay) of large-scale token-passing network with buffered stations and to optimize the buffer capacity with respect to the probability of data generation. We consider two versions of token-passing network: uniform and nonuniform token-passing time interval. All results obtained are supported by simulations.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.145-148
• /
• 2001

For reducing network traffic between long distance network or WAN, we supplement the Peer-to-Peer technology to HTTP. The large file transmition have the biggest traffic on HTTP. If downloading a large size file from a near computer not from the original location, we will get it speedier. For this, we propose a extened HTTP, named HTTP3. In this paper, we describe the HTTP3, the HTTP3 agent to support this protocol., and its security.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.5
• /
• pp.1198-1212
• /
• 2013

Network virtualization enables autonomous and heterogeneous Virtual Networks (VNs) to co-exist on a shared physical substrate. In a Network Virtualization Environment (NVE), the fact that individual VNs are underpinned by diverse naming mechanisms brings about an obvious challenge for transparent communication across multiple VN domains due to the complexity of uniquely identifying users. Existing solutions were mainly proposed compatible to Internet paradigm with little consideration of their applications in a virtualized environment. This calls for a scalable and efficient naming framework to enable consistent communication across a large user population (fixed or mobile) hosted by multiple VNs. This paper highlights the underlying technical requirements and presents a scalable Global Naming Framework (GNF), which (1) enables transparent communication across multiple VNs owned by the same or different SPs; (2) supports communication in the presence of dynamics induced from both VN and end users; and (3) greatly reduces the network operational complexity (space and time). The suggested approach is assessed through extensive simulation experiments for a range of network scenarios. The numerical result clearly verifies its effectiveness and scalability which enables its application in a large-scale NVE without significant deployment and management hurdles.