• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1986.04a
• /
• pp.14-17
• /
• 1986

In this paper, it is studied on the properties of the transmission signal for being tolerant to the timing jitter at the receiver, when an ideal low pass filter is used as the pulse shaper. A model for the transmission system with minimum bandwidth is presented and the related parameters to the tolerance or stability are explained. It has been proven that the necessary condition for a stable signaling is the same as the sufficient one.

• Proceedings of the KIEE Conference
• /
• 1987.07a
• /
• pp.110-114
• /
• 1987

A method for synthesizing low-pass elliptic filters in a microstrip configuration is presented. The realization consists of the cascade connection of proper rectangular elements, each one corresponding to four reactive elements of the lumped-constant prototype. This allows an effictive control of parasitics and unwanted reactances. Which results in the possibility of realizing higher order filters with cutoff frequencies UP to X-band. Fifth and seventh order filters were fabricated on allumina substrates.

• Communications of the Korean Mathematical Society
• /
• v.11 no.1
• /
• pp.153-167
• /
• 1996

In this paper we investigate the existence of solutions of a nonlinear wave equation $u_{tt} - u_{xx} = p(x, t, u)$$ in $H_0$, where $H_0$ is the Hilbert space spanned by eigenfunctions. If p satisfy condition $(p_1) - (p_3)$, this nonlinear gave equation has at least one solution.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1453-1456
• /
• 2004

PARO, a power-aware routing optimization mechanism, is proposed in [1] to minimize the transmission power needed to forward packets between wireless devices in ad hoc network. The mechanism works by redirecting the route to pass through one or more intermediate nodes on behalf on source-destination pairs, then reducing the end-to-end transmission power. This paper will show an extension of this model and provide an analysis of the geometrical area lying between source and destination in which the intermediate node elects to perform redirection. The duration the intermediate node stays in that area is also computed.

• Journal of the Korean Mathematical Society
• /
• v.58 no.5
• /
• pp.1131-1145
• /
• 2021

In this article, we study the Klein-Gordon-Maxwell equations arising from a semilocal gauge field model. This model describes the interaction of two complex scalar fields and one gauge field, and generalizes the classical Klein-Gordon equation coupled with the Maxwell electrodynamics. We prove that there exist infinitely many standing wave solutions for p ∈ (2, 6) which are radially symmetric. Here, p comes from the exponent of the potential of scalar fields. We also prove the nonexistence of nontrivial solutions for the critical case p = 6.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.12
• /
• pp.691-698
• /
• 2003

In this paper, we propose a problem, called one-to-one disjoint path cover problem, whether or not there exist k disjoint paths joining a pair of vertices which pass through all the vertices other than the two exactly once. A graph which for an arbitrary k, has a one-to-one disjoint path cover between an arbitrary pair of vertices has a hamiltonian property stronger than hamiltonian-connectedness. We investigate this problem on recursive circulants and prove that for an arbitrary k $k(1{\leq}k{\leq}m)$$ G(2^m,4)$,$m{\geq}3$, has a one-to-one disjoint path cover consisting of k paths between an arbitrary pair of vortices.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.21 no.6
• /
• pp.1-20
• /
• 2022

The basic way to charge vehicles for using road and public transport networks is the entry-exit toll system. This system works by reading Hi-Pass and public transportation cards of the vehicles using card readers. However, the problems of navigating a route in consideration of entry-exit toll systems include the non-additive costs of enumerating routes. This problem is known as an NP-complete task that enumerates all paths and derives the optimal path. So far, the solution to the entry-exit toll system charging has been proposed in the form of transforming the road network. However, unlike in the public transport network where the cards are generalized, this solution has not been found in situations where network expansion is required with a transfer, multi-modes and multiple card readers. Hence, this study introduced the Link Label for a public transportation network composed of card readers in which network expansion is bypassed in selecting the optimal path by enumerating the paths through a one-to-one k-path search. Since the method proposed in this study constructs a relatively small set of paths, finding the optimal path is not burdensome in terms of computing power. In addition, the ease of comparison of sensitivity between paths indicates the possibility of using this method as a generalized means of deriving an optimal path.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.6
• /
• pp.1074-1079
• /
• 1987

We present a fast, constructive algorithm for the automatic placement of standard cells, which consists of two steps. The first step is responsible for cell-row assignment of each cell, and converts the circuit connectivity into a multi-stage graph under to constraint that sum of the cell-widths in each stage of the multi-state graph does not exceed maximum cell-row width. Generatin of feed-through cells in the final layout was shown to be drastically reduced by this step. In the second step, the position of each cell within the row is determined one by one from left to right so that the cost function such as the local channel density is minimized. Our experimental result shows that this algorithm yields near optimal results in terms of the number of feed-through cells and the horizontal tracks, while running about 100 times faster than other iterative procedures such as pairwise interchange and generalized force directed relaxation method.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.345-361
• /
• 2005

A transform-space index indexes objects represented as points in the transform space An advantage of a transform-space index is that optimization of join algorithms using these indexes becomes relatively simple. However, the disadvantage is that these algorithms cannot be applied to original-space indexes such as the R-tree. As a way of overcoming this disadvantages, the authors earlier proposed the transform-space view join algorithm that joins two original- space indexes in the transform space through the notion of the transform-space view. A transform-space view is a virtual transform-space index that allows us to perform join in the transform space using original-space indexes. In a transform-space view join algorithm, the order of accessing disk pages -for which various space filling curves could be used -makes a significant impact on the performance of joins. In this paper, we Propose a new space filling curve called the adaptive row major order (ARM order). The ARM order adaptively controls the order of accessing pages and significantly reduces the one-pass buffer size (the minimum buffer size required for guaranteeing one disk access per page) and the number of disk accesses for a given buffer size. Through analysis and experiments, we verify the excellence of the ARM order when used with the transform-space view join. The transform-space view join with the ARM order always outperforms existing ones in terms of both measures used: the one-pass buffer size and the number of disk accesses for a given buffer size. Compared to other conventional space filling curves used with the transform-space view join, it reduces the one-pass buffer size by up to 21.3 times and the number of disk accesses by up to $74.6\%$. In addition, compared to existing spatial join algorithms that use R-trees in the original space, it reduces the one-pass buffer size by up to 15.7 times and the number of disk accesses by up to $65.3\%$.

• Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
• /
• 2002.10b
• /
• pp.365-366
• /
• 2002

The sliding wear behavior of ultra high molecular weight polyethylene (UHMWPE) was examined on a novel low temperature degradation-free zirconia/alumina composite material and conventional alumina and zirconia ceramics used for femoral head in total hip joint replacement. The wear of UHMWPE pins against these ceramic disks was evaluated by performing linear reciprocal sliding and repeat pass rotational sliding tests for one million cycles in bovine serum. The weight loss of polyethylene against the novel low temperature degradation-free zirconia/alumina composite disks was much less than those against conventional ceramics for all tests. The mean weight loss of the polyethylene pins was more io the linear reciprocal sliding test than in the repeal pass rotational sliding lest for all kinds of disk materials. Neither the coherent transfer film nor the surface damage was observed on the surface of the novel zirconia/alumina composite disks during the test. The observed r,'stilts indicated that the wear of the polyethylene was closely related to contacting materials and kinematic motions. In conclusion, the novel zirconia/alumina composite leads the least wear of polyethylene among the tested ceramics and demonstrates the potential as lhe alternative materials for femoral head in total hip joint replacement.