• Bulletin of the Korean Mathematical Society
• /
• v.35 no.1
• /
• pp.53-61
• /
• 1998

We introduce the concepts of a positive implicative filter and an associative filter in a lattice implication algebra. We prove that (i) every positive implicative filter is an implicative filter, and (ii) every associative filter is a filter. We provide equivalent conditions for both a positive implicative filter and an associative filter.

• Proceedings of the Optical Society of Korea Conference
• /
• 1989.02a
• /
• pp.95-98
• /
• 1989

A new associative memory model using the SDF filter, one of the multiple filter for pattern recognition, is suggested in this paper. The SDF filter characteristics such as pattern classification lets the memorized patterns have orthogonal characteristics one another, so that enhances the associative memory's retrieval ability to the original pattern. The computer simulation shows that this new model is very useful in case that the imput patterns are seriously distorted and the cross-correlation between the memorized patterns is very high.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.7 no.4
• /
• pp.201-207
• /
• 2012

Currently, NAND Flash memory has been widely used in consumer storage devices due to its non-volatility, stability, economical feasibility, low power usage, durability, and high density. However, a high capacity of NAND flash memory causes the high power consumption and the low performance. In the convention memory research, a hierarchical filter mechanism can archive an effective performance improvement in terms of the power consumption. In order to attain the best filter structure for NAND flash memory, we selected a direct-mapped filter, a victim filter, a fully associative filter and a 4-way set associative filter for comparison in the performance analysis. According to the results of the simulation, the fully associative filter buffer with a 128byte fetching size can obtain the bet performance compared to another filter structures, and it can reduce the energy*delay product(EDP) by about 93% compared to the conventional NAND Flash memory.

• Journal of applied mathematics & informatics
• /
• v.32 no.3_4
• /
• pp.323-330
• /
• 2014

The notion of transitive filters is introduced in lattice implication algebras. A necessary and sufficient condition is derived for every filter to become a transitive filter. Some sufficient conditions are also derived for a filter to become a transitive filter. The concept of absorbent filters is introduced and their properties are studied. A set of equivalent conditions is obtained for a filter to become an absorbent filter.

• Honam Mathematical Journal
• /
• v.28 no.4
• /
• pp.559-572
• /
• 2006

The notion of simulative and mutant WFI-algebras is introduced, and several properties are investigated. Characterizations of a simulative WFI-algebra are established. A relation between an associative WFI-algebra and a simulative WFI-algebra is given. Some types for a simulative WFI-algebra to be mutant are found.

• Honam Mathematical Journal
• /
• v.28 no.4
• /
• pp.471-484
• /
• 2006

The notion of ideals in WFI-algebras is introduced, and several properties are investigated. Relations between a filter and an ideal are given, and characterizations of an ideal are provided. An extension property for an ideal is established.

• Journal of KIISE:Software and Applications
• /
• v.33 no.4
• /
• pp.365-377
• /
• 2006

Proteins are known to perform a biological function by interacting with other proteins or compounds. Since protein interaction is intrinsic to most cellular processes, prediction of protein interaction is an important issue in post-genomic biology where abundant interaction data have been produced by many research groups. In this paper, we present an associative feature mining method to predict implicit protein-protein interactions of Saccharomyces cerevisiae from public protein interaction data. We discretized continuous-valued features by maximal interdependence-based discretization approach. We also employed feature dimension reduction filter (FDRF) method which is based on the information theory to select optimal informative features, to boost prediction accuracy and overall mining speed, and to overcome the dimensionality problem of conventional data mining approaches. We used association rule discovery algorithm for associative feature and rule mining to predict protein interaction. Using the discovered associative feature we predicted implicit protein interactions which have not been observed in training data. According to the experimental results, the proposed method accomplished about 96.5% prediction accuracy with reduced computation time which is about 29.4% faster than conventional method with no feature filter in association rule mining.

• Journal of the Korean Society of Safety
• /
• v.12 no.3
• /
• pp.60-66
• /
• 1997

In this paper, a moving object surveillance system, which can extract moving object in real-time, using image subtraction method is described. This technique based on the novelty filter having the structure of neural network associative memory. Digital arithmetic and timing control parts were composed of hardwired controller to treat two-dimensional massive image information. SRAMS having 20 ns access time were used for the image buffer that has high speed write/read property. Image extraction algorithm is discussed and supported by simulation and experiments.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.2
• /
• pp.74-79
• /
• 2011

The goal of this research is to reduce dynamic and static power consumption for a low power cache system. The proposed cache can achieve a low power consumption by using a drowsy and a way prediction mechanism. For reducing the static power, the drowsy technique is used at 4-way set associative cache. And for reducing the dynamic energy, one among four ways is selectively accessed on the basis of information in the Way-Line Prediction Unit (WLPU). This prediction mechanism does not introduce any additional delay though prediction misses are occurred. The WLPU can effectively reduce the performance overhead of the conventional drowsy caching by waking only a drowsy cache line and one way in advance. Our results show that the proposed cache can reduce the power consumption by about 40% compared with the 4-way drowsy cache.

• The KIPS Transactions:PartA
• /
• v.14A no.2
• /
• pp.117-124
• /
• 2007

In this paper we present a translation lookaside buffer (TLB) system with low power consumption for embedded processors. The proposed TLB is constructed as multiple banks, each with an associated block buffer and a corresponding comparator. Either the block buffer or the main bank is selectively accessed on the basis of two bits in the block buffer (tag buffer). Dynamic power savings are achieved by reducing the number of entries accessed in parallel, as a result of using the tag buffer as a filtering mechanism. The performance overhead of the proposed TLB is negligible compared with other hierarchical TLB structures. For example, the two-cycle overhead of the proposed TLB is only about 1%, as compared with 5% overhead for a filter (micro) TLB and 14% overhead for a same structure without continuos accessing distinction algorithm. We show that the average hit ratios of the block buffers and the main banks of the proposed TLB are 95% and 5% respectively. Dynamic power is reduced by about 95% with respect to with a fully associative TLB, 90% with respect to a filter TLB, and 40% relative to a same structure without continuos accessing distinction algorithm.