• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.365-370
• /
• 2004

In this paper, we wish to construct a optimal traffic cycle using wire remote control. if police vehicle or ambulance suddenly enter the traffic intersection, it will increase the traffic accident. In this paper, wireless traffic light use the radio traffic control signal and research about the hardware manufacture to check special detectors on urgency vehicles may safety and rapidly enter traffic intersection. Also, this paper present a traffic signal control conditions that analyzes different traffic intersection flows in cases of saturated flows, where the real traffic volume demand is large and the capacity constraints of bottlenecks have significant effects on the flow patterns. Through computer simulation this wireless traffic light has been proven to be much more safety and efficient than fixed traffic signal light which does not considering emergency vehicles for safety escort.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.04a
• /
• pp.161-165
• /
• 2005

In order to produce an optimal traffic cycle. We must first check how many waiting cars are at the lower intersection, because waiting queue is bigger than the length of upper traffic intersection. Start up delay time and vehicle waiting time occurs. To reduce vehicle waiting time, in this paper, we present an optimal green time algorithm using fuzzy neural network. Through computer simulation has been proven to be improved average vehicle speed than fixed traffic signal light which do not consider different intersection conditions.

• Bulletin of the Korean Chemical Society
• /
• v.35 no.4
• /
• pp.1061-1066
• /
• 2014

Time-dependent formulations of the reactive scattering theory based on the wavepacket correlation functions with the M${\phi}$ller wavepackets for the electronically nonadiabatic reactions are presented. The calculations of state-to-state reactive probabilities for the quasi-Jahn-Teller scattering model system were performed. The conical intersection (CI) effects are investigated by comparing the results of the two-surface nonadiabatic calculations and the single surface adiabatic approximation. It was found that the results of the two-surface nonadiabatic calculations show interesting features in the reaction probability due to the conical intersection. Single surface adiabatic calculations with extended Born-Oppenheimer approximation using simple wavepacket phase factor was found to be able to reproduce the CI effect semi-quantitatively, while the single surface calculations with the usual adiabatic approximation cannot describe the scattering process for the Jahn-Teller model correctly.

• Korean Journal of Computational Design and Engineering
• /
• v.11 no.5
• /
• pp.375-383
• /
• 2006

Presented in this paper is a new fast and robust algorithm generating NC tool path for 2D pockets with islands. The input shapes are composed of line segments and circular arcs. The algorithm has two steps: creation of successive offset loops and linking the loops to a tool path. A modified pairwise technique is developed in order to speed up and stabilize the offset process, and the linking algorithm is focused on avoiding thin-wall cutting and minimizing tool retractions. The proposed algorithm has been implemented in C++ and some illustrative examples are presented to show the practical strength of the algorithm.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.6
• /
• pp.942-948
• /
• 2017

Ray-tracing based method for computing projection image calculates the exact amounts of the intersection between voxels and a ray. Among several different implementations of the ray tracing based methods, Siddon's method is the earliest one. Later faster implementation such as Jacobs's method, Zhao's method, were investigated. To our knowledge, Zhao's method is the fastest one among these. We improve the speed of the Zhao's method by predicting the number of the same intersection length between voxel and a ray. In our experiment, the proposed method showed significantly faster computation speed than Zhao's method.

• Journal of information and communication convergence engineering
• /
• v.1 no.2
• /
• pp.82-87
• /
• 2003

We are able to work on the shared virtual space in Web-based Collaborative Design System using only Internet and Web browser. Then the users will share 3D objects and must be able to pick the objects effectively which they want to manipulate. In this paper, picking is implemented not only by computing intersection of mouse pointer with the objects of the virtual world, but also by using capabilities and attributes of scene graph node, by setting bounds intersection testing instead of geometric intersection testing, by limiting the scope of the pick testing, using Java 3D. These methods can reduce the computation of picking and can pick 3D objects effectively and easily using the system of hierarchy.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.1022-1030
• /
• 2003

In this paper we propose a efficient offset curve construction algorithm for $C^0$-continuous Open and Closed 2D sequence curve with line segment in the plane. One of the most difficult problems of offset construction is the loop problem caused by the interference of offset curve segments. Prior work[1-10] eliminates the formation of local self-intersection loop before constructing a intermediate(or raw) offset curve, whereas the global self-intersection loop are detected and removed explicitly(such as a sweep algorithm[13]) after constructing a intermediate offset curve. we propose an algorithm which removes global as well as local intersection loop without making a intermediate offset curve by forward tracing of tangential circle. Offset of both open and closed poly-line segment sequence curve in the plane constructs using the proposed approach.

• Communications for Statistical Applications and Methods
• /
• v.23 no.6
• /
• pp.563-574
• /
• 2016

In this study, we propose several simultaneous tests to detect the difference between means and variances for the two-sample problem when the underlying distribution is normal. For this, we apply the likelihood ratio principle and propose a likelihood ratio test. We then consider a union-intersection test after identifying the likelihood statistic, a product of two individual likelihood statistics, to test the individual sub-null hypotheses. By noting that the union-intersection test can be considered a simultaneous test with combination function, also we propose simultaneous tests with combination functions to combine individual tests for each sub-null hypothesis. We apply the permutation principle to obtain the null distributions. We then provide an example to illustrate our proposed procedure and compare the efficiency among the proposed tests through a simulation study. We discuss some interesting features related to the simultaneous test as concluding remarks. Finally we show the expression of the likelihood ratio statistic with a product of two individual likelihood ratio statistics.

• MALSORI
• /
• no.60
• /
• pp.109-123
• /
• 2006

Since computing the log-likelihood of Gaussian mixture density is a major computational burden for the speech recognizer based on the continuous HMM, several techniques have been proposed to reduce the number of mixtures to be used for recognition. In this paper, we propose a modified Bucket Box Intersection (BBI) algorithm, in which two relative thresholds are employed: one is the relative threshold in the conventional BBI algorithm and the other is used to reduce the number of the Gaussian boxes which are intersected by the hyperplanes at the boxes' edges. The experimental results show that the proposed algorithm reduces the number of Gaussian mixtures by 12.92% during the recognition phase with negligible performance degradation compared to the conventional BBI algorithm.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.2
• /
• pp.485-494
• /
• 2023

Let Y be the quintic del Pezzo 4-fold defined by the linear section of Gr(2, 5) by ℙ⁷. In this paper, we describe the locus of double lines in the Hilbert scheme of coincs in Y. As a corollary, we obtain the desigularized model of the moduli space of stable maps of degree 2 in Y. We also compute the intersection Poincaré polynomial of the stable map space.