• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.44 no.1
• /
• pp.19-24
• /
• 2007

In this paper, we propose a tuning method of PID-PD controller to satisfy design specifications in frequency domain as well as time domain. The proposed tuning method of PID-PD controller consists of the convex set of PID and PI-PD controller. PID-PD controller controls the closed-loop response to be located between the step responses, and Bode magnitudes of closed-loop transfer functions controlled by PID and PI-PD controller. The controller is designed by the optimum tuning method to minimize the proposed specific cost function subject to sensor noise insensitivity and robust stability. Its effectiveness is examined by the case study and analysis.

• Journal of the Society of Naval Architects of Korea
• /
• v.52 no.1
• /
• pp.70-76
• /
• 2015

The ship hull is accomplished by assembling various curved surfaces. There are numerous existing methods for ship hull processing, which need certain appropriate processing methods to enable it to be more efficient. The curved hull plates can be divided into convex region and saddle region. It is common to use line heating method to form a saddle region, when it comes to a convex region, it will be triangle heating method to be utilized. A precise analysis for curvature domain is required for the application of proper processing method. There exist various problems on existing calculation methods of curvature domain. Therefore, a more powerful method is demanded to it more accurately. In this study, a method called Dual Contouring is applied to extract curved surfaces, which is able to improve accuracy of extracted area. Based on all above, a best-suited heat processing method should be selected.

• Journal of the Korea Concrete Institute
• /
• v.20 no.5
• /
• pp.627-634
• /
• 2008

This paper presents an optimum mixture design method for proportioning a concrete. In the proposed method, the search space is constrained as the domain defined by the minimal convex region of a database, instead of the available range of each component and the ratio composed of several components. The model for defining the search space which is expressed by the effective region is proposed. The effective region model evaluates whether a mix-proportion is effective on processing for optimization, yielding highly reliable results. Three concepts are adopted to realize the proposed methodology: A genetic algorithm for the optimization; an artificial neural network for predicting material properties; and a convex hull for evaluating the effective region. And then, it was applied to an optimization problem wherein the minimum cost should be obtained under a given strength requirement. Experimental test results show that the mix-proportion obtained from the proposed methodology using convex hulls is found to be more accurate and feasible than that obtained from a general optimum technique that does not consider this aspect.

• Bulletin of the Korean Mathematical Society
• /
• v.34 no.3
• /
• pp.385-394
• /
• 1997

In this paper, we prove in p-uniforlmy convex space a fixed point theorem for a class of mappings T satsfying: for each x, y in the domain and for n = 1, 2, 3, $\cdots$, $$ \left\$\mid$ T^n x - T^n y \right\$\mid$ \leq a \cdot \left\$\mid$ x - y \right\$\mid$ + b(\left\$\mid$ x - T^n x \right\$\mid$ + \left\$\mid$ y - T^n y \right\$\mid$) + c(\left\$\mid$ c - T^n y \right\$\mid$ + \left\$\mid$ y - T^n x \right\$\mid$, $$ where a, b, c are nonnegative constants satisfying certain conditions. Further we establish some fixed point theorems for these mappings in a Hilbert space, in $L^p$ spaces, in Hardy spaces $H^p$ and in Sobolev spaces $H^{p,k}$ for 1 < p < $\infty$ and k $\leq$ 0. As a consequence of our main result, we also the results of Goebel and Kirk [7], Lim [8], Lifshitz [12], Xu [20] and others.

• Journal of applied mathematics & informatics
• /
• v.29 no.3_4
• /
• pp.921-936
• /
• 2011

In this paper, our main purpose is to establish the existence of weak solutions of a weak solutions of a class of p-q-Laplacian system involving concave-convex nonlinearities: $$\{\array{-{\Delta}_pu-{\Delta}_qu={\lambda}V(x)|u|^{r-2}u+\frac{2{\alpha}}{\alpha+\beta}|u|^{\alpha-2}u|v|^{\beta},\;x{\in}{\Omega}\\-{\Delta}p^v-{\Delta}q^v={\theta}V(x)|v|^{r-2}v+\frac{2\beta}{\alpha+\beta}|u|^{\alpha}|v|^{\beta-2}v,\;x{\in}{\Omega}\\u=v=0,\;x{\in}{\partial}{\Omega}}$$ where ${\Omega}$ is a bounded domain in $R^N$, ${\lambda}$, ${\theta}$ > 0, and 1 < ${\alpha}$, ${\beta}$, ${\alpha}+{\beta}=p^*=\frac{N_p}{N_{-p}}$ is the critical Sobolev exponent, ${\Delta}_su=div(|{\nabla}u|^{s-2}{\nabla}u)$ is the s-Laplacian of u. when 1 < r < q < p < N, we prove that there exist infinitely many weak solutions. We also obtain some results for the case 1 < q < p < r < $p^*$. The existence results of solutions are obtained by variational methods.

• Bulletin of the Korean Mathematical Society
• /
• v.22 no.2
• /
• pp.95-98
• /
• 1985

In [1], E.B. Lee and L. Markus described a sufficient condition for which the domain of null-controllability of a linear autonomous system is all of R$^{n}$ . The purpose of this note is to extend the result to a certain linear nonautonomous system. Thus we consider a linear control system dx/dt = A(t)x+B(t)u in the Eculidean n-space R$^{n}$ where A(t) and B(t) are n*n and n*m matrices, respectively, which are continuous on 0.leq.t<.inf. and A(t) is a periodic matrix of period .omega.. Admissible controls are bounded measurable functions defined on some finite subintervals of [0, .inf.) having values in a certain convex set .ohm. in R$^{m}$ with the origin in its interior. And we present a sufficient condition for which the domain of null-controllability is all of R$^{n}$ .

• Communications of the Korean Mathematical Society
• /
• v.20 no.2
• /
• pp.339-350
• /
• 2005

We obtain the following two inequalities on a strongly pseudoconvex domain $\Omega\;in\;\mathbb{C}^n\;:\;for\;f\;{\in}\;O(\Omega)$ $$\int_{0}^{{\delta}0}t^{a{\mid}a{\mid}+b}M_p^a(t, D^{a}f)dt\lesssim\int_{0}^{{\delta}0}t^{b}M_p^a(t,\;f)dt\;\int_{O}^{{\delta}O}t_{b}M_p^a(t,\;f)dt\lesssim\sum_{j=0}^{m}\int_{O}^{{\delta}O}t^{am+b}M_{p}^{a}\(t,\;\aleph^{i}f\)dt$$. In [9], Shi proved these results for the unit ball in $\mathbb{C}^n$. These are generalizations of some classical results of Hardy and Littlewood.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.23 no.11
• /
• pp.1003-1011
• /
• 2013

A new formulation of the MNDIF method is introduced to extract highly accurate eigenvalues of concave acoustic cavities. Since the MNDIF method, which was introduced by the author, can be applicable for only convex acoustic cavities, a new approach of dividing a concave cavity into two convex domains and formulating an algebraic eigenvalue problem is proposed in the paper. A system matrix equation, which gives eigenvalues, is obtained from boundary conditions for each domain and the condition of continuity in the interface between the two domains. The validity and accuracy of the proposed method are shown through example studies.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.32 no.9
• /
• pp.41-48
• /
• 2004

In this work, a domain-wise hash structure is developed for efficient data handling, and by using the developed domain-wise hash structure, an automatic triangular mesh generation algorithm is proposed. To generate the optimal nodal points and triangles efficiently, the advancing layer method and Delaunay triangulation method are utilized. To investigate the performance of the proposed algorithm, benchmarking tests are carried out for various models including convex, concave and complicated shapes through the developed object oriented C++ mesh generation code.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3C
• /
• pp.158-166
• /
• 2005

Even though post-processing methods based on projections onto convex sets (POCS) have shown good performance for blocking artifact reduction, it is infeasible to implement POCS for real-time practical applications. This paper proposes DCT domain post-processing method based on POCS. The proposed method shows very similar performance compared to the conventional POCS method, while it reduces tremendously the computational complexity. DCT domain POCS performs the lowpass filtering in the DCT domain, and it removes the inverse DCT and forward DCT modules. Through the investigation of lowpass filtering in the iterative POCS method, we define kth order lowpass filtering which is equivalent to the lowpass filtering in the kth iteration, and the corresponding kth order DCT domain POCS. Simulation results show that the kth order DCT domain POCS without iteration gives very similar performance compared to the conventional POCS with k iterations, while it requires much less computations. Hence the proposed DCT domain POCS method can be used efficiently in the practical post-processing applications with real-time constraints.