• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.6
• /
• pp.189-196
• /
• 2003

The NURBS surfaces are widely employed for exchanging geometric models between different CAD/CAE systems. However if the input NURBS surfaces are poorly parameterized, most surface meshing algorithms may fail or the constructed meshes can be ill-conditioned. In this paper presents a new method is presented that can generate well conditioned meshes even on poorly parameterized NURBS surfaces by regenerating NURBS surfaces. To begin with, adequate points are sampled on original poorly parameterized surfaces and new surfaces are created by interpolating these points. And then, mesh generation is performed on new surfaces. With this method, models with poorly parameterized NURBS surfaces can be meshed successfully.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.5
• /
• pp.1669-1681
• /
• 2015

In this paper, we provide semi-convergence results of the parameterized inexact Uzawa method with singular preconditioners for solving singular saddle point problems. We also provide numerical experiments to examine the effectiveness of the parameterized inexact Uzawa method with singular preconditioners.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.10a
• /
• pp.784-787
• /
• 2002

The NURBS surfaces are widely employed for exchanging geometric models between different CAD/CAE systems. However if the input NURBS surfaces are poorly parameterized, most surface meshing algorithms may fail or the constructed meshes can be ill-conditioned. In this paper presents a new method is presented that can generate well conditioned meshes even on poorly parameterized NURBS surfaces by regenerating NURBS surfaces. To begin with, adequate Points are sample on original poorly parameterized surfaces and new surfaces are created by interpolating these points. And then. mesh generation is performed on new surfaces. With this method, models with poorly parameterized NURBS surfaces can be meshed successfully.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.53 no.8
• /
• pp.469-476
• /
• 2004

In this paper, a 3D shape optimization algorithm which guarantees a smooth optimal shape is presented using parameterized sensitivity analysis. The design surface is parameterized using Bezier spline and B-spline, and the control points of the spline are taken as the design variables. The parameterized sensitivity for the control points are found from that for nodal points. The design sensitivity and adjoint variable formulae are also derived for the 3D non-linear problems. Through an application to the shape optimization of 3D electromagnet to get a uniform magnetic field, the effectiveness of the proposed algorithm is shown.

• Proceedings of the KIEE Conference
• /
• 2003.07b
• /
• pp.915-917
• /
• 2003

In this paper, a 3D shape optimization algorithm which guarantees a smooth optimal shape is presented using parameterized sensitivity analysis. The design surface is parameterized using Bezier spline and the control points of the spline are taken as the design variables. The parameterized sensitivity for the control points are found from that for nodal Points. The design sensitivity and adjoint variable formulae are also derived for the 3D non-linear problems. Through an application to the shape optimization of 3D electromagnet to get a uniform magnetic field, the effectiveness of the proposed algorithm is shown.

• East Asian mathematical journal
• /
• v.30 no.3
• /
• pp.335-353
• /
• 2014

We establish multiple extence of positive solutions for parameterized nonhomogeneous elliptic equations involving critical Sobolev exponent. The approach to the problem is variational method.

• Journal of KIISE:Software and Applications
• /
• v.36 no.6
• /
• pp.431-442
• /
• 2009

The Software Product Line (SPL) engineering is one of the most promising software development paradigms. With Feature-Oriented Reuse Method (FORM), reusable and flexible components can be built to aid the delivery of various software products such as mobile phone and digital TV applications based on commonalities and variabilities identified during Feature modeling. Model Driven Architecture (MDA) is also an emerging technology which supports developing software products to work on different platforms with platform independent models (PIM). Combining advantages of these two approaches is helpful to build a group of software products which share common Features while working on various platforms. As first step to combine FORM with MDA, we extend UML2.0 with profiles by which FORM architectures and parameterized Statecharts can be modeled. Secondly, we provide rules to examine whether Features are allocated at positions of elements of Statecharts consistently between a Feature model and a parameterized Statechart. Some rules are designed to check the consistency between FORM architectures and parameterized Statecharts. A case study on an elevator control system is provided to demonstrate the feasibility of our modeling approach and consistency checking rules.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1280-1287
• /
• 2006

We propose a modified stochastic gradient-based (MSGB) filter showing that the filter is the solution to an optimization problem. This paper analyzes the properties of the MSGB filter that corresponds to the nonlinear adaptive filter with additional update terms, parameterized by the variable scaling factor. The variably parameterized MSGB filter plays a role iii connecting the fixed parameterized MSGB filter and the null parameterized MSGB filter through variably scaling parameter. The stability regions and misadjustments are shown. A system identification is utilized to perform the computer simulation and demonstrate the improved performance feature of the MSGB filter.

• International journal of advanced smart convergence
• /
• v.9 no.2
• /
• pp.164-172
• /
• 2020

The interest and importance of the convergence services for healthcare expand more and more as the average life expectancy increases. Convergence of ICT and healthcare technology unfold efficient and quick health services. Recently, healthcare services provide to clients with apps over web. On-demand wireless data broadcast supports any number of clients to access their desired data items dynamically by responding the needs for data items from the clients. In this paper, we propose an on-demand system to broadcast FHIR bundles for efficient healthcare services. We use time-parameterized replacing policy for renewing the bundle items on the wireless broadcast channel. The policy lets the on-demand broadcasting dynamic by controlling the time duration for the bundles to reside over the wireless channel. With simulation studies using an implemented testbed, we evaluate the performances of the proposed system in access time and tuning time. For evaluation, we compare the time-parameterized replacing policy of the proposed system with regular-number replacing policy. The proposed time-parameterized replacing policy shows shorter access time than the regular-number replacing policy because the policy responds more actively and dynamically to the change of the needs of the clients for FHIR bundles.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2332-2342
• /
• 1999

Multicast is an important system-level one-to-many collective communication service. A key issue in designing software multicast algorithms is to consider the trade-off between performance and portability. Based on the LogP model, the proposed parameterized communication model can more accurately characterize the communication network of parallel platforms, Under the parameterized model, we propose an efficient architecture-independent method. OPT-tree algorithm, to construct optimal multicast trees and also investigate architecture-dependent tuning on performance of the multicast algorithm to achieve the truly optimal performance when implemented in real networks. Specifically, OPT-mesh which is the optimized version of the parameterized multicast algorithm for wormhole-switched mesh networks is developed and compared with two other well-known network-dependent algorithms.