• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.04a
• /
• pp.421-428
• /
• 2007

This paper discusses a fitness of the control on intersection network using fuzzy analytic hierachy process. The validity of control of traffic signal on intersection is phase, cycle of intersection. But the aigent of traffic intersection network is relative of intersection article. Therefor the aigent of traffic network intersection is before intersection passing vechile number, delayed vechile number. Fuzzy analytic hierachy process clears the grade of validity of the fixed cycle time controller and adaptive fixed cycle time and fuzzy traffic controller and proposes a new control type a traffic signal by this fuzzy analytic hierachy process.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.6
• /
• pp.127-132
• /
• 2008

Traffic intersection control is implemented by the data which is acquired to vechile loop detector. Traffic intersection control equation is Webster equation. which use passig and delayed vechile number. But webster equation is applied to the spot traffic intersection, it is not used to related traffic intersection network system. There is not the approprate remote traffic intersection control, even if there is, it is high cost local network system. Therefore low cost and expert traffic intersection control is realized by internet referencing next and distant intersection traffic information.

• Proceedings of the KAIS Fall Conference
• /
• 2008.05a
• /
• pp.245-247
• /
• 2008

Traffic intersection conrol is implemented by the data which is acquired to vechile Loop detector. Traffic intersection control equation is Webster equation, which use passing and delayed vechile number. But webster equation is applied to the spot traffic intersection, it is not used to related traffic intersection network system. There is not the approprate remote traffic intersection control, even if there is, it is high cost local network system. Therefore low cost and expert traffic intersection control is realized by internet referencing next and distant intersection traffic information.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.2
• /
• pp.200-207
• /
• 2007

The passive direction finding cross localization method is widely adopted in passive tracking, therefore there will exist masses of false intersection points. Eliminating these false intersection points correctly and quickly is a key technique in passive localization. A new method is proposed for passive locating and tracking multi-jammer target in this paper. It not only solves the difficulty of determining the number of targets when masses of false intersection points existing, but also solves the initialization problem of elastic network. Thus this method solves the problem of multi-jammer target correlation and the elimination of static false intersection points. The method which dynamically establishes multiple hypothesis trajectory trees solves the problem of eliminating the remaining false intersection points. Simulation results show that computational burden of the method is lower, the elastic network can more quickly find all or most of the targets and have a more probability of locking the real targets. This method can eliminate more false intersection points.

• Journal of Korean Institute of Industrial Engineers
• /
• v.10 no.2
• /
• pp.37-43
• /
• 1984

For the polymatroidal network, which has set-constraints on arcs, solution procedures to get the weighted maximal flows are investigated. These procedures are composed of the transformation of the polymatroidal network flow problem into a polymatroid intersection problem and a polymatroid intersection algorithm. A greedy polymatroid intersection algorithm is presented, and an example problem is solved. The greedy polymatroid intersection algorithm is a variation of Hassin's. According to these procedures, there is no need to convert the primal problem concerned into dual one. This differs from the procedures of Hassin, in which the dual restricted problem is used.

• Journal of Korean Society of Transportation
• /
• v.14 no.3
• /
• pp.127-141
• /
• 1996

This paper presents a unique approach to urban traffic network signal control. This paper begins with an introduction to traffic control in general, and then goes on to describe the approach of fuzzy control, where the signal timing parameters at a given intersection are adjusted as functions of the local traffic network condition and adjacent intersection. The signal timing parameters evolve dynamically using only local information to improve traffic signal flow. The signal timing at an intersection is defined by three parameters : cycle time, phase split, off set. Fuzzy decision rules are used to adjust three parameters based only on local information. The amount of change in the timing parameters during each cycle is limited to a small fraction of the current parameters to ensure smooth transition. In this paper the effectiveness of this method is showed through simulation of the traffic signal flow in a network of controlled intersection.

• Proceedings of the Korean Society of Soil and Groundwater Environment Conference
• /
• 2001.09a
• /
• pp.27-30
• /
• 2001

Flow and transport at fracture intersections, and their effects on network scale transport, are investigated in three-dimensional random fracture networks. Fracture intersection mixing rules complete mixing and streamline routing are defined in terms of fluxes normal to the intersection line between two fractures. By analyzing flow statistics and particle transfer probabilities distributed along fracture intersections, it is shown that for various network structures with power law size distributions of fractures, the choice of intersection mixing rule makes comparatively little difference in the overall simulated solute migration patterns. The occurrence and effects of local flows around an intersection (local flow cells) are emphasized. Transport simulations at fracture intersections indicate that local flow circulations can arise from variability within the hydraulic head distribution along intersections, and from the internal no flow condition along fracture boundaries. These local flow cells act as an effective mechanism to enhance the nondiffusive breakthrough tailing often observed in discrete fracture networks. It is shown that such non-Fickian (anomalous) solute transport can be accounted for by considering only advective transport, in the framework of a continuous time random walk model. To clarify the effect of forest environmental changes (forest type difference and clearcut) on water storage capacity in soil and stream flow, watershed had been investigated.

• The Journal of the Korea Contents Association
• /
• v.7 no.7
• /
• pp.1-10
• /
• 2007

In this paper, we propose an indexing method for efficiently updating current positions of moving objects on road networks. The existing road network models increase update costs when objects move to adjacent road segments because their connectivity is not preserved. We propose an intersection based network model and a new index structure to solve this problem. The proposed intersection based network model preserves network connectivity through splitting road networks to contain intersection nodes always. The proposed index structure In our experiments, we show that our method is about 3 times faster than an existing index structure in terms of update costs.

• Journal of Korean Society of Transportation
• /
• v.31 no.4
• /
• pp.3-17
• /
• 2013

The purpose of this study is to develop a traffic assignment model where the variable of signal intersection delay is taken into account in assigning traffic in large-scale network settings. Indeed, despite the fact that the majority of the increase in travel time or cost involving congested urban network or interrupted flow are accounted for by stop delays or congested delays at signal intersections, the existing traffic assignment models did not reflect this. The traffic assignment model considering intersection delays presented in this study was built based on the existing traffic assignment models, which were added to by the analysis technique for the computation of intersection delay provided in Korea Highway Capacity Manual. We can conclude that a multiple variety of simulation tests prove that this model can be applied to real network settings. Accordingly, this model shows the possibility of utilizing a model considering intersection delay for traffic policy decisions through analysis of effects of changes in traffic facilities on large urban areas.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.767-772
• /
• 2005

The Internet is a packet switched network which offers best-effort service, but current IP network provide enhanced services such Quality of Services, Virtual Private Network (VPN) services, Distribute Firewall and IP Security Gateways. All such services need packet classification for determining the flow. The problem is performing scalable packet classification at wire speeds even as rule databases increase in size. Therefore, this research offer packet classification algorithm that increase classifier performance when working with enlarge rules database by rearrange rule structure into Bitmap Intersection Lookup (BIL) tables. It will use packet's header field for looking up BIL tables and take the result with intersection operation by logical AND. This approach will use simple algorithm and rule structure, it make classifier have high search speed and fast updates.