• 전력전자학회논문지
• /
• 제21권6호
• /
• pp.465-472
• /
• 2016

A nonlinear load causes harmonic distortion and hampers the performance of other loads or distributed generation (DG) sources connected to the point of common coupling (PCC). This study proposes a new control strategy to reduce harmonic components, such as fifth and seventh harmonics, at the PCC under nonlinear loads in islanded microgrids, which comprise more than two DG sources. The proposed control scheme enables the DG source to share the power commanded by the control center as well as to compensate for the voltage harmonics at the PCC. The reference current is estimated from the voltage harmonics and injecting power; thus, the control scheme is implemented without any additional hardware devices. The simulation and experimental results are presented to verify the effectiveness of the proposed control method.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
• /
• pp.144-151
• /
• 2002

Future wireless communication systems are expected to provide a broad range of multimedia services in which the asymmetry of traffic load between uplink and downlink is a significant feature. The rode division multiple access system with tune division duplex mode (CDMA/TDD) is a good solution to cope with the traffic asymmetry problem. However. the TDD system is subject to inter-cell interference compared to frequency division duplex (FDD) system. Since both uplink and downlink share the same frequency in TDD. uplink and downlink may interfere each other especially when neighboring cells require different rates of asymmetry. Thus, time slot allocation for tells is an important issue in TDD. In this paper. we propose a genetic algorithm based time slot allocation scheme which maximizes the residual system capacity. The proposed scheme allows that each cell employ different level of uplink/downlink asymmetry and satisfies the interference requirement.

• 한국시뮬레이션학회논문지
• /
• 제9권2호
• /
• pp.1-14
• /
• 2000

Recently, as construction of information infra including high-speed communication networks remarkably expands, more various information services have been provided. Thus the number of internet users rapidly increases, and it results in heavy load on Web server and higher traffics on networks. The phenomena cause longer response time that means worse quality of service. To solve such problems, much effort has been attempted to loosen bottleneck on Web server, reduce traffic on networks and shorten response times by caching informations being accessed more frequently at the proxy server that is located near to clients. And it is also possible to improve internet performance further by allowing clients to share informations stored in proxy caches. In this paper, we perform simulations of hierarchical proxy caches with the 3-level 4-ary tree structure by using real web traces, and analyze cache hit ratio for various cache replacement policies and cache sizes when the delayed-store scheme is applied. According to simulation results, the delayed-store scheme increases the remote cache hit ratio, that improves quality of service by shortening the service response time.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -3
• /
• pp.1752-1755
• /
• 2002

The world wide web (WWW) already accounts f3r more Internee network traffic than any other application, including il and simple file transfer. It is also a collaborative technology in a weak sense of the word - it allows people to share information. Synchronous collaboration is where an interactive activity is simultaneous and in teal-time. Computer based real time collaborative systems like shared whiteboards. collaborative editor etc. are only beginning to emerge recently. These applications invoking more than two users exchanging information, require Multicast communication. Multicast communication is a transmission mode that is now supported by a variety of local and wide area networks. Multicasting enables multiparty communication across a wide area to sparsely distributed groups by minimizing the network load. Multicasting itself is one of the key technologies in the nut generation of the Internet This paper describes the technical issues from the aspect of multicast communication and its reliability in synchronous collaborative application.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -3
• /
• pp.1839-1842
• /
• 2002

Ad hoc networks are characterized by multi- hop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. In this paper, we proposed a new technique to adjust the zone radius by concentrating the changes of network traffic in a particular direction, which we refer to as AZRP. We demonstrate that even though ZRP and AZRP share a similar hybrid routing behavior, the differences in the protocol mechanics can lead to significant performance differentials. We discuss the algorithm and report on the performance of AZRP scheme, and compare it to the ZRP routing protocol. Our results indicate clearly that AZRP outperforms ZRP by reducing significantly the number of route query messages. And thereby increases the efficiency of the network load.

• Journal of information and communication convergence engineering
• /
• 제13권1호
• /
• pp.27-35
• /
• 2015

Multiprecision multiplication is the most expensive operation in public key-based cryptography. Therefore, many multiplication methods have been studied intensively for several decades. In Workshop on Cryptographic Hardware and Embedded Systems 2011 (CHES2011), a novel multiplication method called 'operand caching' was proposed. This method reduces the number of required load instructions by caching the operands. However, it does not provide full operand caching when changing the row of partial products. To overcome this problem, a novel method, that is, 'consecutive operand caching' was proposed in Workshop on Information Security Applications 2012 (WISA2012). It divides a multiplication structure into partial products and reconstructs them to share common operands between previous and next partial products. However, there is still room for improvement; therefore, we propose a finely designed operand-caching mode to minimize useless memory accesses when the first row is changed. Finally, we reduce the number of memory access instructions and boost the speed of the overall multiprecision multiplication for public key cryptography.

• 산업공학
• /
• 제10권3호
• /
• pp.55-62
• /
• 1997

Among the driving methods of CALS, Electronic Data Interchange (EDI), the pivot of procurement and logistics, is becoming the standard of data interchange. In this article, we examine the standard, growth, and status of EDI, and present a scheme to make it available via Internet that grow to be a standardized network, in comparison with a method to use a Value Added Network(VAN). So we studied an implementation of EDI system to exchange and process the business intra-works in order to integrate it into Intranet environment. As well, we present a client/server model running under Intranet environment, and a system with a format server to share the load of server and client. To do this, we list the functions and requirements of EDI system, connect a database to the Intranet, and develop applications using $Java^{TM}$.

• KDI Journal of Economic Policy
• /
• 제41권2호
• /
• pp.59-79
• /
• 2019

This study analyzes whether mutual fund distributors are more likely to recommend products with higher sales compensation to maximize their profit. The lists of the 'fund of the month' on their webpages are utilized from April of 2015 to August of 2015. A simple comparative analysis shows that the average sales fees and the average front-end load are significantly higher in the recommended funds among the A share class of domestic equity funds. The results of a regression analysis confirm that funds with high sales compensation levels are more likely to be recommended. This holds true for both domestic equity funds and hybrid bond funds even after controlling for fund age, fund size, and past returns.

• 에너지공학
• /
• 제29권3호
• /
• pp.64-73
• /
• 2020

본 논문은 전기 자동차의 충·방전 장소를 고려한 도시별 일부하 곡선 산출을 위한 방법론을 제시하였다. 즉, 특정 도시에서 전기 자동차 충·방전에 의해 발생되는 부하량이 전력 그리드에 미치는 영향을 용이하게 파악할 수 있도록 전기 자동차의 충·방전 장소를 고려한 도시별 일부하 곡선 산출 알고리즘을 제시하였다. 구체적으로는 PEVs 점유율 시나리오에 따라 도시내의 전기차 충·방전 장소별 즉, 직장 및 가정에 대하여 오전에 직장에 도착한 전기차에 대해 그리드에 방전을 그리고 오후에 가정에 도착한 전기차에 대해 충전을 시행하는 가정을 수립한 후 오전 직장 도착 차량운행 특성과 SMP 요금제를 동시에 반영한 PEVs 방전 전력을 산정하였다. 그리고 오후에 가정 도착 차량운행 특성과 TOU 요금제를 동시에 고려한 PEVs충전 전략에 대해 각각 서울시를 대상으로 충·방전 전력 형태별로 일부하곡선을 산출한 후 기존 부하와 합산하여 그리드에 미치는 영향 평가를 비교 분석하였다.

• 한국정보과학회논문지:데이타베이스
• /
• 제30권6호
• /
• pp.629-640
• /
• 2003

공유 디스크(Shared Disks: SD) 클러스터는 온라인 트랜잭션 처리를 위해 다수 개의 컴퓨터를 연동하는 방식으로, 각 노드들은 디스크 계층에서 데이타베이스를 공유한다. SD 클러스터에서 트랜잭션 라우팅은 사용자가 요청한 트랜잭션을 실행할 노드를 결정하는 것을 의미한다. 이때, 동일한 클래스에 속하는 트랜잭션들을 가급적 동일한 노드에서 실행시킴으로써 지역 참조성을 극대화할 수 있으며, 이를 친화도 기반 라우팅이라 한다. 그러나 친화도 기반 라우팅은 트랜잭션 클래스의 부하 변화에 적절히 대처할 수 없으며, 특정 트랜잭션 클래스가 폭주할 경우 해당 노드는 과부하 상태에 빠질 수 있다는 단점을 갖는다. 본 논문에서는 친화도 기반 라우팅을 지원하면서 SD 클러스터를 구성하는 노드들의 부하를 동적으로 분산할 수 있는 동적 트랜잭션 라우팅 기법을 제안한다. 제안한 기법은 지역 버퍼에 대한 참조 지역성을 높이고 버퍼 무효화 오버헤드를 줄임으로써 시스템의 성능을 향상시킬 수 있다.