• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06b
• /
• pp.298-303
• /
• 2007

비휘발성 메모리의 하나인 플래시 메모리는 저전력 및 저비용 등의 장점으로 인해 임베디드 시스템에 필수적인 요소로 사용되고 있다. 이러한 장점에 반해, DRAM과 같은 휘발성 반도체 메모리와 비교하여 데이터 쓰기는 느리고, 데이터 업데이트를 위한 블록 소거 (erase) 동작의 오버헤드라는 단점이 있다. 특히 블록 소거 동작은 횟수가 제한되어 있으며, 이는 플래시 메모리의 수명을 결정하는데 중요한 요소이다. 본 논문에서는 플래시 메모리 기반 파일시스템에서 DRAM과 같은 동적 메모리를 사용하여 블록 소거의 횟수를 줄이고 입출력 속도를 향상시키는 기법을 제안한다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2022.01a
• /
• pp.339-340
• /
• 2022

본 논문에서는 사용자의 다양한 물리적 속성 중 부드러운 헤비사이드 계단 함수와 다양한 물리적 속성(속도, 시점 등)을 활용하여 가중치 맵을 계산하고 이로부터 논플레이어 캐릭터(Non-player character, NPC)의 경로를 효율적으로 제어할 수 있는 NavMesh 제어 기법을 제시한다. 게임과 같은 가상환경에서 NPC는 일반적으로 네비게이션 메쉬(Navigation mesh, NavMesh)를 이용하여 이동한다. 하지만, NavMesh는 정적인 형태이기 때문에 사용자에 의해 디자인되어야 하고, 이러한 문제를 완화하고자 자동으로 NavMesh를 업데이트하는 기술이 연구되고 있지만, 메쉬 복원을 자동화할 뿐 실제 NPC 행동 제어라고 하기에는 힘든 접근법이다. 본 논문에서는 동적 네비게이션 프레임워크를 유지한 채, 사용자의 시점과 물리적 특성을 통해 NPC를 효율적이고 정확하게 경로 제어할 수 있는 방법을 제안하고, NavMesh의 형태에만 의존하던 NPC의 움직임을 완화하여 좀 더 사실적인 경로 제어를 보여준다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.6
• /
• pp.3841-3850
• /
• 2014

Owing to the rapid supply of mobile devices, the requirements of users for new mobile software has increased and software vendors (developers) should be able to provide software fast and appropriately. On the other hand, the mobile application in a mobile platform architecture should pass through a complex process to provide the modified mobile application to users and cannot provide an update quickly and immediately. On the other hand, the use of the mobile web is growing because a mobile web can provide an immediate modification of various update requirements to users. Therefore, this paper proposes a dynamic configuration technique for enhancing the productivity of the mobile web development and maintenance in this paper.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.6
• /
• pp.1375-1382
• /
• 2019

The latest version of commercial protector, Themida, has been updated, it is impossible to apply a normalized unpacking mechanism from previous studies by disable the use of a virtual memory allocation that provides initial data to be tracked. In addition, compared to the previous version, which had many values that determined during execution and easy to track dynamically, it is difficult to track dynamically due to values determined at the time of applying the protector. We will look at how the latest version of Themida make it difficult to normalize the API wrapping process by adopted techniques and examine the possibilities of applying the unpacking techniques to further develop an automated unpacking system.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.39 no.1
• /
• pp.147-154
• /
• 2019

The finite element model updating can be defined as the problem of finding the parameters of the finite element model which gives the closest response to the actual response of the structure by measurement. In the previous researches, optimization based methods have been developed to minimize the error of the response of the actual structure and the analytical model. In this study, we propose an inverse eigenvalue problem that can directly obtain the parameters of the finite element model from the target mode information. Deep Neural Networks are constructed to solve the inverse eigenvalue problem quickly and accurately. As an application example of the developed method, the dynamic finite element model update of a suspension bridge is presented in which the deep neural network simulating the inverse eigenvalue function is utilized. The analysis results show that the proposed method can find the finite element model parameters corresponding to the target modes with very high accuracy.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.42 no.1
• /
• pp.82-89
• /
• 2014

This paper discusses the methods for reducing the sampling time quantization errors of the body dither type ring laser gyroscope. A ring laser gyroscope has the angle quantization error which is generated by the frequency counting method of the laser beat signal and sampling time quantization error which is generated by the demodulation method for eliminating the body dithering in which the sampling periods are fitted to the dither periods. Generally, because the dither periods are longer than the calculation periods of the inertial navigation system, vehicle navigation errors are produced by long time attitude update missing during the vehicle move with a high dynamical motion. In this paper, the double demodulation method is proposed for reducing the sampling time quantization error and its effects under the dynamic situation are confirmed by simulation.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.21 no.1
• /
• pp.73-82
• /
• 2008

In this paper, a new regularization method by parameter subset selection method is proposed based on the residual force vector for damage localization. Although subset selection using the fundamental modal characteristics as a residual function has been successful in detecting a single damage location, this method seems to have limited capabilities in the detection of multiple damage locations and typically requires cumbersome weighting values. The method is presented herein and considers cases in which damage detection must be achieved using incomplete measurements of the structural responses. Model expansion is incorporated to deal with this challenge. The unique advantage of employing the new regularization method is that it can reliably identify multiple damage locations. Through an illustrative example, the proposed damage detection method is demonstrated to be a reliable tool for identifying multiple damage locations for a planar truss structure.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.2
• /
• pp.267-277
• /
• 2017

One of fundamental problems in developing robust distributed services is how to achieve distributed consensus agreeing some data values that should be shared among participants in a distributed service. As one of algorithms for distributed consensus, Raft is known as a simple and understandable algorithm by decomposing the distributed consensus problem into three subproblems(leader election, log replication and safety). But, the algorithm dose not mention any types of dynamic configuration of participant peers such as adding new peers to a consensus group or deleting peers from the group. In this paper, we present a new consensus algorithm named Raft-D, which supports the dynamic configuration of participant peers by extending the Raft algorithm. For this, Raft-D manages the additional information maintained by participant nodes, and provides a technique to check the connection status of the nodes belonging to the consensus group. Based on the technique, Raft-D defines conditions and states to deal with adding new peers to the consensus group or deleting peers from the group. Based on those conditions and states, Raft-D performs the dynamic configuration process for a consensus group through the log update mechanism of the Raft algorithm.

• Journal of Internet Computing and Services
• /
• v.19 no.1
• /
• pp.67-76
• /
• 2018

This paper addresses the problem of efficient processing of region monitoring queries. The centralized methods used for existing region monitoring query processing assumes that the mobile object periodically sends location-updates to the server and the server continues to update the query results. However, a large amount of location updates seriously degrade the system performance. Recently, some distributed methods have been proposed for region monitoring query processing. In the distributed methods, the server allocates to all objects i) a resident domain that is a subspace of the workspace, and ii) a number of nearby query regions. All moving objects send location updates to the server only when they leave the resident domain or cross the boundary of the query region. In order to allocate the resident domain to the moving object along with the nearby query region, we use a query index structure that is constructed by splitting the workspace recursively into equal halves. However, However, the above index structure causes unnecessary division, resulting in deterioration of system performance. In this paper, we propose an adaptive split method to reduce unnecessary splitting. The workspace splitting is dynamically allocated i) considering the spatial relationship between the query region and the resultant subspace, and ii) the distribution of the query region. We proposed an enhanced QR-tree with a new splitting method. Through a set of simulations, we verify the efficiency of the proposed split methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.11
• /
• pp.1966-1975
• /
• 2008

NEMO Basic Support Protocol standardized in IETF provides the seamless communication environment to all nodes within the mobile network regardless of the network movement while the network is moving. According to the standard, when the mobile network moves outside of its home network the network can make use of the binding update message or dynamic routing protocol in order to register the mobility information into the Home Agent(HA). But because these two methods don't consider the route optimization, all packets destined to Mobile Network Nodes(MNNs) attached into the Mobile Router(MR) have to go through HAs of MRs so that they bring on the transmission delay and the waste of the bandwidth. This situation is to be worse and causes the packet fragmentation problem if MRs within the mobile network are nested. Even though there have been some researches about the route optimization to recover the problems, they have problems in the packet transmission performance side. In this paper, we propose a new scheme to improve the network performance by using a dynamic routing protocol and minimizing the number of HAs on the end-to-end path. Various performance evaluations show that the proposed mechanism gives better performance in view of the packet transmission compared to the existing schemes.