• Journal of Internet Computing and Services
• /
• v.8 no.2
• /
• pp.33-41
• /
• 2007

With the development of the multicast technology, the realtime strategy among the group applications using the multicast routing is getting more important. An essential factor of these real-time application is to optimize the Delay- and delay Variation-Bounded Multicast Tree(DVBMT) problem. This problem is to satisfy the minimum delay variation and the end-to-end delay within an upper bound. The DVBMT problem is known as NP-complete problem. The representative algorithms for the problem are DVMA, DDVCA, and so on. In this paper, we show that the proposed algorithm outperforms any other algorithm. The efficiency of our algorithm is verified through the prerformance evaluation and the enhancement is up to about 9% to 29% in terms of the multicast delay variation. The time complexity of our algorithm is $O(mn^2)$M.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.147-154
• /
• 2004

In this paper, Inverted Coordinates Image Space (ICIS) is proposed as a solution for the problem of the unbounded accumulator space in the automatic detection of the finite/infinite vanishing points in image space. Since the ICIS is based on the direct transformation from the image space, it does not lose any geometrical information from the original image and it does not require camera calibration as opposed to the Gaussian sphere based methods. Moreover, the proposed method can accurately detect both the finite and infinite vanishing points under a small fixed memory amount as opposed to the conventional image space based methods. Experiments are conducted on various real images in architectural environments to show the advantages of the proposed approach over conventional methods.

• Journal of the Korean Mathematical Society
• /
• v.56 no.5
• /
• pp.1333-1354
• /
• 2019

In authors' paper in 2007, it was shown that the BSE-extension of $C^1_0(R)$, the algebra of continuously differentiable functions f on the real number space R such that f and df /dx vanish at infinity, is the Lipschitz algebra $Lip_1(R)$. This paper extends this result to the case of $C^n_0(R^d)$ and $C^{n-1,1}_b(R^d)$, where n and d represent arbitrary natural numbers. Here $C^n_0(R^d)$ is the space of all n-times continuously differentiable functions f on $R^d$ whose k-times derivatives are vanishing at infinity for k = 0, ${\cdots}$, n, and $C^{n-1,1}_b(R^d)$ is the space of all (n - 1)-times continuously differentiable functions on $R^d$ whose k-times derivatives are bounded for k = 0, ${\cdots}$, n - 1, and (n - 1)-times derivatives are Lipschitz. As a byproduct of our investigation we obtain an important result that $C^{n-1,1}_b(R^d)$ has a predual.

• Journal of the Korean Mathematical Society
• /
• v.38 no.6
• /
• pp.1191-1204
• /
• 2001

The paper is devoted to the study of fractional integration and differentiation on a finite interval [a, b] of the real axis in the frame of Hadamard setting. The constructions under consideration generalize the modified integration $\int_{a}^{x}(t/x)^{\mu}f(t)dt/t$ and the modified differentiation ${\delta}+{\mu}({\delta}=xD,D=d/dx)$ with real $\mu$, being taken n times. Conditions are given for such a Hadamard-type fractional integration operator to be bounded in the space $X^{p}_{c}$(a, b) of Lebesgue measurable functions f on $R_{+}=(0,{\infty})$ such that for c${\in}R=(-{\infty}{\infty})$, in particular in the space $L^{p}(0,{\infty})\;(1{\le}{\le}{\infty})$. The existence almost every where is established for the coorresponding Hadamard-type fractional derivative for a function g(x) such that $x^{p}$g(x) have $\delta$ derivatives up to order n-1 on [a, b] and ${\delta}^{n-1}[x^{\mu}$g(x)] is absolutely continuous on [a, b]. Semigroup and reciprocal properties for the above operators are proved.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.280-284
• /
• 1997

In this paper, Nonlinear VSS control based on bang-bang control concept is derived under the assumption that the control input is bounded. We try to derive control algorithm which has almost same performance as the time optimal control. We focus this control scheme on the real implementation of DC motor position controller of flexible link, i.e. we obtain the switching curves from the real data of DC motor system operating under the full maximum and minimum applied voltages. State space is separated into several regions and we set different switching surfaces in each region to reduce chattering problem. The efficiency of the proposed controller is compared with PID controller and it is shown that the controller converges fast than PID controller without chattering. The hybrid controller scheme is also proposed not only to control the position of hub but also to reduce the vibration of end tip of flexible link.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.1013-1017
• /
• 2005

This paper proposes an effective algorithm, P-DCF(Polling DCF) to satisfy real-time requirements in the industrial environments, based on 802.11 DCF protocols. Theoretical analysis and actual experiments are carried out, which shows that the proposed P-DCF brings several benefits: 1) it reduces the time delay for frame transmission 2)it guarantees bounded upper limit of maximum transmission delay 3) it maintains fairness

• Journal of Information Processing Systems
• /
• v.4 no.2
• /
• pp.41-52
• /
• 2008

In this paper, we discuss a novel reservation-based, asynchronous MAC protocol called 'Multi-rate Multi-hop MAC Protocol' (MMMP) for multi-hop ad hoc networks that provides QoS guarantees for multimedia traffic. MMMP achieves this by providing service differentiation for multirate real-time traffic (both constant and variable bit rate traffic) and guaranteeing a bounded end-to-end delay for the same while still catering to the throughput requirements of non real time traffic. In addition, it administers bandwidth preservation via a feature called 'Smart Drop' and implements efficient bandwidth usage through a mechanism called 'Release Bandwidth'. Simulation results on the QualNet simulator indicate that MMMP outperforms IEEE 802.11 on all performance metrics and can efficiently handle a large range of traffic intensity. It also outperforms other similar state-of-the-art MAC protocols.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1609-1615
• /
• 2006

Overlay multicast technique is an effective way as an alternative to IP multicast. Traditional IP multicast is not widely deployed because of the complexity of IP multicast technology and lack of application. But overlay multicast can be easily deployed by effectively reducing complexity of network routers. Because overlay multicast resides on top of densely connected IP network, In case of multimedia streaming service over overlay multicast tree, real-time data is sensitive to end-to-end delay. Therefore, moderate algorithm's development to this network environment is very important. In this paper, we are interested in minimizing maximum end-to-end delay in overlay multicast tree. The problem is formulated as a degree-bounded minimum delay spanning tree, which is a problem well-known as NP-hard. We develop tabu search heuristic with intensification and diversification strategies. Robust experimental results show that is comparable to the optimal solution and applicable in real time

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.246-248
• /
• 2005

The Controller Area Network (CAN) is being widely used for real-time control application and small-scale distributed computer controller systems. However, CAN may exhibit unfair behavior under heavy traffic conditions. When there are both high and low priority messages ready for transmission, the proposed precedence priority filtering method allows one low priority message to be exchanged between any two adjacent higher priority messages. In this way, the length of each transmission delays is upper bounded. These procedures are implemented as local controllers for the ISHURO (Inha Semyung Humanoid RObot).

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.165.1-165
• /
• 2001

The evolution strategy is a good evolutionary algorithm to find the global optimum of a real-valued function. Since many engineering problems can be formulated as real valued function optimization, the evolution strategy is frequently employed in engineering fields. However, in many engineering optimization problems, an optimization parameter is often restricted in the bounded region between two specified values, the minimum and the maximum limit, respectively. Since an offspring individual is generated randomly around a parent individual during mutation process of the evolution strategy, an individual outside the search region can be generated even if the parent is inside the search region. This paper proposes two new boundary-handling techniques for evolution strategies. One is the ...