• 한국컴퓨터정보학회논문지
• /
• 제20권8호
• /
• pp.69-75
• /
• 2015

Nowadays, software plays various roles in applications in wide areas. However, the security problems caused by software vulnerabilities increase. So, it is necessary to improve software security and safety in software execution. In this paper, we propose an approach to improve the safety of software execution by managing information used in software through static data access analysis. The approach can detect the exposures of secure data in software execution by analyzing information property and flows through static data access analysis. In this paper, we implemented and experimented the proposed approach with a base language, and verify that the proposed approach can effectively detect the exposures of secure information. The proposed approach can be applied in several areas for improving software safety by analysing vulnerabilities from information flows in software execution.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제14권4호
• /
• pp.391-406
• /
• 2014

The performance of General-Purpose computation on Graphics Processing Units (GPGPU) is heavily dependent on the memory access behavior. This sensitivity is due to a combination of the underlying Massively Parallel Processing (MPP) execution model present on GPUs and the lack of architectural support to handle irregular memory access patterns. Application performance can be significantly improved by applying memory-access-pattern-aware optimizations that can exploit knowledge of the characteristics of each access pattern. In this paper, we present an algorithmic methodology to semi-automatically find the best mapping of memory accesses present in serial loop nest to underlying data-parallel architectures based on a comprehensive static memory access pattern analysis. To that end we present a simple, yet powerful, mathematical model that captures all memory access pattern information present in serial data-parallel loop nests. We then show how this model is used in practice to select the most appropriate memory space for data and to search for an appropriate thread mapping and work group size from a large design space. To evaluate the effectiveness of our methodology, we report on execution speedup using selected benchmark kernels that cover a wide range of memory access patterns commonly found in GPGPU workloads. Our experimental results are reported using the industry standard heterogeneous programming language, OpenCL, targeting the NVIDIA GT200 architecture.

• 정보처리학회논문지:컴퓨터 및 통신 시스템
• /
• 제12권1호
• /
• pp.17-24
• /
• 2023

모바일 앱은 사용자의 편의를 위해 개인정보에 접근할 수 있는 권한을 자주 요청한다. 하지만 이에 따라 모바일 앱을 이용하는 동안 허용되지 않은 개인정보가 유출되는 문제가 많이 발생했다. 이러한 문제를 해결하기 위해 구글 앱스토어에 등록된 앱은 개인정보 처리방침에 사용자의 개인정보를 앱에서 어떻게 활용하는지 명시하도록 했다. 하지만 앱이 수행하는 개인정보 수집 및 처리 과정이 개인정보 처리방침에 정확히 공개되어 있는지 확인하기 어려우며, 모바일 앱 사용자가 앱이 접근할 수 있는 개인정보에 대해 알기 위해서는 개인정보 처리방침에 의존해야만 한다. 본 연구에서는 개인정보 처리방침과 모바일 앱을 분석하여 개인정보 처리방침의 신뢰성을 확인하는 시스템을 제시한다. 먼저 개인정보 처리방침의 텍스트를 추출 및 분석하여 모바일 앱이 어떤 개인정보를 이용할 수 있다고 공개하는지 확인한다. 이후 안드로이드 정적 분석을 통해 앱이 접근할 수 있는 개인정보 분류를 확인하고, 두 결과를 비교하여 개인정보 처리방침을 신뢰할 수 있는지 분석한다. 실험을 위해 구글 앱스토어에 등록된 약 13,000개 안드로이드 앱의 패키지 파일과 부가정보를 수집한 뒤 분석할 수 있는 앱을 선정하기 위해 4가지 조건에 따라 전처리를 진행했다. 선정한 앱을 대상으로 텍스트 분석과 모바일 앱 분석을 진행하고, 이를 비교하여 모바일 앱은 개인정보 처리방침에 공개한 것보다 더욱 많은 개인정보에 접근할 수 있음을 증명한다.

• Journal of Computing Science and Engineering
• /
• 제9권1호
• /
• pp.1-8
• /
• 2015

Accessing and searching in a sequence of numbers are fundamental operations in computing that are encountered in a wide range of applications. One of the applications of the problem is cryptanalytic time-memory tradeoff which is aimed at a one-way function. A rainbow table, which is a common method for the time-memory tradeoff, contains elements from an input domain of a hash function that are normally sorted integers. In this paper, we present a practical indexing method for a monotonically increasing static sequence of numbers where the access and search queries can be addressed efficiently in terms of both time and space complexity. For a sequence of n numbers from a universe $U=\{0,{\ldots},m-1\}$, our data structure requires n lg(m/n) + O(n) bits with constant average running time for both access and search queries. We also give an analysis of the time and space complexities of the data structure, supported by experiments with rainbow tables.

• 대한기계학회논문집A
• /
• 제24권7호
• /
• pp.1779-1786
• /
• 2000

Most of traditional design processes of mechanical parts are regarded as sequential and discrete, since different kinds of softwas should be introduced. In this paper, we develop an integrated fram ework for virtual design and performance testing of an automobile seat. The system is composed of four modules, i.e. CAD, static analysis, dynamic analysis, and draft drawing module. In the CAD module, PRO/ENGINEER 3D seat model is created using parameters to be modified with the result of static and dynamic analysis. In the static analysis, headrest tere used in each design stage make it difficult to feedback their results to upstream process. These discrete processes may result in time loss and cost rise. In recent years, life cycle of product is reduced. To have competence with others, new concept design processt is simulated using ANSYS. In the dynamic analysis module, FMVSS201 test is simulated using DADS. Overall data flow is controlled by Motif. The advantage of the system is that even a novice can perform and review the whole design process, without a good hand at professional design/analysis S/W in each stage. The system also provides a virtual design space, where engineers in different development stage can access common data of design models. The concept could be applied to other fields and it could reduce time and money required in design process.

• Journal of Communications and Networks
• /
• 제17권2호
• /
• pp.203-209
• /
• 2015

Although mobile applications are an essential characteristic of wireless sensor networks, most existing media access control (MAC) protocols focus primarily on static networks. In these protocols, fixed periodic neighbor discovery and schedule updating are used to connect and synchronize neighbors to provide successful data transmission; however, they cannot adapt to mobile speed variation and degrade the network performance dramatically. In this paper, we propose a mobile-supporting mechanism for MAC protocols, in which the decision to update the neighbors of a mobile node is made adaptively according to the mobile speed. Analysis and simulation results demonstrate that the mechanism efficiently avoids the disconnection of amobile node from its neighbors and achieves a better performance as compared with fixed periodic neighbor discovery.

• 한국CDE학회논문집
• /
• 제13권6호
• /
• pp.459-468
• /
• 2008

A web-based Computer-Aided Engineering (CAE) supporting system is connected with a Product Data Management (PDM) system for Small and Medium Enterprises (SMEs) suffering from the lack of building hardware, software and related experts. An analysis of current business models and worksite requirements provides an improved process model and data to be shared between the PDM system and the CAE supporting system. Since all engineering tasks such as geometric modeling, mesh generation, static stress and modal analysis, and fatigue durability analysis are automated in the CAE supporting system, the user in charge of the CAE have only to configure the concerned values of design variables and result data through the web page. The existing Change Management module of the PDM system is modified for seamless data exchange, i.e. sending the Engineering Change Order (ECO) data to the CAE supporting system and receiving the CAE result data bark. The hi-directional data transfers between the PDM system and the CAE supporting system is made possible by adaptors bused on the Simple Object Access Protocol (SOAP). The current approach will be very helpful for SMEs that only have the PDM system and have no adequate infrastructure for CAE.

• 정보교육학회논문지
• /
• 제1권1호
• /
• pp.49-59
• /
• 1997

이 논문은 자료접근 방법중 신속한 자료접근 및 갱신작업을 위해 일반적으로 많이 사용되는 인덱스(INDEX) 기법을 분석 비교함으로써 효율적인 데이타베이스 시스템을 위한 기초를 제공하고자 한다. 이를 위해 기존의 자료접근 기법들을 편의에 의해 자료 군집형태와 검출 형태에 따라 분류하고 인덱스 기법을 단일키와 다중키로 구분하였다. 단일키 인덱싱 기법을 동적 인덱스와 정적 인덱스 기법으로 나누어 비교 설명하고, 다중키 인덱스 기법중에서 K-d 트리, K-d-B 트리 및 역 화일과 그리드 화일의 자료 구조 특성을 비교 분석한 다음 각 기범들의 구조적 특성과 추출 질의어에 의한 일반적인 성능 특성을 비교 분석하였다.

• 한국IT서비스학회지
• /
• 제13권4호
• /
• pp.275-287
• /
• 2014

Recently, the volume of unstructured text data generated by various social media has been increasing rapidly; consequently, the use of text mining to support decision-making has also been growing. In particular, academia and industry are paying significant attention to topic analysis in order to discover the main issues from a large volume of text documents. Topic analysis can be regarded as static analysis because it analyzes a snapshot of the distribution of various issues. In contrast, some recent studies have attempted to perform dynamic issue tracking, which analyzes and traces issue trends during a predefined period. However, most traditional issue tracking methods have a common limitation : when a new period is included, topic analysis must be repeated for all the documents of the entire period, rather than being conducted only on the new documents of the added period. Additionally, traditional issue tracking methods do not concentrate on the transition of individuals' interests from certain issues to others, although the methods can illustrate macro-level issue trends. In this paper, we propose an individual interests tracking methodology to overcome the two limitations of traditional issue tracking methods. Our main goal is not to track macro-level issue trends but to analyze trends of individual interests flow. Further, our methodology has extensible characteristics because it analyzes only newly added documents when the period of analysis is extended. In this paper, we also analyze the results of applying our methodology to news articles and their access logs.

• 한국항공운항학회지
• /
• 제26권4호
• /
• pp.36-42
• /
• 2018

Although continuous passenger injuries and physical damages are repeated due to the unexpected aviation turbulence encountered during operations, there is still exist the limitation for preventing recurrence of similar events because the lack of real-time information and delay in technological developments regarding various operating conditions and variable weather phenomena. The purpose of this study is to compare and analyze the meteorological data of the aviation turbulence occurred and actual flight data extracted from the Quick Access Recorder(QAR) to provide some precursors that the pilot can identify aviation turbulence early by referring thru the flight instrumentation indications. The case applied for this study was recent event, a scheduled flight from Incheon Airport, Korea to Narita Airport, Japan that suddenly encountered turbulence at an altitude of approximately 14,000 feet during approach. According to the Korea Meteorological Administration(KMA)'s Regional Data Assessment and Prediction System(RDAPS) data, it was observed that the strong amount of vorticity in the rear area of jet stream, which existed near Mount Fuji at that time. The QAR data analysis shows significant changes in the aircraft's parameters such as Pitch and Roll angle, Static Air Temperature(SAT), and wind speed and direction in tens of seconds to minutes before encounter the turbulence. If the accumulate reliability of the data in addition and verification of various parameters with continuous analysis of additional cases, it can be the precursors for the pilot's effective and pre-emptive action and conservative prevention measures against aviation turbulence to reduce subsequent passenger injuries in the aviation operations.