• Title/Summary/Keyword: Intersection Graph

Search Result 36, Processing Time 0.02 seconds

An Optimized Direction Parallel Tool Path Generation for Rough Machining (황삭 가공을 위한 최적 직선 평행 공구경로 생성)

  • Kim, Hyun-Chul
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.32 no.9
    • /
    • pp.761-769
    • /
    • 2008
  • The majority of mechanical parts are manufactured by milling machines. Hence, geometrically efficient algorithms for tool path generation and physical considerations for better machining productivity with guarantee of machining safety are the most important issues in milling tasks. In this paper, an optimized path generation algorithm for direction parallel milling which is commonly used in the roughing stage is presented. First of all, a geometrically efficient tool path generation algorithm using an intersection points-graph is introduced. Although the direction parallel tool path obtained from geometric information have been successful to make desirable shape, it seldom consider physical process concerns like cutting forces and chatters. In order to cope with these problems, an optimized tool path, which maintains constant MRR in order to achieve constant cutting forces and to avoid chatter vibrations at all time, is introduced and the result is verified. Additional tool path segments are appended to the basic tool path by using a pixel based simulation technique. The algorithm has been implemented for two dimensional contiguous end milling operations, and cutting tests are conducted by measuring spindle current, which reflects machining situations, to verify the significance of the proposed method.

Estimation of Unprotected Left-Turn Saturation Flows (비보호 좌회전 포화유률 추정)

  • 김경환
    • Proceedings of the KOR-KST Conference
    • /
    • 1998.10a
    • /
    • pp.236-244
    • /
    • 1998
  • When the capacity and traffic operation at signalized intersections are analyzed in Korea, the unprotected left-turn saturation flow rate, which is an important parameter for the analysis, is estimated form the USHCM model. thus, exact analysis of the left-turn is not possible because of the difference of traffic environments between two contries. In order to improve this problem, it is undertaken in this study to develop techniques for the estimation of unprotected left-turn saturation flows based on Korean drivers' data. As study intersections, signalized or unsignalized intersections on the 6, 4 and 2 lane streets are selected. the data for the saturation flow measurement and gap-acceptance behavior analysis are inputed in a notebook computer on the sites. The critical acceptance gaps of the 6, 4, and 2 lane streets are analyzed to be 6.0 secs, 4.6 secs, and 4.3 secs respectively. the average minimum headway of the left-turn vehicle was observed to be 2.6 secs. As the model to estimate unportected left-turn saturation flows, the drew model is recommended for 6 and 4 lane streets, and a graph is suggested for the 2-lane street. As the values of the parameters of the Drew model, the 2.6 secs of this study is recommended for the average minimum headway of the left-turn. But, the critical acceptance gap varies according to the approach speed of opposing traffic and driver population, it requires field survey to measure the gap of an intersection; however, the values of the gaps studied in this study may be used for the general intersections in urban area in Korean.

  • PDF

B-Corr Model for Bot Group Activity Detection Based on Network Flows Traffic Analysis

  • Hostiadi, Dandy Pramana;Wibisono, Waskitho;Ahmad, Tohari
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.10
    • /
    • pp.4176-4197
    • /
    • 2020
  • Botnet is a type of dangerous malware. Botnet attack with a collection of bots attacking a similar target and activity pattern is called bot group activities. The detection of bot group activities using intrusion detection models can only detect single bot activities but cannot detect bots' behavioral relation on bot group attack. Detection of bot group activities could help network administrators isolate an activity or access a bot group attacks and determine the relations between bots that can measure the correlation. This paper proposed a new model to measure the similarity between bot activities using the intersections-probability concept to define bot group activities called as B-Corr Model. The B-Corr model consisted of several stages, such as extraction feature from bot activity flows, measurement of intersections between bots, and similarity value production. B-Corr model categorizes similar bots with a similar target to specify bot group activities. To achieve a more comprehensive view, the B-Corr model visualizes the similarity values between bots in the form of a similar bot graph. Furthermore, extensive experiments have been conducted using real botnet datasets with high detection accuracy in various scenarios.

Implementation of an Object -Oriented Simulator for the Signal Control of Multiple Crossroads (복합교차로의 신호제어를 위한 객체지향 시뮬레이터 구현)

  • Han, Byeong-Jun;Kim, Jong-Wan
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.5 no.6
    • /
    • pp.719-726
    • /
    • 1999
  • 본 논문은 교통 신호 제어 알고리즘들의 성능을 비교하기 위한 복합교차로 시뮬레이터를 구현하였다. 기존의 교통 시뮬레이터들은 단일교차로를 대상으로 하거나 텍스트 모드로 동작하는 경우가 많았다. 논문의 시뮬레이터는 Visual C++의 MFC 라이브러리를 사용하여 n $\times$ n 형태를 갖는 복합교차로에 적합하도록 객체지향적으로 구현되었으며, 성능 비교를 위하여 제어 알고리즘들을 별개의 윈도우에서 처리하기 쉽도록 MDI 방식을 사용하였다. 개발한 시뮬레이터는 그래프 윈도우와 맵 윈도우의 편리한 사용자 인터페이스, 논리시간 설정을 통한 다목적 시뮬레이션, 다양한 성능평가 출력 등의 특징을 갖는다. Abstract In this paper, we implemented a multiple crossroad simulator to evaluate the performance of the traffic signal control algorithms. Most of existing traffic simulators were operated in text-mode or at a single intersection. We developed the object-oriented simulator suitable for multiple crossroads with n $\times$ n intersections by using MFC (Microsoft Foundation Class) library in Visual C++. The simulator was implemented by using MDI (Multiple Document Interface) scheme in order to process both control algorithms in separate windows respectively. Our simulator has the following features: user friendly interface with graph window and map window, multi-purpose simulations by setting logical time, and various forms of performance evaluation.

Algorithm for Cross-avoidance Bypass Routing in Numberlink Puzzle (숫자 연결 퍼즐에 관한 교차 회피 우회 경로 알고리즘)

  • Sang-Un Lee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.24 no.3
    • /
    • pp.95-101
    • /
    • 2024
  • The numberlink puzzle(NLP), which non-crossings with other numbers of connection in connecting lines through empty cells between a given pair of numbers, is an NP-complete problem with no known way to solve the puzzle in polynomial time. Until now, arbitrary numbers have been selected and puzzles have been solved using trial-and-error methods. This paper converts empty cells into vertices in lattice graphs connected by edge between adjacent cells for a given problem. Next, a straight line was drawn between the pairs of numbers and divided into groups of numbers where crossing occurred. A bypass route was established to avoid intersection in the cross-number group. Applying the proposed algorithm to 18 benchmarking data showed that the puzzle could be solved with a linear time complexity of O(n) for all data.

Breast Radiotherapy with Mixed Energy Photons; a Model for Optimal Beam Weighting

  • Birgani, Mohammadjavad Tahmasebi;Fatahiasl, Jafar;Hosseini, Seyed Mohammad;Bagheri, Ali;Behrooz, Mohammad Ali;Zabiehzadeh, Mansour;meskani, Reza;Gomari, Maryam Talaei
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.16 no.17
    • /
    • pp.7785-7788
    • /
    • 2015
  • Utilization of high energy photons (>10MV) with an optimal weight using a mixed energy technique is a practical way to generate a homogenous dose distribution while maintaining adequate target coverage in intact breast radiotherapy. This study represents a model for estimation of this optimal weight for day to day clinical usage. For this purpose, treatment planning computed tomography scans of thirty-three consecutive early stage breast cancer patients following breast conservation surgery were analyzed. After delineation of the breast clinical target volume (CTV) and placing opposed wedge paired isocenteric tangential portals, dosimeteric calculations were conducted and dose volume histograms (DVHs) were generated, first with pure 6MV photons and then these calculations were repeated ten times with incorporating 18MV photons (ten percent increase in weight per step) in each individual patient. For each calculation two indexes including maximum dose in the breast CTV ($D_{max}$) and the volume of CTV which covered with 95% Isodose line ($V_{CTV,95%IDL}$) were measured according to the DVH data and then normalized values were plotted in a graph. The optimal weight of 18MV photons was defined as the intersection point of $D_{max}$ and $V_{CTV,95%IDL}$ graphs. For creating a model to predict this optimal weight multiple linear regression analysis was used based on some of the breast and tangential field parameters. The best fitting model for prediction of 18MV photons optimal weight in breast radiotherapy using mixed energy technique, incorporated chest wall separation plus central lung distance (Adjusted R2=0.776). In conclusion, this study represents a model for the estimation of optimal beam weighting in breast radiotherapy using mixed photon energy technique for routine day to day clinical usage.