• The Transactions of the Korean Institute of Power Electronics
• /
• v.21 no.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.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• 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.

• Journal of the Korea Society for Simulation
• /
• v.9 no.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.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• 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.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• 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
• /
• v.13 no.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.

• IE interfaces
• /
• v.10 no.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
• /
• v.41 no.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.

• Journal of Energy Engineering
• /
• v.29 no.3
• /
• pp.64-73
• /
• 2020

This paper presented a methodology for calculating daily load curves per city by taking into account the charging/discharging location of electric vehicle. In other words, this is the daily load curve calculation algorithm by city, which takes into account the charging/discharging location of electric vehicles, so that the impact of loads generated by charging/discharging of electric vehicles on the power grid can be easily understood in certain cities. Specifically, in accordance with the PEVs share scenario, the PEVs discharge power was calculated to reflect both the characteristics of the arriving vehicle in the morning and the SMP plan after establishing a assumption that the electric vehicle arrived at work in the morning and the electric vehicle arrived at home in the afternoon for each of the charging/discharging locations, that is, work and home, of electric vehicles in the city. After calculating the daily load curve for each charging/discharging power type for the PEVs charging strategy, which takes into account both the characteristics of the vehicle arriving at home in the afternoon and the TOU fare system, it was analyzed by comparing the impact assessment on the grid by adding the existing load.

• Journal of KIISE:Databases
• /
• v.30 no.6
• /
• pp.629-640
• /
• 2003

A shared disk (SD) cluster couples multiple nodes for high performance transaction processing, and all the coupled nodes share a common database at the disk level. In the SD cluster, a transaction routing corresponds to select a node for an incoming transaction to be executed. An affinity-based routing can increase local buffer hit ratio of each node by clustering transactions referencing similar data to be executed on the same node. However, the affinity-based routing is very much non-adaptive to the changes in the system load, and thus a specific node will be overloaded if transactions in some class are congested. In this paper, we propose a dynamic transaction routing scheme that can achieve an optimal balance between affinity-based routing and dynamic load balancing of all the nodes in the SD cluster. The proposed scheme is novel in the sense that it can improve the system performance by increasing the local buffer hit ratio and reducing the buffer invalidation overhead.