• 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.

• 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.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.3
• /
• pp.547-568
• /
• 2020

In this paper, we introduce the linear self-attracting diffusion driven by a weighted fractional Brownian motion with weighting exponent a > -1 and Hurst index |b| < a + 1, 0 < b < 1, which is analogous to the linear fractional self-attracting diffusion. For the 1-dimensional process we study its convergence and the corresponding weighted local time. As a related problem, we also obtain the renormalized intersection local time exists in L² if max{a₁ + b₁, a₂ + b₂} < 0.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.1
• /
• pp.703-712
• /
• 2015

This paper proposes the UIGRP, which can tackle the problem of the network disconnection and packet transmission delay caused by turning vehicles frequently in an urban intersection. The UIGRP was designed as follows. First, it calculates the direction of vehicles using the moving direction of vehicles and the location of a destination. Second, it makes the RSU measure the density of an urban intersection. Third, the TGF Algorithm in the UIGRP decides the data transmission paths by setting as an intermediate node, not only the vehicle that is moving in the direction where a destination node is located, but also the node that has the highest density. The TGF algorithm using a moving direction and density minimizes or removes the occurrence of local maximum problems that the existing Greedy Forwarding algorithm has. Therefore, the simulation result shows that UIGRP decreases the occurrence of local maximum problems by 3 and 1 times, and the packet transmission time by 6.12 and 2.04(ms), and increases the success rate of packet transmission by 15 and 3%, compared to the existing GPSR and GPUR.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.2
• /
• pp.113-127
• /
• 2018

This study develops a fusion priority signal control algorithm to pass without delay in emergency events. Fusion priority signal control is method combined center control with local control. The center control method applies signal times for each signalized intersection on the emergency vehicle's route when an emergency call is received. As signals are controlled before the emergency vehicle leaves for its destination, it is possible to clear the queues at each intersection more effectively. However, since the traffic information (speed, position) of the real-time emergency vehicle is not used, the intersection arrival time predicted by center control and actual arrival time of the emergency vehicle may be different from each other. In the case, it is possible to experience a delay caused by the signal. Local control method operate priority signal use the real-time information of EV, but there is a limitation that queue elimination time can not be reflected. In this study, fusion(center+local) control algorithm is proposed to compensate the disadvantages of center and local control also maximizing its advantages. Proposed algorithm is expected to decrease delay time of EV in emergency situation.

• Proceedings of the KOR-KST Conference
• /
• 1996.02a
• /
• pp.59-86
• /
• 1996

Current methods for evaluating unsignalized intersections, and estimating level-of-service (LOS) is determined from efficiency-based criteria such as little or no delay to very long delays. At present, similar procedures to evaluate intersections using safety-based criteria do not exist. The improvement of sight distances at intersections is the most effective way of improving intersection safety. However, a set of procedures is necessary to account for the limitations in current methodology. Such an approach would build upon such methods, but also account for: deficiencies in the current deterministic solution for the determination of intersection sight distances; opportunity for an accident and severity of an accident; and cost-effectiveness of attaining various levels of sight distances. In this research, a model that estimates the degree of safety at two-way stop-controlled intersections is described. Only crossing maneuvers are considered in this study because accidents caused by the crossing maneuvers are the dominate type among intersection accidents. Monte Carlo methods are used to estimate the hazard at an intersection as a function of roadway features and traffic conditions. Driver`s minimum gap acceptance in the crossing vehicles and headway distribution on the major road are used in the crossing vehicles and headway distribution on the major road are used in the model to simulate the real intersectional maneuvers. Other random variables addressed in the model are: traffic speeds; preception-reaction times of both drivers in the crossing vehicles and drivers in oncoming vehicles on the major road; and vehicles on the major roads. The developed model produces the total number of conflicts per year per vehicle and total potential kinetic energy per year per vehicle dissipated during conflicts as measurements of safety at intersections. Based on the results from the developed simulation model, desirable sight distances for various speeds were determined as 350 feet, 450 feet and 550 feet for 40 mph, 50 mph and 60 mph prevailing speed on the major road, respectively. These values are seven to eight percent less than those values recommended by AASHTO. A safety based level-of-service (LOS) is also developed using the results of the simulation model. When the total number of conflicts per vehicle is less than 0.05 at an intersection, the LOS of the intersection is `A' and when the total number of conflicts per vehicle is larger than 0.25 at an intersection, the LOS is `F'. Similarly, when the total hazard per vehicle is less than 350, 000 1b-ft2/sec2, the LOS is `F'. Once evaluation of the current safety at the intersection is complete, a sensitivity analysis can be done by changing one or more input parameters. This will estimate the benefit in terms of time and budget of hazard reduction based upon improving geometric and traffic characteristics at the intersection. This method will also enable traffic engineers in local governments to generate a priority list of intersection improvement projects.

• Journal of Korea Game Society
• /
• v.20 no.3
• /
• pp.75-84
• /
• 2020

This paper introduces an interactive indirect illumination algorithm which considers indirect visibility. First, a small number of rays are emitted on hemisphere of the current pixel to obtain the first intersection. If this point is directly illuminated by the light source, its illuminated color is collected. Second, in order to approximate the indirect visibility, a 3D ray marching algorithm, which is based on a hierarchy structure, is used to accelerate the ray-voxel intersection. Third, the indirect images are denoised by an edge-avoiding filtering with a local means replacement method.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.469-474
• /
• 2009

This paper proposes an real time ray tracing system using optimized kd-tree traversal environment and ray/triangle intersection algorithm. The previous kd-tree traversal algorithms search for the upper nodes in a bottom-up manner. In a such way we need to revisit the already visited parent node or use redundant memory after failing to find the intersected primitives in the leaf node. Thus ray tracing for relatively complex scenes become more difficult. The new algorithm contains stacks implemented on GPU's local memory on CUDA framework, thus elegantly eliminate the problems of previous algorithms. After traversing the node we perform the latest CPU-based ray/triangle intersection algorithm 'Plucker coordinate test', which is further accelerated in massively parallel thanks to CUDA. Plucker test can drastically reduce the computational costs since it does not use barycentric coordinates but only simple test using the relations between a ray and the triangle edges. The entire system is consist of a single ray kernel simply and implemented without introduction of complicated synchronization or ray packets. Consequently our experiment shows the new algorithm can is roughly twice as faster as the previous.

• Bulletin of the Korean Chemical Society
• /
• v.32 no.2
• /
• pp.463-466
• /
• 2011

In this work, we investigate anodization of Pb in ethylene glycol containing small amount of $NH_4F$, demonstrating that ${\beta}-PbF_2$ particles with octahedral morphology can be prepared by adjusting the applied potential and anodizing time. FE-SEM images and XRD measurements of anodic nanostructures as a function of anodizing time clearly show that PbO is first formed on Pb. Subsequently, a local dissolution of PbO leads to formation of skeleton structure of PbO, releasing $Pb^{2+}$ ions in the electrolyte. The lead ions can be precipitated on the walls or intersection of the skeleton walls when the concentration of lead ions is saturated. The method described in this article shows the feasibility of formation of metal fluoride crystal by anodization of metal in a fluoride containing solution.

• Proceedings of the KSR Conference
• /
• 2006.11b
• /
• pp.530-537
• /
• 2006

Recently, the railroad route plan is trying to minimize the damage of the local resident which is caused by railroad construction. For this reason, reducing the banking height of soil roadbed, lowering the bridge girder height of a solid intersection and a part of cross river, the through bridge type which can achieve a required span length must apply. The representative through bridges of railroad are arch bridges, truss bridges and plate girder bridges, the through plate girder bridge of variable section can apply that the span length of these bridges is about $30{\sim}50m$, namely, middle span length bridge types, and that can satisfy structural capacity and beauty of railroad at the same time. This paper introduces plan and design process of the Su-eo cheon bridge applied by a through plate girder bridge type of the Jinju-Gwangyang double track 6th construction ordered at Korea Rail network Authority in 2005.