• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.5
• /
• pp.1039-1048
• /
• 2019

Symbolic execution, an automatic search method for vulnerability verification, has been technically improved over the last few years. However, it is still not practical to analyze the program using only the symbolic execution itself. One of the biggest reasons is that because of the path explosion problem that occurs during program analysis, there is not enough memory, and you can not find the solution of all paths in the program using symbolic execution. Thus, it is practical for the analyst to construct a path for symbolic execution to a target with vulnerability rather than solving all paths. In this paper, we propose a static analysis - based backward CFG(Control Flow Graph) generation technique that can be used in symbolic execution for program analysis. With the creation of a backward CFG, an analyst can select potential vulnerable points, and the backward path generated from that point can be used for future symbolic execution. We conducted experiments with Linux binaries(x86), and indeed showed that potential vulnerability selection and backward CFG path generation were possible in a variety of binary situations.

• Journal of Advanced Navigation Technology
• /
• v.16 no.6
• /
• pp.997-1004
• /
• 2012

In this paper, we propose and implement a signal quality measurement algorithm for CDMA2000 1x terminal. The proposed algorithm is suitable to be implemented in software on a PC-based platform and extract the received signal after carrying out equalization, PN code acquisition and tracking, frequency and phase offset compensation with 4-oversampled input signal. Then, through despreading and demodulation with the extracted signal, the proposed algorithm regenerate the reference signal to be used in measurement. The signal quality is measured using this regenerated signal and the extracted signal.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.595-599
• /
• 2006

센서 네트워크는 주로 물리적인 공간의 모니터링이나 위치 추적과 같은 주변의 정보를 얻고자 하는 환경에 사용되며, 이러한 정보는 비대칭적이고 비신뢰적인 무선 링크로 인해 불필요한 재전송을 요구하고 많은 손실이 발생한다. 이 때문에 신뢰적이고 에너지 효율적인 링크를 선택하기 위해 RSSI(Received Signal Strength Indicator), LQI(Link Quality Indicator)를 이용하여 무선 링크에 대한 품질을 추정하는 기법이 필요하다. 본 논문에서는 그 일차적인 단계로써 단일 홉 무선 센서 네트워크에서 MICAZ에 구현된 RSSI, LQI 값을 이용하여 노드간 무선 링크 품질을 모니터링하는 응용을 구현하였다. 구현 시나리오는 무선 링크의 비대칭성을 고려하기 위해, 순방향 링크 품질의 경우 센서 플랫폼이 BS로부터 수신한 요구 메시지의 RSSI, LQI 값을 응답 메시지에 캡슐화하여 BS로 전송하도록 하였고, 역방향 링크 품질의 경우 BS가 센서 플랫폼으로부터 수신한 응답 메시지의 RSSI, LQI 값을 기반으로 하였다. 또한 BS로 취합된 이러한 두 링크 품질을 PC상에 시각적으로 표시하기 위해 자바 기반의 링크 품질을 모니터링하는 응용을 구현하였다. 간단한 실험을 통해 RSSI, LQI로 얻은 무선 링크의 품질과 특성을 확인하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06b
• /
• pp.403-405
• /
• 2006

Java 2에서는 자원의 접근관리를 위하여 정책파일에 근거한 스택 인스펙션(stack Inspection)기법을 제공하고 있다. 본 논문에서는 스택 인스펙션에 자연스럽게 접근하여 불필요한 권한검사 집합을 구하기 위해 역방향 흐름분석(backward flow analysis) 기법을 사용한 권한검사 시스템을 구현하였다. 이를 통해 정책파일의 내용에 근거하여 각 메소드에서 항상 성공하거나 실패하는 권한검사를 결정하여 보여준다. 또한 권한검사에 대해서 스택 인스펙션하는 과정을 추적해볼 수 있다. 본 시스템을 이용하는 사용자는 불필요한 권한검사를 제거하여 스택 인스펙션을 최적화하거나, 자신의 프로그램에 적절한 보안정책을 세우기 위해 정책파일을 수정하는데 이 분석결과를 활용할 수 있다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.8
• /
• pp.14-25
• /
• 2002

In this paper, we propose a modified AFC algorithm which is suitable for the implementation of WCDMA reverse link receiver modem. To reduce the complexity, the modified CP-FDD algorithm named 'Normalized CP-FDD' is applied to the AFC loop. The proposed FDD algorithm overcomes the conventional CP-FDD's sensitivity to the variance of input signal amplitude and increases the linear range of S -curve. Therefore, offset frequency estimation using the proposed scheme can be more stable than the conventional method. Unlike IS-95, since pilot symbol in WCDMA is not transmitted continuously, we introduce a moving average filter at the FDD input to increase the number of cross-product. So, tracking speed and stability are improved. For more rapid frequency acquisition and tracking, we adopt a multi-stage tracking mode. Using NCO having ROM table structure, the frequency offset is compensated. We applied the proposed algorithm in the implementation of WCDMA base station modem successfully.

• The KIPS Transactions:PartB
• /
• v.10B no.6
• /
• pp.657-664
• /
• 2003

Reliable tracking of moving humans is essential to motion estimation, video surveillance and human-computer interface. This paper presents a new approach to human motion tracking that combines appearance-based and model-based techniques. Monocular color video is processed at both pixel level and object level. At the pixel level, a Gaussian mixture model is used to train and classily individual pixel colors. At the object level, a 3D human body model projected on a 2D image plane is used to fit the image data. Our method does not use inverse kinematics due to the singularity problem. While many others use stochastic sampling for model-based motion tracking, our method is purely dependent on nonlinear programming. We convert the human motion tracking problem into a nonlinear programming problem. A cost function for parameter optimization is used to estimate the degree of the overlapping between the foreground input image silhouette and a projected 3D model body silhouette. The overlapping is computed using computational geometry by converting a set of pixels from the image domain to a polygon in the real projection plane domain. Our method is used to recognize various human motions. Motion tracking results from video sequences are very encouraging.

• Journal of Satellite, Information and Communications
• /
• v.4 no.2
• /
• pp.39-45
• /
• 2009

This paper proposes the specific code synchronization technique for DS-SS(Direct Sequence-Spread Spectrum transmission in the DVB-RCS +M standard. DS-SS is better than multi-carrier transmission method under nonlinear channel but imposes a long acquisition time. To improve the synchronization aspect, the robust correlation structure is introduced for acquisition and the nonlinear delay lock loop is done for tracking. MAT(Mean Acquisition Time) performances is shown to validate its superiority. In addition, code tracking and jitter performances are done when code tracking algorithm based on 2 oversamples which is not influenced by sampling clock timing offset and carrier freq. offset is used.

• Journal of KIISE
• /
• v.43 no.10
• /
• pp.1104-1114
• /
• 2016

Software is continuously changing during development and after development. When a change is required, it is difficult to precisely grasp the scope of impact intuitively. A systematic method is needed to accomplish the required change. The purpose of impact analysis on software change is to avoid missing any information by recognizing the ripple effect that the change might cause. This paper proposes a dynamic method that can easily identify the scope of change request by using the association between use-case scenarios and artifacts of UML modeling in object-oriented development environment. By using this approach, the scope of impact that the change might have on other components such as class diagram and sequence diagram in use-case scenarios can be identified by forward tracing. In addition, analysis of influence of possible further changes due to changes in other components can be identified iteratively through backward tracing. The results of this paper are not limited to impact analysis on artifacts and change type. They can also be used as basic guidelines during impact analysis for various change requests.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.4
• /
• pp.95-102
• /
• 2022

This paper proposed a linear time algorithm for a three-partition problem(TPP) in which a polynomial time algorithm is not known as NP-complete. This paper proposes a backtracking method that improves the problems of not being able to obtain a solution of the MM method using the sum of max-min values and third numbers, which are known polynomial algorithms in the past. In addition, the problem of MM applying the backtracking method was improved. The proposed algorithm partition the descending ordered set S into three and assigned to the forward, backward, and best-fit allocation method with maximum margin, and found an optimal solution for 50.00%, which is 5 out of 10 data in initial allocation phase. The remaining five data also showed performance to find the optimal solution by exchanging numbers between surplus boxes and shortage boxes at least once and up to seven times. The proposed algorithm that performs simple allocation and exchange optimization with less O(k) linear time performance complexity than the three-partition m=n/3 data, and it was shown that there could be a polynomial time algorithm in which TPP is a P-problem, not NP-complete.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2020.06a
• /
• pp.202-202
• /
• 2020

산지 및 도시에서 발생하는 돌발홍수가 대상인 예경보는 홍수 도달시간이 짧고, 수위가 급격하게 상승하는 특성 때문에 1시간 선행시간 확보를 목표로 한다(MOLIT, 2016). 그러나 현재 돌발홍수 예경보 process에 소요되는 시간은 그 이상으로 확인되고 있다. 또한, 돌발홍수 예경보시스템으로부터 출력된 예측 결과를 사람이 직접 확인해야 한다는 단점도 있다. 본 연구에서는 돌발홍수 예경보 선행시간 1시간 확보를 목표로 backward-forward tracking 기법 기반 예측강우 편의보정기법을 제안하고자 한다. 이 기법은 현재 시점보다 이전에 보정계수를 결정함으로써 돌발홍수 예경보 소요시간을 크게 줄여 돌발홍수 대피시간을 확보할 수 있게 한다. 또한, 보정계수의 결정과 적용이 연속적으로 이루어짐에 따라 10분 간격으로 생성되는 MAPLE의 지속적인 편의보정이 가능하다. 예측강우에 대한 보정계수는 현재보다 10분 이전에 결정한다. 즉, 10분 이전 시점에 생성된 10분, 70분 선행 예측강우에 backward tracking을 적용하여 현재 시점의 호우 위치인 target window를 찾는다. 그리고 target window에서 보정계수를 결정한다. 결정된 보정계수는 돌발홍수발령 대상지역인 correction window의 현재 생성된 60분 선행 예측강우에 적용한다. 이 과정에서 과거 시점 10분 선행 예측강우와 현재 시점에 생성된 60분 선행 예측강우와의 forward tracking이 수행된다. Storm tracking 기법으로는 두 예측강우의 호우패턴에 대한 유사성을 정량화한 패턴상관계수를 이용하였다. 대상 호우사상으로는 2016년에 발생한 주요 호우사상을 선정하였다. 본 연구에서 제안하는 기법을 적용하고, 편의보정 결과를 기존 편의보정기법 적용 결과와 비교하였다.