• Title/Summary/Keyword: Time-Dependent Network

Search Result 261, Processing Time 0.024 seconds

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
    • /
    • v.23 no.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-Domain Equivalent System for Electromagnetic Transient Studies PART I : Frequency Dependent Network Equivalent (전자기 과도현상 해석을 위한 S 영역 등가시스템 PART I : 주파수 의존 시스템 등가)

  • 왕용필
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.52 no.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.

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

  • Yu, Jeong Whon;Lee, Mu Young
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.31 no.2D
    • /
    • pp.185-192
    • /
    • 2011
  • More practical outputs and insights can be obtained through transportation analysis considering the time-dependent traffic movements. This study proposes a method of constructing time-dependent O-D trip tables for expressway corridor using real-world individual trip data. In this study, time-dependent O-D trip tables for the nationwide highway network are constructed based on toll collection system data. The proposed methodology is to convert nationwide time-dependent O-D trip tables into Korean expressway corridor O-D trip tables in order to deal with the computational complexity arising from simulating a large-scale traffic network. The experiment results suggest that actual individual trip record data can be used to effectively construct time-dependent O-D trip tables. They also imply that the construction of time-dependent O-D trip tables for the national highway networks along with those for Korean expressway developed in this study would make transportation analysis more practical and applicable to real-time traffic operation and control.

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
    • /
    • v.43 no.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.

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

  • 최관선;한민홍
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1993.10a
    • /
    • 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
    • /
    • v.1 no.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.

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

  • Jo, Jong-Seok;Sin, Seong-Il;Im, Gang-Won;Mun, Byeong-Seop
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.5 s.91
    • /
    • pp.77-88
    • /
    • 2006
  • The purpose of this study is to Propose the time dependent K-least time path algorithm applicable to a real-time based operation strategy in multi-modal transportation network. For this purpose, we developed the extended method based on entire path deletion method which was used in the static K-least time path algorithm. This method was applied to time dependent K-least time path algorithm to find k least time paths in order based on both time dependant mode-link travel time and transfer cost In particular, this algorithm find the optimal solution, easily describing transfer behavior, such as walking and waiting for transfer by applying a link-based time dependent label. Finally, we examined the verification and application of the Proposed algorithm through case study.

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
    • /
    • v.4 no.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.10b
    • /
    • 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 (최적제어이론을 이용한 동적 통행배정 모형의 적용에 관한 연구)

  • 전경수;오세현
    • Journal of Korean Society of Transportation
    • /
    • v.13 no.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