• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.2149-2170
• /
• 2017

Application-layer Distributed Denial-of-Service (DDoS) attack is one of the leading security problems in the Internet. In recent years, the attack strategies of application-layer DDoS have rapidly developed. This paper introduces a new attack strategy named Path Vulnerabilities-Based (PVB) attack. In this attack strategy, an attacker first analyzes the contents of web pages and subsequently measures the actual response time of each webpage to build a web-resource-weighted-directed graph. The attacker uses a Top M Longest Path algorithm to find M DDoS vulnerable paths that consume considerable resources when sequentially accessing the pages following any of those paths. A detection mechanism for such attack is also proposed and discussed. A finite-state machine is used to model the dynamical processes for the state of the user's session and monitor the PVB attacks. Numerical results based on real-traffic simulations reveal the efficiency of the attack strategy and the detection mechanism.

• Proceedings of the KIEE Conference
• /
• 2003.11b
• /
• pp.219-222
• /
• 2003

본 논문에서는 주어진 자동화 시스템에 대하여 Critical Path 기법을 적용한 최적화 연구를 수행하였다. 탄약 운반 자동화 시스템에 대하여 공정순서와 시간개념이 들어간 Timed Petri-Net을 이용한 이산사건 공정모델을 구축하였으며, 이를 기초로 초기조건 및 제약조건을 고려하여 제악탐색기법을 이용하여 Critical Path를 찾고 여유 공정을 산출항으로써 공정 시간 최적화를 수행하였다.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.9
• /
• pp.1-10
• /
• 1998

This paper is to propose an algorithm named as DYSAC to find the critical path(the longest sensitizable path) in a large digital circuit, whose purpose is to reduce the time to find critical path and to find critical paths of the circuits for which the previous methods could not find one. Also a set of path sensitization criteria named as DYPSEC is proposed, which is used to select a path from input to the output inside the DYSAC. The DYSAC consists of two sub-algorithms; the level assignment algorithm to assign a level to each node and the critical path selection algorithm to select the sensitizable path. The proposed algorithm was implemented with C-language on SUN Sparc and applied to the ISCAS'85 benchmark circuits to make sure if it works correctly and finds the correct critical path. Also, the results from the experiments were compared to the results from the previous works. The comparison items were the ability to find the critical path and the speed, in both of which the proposed algorithm in this paper shows better results than others.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2014.10a
• /
• pp.292-293
• /
• 2014

Transfer Path Analysis is technique predicting transmitted energy through each path. Using the Transfer Path Analysis, structure-borne noise and air-borne noise can be predicted from the system. In this study, however, the Transfer Path Analysis to target only the structure-borne noise due to the noise radiated from the vibrating panel was performed. Predicted noise by the Transfer Path Analysis and measured noise by the experiment were a high correlation. We confirmed the validity of the Transfer Path Analysis through the analysis of these results, showed how to apply the Transfer Path Analysis.

• Journal of Astronomy and Space Sciences
• /
• v.25 no.4
• /
• pp.491-504
• /
• 2008

CSSA (Coarse Sun Sensor Assembly) is the essential sensor for satellite attitude control. CSSA measures the direction of the sun's rays and determines whether the satellite is in the ellipse. The paper shows the development process and test results of Path-finder & Qualified Model CSSA as the preceding development in order to develop the CSSA for low earth orbit satellite. We needs the definite and precision procedure and lots of experience. This paper shows that we can improve those through the development of Path-finder and Qualified Model CSSA. Therefore, we can obtain the results to meet the functional requirement.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.131.4-131
• /
• 2001

A lot of path planning algorithms have been developed to find the collision-free path with minimum cost. But most of them require complicated computations. In this paper, a thinning method, which is one of the image processing schemes, was adopted to simplify the path planning procedure. In addition, critical points are used to find the shortest-distance path among all possible paths from the start to the goal point. Since the critical points contain the information on the neighboring paths, a new path can be quickly obtained on the map even when the start and goal points change. To investigate the validity of the proposed algorithm, various simulations have been performed for the environment where the obstacles with arbitrary shapes exist. It is shown that the optimal paths can be found with relative easiness.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3100-3116
• /
• 2016

With the rapid development of urban traffic system and fast increasing of vehicle numbers, the traditional centralized ways to generate the source-destination shortest path in terms of travel time(the optimal path) encounter several problems, such as high server pressure, low query efficiency, roads state without in-time updating. With the widespread use of smart cameras in the urban traffic and surveillance system, this paper maps the optimal path finding problem in the dynamic road network to the shortest routing problem in the smart camera networks. The proposed distributed optimal path generation algorithm employs the delay routing and caching mechanism. Real-time route update is also presented to adapt to the dynamic road network. The test result shows that this algorithm has advantages in both query time and query packet numbers.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.826-829
• /
• 1995

In this paper, the problem of minimum-time trajectory planning of a robot manipulator with an arbitrary path is dealt. As for a straight path, the trajectory planning can be done without difficulty since the path is easily parameterized by its length. However, this is not the case for a non-straight path. In this paper, by noting that the others' joint angles and velocities are determined if one joint's angle and velocity are known, we reduce the problem of trajectory planning on a non-straight path to one in the 2-dimensional space of one joint's angle and velocity. Then, by applying the dynamic programming, we achieve the minimum-time trajectory planning. A simulation is done for verifying this.

• Journal of Aerospace System Engineering
• /
• v.8 no.4
• /
• pp.32-38
• /
• 2014

Sufficient energy charging during a day is essential for a solar-powered long-endurance aircraft. Variations of flight path that is superior to a basic circle path are sought in this study for more efficient charging. Flight path associated with roll and pitch attitudes are investigated. It seems that the pitch angle can play more important role than the roll angle for the solar charging efficiency. Thus, more energy charging is observed when the entire flight path is tilted toward the direction of the sun.

• Journal of Ocean Engineering and Technology
• /
• v.20 no.1 s.68
• /
• pp.69-76
• /
• 2006

The design of efficient search path to maximize the Cumulative Detection Probability(CDP) is mainly dependent on experience and intuition when searcher detect the target using SONAR in the ocean. Recently with the advance of modeling and simulation method, it has been possible to access the optimization problems more systematically. In this paper, a method for the optimal search path calculation is developed based on the combination of the genetic algorithm and the calculation algorithm for detection range. We consider the discrete system for search path, space, and time, and use the movement direction of the SONAR for the gene of the genetic algorithm. The developed algorithm, OASPP(Optimal Acoustic Search Path Planning), is shown to be effective, via a simulation, finding the optimal search path for the case when the intuitive solution exists. Also, OASPP is compared with other algorithms for the measure of efficiency to maximize CDP.