• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국해양정보통신학회 2002년도 추계종합학술대회
• /
• pp.766-769
• /
• 2002

In this paper, we propose new orthogonal modulation method to enhance the performance of CCK adapted in 802.l1b WLAN. To maintain the orthogonality of codewords produced by CCK modulator, we devide 256 codewords into 8 subset by trellis coding and codewords On a subset are orthogonal each other. In result, this method restricts maximum data rate to 9.625Mbps, however, it is better about 1.5dB than original UK modulation at BER 10$^{-5}$ .

• Proceedings of the Korea Information Processing Society Conference
• /
• 한국정보처리학회 2001년도 추계학술발표논문집 (상)
• /
• pp.477-480
• /
• 2001

최근 객체지향 설계에 UML을 많이 사용하게 되면서 개발자들은 작성된 UML 다이아그램들이 일관성이 있고 완전한가를 검증할 필요성이 대두되기 시작하였다. 본 논문에서는 [1]에서 제공된 다이아그램의 일관성과 완전성 검증 규칙을 사용하여 작성된 UML 다이아그램의 일관성과 완전성을 검증하기 위한 검증 시스템을 설계하였다. 검증 시스템의 설계에는 UML 다이아그램을 활용하였으며 프레임을 이용하여 검증 시스템의 다이아그램에 대한 내부표현을 제시하였다.

• Journal of Korea Society of Industrial Information Systems
• /
• 제10권2호
• /
• pp.26-31
• /
• 2005

In this paper, we present the document summarizers which are simpler and more condense than the existing ones generally used in the web search engines. This method is a statistic-based summarization method using the concept of the complete graph. We suppose that each sentence as a vertex and the similarity between two sentences as a link of the graph. We compare this summarizer with those of Clustering and MMR techniques which are well-known as the good summarization methods. For the comparison, we use FScore using the summarization results generated by human subjects. Our experimental results verify the accuracy of this method, being about $30\%$ better than the others.

• Journal of KIISE:Computer Systems and Theory
• /
• 제35권2호
• /
• pp.60-65
• /
• 2008

The matching preclusion set of a graph is a set of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. The matching preclusion number is the minimum cardinality over all matching preclusion sets. We show in this paper that, for any $m{\geq}4$, the matching preclusion numbers of both m-dimensional restricted HL-graph and recursive circulant $G(2^m,4)$ are equal to degree m of the networks, and that every minimum matching preclusion set is the set of edges incident to a single vertex.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• 제33권6호
• /
• pp.861-868
• /
• 2023

One of the key technologies in providing data analysis in the deep learning while maintaining security is fully homomorphic encryption. Due to constraints in operations on fully homomorphically encrypted data, non-arithmetic functions used in deep learning must be approximated by polynomials. Until now, the degrees of approximation polynomials with composite minimax polynomials have been uniformly set across layers, which poses challenges for effective network designs on fully homomorphic encryption. This study theoretically proves that setting different degrees of approximation polynomials constructed by composite minimax polynomial in each layer does not pose any issues in the inference on convolutional neural networks.

• Proceedings of the KAIS Fall Conference
• /
• 한국산학기술학회 2011년도 추계학술논문집 2부
• /
• pp.679-682
• /
• 2011

본 논문에서는 완전제어형 식물공장에서 작물이 생육하는데 필요한 재배환경들의 모니터링 및 제어가 가능한 센서 네트워크 기반의 식물공장 통합 제어 시스템을 설계 및 구축한다. 제안한 시스템은 완전제어형 식물공장에서 각 재배단의 환경 정보를 수집하기 위해 통합 환경정보 센서 및 전력 제어 센서를 설치하고, 통합 컨트롤러를 통해 LED 조명의 제어가 가능하도록 설계 하였다. 환경정보 센서는 온도, 습도, CO2의 데이터가 실시간으로 수집되며 전력제어 센서는 실시간 사용되는 전력량 데이터가 수집 가능하며 센서를 통해 전력의 차단 및 공급이 가능하도록 설계 하였다. 본 시스템은 크게 모니터링과 제어로 구분되며 테스트 베드의 구축을 통해 실시간 환경정보 센서 데이터 수집이 가능하고, LED 조명 및 전력을 제어가 가능함을 확인하였다.

• Knowledge Management Research
• /
• 제21권4호
• /
• pp.109-127
• /
• 2020

This study empirically investigates the effects of information search on new product development (NPD) process and performance with a sample of 82 NPD projects in 5 firms. The information search is consisted of general sources, internal sources, and external sources. The performance is consisted of technological and market performance. Findings show that information search from internal sources increases the technological knowledge of the NPD team, and information search from external sources increases the market knowledge of the NPD team. The technological and market knowledge of the NPD team increases its technical performance respectively. Only the market knowledge of the NPD team increases its market performance. Overall, the technological knowledge of the NPD team fully mediates the relationship between the information search from internal sources and its technical performance. The market knowledge of the NPD team fully mediates the relationship between the information search from external sources and its technical performance, and the relationship between the information search from external sources and its market performance. There is no other significant mediation relationships between the information searches and the performances. Implications of the research findings are discussed, and recommendation for future research are provided.

• Review of Korean Society for Internet Information
• /
• 제6권1호
• /
• pp.44-51
• /
• 2005

• Journal of the Korea Society for Simulation
• /
• 제24권4호
• /
• pp.153-161
• /
• 2015

We propose a privacy-preserving location-based service (LBS) which supports top-k search service. The previous schemes hurt the privacy of either the user and the location of the objects because they are sent to the LBS server in a plaintext form. In the proposed method, by encrypting them with the fully-homomorphic encryption, we achieved the top-k search is possible while the information on them is not given to the LBS server. We performed a simulation on the proposed scheme with 16 locations where k is 3. The required time is 270 hours in a conventional desktop machine, which seems infeasible to be used in practice. However, as the progress of the hardware, the performance will be improved.

• Journal of KIISE:Information Networking
• /
• 제27권4호
• /
• pp.531-543
• /
• 2000

본 논문에서는 ATM PNN망에서 경로 배정을 위해 필요로하는 링크상태 정보를 효율적으로 집단화하는 방법을 제시한다. 이 방법은 집단화할 동료 그룹을 효율적으로 집단화하는 방법을 제시한다. 이방법은 집단화할 동료그룹의 경계노드들을 셔플넷의 노드들로 사상시킴으로써 표현해야 할 링크의 수를 완전 그물망 방법의 $N_2$에서 pN(p는 정수 N는 경계노드수)으로 줄인다 이는 공간 복잡도가 O(N)인 신장트리(spanning tree)방법에서 필요로 하는 링크의 수와 비슷하지만 신장 트리방법과는 달리 비대칭망(asymmetric network)에서 사용할 수 있다는 것이 큰 장접이다. 모의 실험결과 셔플넷 방법은 pNro의 링크만을 표현하면서도 상태 정보의 정확성은 완전 그물망 방법에 근접함을 알 수 있었다.