Construction of Cubic Timmer Triangular Patches and its Application in Scattered Data Interpolation

This paper discusses scattered data interpolation by using cubic Timmer triangular patches. In order to achieve C1 continuity everywhere, we impose a rational corrected scheme that results from convex combination between three local schemes. The final interpolant has the form quintic numerator and quadratic denominator. We test the scheme by considering the established dataset as well as visualizing the rainfall data and digital elevation in Malaysia. We compare the performance between the proposed scheme and some well-known schemes. Numerical and graphical results are presented by using Mathematica and MATLAB. From all numerical results, the proposed scheme is better in terms of smaller root mean square error (RMSE) and higher coefficient of determination (R2). The higher R2 value indicates that the proposed scheme can reconstruct the surface with excellent fit that is in line with the standard set by Renka and Brown’s validation.

A highly accurate corrected scheme in solving the Laplace's equation on a rectangle

A pointwise error estimation of the form 0(ρh8),h is the mesh size, for the approximate solution of the Dirichlet problem for Laplace's equation on a rectangular domain is obtained as a result of three stage (9-point, 5-point and 5-point) finite difference method; here ρ = ρ(x,y) is the distance from the current grid point (x,y,) ε Πh to the boundary of the rectangle Π.

Method of corrections by higher order differences for elliptic equations with variable coefficients

We consider the Dirichlet problem for an elliptic equation with variable coefficients, the solution of which is obtained by means of a finite-difference scheme of second order accuracy. We establish a two-stage finite-difference method for the posed problem and obtain an estimate of the convergence rate consistent with the smoothness of the solution. It is proved that the solution of the corrected scheme converges at rate

BREAKING AND REPAIRING AN APPROXIMATE MESSAGE AUTHENTICATION SCHEME

Traditional hash functions are designed to protect against even the slightest modification of a message. Thus, one bit changed in a message would result in a totally different message digest when a hash function is applied. This feature is not suitable for applications whose message spaces admit a certain fuzziness, such as multimedia communications or biometric authentication applications. In these applications, approximate hash functions must be designed so that the distance between messages are proportionally reflected in the distance between message digests. Most of the previous designs of approximate hash functions employ traditional hash functions. In an ingenious approximate message authentication scheme for an N-ary alphabet recently proposed by Ge, Arce and Crescenzo, the approximate hash functions are based on the majority selection function. This scheme is suitable for N-ary messages with arbitrary alphabet size N. In this paper, we show a hidden property of the majority selection function, which allows us to successfully break this scheme. We show that an adversary, by observing just one message and digest pair, without any knowledge of the secret information, can generate N - 1 new valid message and digest pairs. In order to resist the attack, we propose some modifications to the original design. The corrected scheme is as efficient as the original scheme and it is secure against the attack. By a new combinatorial approach, we calculate explicitly the security parameters of the corrected scheme.

CLASSICAL AND QUANTUM CONTROL OF A SIMPLE QUANTUM SYSTEM

A qubit which is prepared in one of two non-orthogonal states and subjected to bit-flipping noise is considered. The objective is to use measurement and feedback control to correct the state of the qubit. Three classical schemes using projective measurements, i.e. discrimination and re-preparation, do nothing and random preparation, have been discussed, and are not optimal with respect to a performance which is quantified by the average fidelity of the corrected state compared to the initial state. In addition, one quantum scheme using a non-projective measurement with an optimum measurement strength achieves the best trade-off between gaining information about the system and disturbing it through measurement back-action. The performance of a quantum control scheme outperforms the classical schemes. Furthermore, no universal corrected scheme is discussed.