• 제목/요약/키워드: Time-Dependent Network

검색결과 261건 처리시간 0.149초

SYN Flood DoS Detection System Using Time Dependent Finite Automata

  • Noura AlDossary;Sarah AlQahtani;Reem Alzaher;Atta-ur-Rahman
    • International Journal of Computer Science & Network Security
    • /
    • 제23권6호
    • /
    • pp.147-154
    • /
    • 2023
  • Network intrusion refers to any unauthorized penetration or activity on a computer network. This upsets the confidentiality, integrity, and availability of the network system. One of the major threats to any system's availability is a Denial-of-Service (DoS) attack, which is intended to deny a legitimate user access to resources. Therefore, due to the complexity of DoS attacks, it is increasingly important to abstract and describe these attacks in a way that will be effectively detected. The automaton theory is used in this paper to implement a SYN Flood detection system based on Time-Dependent Finite Automata (TDFA).

전자기 과도현상 해석을 위한 S 영역 등가시스템 PART I : 주파수 의존 시스템 등가 (S-Domain Equivalent System for Electromagnetic Transient Studies PART I : Frequency Dependent Network Equivalent)

  • 왕용필
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제52권11호
    • /
    • pp.632-638
    • /
    • 2003
  • Modern power systems are very complex and to model them completely is impractical for electromagnetic transient studies. Therefore areas outside the immediate area of interest must be represented by some form of frequency dependent equivalent. The s-domain rational function form of frequency dependent equivalent does not need refitting if the simulation time-step is changed in the electromagnetic transient program. This is because the s-domain rational function coefficients are independent of the simulation time-step, unlike the z-domain rational function coefficients. S-domain rational function fitting techniques for representing frequency dependent equivalents have been developed using Least Squares Fitting(LSF). However it does not suffer the implementation error that exited in this work as it ignored the instantaneous term. This paper Presents the formulation for developing 1 Port Frequency Dependent Network Equivalent(FDNE) with the instantaneous term in S-domain and illustrates its use. This 1 port FDNE have been applied to the CIGRE Benchmark Rectifier test AC system. The electromagnetic transient package PSCAD/EMTDC is used to assess the transient response of the 1 port (FDNE) developed with Thevenin and Norton Equivalent network. The study results have indicated the robustness and accuracy of 1 port FDNE for electromagnetic transient studies.

실제 통행기록 자료를 활용한 고속도로 Corridor 시간대별 O-D 구축 (Construction Method of Time-dependent Origin-Destination Traffic Flow for Expressway Corridor Using Individual Real Trip Data)

  • 유정훈;이무영
    • 대한토목학회논문집
    • /
    • 제31권2D호
    • /
    • pp.185-192
    • /
    • 2011
  • 시간개념을 고려한 교통 분석은 교통류의 이동을 고려함으로써 보다 현실적인 분석 결과를 가져올 수 있다. 본 논문은 실제 개인의 통행기록 자료를 활용하여 고속도로 Corridor를 대상으로 한 시간대별 기종점 통행량 구축 방법론을 개발하였다. 실제 개별 통행기록 자료인 고속도로 TCS 자료를 활용하여 전국 고속도로망을 대상으로 시간대별 O-D를 구축하였으며, 도심지역 분석에 활용도를 높이기 위해 구축된 시간대별 O-D를 Sub-corridor 시간대별 O-D로 전환하기 위한 방법론을 개발하였다. 본 연구는 실제 통행 자료를 활용한 기종점 통행량 구축이라는 점에서 의미를 가지며, 향후 고속도로 이외의 도로를 포함한 동적 기종점 통행량 구축에 관한 연구 및 기존의 통계적 추정을 이용한 O-D 구축방법과의 연계를 통해 교통분석의 주요 입력 자료인 동적 기종점 통행량의 구축이 가능할 것으로 기대한다.

ANALOG COMPUTING FOR A NEW NUCLEAR REACTOR DYNAMIC MODEL BASED ON A TIME-DEPENDENT SECOND ORDER FORM OF THE NEUTRON TRANSPORT EQUATION

  • Pirouzmand, Ahmad;Hadad, Kamal;Suh, Kune Y.
    • Nuclear Engineering and Technology
    • /
    • 제43권3호
    • /
    • pp.243-256
    • /
    • 2011
  • This paper considers the concept of analog computing based on a cellular neural network (CNN) paradigm to simulate nuclear reactor dynamics using a time-dependent second order form of the neutron transport equation. Instead of solving nuclear reactor dynamic equations numerically, which is time-consuming and suffers from such weaknesses as vulnerability to transient phenomena, accumulation of round-off errors and floating-point overflows, use is made of a new method based on a cellular neural network. The state-of-the-art shows the CNN as being an alternative solution to the conventional numerical computation method. Indeed CNN is an analog computing paradigm that performs ultra-fast calculations and provides accurate results. In this study use is made of the CNN model to simulate the space-time response of scalar flux distribution in steady state and transient conditions. The CNN model also is used to simulate step perturbation in the core. The accuracy and capability of the CNN model are examined in 2D Cartesian geometry for two fixed source problems, a mini-BWR assembly, and a TWIGL Seed/Blanket problem. We also use the CNN model concurrently for a typical small PWR assembly to simulate the effect of temperature feedback, poisons, and control rods on the scalar flux distribution.

연속음성중 키워드(Keyword) 인식을 위한 Binary Clustering Network (Binary clustering network for recognition of keywords in continuous speech)

  • 최관선;한민홍
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
    • /
    • pp.870-876
    • /
    • 1993
  • This paper presents a binary clustering network (BCN) and a heuristic algorithm to detect pitch for recognition of keywords in continuous speech. In order to classify nonlinear patterns, BCN separates patterns into binary clusters hierarchically and links same patterns at root level by using the supervised learning and the unsupervised learning. BCN has many desirable properties such as flexibility of dynamic structure, high classification accuracy, short learning time, and short recall time. Pitch Detection algorithm is a heuristic model that can solve the difficulties such as scaling invariance, time warping, time-shift invariance, and redundance. This recognition algorithm has shown recognition rates as high as 95% for speaker-dependent as well as multispeaker-dependent tests.

  • PDF

Modeling sulfuric acid induced swell in carbonate clays using artificial neural networks

  • Sivapullaiah, P.V.;Guru Prasad, B.;Allam, M.M.
    • Geomechanics and Engineering
    • /
    • 제1권4호
    • /
    • pp.307-321
    • /
    • 2009
  • The paper employs a feed forward neural network with back-propagation algorithm for modeling time dependent swell in clays containing carbonate in the presence of sulfuric acid. The oedometer swell percent is estimated at a nominal surcharge pressure of 6.25 kPa to develop 612 data sets for modeling. The input parameters used in the network include time, sulfuric acid concentration, carbonate percentage, and liquid limit. Among the total data sets, 280 (46%) were assigned to training, 175 (29%) for testing and the remaining 157 data sets (25%) were relegated to cross validation. The network was programmed to process this information and predict the percent swell at any time, knowing the variable involved. The study demonstrates that it is possible to develop a general BPNN model that can predict time dependent swell with relatively high accuracy with observed data ($R^2$=0.9986). The obtained results are also compared with generated non-linear regression model.

복합교통망에서의 동적K최소시간경로탐색 (Finding the Time Dependent K Least Time Paths in Intermodal Transportation Networks)

  • 조종석;신성일;임강원;문병섭
    • 대한교통학회지
    • /
    • 제24권5호
    • /
    • pp.77-88
    • /
    • 2006
  • 본 연구는 복합교통망의 실시간적 운영전략에 활용 가능한 동적 K최소시간경로탐색알고리즘을 제안하는 것을 목적으로 한다. 이를 위해 정적 K경로탐색에 적용되었던 전체경로삭제방안을 동적 최적경로탐색알고리즘에 확장 적용함으로써 복합교통망에서 시간종속적으로 변화하는 수단-링크 통행시간과 수단-링크간의 환승비용에 기초하여 경로를 순차적으로 탐색하는 K경로알고리즘을 제시하였다. 특히, 링크기반동적표지를 적용함으로써 수단간 환승시 발생되는 환승이동, 환승대기 및 기타 환승행태를 용이하게 모사하면서 최적해를 도출하도록 하였다. 최적식과 함께 제시된 알고리즘은 복잡도계산을 통해 효율성을 살펴보았으며. 버스와 지하철로 구성된 소규모 가상네트워크에 대해 적용해 봄으로써 알고리즘의 검증 및 활용성을 검토해 보았다.

MODELS AND SOLUTION METHODS FOR SHORTEST PATHS IN A NETWORK WITH TIME-DEPENDENT FLOW SPEEDS

  • Sung, Ki-Seok;Bell, Michael G-H
    • Management Science and Financial Engineering
    • /
    • 제4권2호
    • /
    • pp.1-13
    • /
    • 1998
  • The Shortest Path Problem in Time-dependent Networks, where the travel time of each link depends on the time interval, is not realistic since the model and its solution violate the Non-passing Property (NPP:often referred to as FIFO) of real phenomena. Furthermore, solving the problem needs much more computational and memory complexity than the general shortest path problem. A new model for Time-dependent Networks where the flow speeds of each link depend on time interval, is suggested. The model is more realistic since its solution maintains the NPP. Solving the problem needs just a little more computational complexity, and the same memory complexity, as the general shortest path problem. A solution algorithm modified from Dijkstra's label setting algorithm is presented. We extend this model to the problem of Minimum Expected Time Path in Time-dependent Stochastic Networks where flow speeds of each link change statistically on each time interval. A solution method using the Kth-shortest Path algorithm is presented.

  • PDF

Scheduling algirithm of data sampling times in the real-time distributed control systems

  • Hong, Seung-Ho
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 19-21 Oct. 1992
    • /
    • pp.112-117
    • /
    • 1992
  • The Real-time Distributed Control Systems(RDCS) consist of several distributed control processes which share a network medium to exchange their data. Performance of feedback control loops in the RDCS is subject to the network-induced delays from sensor to controller and from controller to actuator. The network-induced delays are directly dependent upon the data sampling times of the control components which share a network medium. In this study, a scheduling algorithm of determining data sampling times is developed using the window concept, where the sampling data from the control components dynamically share a limited number of windows.

  • PDF

최적제어이론을 이용한 동적 통행배정 모형의 적용에 관한 연구 (An Application of Dynamic Route Choice Model Using Optimal Control Theory)

  • 전경수;오세현
    • 대한교통학회지
    • /
    • 제13권4호
    • /
    • pp.5-29
    • /
    • 1995
  • Advanced Traveler Inoformation Systems*ATIS) , as a subsystem of ITS influence the travel choices of dreivers by providing them with historical, real-time and predictive information to supprot travel decisions and consequently improves the speed and quality of travel. For thesuccessul accomplishment of ATIS, the time-dependent variations of traffic in a road network and travel times of vehicles during their journey must be predicted . The purpose of this study is to evaluate the past developments in the dynamic route choice models and to apply the instantaneous dynamic user optimal route choice model. recently formulated with flow propagation constraints by Ran, Boyce and LeBlanc, to the real transportation network of Seocho-Ku in Seoul. As input data for this application, the time-dependent travel rates are estimated and the link travel time function is derived. The modelis validated from three view points : the efficiency of model itself the ability to predict traffic volume and travel time on links, and the optimal traffic control.

  • PDF