• Title, Summary, Keyword: e-regular sets

Search Result 11, Processing Time 0.031 seconds

ON STRONGLY θ-e-CONTINUOUS FUNCTIONS

  • Ozkoc, Murad;Aslim, Gulhan
    • Bulletin of the Korean Mathematical Society
    • /
    • v.47 no.5
    • /
    • pp.1025-1036
    • /
    • 2010
  • A new class of generalized open sets in a topological space, called e-open sets, is introduced and some properties are obtained by Ekici [6]. This class is contained in the class of $\delta$-semi-preopen (or $\delta-\beta$-open) sets and weaker than both $\delta$-semiopen sets and $\delta$-preopen sets. In order to investigate some different properties we introduce two strong form of e-open sets called e-regular sets and e-$\theta$-open sets. By means of e-$\theta$-open sets we also introduce a new class of functions called strongly $\theta$-e-continuous functions which is a generalization of $\theta$-precontinuous functions. Some characterizations concerning strongly $\theta$-e-continuous functions are obtained.

Why Korean Is Not a Regular Language: A Proof

  • No, Yong-Kyoon
    • Language and Information
    • /
    • v.5 no.2
    • /
    • pp.1-8
    • /
    • 2001
  • Natural language string sets are known to require a grammar with a generative capacity slightly beyond that of Context Free Grammars. Proofs regarding complexity of natural language have involved particular properties of languages like English, Swiss German and Bambara. While it is not very difficult to prove that Korean is more complex than the simplest of the many infinite sets, no proof has been given of this in the literature. I identify two types of center embedding in Korean and use them in proving that Korean is not a regular set, i.e. that no FSA's can recognize its string set. The regular language i salam i (i salam ul$)^j$ michi (key ha)^k$ essta is intersected with Korean, to give {i salam i (i salam ul$)^j$ michi (key ha$)^k$ essta i $$\mid$$ j, k $\geq$ 0 and j $\leq$ k}. This latter language is proved to be nonregular. As the class of regular sets is closed under intersection, Korean cannot be regular.

  • PDF

ASYMPTOTIC BEHAVIOUR OF IDEALS RELATIVE TO SOME MODULES OVER A COMMUTATIVE NOETHERIAN RING

  • ANSARI-TOROGHY, H.
    • Honam Mathematical Journal
    • /
    • v.23 no.1
    • /
    • pp.5-14
    • /
    • 2001
  • Let E be an injective module over a commutative Noetherian ring A. In this paper we will show that if I is regular ideal, then the sequence of sets $$Ass_A((I^n)^{{\star}(E)}/I^n),\;n{\in}N$$ is ultimately constant. Also we obtain some related results. (Here for an ideal J of A, $J^{{\star}(E)}$ denotes the integral closure of J relative to E.

  • PDF

DECOMPOSITION OF CONTINUITY AND COMPLETE CONTINUITY IN SMOOTH FUZZY TOPOLOGICAL SPACES

  • Amudhambigai, B.;Uma, M.K.;Roja, E.
    • East Asian mathematical journal
    • /
    • v.27 no.3
    • /
    • pp.261-271
    • /
    • 2011
  • In this paper, fuzzy ${\alpha}^*$-set, fuzzy C-set, fuzzy AB-set, fuzzy t-set, fuzzy B-set, etc., are introduced in the sense of Sostak [12] and Ramadan [9]. By using these sets, a decomposition of fuzzy continuity and complete fuzzy continuity are provided. Characterization of smooth fuzzy extremally disconnected spaces is also obtained in this connection.

Finding Pseudo Periods over Data Streams based on Multiple Hash Functions (다중 해시함수 기반 데이터 스트림에서의 아이템 의사 주기 탐사 기법)

  • Lee, Hak-Joo;Kim, Jae-Wan;Lee, Won-Suk
    • Journal of Information Technology Services
    • /
    • v.16 no.1
    • /
    • pp.73-82
    • /
    • 2017
  • Recently in-memory data stream processing has been actively applied to various subjects such as query processing, OLAP, data mining, i.e., frequent item sets, association rules, clustering. However, finding regular periodic patterns of events in an infinite data stream gets less attention. Most researches about finding periods use autocorrelation functions to find certain changes in periodic patterns, not period itself. And they usually find periodic patterns in time-series databases, not in data streams. Literally a period means the length or era of time that some phenomenon recur in a certain time interval. However in real applications a data set indeed evolves with tiny differences as time elapses. This kind of a period is called as a pseudo-period. This paper proposes a new scheme called FPMH (Finding Periods using Multiple Hash functions) algorithm to find such a set of pseudo-periods over a data stream based on multiple hash functions. According to the type of pseudo period, this paper categorizes FPMH into three, FPMH-E, FPMH-PC, FPMH-PP. To maximize the performance of the algorithm in the data stream environment and to keep most recent periodic patterns in memory, we applied decay mechanism to FPMH algorithms. FPMH algorithm minimizes the usage of memory as well as processing time with acceptable accuracy.

Characterization of the Spatial Variability of Paper Formation Using a Continuous Wavelet Transform

  • Keller, D.Steven;Luner, Philip;Pawlak, Joel J.
    • Journal of Korea Technical Association of The Pulp and Paper Industry
    • /
    • v.32 no.5
    • /
    • pp.14-25
    • /
    • 2000
  • In this investigation, a wavelet transform analysis was used to decompose beta-radiographic formation images into spectral and spatial components. Conventional formation analysis may use spectral analysis, based on Fourier transformation or variance vs. zone size, to describe the grammage distribution of features such as flocs, streaks and mean fiber orientation. However, these methods have limited utility for the analysis of statistically stationary data sets where variance is not uniform with position, e.g. paper machine CD profiles (especially those that contain streaks). A continuous wavelet transform was used to analyze formation data arrays obtained from radiographic imaging of handsheets and cross machine paper samples. The response of the analytical method to grammage, floc size distribution, mean fiber orientation an sensitivity to feature localization were assessed. From wavelet analysis, the change in scale of grammage variation as a function of position was used to demonstrate regular and isolated differences in the formed structure.

  • PDF

Feature Extraction from the Strange Attractor for Speaker Recognition (화자인식을 위한 어트랙터로 부터의 음성특징추출)

  • Kim, Tae-Sik
    • The Journal of the Acoustical Society of Korea
    • /
    • v.13 no.2E
    • /
    • pp.26-31
    • /
    • 1994
  • A new feature extraction technique utilizing strange attractor and artificial neural network for speaker recognition is presented. Since many signals change their characteristics over long periods of time, simple time-domain processing techniques should e capable of providing useful information of signal features. In many cases, normal time series can be viewed as a dynamical system with a low-dimensional attractor that can be reconstructed from the time series using time delay. The reconstruction of strange attractor is described. In the technique, the raw signal will be reproduced into a geometric three dimensional attractor. Classification decision for speaker recognition is based upon the processing or sets of feature vectors that are derived from the attractor. Three different methods for feature extraction will be discussed. The methods include box-counting dimension, natural measure with regular hexahedron and plank-type box. An artificial neural network is designed for training the feature data generated by the method. The recognition rates are about 82%-96% depending on the extraction method.

  • PDF

Maximum Degree Vertex-Based Algorithm for Maximum Clique Problem (최대 클릭 문제에 관한 최대차수 정점 기반 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.1
    • /
    • pp.227-235
    • /
    • 2015
  • In this paper, I propose a linear time algorithm devised to produce exact solution to NP-complete maximum clique problem. The proposed algorithm firstly, from a given graph G=(V,E), sets vertex $v_i$ of the maximum degree ${\Delta}(G)$ as clique's major vertex. It then selects vertex $v_j$ of ${\Delta}(G)$ among vertices $N_G(v_i)$ that are adjacent to $v_i$, only to determine $N_G(v_i){\cap}N_G(v_j)$ as candidate cliques w and $v_k$. Next it obtains $w=w{\cap}N_G(v_k)$ by sorting $d_G(v_k)$ in the descending order. Lastly, the algorithm executes the same procedure on $G{\backslash}w$ graph to compare newly attained cliques to previously attained cliques so as to choose the lower. With this simple method, multiple independent cliques would also be attainable. When applied to various regular and irregular graphs, the algorithm proposed in this paper has obtained exact solutions to all the given graphs linear time O(n).