• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2009년도 춘계 종합학술대회 논문집
• /
• pp.45-50
• /
• 2009

이러닝의 발전과 더불어 다양한 학습도구의 개발 그리고 이러닝 콘텐츠의 공동활용 등 이러닝을 통한 교류가 활발하게 이루어 지고 있다. 그러나 각각 LMS의 상호 연동을 고려하지 않고 개발되었기 때문에 이러닝 교류시 문제점이 나타나게 되었다. 특히 대학간 이러닝 교류는 학습자 정보교환 중심의 교류, 강의(교수자) 정보교환 중심의 교류 등 여러 가지가 있으나, 이들 모두 직접적인 연계가 이루어지지 않기 때문에 여러 가지로 문제점이 많이 나타났다. 이에 본 논문에서는 이러닝 교류의 사례를 분석하고, 문제점을 도출하여 효율적인 LMS 상호 연동에 대한 모형을 설계하여 제시하였다. 우선 먼저 학습에 가장 필요로 하는 학습요소 즉, 강좌개설정보, 강의정보, 사용자정보, 수강정보, 학습이력정보를 연동 데이터로 정의하였으며, 뷰를 이용한 데이터 연동 테이블을 통해 LMS를 연동하였다. 실험결과 학습자와 교수자의 접근성이 편리하게 나타났으며, 데이터 교환이 없기 때문에 업무 프로세스가 현저히 줄었다. 향후에는 다양한 학습요소에 대한 연동과 세션처리, 보안을 고려한 LMS 연동이 연구과제로 남아있다.

• 한국경영과학회지
• /
• 제30권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.

• 한국항행학회논문지
• /
• 제15권4호
• /
• pp.640-645
• /
• 2011

이러닝의 발전과 더불어 다양한 학습도구의 개발 및 이러닝 콘텐츠의 공동 활용 등 이러닝을 통한 교류가 활발하게 이루어지고 있다. 또한 이러닝 교류는 학습자 정보교환 중심의 교류, 교수자 정보교환 중심의 교류 등 여러 가지가 있다. 그러므로 각각 LMS의 상호 연동을 고려하지 않고 개발되었기 때문에 이러닝 교류시 문제점이 나타나게 되었다. 이 문제점을 해결하기 위하여 본 논문에서는 우선 먼저 학습에 가장 필요로 하는 학습요소들 즉, 과목정보, 강의정보, 사용자정보, 수강신청정보, 학습이력정보를 연동데이터로 정의하였으며, 가상의 테이블인 뷰를 이용하여 데이터 연동 테이블을 구성하여 이러닝간 운영관리를 위한 LMS 연동 모델 구현한다. 향후에는 다양한 학습요소에 대한 연동과 세션처리, 보안을 고려한 LMS 연동이 연구과제로 남아있다.

• 한국기술혁신학회:학술대회논문집
• /
• 한국기술혁신학회 2004년도 춘계학술대회
• /
• 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.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2005년도 추계학술대회 및 정기총회
• /
• 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.

• 대한전자공학회논문지TC
• /
• 제48권2호
• /
• pp.6-13
• /
• 2011

본 논문은 ad-hoc 네트워크 또는 센서 네트워크상에서, 주어진 노드들 사이를 상호연결하기 위해 중간노드들을 추가 배치시키는 형태의 상호연결 문제에 대한 연구이다. 이 문제는 NP-hard problem으로 변환된다. 네트워크의 노드들은 응용시스템 또는 지형적인 요인에 의해 일부지역에서는 밀집하여 분포되고, 그 외의 지역에서는 희박하게 분포될 수 있다. 이러한 경우, 노드들이 밀집한 지역의 상호연결을 무시함으로써, 보다 짧은 실행시간 안에 추가노드들의 최적배치에 근접하도록 하는 방법을 만들 수 있다. 그러나 이러한 경우라 하더라도 여전히 NP-hard이므로, 동적프로그래밍을 구현함으로써 다항시간 근사전략(PTAS)을 구성하는 것이 타당하다. 실행결과 등에 대한 분석은 목적함수를 적절하게 정의함으로써 가능해 진다. 목적함수는 노드 밀집지역을 추상화시킴에 의해 발생하게 되는 문제점에 대처할 수 있도록 정의되어야 한다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2002년도 추계학술대회 논문집 전력기술부문
• /
• 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
• /
• 제20권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.

• 마이크로전자및패키징학회지
• /
• 제19권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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• 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.