• Title/Summary/Keyword: Neighborhood properties

검색결과 83건 처리시간 0.02초

L-fuzzy topologies on complete MV-algebras

  • Kim, Yong-chan;Ko, Jung-mi
    • 한국지능시스템학회논문지
    • /
    • 제11권7호
    • /
    • pp.649-652
    • /
    • 2001
  • In this paper, we introduce neighborhood systems in an L-fuzzy topology using complete MV-algebras. We investigate the relationship between L-fuzzy topologies and the neighborhood systems. We study the properties of neighborhood system.

  • PDF

(L,⊙)-quasi-uniform Spaces and (L,⊙)-neighborhood Systems

  • Kim, Yong-Chan;Ko, Jung-Mi
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제9권2호
    • /
    • pp.65-70
    • /
    • 2009
  • In this paper, we introduced the notion of (L,$\bigodot$)-quasi-uniform spaces and (L,$\bigodot$)-neighborhood systems on a strictly two-sided, commutative quantale lattice L. We investigate their properties and give the examples. In particular, we study the relations between (L,$\bigodot$)-quasi-uniform spaces and (L,$\bigodot$)-neighborhood systems.

고집적 메모리를 위한 새로운 테스트 알고리즘 (A New Test Algorithm for High-Density Memories)

  • Kang, Dong-Chual;Cho, Sang-Bock
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 추계종합학술대회 논문집(2)
    • /
    • pp.59-62
    • /
    • 2000
  • As the density of memories increases, unwanted interference between cells and coupling noise between bit-lines are increased and testing high density memories for a high degree of fault coverage can require either a relatively large number of test vectors or a significant amount of additional test circuitry. From now on, conventional test algorithms have focused on faults between neighborhood cells, not neighborhood bit-lines. In this paper, a new algorithm for NPSFs, and neighborhood bit-line sensitive faults (NBLSFs) based on the NPSFs are proposed. Instead of the conventional five-cell and nine-cell physical neighborhood layouts to test memory cells, a three-cell layout which is minimum size for NBLSFs detection is used. To consider faults by maximum coupling noise by neighborhood bit-lines, we added refresh operation after write operation in the test procedure(i.e., write \longrightarrow refresh \longrightarrow read). Also, we present properties of the algorithm, such as its capability to detect stuck-at faults, transition faults, conventional pattern sensitive faults, and neighborhood bit-line sensitive faults.

  • PDF

A Novel Filter ed Bi-Histogram Equalization Method

  • Sengee, Nyamlkhagva;Choi, Heung-Kook
    • 한국멀티미디어학회논문지
    • /
    • 제18권6호
    • /
    • pp.691-700
    • /
    • 2015
  • Here, we present a new framework for histogram equalization in which both local and global contrasts are enhanced using neighborhood metrics. When checking neighborhood information, filters can simultaneously improve image quality. Filters are chosen depending on image properties, such as noise removal and smoothing. Our experimental results confirmed that this does not increase the computational cost because the filtering process is done by our proposed arrangement of making the histogram while checking neighborhood metrics simultaneously. If the two methods, i.e., histogram equalization and filtering, are performed sequentially, the first method uses the original image data and next method uses the data altered by the first. With combined histogram equalization and filtering, the original data can be used for both methods. The proposed method is fully automated and any spatial neighborhood filter type and size can be used. Our experiments confirmed that the proposed method is more effective than other similar techniques reported previously.

NEIGHBORHOOD STRUCTURES IN ORDINARY SMOOTH TOPOLOGICAL SPACES

  • Lee, Jeong Gon;Lim, Pyung Ki;Hur, Kul
    • 호남수학학술지
    • /
    • 제34권4호
    • /
    • pp.559-570
    • /
    • 2012
  • We construct a new definition of a base for ordinary smooth topological spaces and introduce the concept of a neighborhood structure in ordinary smooth topological spaces. Then, we state some of their properties which are generalizations of some results in classical topological spaces.

Neighborhood Properties for Certain Subclasses of Analytic Functions of Complex Order with Negative Coefficients

  • Bulut, Serap
    • Kyungpook Mathematical Journal
    • /
    • 제54권2호
    • /
    • pp.211-220
    • /
    • 2014
  • In the present investigation, by making use of the familiar concept of neighborhoods of analytic and multivalent functions, we prove several inclusion relations associated with the (n, ${\delta}$)-neighborhoods of certain subclasses of analytic functions of complex order, which are introduced here by means of the Al-Oboudi derivative. Several special cases of the main results are mentioned.

An Efficient Built-in Self-Test Algorithm for Neighborhood Pattern- and Bit-Line-Sensitive Faults in High-Density Memories

  • Kang, Dong-Chual;Park, Sung-Min;Cho, Sang-Bock
    • ETRI Journal
    • /
    • 제26권6호
    • /
    • pp.520-534
    • /
    • 2004
  • As the density of memories increases, unwanted interference between cells and the coupling noise between bit-lines become significant, requiring parallel testing. Testing high-density memories for a high degree of fault coverage requires either a relatively large number of test vectors or a significant amount of additional test circuitry. This paper proposes a new tiling method and an efficient built-in self-test (BIST) algorithm for neighborhood pattern-sensitive faults (NPSFs) and new neighborhood bit-line sensitive faults (NBLSFs). Instead of the conventional five-cell and nine-cell physical neighborhood layouts to test memory cells, a four-cell layout is utilized. This four-cell layout needs smaller test vectors, provides easier hardware implementation, and is more appropriate for both NPSFs and NBLSFs detection. A CMOS column decoder and the parallel comparator proposed by P. Mazumder are modified to implement the test procedure. Consequently, these reduce the number of transistors used for a BIST circuit. Also, we present algorithm properties such as the capability to detect stuck-at faults, transition faults, conventional pattern-sensitive faults, and neighborhood bit-line sensitive faults.

  • PDF

MIXED VECTOR FQ-IMPLICIT VARIATIONAL INEQUALITY WITH LOCAL NON-POSITIVITY

  • Lee, Byung-Soo
    • 대한수학회논문집
    • /
    • 제24권3호
    • /
    • pp.425-432
    • /
    • 2009
  • This paper introduces a local non-positivity of two set-valued mappings (F,Q) and considers the existences and properties of solutions for set-valued mixed vector FQ-implicit variational inequality problems and set-valued mixed vector FQ-complementarity problems in the neighborhood of a point belonging to an underlined domain K of the set-valued mappings, where the neighborhood is contained in K. This paper generalizes and extends many results in [1, 3-7].