• Journal of the Korean Mathematical Society
• /
• v.45 no.1
• /
• pp.63-78
• /
• 2008

We generalize several integral inequalities for analytic functions on the open unit polydisc $U^n={\{}z{\in}C^n||zj|<1,\;j=1,...,n{\}}$. It is shown that if a holomorphic function on $U^n$ belongs to the mixed norm space $A_{\vec{\omega}}^{p,q}(U^n)$, where ${\omega}_j(\cdot)$,j=1,...,n, are admissible weights, then all weighted derivations of order $|k|$ (with positive orders of derivations) belong to a related mixed norm space. The converse of the result is proved when, p, q ${\in}\;[1,\;{\infty})$ and when the order is equal to one. The equivalence of these conditions is given for all p, q ${\in}\;(0,\;{\infty})$ if ${\omega}_j(z_j)=(1-|z_j|^2)^{{\alpha}j},\;{\alpha}_j>-1$, j=1,...,n (the classical weights.) The main results here improve our results in Z. Anal. Anwendungen 23 (3) (2004), no. 3, 577-587 and Z. Anal. Anwendungen 23 (2004), no. 4, 775-782.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.11
• /
• pp.2705-2712
• /
• 2000

In meshless methods some techniques to impose essential boundary conditions have been developed since the approximations do not satisfy Kronecker delta properties at nodal points. In this study, new scheme for imposing essential boundary conditions is developed. Weight functions are modified by multiplying with auxiliary weight functions and the resulting shape functions satisfy Kronecker delta property on the bound ary nodes. In addition, the resulting shape functions possess and interpolation features on the boundary segments where essential boundary conditions are prescribed. Therefore the essential boundary conditions can be exactly satisfied with the new method. More importantly, the impositions of essential boundary conditions using the present method is relatively easy as in finite element method. Numerical examples show that the method also retains high convergence rate comparable to Lagrange multiplier method.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2477-2484
• /
• 1997

Best-first heuristic search algorithm, such as $A^{\ast}$ algorithm, are one of the most important techniques used to solve many problems in artificial intelligence. A common feature of heuristic search is its high computational complexity, which prevents the search from being applied to problems is practical domains such as route-finding in road map with significantly many nodes. In this paper, several heuristic search algorithms are concerned. A new dynamic weighting heuristic method called the pat-sensitive heuristic is proposed. It is based on a dynamic weighting heuristic, which is used to improve search effort in practical domain such as admissible heuristic is not available or heuristic accuracy is poor. It's distinctive feature compared with other dynamic weighting heuristic algorithms is path-sensitive, which means that ${\omega}$(weight) is adjusted dynamically during search process in state-space search domain. For finding an optimal path, randomly scattered road-map is used as an application area.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.2
• /
• pp.373-380
• /
• 2020

A valve product can be over-designed or too heavy. Finite element analysis was performed using ANSYS for two and three-dimensional ball valve models, and the ball weight was reduced by optimization within the allowable design criteria. The ball is structurally safe according to the computed stress values, which are within the material's admissible stress. The weight was reduced by about 22%, and the structural safety factor was 1.25. The structural safety of the seat insert and ring, which are used to prevent leakage, was confirmed through finite element analysis. It is shown that the two-dimensional analysis can result in similar values to the three-dimensional analysis for the axisymmetric structure. The redesign of the valve is not included in the results since such changes require a whole new design process, including all valve components.