• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.3
• /
• pp.626-634
• /
• 2012

It is required that system can seamlessly identify and manage change history and comprehensive assessment of several types of data as well as individual information of feeding and water environment for scientific and systematic management of fish farming environment and fish farmer. In this study, we implemented the system which can present and simulate current status of water quality and feeding based on th historical data of them, and check changes of state step by step using visual C++. In addition, we proposed the entropy model which can be comprehensive analysis about water quality and feed status information based on knowledge of fisheries. It can be the foundation to create high-level environment model reflecting the more diverse fisheries knowledge such as disease.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.40 no.3
• /
• pp.139-148
• /
• 2016

Thermodynamic analysis is conducted on the first-order approximation model for turbines and compressors. It is shown that the adiabatic efficiency could be greater than unity, depending on the entropic mean temperature, entropy generation, thermal reservoir temperature, and heat transfer. Therefore, adiabatic efficiency applied to a diabatic control volume results in an error overestimating its performance. To resolve this overestimation, it is suggested that a reversible diabatic process be referred to as an ideal process to evaluate diabatic efficiency. The diabatic efficiency suggested in this work is proven to always be less than unity and it is smaller than the exergy efficiency in most cases. The diabatic efficiency could be used as a more general definition of efficiency, which would include adiabatic efficiency.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.140-142
• /
• 2021

Mobile communication technology after 5th generation requires high speed, hyper-connection, and low latency communication. In order to meet technical requirements for secure hyper-connectivity, low-spec IoT devices that are considered the end of IoT services must also be able to provide the same level of security as high-spec servers. For the purpose of performing these security functions, it is required for cryptographic keys to have the necessary degree of stability in cryptographic algorithms. Cryptographic keys are usually generated from cryptographic random number generators. At this time, good noise sources are needed to generate random numbers, and hardware random number generators such as TRNG are used because it is difficult for the low-spec device environment to obtain sufficient noise sources. In this paper we used the chip which is based on quantum characteristics where the decay of radioactive isotopes is unpredictable, and we presented a variety of methods (TRNG) obtaining an entropy source in the form of binary-bit series. In addition, we conducted the NIST SP 800-90B test for the entropy of output values generated by each TRNG to compare the amount of entropy with each method.

• Annual Conference on Human and Language Technology
• /
• 2018.10a
• /
• pp.522-526
• /
• 2018

본 연구는 수많은 챗봇이 생성될 수 있는 챗봇 빌더 시스템에서 저비용 컴퓨팅 파워에서도 구동 가능한 가벼운 문장 분류 시스템을 제안하며, 미등록어 처리를 위해 워드 임베딩 기법인 GloVe를 이용하여 문장 벡터를 생성하고 이를 추가 자질로 사용하는 방법을 소개한다. 제안한 방법으로 자체 구축한 테스트 말뭉치를 이용하여 성능을 평가해본 결과 최대 93.06% 성능을 보였으며, 자체 보유한 CNN 모델과의 비교 평가 결과 성능은 2.5% 낮지만, 모델 학습 속도는 25배, 학습 시 메모리 사용량은 6배, 생성된 모델 파일 크기는 302배나 효율성 있음을 보였다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.1
• /
• pp.110-114
• /
• 2010

We describe a new method for text categorization using TextRank algorithm. Text categorization is a problem that over one pre-defined categories are assigned to a text document. TextRank algorithm is a graph-based ranking algorithm. If we consider that each word is a vertex, and co-occurrence of two adjacent words is a edge, we can get a graph from a document. After that, we find important words using TextRank algorithm from the graph and make feature which are pairs of words which are each important word and a word adjacent to the important word. We use classifiers: SVM, Na$\ddot{i}$ve Bayesian classifier, Maximum Entropy Model, and k-NN classifier. We use non-cross-posted version of 20 Newsgroups data set. In consequence, we had an improved performance in whole classifiers, and the result tells that is a possibility of TextRank algorithm in text categorization.

• Journal of KIISE:Software and Applications
• /
• v.32 no.2
• /
• pp.75-84
• /
• 2005

Sequential pattern mining is an important data mining problem with broad applications. While the current methods are generating sequential patterns within a single attribute, the proposed method is able to detect them among different attributes. By incorporating these additional attributes, the sequential patterns found are richer and more informative to the user This paper proposes a new method for generating multi-dimensional sequential patterns with the use of Hellinger entropy measure. Unlike the Previously used methods, the proposed method can calculate the significance of each sequential pattern. Two theorems are proposed to reduce the computational complexity of the proposed system. The proposed method is tested on some synthesized purchase transaction databases.

• The Journal of the Korea Contents Association
• /
• v.16 no.8
• /
• pp.160-168
• /
• 2016

The classification and evaluation of cooking that is being published on the internet are presented without scientific criteria based on individual subjective factors. In this paper, we objectified the degree of cooking difficulty based on the information entropy. And we measured the similarity by calculating the common entropy between recipes and constructed a social network based on the recipe similarity. As a result of measuring the cooking difficulty, 'Dongtae Haemul-jjim' (Korean) and 'Vegetarian Lasagna' (Italy) are the most difficult recipes and 'Gochu-jang' (Korean) and 'Tofu steak' (Italy) are the easiest recipes. Through the recipe network, the similarity between Korean and Asian cooking is higher than Western cuisine. We showed a similar recipe to a particular cooking, the group of similar recipes, and reasonable schedule when preparing the menu from the viewpoint of ease of cooking.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.1
• /
• pp.59-65
• /
• 1999

In this paper, we design a entorpy encoder of HDTV/DTV encoder blocks on the basis of MPEG-II. The designed entropy encoder outputs its bit stream at 9Mbps bit rate inserting zero-stepping block to protect the depletion of buffer in case that the generated bit stream is stored in buffer and uses not only PROM bit combinational circuit to solve the problem of critical path, and packer block, one of submerge, is designed to packing into 24 bit unit using barrel shifter, and it is constructed to blocks of header information encoder, input information delay, submerge, and buffer control. Designed circuits is verified by VHDL function simulation, as a result of performing P&R with Gate compiler that apply $0.8{\mu}m$ Gate Array specification, pin and gate number of total circuits has been tested to each 235 and about 120,000.

• Journal of Korea Multimedia Society
• /
• v.3 no.2
• /
• pp.201-208
• /
• 2000

In this paper We describe an algorithm which is devised for 4he partition o# the input space and the generation of fuzzy rules by the fuzzy entropy and tested with the time series prediction problem using Mackey-Glass chaotic time series. This method divides the input space into several fuzzy regions and assigns a degree of each of the generated rules for the partitioned subspaces from the given data using the Shannon function and fuzzy entropy function generating the optimal knowledge base without the irrelevant rules. In this scheme the basic idea of the fuzzy neural network is to realize the fuzzy rules base and the process of reasoning by neural network and to make the corresponding parameters of the fuzzy control rules be adapted by the steepest descent algorithm. The Proposed algorithm has been naturally derived by means of the synergistic combination of the approximative approach and the descriptive approach. Each output of the rule's consequences has expressed with its connection weights in order to minimize the system parameters and reduce its complexities.

• Journal of KIISE:Software and Applications
• /
• v.32 no.7
• /
• pp.581-591
• /
• 2005

Collaborative filtering systems have problems involving sparsity and the provision of recommendations by making correlations between only two users' preferences. These systems recommend items based only on the preferences without taking in to account the contents of the items. As a result, the accuracy of recommendations depends on the data from user-rated items. When users rate items, it can be expected that not all users ran do so earnestly. This brings down the accuracy of recommendations. This paper proposes a collaborative recommendation method for extracting typical group preferences using user-item matrix optimization and user profiles in collaborative tittering systems. The method excludes unproven users by using entropy based on data from user-rated items and groups users into clusters after generating user profiles, and then extracts typical group preferences. The proposed method generates collaborative user profiles by using association word mining to reflect contents as well as preferences of items and groups users into clusters based on the profiles by using the vector space model and the K-means algorithm. To compensate for the shortcoming of providing recommendations using correlations between only two user preferences, the proposed method extracts typical preferences of groups using the entropy theory The typical preferences are extracted by combining user entropies with item preferences. The recommender system using typical group preferences solves the problem caused by recommendations based on preferences rated incorrectly by users and reduces time for retrieving the most similar users in groups.