• Title/Summary/Keyword: Rule Space

Search Result 463, Processing Time 0.031 seconds

Bi-directional Maximal Matching Algorithm to Segment Khmer Words in Sentence

  • Mao, Makara;Peng, Sony;Yang, Yixuan;Park, Doo-Soon
    • Journal of Information Processing Systems
    • /
    • v.18 no.4
    • /
    • pp.549-561
    • /
    • 2022
  • In the Khmer writing system, the Khmer script is the official letter of Cambodia, written from left to right without a space separator; it is complicated and requires more analysis studies. Without clear standard guidelines, a space separator in the Khmer language is used inconsistently and informally to separate words in sentences. Therefore, a segmented method should be discussed with the combination of the future Khmer natural language processing (NLP) to define the appropriate rule for Khmer sentences. The critical process in NLP with the capability of extensive data language analysis necessitates applying in this scenario. One of the essential components in Khmer language processing is how to split the word into a series of sentences and count the words used in the sentences. Currently, Microsoft Word cannot count Khmer words correctly. So, this study presents a systematic library to segment Khmer phrases using the bi-directional maximal matching (BiMM) method to address these problematic constraints. In the BiMM algorithm, the paper focuses on the Bidirectional implementation of forward maximal matching (FMM) and backward maximal matching (BMM) to improve word segmentation accuracy. A digital or prefix tree of data structure algorithm, also known as a trie, enhances the segmentation accuracy procedure by finding the children of each word parent node. The accuracy of BiMM is higher than using FMM or BMM independently; moreover, the proposed approach improves dictionary structures and reduces the number of errors. The result of this study can reduce the error by 8.57% compared to FMM and BFF algorithms with 94,807 Khmer words.

Revenge of the Flesh: The Return of Sexual and Racial Otherness in Faulkner's Absalom, Absalom! ('육체의 복수' -포크너의 『압살롬, 압살롬!』에 나타난 성적, 인종적 타자의 귀환)

  • Kwon, Jieun
    • Journal of English Language & Literature
    • /
    • v.58 no.4
    • /
    • pp.701-721
    • /
    • 2012
  • This paper aims to revisit William Faulkner's Absalom, Absalom! by focusing on the corporeal body and its role in dismantling the Southern ideology of white patriarchy. The latter, which is represented by Thomas Sutpen and his attempt to establish a white male dynasty, is a symbolic space in which the corporeal body turns into a symbolic one through the process of inscribing social ideologies on it. However, this symbolic space is also a contending site between the two bodies. The symbolic body of Sutpen cannot entirely erase its corporeal traces, and therefore the corporeal body, which is buried but nonetheless existent, threatens to undermine rules and premises of the symbolic order. Given that, this paper approaches Faulkner's critique of the Southern white patriarchal ideology from the tension that the corporeal body and the symbolic body create. The 'flesh' roughly corresponds to racial and sexual otherness, namely black flesh and the homoerotic desire of male body. Although they-as the matter of race and that of gender - function in different levels of signification, they still share a common purpose in revealing the logical paradox within Sutpen's symbolic order. The idea of pure whiteness that Sutpen subscribes to is a concept that prerequisites the existence of blackness. Likewise, his idea of male homosociality based upon patriarchal legacy stands precariously on the verge of disintegrating into homoetoricism. As internal otherness that Sutpen's symbolic order cannot fully incorporate, the corporeal body functions to indicate the limitation of Sutpen's Design and its body-signification process.

Constraints on dark radiation from cosmological probes

  • Rossi, Graziano;Yeche, Christophe;Palanque-Delabrouille, Nathalie;Lesgourgues, Julien
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.40 no.1
    • /
    • pp.44.1-44.1
    • /
    • 2015
  • We present joint constraints on the number of effective neutrino species $N_{eff}$ and the sum of neutrino masses ${\Sigma}m_{\nu}$, based on a technique which exploits the full information contained in the one-dimensional Lyman-${\alpha}$ forest flux power spectrum, complemented by additional cosmological probes. In particular, we obtain $N_{eff}=2.91{\pm}0.22$ (95% CL) and ${\Sigma}m_{\nu}$ < 0.15 eV (95% CL) when we combine BOSS Lyman-${\alpha}$ forest data with CMB (Planck+ACT+SPT+WMAP polarization) measurements, and $N_{eff}=2.88{\pm}0.20$ (95% CL) and ${Sigma}m_{\nu}$ < 0.14 eV (95% CL) when we further add baryon acoustic oscillations. Our results tend to favor the normal hierarchy scenario for the masses of the active neutrino species, provide strong evidence for the Cosmic Neutrino Background from $N_{eff}{\approx}3$($N_{eff}=0$ is rejected at more than $14{\sigma}$), and rule out the possibility of a sterile neutrino thermalized with active neutrinos (i.e., $N_{eff}=4$) - or more generally any decoupled relativistic relic with $${\Delta}N_{eff}{\sim_=}1$$ - at a significance of over $5{\sigma}$, the strongest bound to date, implying that there is no need for exotic neutrino physics in the concordance ${\Lambda}CDM$ model.

  • PDF

A Generalized Hyperparamodulation Strategy Based on a Forward Reasoning for the Equality Relation ; RHU- resolution*

  • Lee, Jin-Hyeong;Im, Yeong-Hwan;O, Gil-Rok
    • ETRI Journal
    • /
    • v.9 no.1
    • /
    • pp.84-96
    • /
    • 1987
  • The equality relation is very important in mechanical theorem proving procedures. A proposed inference rule called RHU-resolution is intended to extend the hyperparamodulation[23, 9] by introducing a bidirectional proof search that simultaneously employs a forward reasoning and a backward reasoning, and generalize it by incorporating beneflts of extended hyper steps with a preprocessing process, that includes a subsumption check in an equality graph and a high level planning. The forward reasoning in RHU-resolution may replace the role of the function substitution link.[9] That is, RHU-deduction without the function substitution link gets a proof. In order to control explosive generation of positive equalities by the forward reasoning, we haue put some restrictions on input clauses and k-pd links, and also have included a control strategy for a positive-positive linkage, like the set-of-support concept, A linking path between two end terms can be found by simple checking of linked unifiability using the concept of a linked unification. We tried to prevent redundant resolvents from generating by preprocessing using a subsumption check in the subsumption based eauality graph(SPD-Graph)so that the search space for possible RHU-resolution may be reduced.

  • PDF

An Adaptive Fuzzy Sliding-Mode Control for Decoupled Nonlinear Systems (분리된 비선형 시스템의 적응 퍼지 슬라이딩모드 제어)

  • Kim, Do-U;Yang, Hae-Won;Yun, Ji-Seop
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.9
    • /
    • pp.719-727
    • /
    • 2002
  • We proposed a decoupled adaptive fuzzy sliding-mode control scheme for a class of fourth-order nonlinear systems. The system is decoupled into two second-order systems such that each subsystem has a separate control target expressed in terms of sliding surface. For these sliding surfaces, we define main and sub target conditions. and, we made intermediate variables which are interconnected both surface conditions from the sub target sliding surface. Then, Two sets of fuzzy rule bases are utilized to represent the equivalent control input with unknown system functions of the main target sliding surface including intermediate variables. The membership functions of the THEN-part, which is used to construct a suitable equivalent control of sliding-mode control, are changed according to the adaptive law. With such a design scheme, we not only maintain the distribution of membership functions over state space but also reduce the computing time considerably. We apply the decoupled adaptive sliding-mode control to a nonlinear Cart-Pole system and confirms the validity of the proposed approach.

Comparative Study of Knowledge Extraction on the Industrial Applications

  • Woo, Young-Kwang;Bae, Hyeon;Kim, Sung-Shin;Woo, Kwang-Bang
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.1338-1343
    • /
    • 2003
  • Data is the expression of the language or numerical values that show some characteristics. And information is extracted from data for the specific purposes. The knowledge is utilized as information to construct rules that recognize patterns and make decisions. Today, knowledge extraction and application of the knowledge are broadly accomplished to improve the comprehension and to elevate the performance of systems in several industrial fields. The knowledge extraction could be achieved by some steps that include the knowledge acquisition, expression, and implementation. Such extracted knowledge can be drawn by rules. Clustering (CU, input space partition (ISP), neuro-fuzzy (NF), neural network (NN), extension matrix (EM), etc. are employed for expression the knowledge by rules. In this paper, the various approaches of the knowledge extraction are examined by categories that separate the methods by the applied industrial fields. Also, the several test data and the experimental results are compared and analysed based upon the applied techniques that include CL, ISP, NF, NN, EM, and so on.

  • PDF

The Allocation of Inspection Efforts Using a Knowledge Based System

  • Kang, Kyong-sik;Stylianides, Christodoulos;La, Seung-houn
    • Journal of Korean Society for Quality Management
    • /
    • v.18 no.2
    • /
    • pp.18-24
    • /
    • 1990
  • The location of inspection stations is a significant component of production systems. In this paper, a prototype expert system is designed for deciding the optimal location of inspection stations. The production system is defined as a single channel of n serial operation stations. The potential inspection station can be located after any of the operation stations. Nonconforming units are generated from a compound binomial distribution with known parameters at any given operation station. Traditionally Dynamic programming, Zero-one integer programming, or Non-linear programming techniques are used to solve this problem. However a problem with these techniques is that the computation time becomes prohibitively large when t be number of potential inspection stations are fifteen or more. An expert system has the potential to solve this problem using a rule-based system to determine the near optimal location of inspection stations. This prototype expert system is divided into a static database, a dynamic database and a knowledge base. Based on defined production systems, the sophisticated rules are generated by the simulator as a part of the knowledge base. A generate-and-test inference mechanism is utilized to search the solution space by applying appropriate symbolic and quantitative rules based on input data. The goal of the system is to determine the location of inspection stations while minimizing total cost.

  • PDF

Extensible Hierarchical Method of Detecting Interactive Actions for Video Understanding

  • Moon, Jinyoung;Jin, Junho;Kwon, Yongjin;Kang, Kyuchang;Park, Jongyoul;Park, Kyoung
    • ETRI Journal
    • /
    • v.39 no.4
    • /
    • pp.502-513
    • /
    • 2017
  • For video understanding, namely analyzing who did what in a video, actions along with objects are primary elements. Most studies on actions have handled recognition problems for a well-trimmed video and focused on enhancing their classification performance. However, action detection, including localization as well as recognition, is required because, in general, actions intersect in time and space. In addition, most studies have not considered extensibility for a newly added action that has been previously trained. Therefore, proposed in this paper is an extensible hierarchical method for detecting generic actions, which combine object movements and spatial relations between two objects, and inherited actions, which are determined by the related objects through an ontology and rule based methodology. The hierarchical design of the method enables it to detect any interactive actions based on the spatial relations between two objects. The method using object information achieves an F-measure of 90.27%. Moreover, this paper describes the extensibility of the method for a new action contained in a video from a video domain that is different from the dataset used.

Spatiotemporal Pattern Mining Technique for Location-Based Service System

  • Vu, Nhan Thi Hong;Lee, Jun-Wook;Ryu, Keun-Ho
    • ETRI Journal
    • /
    • v.30 no.3
    • /
    • pp.421-431
    • /
    • 2008
  • In this paper, we offer a new technique to discover frequent spatiotemporal patterns from a moving object database. Though the search space for spatiotemporal knowledge is extremely challenging, imposing spatial and timing constraints on moving sequences makes the computation feasible. The proposed technique includes two algorithms, AllMOP and MaxMOP, to find all frequent patterns and maximal patterns, respectively. In addition, to support the service provider in sending information to a user in a push-driven manner, we propose a rule-based location prediction technique to predict the future location of the user. The idea is to employ the algorithm AllMOP to discover the frequent movement patterns in the user's historical movements, from which frequent movement rules are generated. These rules are then used to estimate the future location of the user. The performance is assessed with respect to precision and recall. The proposed techniques could be quite efficiently applied in a location-based service (LBS) system in which diverse types of data are integrated to support a variety of LBSs.

  • PDF

On Learning and Structure of Cerebellum Model Linear Associator Network(I) -Analysis & Development of Learning Algorithm- (소뇌모델 선형조합 신경망의 구조 및 학습기능 연구(I) -분석 및 학습 알고리즘 개발-)

  • Hwang, H.;Baek, P.K.
    • Journal of Biosystems Engineering
    • /
    • v.15 no.3
    • /
    • pp.186-198
    • /
    • 1990
  • 인간 소뇌의 구조와 기능을 간략하게 수학적으로 모델링하여 입력에 따른 시스템의 적정 출력을 학습에 의한 적응 제어 방식으로 추출해 내는 소뇌모델 대수제어기(CMAC : Cerebellar Model Arithmetic Controller)가 제안되었다. 본 논문에서는 연구개발된 기존 신경회로망과의 비교 분석에 의거하여, 소뇌모델 대수제어기 대신 네트의 특성에 따라 소뇌모델 선형조합 신경망(CMLAN : Cerebellum Model Linear Associator Network)이라 하였다. 소뇌모델 선형조합 신경망은 시스템의 제어 함수치를 결정하는 데 있어, 기존의 제어방식이 시스템의 모델링을 기초로 하여 알고리즘에 의한 수치해석적 또는 분석적 기법으로 모델 해를 산출하는 것과 달리, 학습을 통하여 저장되는 분산기억 소자들의 함수치를 선형적으로 조합함으로써 시스템의 입출력을 결정한다. 분산기억 소자로의 함수치 산정 및 저장은 소뇌모델 선형조합 신경망이 갖는 고유의 구조적 상태공간 매핑(State Space Mapping)과 델타규칙(Delta Rule)에 의거한 시스템의 입출력 상태함수의 학습으로써 수행된다. 본 논문을 통하여 소뇌모델 선형조합신경망의 구조적 특성, 학습 성질과 상태공간 설정 및 시스템의 수렴성을 규명하였다. 또한 기존의 최대 편차수정 학습 알고리즘이 갖는 비능률성 및 적용 제한성을 극복한 효율적 학습 알고리즘들을 제시하였다. 언급한 신경망의 특성 및 제안된 학습 알고리즘들의 능률성을 다양한 학습이득(Learning Gain)하에서 비선형 함수를 컴퓨터로 모의 시험하여 예시하였다.

  • PDF