• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.6
• /
• pp.105-110
• /
• 2005

The linearized polynomial fan be regarded as a generalization of the identity function so that the inverse of the linearized polynomial is a generalization of e inverse function. Since the inverse function has so many good cryptographic properties, the inverse of the linearized polynomial is also a candidate of good Boolean functions. In particular, a construction method of vector resilient functions with high algebraic degree was proposed at Crypto 2001. But the analysis about the algebraic degree of the inverse of the linearized Polynomial. Hence we correct the inexact result and give the exact maximal algebraic degree.

• Kyungpook Mathematical Journal
• /
• v.60 no.3
• /
• pp.467-475
• /
• 2020

Let G be a chemical graph with vertex set {v₁, v₁, …, v_n} and degree sequence d(G) = (deg_G(v₁), deg_G(v₂), …, deg_G(v_n)). The inverse degree, R(G) of G is defined as $R(G)={\sum{_{i=1}^{n}}}\;{\frac{1}{deg_G(v_i)}}$. The cyclomatic number of G is defined as γ = m - n + k, where m, n and k are the number of edges, vertices and components of G, respectively. In this paper, some upper bounds on the diameter of a chemical graph in terms of its inverse degree are given. We also obtain an ordering of connected chemical graphs with respect to the inverse degree.

• Honam Mathematical Journal
• /
• v.20 no.1
• /
• pp.45-55
• /
• 1998

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.513-518
• /
• 2007

There is a one to one correspondence between Artinian algebras $k[x_1,...,x_n]/Ann(M)$ and finitely generated $k[x_1,...,x_n]-submodules$ M of $k[y_1,...,y_n]$ by Inverse System. In particular, any Artinian level algebra $k[x_1,...,x_n]/Ann(M)$ can be obtained when M is finitely generated by only maximal degree generators. We prove that H = (1, 4, 8, 13,..., 27, 8, 2) is not a level Artinian O-sequence using this inverse system.

• Journal of Mechanical Science and Technology
• /
• v.16 no.1
• /
• pp.13-23
• /
• 2002

This paper presents inverse kinematic and dynamic analyses of HexaSlide type six degree-of-freedom parallel manipulators. The HexaSlide type parallel manipulators (HSM) can be characterized as an architecture with constant link lengths that are attached to moving sliders on the ground and to a mobile platform. In the inverse kinematic analyses, the slider and link motion (position, velocity, and acceleration) is computed given the desired mobile platform motion. Based on the inverse kinematic analysis, in order to compute the required actuator forces given the desired platform motion, inverse dynamic equations of motion of a parallel manipulator is derived by the Newton-Euler approach. In this derivation, the joint friction as well as all link inertia are included. Relative importance of the link inertia and joint frictions on the computed torque is investigated by computer simulations. It is expected that the inverse kinematic and dynamic equations can be used in the computed torque control and model-based adaptive control strategies.

• Journal of applied mathematics & informatics
• /
• v.41 no.2
• /
• pp.287-293
• /
• 2023

In this paper, the Augmented graph Es(τ) of the inverse graph Gs(τ) of a cyclic group (τ,◦) was studied. The Augmented inverse graph was constructed by applying the method of Mycielski's construction. The dimension of Augmented inverse graph and different properties of the graph were investigated. Later the chromatic number of Augmented inverse graph was discussed and the relation between the maximum degree of the graph and the chromatic number was established. In the Mycielski's construction, the properties of the key node 'u' in Es (τ) were established based on cardinality of the cyclic group (τ,◦) and also proved that the Augmented inverse graph Es(τ) was a triangle free graph.

• Journal of applied mathematics & informatics
• /
• v.34 no.3_4
• /
• pp.221-225
• /
• 2016

For a connected graph G = (V, E), its inverse degree is defined as $\sum_{{\upsilon}{\in}{V}}^{}\frac{1}{d(\upsilon)}$. Using an upper bound for the inverse degree of a graph obtained by Cioabă in [4], we in this note present sufficient conditions for some Hamiltonian properties and k-connectivity of a graph.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.557-562
• /
• 1991

In this paper, we present new methods for solving the inverse kinematics associated with 6 degree of freedoms manipulator by the numerical method. This method will be based on tracking stability of special nonlinear dynamical systems, and differs from the typical techniques based by the Newton-Gauss or Newton-Raphson method for solving nonlinear equations. This simulation results show that the new method is solving the inverse kinematics of PUMA 560 without the derivative of a given task space trajectories.

• Communications of the Korean Mathematical Society
• /
• v.31 no.3
• /
• pp.423-431
• /
• 2016

Images and inverse images of (almost) stable cubic sets are discussed. We show that the image and inverse image of stable cubic sets are also stable. Conditions for the image of almost cubic sets to be an almost cubic set are provided. The complement, the P-union and the P-intersection of (inverse) images of (almost) stable cubic sets are considered.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.7
• /
• pp.144-153
• /
• 1997

The inverse kinematics problem of a reclaimer which excavates and transports raw materials in a raw yard is investigated. Because of the geometric feature of the equipment in which scooping buckets are attached around the rotating disk, kinematic redundancy occurs in determining joint variable. Link coordinates are introduced following the Denavit-Hartenbery representation. For a given excavation point the forward kinematics yields 3 equations, however the number of involved joint variables in the equations is four. It is shown that the rotating disk at the end of the boom provides an extra passive degree of freedom. Two approaches are investigated in obtaining inverse kinematics solutions. The first method pre-assigns the height of excavation point which can be determined through path planning. A closed form solution is obtained for the first approach. The second method exploits the orthogonality between the normal vector at the excavation point and the z axis of the end-effector coordinate system. The geometry near the reclaiming point has been approximated as a plane, and the plane equation has been obtained by the least square method considering 8 adjacent points near the point. A closed form solution is not found for the second approach, however a linear approximate solution is provided.