We demonstrate the existence of a bounded sequence infinitely many parameter values for $3$-circle inversion that lead to Sierpiński curve Julia sets. This consists alternating that, although they all yield

Elliptic Curve Public Key Cryptosystems (ECPKC) are becoming increasingly popular for use in mobile appliances where bandwidth and chip area are strongly constrained. For the same level of security, ECPKC use much smaller key length than the commonly used RSA. The underlying operation of affine coordinates elliptic curve point multiplication requires modular multiplication, division/inversion a...

magnetotelluric (mt) method is an electromagnetic method which provides information about subsurface conductivity structures using earth's natural electromagnetic fields. static shift is one of disorders arising from shallow conductors; therefore static shift must be corrected as one of mt data processing steps. in the absence of sufficient information about the near surface distortions, w...

In this paper, we introduce and study a new implicit representation of parametric curves and parametric surfaces . We show how these representations which we will call the matrix implied, establish a bridge between geometry and linear algebra, thus opening the possibility of a more robust digital processing. The contribution of this approach is discussed and illustrated on important issues of g...

N(G)-nitro-arginine (NNA) is known to exhibit stereoselective pharmacokinetics in which N(G)-nitro-d-arginine (d-NNA) has a faster clearance rate than N(G)-nitro-l-arginine (l-NNA) in anesthetized rats, and d-NNA undergoes unidirectional chiral inversion. It was postulated that chiral inversion of d-NNA was performed in a two-step pathway by d-amino acid oxidase (DAAO) followed by an unidentifi...

The inversion method is an effective approach for transforming uniform random points according to a given probability density function. In two dimensions, horizontal and vertical displacements are computed successively using a marginal and then all conditional density functions. When quasi-random low-discrepancy points are provided as input, spurious artifacts might appear if the density functi...

Regarding the point projection and inversion problem, a classical algorithm for orthogonal projection onto curves and surfaces has been presented by Hu and Wallner (2005). The objective of this paper is to give a convergence analysis of the projection algorithm. On the point projection problem, we give a formal proof that it is second order convergent and independent of the initial value to pro...

A new 2-D traveltime tomography algorithm has been developed for use with long offset seismic streamer data. The forward problem is solved using initial value ray tracing in Delaunay triangulated grids. The traveltimes are calculated analytically. The linearised joint interface and velocity inversion is regularised via a geostatistical smoothing regularisation based on the formulation of a data...

This paper focuses on algorithms for an efficient scalar multiplication. It proposes two algorithms for computing points of the form 2kP in affine coordinates. One works for k = 2, and the other works for an arbitrary natural number k. The efficiency of these algorithms is based on a trade-off between a field inversion and several field multiplications. Montgomery trick is used to implement thi...