• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.328-331
• /
• 2013

As digital ecosystem has been rapidly transforming into the mobile based platform, several mobile operating system, which is in charge of user interface with mobile device has been appeared. This research suggest critical factors affecting success and failure of several commercial mobile operating systems from Palm OS appearing in 1996 to main mobile OSs appearing in 2013. For this, we analyse several mobile operating OS cases, elicit factors affecting success and failure of mobile OS, and conduct ID3 based inductive learning analyses based on elicted factors and values in case dataset. Through this, we draw rules in success and failure of mobile OS and suggest strategic implications for the commercial success of mobile OS.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.2
• /
• pp.124-133
• /
• 2009

There are many different ID representation forms depending on the media or applications. In case of RFID tag, ID representation form must be followed by the rule of ISO/IEC 15962. In this study, we developed the efficient ID conversion algorithm between ID representation form on RFID tag and Internet. The main idea is on the use of XML based ID profiles and three step logical IDs forms. The algorithm was tested by the typical three kinds of real IDs such as EPC, ISO/IEC 15459 KKR Code, and mCode which are the typical meta-IDs can be defined in ISO/IEC 18000-6C tag.

• Journal of Information Technology Services
• /
• v.12 no.3
• /
• pp.331-343
• /
• 2013

In RFID systems, the anti-collision algorithm is being improved to recognize Tag's ID within recognition area of the reader quickly and efficiently. This paper focuses on Tag collision. Many studies have been carried out to resolve Tag collision. This paper proposes a new N-ary Query Tree Algorithm to resolve more than Tag collision simultaneously, according to the value of m(2 ~ 6). This algorithm can identify more tags than existing methods by treating a maximum 6 bit collision, regardless of the continuation/non-continuation Tag's ID patterns. So, it extracts maximumly different $2^6$ bit patterns per single prefix in recognition process. The performance of N-ary Query Tree Algorithm is evaluated by theoretical analysis and simulation program.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.625-627
• /
• 2005

결정 트리(Decision Tree)는 주어진 데이터의 경향을 학습하는 데 사용되는 대표적인 방식이다. 이것은 주어진 데이터를 구조화하기 위하여 데이터의 속성과 정보의 엔트로피에 기반을 둔 정보획득량을 이용한다. 본 논문에서는 유비쿼터스 환경에서 사용자 프로파일 정보처럼 시간에 따라 그 경향이 변하는 데이터에 유용하게 적용할 수 있는 시간 가중치 엔트로피를 정의한다. 그리고 ID3 알고리즘을 기반으로 새롭게 제안하는 시간 가중치 엔트로피를 이용하는 향상된 ID3 알고리즘을 쓰고 사용자의 경향을 분석한다. 본 논문에서 제안하는 엔트로피를 이용하는 방식은 데이터들의 시간에 관한 영향을 고려해서 기준방식보다 분석결과가 더욱 유리하다. 두 방식의 비교 테스트 결과를 보면 시간 가중치 엔트로피를 이용하는 알고리즘은 기존의 ID3 알고리즘보다 구성된 트리의 구조가 매우 간단하고 유리하다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.8
• /
• pp.672-678
• /
• 2013

In the recent year, along with the rapid development of LED technology, many applications using LEDs have been researched and indoor positioning is one of them. In particular, previous indoor positioning systems based on visible light communication combine triangulation manner such as AoA, ToA TDoA. But most of them needs transmitting unique ID of each LED panel. In this paper, we propose an non LED-ID based indoor positioning system in which the visible light radiated from LEDs is used to locate the position of receiver. Compared to current indoor positioning systems using LED light, our system has the advantages of simple implementation, low cost and high accuracy. Through the computer simulation, our system can achieve a high estimation accuracy of 3.6cm in average in the $5{\times}5{\times}3m^3$ room.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.3
• /
• pp.163-170
• /
• 2011

This paper proposes a modified version of Particle Swarm Optimization (PSO) called Information Diffusion PSO (ID-PSO). In PSO algorithms, premature convergence of particles could be prevented by defining proper population topology. In this paper, we propose a variant of PSO algorithm using a new population topology. We draw inspiration from the theory of information diffusion which models the transmission of information or a rumor as one-to-one interactions between people. In ID-PSO, a particle interacts with only one particle at each iteration and they share their personal best solutions and recognized best solutions. Each particle recognizes the best solution that it has experienced or has learned from another particle as the recognized best. Computational experiments on the benchmark functions show the effectiveness of the proposed algorithm compared with the existing methods which use different population topologies.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2C
• /
• pp.348-353
• /
• 2004

Development of an efficient and secure payment system is prerequisite for the construction of electronic payment mechanism in mobile environment. Since current PayWord protocol system generates vendor's certificate for each transaction, it requires lot of operation for transaction. In this paper, we use a session key generated by ID-based tripartite Key agreement protocol which use an Elliptic Curve Cryptosystem over finite field $F_{q}$ for transactions. Therefore, our protocol reduces algorithm operations. In particular, proposed protocol using ID-based public key cryptosystem has the advantages over the existing systems in speed and it is more secure in Man-in-the-middle attacks and Forward secrecy.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.12
• /
• pp.111-121
• /
• 2014

In this paper, we propose tree-based hybrid query tree architecture utilizing time slot. 4-Bit Pattern Slot Allocation(4-SL) has a 8-ary tree structure and when tag ID responses according to query of the reader, it applies a digital coding method, the Manchester code, in order to extract the location and the number of collided bits. Also, this algorithm can recognize multiple Tags by single query using 4 fixed time slots. The architecture allows the reader to identify 8 tags at the same time by responding 4 time slots utilizing the first bit($[prefix+1]^{th}$, F ${\in}$ {'0' or '1'}) and bit pattern from second ~ third bits($[prefix+2]^{th}{\sim}[prefix+3]^{th}$, $B_2{\in}$ {"00" or "11"}, $B_1{\in}$ {"01" or "10"}) in tag ID. we analyze worst case of the number of query nodes(prefix) in algorithm to extract delay time for recognizing multiple tags. The identification delay time of the proposed algorithm was based on the number of query-responses and query bits, and was calculated by each algorithm.

• Convergence Security Journal
• /
• v.6 no.3
• /
• pp.69-78
• /
• 2006

ID security policy is generally formulated from the input of many members of an organization, including security officials, line managers, and ID resource specialists. However, policy is ultimately approved and issued by the organization's senior management. In environments where employees feel inundated with policies, directives, guidelines and procedures, an ID security policy should be introduced in a manner that ensures that management's unqualified support is clear. This paper will discuss Next Generation Cyber Certificate security policy in terms of the different types program-level and issue-specific, components, and Design and Implementation of Security Algorithm Simulation based on 4GL, PowerBuilder7.0.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9A
• /
• pp.656-663
• /
• 2009

In 3GPP LTE system downlink, PSS (primary synchronization signal) and SSS (secondary synchronization signal) sequences are used for initial cell search and synchronization. UE (user equipment) detects slot timing, frequency offset, and cell ID by using PSS. After that it should detect frame timing, cell group ID, and CP length by using SSS. But in 3GPP LTE, there are two kinds of CP length, so we should operate FFT twice. In this paper, to minimize SSS detection complexity in cell searcher, we propose a CP length pre-decision algorithm that reduces the arithmetical complexity by half at most, with negligible performance degradation.