• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1999.04a
• /
• pp.29-30
• /
• 1999

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1989.10a
• /
• pp.158-158
• /
• 1989

• Korean Journal of Logic
• /
• v.18 no.1
• /
• pp.133-153
• /
• 2015

In his paper "Structural Equations Approach to Token Causation: The Active Route Account Revisited" Professor Sungsu Kim defends the active route account. The active route account is the theory of causation which overcomes counterexamples to the counterfactual theories of causation, while maintaining the counterfactual theorist's essential intuition that an effect depends counterfactually on a cause. Unfortunately, there are counterexamples to the active route account itself. Professor Sungsu Kim attempts to defend the active route account by rebutting those counterexamples. In this paper, I argue that his defense of the active route account is not successful.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.1
• /
• pp.7-13
• /
• 2008

This paper suggests a Path-planning algorithm for mobile agents. While there are a lot of studies on the path-planning for mobile agents, mathematical modeling of complex environment which constrained by spatio-temporally is very difficult and it is impossible to obtain the optimal solutions. In this paper, an optimal path-planning algorithm based on the graphic technique is presented. The working environment is divided into two areas, the one is free movable area and the other is not permissible area in which there exist obstacles and spatio-temporally constrained, and an optimal solution is obtained by using a new algorithm which is based on the well known ACO algorithm.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.15 no.3
• /
• pp.231-241
• /
• 2004

This paper drives the exact expression of bit error rate(BER) performance for groupwise iterative-multipath interference cancellation(GWI-MPIC) algorithm for cancelling multipath interference components in a coherent high-speed downlink packet access(HSDPA) system of W-CDMA downlink and the BER performance is evaluated by numerical analysis. The performance of GWI-MPIC is compared to the successive interference cancellation(SIC) algorithm for multipath components. From numerical results, the optimal average BER performance of weighting factor ${\beta}$$\_$h/ for interference cancellation is obtained at ‘${\beta}$$\_$h/=0.8’ and then this weighting factor is hereafter applied to other performance analysis. Numerical results showed that the average BER performance of GWI-MPIC algorithm is rapidly degraded at multipath L=6, but is revealed the good performance than that of SIC algorithm in terms of increasing the number of multipath. This results also indicated that the average BER performance is greatly degraded due to increasing interference power more than multicode K=8. The average BER performance of the proposed algorithm is superior to the performance of SIC algorithm about 3 ㏈ for processing gain PG=128 at multipath L=2 and Average BER=1.0${\times}$10$\^$-5/. And also, the results produced good performance in case of linear monotonic reduction of multipath fading channel gain than that of constant channel gain variation, because multipath fading channel gain which is arrived later is small.

• The KIPS Transactions:PartD
• /
• v.14D no.6
• /
• pp.605-614
• /
• 2007

As a standard query language to search XML data, XQuery and XPath were proposed by W3C. By widely using XQuery and XPath languages, recent researches focus on the development of query processing algorithm and data structure for efficiently processing XML query with the enormous XML database system. Recently, when processing XML path expressions, the concept of the structural join which may determine the structural relationship between XML elements, e.g., ancestor-descendant or parent-child, has been one of the dominant XPath processing mechanisms. However, structural joins which frequently occur in XPath query processing require high cost. In this paper, we propose a new structural join algorithm, called SISJ, based on our structured index, called SI, in order to process XPath queries efficiently. Experimental results show that our algorithm performs marginally better than previous ones. However, in the case of high recursive documents, it performed more than 30% by the pruning feature of the proposed method.

• Journal of Korean Society of Transportation
• /
• v.23 no.7 s.85
• /
• pp.99-110
• /
• 2005

Total travel cost of route which connects origin with destination (O-D) is consist of the total sum of link travel cost and route perception cost. If the link perception cost is different according to the origin and destination, optimal route search has limitation to reflect the actual condition by route enumeration problem. The purpose of this study is to propose optimal route searching formulation and algorithm which is enable to reflect different link perception cost by each route, not only avoid the enumeration problem between origin and destination. This method defines minimum unit of route as a link and finally compares routes using link unit costs. The proposed method considers the perception travel cost at both origin and destination in optimal route searching process, while conventional models refect the perception cost only at origin. However this two-way searching algorithm is still not able to guarantee optimum solution. To overcome this problem, this study proposed an orign based optimal route searching method which was developed based on destination based optimal perception route tree. This study investigates whether proposed numerical formulas and algorithms are able to reflect route perception behavior reflected the feature of origin and destination in a real traffic network by the example research including the diversity of route information for the surrounding area and the perception cost for the road hierarchy.

• Journal of the Korean Ceramic Society
• /
• v.28 no.1
• /
• pp.19-19
• /
• 1991

Fracture of Al2O3 tubes for different loading path under combined tension/torsion was investigated. Macroscopic directions of crack propagation agreed well with the maximum principal stress criterion, independent of the loading path. However, fracture strength from the proportional loading test(τ/σ= constant) showed either strengthening or weakening compared to that from uniaxial tension, depending on the ratio τ/σ. The Weibull theory was capable to predict the strengthening of fracture strength in pure torsion, but not the weakening in the proportional loading condition. The strengthening or weakening of fracture strength in the proportional loading condition was explained by the effect of shear stresses in the plane of randomly oriented microdefects. Finally, a new empirical fracture criterion was proposed. This criterion is based on a mixed mode fracture criterion and experimental data for fracture of Al2O3 tubes under combined tension/torsion. The proposed fracture criterion agreed well with experimental data for both macroscopic directions of crack propagation and fracture strengths.

• Journal of Advanced Navigation Technology
• /
• v.20 no.5
• /
• pp.401-407
• /
• 2016

This paper introduces 3-dimensional path planning and guidance including power model for high altitude long endurance (HALE) UAV using solar energy. Dubins curve used in this paper has advantage of being directly available to apply path planning. However, most of the path planning problems using Dubins curve are defined in a two-dimensional plan. So, we used 3-dimensional Dubins path generation algorithm which was studied by Randal W. Beard. The aircraft model which used in this paper does not have an aileron. So we designed lateral controller by using a rudder. And then, we were conducted path tracking simulations by using a nonlinear path tracking algorithm. We generate examples according to altitude conditions. From the path tracking simulation results, we confirm that the path tracking is well on the flight path. Finally, we were modeling the power system of HALE UAVs and conducting path tracking simulation during 48hours. Modeling the amount of power generated by the solar cell through the calculation of the solar energy yield. And, we show the 48hours path tracking simulation results.

• Journal of Korea Multimedia Society
• /
• v.7 no.7
• /
• pp.859-876
• /
• 2004

This paper presents optimal configurations of multidimensional path indexes (MPIs) for the efficient execution of object-oriented queries in object databases. MPI uses a multidimensional index structure for efficiently supporting nested predicates that involve both nested attribute and class hierarchies, which are not supported by the nested attribute index using one-dimensional index structure such as $B^+$-tree. In this paper, we have analyzed the MPIs in the framework of complex queries, containing conjunctions of nested predicates, each one involving a path expression having target classes and domain classes substitution. First of all, we have considered MPI operations caused by updating of object databases, and the use of the MPI in the case of a query containing a single nested predicate. And then, we have considered the use of the MPIs in the framework of more general queries containing nested predicates over both overlapping and non-overlapping paths. The former are paths having common subpaths, while the latter have no common subpaths.