• ETRI Journal
• /
• v.32 no.6
• /
• pp.940-949
• /
• 2010

Rack-level DC power supply is the optimal technology for providing DC power to a volume server without any power infrastructure changes in an existing AC data center. In this paper, we propose a smartly controllable and monitorable DC rack power system. The proposed system improves power efficiency by changing the power distribution architecture of a conventional method in the rack. We developed an optimal power control method in multipower modules to provide high efficiency at low loads. In addition, the proposed system provides real-time web monitoring of the rack power and environment around a rack. In our experiments, the proposed system improved the power efficiency by over 10% compared to an AC power system providing N+1 redundant power and power monitoring.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2335-2339
• /
• 2003

To prevent the critical situation due to the fault in the aircraft sensor system, the fault tolerant system with triple or quadruple redundancy can be made. However, if the faults are occurred in two or more than sensors simultaneously, the conventional fault detection process, such as cross-channel monitoring, may give the wrong fault alarm. For this case, we can detect the fault by estimating the state vector based on the system dynamics model, which is nonlinear for aircraft. In this paper, we propose the unscented Kalman filter to estimate the nonlinear state vector. This filter utilizes the so-called unscented transformation of sigma points featured the statistical characteristics of the random variable. For verification, we perform the simulations for F-16 aircraft with accelerometers, gyros, GPS and air data system.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.389-392
• /
• 2000

Electronics and Telecommunications Research Institute (ETRI) developed the Ka-band satellite communications payload. This system is able to provide a high data rate communication service with a bandwidth of 200 MHz, a wideband digital flunking services up to 155 Mbps and asymmetrical internet multimedia service. The system employs the common receive/transmit antenna and the 2-for-1 redundant scheme for the LNA-Downconverters. The different types of high power amplification, TWTA for one chain and SSPA for the other chain, are used lot the variety of experimental options. For the reliable test of the payload, EGSE was also developed. The parametric RF tests were carried out in order to measure the performance of Ka-band communication subsystem, in most case the results of RF performance test complied the payload requirement.

• Proceedings of the IEEK Conference
• /
• 2003.07d
• /
• pp.1359-1362
• /
• 2003

The intrusions appears continuously by new unknown attacks exploiting vulnerabilities of systems or components but there are no perfect solutions to protect this unknown attacks. To overcome this problem, in this paper, we have proposed and implemented a Web service intrusion tolerant system that provides continuous Web services to the end users transparently even after the occurrence of an attack against the Web services, and prevents the disclosure of system's configuration data from server Our system has an N+l node architecture which is to minimize the number of redundant server nodes and to tolerate the intrusion effectively, and it also supports diversity in its design. Experimental result obtained on an implemented system show that our system can cope with intrusion such as DoS, file modification, confidentiality compromise of system properly.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.13 no.1
• /
• pp.73-82
• /
• 2013

In pattern classification, feature selection is an important factor in the performance of classifiers. In particular, when classifying a large number of features or variables, the accuracy and computational time of the classifier can be improved by using the relevant feature subset to remove the irrelevant, redundant, or noisy data. The proposed method consists of two parts: a wrapper part with an improved genetic algorithm(GA) using a new reproduction method and a filter part using mutual information. We also considered feature selection methods based on mutual information(MI) to improve computational complexity. Experimental results show that this method can achieve better performance in pattern recognition problems than other conventional solutions.

• Journal of the Korean Society of Industry Convergence
• /
• v.6 no.1
• /
• pp.37-42
• /
• 2003

In this paper a self-organizing fuzzy system with rule pruning is proposed. A conventional self-organizing fuzzy system having only rule generation has a drawback in generating many slightly different rules from the existing rules which results in increased computation time and slowly learning. The proposed self-organizing fuzzy system generates fuzzy rules based on input-output data and prunes redundant rules which are caused by parameter training. The proposed system has a simple structure but performs almost equivalent function to the conventional self-organizing fuzzy system. Also, this system has better learning speed than the conventional system. Simulation results on several numerical examples demonstrate the performance of the proposed system.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.183-187
• /
• 2005

In this paper, we propose a heuristic method to select features using a Two-Phase Markov Blanket-based (TPMB) algorithm. The first phase, filtering phase, of TPMB algorithm works by filtering the obviously redundant features. A non-linear correlation method based on Information theory is used as a metric to measure the redundancy of a feature [1]. In second phase, approximating phase, the Markov Blanket (MB) of a system is estimated by employing the concept of cross entropy to identify the MB. We perform experiments on microarray data and report two popular dataset, AML-ALL [3] and colon tumor [4], in this paper. The experimental results show that the TPMB algorithm can significantly reduce the number of features while maintaining the accuracy of the classifiers.

• Journal of Korea Multimedia Society
• /
• v.21 no.10
• /
• pp.1131-1141
• /
• 2018

Motion Estimation which is used to reduce the redundant data plays an important role in video compressions. However, it requires huge computational complexity of the encoder part. And therefore many fast motion estimation methods has been developed to reduce complexity. Multi-view video is obtained by using many cameras at different positions and its complexity increases in proportion to the number of cameras. In this paper, we proposed a fast motion estimation method for multi-view video. The proposed method predicts a search start point by using correlated candidate vectors of the current block. According to the motion size of the start search point, a search start pattern of the current block is decided adaptively. The proposed method proves to be about 2 ~ 5 times faster than existing methods while maintaining similar image quality and bitrates.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.04a
• /
• pp.816-819
• /
• 2017

Current graph mining algorithms suffers from performance issues when querying patterns are in increasingly massive network graphs. However, from our observation most data graphs inherently contains recurring semantic subgraphs/substructures. Most graph mining algorithms treat them as independent subgraphs and perform computations on them redundantly, which result in performance degradation when processing massive graphs. In this paper, we propose an algorithm which exploits these inherent recurring subgraphs/substructures to reduce graph sizes so that redundant computations performed by the traditional graph mining algorithms are reduced. Experimental results show that our graph compression approach achieve up to 69% reduction in graph sizes over the real datasets. Moreover, required time to construct the compressed graphs is also reasonably reduced.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.467-469
• /
• 2006

In wireless network environments, as users' demands on high-speed data communications due to increase of multi-media services, the necessity of new high-speed WLAN technologies has appeared. Nowaday, IEEE is standardizing a new WLAN protocol caned as IEEE 802.11n. To effectively use wireless resources, IEEE 802.11n introduces MAC aggregation function which is similar to that in IEEE 802.11e. In case of transmitting several frames without MAC aggregation, the frames include individual frame header and trailer, and their corresponding acknowledgement frames can appear on wireless link. However, if they are aggregated into single MAC frame, we can reduce the number of used bits due to frame headers/trailers and also remove redundant acknowledgement frames. In this paper, we explain two different MAC frame aggregation methods for IEEE 802.11e and IEEE 802.11n and evaluate their throughput by simulations.