This paper is concerned with a technique for solving Volterra integro-dierential equationsin the reproducing kernel Hilbert space. In contrast with the conventional reproducing kernelmethod, the Gram-Schmidt process is omitted here and satisfactory results are obtained.The analytical solution is represented in the form of series. An iterative method is given toobtain the...

In this paper, the combination of equalization and turbo decoding is studied. In the iterative decoding of a product code in block turbo coding system, the equalization process is performed within the iteration loop. The present study aims to investigate the decision feedback equalizer (DFE) incorporated in the iterative decoding. Simulation results show that the more severe the channel interfe...

In order to predict the jetting and the subsequent buckling flow more accurately, a three dimensional melt flow model was established on a viscous, incompressible, and non-isothermal fluid, and a control volume-based finite volume method was employed to discretize the governing equations. A two-fold iterative method was proposed to decouple the dependence among pressure, velocity, and temperatu...

PURPOSE Present an analysis methodology for developing and evaluating accommodating intraocular lenses incorporating a deformable interface. METHODS The next generation design of extruded gel interface intraocular lens is presented. A prototype based upon similar previously in vivo proven design was tested with measurements of actuation force, lens power, interface contour, optical transfer f...

in the present paper‎, ‎we propose an iterative algorithm for‎ ‎solving the generalized $(p,q)$-reflexive solution of the quaternion matrix‎ ‎equation $overset{u}{underset{l=1}{sum}}a_{l}xb_{l}+overset{v} ‎{underset{s=1}{sum}}c_{s}widetilde{x}d_{s}=f$‎. ‎by this iterative algorithm‎, ‎the solvability of the problem can be determined automatically‎. ‎when the‎ ‎matrix equation is consistent over...

Zero forcing is a deterministic iterative graph coloring process in which vertices are colored either blue or white, and every round, any that have single white neighbor force these to become blue. Here we study probabilistic zero forcing, where non-zero probability of each We explore the propagation time for on Erd?s–Réyni random G ( n , p ) when start with vertex show = log ? o 1 then high it...

This paper proposes two syntactic positions for the wide range of Cantonese sentence-final particles that occur in the CP domain. The first position that I argue for is identified with the Force head (SFP1) of the C space (à la Rizzi 1997) which hosts particles that express speech acts and speaker-oriented modality. The second position (SFP2) is an iterative head located lower than the higher T...

We demonstrate Magnetic Force Microscopy (MFM) imaging, at room temperature in air, of a 0.25mA DC current path in a 140nm-wide gold nanowire. The nanowire was created by focused ion beam milling of a 12μm wide Cr/Au line of 20nm/110nm Cr/Au thickness. Iterative fitting of the MFM data to an idealized model of the structure yielded a nanowire resistivity a factor of 3.5 higher than that of a co...

The VrM3d design tool has been created to investigate the utility of interactive design in virtual reality with force feedback. VrM3d uses two iterative stress approximation methods for reanalyzing part geometry as it is deformed as well as mesh-free analysis to avoid mesh distortion issues, subdivision volume free-form deformation for shape changes, fast collision detection routines, and hapti...

Coarse-graining is a systematic way of reducing the number of degrees of freedom representing a system of interest. Several coarse-graining techniques have so far been developed, such as iterative Boltzmann inversion, force-matching, and inverse Monte Carlo. However, there is no unified framework that implements these methods and that allows their direct comparison. We present a versatile objec...