• Title/Summary/Keyword: Path detection

Search Result 523, Processing Time 0.029 seconds

A Stock Removal Cycle with Collision Detection Function for Turning Operation (충돌회피 기능을 가진 선삭용 황정삭 싸이클)

  • 임상묵;강성균;최종률
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1995.10a
    • /
    • pp.1050-1053
    • /
    • 1995
  • A stock removal cycle is developed as a programming tool of the CNC lathe. This cycle support the easiness and swifness of a part program generation in the shopfloor. The cycle contains the function of tool path generation of rough/finish cutting, of avoidance air-cut for non-cylindrical (die-casted, forged) workpiece, and of the tool collisopn detection/aviodance. Consequently the intelligent stock removal cycle results in improving the productivity and safety of CNC lathe.

  • PDF

Vulnerable Path Attack and its Detection

  • She, Chuyu;Wen, Wushao;Ye, Quanqi;Zheng, Kesong
    • 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.

A New Double-Talk Detection Algorithm (새로운 동시통화 검출 알고리즘)

  • Jung, Hong-Hee;Kim, Hyun-Tae;Park, Jang-Sik;Son, Kyung-Sik
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.3
    • /
    • pp.281-291
    • /
    • 2008
  • In this paper, we propose a new double talk detection algorithm which detects near end signals with less degradation, tracking echo path variation of echo canceler simultaneously. Our method makes use of a cross-correlation between channel input signals and estimated error signals and a normalized cross-correlation between microphone input signals and estimated error signals. By combing thresholds for these cross-correlations pertinently, this algorithm discriminates between variation of echo path and occurrence of double talk. These two cross-correlation are used to detect double talk periods, tracking echo path variation. During the detection period, adjustive adaptive filter is ceased to prevent the echo canceler from being disturbed by near end signals. Also, the echo canceler will still be kept on for tracking any variation in echo path. Through computer simulation results, it was confirmed that the proposed algorithm shows better performance, tracking echo path variation and detecting the double talk periods, than the Ye et. al's and the NLMS algorithms from ERLE viewpoint.

  • PDF

Efficient robust path delay fault test generation for combinational circuits using the testability measure (테스트 용이도를 이용한 조합회로의 효율적인 로보스트 경로 지연 고장 테스트 생성)

  • 허용민;임인칠
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.2
    • /
    • pp.205-216
    • /
    • 1996
  • In this paper we propose an efficient robust path delay fault test genration algorithm for detection of path delay faluts in combinational ligic circuits. In the proposed robust test genration approach, the testability measure is computed for all gates in the circuit under test and these computed values are used to genrate weighted random delay test vetors for detection of path delay faults. For genrated robust test vectors, we perform fault simulation on ISCAS '85 benchmark circuits using parallel pattern technqieus. The results indicate that the proposed test genration method not only increases the number of detected robust path delay faults but also reduces the time taen to genrate robust tests.

  • PDF

A Study on the Tool Interference Detection and Tool Path Correction in Compound Surface Machining (복합곡면 가공시 공구간섭의 탐지와 공구경로 수정에 관한 연구)

  • 조명우
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.8 no.6
    • /
    • pp.105-112
    • /
    • 1999
  • In this paper we deal with tool interference problem in the case of compound surface machining. A new tool interference detection and correction method based on the envelope of the tool path is suggested to identify and correct the tool interference - not only within the local path of tool movement, but also outside of the tool path. Therefore, the developed strategy can be used to check the possible interference in any region of the surface. In order to analyze quantitatively the milled surface error produced by the tool interference, improved surface prediction model is also suggested in cutting process by general cutters. The effectiveness of the proposed method is demonstrated through simulation study.

  • PDF

Development of a Frontal Collision Detection Algorithm Using Laser Scanners (레이져 스캐너를 이용한 전방 충돌 예측 알고리즘 개발)

  • Lee, Dong-Hwi;Han, Kwang-Jin;Cho, Sang-Min;Kim, Yong-Sun;Huh, Kun-Soo
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.20 no.3
    • /
    • pp.113-118
    • /
    • 2012
  • Collision detection plays a key role in collision mitigation system. The malfunction of the collision mitigation system can result in another dangerous situation or unexpected feeling to driver and passenger. To prevent this situation, the collision time, offset, and collision decision should be determined from the appropriate collision detection algorithm. This study focuses on a method to determine the time to collision (TTC) and frontal offset (FO) between the ego vehicle and the target object. The path prediction method using the ego vehicle information is proposed to improve the accuracy of TTC and FO. The path prediction method utilizes the ego vehicle motion data for better prediction performance. The proposed algorithm is developed based on laser scanner. The performance of the proposed detection algorithm is validated in simulations and experiments.

Optimal Path Finding Considering Smart Card Terminal ID Chain OD - Focused on Seoul Metropolitan Railway Network - (교통카드 단말기ID Chain OD를 반영한 최적경로탐색 - 수도권 철도 네트워크를 중심으로 -)

  • Lee, Mee Young
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.17 no.6
    • /
    • pp.40-53
    • /
    • 2018
  • In smart card data, movement of railway passengers appears in order of smart card terminal ID. The initial terminal ID holds information on the entering station's tag-in railway line, the final terminal ID the exit station tag-out railway line, and the middle terminal ID the transfer station tag subway line. During the past, when the metropolitan city rail consisted of three public corporations (Seoul Metro, Incheon Transit Corporation, and Korail), OD data was expressed in two metrics of initial and final smart card terminal ID. Recently, with the entrance of private corporations like Shinbundang Railroad Corporation, and UI Corporation, inclusion of entering transfer line terminal ID and exiting transfer line terminal ID as part of Chain OD has become standard. Exact route construction using Chain OD has thus become integral as basic data for revenue allocation amongst metropolitan railway transport corporations. Accordingly, path detection in railway networks has evolved to an optimal path detection problem using Chain OD, hence calling for a renewed solution method. This research proposes an optimal path detection method between the initial terminal ID and final terminal ID of Chain OD terminal IDs within the railway network. Here, private line transfer TagIn/Out must be reflected in optimal path detection using Chain OD. To achieve this, three types of link-based optimum path detection methods are applied in order of 1. node-link, 2. link-link, 3. link-node. The method proposed based on additional path costs is shown to satisfy the optimal conditions.

Obstacle Detection using Laser Scanner and Vision System for Path Planning on Autonomous Mobile Agents (무인 이동 개체의 경로 생성을 위한 레이저 스캐너와 비전 시스템의 데이터 융합을 통한 장애물 감지)

  • Jeong, Jin-Gu;Hong, Suk-Kyo;Chwa, Dong-Kyoung
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.7
    • /
    • pp.1260-1272
    • /
    • 2008
  • This paper proposes object detection algorithm using laser scanner and vision system for the path planning of autonomous mobile agents. As the scanner-based method can observe the obstacles in only two dimensions, it is hard to detect the shape and the number of obstacles. On the other hand, vision-based method is sensitive to the environment and has its difficulty in the accurate distance measurement. Thus, we combine these two methods based on K-means algorithm such that the obstacle avoidance and optimal path planning of autonomous mobile agents can be achieved.

Measure of Effectiveness for Detection and Cumulative Detection Probability (탐지효과도 및 누적탐지확률)

  • Cho, Jung-Hong;Kim, Jea Soo;Lim, Jun-Seok;Park, Ji-Sung
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.15 no.5
    • /
    • pp.601-614
    • /
    • 2012
  • Since the optimized use of sonar systems available for detection is a very practical problem for a given ocean environment, the measure of mission achievability is needed for operating the sonar system efficiently. In this paper, a theory on Measure Of Effectiveness(MOE) for specific mission such as detection is described as the measure of mission achievability, and a recursive Cumulative Detection Probability(CDP) algorithm is found to be most efficient from comparing three CDP algorithms for discrete glimpses search to reduce computation time and memory for complicated scenarios. The three CDPs which are MOE for sonar-maneuver pattern are calculated as time evolves for comparison, based on three different formula depending on the assumptions as follows; dependent or independent glimpses, unimodal or non-unimodal distribution of Probability of Detection(PD) as a function of observation time interval for detection. The proposed CDP algorithm which is made from unimodal formula is verified and applied to OASPP(Optimal Acoustic Search Path Planning) with complicated scenarios.

Mobile Robot Path Finding Using Invariant Landmarks

  • Sharma, Kajal
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.5 no.3
    • /
    • pp.178-184
    • /
    • 2016
  • This paper proposes a new path-finding scheme using viewpoint-invariant landmarks. The scheme introduces the concept of landmark detection in images captured with a vision sensor attached to a mobile robot, and provides landmark clues to determine a path. Experiment results show that the scheme efficiently detects landmarks with changes in scenes due to the robot's movement. The scheme accurately detects landmarks and reduces the overall landmark computation cost. The robot moves in the room to capture different images. It can efficiently detect landmarks in the room from different viewpoints of each scene. The outcome of the proposed scheme results in accurate and obstacle-free path estimation.