• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.149-152
• /
• 2011

A Multi-Vision needs an image adjust of each product to make the same picture quality for all products when it's installed. Owing to this reason need individual control. This document request indivisual control method for each product with the Remote controller. To realize this method need make Set ID and Picture ID on the UI and need daisy chain of cable to connect Remocon code(IR Signal) In to Out, After allocation the Set ID for each product. Picture ID of the product which want to change picture quality make equal to Set ID. And the product which is same Set ID and Picture ID is only controlled through decoding of Remocon code to Scaler.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.10a
• /
• pp.170-174
• /
• 1997

This paper studies a method for making more efficient classification rules in the ID3 using the rough set theory. Decision tree technique of the ID3 always uses all the attributes in a table of examples for making a new decision tree, but rough set technique can in advance eleminate dispensable attributes. And the former generates only one type of classification rules, but the latter generates all the possibles types of them. The rules generated by the rough set technique are the simplist from as proved by the rough set theory. Therefore, ID3, applying the rough set technique, can reduct the size of the table of examples, generate the simplist form of the classification rules, and also implement an effectie classification system.

• Communications of the Korean Mathematical Society
• /
• v.9 no.4
• /
• pp.961-973
• /
• 1994

A stochastics process $X = {X(t) : t \in T}$, with an index set T, is said to be infinitely divisible (ID) if its finite dimensional distributions are all ID. An ID process X is said to be a stochastic integral process if $X = {X(t) : t \in T} =^D {\int f_td\Lambda : t \in T}$ where $f : T \times S \to R$ is a deterministic function and $\Lambda$ is an ID random measure on a $\delta$-ring S of subsets of an arbitrary non-empty set S with the property; there exists an increasing sequence ${S_n}$ of sets in S with $U_n S_n = S$. Here $=^D$ denotes equality in all finite dimensional distributions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8B
• /
• pp.805-811
• /
• 2009

Firstly, this dissertation suggests the tag ID transfer method using two-dimensional arrangement. Secondly, provide better and stable security system compare to existing one by transferring tag; ID using established two-dimensional arrangement. Thirdly, provide operating module, which possible to descramble two-dimensional arrangement, with a character set when descrambling in a tag and a server. Lastly, suggest safe key transfer using a character set and two-dimensional arrangement. In order to embody suggested system and assess, transferred two-dimensional arrangement several times to carry out the experiment. Confirmed that it is impossible for suggested system to decode key patterns compare to existing RFID systems.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.4
• /
• pp.169-176
• /
• 2010

We propose a Z-HBT line coding for a LED-ID system. Z-HBT line coding is defined as follows. First, we apply half bit transition to one bit. Second, we decode encoded bits using difference of bit transition level in one bit duration. As a result, we obtain advantages about synchronization problem and noise effect mitigation at the receiver. We set up outdoor the LED-ID simulation environment. At simulation results, we show 2-3dB gain as compared with existing line coding schemes. The results of the paper can be applied to design and implementation of LED-ID systems for indoor wireless multimedia services.

• Journal of Microbiology and Biotechnology
• /
• v.31 no.12
• /
• pp.1716-1721
• /
• 2021

Chikungunya fever is an arboviral disease caused by the Chikungunya virus (CHIKV). The disease has similar clinical manifestations with other acute febrile illnesses which complicates differential diagnosis in low-resource settings. We aimed to develop a rapid test for CHIKV detection based on the nucleic acid lateral flow immunoassay technology. The system consists of a primer set that recognizes the E1 region of the CHIKV genome and test strips in an enclosed cassette which are used to detect amplicons labeled with FITC/biotin. Amplification of the viral genome was done using open-source PCR, a low-cost open-source thermal cycler. Assay performance was evaluated using a panel of RNA isolated from patients' blood with confirmed CHIKV (n = 8) and dengue virus (n = 20) infection. The open-source PCR-NALFIA platform had a limit of detection of 10 RNA copies/ml. The assay had a sensitivity and specificity of 100% (95% CI: 67.56% - 100%) and 100% (95% CI: 83.89% - 100%), respectively, compared to reference standards of any positive virus culture on C6/36 cell lines and/or qRT-PCR. Further evaluation of its performance using a larger sample size may provide important data to extend its usefulness, especially its utilization in the peripheral healthcare facilities with scarce resources and outbreak situations.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.109-111
• /
• 2004

본 논문은 IEEE 802.11 네트워크 환경에서 MN(Mobile Node)이 핸드오버를 수행하기 전에 미리 이동 정보를 예측함으로써, 유연하게(Seamless) 서비스를 계속 받을 수 있는 예측 방법을 제안한다. 특히, MN이 속한 AP(Access Point)가 중첩된 상황에서 발생할 수 있는 여러 가지 문제점을 해결한다. MN은 이동성 패턴 레코드를 저장하고, 또한 각 이웃 AR(Access Router)은 AP의 AP-ID(BSSID, Basic Service Set ID)와 채널을 저장한다. MN이 AP의 영역의 경계를 벗어나기 전, 새로운 AP로부터 AP-lD를 획득하면, MN이 저장하는 이동성 패턴 레코드에서, AP-ID와 맞는 정보를 비교하여 확률이 높은 AP를 선택한다. 이러한 정보를 PAR(Previous Access Router)에게 정보를 보내어 신속하게 새로운 링크에서 서비스를 받을 수 있음으로써 손실.지연을 최소화 할 수 있다.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.12
• /
• pp.119-126
• /
• 2020

In this paper, we design and implement a product information guidance system Based on BLE beacons. This system is designed to provide various functions such as contactless entrance service through mobile ticket, seat guidance service, event push service, content push service, and public service. This system consists of three modules: a beacon recognition module, a server linkage module, and a content transmission module. The beacon recognition module implements a function of transmitting a specific ID of a nearby beacon when a customer with a smartphone approaches the available service area. The server linkage module recognizes the beacon ID value, transfers it to the server, and implements the function to check the location of the server having the ID. The content transmission module implements a function of transmitting event or service information set at a corresponding location to a smartphone. The beacon-based product information guidance system implemented in this paper has the advantage of being able to quickly and easily implement various product information guidance systems.

• Communications of the Korean Mathematical Society
• /
• v.27 no.4
• /
• pp.733-743
• /
• 2012

In the present paper, we prove common fixed point theorems for single-valued and set-valued occasionally weakly compatible mappings in Menger spaces. Our results improve and extend the results of Chen and Chang [Chi-Ming Chen and Tong-Huei Chang, Common fixed point theorems in Menger spaces, Int. J. Math. Math. Sci. 2006 (2006), Article ID 75931, Pages 1-15].

• Journal of KIISE:Software and Applications
• /
• v.26 no.11
• /
• pp.1314-1323
• /
• 1999

컴퓨터의 사용이 일반화됨에 따라 데이타를 생성하고 수집하는 것이 용이해졌다. 이에 따라 데이타로부터 자동적으로 유용한 지식을 얻는 기술이 필요하게 되었다. 데이타 마이닝에서 얻어진 지식은 정확성과 이해성을 충족해야 한다. 본 논문에서는 데이타 마이닝을 위하여 퍼지 결정트리에 기반한 효율적인 퍼지 규칙을 생성하는 알고리즘을 제안한다. 퍼지 결정트리는 ID3와 C4.5의 이해성과 퍼지이론의 추론과 표현력을 결합한 방법이다. 특히, 퍼지 규칙은 속성 축에 평행하게 판단 경계선을 결정하는 방법으로는 어려운 속성 축에 평행하지 않는 경계선을 갖는 패턴을 효율적으로 분류한다. 제안된 알고리즘은 첫째, 각 속성 데이타의 히스토그램 분석을 통해 적절한 소속함수를 생성한다. 둘째, 주어진 소속함수를 바탕으로 ID3와 C4.5와 유사한 방법으로 퍼지 결정트리를 생성한다. 또한, 유전자 알고리즘을 이용하여 소속함수를 조율한다. IRIS 데이타, Wisconsin breast cancer 데이타, credit screening 데이타 등 벤치마크 데이타들에 대한 실험 결과 제안된 방법이 C4.5 방법을 포함한 다른 방법보다 성능과 규칙의 이해성에서 보다 효율적임을 보인다.Abstract With an extended use of computers, we can easily generate and collect data. There is a need to acquire useful knowledge from data automatically. In data mining the acquired knowledge needs to be both accurate and comprehensible. In this paper, we propose an efficient fuzzy rule generation algorithm based on fuzzy decision tree for data mining. We combine the comprehensibility of rules generated based on decision tree such as ID3 and C4.5 and the expressive power of fuzzy sets. Particularly, fuzzy rules allow us to effectively classify patterns of non-axis-parallel decision boundaries, which are difficult to do using attribute-based classification methods.In our algorithm we first determine an appropriate set of membership functions for each attribute of data using histogram analysis. Given a set of membership functions then we construct a fuzzy decision tree in a similar way to that of ID3 and C4.5. We also apply genetic algorithm to tune the initial set of membership functions. We have experimented our algorithm with several benchmark data sets including the IRIS data, the Wisconsin breast cancer data, and the credit screening data. The experiment results show that our method is more efficient in performance and comprehensibility of rules compared with other methods including C4.5.