• The KIPS Transactions:PartB
• /
• v.10B no.1
• /
• pp.67-72
• /
• 2003

In this paper, we study the enhancement of VQ (Vector Quantization) design for text dependent speaker recognition. In a concrete way, we present the non-Iterative method which makes a vector quantization codebook and this method Is nut Iterative learning so that the computational complexity is epochally reduced. The proposed semi-noniterative VQ design method contrasts with the existing design method which uses the iterative learning algorithm for every training speaker. The characteristics of a semi-noniterative VQ design is as follows. First, the proposed method performs the iterative learning only for the reference speaker, but the existing method performs the iterative learning for every speaker. Second, the quantization region of the non-reference speaker is equivalent for a quantization region of the reference speaker. And the quantization point of the non-reference speaker is the optimal point for the statistical distribution of the non-reference speaker In the numerical experiment, we use the 12th met-cepstrum feature vectors of 20 speakers and compare it with the existing method, changing the codebook size from 2 to 32. The recognition rate of the proposed method is 100% for suitable codebook size and adequate training data. It is equal to the recognition rate of the existing method. Therefore the proposed semi-noniterative VQ design method is, reducing computational complexity and maintaining the recognition rate, new alternative proposal.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.777-779
• /
• 2014

The LEA(Lightweight Encryption Algorithm) is a 128-bit high-speed/lightweight block cipher algorithm developed by National Security Research Institute(NSRI) in 2012. The LEA encrypts plain text of 128-bit using cipher key of 128/192/256-bit, and produces cipher text of 128-bit, and vice versa. To reduce hardware complexity, we propose an efficient architecture which shares hardware resources for encryption and decryption in round transformation block. Hardware sharing technique for key scheduler was also devised to achieve area-efficient and low-power implementation. The designed LEA cryptographic processor was verified by using FPGA implementation.

• Journal of Information Science Theory and Practice
• /
• v.8 no.4
• /
• pp.67-86
• /
• 2020

Information need has been one of the main motivations for a person using a search engine. Queries can represent very different information needs. Ironically, a query can be a poor representation of the information need because the user can find it difficult to express the information need. Query Expansion (QE) is being popularly used to address this limitation. While QE can be considered as a language-independent technique, recent findings have shown that in certain cases, language plays an important role. Arabic is a language with a particularly large vocabulary rich in words with synonymous shades of meaning and has high morphological complexity. This paper, therefore, provides a review on QE for Arabic information retrieval, the intention being to identify the recent state-of-the-art of this burgeoning area. In this review, we primarily discuss statistical QE approaches that include document analysis, search, browse log analyses, and web knowledge analyses, in addition to the semantic QE approaches, which use semantic knowledge structures to extract meaningful word relationships. Finally, our conclusion is that QE regarding the Arabic language is subjected to additional investigation and research due to the intricate nature of this language.

• International Journal of Computer Science & Network Security
• /
• v.22 no.12
• /
• pp.132-138
• /
• 2022

Due to the impacts of the current pandemic COVID-19 and the continuation of studying online. There is an urgent need for an effective and efficient education platform to help with the continuity of studying online. Therefore, the question bank system (QB) is introduced. The QB system is designed as a website to create a single platform used by faculty members in universities to generate questions and store them in a bank of questions. In addition to allowing them to add two types of questions, to help the lecturer create exams and present the results of the students to them. For the implementation, two languages were combined which are PHP and Python to generate questions by using Artificial Intelligence (AI). These questions are stored in a single database, and then these questions could be viewed and included in exams smoothly and without complexity. This paper aims to help the faculty members to reduce time and efforts by using the Question Bank System by using AI and Natural Language Processing (NLP) to extract and generate questions from given text. In addition to the tools used to create this function such as NLTK and TextBlob.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.2
• /
• pp.517-524
• /
• 2010

Recently, the size of online texts and textual information is increasing explosively, and the automated classification has a great potential for handling data such as news materials and images. Text classification system is based on supervised learning which needs laborous work by human expert. The main goal of this paper is to reduce the manual intervention, required for the task. The other goal is to increase accuracy to be high. Most of the documents have high complexity in contents and the high similarities in their described style. So, the classification results are not satisfactory. This paper shows the implementation of classification system based on ETOM+RPost algorithm and classification progress using SPAM data. In experiments, we verified our system with right-training documents and wrong-training documents. The experimental results show that our system has high accuracy and stability in all situation as 16% improvement in accuracy.

• Agribusiness and Information Management
• /
• v.5 no.1
• /
• pp.31-41
• /
• 2013

The research assesses the impact of a digital procurement (e-purjee) system for sugarcane growers in Bangladesh. The system itself is simple, transmitting purchase orders to local farmers via SMS text notification. It replaces a traditional paper-based system fraught with low reliability and delivery delays. Applying expected value theory, and using decision tree representations to depict growers' decision-making complexity in an information-asymmetric environment, we compute outcomes for the strategies and sub-strategies of ICT vs. traditional paper-based order management from the sugarcane growers' perspective. The study results show that the digital procurement system outperforms the paper-based system by tangibly reducing growers' economic losses. The digital system also appears to benefit growers non-monetarily, because of reduced uncertainty and a higher level of perceived fairness. Sugarcane growers appear to value the non-monetary benefits even higher than the economic advantages of the e-purjee system.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.216-219
• /
• 2003

Among the techniques to protect private information by adopting biometrics, speaker verification is expected to be widely used due to advantages in convenient usage and inexpensive implementation cost Speaker verification should achieve a high degree of the reliability in the verification nout the flexibility in speech text usage, and the efficiency in verification system complexity. Continuants have excellent speaker-discriminant power and the modest number of phonemes in the category, and multilayer perceptrons (MLPs) have superior recognition ability and fast operation speed. In consequence, the two provide viable ways for speaker verification system to obtain the above properties. This paper implements a system to which continuants and MLPs are applied, and evaluates the system using a Korean speech database. The results of the experiment prove that continuants and MLPs enable the system to acquire the three properties.

• MALSORI
• /
• v.68
• /
• pp.65-74
• /
• 2008

A statistical parametric speech synthesis system based on the hidden Markov models (HMMs) has grown in popularity over the last few years, because it needs less memory and low computation complexity and is suitable for the embedded system in comparison with a corpus-based unit concatenation text-to-speech (TTS) system. It also has the advantage that voice characteristics of the synthetic speech can be modified easily by transforming HMM parameters appropriately. In this paper, we present experimental results of voice characteristics conversion using the HMM-based Korean speech synthesis system. The results have shown that conversion of voice characteristics could be achieved using a few sentences uttered by a target speaker. Synthetic speech generated from adapted models with only ten sentences was very close to that from the speaker dependent models trained using 646 sentences.

• International Journal of Contents
• /
• v.13 no.2
• /
• pp.66-74
• /
• 2017

Patent classification is becoming more critical as patent filings have been increasing over the years. Despite comprehensive studies in the area, there remain several issues in classifying patents on IPC hierarchical levels. Not only structural complexity but also shortage of patents in the lower level of the hierarchy causes the decline in classification performance. Therefore, we propose a new method of classification based on different criteria that are categories defined by the domain's experts mentioned in trend analysis reports, i.e. Patent Landscape Report (PLR). Several experiments were conducted with the purpose of identifying type of features and weighting methods that lead to the best classification performance using Support Vector Machine (SVM). Two types of features (noun and noun phrases) and five different weighting schemes (TF-idf, TF-rf, TF-icf, TF-icf-based, and TF-idcef-based) were experimented on.

• Journal of the military operations research society of Korea
• /
• v.26 no.1
• /
• pp.56-69
• /
• 2000

A frequency assignment problem on time division duplex system is considered. Republic of Korea Army (ROKA) has been establishing an infrastructure of tactical communication (SPIDER) system for next generation and it will be a core network structure of system. VHF system is the backbone network of SPIDER, that performs transmission of data such as voice, text and images. So, it is a significant problem finding the frequency assignment with no interference under very restricted resource environment. With a given arbitrary configuration of communications network, we find a feasible solution that guarantees communication without interference between sites and relay stations. We formulate a frequency assignment problem as an Integer Programming model, which has NP-hard complexity. To find the assignment results within a reasonable time, we take a genetic algorithm approach which represents the solution structure with available frequency order, and develop a genetic operation strategies. Computational result shows that the network configuration of SPIDER can be solved efficiently within a very short time.