• Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
• /
• 2009.05a
• /
• pp.408-411
• /
• 2009

In this paper, conventional PI, fuzzy neural network(FNN) and adaptive teaming mechanism(ALM)-FNN for rotor field oriented controlled(RFOC) induction motor are studied comparatively. The widely used control theory based design of PI family controllers fails to perform satisfactorily under parameter variation nonlinear or load disturbance. In high performance applications, it is useful to automatically extract the complex relation that represent the drive behaviour. The use of learning through example algorithms can be a powerful tool for automatic modelling variable speed drives. They can automatically extract a functional relationship representative of the drive behavior. These methods present some advantages over the classical ones since they do not rely on the precise knowledge of mathematical models and parameters. Comparative study of PI, FNN and ALM-FNN are carried out from various aspects which is dynamic performance, steady-state accuracy, parameter robustness and complementation etc. To have a clear view of the three techniques, a RFOC system based on a three level neutral point clamped inverter-fed induction motor drive is established in this paper. Each of the three control technique: PI, FNN and ALM-FNN, are used in the outer loops for rotor speed. The merit and drawbacks of each method are summarized in the conclusion part, which may a guideline for industry application.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.140-141
• /
• 2017

Big data analysis, in the large amount of data stored as the data warehouse which it refers the process of discovering meaningful new correlations, patterns, trends and creating new values. Thus, Big data analysis is an effective analysis of various big data that exist all over the world such as social big data, machine to machine (M2M) sensor data, and corporate customer relationship management data. In the big data era, it has become more important to effectively analyze not only structured data that is well organized in the database, but also unstructured big data such as the internet, social network services, and explosively generated web documents, e-mails, and social data in mobile environments. By the way, a meta analysis refers to a statistical literature synthesis method from the quantitative results of many known empirical studies. We reviewed a total of 750 samples among 50 studies published on the topic related as IDT between 2000 and 2017 in Korea.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.11
• /
• pp.635-642
• /
• 2004

The traditional communication protocols such as TCP/IP are not suitable for PC cluster systems because of their high software processing overhead. To eliminate this overhead, industry leaders have defined the Virtual Interface Architecture (VIA). VIA provides two different data transfer mechanisms, a traditional Send/Receive model and the Remote Direct Memory Access (RDMA) model. RDMA is extremely efficient way to reduce software overhead because it can bypass the OS and use the network interface controller (NIC) directly for communication, also bypass the CPU on the remote host. In this paper, we have implemented VIA-based RDMA mechanism in hardware. Compared to the traditional Send/Receive model, the RDMA mechanism improves latency and bandwidth. Our RDMA mechanism can also communicate without using remote CPU cycles. Our experimental results show a minimum latency of 12.5${\mu}\textrm{s}$ and a maximum bandwidth of 95.5MB/s. As a result, our RDMA mechanism allows PC cluster systems to have a high performance communication method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.223-231
• /
• 2003

Video-on-Demand (VOD) service needs high resource consumption because of high bandwidth and long playback duration which are characteristics of multimedia. Various techniques such as Patching and Channel-Reserving Patching have been proposed to reduce the demand on the network-I/O bandwidth. Patching allows new clients to join an existing multicast for realization of true VOD, and Channel-Reserving Patching reserves the part of total channel capacity of video server in order to serve the requests for popular videos on which requests of users concentrate. To improve the performance of Channel-Reserving Patching, we propose the method that determines the reserved channel capacity of video server for the popular videos in this paper. The performance of our method is evaluated in terms of average servile latency, defection ratio and fairness through simulation, and is compared with those of Patching and another Channel-Reserving Patching.

• Journal of KIISE:Software and Applications
• /
• v.34 no.11
• /
• pp.971-983
• /
• 2007

Cellular Genetic Algorithms(CGAs) are a subclass of Genetic Algorithms(GAs) in which each individuals are placed in a given geographical distribution. In general, CGAs# population space is a regular network that has relatively long characteristic path length and high clustering coefficient in the view of the Networks Theory. Long average path length makes the genetic interaction of remote nodes slow. If we have the population#s path length shorter with keeping the high clustering coefficient value, CGAs# population space will converge faster without loss of diversity. In this paper, we propose Smallest-Small-World Cellular Genetic Algorithms(SSWCGAs). In SSWCGAs, each individual lives in a population space that is highly clustered but having shorter characteristic path length, so that the SSWCGAs promote exploration of the search space with no loss of exploitation tendency that comes from being clustered. Some experiments along with four real variable functions and two GA-hard problems show that the SSWCGAs are more effective than SGAs and CGAs.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.10
• /
• pp.1225-1236
• /
• 1999

기존의 오류 제어 방법들은 실시간 특성과 신축적인 신뢰성을 가지는 멀티미디어 통신 응용의 특징을 충분히 반영하지 못하고 있다. 본 연구는 기존의 재전송을 기반으로 하는 방법에 두 가지 기법을 추가하여 이 문제에 접근하였다. 첫째, 실시간 데이타의 마감 시간을 고려하여 미리 재전송을 실시하는 사전 재전송과 시간적으로 불가능하다고 판단될 때 복구를 포기하는 재전송 포기를 통한 적시 재전송 기법이다. 둘째, 요구되는 신뢰성에 근접하도록 오류가 많이 발생하였을 때만 재전송을 하는 선택적 오류 제어 기법이다. 본 연구는 두 기법을 적용한 오류 제어 프로토콜을 구현하고 네트워크 환경을 바꾸어 가며 성능을 검사하였다. 실험 결과, 제안된 오류 제어 방법은 전체적인 오류 제어 부하는 감소시키면서 오류 복구율을 높인다는 점을 확인하였다.Abstract The current error control schemes do not fit well to the characteristics of multimedia communications: real-time transmission and flexible reliability requirements. This research proposes a new error control scheme, which extends the retransmission-based error control with the following two mechanisms. First, error recovery is performed in two timely fashions: one is retransmission in advance where a retransmission is performed early enough for the deadline if an error is suspected, and the other is retransmission abort where a retransmission is given up if its recovery within the deadline seems to be impossible. Second, error control is selectively performed only when an actual error rate approaches to the threshold on a given reliability requirement. The proposed scheme has been implemented and experimented in various network environments. The performance results show that it has lower control overhead and higher error recovery than the existing schemes.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.7_8
• /
• pp.352-358
• /
• 2003

A cluster of servers is the most promising solution to provide highly scalable and highly available network services with low implementation cost. One of popular solutions is using dispatcher as a request distributor. However this solution has the problem that is can be the bottleneck or single-point of failure point of itself. ONE-IP, the previous work, solves this serious problem by using broadcast message for distributing the request packet in LAN. Using simple scheduling technique, in addition, the overhead due to dispatching the request becomes minimal. However, as ONE-IP using very simple static scheduling algorithm, it would spread the request among servers unevenly and downgrades the cluster performance consequently. In this paper, we propose an improved TCP connection scheduling technique solving this unbalanced distributing problem. Using Round-Robin(RR) scheduling instead of hashing clients IP address, proposed technique can more evenly distribute incoming service requests among the servers. Experiments show average 3.8% improved performance in throughput compared to original ONE-IP technique.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.7_8
• /
• pp.359-369
• /
• 2003

We present efficient generalized algorithms for all-to-all personalized communication operations in a 2D torus. All-to-all personalized communication, or complete exchange, is at the heart of numerous applications, such as matrix transposition, Fast Fourier Transform(FFT), and distributed table lookup. Some algorithms have been Presented when the number of nodes is power-of-2 or multiple-of-four form, but there has been no result for general cases yet. We first present complete exchange algorithm called multiple-Hop-2D when the number of nodes is in the form of multiple-of-two. Then by extending this algorithm, we present two algorithms for an arbitrary number of nodes. Split-and-Merge algorithm first splits the whole network into zones. After each zone performs complete exchange, merge is applied to finish the desired complete exchange. By handling extra steps in Double-Hop-2D algorithm, Modified Double-Hop-2D algorithm performs complete exchange operation for general cases. Finally, we compare the required start-up time for these algorithms.

• The KIPS Transactions:PartB
• /
• v.9B no.5
• /
• pp.635-642
• /
• 2002

There is a rapidly growing demand for the intellectualization of information technology. Especially, in the area of KDD (Knowledge Discovery in Database) which should make an optimal decision of finding knowledge from a large amount of data, the demand is enormous. A large volume of Knowledge Base should be efficiently managed for a more intellectual choice. This study is proposing a Hybrid SOM for an efficient search and renewal of knowledge base, which combines a self-study nerve network, Self-Organization Map with a probable distribution theory in order to get knowledge needed for decision-making management from the Knowledge Base. The efficient knowledge base management through this proposed method is carried out by a stimulation test. This test confirmed that the proposed Hybrid SOM can manage with efficiency Knowledge Base.

• Journal of the Korean Institute of Gas
• /
• v.11 no.2 s.35
• /
• pp.71-77
• /
• 2007

This research proposes the U-drawing information system (U-DIS) based on risk assessment. One of the most outstanding features of U-DIS is to perform the Quantitative Risk Assessment directly on the screen utilizing the Process Information. U-DIS revolutionizes the existing way to do a risk assessment and helps finding information more efficiently and simply. It is designed to open all CAD drawing files on the web-based environment without having the CAD S/W installed on the PC. The U terminal platform in U-DIS supports IPv6 and wireless broadband network and U-DIS can be accessible through a sensor or personal authorization. This results in providing a systematic safety enhancement tool considering not only the operation of the process but also its risk level in the equipment industry. Additionally to aid the decision making process it offers comprehensive and thorough information based on engineering technical theory.