• Journal of applied mathematics & informatics
• /
• v.33 no.5_6
• /
• pp.671-686
• /
• 2015

The notion of soft α-ideals and α-idealistic soft BCI-algebras is introduced and their basic properties are discussed. Relations between soft ideals and soft α-ideals of soft BCI-algebras are provided. Also idealistic soft BCI-algebras and α-idealistic soft BCI-algebras are being related. The restricted intersection, union, restricted union, restricted difference and "AND" operation of soft α-ideals and α-idealistic soft BCI-algebras are established. The characterizations of (fuzzy) α-ideals in BCI-algebras are given by using the concept of soft sets. Relations between fuzzy α-ideals and α-idealistic soft BCI-algebras are discussed.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.8
• /
• pp.719-724
• /
• 2012

A traffic detection system is a device that collects traffic information around an intersection. Most existing traffic detection systems provide very limited traffic information for signal control due to the restriction of vehicle detection area. A signal control scheme determines the transition among signal phases and the time that a phase lasts for. However, the existing signal control scheme do not resolve the traffic congestion effectively since they use restricted traffic information. In this paper, a new traffic detection system with a zone division signal control scheme is proposed to provide correct and detail traffic information and decrease the vehicle's waiting time at the intersection. The traffic detection system obtains traffic information in a way of vehicle-to-roadside communication between vehicles and sensor network. A new signal control scheme is built to exploit the sufficient traffic information provided by the proposed traffic detection system efficiently. Simulation results show that the proposed signal control scheme has 121 % and 56 % lower waiting time and delay time of vehicles at an intersection than other fuzzy signal control scheme.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.4
• /
• pp.181-192
• /
• 2003

Increased vehicles on the restricted road, the conventional traffic light to losses the function of optimal cycle. The conventional traffic light dose not consider passenger car unit ,offset, and length of traffic intersection. As a result, 30~45% of conventional traffic cycle does not match the present traffic cycle. In this paper, we study the disard vantage of conventional traffic light and improve the vehicle average waiting time in the traffic intersection and vehicle average speed using fuzzy logic. Moreover, it will be able to forecast the optimal traffic information, road under construction and dangerous road using internet.

• Journal of applied mathematics & informatics
• /
• v.41 no.3
• /
• pp.657-685
• /
• 2023

This paper aims to apply the concept of Pythagorean fuzzy soft sets (PFSSs) to UP-algebras. Then we introduce five types of PFSSs over UP-algebras, study their generalization, and provide illustrative examples. In addition, we study the results of four operations of two PFSSs over UP-algebras, namely, the union, the restricted union, the intersection, and the extended intersection. Finally, we will also discuss t-level subsets of PFSSs over UP-algebras to study the relationships between PFSSs and special subsets of UP-algebras.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.11a
• /
• pp.93-96
• /
• 2003

The generalized knapsack problem, or gknap is the combinatorial optimization problem of optimizing a nonnegative linear functional over the integral hull of the intersection of a polynomially separable 0 - 1 polytope and a knapsack constraint. Among many potential applications, the knapsack, the restricted shortest path, and the restricted spanning tree problem are such examples. We establish some necessary and sufficient conditions for a gknap to admit a fully polynomial approximation scheme, or FPTAS, To do so, we recapture the scaling and approximate binary search techniques in the framework of gknap. This also enables us to find a condition that a gknap does not have an FP-TAS. This condition is more general than the strong NP-hardness.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.2
• /
• pp.177-185
• /
• 2010

Ray-object intersection is an important element in ray tracing that takes up a substantial amount of computing time. In general, such spatial data structure as kd-tree has been frequently used for static scenes to accelerate the intersection computation. Recently, a few variants of kd-tree traversal have been proposed suitable for the GPU that has a relatively restricted computing architecture compared to the CPU. In this article, we propose yet another two implementation techniques that can improve those previous ones. First, we present a cached stack method that is aimed to reduce the costly global memory access time needed when the stack is allocated to global memory. Secondly, we present a rope-with-short-stack method that eases the substantial memory requirement, often necessary for the previous rope method. In order to show the effectiveness of our techniques, we compare their performances with those of the previous GPU traversal methods. The experimental results will provide prospective GPU ray tracer developers with valuable information, helping them choose a proper kd-tree traversal method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.4
• /
• pp.191-198
• /
• 2003

The generalized knapsack problem or gknap is the combinatorial optimization problem of optimizing a nonnegative linear function over the integral hull of the intersection of a polynomially separable 0-1 polytope and a knapsack constraint. The knapsack, the restricted shortest path, and the constrained spanning tree problem are a partial list of gknap. More interesting1y, all the problem that are known to have a fully polynomial approximation scheme, or FPTAS are gknap. We establish some necessary and sufficient conditions for a gknap to admit an FPTAS. To do so, we recapture the standard scaling and approximate binary search techniques in the framework of gknap. This also enables us to find a weaker sufficient condition than the strong NP-hardness that a gknap does not have an FPTAS. Finally, we apply the conditions to explore the fully polynomial approximability of the constrained spanning problem whose fully polynomial approximability is still open.

• Journal of Korean Society of Transportation
• /
• v.24 no.1 s.87
• /
• pp.121-131
• /
• 2006

Considering characteristics of drivers and vehicles with proper and reliable ways in highway design Procedures can ensure high level of highway safety. However, it is almost impossible to take into account all factors of drivers and vehicles influencing on the highway safety because of their uncertain and random nature. To detour the dead-end, the nature are usually assumed as simple homogeneous and deterministic one. Although the restricted assumption makes the system simple, it can produce serious problems due to lack of considering variability in the system. This paper develops a reliability-based method for determining stopping sight distance(SSD) and intersection sight distance (ISD), which are crucial elements in highway alignment design. In the study, Hasofer-Lind method is adopted. which is a well-known first-order second moment reliability method (AFOSM) The results in this study show that if mean, variance, and distribution of a particular driver-vehicle parameter are known, more reliable sight distances can be applied in highway design procedures because we can reflect uncertainties and randomness. Thus, the Probabilistic method could be adopted in designing the sight distance(s) with the desired reliability level.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.4
• /
• pp.73-83
• /
• 2004

With increasing numbers of vehicles on restricted roads, It happens that we have much wasted time and decreased average car speed. This paper proposes a new concept of coordinating green time which controls 10 traffic intersection systems. For instance, if we have a baseball game at 8 pm today, traffic volume toward the baseball game at 8 pm today, franc volume toward the baseball game will be increased 1 hour or 1 hour and 30 minutes before the baseball game. At that time we can not predict optimal green time Even though there have smart electro-sensitive traffic light system. Therefore, in this paper to improve average vehicle speed and reduce average vehicle waiting time, we created optimal green time using fuzzy rules md neural network as a preprocessing. Also, we developed an Intelligent PLC(Programmable Logic Controller) for real time traffic forecasting as a postprocesing about unexpectable conditions. Computer simulation results proved reducing average vehicle waiting time which proposed coordinating green time better than electro-sensitive franc light system does not consider coordinating green time.

• Economic and Environmental Geology
• /
• v.39 no.2 s.177
• /
• pp.163-171
• /
• 2006

This study is the case of groundwater development based on the geometrical fracture model of target area established only through geological fracture mapping technique. A fracture mapping of $9km^2$, eastern Munsan, has been conducted to determine geological and hydrological factors for new water well placement in the Gyeonggi gneiss complex. Geophysical exploration was not applicable because of small restricted area and dense underground utilities at the site. Form line mapping on the basis of foliation orientation and rock type revealed a synform of NS fold axis bearing to the south. An EW geological cross-section passed through the site area shows a F2 synform as a double-wall ice cream spoon shape. Three regional faults of $N20^{\circ}E,\;N30^{\circ}W$, and NS have been dragged into the site to help understand extensional fault paths. The $N20^{\circ}E$ fault with dextral sense is geometrically interpreted as a western fault of two flexural conjugate type-P shear faults in the F2 synformal fold. The NE cross-section reveals that a possible groundwater belt in the western limb of super-posed fold area is formed as a trigonal prism within 100 m depth of the intersectional space between the $N20^{\circ}E$ fault plane and the weakly sheared plane of transposed foliation. Another possible fault for water resource strikes $N40^{\circ}E$. Recommended sites for new water well placement are along the $N20^{\circ}E\;and\;N40^{\circ}E$ faults. As a result of fracture mapping, 145 ton/day of water can be produced at one well along the $N20^{\circ}E$ fault line. Exploration of groundwater in the area is succeeded only using with geological fracture mapping and interpretation of geological cross-section, without any geophysical survey. Intersection of fault generated with the F2 synformal fold and foliation supply space of groundwater reserver.