• Title/Summary/Keyword: 언어 근사

Search Result 42, Processing Time 0.027 seconds

Qualitative Evaluation by using Intelligent Fuzzy Logical Inference for the Public Education (지능형 퍼지 추론 기법을 적용한 공교육의 정성 평가방법)

  • Kim, Youngtaek
    • The Journal of Korean Association of Computer Education
    • /
    • v.17 no.1
    • /
    • pp.97-105
    • /
    • 2014
  • To enhance the practical usage of solely quantitative evaluation method for each students on the current public education fields which might cause some social problems, an intelligent and adaptive fuzzy logical inference methodology for the additional qualitative evaluation technique is proposed to utilize each students personal characteristic properties to be evaluated. Proposed method uses some verbal descriptions for the linguistic qualifier in addition to the grade points. An imaginary virtual experimentation only has been implemented due to some difficulties with the critical national educational policy problems in the case of some possibly real and practical experimental environments to be utilized for the simulation.

  • PDF

Newton-Raphson's Double Precision Reciprocal Using 32 bit multiplier (32 비트 곱셈기를 사용한 뉴톤-랍손 배정도실수 역수 계산기)

  • Cho, Gyeong-Yeon
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.18 no.6
    • /
    • pp.31-37
    • /
    • 2013
  • Modern graphic processors, multimedia processors and audio processors mostly use floating-point number. High-level language such as C and Java use both single precision and double precision floating-point number. In this paper, an algorithm which computes the reciprocal of double precision floating-point number using a 32 bit multiplier is proposed. It divides the mantissa of double precision floating-point number to upper part and lower part, and calculates the reciprocal of the upper part with Newton-Raphson algorithm. And it computes the reciprocal of double precision floating-point number with calculated upper part reciprocal as the initial value. Since the number of multiplications performed by the proposed algorithm is dependent on the mantissa of floating-point number, the average number of multiplications per an operation is derived from some reciprocal tables with varying sizes.

Goldschmidt's Double Precision Floating Point Reciprocal Computation using 32 bit multiplier (32 비트 곱셈기를 사용한 골드스미트 배정도실수 역수 계산기)

  • Cho, Gyeong-Yeon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.5
    • /
    • pp.3093-3099
    • /
    • 2014
  • Modern graphic processors, multimedia processors and audio processors mostly use floating-point number. Meanwhile, high-level language such as C and Java uses both single-precision and double precision floating-point number. In this paper, an algorithm which computes the reciprocal of double precision floating-point number using a 32 bit multiplier is proposed. It divides the mantissa of double precision floating-point number to upper part and lower part, and calculates the reciprocal of the upper part with Goldschmidt's algorithm, and computes the reciprocal of double precision floating-point number with calculated upper part reciprocal as the initial value is proposed. Since the number of multiplications performed by the proposed algorithm is dependent on the mantissa of floating-point number, the average number of multiplications per an operation is derived from some reciprocal tables with varying sizes.

A Study on the Computational Model of Word Sense Disambiguation, based on Corpora and Experiments on Native Speaker's Intuition (직관 실험 및 코퍼스를 바탕으로 한 의미 중의성 해소 계산 모형 연구)

  • Kim, Dong-Sung;Choe, Jae-Woong
    • Korean Journal of Cognitive Science
    • /
    • v.17 no.4
    • /
    • pp.303-321
    • /
    • 2006
  • According to Harris'(1966) distributional hypothesis, understanding the meaning of a word is thought to be dependent on its context. Under this hypothesis about human language ability, this paper proposes a computational model for native speaker's language processing mechanism concerning word sense disambiguation, based on two sets of experiments. Among the three computational models discussed in this paper, namely, the logic model, the probabilistic model, and the probabilistic inference model, the experiment shows that the logic model is first applied fer semantic disambiguation of the key word. Nexr, if the logic model fails to apply, then the probabilistic model becomes most relevant. The three models were also compared with the test results in terms of Pearson correlation coefficient value. It turns out that the logic model best explains the human decision behaviour on the ambiguous words, and the probabilistic inference model tomes next. The experiment consists of two pans; one involves 30 sentences extracted from 1 million graphic-word corpus, and the result shows the agreement rate anong native speakers is at 98% in terms of word sense disambiguation. The other pm of the experiment, which was designed to exclude the logic model effect, is composed of 50 cleft sentences.

  • PDF

A Study on the Reliable Video Transmission Through Source/Channel Combined Optimal Quantizer for EREC Based Bitstream (EREC 기반 비트열을 위한 Source-Channel 결합 최적 양자화기 설계 및 이를 통한 안정적 영상 전송에 관한 연구)

  • 김용구;송진규;최윤식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.12B
    • /
    • pp.2094-2108
    • /
    • 2000
  • 오류를 수반하는 통신망을 통한 멀티미디어 데이터의 응용은 최근 그 수요가 급증하고 있다. 하지만 그 구현은 많은 문제점들을 야기하는데, 전송된 비디오 데이터에 발생한 오류를 처리하는 문제가 그 중 하나이다. 이는 압축된 비트열에 발생한 오류가 영상의 시-공간 방향으로 심각한 전파 현상을 수반하기 때문이다. 이러한 심각한 오류 전파를 완화하기 위해 본 논문에서는 EREC라 알려진 오류 제한 기법을 적용하고, 적용된 EREC의 오류 전파 특성을 분석하였다. 이를 통해, 압축 부호화된 하나의 기본 블록 (매크로 블록)이 복호시 오류가 생길 확률을 추정하였으며, 추정된 확률의 근사를 통해 양 끝단(전송단과 수신단)에서의 비디오 화질 열화를 예측하였다. 추정 확률의 근사는 매 기본 블록에서 발생된 비트수에 대한 그 기본 블록이 복호시 오류가 생길 확률을 간단한 1차식을 통한 선형 회귀법으로 모델링 되었으며, 따라서 간단한 방법을 통해 양 끝단의 화질 열화를 효과적으로 예측할 수 있었다. 부호화된 비트열이 전송 오류에 보다 강인하게 되도록 하기 위해, 본 논문에서 개발된 화질 열화 모델을 양자화기 선택에 적용함으로써, 새로운 최적 양자화 기법을 제시하였다. 본 논문에서 제안된 최적 양자화 기법은, 기존의 양자기 최적화 기법들과는 달리, 복호단에서의 복원 영상 화질이 주어진 비트율에서 최적이 되도록 양자화를 수행한다. H.263 비디오 압축 규격에 적용한 제안 양자화 기법의 실험 결과를 통해, 제안 기법이 매우 적은 계산상의 부하를 비용으로 객관적 화질은 물론 주관적 화질까지 크게 개선할 수 있음을 확인할 수 있었다.내었다.Lc. lacti ssp. lactis의 젖산과 초산의 생성량은 각각 0.089, 0.003과 0.189, 0.003M이었다. 따라서 corn steep liquor는 L. fermentum와 Lc. lactis ssp, lactis 의 생장을 위해 질소 또는 탄소 공급원으로서 배지에 첨가 될 수 있는 우수한 농업 부산물로 판단되었다.징하며 WLWQ에 적용되는 몇 가지 제약을 관찰하고 이를 일반적인 언어원리로 설명한다. 첫째, XP는 주어로만 해석되는데 그 이유는 XP가 목적어 혹은 부가어 등 다른 기능을 할 경우 생략 부위가 생략의 복원 가능선 원리 (the deletion-up-to recoverability principle)를 위배하기 때문이다. 둘째, WLWQ가 내용 의문문으로만 해석되는데 그 이유는 양의 공리(the maxim of quantity: Grice 1975) 때문이다. 평서문으로 해석될 경우 WP에 들어갈 부분이 XP의 자질의 부분집합에 불과하므로 명제가 아무런 정보제공을 하지 못한다. 반면 의문문 자체는 정보제공을 추구하지 않으므로 앞에서 언급한 양의 공리로부터 자유롭다. 셋째, WLWQ의 XP는 주제어 표지 ‘는/-은’을 취하나 주어표지 ‘가/-이’는 취하지 못한다(XP-는/-은 vs. XP-가/-이). 이는 IP내부 에 비공범주의 존재 여부에 따라 C의 음운형태(PF)가 시성이 정해진다는 가설로 설명하고자 했다. WLWQ에 대한 우리의 논의가 옳다면, 본 논문은 다음과 같은 이론적 함의를 기닌다. 첫째, WLWQ의 존재는 생략에 대한 두 이론 즉 LF 복사 이론과 PF 삭제 이론

  • PDF

n-Gram/2L: A Space and Time Efficient Two-Level n-Gram Inverted Index Structure (n-gram/2L: 공간 및 시간 효율적인 2단계 n-gram 역색인 구조)

  • Kim Min-Soo;Whang Kyu-Young;Lee Jae-Gil;Lee Min-Jae
    • Journal of KIISE:Databases
    • /
    • v.33 no.1
    • /
    • pp.12-31
    • /
    • 2006
  • The n-gram inverted index has two major advantages: language-neutral and error-tolerant. Due to these advantages, it has been widely used in information retrieval or in similar sequence matching for DNA and Protein databases. Nevertheless, the n-gram inverted index also has drawbacks: the size tends to be very large, and the performance of queries tends to be bad. In this paper, we propose the two-level n-gram inverted index (simply, the n-gram/2L index) that significantly reduces the size and improves the query performance while preserving the advantages of the n-gram inverted index. The proposed index eliminates the redundancy of the position information that exists in the n-gram inverted index. The proposed index is constructed in two steps: 1) extracting subsequences of length m from documents and 2) extracting n-grams from those subsequences. We formally prove that this two-step construction is identical to the relational normalization process that removes the redundancy caused by a non-trivial multivalued dependency. The n-gram/2L index has excellent properties: 1) it significantly reduces the size and improves the Performance compared with the n-gram inverted index with these improvements becoming more marked as the database size gets larger; 2) the query processing time increases only very slightly as the query length gets longer. Experimental results using databases of 1 GBytes show that the size of the n-gram/2L index is reduced by up to 1.9${\~}$2.7 times and, at the same time, the query performance is improved by up to 13.1 times compared with those of the n-gram inverted index.

Comparing String Similarity Algorithms for Recognizing Task Names Found in Construction Documents (문자열 유사도 알고리즘을 이용한 공종명 인식의 자연어처리 연구 - 공종명 문자열 유사도 알고리즘의 비교 -)

  • Jeong, Sangwon;Jeong, Kichang
    • Korean Journal of Construction Engineering and Management
    • /
    • v.21 no.6
    • /
    • pp.125-134
    • /
    • 2020
  • Natural language encountered in construction documents largely deviates from those that are recommended by the authorities. Such practice that is lacking in coherence will discourage integrated research with automation, and it will hurt the productivity in the industry for the long run. This research aims to compare multiple string similarity (string matching) algorithms to compare each algorithm's performance in recognizing the same task name written in multiple different ways. We also aim to start a debate on how prevalent the aforementioned deviation is. Finally, we composed a small dataset that associates construction task names found in practice with the corresponding task names that are less cluttered w.r.t their formatting. We expect that this dataset can be used to validate future natural language processing approaches.

Efficient Semantic Structure Analysis of Korean Dialogue Sentences using an Active Learning Method (능동학습법을 이용한 한국어 대화체 문장의 효율적 의미 구조 분석)

  • Kim, Hark-Soo
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.5
    • /
    • pp.306-312
    • /
    • 2008
  • In a goal-oriented dialogue, speaker's intention can be approximated by a semantic structure that consists of a pair of a speech act and a concept sequence. Therefore, it is very important to correctly identify the semantic structure of an utterance for implementing an intelligent dialogue system. In this paper, we propose a model to efficiently analyze the semantic structures based on an active teaming method. To reduce the burdens of high-level linguistic analysis, the proposed model only uses morphological features and previous semantic structures as input features. To improve the precisions of semantic structure analysis, the proposed model adopts CRFs(Conditional Random Fields), which show high performances in natural language processing, as an underlying statistical model. In the experiments in a schedule arrangement domain, we found that the proposed model shows similar performances(92.4% in speech act analysis and 89.8% in concept sequence analysis) to the previous models although it uses about a third of training data.

A study on automation of modal analysis of a spindle system of machine tools using ANSYS (ANSYS를 활용한 공작기계 주축 시스템의 진동 모드 해석 자동화에 관한 연구)

  • Lee, Bong-Gu;Choi, Jin-Woo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.4
    • /
    • pp.2338-2343
    • /
    • 2015
  • An analytical model was developed in this study and then implemented into a tool for automation of FEA (Finite Element Analysis) of a spindle system for natural frequencies and modes in the universal FEA software, ANSYS. VBA of EXCEL was used for the implementation. It allowed graphic user interfaces (GUIs) to be developed for a user to interact with the tool and, in addition, an EXCEL spreadsheet to be used for data arrangement. A code was developed in the language of ANSYS to generate the geometric model of the spindle system, sequentially to construct the analytical model based on the information in the GUIs, and finally to perform computation for the FEA. Its automation of the model generation and analysis can help to identify a near optimal design of the spindle system under design in minimum time and efforts.

Numerical Simulation of Periodic and Oscillatory Problems by Using RK-Butcher Algorithms (RK-Butcher알고리듬의 사용에 의한 주기적 진동 문제의 수치적 시뮬레이션)

  • Park, Dae-Chul;Gopal, Devarajan;Murugesh, V.
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.9 no.1
    • /
    • pp.82-88
    • /
    • 2008
  • In this paper, Runge-Kutta (RK)-Butcher algorithm is proposed to study the periodic and oscillatory problems. Simulation results obtained using RK-Butcher algorithms and the classical fourth order Runge-Kutta (RK(4)) methods are compared with the exact solutions of a few periodic and oscillatory problems to confirm the performance of the proposed algorithm. The simulation results from RK-Butcher algorithms are always found to be very close to the exact solutions of these problems. Further, it is found that the RK-Butcher algorithm is superior when compared to RK(4) methods in terms of accuracy. The RK-Butcher algorithm can be easily implemented in a programming language and a more accurate solution may be obtained for any length of time. RK-Butcher algorithm is applicable as a good numerical algorithm for studying the problems of orbit and two body as it gives the nearly identical solutions.

  • PDF