• Title/Summary/Keyword: virtual node

Search Result 245, Processing Time 0.032 seconds

General Theory for Free Vibration and Stability Analysis of Thin-walled Space Beam-Columns and Frames (박벽 공간 보-기둥과 뼈대구조의 자유진동 및 안정성 해석을 위한 일반이론)

  • 김성보;구봉근;한상훈
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1997.10a
    • /
    • pp.239-246
    • /
    • 1997
  • The general formulation of free vibration and stability analysis of unsymmetric thin-walled space frames and beam-columns is presented. The kinetic and total potential energy is derived by applying the extended virtual work principle, introducing displacement parameters defined at the arbitrarily chosen axis and including second order terms of finite semitangential rotations. In formulating the finite element procedure, cubic Hermitian polynomials are utilized as shape functions of the two node space frame element. Mass, elastic stiffness, and geometric stiffness matrices for the unsymmetric thin-walled section are evaluated. In order to illustrate the accuracy and practical usefulness of this formulation, finite element solutions for the free vibration and stability problems of thin-walled beam-columns and space frames are presented and compared with available solutions.

  • PDF

Design and Implementation of an Object Migration System Using the Java Language (Java 언어를 이용한 객체이동시스템의 설계 및 구현)

  • Jeon, Byeong-Guk;Lee, Geun-Sang;Choe, Yeong-Geun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.1
    • /
    • pp.49-56
    • /
    • 1999
  • Distributed object Computing, owing to the development of distributed computing, has improved the performance of distributed processing conducted between homogeneous and heterogeneous systems in network. However, it has failed to solve fundamental problems such as network overload and enormous requests demands by servers and clients. In this paper, we propose to design and implement an Object Migration system that uses the java language to tackle the mentioned problems. As the first step of the implementation of the system, we justify the characteristics of t도 mobile object model that keeps codes and states of an object. Implemented Object Migration System would accept objects being migrated to a specific node and support the virtual place in which objects could be executed automatically. Therefore, the Object Migration system we suggest could not only solve problems imposed to traditional distributed computing but also offer transparency of object migration between homogeneous and heterogeneous systems.

  • PDF

CADRAM - Cooperative Agents Dynamic Resource Allocation and Monitoring in Cloud Computing

  • Abdullah, M.;Surputheen, M. Mohamed
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.3
    • /
    • pp.95-100
    • /
    • 2022
  • Cloud computing platform is a shared pool of resources and services with various kind of models delivered to the customers through the Internet. The methods include an on-demand dynamically-scalable form charged using a pay-per-use model. The main problem with this model is the allocation of resource in dynamic. In this paper, we have proposed a mechanism to optimize the resource provisioning task by reducing the job completion time while, minimizing the associated cost. We present the Cooperative Agents Dynamic Resource Allocation and Monitoring in Cloud Computing CADRAM system, which includes more than one agent in order to manage and observe resource provided by the service provider while considering the Clients' quality of service (QoS) requirements as defined in the service-level agreement (SLA). Moreover, CADRAM contains a new Virtual Machine (VM) selection algorithm called the Node Failure Discovery (NFD) algorithm. The performance of the CADRAM system is evaluated using the CloudSim tool. The results illustrated that CADRAM system increases resource utilization and decreases power consumption while avoiding SLA violations.

Implementation of Node Update System using Virtual Area Technique (가상영역기법을 이용한 노드 갱신 시스템)

  • Bae, Jang-Sik;Lee, Seok-Jin;Sohn, Young-Ho
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.11a
    • /
    • pp.253-254
    • /
    • 2009
  • 무선센서네트워크를 구성하는 센서노드들은 각 각의 목적에 따라 다양한 위치에 설치되어 정해진 목적에 따라 동작을 한다. 센서노드들의 특성상 일반적으로 유지보수 및 관리가 쉽지 않은 곳에 설치되는 경우가 대부분이어서 무선통신을 이용한 관리 방법이 필수적인 상황이다. 종래에 센서노드의 실행 이미지 전체를 갱신하는 방법은 저전력과 저속의 무선통신환경에서 적절한 방법이 아니라 할 수 있다. 따라서 본 논문에서는 실행 이미지 전체의 갱신이 아닌 필요한 일부분 만을 갱신할 수 있는 시스템의 개발에 관하여 제안한다.

An Efficient Split Algorithm to Minimize the Overlap between Node Index Spaces in a Multi-dimensional Indexing Scheme M-tree (다차원 색인구조 M-트리에서 노드 색인 공간의 중첩을 최소화하기 위한 효율적인 분할 알고리즘)

  • Im Sang-hyuk;Ku Kyong-I;Kim Ki-chang;Kim Yoo-Sung
    • The KIPS Transactions:PartD
    • /
    • v.12D no.2 s.98
    • /
    • pp.233-246
    • /
    • 2005
  • To enhance the user response time of content-based retrieval service for multimedia information, several multi-dimensional index schemes have been proposed. M-tree, a well-known multidimensional index scheme is of metric space access method, and is based on the distance between objects in the metric space. However, since the overlap between index spaces of nodes might enlarge the number of nodes of M-tree accessed for query processing, the user response time for content-based multimedia information retrieval grows longer. In this paper, we propose a node split algorithm which is able to reduce the sire of overlap between index spaces of nodes in M-tree. In the proposed scheme, we choose a virtual center point as the routing object and entry redistribution as the postprocessing after node split in order to reduce the radius of index space of a node, and finally in order to reduce the overlap between the index spaces of routing nodes. From the experimental results, we can see the proposed split algorithm reduce the overlap between index space of nodes and finally enhance the user response time for similarity-based query processing.

An Efficient Disk Sharing Technique supporting Single Disk I/O Space in Linux Cluster Systems (리눅스 클러스터 시스템에서 단일 디스크 입출력 공간을 지원하는 효율적 디스크 공유 기법)

  • 김태호;이종우;이재원;김성동;채진석
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.9 no.6
    • /
    • pp.635-645
    • /
    • 2003
  • One of very important features that are necessarily supported by clustered parallel computer systems is a single I/O system image in which users can access both the local and remote I/O resources transparently. In this paper, we propose an efficient disk sharing technique supporting a single disk I/O system image architecture. The design separates the I/O subsystem of a cluster into the file system and a set of virtual hard disk drivers. The virtual hard disk driver deals with a hard disk in the remote node as a local hard disk. All services provided by it are performed in the device driver level without any modification of file systems. Users can, therefore, access all the disks in the cluster regardless of their locations. Our virtual hard disk driver is implemented under the linux, and also tested in a linux cluster system. We find by experiments that it can successfully support a single disk I/O space, and at the same time it shows better performance than NFS. We are sure that this paper can be a guideline for single I/O space of other devices to be easily constructed.

A Study on Virtual Source-based Differentiated Multicast Routing and Wavelength Assignment Algorithms in the Next Generation Optical Internet based on DWDM Technology (DWDM 기반 차세대 광 인터넷 망에서 VS기반의 차등화된 멀티캐스트 라우팅 및 파장할당 알고리즘 연구)

  • Kim, Sung-Un;Park, Seon-Yeong
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.5
    • /
    • pp.658-668
    • /
    • 2011
  • Over the past decade, the improvement of communications technologies and the rapid spread of www (World Wide Web) have brought on the exponential growth of users using Internet and real time multimedia multicast services like video conferencing, tele-immersive virtual reality, and Internet games. The dense-wavelength division multiplexing (DWDM) networks have been widely accepted as a promising approach to meet the ever-increasing bandwidth demands of Internet users, especially in next generation Internet backbone networks for nation-wide or global coverage. A major challenge in the next generation Internet backbone networks based on DWDM technologies is the resolution of the multicasting RWA (Routing and Wavelength Assignment) problem; given a set of wavelengths in the DWDM network, we set up light-paths by routing and assigning a wavelength for each connection so that the multicast connections are set-upped as many as possible. Finding such optimal multicast connections has been proven to be Non-deterministic Polynomial-time-complete. In this paper, we suggest a new heuristic multicast routing and wavelength assignment method for multicast sessions called DVS-PMIPMR (Differentiated Virtual Source-based Priority Minimum Interference Path Multicast Routing algorithm). We measured the performance of the proposed algorithm in terms of number of wavelength and wavelength channel. The simulation results demonstrate that DVS-PMIPMR algorithm is superior to previous multicast routing algorithms.

A Study on The Security Vulnerability Analysis of Open an Automatic Demand Response System (개방형 자동 수요 반응 시스템 보안 취약성 분석에 관한 연구)

  • Chae, Hyeon-Ho;Lee, June-Kyoung;Lee, Kyoung-Hak
    • Journal of Digital Convergence
    • /
    • v.14 no.5
    • /
    • pp.333-339
    • /
    • 2016
  • Technology to optimize and utilize the use and supply of the electric power between consumer and supplier has been on the rise among the smart grid power market network in electric power demand management based on the Internet. Open Automated Demand Response system protocol, which can deliver Demand Response needed in electric power demand management to electricity supplier, system supplier and even the user is openADR 2.0b. This paper used the most credible, cosmopolitanly proliferated EPRI open source and analysed the variety of security vulnerability that developed VEN and VTN system may have. Using the simulator for attacking openADR protocol, the VEN/VTN system that has been implemented as EPRI open source was conducted to attack in a variety of ways. As a result of the analysis, we were able to get the results that the VEN/VTN system has security vulnerabilities to the parameter tampering attacks and service flow falsification attack. In conclusion, if you want to implement the openADR2.0b protocol system in the open or two-way communication environment smart grid network, considering a variety of security vulnerability should be sure to seek security technology and services.

A Study on effective directive technique of 3D animation in Virtual Reality -Focus on Interactive short using 3D Animation making of Unreal Engine- (가상현실에서 효과적인 3차원 영상 연출을 위한 연구 -언리얼 엔진의 영상 제작을 이용한 인터렉티브 쇼트 중심으로-)

  • Lee, Jun-soo
    • Cartoon and Animation Studies
    • /
    • s.47
    • /
    • pp.1-29
    • /
    • 2017
  • 360-degree virtual reality has been a technology that has been available for a long time and has been actively promoted worldwide in recent years due to development of devices such as HMD (Head Mounted Display) and development of hardware for controlling and executing images of virtual reality. The production of the 360 degree VR requires a different mode of production than the traditional video production, and the matters to be considered for the user have begun to appear. Since the virtual reality image is aimed at a platform that requires enthusiasm, presence and interaction, it is necessary to have a suitable cinematography. In VR, users can freely enjoy the world created by the director and have the advantage of being able to concentrate on his interests during playing the image. However, the director had to develope and install the device what the observer could concentrate on the narrative progression and images to be delivered. Among the various methods of transmitting images, the director can use the composition of the short. In this paper, we will study how to effectively apply the technique of directing through the composition of this shot to 360 degrees virtual reality. Currently, there are no killer contents that are still dominant in the world, including inside and outside the country. In this situation, the potential of virtual reality is recognized and various images are produced. So the way of production follows the traditional image production method, and the shot composition is the same. However, in the 360 degree virtual reality, the use of the long take or blocking technique of the conventional third person view point is used as the main production configuration, and the limit of the short configuration is felt. In addition, while the viewer can interactively view the 360-degree screen using the HMD tracking, the configuration of the shot and the connection of the shot are absolutely dependent on the director like the existing cinematography. In this study, I tried to study whether the viewer can freely change the cinematography such as the composition of the shot at a user's desired time using the feature of interaction of the VR image. To do this, 3D animation was created using a game tool called Unreal Engine to construct an interactive image. Using visual scripting of Unreal Engine called blueprint, we create a device that distinguishes the true and false condition of a condition with a trigger node, which makes a variety of shorts. Through this, various direction techniques are developed and related research is expected, and it is expected to help the development of 360 degree VR image.

VPN Traversal Scheme in Hierarchical MIPv4 environment (계층적 이동 IPv4 환경에서 VPN 운영 방안)

  • Sung, Su-Lyun;Kang, Jung-Ho;Shin, Young-Tae
    • The KIPS Transactions:PartC
    • /
    • v.11C no.4
    • /
    • pp.519-526
    • /
    • 2004
  • This paper presents an efficient interoperation scheme of a VPN(Virtual Private Network) and Mobile IP using a hierarchical structure of a FA(Foreign Agent). In the proposed scheme, the GFA(Gateway Foreign Agent) plays a role of VPN gateway on behalf of the MN(Mobile Node). When the MN moves in the same GFA domain, because the GFA has already an IPsec security association with a VPN gateway in the home network of the MN, the MN does not need an IPsec re-negotiaion. In this way, our mechanism reduces a message overhead and a delay resulted from an IPsec negotiation. And a MN can send a data to a correspondent node without a packet leakage. We show a performance of our scheme by using a discrete analytical model. Analytical results demonstrated that the total processing cost calculated by a registration update cost and a packet delivery cost is significantly reduced through our proposed scheme.