• Communications of the Korean Mathematical Society
• /
• v.23 no.2
• /
• pp.279-284
• /
• 2008

In this paper, we present the constrained Jacobi polynomial which is equal to the constrained Chebyshev polynomial up to constant multiplication. For degree n=4, 5, we find the constrained Jacobi polynomial, and for $n{\geq}6$, we present the normalized constrained Jacobi polynomial which is similar to the constrained Chebyshev polynomial.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.9 no.2
• /
• pp.99-106
• /
• 2005

We present a relation between the orthogonality of the constrained Legendre polynomials over the triangular domain and the BB ($B{\acute{e}zier}\;-Bernstein$) coefficients of the polynomials using the equivalence of orthogonal complements. Using it we also show that the best constrained degree reduction of polynomials in BB form equals the best approximation of weighted Euclidean norm of coefficients of given polynomial in BB form from the coefficients of polynomials of lower degree in BB form.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.5
• /
• pp.31-39
• /
• 2015

The degree-constrained minimum spanning tree (d-MST) problem is considered NP-complete for no exact solution-yielding polynomial algorithm has been proposed to. One thus has to resort to an heuristic approximate algorithm to obtain an optimal solution to this problem. This paper therefore presents a polynomial time algorithm which obtains an intial solution to the d-MST with the help of Kruskal's algorithm and performs k-opt on the initial solution obtained so as to derive the final optimal solution. When tested on 4 graphs, the algorithm has successfully obtained the optimal solutions.

• Journal of Broadcast Engineering
• /
• v.25 no.7
• /
• pp.1073-1080
• /
• 2020

360-degree video streaming technologies have been widely developed to provide immersive virtual reality (VR) experiences. However, high computational power and bandwidth are required to transmit and render high-quality 360-degree video through a head-mounted display (HMD). One way to overcome this problem is by transmitting high-quality viewport areas. This paper therefore proposes a motion-constrained tile set (MCTS)-based tile extractor for versatile video coding (VVC). The proposed extractor extracts high-quality viewport tiles, which are simulcasted with low-quality whole video to respond to unexpected movements by the user. The experimental results demonstrate a savings of 24.81% in the bjøntegaard delta rate (BD-rate) saving for the luma peak signal-to-noise ratio (PSNR) compared to the rate obtained using a VVC anchor without tiled streaming.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1410-1413
• /
• 2003

This paper presents the design technique for controlling the oscillation in the Disk Drive Read System via Derivative State Constrained (DSC)-Optimal $H_2$ Controller. The Optimal $H_2$, DSC-Optimal $H_2$ and Incorporating of Stability Degree Specification DSC Optimal $H_2$ are discussed. The results among these schemes are compared to verify the merit of DSC that effectively suppresses the oscillation in oscillatory system. The suggestions of how to select the weights of optimal controls are given.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.1
• /
• pp.10-19
• /
• 2005

The minimum spanning tree (MST) problem is one of the traditional optimization problems. Unlike the MST, the degree constrained minimum spanning tree (DCMST) of a graph cannot, in general, be found using a polynomial time algorithm. So, finding the DCMST of a graph is a well-known NP-hard problem of importance in communications network design, road network design and other network-related problems. So, it seems to be natural to use evolutionary algorithms for solving DCMST. Especially, when applying an evolutionary algorithm to spanning tree problems, a representation and search operators should be considered simultaneously. This paper introduces a new tree representation scheme and a genetic operator for solving combinatorial tree problem using evolutionary algorithms. We performed empirical comparisons with other tree representations on several test instances and could confirm that the proposed method is superior to other tree representations. Even it is superior to edge set representation which is known as the best algorithm.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.2 s.173
• /
• pp.535-542
• /
• 2000

This paper presents a method for the dynamic analysis of constrained multibody systems undergoing abrupt collision. The proposed method uses a longer time interval to check collision than that of c onventional method. This reduces the computational effort significantly. To calculate collision points on two colliding rigid bodies, one may introduce constraints of contact. However, this causes reduction of degree of freedom and difficulty of numerical analysis. The proposed method can calculate collision points without above mentioned problems. Three numerical examples are given to demonstrate the computational efficiency and the usefulness of the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9C
• /
• pp.743-747
• /
• 2010

This paper presents an iterative adaptive hybrid image restoration algorithm for fast convergence. The local variance, mean, and maximum value are used to constrain the solution space. These parameters are computed at each iteration step using partially restored image at each iteration, and they are used to impose the degree of local smoothness on the solution. The resulting iterative algorithm exhibits increased convergence speed and better performance than typical regularized constrained least squares (RCLS) approach.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2004.11a
• /
• pp.498-502
• /
• 2004

In a link-motion mechanism, numerous links are interconnected and each link executes a constrained motion at a high speed. Due to the complicated constrained motions of the constituent links, dynamic unbalance forces and moments are generated and transmitted to the main frame. Therefore unwanted vibration is produced. This degrades productivity and precise work. Based on constrained multi-body dynamics, the kinematic analysis is carried out to enable design changes to be made. This will provide the fundamental information for significantly reducing dynamic unbalance forces and moments which are transmitted to the main frame. In this work, a link-motion punch press is selected as an example of a link-motion mechanism. To calculate the mass and inertia properties of every link comprising a link-motion punch press, 3-dimensional CAD software is utilized. The main issue in this work is to eliminate the first-order unbalance force and moment in a link-motion punch press. The mass, moment of inertia link length, location of the mass center in each link have a great impact on the degree of dynamic balancing which can be achieved maximally. Achieving good dynamic balancing in a link motion punch press is quite essential fur reliable operation at high speed.

• Journal of Ship and Ocean Technology
• /
• v.9 no.4
• /
• pp.35-46
• /
• 2005

The performance of optimisation methods, based on penalty functions, is highly problem- dependent and many methods require additional tuning of some variables. This additional tuning is the influences of penalty coefficient, which depend strongly on the degree of constraint violation. Moreover, Binary-coded Genetic Algorithm (BGA) meets certain difficulties when dealing with continuous and/or discrete search spaces with large dimensions. With the above reasons, Real-coded Micro-Genetic Algorithm (R$\mu$GA) is proposed to find the global optimum of continuous and/or discrete nonlinear constrained engineering problems without handling any of penalty functions. R$\mu$GA can help in avoiding the premature convergence and search for global solution-spaces, because of its wide spread applicability, global perspective and inherent parallelism. The proposed R$\mu$GA approach has been demonstrated by solving three different engineering design problems. From the simulation results, it has been concluded that R$\mu$GA is an effective global optimisation tool for solving continuous and/or discrete nonlinear constrained real­world optimisation problems.