• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.1
• /
• pp.51-62
• /
• 2008

This paper proposes a second-order implicit constraint enforcement method which yields enhanced controllability compared to a first-order implicit constraints enforcement method. Although the proposed method requires solving a linear system twice, it yields superior accuracy from the constraints error perspective and guarantees the precise and natural movement of objects, in contrast to the first-order method. Thus, the proposed method is the most suitable for exact prediction simulations. This paper describes the numerical formulation of second-order implicit constraints enforcement. To prove its superiority, the proposed method is compared with the firstorder method using a simple two-link simulation. In this paper, there is a reasonable discussion about the comparison of constraints error and the analysis of dynamic behavior using kinetic energy and potential energy.

• East Asian mathematical journal
• /
• v.28 no.1
• /
• pp.37-47
• /
• 2012

In this paper, we study generalized implicit variational-like inclusions and $J^{\eta}$-proximal operator equations in Banach spaces. It is established that generalized implicit variational-like inclusions in real Banach spaces are equivalent to fixed point problems. We also establish relationship between generalized implicit variational-like inclusions and $J^{\eta}$-proximal operator equations. This equivalence is used to suggest a iterative algorithm for solving $J^{\eta}$-proximal operator equations.

• Kyungpook Mathematical Journal
• /
• v.46 no.1
• /
• pp.145-152
• /
• 2006

In this paper, we study a class of strongly nonlinear implicit complementarity problems in the setting of Hilbert spaces H (not necessarily Hilbert lattices). By using the property of the projection and a suitable change of variables, we establish the equivalence between the strongly nonlinear implicit complementarity problem and the fixed point problem in H. Moreover, we use this equivalence and the fixed point theorem of Boyd and Wong to prove the existence and uniqueness of solutions for the strongly nonlinear implicit complementarity problem in H.

• International Journal of Contents
• /
• v.14 no.4
• /
• pp.24-29
• /
• 2018

EEG-based brain-computer interfaces has focused on explicitly expressed intentions to assist physically impaired patients. For EEG-based-computer interfaces to function effectively, it should be able to understand users' implicit information. Since it is hard to gather EEG signals of human brains, we do not have enough training data which are essential for proper classification performance of implicit intention. In this paper, we improve the subject independent classification of implicit intention through the generation of additional training data. In the first stage, we perform the PCA (principal component analysis) of training data in a bid to remove redundant components in the components within the input data. After the dimension reduction by PCA, we train ICA (independent component analysis) network whose outputs are statistically independent. We can get additional training data by adding Gaussian noises to ICA outputs and projecting them to input data domain. Through simulations with EEG data provided by CNSL, KAIST, we improve the classification performance from 65.05% to 66.69% with Gamma components. The proposed sample generation method can be applied to any machine learning problem with fewer samples.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.1
• /
• pp.13-29
• /
• 2007

In this paper, we first present a method for finding the implicit equation of the curve given by rational parametric equations. The method is based on the computation of $Gr\"{o}bner$ bases. Then, another method for implicitization of curve and surface is given. In the case of rational curves, the method proceeds via giving the implicit polynomial f with indeterminate coefficients, substituting the rational expressions for the given curve and surface into the implicit polynomial to yield a rational expression $\frac{g}{h}$ in the parameters. Equating coefficients of g in terms of parameters to 0 to get a system of linear equations in the indeterminate coefficients of polynomial f, and finally solving the linear system, we get all the coefficients of f, and thus we obtain the corresponding implicit equation. In the case of polynomial surfaces, we can similarly as in the case of rational curves obtain its implicit equation. This method is based on characteristic set theory. Some examples will show that our methods are efficient.

• Journal of Korea Multimedia Society
• /
• v.12 no.1
• /
• pp.50-57
• /
• 2009

This paper proposes a extraction of feature lines on a polygonal model using local implicit surface fitting technique. To extract feature lines on a polygonal model, the previous technique addressed to compute the curvature and their derivatives at mesh vertices via global implicit surface fitting. It needs a user-specified precision parameter for finding an accurate projection of the mesh vertices onto an approximating implicit surface and requires high-time consumption. But we use a local implicit surface fitting technique to estimate the local differential information near a vertex by means of an approximating surface. Feature vertices are easily detected as zero-crossings, and can then be connected along the direction of principal curvature. Our method, demonstrated on several large polygonal models, produces a good fit which leads to improved visualization.

• Journal of Korea Multimedia Society
• /
• v.8 no.2
• /
• pp.249-257
• /
• 2005

This paper aims at reducing aliasing in pixel-based rendering for 3D implicit surfaces by shifted multi Z-buffers. The voxelized implicit surfaces with high resolution take so much time in generating high Quality image without aliasing. So in rendering a voxelized implicit surfaces, a new antialiasing method which can generate a high quality image at a lower resolution is required. Therefore, this paper suggests that a method which get various sampling values by shifting several z-buffers in each voxel and average them, The advantages are effective memory, simple calculation and easy convergence with various filters. But, the increase of number of z-buffer also increase the consuming time rapidly. Therefore, the research for representing the relation the degree of image quality with the consumption of time as a number is required.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.38 no.12
• /
• pp.1153-1161
• /
• 2010

An efficient solution method for harmonic balance techniques with Fourier transform is presented for periodic unsteady flow problems. The present partially-implicit harmonic balance treats the flux terms implicitly and the harmonic source term is solved explicitly. The convergence of the partially Implicit method is much faster than the explicit Runge-Kutta harmonic balance method. The method does not need to compute the additional flux Jacobian matrix from the implicit harmonic source term. Compared with fully implicit harmonic balance method, this partial approach turns out to have good convergence property. Oscillating flows over NACA0012 airfoil are considered to verify the method and to compare with results of explicit R-K(Runge-Kutta) and dual time stepping methods.

• Land and Housing Review
• /
• v.1 no.1
• /
• pp.59-65
• /
• 2010

The paper presents a comparison between a semi-implicit time integration linear finite element implementation and fully-implicit nonlinear Newton-Raphson finite element implementation of a triphasic small strain mixture formulation of an elastic partially saturated porous medium. The pore air phase pressure pa is assumed atmospheric, i.e., $p_a$ = 0, although the formulation and implementation are general to handle increase in pore air pressure as a result of loading, if needed. The solid skeleton phase is assumed linear isotropic elastic and partially saturated 'consolidation' in the presence of surface infiltration and traction is simulated. The verification of the implementation against an analytical solution for partially saturated pore water flow (no deformation) and comparison between the two implementations is presented and the important of the porosity-dependent nature of the partially saturated permeability is assessed on comparison with a commercial code for the partially saturated flow with deformation. As a result, the response of partially saturated permeability subjected to the porosity influences on the saturation of a soil, and the different behaviors of the partially saturated soil between staggered and monolithic coupled programs is worth of attention because the negative pore water pressure in the partially saturated soil depends on the difference.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.4
• /
• pp.744-752
• /
• 2017

ECQV implicit certificate reconstructs the public key from the certificate without validation of the signature unlike the explicit certificate. Like this, the certificate and the public key is implicitly validated when a public key is reconstructed from a certificate. Hence, ECQV implicit certificate is shorter than the explicit certificate due to be only comprised of the public key reconstruction data instead of the signature and the public key, and faster to reconstruct the public key from the certificate than validating the signature. Furthermore, ECQV is well suited for environments and application that resources such as memory and bandwidth are limited because it is shorter the key length, and faster the performance than other cipher cryptography due to be run on ECC. In this paper, we describe prerequisites of ECQV specified in the SECG SEC 4 and issuance of an implicit certificate, reconstruction of the public key from an implicit certificate. Also we designed and implemented ECQV, and measured the performance of it.