• Title/Summary/Keyword: virtual link

Search Result 214, Processing Time 0.025 seconds

Design and Implementation of 3D Web Service based on ASE File and Model Database (ASE 파일 파싱과 모델 데이터베이스 연동을 통한 3D 웹 서비스 설계 및 구현)

  • Yeo, Yun-Seok;Park, Jong-Koo
    • The KIPS Transactions:PartD
    • /
    • v.11D no.6
    • /
    • pp.1327-1334
    • /
    • 2004
  • The purpose of this paper is to implement Web 3D environment that is not provider - oriented but client-oriented in order to provide dynamic information and to analyze knowledges by executing programs on Web pages. For these, The 3D Viewer program that parses and renders ASE files - the most general 3D Model Data file and exported text file of 3D Max Studio - is made and then converted into ActiveX 3D Viewer Component that can be used on the Web. With the purpose of managing ASE and texture file efficiently and interacting between clients and server, ActiveX Component link ASP and Database with Web Service. The 3D View Web Service can make dynamic information and cooperative works easier in Networked Virtual Reality.

Effects of Easy Understanding of Library User Interface on the Use of Electronic Materials in a Virtual Academic Library (사용자인터페이스의 이해용이성이 전자도서관 자료이용에 미치는 영향)

  • Yoo, Jae-Ok
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.20 no.1
    • /
    • pp.59-72
    • /
    • 2009
  • This study investigates whether easy understanding of user interface could affect the use of electronic materials in a virtual academic library. The user interface of Duksung Women's University Library was analysed in terms of label description and array of menus. The frequencies of menu use were collected by analysis of use log files after modified user interface was applied. Clear label descriptions of link menus and sub-menus of electronic material searches significantly contributed to the increase of number of user clicks on the modified menus. This study reveals that the more clearly menu labels are described, the more frequently users click the menus on the academic library user interface.

A Possible Path per Link CBR Algorithm for Interference Avoidance in MPLS Networks

  • Sa-Ngiamsak, Wisitsak;Varakulsiripunth, Ruttikorn
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.772-776
    • /
    • 2004
  • This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.

  • PDF

Optimal Relay Position of Hybrid ARQ Incremental Cooperative Relaying Scheme with Limited Feedback (피드백을 제한하는 Hybrid ARQ를 이용한 증분 협력 중계기법의 최적의 중계기 위치에 관한 연구)

  • Kim, Lyum;Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.3
    • /
    • pp.53-58
    • /
    • 2011
  • Recently, MIMO technology, which can improve data rate, link reliability and diversity order, has been widely studied. However, due to the limitation of size, cost and complexity, it is difficult to equip multiple antennas in mobile devices. To overcome this problem, the cooperative communication scheme has been proposed. In this scheme, each terminal shares its single antenna to form a virtual MIMO environment. However, in conventional cooperative scheme, e.g, decode-and-forward, amplify and forward, the spectral efficiency is decreased if there are many terminals taking part in the cooperation. Therefore, the incremental relaying scheme has been proposed to solve this problem. In this paper, we consider various models using incremental relaying technique. In addition, the position of relay is investigated in order to obtain optimal performance.

Development of Internet-based Basic Planning System for Ships (인터넷 기반의 선박 기본계획 지원시스템 개발)

  • Lee S.-S.;Lee J.-K.;Lee K.-H.;Park J.-W.;Kim S.-Y.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.9 no.4
    • /
    • pp.406-415
    • /
    • 2004
  • The industrial environment for shipbuilding in 21st century requires increase in few type of ships and marine structures, international cooperation and globalization, while virtual enterprise environment is rapidly establishing. On the other hand, more and more efforts will be spent on internet based distributed and collaborative environment rather than being spent on unit level automations such as CAD, CAM and CAE, and the link between them. Recent internet technology and information technology in heterogeneous environment are being applied in shipbuilding industry as well as in other industries. While these technology are rapidly adopted in major shipyards, many small and medium-sized shipyards does not have enough resources to introduce system designed for large enterprise. In this paper, a prototype of Internet technology based basic planning system is implemented for the small and medium sized shipyards based on the internet technology and concurrent engineering concept. First, the system is designed from the user requirements. Then standardized development environment and tools are selected. These tools are used for defining and evaluating core application technologies for the system development. This can guarantee the survival of small and medium-sized shipyards in 21st century industrial environment.

Automatic Assembly Task of Electric Line Using 6-Link Electro-Hydraulic Manipulators

  • Kyoungkwan Ahn;Lee, Byung-Ryong;Yang, Soon-Yong
    • Journal of Mechanical Science and Technology
    • /
    • v.16 no.12
    • /
    • pp.1633-1642
    • /
    • 2002
  • Uninterrupted power supply has become indispensable during the maintenance task of active electric power lines as a result of today's highly information-oriented society and increasing demand of electric utilities. The maintenance task has the risk of electric shock and the danger of falling from high place. Therefore it is necessary to realize an autonomous robot system using electro-hydraulic manipulator because hydraulic manipulators have the advantage of electric insulation. Meanwhile it is relatively difficult to realize autonomous assembly tasks particularly in the case of manipulating flexible objects such as electric lines. In this report, a discrete event control system is introduced for automatic assembly task of electric lines into sleeves as one of the typical task of active electric power lines. In the implementation of a discrete event control system, LVQNN (linear vector quantization neural network) is applied to the insertion task of electric lines to sleeves. In order to apply these proposed control system to the unknown environment, virtual learning data for LVQNN is generated by fuzzy inference. By the experimental results of two types of electric lines and sleeves, these proposed discrete event control and neural network learning algorithm are confirmed very effective to the insertion tasks of electric lines to sleeves as a typical task of active electric power maintenance tasks.

Using Omnidirectional Images for Semi-Automatically Generating IndoorGML Data

  • Claridades, Alexis Richard;Lee, Jiyeong;Blanco, Ariel
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.36 no.5
    • /
    • pp.319-333
    • /
    • 2018
  • As human beings spend more time indoors, and with the growing complexity of indoor spaces, more focus is given to indoor spatial applications and services. 3D topological networks are used for various spatial applications that involve navigation indoors such as emergency evacuation, indoor positioning, and visualization. Manually generating indoor network data is impractical and prone to errors, yet current methods in automation need expensive sensors or datasets that are difficult and expensive to obtain and process. In this research, a methodology for semi-automatically generating a 3D indoor topological model based on IndoorGML (Indoor Geographic Markup Language) is proposed. The concept of Shooting Point is defined to accommodate the usage of omnidirectional images in generating IndoorGML data. Omnidirectional images were captured at selected Shooting Points in the building using a fisheye camera lens and rotator and indoor spaces are then identified using image processing implemented in Python. Relative positions of spaces obtained from CAD (Computer-Assisted Drawing) were used to generate 3D node-relation graphs representing adjacency, connectivity, and accessibility in the study area. Subspacing is performed to more accurately depict large indoor spaces and actual pedestrian movement. Since the images provide very realistic visualization, the topological relationships were used to link them to produce an indoor virtual tour.

Dynamic Network routing -an Agent Based Approach

  • Gupha, Akash;Zutshi, Aditya
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2001.01a
    • /
    • pp.50-58
    • /
    • 2001
  • Modern day networks are increasingly moving towards peer to peer architecture where routing tasks will not be limited to some dedicated routers, but instead all computers in a network will take part in some routing task. Since there are no specialized routers, each node performs some routing tasks and information passes from one neighbouring node to another, not in the form of dumb data, but as intelligent virtual agents or active code that performs some tasks by executing at intermediate nodes in its itinerary. The mobile agents can run, and they are free to d other tasks as the agent will take care of the routing tasks. The mobile agents because of their inherent 'intelligence'are better able to execute complex routing tasks and handle unexpected situations as compared to traditional routing techniques. In a modern day dynamic network users get connected frequently, change neighbours and disconnect at a rapid pace. There can be unexpected link failure as well. The mobile agent based routing system should be able to react to these situations in a fact and efficient manner so that information regarding change in topology propagates quickly and at the same time the network should not get burdened with traffic. We intend to build such a system.

  • PDF

Network function virtualization (NFV) resource allocation (RA) scheme and research trend (네트워크기능 가상화 (NFV) 자원할당 (RA) 방식과 연구동향)

  • Kim, Hyuncheol;Yoon, Seunghyun;Jeon, Hongseok;Lee, Wonhyuk
    • Convergence Security Journal
    • /
    • v.16 no.7
    • /
    • pp.159-165
    • /
    • 2016
  • Through the NFV (Network Function Virtualization), companies such as network service providers and carriers have sought to dramatically reduce CAPEX / OPEX by improving the speed of new service provisioning and flexibility of network construction through the S/W-based devices provided by NFV. One of the most important considerations for establishing an NFV network to provide dynamic services is to determine how to dynamically allocate resources (VNFs), the basic building blocks of network services, in the right place. In this paper, we analyzed the latest research trends on VNF node, link allocation, and scheduling in nodes that are required to provide arbitrary NS in NFV framework. In this paper, we also propose VNF scheduling problems that should be studied further in RA (Resource Allocation).

Extending Bibliographic Information Using Linked Data (링크드 데이터 방식을 통한 서지 정보의 확장에 관한 연구)

  • Park, Zi-Young
    • Journal of the Korean Society for information Management
    • /
    • v.29 no.1
    • /
    • pp.231-251
    • /
    • 2012
  • In this study, Linked Data was used for extending bibliographic data, because Linked Data provides shareable identifiers, data structures, and link information. Linked Data is especially efficient in expanding bibliographic data integrated with bibliographic ontology. Therefore, Linked Data and bibliographic ontologies were analyzed and available Linked Data was suggested. By linking between meta-data schemes, bibliographic data, and authority data, issues for the effective Linked Data sharing were suggested: 1) selecting proper Linked Data for each bibliographic organization, 2) linking between different Linked Data, and 3) developing their own Linked Data for each bibliographic organization.