• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.45-50
• /
• 2009

The educational exchange through e-learning is working very well in such case as develop e-learning, development of various learning tools, cooperative practical use of e-learning contents, etc. However because there were no considerations of LMS(Learning Management System) interconnection when each systems were developed, the exchange through e-learning is starting to raise a problem. Especially the exchange through e-learning between university produced problem for a variety of reasons by absence of direct exchange in every case such as communication of students information, communication of lecture information, etc. Hence in this thesis, I will present designed model about efficient LMS interconnection through analysis case of exchange through e-learning and deduce problem. In the first place I define essential part for study such as lecture establishment data, lecture data, user data, class data, student learning tracking to interconnection data, then constituted data interconnection table used view by data interconnection prcess. By experiment result, the accessibility between students and professors was more convenience, and decreased work process by less data exchange. Henceforth there are researches in development of various essential parts for study, considered security of LMS interconnection.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.4
• /
• pp.151-161
• /
• 2005

For Internet service providers (ISPs), there are three common types of interconnection agreements : private peering, public peering and transit. One of the most important problems for a single ISP is to determine which other ISPs to interconnect with, and under which agreements. The problem can be then to find a set of private peering providers, transit providers and Internet exchanges (IXs) when the following input data are assumed to be given : a set of BGP addresses with traffic demands, and a set of potential service providers (Private peering/transit providers and IXs) with routing information, cost functions and capacities. The objective is to minimize the total interconnection cost. We show that the problem is NP-hard, give a mixed-integer programming model, and propose a heuristic algorithm. Computational experience with a set of test instances shows the remarkable performance of the proposed algorithm of rapidly generating near-optimal solutions.

• Journal of Advanced Navigation Technology
• /
• v.15 no.4
• /
• pp.640-645
• /
• 2011

The educational exchange through e-learning is working very well in such case as develop e-learning, development of various learning tools, cooperative practical use of e-learning contents, etc. However because there were no considerations of LMS(Learning Management System) interconnection when each systems were developed, the exchange through e-learning is starting to raise a problem. Hence in this thesis, this paper presents designed model about efficient LMS interconnection through analysis case of exchange through e-learning and deduce problem. In the first place essential part for is defied study such as lecture establishment data, lecture data, user data, class data, student learning tracking to interconnection data, then constituted data interconnection table used view by data interconnection process. By experiment result, the accessibility between students and professors was more convenience, and decreased work process by less data exchange. Henceforth there are researches in development of various essential parts for study, considered security of LMS interconnection.

• Proceedings of the Korea Technology Innovation Society Conference
• /
• 2004.05a
• /
• pp.25-36
• /
• 2004

The key objective of this paper is to suggest a pilot model for mobile network interconnection charge calculation by bottom-up long-run incremental costing methodology. Interconnection issues have lately attracted considerable attention by network operators and regulators. However there is no standard by all the network operators' agreement. The costing method is an acute problem because the interconnection charge is directly related to the network operators' revenue. Thus Korea has planned to launch the new interconnection policy based on the current traffic distribution and then we simulate the model in a sample area with virtual data. The results propose objective and reasonable guideline for the mobile network element cost calculation. It can be helpful for calculating price floor or bottom-up long run incremental interconnection charge by regulator.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.388-393
• /
• 2005

Private peering, public peering and transit are three common types of interconnection agreements between providers in the Internet. An important decision that an Internet service provider (ISP) has to make is which private peering/transit ISPs and Internet exchanges (IXs) to connect with to transfer traffic at a minimal cost. In this paper, we deal with the problem to find the minimum cost set of private peering/transit ISPs and IXs for a single ISP. There are given a set of destinations with traffic demands, and a set of potential private peering/transit ISPs and IXs with routing information (routes per destination, the average AS-hop count to each destination, etc.), cost functions and capacities. Our study first considers all the three interconnection types commonly used in real world practices. We show that the problem is NP-hard, and propose a heuristic algorithm for it. We then evaluate the quality of the heuristic solutions for a set of test instances via comparison with the optimal ones obtained by solving a mixed integer programming formulation of the problem. Computational results show that the proposed algorithm provides near-optimal solutions in a fast time.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.2
• /
• pp.6-13
• /
• 2011

This paper deals with the interconnection problem in ad-hoc networks or sensor networks, where relay nodes are deployed additionally to form connections between given nodes. This problem can be reduced to a NP-hard problem. The nodes of the networks, by applications or geographic factors, can be deployed densely in some areas while sparsely in others. For such a case one can make an approximation scheme, which gives shorter execution time, for the additional node deployments by ignoring the interconnections inside the dense area of nodes. However, the case is still a NP-hard, so it is proper to establish a polynomial time approximation scheme (PTAS) by implementing a dynamic programming. The analysis can be made possible by an elaboration on making the definition of the objective function. The objective function should be defined to be able to deal with the requirement incurred by the substitution of the dense area with its abstraction.

• Proceedings of the KIEE Conference
• /
• 2002.11b
• /
• pp.277-279
• /
• 2002

Recently, power requirement has been increasing. But the large generation unit is hardly installed because of economic and environment problem. Therefore, the concern for DG(distributed generation) is growing. Present, allowable interconnection capacity of DG for composite distributed generation is studied. In this paper, it is studied that the new interconnection capacity of DG for composite distribution system interconnected DG. We study new allowable interconnection capacity by power factor and placement. We study SERV(sending end reference voltage) variation and allowable interconnection capacity interconnected new DG.

• Journal of information and communication convergence engineering
• /
• v.20 no.3
• /
• pp.160-165
• /
• 2022

This paper proposes an efficient method of reconstructing interconnections when the terminals of each plane change in real-time situations where randomly divided planes are interconnected. To connect all terminals when the terminals of each plane are changed, we usually reconstruct the interconnections between all terminals. This ensures a minimum connection length, but it takes considerable time to reconstruct the interconnection for the entire terminal. This paper proposes a solution to obtain an optimal tree close to the minimum spanning tree (MST) in a short time. The construction of interconnections has been used in various design-related areas, from networks to architecture. One of these areas is an ad hoc network that only consists of mobile hosts and communicates with each other without a fixed wired network. Each host of an ad hoc network may appear or disappear frequently. Therefore, the heuristic proposed in this paper may expect various cost savings through faster interconnection reconstruction using the given information in situations where the connection target is changing.

• Journal of the Microelectronics and Packaging Society
• /
• v.19 no.4
• /
• pp.13-18
• /
• 2012

By the need for high-speed data transmission in PCB, the studies on the optical PCB has been conducted with optical interconnection and its packaging technology. Particularly, the polymer-based optical interconnection has been extensively studied with the advantages such as cost-effective and ease of process. For high-efficiency and passive alignment, the studies were performed using the 45 degree mirrors, MT connector, and etc. In this work, integrated PLC device and fiber alignment array block was fabricated by using imprint technology to solve the alignment and array problem of optical device and the optical fiber. The fabricated integrated block for optical interconnection of PLC device has achieved higher precision of decreasing the dimensional error of the patterns by optimization of process and its insertion loss has an average value of 4.03dB, lower than criteria specified by international standard. In addition, a optical waveguide with built-in lens has been proposed for high-efficiency and passive alignment. By simulation, it was confirmed that the proposed structure has higher coupling efficiency than conventional no-lens structure and has the broad tolerance for the spatial offset of optical waveguide.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.479-482
• /
• 1998

Whether a given tree is a subgraph of the interconnection network topology is one of the important problem in parallel computing. Trees are used as the underlying structure for divide and conquer algorithms and provide the solution spaces for NP-complete problems. Complete binary trees are the basic structure among those trees. Binomial trees play an important role in broadcasting messages in parallel networks. If binomial trees can be efficiently embedded in complex binary trees, broadcasting algorithms can be effeciently performed on the interconnection networks. In this paper, we present average dilation 2 embedding of binomial trees in complete binary trees.