• Journal of Information Technology Services
• /
• v.12 no.2
• /
• pp.257-268
• /
• 2013

Query processing on streamed XML fragments is one of key issues in XML databases. In this paper, XFSeed (XML Fragment Processor with Seed label) is proposed to provide effective query processing by removing many redundant path evaluations and minimizing the number of fragments processed. The conducted experimental results reveal that the proposed scheme efficiently handles query processing and reduces memory usage.

• Journal of Advanced Marine Engineering and Technology
• /
• v.40 no.5
• /
• pp.437-446
• /
• 2016

Feature selection has become an essential technique to reduce the dimensionality of data sets. Many features are frequently irrelevant or redundant for the classification tasks. The purpose of feature selection is to select relevant features and remove irrelevant and redundant features. Applications of the feature selection range from text processing, face recognition, bioinformatics, speaker verification, and medical diagnosis to financial domains. In this study, we focus on filter methods based on information entropy : IG (Information Gain), FCBF (Fast Correlation Based Filter), and mRMR (minimum Redundancy Maximum Relevance). FCBF has the advantage of reducing computational burden by eliminating the redundant features that satisfy the condition of approximate Markov blanket. However, FCBF considers only the relevance between the feature and the class in order to select the best features, thus failing to take into consideration the interaction between features. In this paper, we propose an improved FCBF to overcome this shortcoming. We also perform a comparative study to evaluate the performance of the proposed method.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.2
• /
• pp.63-68
• /
• 2018

Interests in face recognition area have been increasing due to diverse emerging applications. Face recognition algorithm from a two-dimensional source could be challenging in dealing with some circumstances such as face orientation, illuminance degree, face details such as with/without glasses and various expressions, like, smiling or crying. Hopfield Network capabilities have been used specially within the areas of recalling patterns, generalizations, familiarity recognitions and error corrections. Based on those abilities, a specific experimentation is conducted in this paper to apply the Redundant Parallel Hopfield Network on a face recognition problem. This new design has been experimentally confirmed and tested to be robust in any kind of practical situations.

• The KIPS Transactions:PartD
• /
• v.14D no.2
• /
• pp.217-224
• /
• 2007

In order to determine the value and type statically. CTOC uses the SSA Form which separates the variable according to assignment. The SSA Form is widely being used as the intermediate expression of the compiler for data flow analysis as well as code optimization. However, the conventional SSA Form is more associated with variables rather than expressions. Accordingly, the redundant expressions are eliminated to optimize expressions of the SSA From. This paper defines the partial redundant expression to obtain a more optimized code and also implements the technique for eliminating such expressions.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.10a
• /
• pp.499-503
• /
• 2000

The use of Multiple-Valued FFT(Fast fourier Transform) is extended from binary to multiple-valued logic(MVL) circuits. A multiple-valued FFT circuit can be implemented using current-mode CMOS techniques, reducing the transitor, wires count between devices to half compared to that of a binary implementation. For adder processing in FFT, We give the number representation using such redundant digit sets are called redundant positive-digit number representation and a Redundant set uses the carry-propagation-free addition method. As the designed Multiple-valued FFT internally using PD(positive digit) adder with the digit set 0,1,2,3 has attractive features on speed, regularity of the structure and reduced complexities of active elements and interconnections. for the mutiplier processing, we give Multiple-valued LUT(Look up table)to facilitate simple mathmatical operations on the stored digits. Finally, Multiple-valued 8point FFT operation is used as an example in this paper to illuatrates how a multiple-valued FFT can be beneficial.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.10
• /
• pp.2641-2653
• /
• 1998

• The Journal of Information Systems
• /
• v.4
• /
• pp.85-104
• /
• 1995

In a loosely-coupled distributed database server system, a server failure and/or a communication failure can be masked by a resiliency mechanism. Recognizing that a distributed transaction executes at several servers during its lifetime, we propose a resiliency mechanism which allows continuous transaction processing in distributed database server systems in the presence of a server failure. The resiliency mechanism for transaction processing is achieved by keeping redundant information using a primary/backup approach. The purpose of this paper is to analyze the performance improvement opportunities with the resiliency mechanism and to present the design of the proposed system.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.355-356
• /
• 2011

LiDAR data is very large, which contains an amount of redundant information. The information not only takes up a lot of storage space but also brings much inconvenience to the LIDAR data transmission and application. Therefore, a simplified method was proposed for LiDAR data based on quad-tree structure in this paper. The boundary contour lines of the buildings are displayed as building extraction. Experimental results show that the method is efficient for point's simplification according to the rule of mapping.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2024.05a
• /
• pp.453-454
• /
• 2024

전기자동차의 자율주행 기술의 수요 증가로 안정성을 위해 Redundant Design 이 브레이크 제품에 요구되고 있다. 이러한 Design 으로 인해 발생하는 Noise 와 제어를 위한 성능을 고려한 Filter 를 설계하고자 한다.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.4
• /
• pp.543-553
• /
• 1995

While RAID 5 disk arrays offer advantages of performance and reliability on wide variety of applications, they suffer from the performance degradation with write jobs. To reduce the effect of this problem, parity logging scheme was suggested. This scheme reduces disk busy time by transforming many small random accesses into large sequential accesses. This paper presents a new parity logging technique which prevents parity update image from redundant storing in the disk buffer and reduces parity maintenance overhead. A analytical model and several simulation results of our proposed scheme are presented.