• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.3
• /
• pp.443-454
• /
• 2020

The JavaScript engine is a module that receives JavaScript code as input and processes it, among many functions that are loaded into web browsers and display web pages. Many fuzzing test studies have been conducted as vulnerabilities in JavaScript engines could threaten the system security of end-users running JavaScript through browsers. Some of them have increased fuzzing efficiency by guiding test coverage in JavaScript engines, but no coverage guided fuzzing of optimized, dynamically generated machine code was attempted. Optimized JavaScript codes are difficult to perform sufficient iterative testing through fuzzing due to the function of runtime guards to free the code in the event of exceptional control flow. To solve these problems, this paper proposes a method of performing fuzzing tests on optimized machine code by avoiding deoptimization. In addition, we propose a method to measure the coverage of runtime-guards by the dynamic binary instrumentation and to guide increment of runtime-guard coverage. In our experiment, our method has outperformed the existing method at two measures: runtime coverage and iteration by time.

• Journal of the Korean Geographical Society
• /
• v.43 no.2
• /
• pp.220-234
• /
• 2008

In many security monitoring contexts, the performance or efficiency of surveillance sensors/networks based on a single sensor type may be limited by environmental conditions, like illumination change. It is well known that different modes of sensors can be complementary, compensating for failures or limitations of individual sensor types. From a location analysis and modeling perspective, a challenge is how to locate different modes of sensors to support security monitoring. A coverage-based optimization model is proposed as a way to simultaneously site k different sensor types. This model considers common coverage among different sensor types as well as overlapping coverage for individual sensor types. The developed model is used to site sensors in an urban area. Computational results show that common and overlapping coverage can be modeled simultaneously, and a rich set of solutions exists reflecting the tradeoff between common and overlapping coverage.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.848-850
• /
• 2014

Mobile Ad hoc Networks(MANET) is consist of node that has mobility, MANET build cluster formation for using energy efficient. In existing LEACH algorithm elect cluster head node in coverage area by distribution function. However, when the cluster head node, that elected by distribution function, is divided coverage area unevenly, the network can't consumption energy efficiency. To solve this problem, we proposed CSWC(Coverage Scheduling Weight-value Control) algorithm. When the coverage area is divided nonchalance, proposed algorithm increased number of hops, that determines coverage area, for balance coverage area. As the result proposed algorithm is set balance coverage area, the network consumption energy efficiency.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.116-119
• /
• 2015

In this paper we propose an algorithm for environment monitoring using multiple mobile sensor (MS) nodes. Our focus is on maximizing sensing coverage of a group of MS nodes for monitoring a phenomenon in an unknown and open area over time. In the proposed algorithm, MS nodes are iteratively relocated to new positions at which a higher sensing coverage can be obtained. We formulated an integer linear programming (ILP) optimization problem to find the optimal positions for MS nodes with the objective of coverage maximization. The performance evaluation was performed to confirm that the proposed algorithm can enable MS nodes to relocate to high interest positions, and obtain a maximum sensing coverage.

• 한국경영정보학회:학술대회논문집
• /
• 2007.11a
• /
• pp.605-610
• /
• 2007

사례기반추론(CBR)은 많은 장점으로 인해, 생산, 재무, 마케팅 등의 분야의 다양한 경영의사결정문제 해결에 적용되어 왔다. 그러나, 효과적인 CBR 시스템을 설계, 구축하기 위해서는 연구자가 직관적으로 설정해야 할 많은 변수들이 존재한다. 본 연구에서는 이러한 CBR의 여러 설계요소들 중, '결합할 유사사례의 선택' 과 관련해, CBR이 보다 개선된 형태로 경영문제 해결에 응용될 수 있는 모형을 제시하고 있다. 본 연구의 제안모형은 결합할 유사사례를 선택하는 기준으로 특정 사례수(k-NN)나 유사도의 상대적 비율을 사용하는 기존의 CBR과 달리 0에서 1사이의 값을 갖는 절대적 유사 임계치를 적용하고 있다. 다만, 절대적 유사 임계치를 사용할 때, 그 값이 작아질 경우 예측결과의 생성이 과도하게 이루어지지 않을 수 있는 문제를 해결하기 위해, 커버리지를 모형에 함께 반영하여 사용자가 원하는 수준의 커버리지는 유지한 상태에서 가장 효과적인 유사 사례를 찾아, 추론을 수행할 수 있도록 설계하였다. 제안모형을 검증하기 위해, 본 연구에서는 이 모형을 실제 인터넷 쇼핑몰의 고객 발굴 사례에 적용해 보았다. 이를 통해, 제안모형의 적용가능성을 확인하고, 향후 추가연구가 요구되는 개선방향을 고찰해 보았다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.1
• /
• pp.18-25
• /
• 2013

In this paper, we propose a self-optimization scheme for indoor femtocell coverage in heterogeneous networks. If the femtocell coverage is larger than indoor area, neighbor cell users passing by the outer area of the femtocell coverage may request an unnecessary handover which incurs wasteful signaling overhead. On the other hand, if the coverage is smaller than the indoor area, some of indoor users might not be connected to the indoor femtocell. Therefore, we propose the method by which the femtocell coverage attains the exact indoor area employing self-organized scheme. Autonomous self TX power adjustment of the femtocell is possible because the proposed method utilizes handover request events and membership information of users that can be obtained by the femtocell itself. We show that the TX power obtained by the proposed algorithm converges to the optimal TX power that can be obtained analytically to attain the indoor coverage area.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.10a
• /
• pp.54-55
• /
• 2016

무선 센터 네트워크 환경과 이동성을 지원하는 MANET이 결합된 환경에서 센서 커버리지 최대화 문제는 해결해야 할 중요한 문제 중 하나이다. 이 문제를 해결하기 위해 기존 연구에서는 자가 조직의 방식으로 노드 이동에 대하여 자가 결정, 근접 노드 검색, 노드 이동의 단계를 수행하는 알고리즘이 제시되었다. 하지만 기존 연구의 방식으로는 이미 노드의 배치가 최적화된 상태에서는 효과적이지 않다는 문제점을 가지고 있다. 이 논문에서는 기존 MANET 센서 커버리지 최대화 알고리즘의 문제점을 상세히 분석하고, 이 문제점을 해결하기 위한 해결 방안을 제시한다. 문제점을 제시하기 위해 MANET 환경을 모의구성하고 성능 실험을 실시하였다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.3
• /
• pp.406-412
• /
• 2010

In this paper, we formally define the problem of maximizing the coverage of sensor deployment, which is the optimization problem appeared in real-world sensor deployment, and analyze the properties of its solution space. To solve the problem, we proposed novel genetic algorithms, and we could show their superiority through experiments. When applying genetic algorithms to maximum coverage sensor deployment, the most important issue is how we evaluate the given sensor deployment efficiently. We could resolve the difficulty by using Monte Carlo method. By regulating the number of generated samples in the Monte Carlo evaluation of genetic algorithms, we could also reduce the computing time significantly without loss of solution quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.7B
• /
• pp.567-574
• /
• 2008

In this paper, we propose an optimal coverage extension scheme in the OFDMA based mobile multi-hop relay system. First, we propose an optimal frequency and time assignment scheme for maximizing system throughput and analyze the frame efficiency of schemes. Then, under the given BS capacity, we find the maximum number of relay hops that can be used to estimate the maximum coverage area of a BS in a multi-hop relay system. Analytical results show that the proposed scheme is efficient in coverage extension and throughput maximization in OFDMA based multi-hop relay system. Our work may be a rough guideline to control the parameters for multi-hop relay system optimization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10B
• /
• pp.911-918
• /
• 2008

In this paper, we propose new cell structures using multi-hop Relay Station(RS) based on IEEE802.16j in Narrow-Beam Trisector Cell (NBTC) and Wide-Beam Trisector Cell (WBTC), which are two methods for cell sectorization using 3-sector directional antennas. Then, we analyze our proposed structures compared with the existing system which does not use any RS about the numbers of optimized Base Station (BS) and multi-hop relay, the extended BS coverage, and the deployment cost according to the traffic density using optimization model. According to the results, we know the reduction of total deployment cost of the proposed systems and that WBTC is suitable when the traffic density is high and NBTC is suitable when the traffic density is low in our proposed multi-hop based NBTC and WBTC structures.