• Journal of Internet Computing and Services
• /
• v.2 no.5
• /
• pp.93-104
• /
• 2001

In this paper. we analyze networks in accordance with topology which consists of ATM-LAN in order to enhance performance in multimedia environment, We analyze job processing time of Email, FTP and Http server for variance of node in star, ring and mesh topology, We analyze a load factor of Email, FTP and Http server and variance of sending/receiving rate for various topology, We examined that the constituent networks in this paper can minimize load of server in any other topology.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.4
• /
• pp.766-776
• /
• 2001

In the constructing of the multi layer neural network, the network topology is often chosen arbitrarily for different applications, and the optimum topology of the network is determined by the long processing of the trial and error. In this paper, we propose the automatic topology construction using the fuzzy rule that optimizes the neurons of hidden layer, and prune the weights connecting the hidden layer and the output layer during the training process. The simulation of pattern recognition, and the experiment of the mapping of the inverted pendulum showed the effectiveness of the proposed method.

• Proceedings of the KIEE Conference
• /
• 2002.11a
• /
• pp.212-214
• /
• 2002

Basically, OCT use the interference effect of Michelson interferometer. The receiver noise of interferometer is a important fact to improve the system performance. To improve the system performance for high resolution image processing, we design a interferometer topology adding the attenuator to the reference arm. In this paper, we design the receiver noise parameter and computer simulation. In this results, SNR of the new topology system is improved 5dB compare to standard interferometer.

• The KIPS Transactions:PartB
• /
• v.17B no.1
• /
• pp.79-84
• /
• 2010

Matching spots between two sets of 2-dimensional electrophoresis can make it possible to find out the generation, extinction and change of proteins. Generally protein spots are separated by 2-dimensional electrophoresis. This process makes the position of the same protein spot a little different according to the status of the tissue or the experimental environment. Matching the spots shows that the relation of spots is non-uniform and non-linear transformation. However we can also find that the local relation preserves the topology. This study proposes a matching method motivated by the preservation of the topology. To compare the similarity of the topology, we compared the distance and the angle between neighbour spots. Experimental result shows that the proposed method is effective.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.157-166
• /
• 2001

A simulation package has been developed as an event-driven system that can handle the hardware configuration of STC104 and algorithm proposed in the sister paper of ‘Study on High Speed Routers(II).’After various STC104 topology of meshes, torus, and hypercubes are constructed using up to 512 switches, the performance of each topology has been analyzed under different message generation rate in terms of throughputs, latency, and packet blocking time. Modified multicast algorithms for STC104 have been proposed for STC104 after U-mesh and U-torus in order to overcome the multicasting difficulty because of the point-to-point communication method found in STC104. The performance of the multicast algorithms have been analyzed over meshes and torus configuration. Throughput gets higher in the order of mesh, torus, and hypercube. Throughput difference among topology were distinctive in the zone of high message generation rate. Latency and blocking time increased in the order of hypercube, torus, and mesh. U-mesh and U-torus of software multicast showed similar throughput, however, U-mesh peformed slightly better result. These algorithms showed eight to ten times better results compared to individual message pass for 90 destination nodes. Multi-link environment also showed better performance than single-link environment because multi-link network used the extra links for communication.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.926-937
• /
• 1996

A graph traversal technique is a certain pattern of visiting nodes of a graph. Many special traversal techniques have been applied to solve graph related problems. For example, the depth first search technique has been used for finding strongly onnected components of a directed graph or biconnected components of a general graph. The distributed protocol to implement his depth first search technique on the distributed network can be divided into a fixed topology problem where there is no topological change and a dynamic topology problem which has some topological changes. Therefore, in this paper, we present a more efficient distributed depth first search protocol with fixed topology and a resilient distributed depth first search protocol where there are topological changes for the distributed network. Also, we analysed the message and time complexity of the presented protocols and showed the improved results than the complexities of the other distributed depth first search protocols.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.299-306
• /
• 1999

Considers the problem to update the spanning tree and strongly-connected components in response to topology change of the network. This paper proposes a distributed algorithm that solves such a problem after several processors and links are added and deleted. Its message complexity and its ideal-time complexity are O(n'log n'+ (n'+s+t)) and O(n'logn') respectively where n'is the number of processors in the network after the topology change, s is the number of added links, and t is the total number of links in the strongly connected component (of the network before the topology change) including the deleted links.

• The KIPS Transactions:PartC
• /
• v.11C no.5
• /
• pp.645-652
• /
• 2004

In this paper, we aggregate multi-links information between boundary nodes using the line segment scheme that aggregates topology in-formation within PG referring bandwidth and delay parameter. The proposed scheme can search multi-links efficiently using the depth priority method based on hop count instead of searching all links. To do this, we propose a modified line segment algorithm using two line segment method that represents two points which consist of delay-bandwidth pair to reduce topology information and provide a flexibility to the multi pie-links aggregation. And we apply it to current star topology aggregation. To evaluate performance of the proposed scheme, we compare/analyze the current method with the proposed scheme with respect to call success rate, access time and crankback rate. Through the simulation result analysis, the proposed star topology aggregation scheme presents the better performance than existing scheme.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.591-593
• /
• 2022

This paper proposes a partial offloading system for minimizing application service processing latency in an FEC (Fog/Edge Computing) environment, and it analyzes the offloading effect of the proposed system against local-only and edge-server-only processing based on network load. A partial offloading algorithm based on reconstruction linearization of multi-branch structures is included in the proposed system, as is an optimal collaboration algorithm between mobile devices and edge servers [1,2]. The experiment was conducted by applying layer scheduling to a logical CNN model with a DAG topology. When compared to local or edge-only executions, experimental results show that the proposed system always provides efficient task processing strategies and processing latency.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.7
• /
• pp.1276-1280
• /
• 2009

This paper presents a fault diagnosis expert system for 765kV substation. The proposed system includes the topology processor and intelligent alarm processing subsystems. This expert system estimates the fault section through the inference process using heuristic knowledge and the output of topology processor and intelligent alarm processing system. The rule-base of this expert system is composed of basic rules suggested by Korea Electric Power Corporation and heuristic rules. This expert system is developed using PROLOG language. Also, user friendly Graphic User Interface is developed using visual basic programming in the windows XP environment. The proposed expert system showed a promising performance through the several case studies.