• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.261-277
• /
• 2005

We propose the PAD (Power Aware Data-centric Routing Protocol), which finds minimum energy routes and prolongs network life-time, for the data-centric sensor networks. Firstly, the PAD discovers the minimum energy Property graph by removing redundant communication links. The proposed a1gorithm to find the minimum energy property graph is faster, simpler and easier to implement than existing aIgorithms. Secondly, the PAD runs the DDBF (Distributed Data-centric Bellman-Ford Algorithm) to determine routing paths between a base node and all sensor nodes. The DDBF selves the drawbacks of the distributed bellman-ford algorithm, i.e. slow convergence and a possible cyclic routing path. Since the PAD is a fully distributed algorithm with low overhead, it can be used in various kinds of resource limited sensor network applications.

• Journal of the Korean Mathematical Society
• /
• v.51 no.5
• /
• pp.919-940
• /
• 2014

We conjecture that if $k{\geq}2$ is an integer and G is a graph of order n with minimum degree at least (n+2k)/2, then for any k independent edges $e_1$, ${\cdots}$, $e_k$ in G and for any integer partition $n=n_1+{\cdots}+n_k$ with $n_i{\geq}4(1{\leq}i{\leq}k)$, G has k disjoint cycles $C_1$, ${\cdots}$, $C_k$ of orders $n_1$, ${\cdots}$, $n_k$, respectively, such that $C_i$ passes through $e_i$ for all $1{\leq}i{\leq}k$. We show that this conjecture is true for the case k = 2. The minimum degree condition is sharp in general.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.401-402
• /
• 2007

In this paper, we propose an automatic method to finding corresponding points. One 2D image can be changed 3D shape by 3D model. The main idea is using gabor wavelet values from 3D model. And Elastic Bunch Graph Matching algorithm is more stable in 3D model.

• Journal of Korea Multimedia Society
• /
• v.14 no.12
• /
• pp.1559-1571
• /
• 2011

In wireless ad hoc networks, nodes communicate with each other using multihop routed transmission in which hop-by-hop cooperative diversity can be effectively employed. This paper proposes (i) two cooperation models for per-link cooperation (PLC) and per-node cooperation (PNC) for exploiting cooperative diversity in wireless ad hoc networks and (ii) a cooperative routing algorithm for the above models in which best relays are selected for cooperative transmission. First, two cooperation models for PLC and PNC are introduced and represented as an edge-weighted graph with effective link quality. Then, the proposed models are transformed into a simplified graph and a cooperative routing algorithm with O(n2) time is developed, where n is the number of nodes in the network. The effectiveness of the algorithm is confirmed for the two cooperation models using simulation.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.267-270
• /
• 2001

A lot of efforts have been made to analyze the performance of the vehicle equipped with automatic transmission through simulation. It might be necessary to understand the different types of transmissions, i.e., different power flows, for different models. If there is a module that can be applied to different types of automatic transmission, it could be helpful to transmission-related engineers. This study has started up from this idea. The common bond graph has been obtained from several types of the automatic transmission. The overall generalized equations and kinematic constraint equations have been derived using virtual power sources on common bond graph. They are used to derive state equations and constraints. These equations have been applied as an application to the vehicle equipped with two simple planetary gear set type of Ravigneaux gear type automatic transmission. The state equation, kinematic constraints, and dynamic constraints have been derived in every gear and shift operation using overall generalized equations and kinematic constraint equations. Simulations for constraint speed running, standing-start running, rolling-start running, and LA-4 mode have been conducted to analyze the performance of the vehicle powertrain using GVPS(Generalized Vehicle Powertrain Simulation) program wit pull down menus.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.5 no.1
• /
• pp.29-33
• /
• 2004

In this paper, I'm tying to define the connection of the Device Characteristics and the Error Terms, and yield maximum estimated value of the mismatching errors by modeling the individual devices with signal-flow graph, and by seeking the transfer function of the system with the mismatching error in the combination of the devices using the Signal-flow Graph Gain Formula.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.3
• /
• pp.848-858
• /
• 2014

In this paper the construction of a model that represents the behavior of an Electric Vehicle is described. Both the mechanical and the electric traction systems are represented using Multi-Bond Graph structural approach suited to model large scale physical systems. Then the model of the controllers, represented with a functional approach, is included giving rise to an integrated model which exploits the advantages of both approaches. Simulation and experimental results are aimed to illustrate the electromechanical interaction and to validate the proposal.

• Communications of the Korean Mathematical Society
• /
• v.33 no.1
• /
• pp.85-101
• /
• 2018

Let S be a polynomial ring over a field K, with a monomial order ${\prec}$, and let I be an unmixed graded ideal of S. In this paper we study two functions associated to I: The minimum distance function ${\delta}_I$ and the footprint function $fp_I$. It is shown that ${\delta}_I$ is positive and that $fp_I$ is positive if the initial ideal of I is unmixed. Then we show that if I is radical and its associated primes are generated by linear forms, then ${\delta}_I$ is strictly decreasing until it reaches the asymptotic value 1. If I is the edge ideal of a Cohen-Macaulay bipartite graph, we show that ${\delta}_I(d)=1$ for d greater than or equal to the regularity of S/I. For a graded ideal of dimension ${\geq}1$, whose initial ideal is a complete intersection, we give an exact sharp lower bound for the corresponding minimum distance function.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1995.10b
• /
• pp.378-383
• /
• 1995

Kandil[5] introduced and studied the notion of fuzzy bitopological spaces as a natural generalization of fuzzy topological In [10], Sampath Kumar introduced and studied the concepts of ( i, j)-fuzzy semiopen sets, fuzzy pairwise semicontinuous mappings in the fuzzy bitopological spaces. Also, he defined the concepts of ( i, j)-fuzzy -open sets, ( i, j)-fuzzy preopen sets, fuzzy pairwise -continuous mappings and fuzzy pairwise precontinuous mappings in the fuzzy bitopological spaces and studied some of their basic properties. In this paper, we generalize the concepts of fuzzy -open sets, fuzzy -continous mappings ？ 새 Mashhour, Ghanim and Fata Alla[6] into fuzzy bitopological spaces, We first define the concepts of ( i, j)-fuzzy -open sets and then consider the generalizations of fuzzy pairwise -continuous mappings is obtained Besides many basic results, results related to products and graph of mapping are obtained in the fuzzy bitopological spaces.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.3316-3332
• /
• 2019

In a transitive signature scheme, a signer wants to authenticate edges in a dynamically growing and transitively closed graph. Using transitive signature schemes it is possible to authenticate an edge (i, k), if the signer has already authenticated two edges (i, j) and (j, k). That is, it is possible to make a signature on (i, k) using two signatures on (i, j) and (j, k). We propose the first transitive signature schemes for undirected graphs from lattices. Our first scheme is provably secure in the random oracle model and our second scheme is provably secure in the standard model.