• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.897-898
• /
• 2009

본 논문은 사용자의 일상적인 이동 경로 패턴을 분석하여 일상화 지수를 측정하고, 이를 통해 GPS 신호 검색 주기를 동적으로 변경하는 동적 GPS 신호 검색 주기 변경 시스템을 제안한다. 고정된 GPS 신호 검색 주기는 불필요하게 많은 전력을 소모하기 때문에 제안 시스템을 이용하여 이동 단말기의 전력 소모 문제를 개선할 수 있다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.1
• /
• pp.105-115
• /
• 2019

Recently, intelligent Android malicious codes have become difficult to detect malicious behavior by static analysis alone. Malicious code with SO file, dynamic loading, and string obfuscation are difficult to extract information about original code even with various tools for static analysis. There are many dynamic analysis methods to solve this problem, but dynamic analysis requires rooting or emulator environment. However, in the case of dynamic analysis, malicious code performs the rooting and the emulator detection to bypass the analysis environment. To solve this problem, this paper investigates a variety of root detection schemes and builds an environment for bypassing the rooting detection in real devices. In addition, SDK code hooking module for Android malicious code analysis is designed using Xposed, and intent tracking for code flow, dynamic loading file information, and various API information extraction are implemented. This work will contribute to the analysis of obfuscated information and behavior of Android Malware.

• The Journal of Information Technology
• /
• v.5 no.4
• /
• pp.165-171
• /
• 2002

We propose Dynamic Circle Location Register (DCLR) scheme where each visiting location register (VLR) has a given fixed circle registration area around itself and has IDs of other VLRs in this circle area. Whenever a terminal moves to another registration area (RA), system computes whether the terminal is located in the current DCLR area and sends the recent location information of terminal to the old or new DCLR according to computing results. Also, according to change DCLR circle dynamically, we can track terminal location by querying DCLR of the current terminal when a call originates. The our scheme solves the HLR bottleneck due to the terminals frequent RA crossings and distributes the registration traffic to each of the local signaling transfer point (LSTP) area in wireless communications (WC)

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.112-122
• /
• 2004

In this paper, we propose a mobility estimation model based on inner regions in a cell and a dynamic resource reservation scheme which can control dynamically classes of mobile hosts on the mobile network. The mobility estimation model is modeled based on the reducible Markov chain. And the mobility estimation model provides a new hand off probability and a new remaining time for the dynamic resource reservation scheme. The remaining time is n estimated time that mobile hosts can stay in a cell. The dynamic resource reservation scheme can reserve dynamically a requested resource according to the classes of mobile hosts. This scheme can efficiently improve the connection blocking probability and connection dropping probability.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2547-2552
• /
• 2013

To achieve better performance in dynamic spectrum access networks, each secondary user tracks channels and chooses a good channel to transmit its packet. When all secondary users adopt the same dynamic spectrum access policy, they have similar channel information, which leads secondary users to choose the same channel and more collisions among them. To relieve this problem, we propose an access policy using belief vector tracking method for other competing secondary users. Simulation results are provided to show that the proposed policy yields better performance than the existing policies which do not take into account what other secondary users are doing.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1266-1272
• /
• 2004

Location-Based Services(LBS) give rise to location-dependent queries of which results depend on the positions of moving objects. Because positions of moving objects change continuously, indexes of moving object must perform update operations frequently for keeping the changed position information. Existing spatial index (Grid File, R-Tree, KDB-tree etc.) proposed as index structure to search static data effectively. There are not suitable for index technique of moving object database that position data is changed continuously. In this paper, I propose a dynamic hashing index that insertion/delete costs are low. The dynamic hashing structure is that apply dynamic hashing techniques to combine a hash and a tree to a spatial index. The results of my extensive experiments show the dynamic hashing index outperforms the $R^$ $R^*$-tree and the fixed grid.

• Annual Conference on Human and Language Technology
• /
• 2015.10a
• /
• pp.240-245
• /
• 2015

일반영역 음성인식은 n-gram 희소성 문제로 인해 대용량의 언어모델이 필요하다. 대용량 언어모델은 분산형 모델로 구현될 수 있고, 사용자 입력에 대한 동적 언어모델 보간 기술을 통해 음성인식 성능을 개선할 수 있다. 본 논문은 동적 언어모델 보간 기술에 대한 새로운 접근방법을 시도한다. 텍스트 군집화를 통해 주제별 언어모델을 생성한다. 여기서 주제는 사용자 입력 영역에 대응한다. 본 논문은 사용자 입력에 대하여 실시간으로 주제별 언어모델의 보간 가중치 값을 계산하는 접근 방법을 제시한다. 또한 언어모델의 보간 가중치 값 계산의 부담을 감소하기 위해 언어모델 군집화를 통해 대용량 언어모델 보간 접근 방법의 연산 부담을 해소하기 위한 시도를 한다. 주제별 언어모델에 기반하고 언어모델 군집화를 통한 동적 언어모델 보간 기술의 실험 결과 음성인식 오류 감소율 6.89%를 달성했다. 또한 언어모델 군집화 기술은 음성인식 정확도를 0.09% 저하시켰을 때 실행 시간을 17.6% 개선시키는 실험결과를 보였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.3
• /
• pp.523-531
• /
• 2007

In this paper, we are going to develop a newly designed indexing scheme which is compatible to manage the moving objects and propose a cost model of the scheme. We propose a dynamic hashing index that insertion/delete costs are low. The dynamic hashing structure is that apply dynamic hashing techniques to combine a hash and a tree to a spatial index. We analyzed the dynamic index structure and the cost model by the frequent position update of moving objects and verified through a performance assessment experiment. The results of our extensive experiments show that the newly proposed indexing schemes(Dynamic Hashing Index) are much more efficient than the traditional the fixed grid and R-tree.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.4
• /
• pp.47-52
• /
• 2007

In this paper, we proposed a constrution that creates Dynamic Pipe Hash Function with a pipe hash function. To increase security lever, dynamic hash function take and additional compression function. Proposed hash function based on the piped hash function. Our proposed Dynamic Pipe Hash Function is as secure against multicollision attack as an ideal hash function. And it have advantage for a number of reasons because of variable digest size. For example, in digital signature protocol, If a user requires increased security by selecting a large key size, useing a dynamic hash function in a protocol make implementation much easier when it is mandated that the size of the digest by increased.

• Review of KIISC
• /
• v.23 no.2
• /
• pp.21-28
• /
• 2013

스마트폰의 급증 현상은 모바일 생태계의 패러다임을 변화시켰으며 다양한 SW 컨텐츠의 양산과 더불어 그 활용 영역의 확대를 가져왔다. 이에 따라 필연적으로 모바일 악성코드도 증가되고 있으며 개인정보 또는 회사 기밀정보의 무단 유출이라는 사회적 이슈도 대두되게 되었다. 이러한 문제를 해결하기 위해서는 모바일 어플리케이션에 대한 검증이 필요하고, 검증하는 방법에는 크게 정적분석 방법과 동적분석 방법이 있으며 분석 방법에 대한 자세한 내용은 선배 전문가들의 앞선 연구 사례와 논문에 몇 차례 소개된 바 있다. 이에 본 고에서는 정적분석 및 동적분석 방법을 응용하여 (주)안랩에서 실제로 운용 중인 모바일 어플리케이션의 분석 및 검증 솔루션(AMSD) 구현사례를 소개하고자 한다. 여기에는 기 알려진 정적분석 방법과 동적분석 방법에 대한 간략한 서술이 포함되어 있으며 시스템 아키텍처 정보와 실제 오픈 마켓을 대상으로 운용하면서 얻어진 앱 분석 사례 및 개선 방향도 담고 있다. 이를 통해 모바일 오픈 마켓 운영 시의 안전성과 신뢰성 확보 및 건전한 모바일 생태계 유지를 도모하는 데 조금이나마 도움이 되었으면 하는 바램이다.