• Title/Summary/Keyword: Canonical form

Search Result 166, Processing Time 0.024 seconds

AN EFFICIENT ALGORITHM FOR FINDING OPTIMAL CAR-DRIVING STRATEGY

  • Farhadinia, Bahram
    • Journal of applied mathematics & informatics
    • /
    • v.30 no.1_2
    • /
    • pp.1-14
    • /
    • 2012
  • In this paper, the problem of determining the optimal car-deriving strategy has been examined. In order to find the optimal driving strategy, we have modified a method based on measure theory. Further, we demonstrate that the modified method is an efficient and practical algorithm for dealing with optimal control problems in a canonical formulation.

YANG-MILLS CONNECTIONS ON A COMPACT CONNECTED SEMISIMPLE LIE GROUP

  • Park, Joon-Sik
    • East Asian mathematical journal
    • /
    • v.26 no.1
    • /
    • pp.75-79
    • /
    • 2010
  • Let G be a compact connected semisimple Lie group, g the Lie algebra of G, g the canonical metric (the biinvariant Riemannian metric which is induced from the Killing form of g), and $\nabla$ be the Levi-Civita connection for the metric g. Then, we get the fact that the Levi-Civita connection $\nabla$ in the tangent bundle TG over (G, g) is a Yang-Mills connection.

Kernel Machine for Poisson Regression

  • Hwang, Chang-Ha
    • Journal of the Korean Data and Information Science Society
    • /
    • v.18 no.3
    • /
    • pp.767-772
    • /
    • 2007
  • A kernel machine is proposed as an estimating procedure for the linear and nonlinear Poisson regression, which is based on the penalized negative log-likelihood. The proposed kernel machine provides the estimate of the mean function of the response variable, where the canonical parameter is related to the input vector in a nonlinear form. The generalized cross validation(GCV) function of MSE-type is introduced to determine hyperparameters which affect the performance of the machine. Experimental results are then presented which indicate the performance of the proposed machine.

  • PDF

New Canonical Forms for Enumerating Fuzzy/C Switching Functions

  • Araki, Tomoyuki;Tatsumi, Hisayuki;Mukaidono, Masao;Yamamoto, Fujio
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.537-542
    • /
    • 1998
  • Logic functions such as fuzzy switching functions and multiple-valued Kleenean functions, that are models of Kleene algebra have been studied as foundation of fuzzy logic. This paper deals with a new kinds of functions-fuzzy switching functions with constants-which have features of both the above two kinds of functions . In this paper, we propose new canonical forms for enumerating them. They are much useful to estimate simply the number of fuzzy switching functions with constants.

  • PDF

SECOND ORDER TANGENT VECTORS IN RIEMANNIAN GEOMETRY

  • Kwon, Soon-Hak
    • Journal of the Korean Mathematical Society
    • /
    • v.36 no.5
    • /
    • pp.959-1008
    • /
    • 1999
  • This paper considers foundational issues related to connections in the tangent bundle of a manifold. The approach makes use of second order tangent vectors, i.e., vectors tangent to the tangent bundle. The resulting second order tangent bundle has certain properties, above and beyond those of a typical tangent bundle. In particular, it has a natural secondary vector bundle structure and a canonical involution that interchanges the two structures. The involution provides a nice way to understand the torsion of a connection. The latter parts of the paper deal with the Levi-Civita connection of a Riemannian manifold. The idea is to get at the connection by first finding its.spary. This is a second order vector field that encodes the second order differential equation for geodesics. The paper also develops some machinery involving lifts of vector fields form a manifold to its tangent bundle and uses a variational approach to produce the Riemannian spray.

  • PDF

Design and Implement of Canonical XML Algorithm for Digital Signature System (전자서명 시스템을 위한 XML 정규화 알고리즘 설계 및 구현)

  • 유윤식;이강찬;전종홍;이원석;정회경
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.10a
    • /
    • pp.504-507
    • /
    • 2003
  • These days, XML is accepted and used to e-commerce market broadly. But by reason of XML document has autonomy of expression that can exist same form logically but several other forms physically, several problems ran happen in application that judge effectiveness as physical form such as XML digital signature. Therefore, it is recommending to propose and use Canonical XML algorithm to change identical XML document physically equally logically in W3C to solve this problems. We implemented system that run Canonical XML algorithm that suggested in W3C that can change to more elaborate regular document. Thus, interpretable with other application that takes W3C recommendation. Also, as well as use in digital signature system for web service is useful, use in several system that physical identify is required when it exchanges XML document for web service interoperability are considered to be valuable. Moreover, Adding the transformation ability between universal encoding scheme and EUC-KR that is internal encoding scheme should be Canonical XML Algorithm that is suited to internal circumstances, and this should be a foundation technique of international interoperability confirmedness.

  • PDF

A Study on Constructing the Multiple-Valued Combinational Logic Systems by Decision Diagram (결정 다이아그램에 의한 다치조합논리시스템 구성에 관한 연구)

  • 김이한;김성대
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.6
    • /
    • pp.868-875
    • /
    • 1995
  • This paper presents a method of constructing the multiple-valued combinational logic systems(MVCLS) by decision diagram. The switching function truth table of MVCLS is transformed into canonical normal form of sum-of-products(SOP) with literals at first. Next, the canonical normal form of SOP is transfered into multiple-valued logic decision diagram(MVLDD). The selecting of variable ordering is very important in this stage. The MVLDDs are quite different from each other according to the variable ordering. Sometimes the inadequate variable ordering produces a very large size of MVLDD means the large size of circuit implementation. An algorithm for generating the proper variable ordering produce minimal MVLDD and an example shows the verity of the algorithm. The circuits are realized with T-gate acceording to the minimal MVLDD.

  • PDF

An efficient seismic analysis of regular skeletal structures via graph product rules and canonical forms

  • Kaveh, A.;Zakian, P.
    • Earthquakes and Structures
    • /
    • v.10 no.1
    • /
    • pp.25-51
    • /
    • 2016
  • In this study, graph product rules are applied to the dynamic analysis of regular skeletal structures. Graph product rules have recently been utilized in structural mechanics as a powerful tool for eigensolution of symmetric and regular skeletal structures. A structure is called regular if its model is a graph product. In the first part of this paper, the formulation of time history dynamic analysis of regular structures under seismic excitation is derived using graph product rules. This formulation can generally be utilized for efficient linear elastic dynamic analysis using vibration modes. The second part comprises of random vibration analysis of regular skeletal structures via canonical forms and closed-form eigensolution of matrices containing special patterns for symmetric structures. In this part, the formulations are developed for dynamic analysis of structures subjected to random seismic excitation in frequency domain. In all the proposed methods, eigensolution of the problems is achieved with less computational effort due to incorporating graph product rules and canonical forms for symmetric and cyclically symmetric structures.

A Cache Manager for Enhancing the Performance of Query Evaluation in Data Warehousing Environment (데이타웨어하우스 환경에서의 질의 처리 성능 향상을 위한 캐시 관리자)

  • 심준호
    • Journal of KIISE:Databases
    • /
    • v.30 no.4
    • /
    • pp.408-419
    • /
    • 2003
  • Data warehouses are usually dedicated to the processing of quires issued by decision support system(DSS). The response time of DSS queries is typically several orders of magnitude higher than the one of OLTP queries. Since DSS queries are often submitted interactively, techniques for reducing their response time are important. The caching of query results is one such technique particularly well suited to the DSS environment. In this paper, we present a cache manager for such an environment. Specifically, we define a canonical form of query. The cache manager looks up a query based on the exact query match or using a suggested query split process if the query is found is non-canonical form or in canonical form, respectively. It dynamically maintains the cache content by employing a profit function which reflects in an integrated manner the query execution cost, the size of query result, the reference rate, the maintenance cost of each result due to updates of their base tables, and the frequency of such updates. We performed the experimental evaluation and it positively shows the performance benefit of our cache manager.