• Title/Summary/Keyword: Virtual key

Search Result 495, Processing Time 0.028 seconds

Comparison of Dynamic Characteristics between Virtual Synchronous Machines Adopting Different Active Power Droop Controls

  • Yuan, Chang;Liu, Chang;Zhang, Xueyin;Zhao, Tianyang;Xiao, Xiangning;Tang, Niang
    • Journal of Power Electronics
    • /
    • v.17 no.3
    • /
    • pp.766-776
    • /
    • 2017
  • In modern power systems, high penetration of distributed generators (DGs) results in high stress on system stability. Apart from the intermittent nature of DGs, most DGs do not contribute inertia or damping to systems. As a result, a new control method named virtual synchronous machine (VSM) was proposed, which brought new characteristics to inverters such as synchronous machines (SMs). In addition, different active power droop controls for VSMs are being proposed in literatures. However, they are quite different in terms of their dynamic characteristics despite of the similar control laws. In this paper, mathematical models of a VSM adopting different active power droop controls are built and analyzed. The dynamic performance of the VSM output active power and virtual rotor angular frequency are presented for different models. The influences of the damping factor and droop coefficient on the VSM dynamic behaviors are also investigated in detail. Finally, the theoretical analysis is verified by simulations and experimental results.

Virtual Disassembly

  • Mo, Jianzhong;Zhang, Qiong;Gadh, Rajit
    • International Journal of CAD/CAM
    • /
    • v.2 no.1
    • /
    • pp.29-37
    • /
    • 2002
  • De-manufacturing is an entire process of collecting, disassembling, reusing, refurbishing, recycling, and/or disposing products that are obsolete or un-repairable. Designing the products for inexpensive and efficient disassembly enhances the ease of de-manufacturing. Virtual disassembly addresses the difficulty and the methods to disassemble a product in design stage rather than really disassemble a product at the end of its life cycle. Based on the virtual disassembly analysis results, design will be improved for better assembling/disassembling. This paper presents a systematic virtual disassembly methodology such as disassembly relation modeling, path/sequence automatic generation and evaluation. This paper also presents a new virtual disassembly interface paradigm via virtual reality technology for disassembly simulation in virtual environment.

Enhancing Irregular Repetition Slotted ALOHA with Polarization Diversity in LEO Satellite Networks

  • Su, Jingrui;Ren, Guangliang;Zhao, Bo;Ding, Jian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.9
    • /
    • pp.3907-3923
    • /
    • 2020
  • An enhanced irregular repetition slotted ALOHA (IRSA) protocol is proposed by using polarization characteristic of satellite link and MIMO detection in low earth orbit (LEO) satellite networks, which is dubbed polarized MIMO IRSA (PM-IRSA). In the proposed scheme, one or two packets in one slot can be decoded by employing polarized MIMO detection, and more than two collided packets in multiple slots which can construct the virtual MIMO model can be decoded by the MIMO detection algorithm. The performance of the proposed scheme is analyzed with the density evolution (DE) approach and the degree distribution is optimized to maximize the system throughput by using a differential evolution. Numerical results certify our analysis and show that the normalized throughput of the proposed PM-IRSA can achieve 1.89 bits/symbol.

Design of General -Purpose Bitonic Sorting Algorithms with a Fixed Number of Processors for Shared-Memory Parallel Computers (공유 메모리 병렬 컴퓨터 환경에서 한정된 수의 프로세서를 사용한 범용 Bitonic sorting 알고리즘의 설계)

  • Lee, Jae-Dong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.1
    • /
    • pp.33-42
    • /
    • 1999
  • 지금까지의 bitonic sorting 에 대한 연구는 N 개의 key를 정렬하기 위해서는 N/2(or N)개의 프로세서가 필요하였다. 여기서는 프로세서의 수가 정렬하고자 하는 key 수에 독립적이고 또한 N/2개 이하인 경우를 고려하였다. 따라서 본 연구에서는 공유 메모리 병렬 컴퓨터 환경에서 N 개의 Key를 고정도니 수의 프로세서를 사용하여 O(log2N) 시간에 정렬 할 수 있는 두 종류의 범용 bitonic sorting 알고리즘을 구현하였다. 첫째로, VITURAL-GPBS 알고리즘은 하나의 프로세서를 사용하여 여러 개의 프로세서가 하는 역할을 모방하므로써 정렬을 수행하도록 하였다. 둘째로, VIRTUAL-GPBS 알고리즘보다 좀 더 효율적이고 빠른 FAST-GPBS 알고리즘을 소개하였다. 두 알고리즘의 주요 차이점은 FAST-GPBS 알고리즘에서는 각각의 프로세서에 배정된 여러 개의 key를 각 프로세서 내에서 가장 빠른 순차 정렬 알고리즘을 사용하면서 먼저 지역적으로 정렬을 함으로써 VIRTUAL-GPBS 보다 효율이 50% 이상 향상된 정렬을 수행할 수 있도록 하였다. FAST-GPBS 알고리즘은 compare-exchange 대신 merge-split 작업을 함으로써 컴퓨터의 사용 효율을 향상시킬 수 있다.

A Study on OpenFlow based Virtual Network Platform for KREONET (OpenFlow 기반 KREONET 가상 네트워크 플랫폼 연구)

  • Seok, Seung-Joon;Jeong, Hyeonuk
    • Journal of Digital Convergence
    • /
    • v.12 no.8
    • /
    • pp.309-319
    • /
    • 2014
  • Virtual Network service is a key characteristics of future Internet which is debate internationally. There are two kinds of network virtualization technologies considered lately: network functions virtualization and virtual network approaches. Several national wide research networks including US's GENI project have experimented technologies for future Internet and in particular network virtualization is one of key issues. Representative Korean research network, KREONET, is working on deploying virtual network framework as a preliminary for future Ineternet using the virtualization model of SDN/OpenFlow which is typical network model of future Internet. This paper proposes a stepwise model to bring virtual network services in KREONET. Firstly, we requirements of KREONET users' virtual network service and network resource management and network deploying virtual network. Finally, we verify the adequacy of our virtual network model for KREONET.

Optimal Price Strategy Selection for MVNOs in Spectrum Sharing: An Evolutionary Game Approach

  • Zhao, Shasha;Zhu, Qi;Zhu, Hongbo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.12
    • /
    • pp.3133-3151
    • /
    • 2012
  • The optimal price strategy selection of two bounded rational cognitive mobile virtual network operators (MVNOs) in a duopoly spectrum sharing market is investigated. The bounded rational operators dynamically compete to sell the leased spectrum to secondary users in order to maximize their profits. Meanwhile, the secondary users' heterogeneous preferences to rate and price are taken into consideration. The evolutionary game theory (EGT) is employed to model the dynamic price strategy selection of the MVNOs taking into account the response of the secondary users. The behavior dynamics and the evolutionary stable strategy (ESS) of the operators are derived via replicated dynamics. Furthermore, a reward and punishment mechanism is developed to optimize the performance of the operators. Numerical results show that the proposed evolutionary algorithm is convergent to the ESS, and the incentive mechanism increases the profits of the operators. It may provide some insight about the optimal price strategy selection for MVNOs in the next generation cognitive wireless networks.

Analysis of the IPsec Internet Key Exchange (IKE) Protocol (IPsec의 키 교환 방식에 대한 안전성 분석)

  • 주한규
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.10 no.4
    • /
    • pp.33-46
    • /
    • 2000
  • IPsec is a protocol suite to protect the data communication between computers on internet and many VPNs(Virtual Private Networks) use IPsec protocol. IKE protocol is used to exchange keys in IPsec. Formal analysis method is used increasingly in computer science to increase the reliability of a system. In this paper, the IKE protocol is analyzed formally. This paper shows that IKE with Authentication with Signature and Authentication with Pre-Shared Key is safe, but Authentication with Public Key Encryption and A Revised Method of Authentication with Public Key Encryption are safe only with the assumption that a participant has the correct public key of the correspondent. To make sure that a participant has the correct public key of the correspondent, the usage of certificate is recommended.

Timer-based Credit Scheduler for Supporting Low Latency Task (짧은 지연 시간 태스크를 지원하는 타이머 기반 크레딧 스케줄러)

  • Kim, Byung-Ki;Ko, Young-Woong
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.7 no.4
    • /
    • pp.193-199
    • /
    • 2012
  • Virtualization allows multiple commodity operating systems to share on a single physical machine. Resource allocation among virtual machines is a key to determine virtual machine performance. To satisfy time-sensitive task on a domain, hypervisor needs to observe the resource requirements and allocates proper amount of CPU resources in a timely manner. In this paper, we propose a realtime credit scheduler for latency sensitive application on virtual machines. The key idea is to register a time event in the Xen hypervisor. Experiment result shows that the proposed scheme is superior to Credit scheduler.

Method for network divided subscriber's facilities (망 분리 가입자 부가 서비스 제공 방법)

  • Yoon, Tae-Ho
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.11 no.1
    • /
    • pp.37-44
    • /
    • 2016
  • In this paper, to provide a method for providing a network separation subscriber's facilities. How to provide this subscriber's facilities include phase generating authorization key in server, saving activation file in portable data medium included server's authorization key, executing saved activation file in client's portable storage and providing virtual machine by result client's execute file. In case of moving work, the virtual subscriver's facility can provide for a business traveler.

A study on Web-based Video Panoramic Virtual Reality for Hose Cyber Shell Museum (비디오 파노라마 가상현실을 기반으로 하는 호서 사이버 패류 박물관의 연구)

  • Hong, Sung-Soo;khan, Irfan;Kim, Chang-ki
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.11a
    • /
    • pp.1468-1471
    • /
    • 2012
  • It is always a dream to recreate the experience of a particular place, the Panorama Virtual Reality has been interpreted as a kind of technology to create virtual environments and the ability to maneuver angle for and select the path of view in a dynamic scene. In this paper we examined an efficient algorithm for Image registration and stitching of captured imaged from a video stream. Two approaches are studied in this paper. First, dynamic programming is used to spot the ideal key points, match these points to merge adjacent images together, later image blending is use for smooth color transitions. In second approach, FAST and SURF detection are used to find distinct features in the images and a nearest neighbor algorithm is used to match corresponding features, estimate homography with matched key points using RANSAC. The paper also covers the automatically choosing (recognizing, comparing) images to stitching method.