Search

An end-to-end network traffic matrix is significantly helpful for network management and for Software Defined Networks (SDN). However, the end-to-end network traffic matrix's inferences and estimations are a challenging problem. Moreover, attaining the traffic matrix in high-speed networks for SDN is a prohibitive challenge. This paper investigates how to estimate and recover the end-to-end network traffic matrix in fine time granularity from the sampled traffic traces, which is a hard inverse problem. Different from previous methods, the fractal interpolation is used to reconstruct the finer-granularity network traffic. Then, the cubic spline interpolation method is used to obtain the smooth reconstruction values. To attain an accurate the end-to-end network traffic in fine time granularity, we perform a weighted-geometric-average process for two interpolation results that are obtained. The simulation results show that our approaches are feasible and effective. [ABSTRACT FROM AUTHOR]

Anonymity, which is more and more important to multi-receiver schemes, has been taken into consideration by many researchers recently. To protect the receiver anonymity, in 2010, the first multi-receiver scheme based on the Lagrange interpolating polynomial was proposed. To ensure the sender’s anonymity, the concept of the ring signature was proposed in 2005, but afterwards, this scheme was proven to has some weakness and at the same time, a completely anonymous multi-receiver signcryption scheme is proposed. In this completely anonymous scheme, the sender anonymity is achieved by improving the ring signature, and the receiver anonymity is achieved by also using the Lagrange interpolating polynomial. Unfortunately, the Lagrange interpolation method was proven a failure to protect the anonymity of receivers, because each authorized receiver could judge whether anyone else is authorized or not. Therefore, the completely anonymous multi-receiver signcryption mentioned above can only protect the sender anonymity. In this paper, we propose a new completely anonymous multi-receiver signcryption scheme with a new polynomial technology used to replace the Lagrange interpolating polynomial, which can mix the identity information of receivers to save it as a ciphertext element and prevent the authorized receivers from verifying others. With the receiver anonymity, the proposed scheme also owns the anonymity of the sender at the same time. Meanwhile, the decryption fairness and public verification are also provided. [ABSTRACT FROM AUTHOR]

One of the chief challenges of the finite-difference time-domain (FDTD) subgridding algorithm is developing a field-coupling scheme to avoid late-time instability resulting from spatial interface between regions with different meshes. This paper introduces the concept of the nonuniform grid method to appropriately handle the tangential electric component on the spatial interface of the two meshes. This study analyzed shielding effectiveness of metallic enclosures with apertures. A novel subgridding algorithm was employed to locally refine the region containing a thin perfect electric conducting (PEC) film with apertures through FDTD simulation. Image theory was implemented to obtain an interpolation scheme of the magnetic fields as the sub-boundary surface when a thin PEC film traverses the subgridding interface. The numerical accuracy and stability of the proposed method were verified by comparing with results from other established methods. [ABSTRACT FROM PUBLISHER]

The premixed turbulent V-flame is numerically simulated in this paper. The technique used in Chan et al. [Effect of intense turbulence on turbulent premixed V-flame, Int. J. Eng. Sci. 41 (2003), pp. 903-916; Simulation of a premixed turbulent flame with the discrete vortex method, Int. J. Numer. Methods Eng. 48 (2000), pp. 613-627] was based on the random vortex method and the conventional level set method. However, this paper is an improvement of the previous technique by using a conservative level set method. The new algorithm uses a bi-cubic interpolation process together with Newton's method to reconstruct the velocity field to improve the conservation of the level set method. The numerical example in this paper indicates the efficiency of the new method in solving the problem of turbulent premixed V-flame by comparing the results with available data. [ABSTRACT FROM AUTHOR]

Free form surfaces are primarily designed and manufactured by CAD/CAM/CNC system. In traditional way, toolpath generation approaches always consider machining precision and efficiency by constraining scallop height and toolpath lengths. However, toolpath lengths do not exactly reflect the actual machining time because the feedrate usually fluctuates along different toolpath during CNC interpolating period, which indicates that the total machining efficiency is coupled with both toolpath generation and interpolation. Therefore, the toolpath generation and interpolation systems should not be independent, and the conventional unidirectional information flow from CAM to CNC should be replaced by a new mechanism with information exchange and mutual optimization. This paper proposes an inverse evaluation mechanism with feedback information from CNC to CAM system. The feedback information is obtained by off-line interpolation simulation for each toolpath and evaluation of the total machining time for the entire surface. With the feedback information, CAM is able to optimize the toolpath or choose the best one among candidate solutions. As the evaluation mechanism should be under the same interpolation algorithm, an interpolation algorithm with axis kinematic/dynamic constraints is also introduced. The simulation results with different free form surfaces show that the proposed mechanism can economically improve the machining efficiency without increasing system cost. [ABSTRACT FROM AUTHOR]

Contemporary land information systems allow the generation of models of numerical surfaces by applying a number of interpolation algorithms. The appropriate selection of measurement points included in the calculations is one of the key factors influencing the quality and accuracy of interpolation. Properly selected points contribute to improving the accuracy of the generated surface models and to shortening the computation process. This paper analyzes the effect of the location and density of measurement points on the accuracy of interpolation surfaces in view of the morphological differentiation of the generated models. [ABSTRACT FROM AUTHOR]

In this paper, we propose a high-resolution autoregressive moving average (ARMA) modeling technique for signals which are a sum of sinusoids embedded in colored noise. The approach is based on a special ARMA model. We show that an approximation to this model can be found through the central solution of Nevanlinna-Pick interpolation. In this context, it can reach a very fine resolution with a special arrangement of filterbank poles. A very efficient iterative algorithm will then be presented to achieve such desired arrangement. We also derive theoretical expressions for the variance of interpolation values for both continuous and mixed spectra for complex poles. Computer simulations show that the approach is very powerful in joint power spectrum and frequency estimation and provides superior performance with respect to traditional techniques. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of modeling systems from measurements of their frequency response. For multiport devices, currently available techniques are expensive. We propose a new approach which is based on a system-theoretic tool, the Loewner matrix pencil constructed in the context of tangential interpolation. Several implementations are presented. They are fast, accurate, they build low order models and are especially designed for a large number of terminals. Moreover, they identify the underlying system, rather than merely fitting the measurements. The numerical results show that our algorithms yield smaller models in less time, when compared to vector fitting. [ABSTRACT FROM AUTHOR]

As minimally invasive surgical techniques become widely known to patients, medical training systems based on virtual simulation are highly desired. These systems help surgeon trainees to acquire, practice and evaluate their surgical skills. A key component in a virtual training system is to simulate the dynamics that occur in surgical procedures. Tissue cutting, as a common phenomenon during surgery, has attracted many research efforts in computer simulation. In this paper, we propose an approach to endoscopic image cutting simulation which is based on both mass-spring model and Computational Geometry. In the cutting simulation model, the springs to be cut off are imagined into line segments. In the calculation of the elastic force on mass points, we have found that whether some adjacent springs of a mass point to be eliminated or not during a cutting is critical. If a spring intersects the cutting plane, we set the elastic force of this spring to zero. We adopted properties of cross product and related algorithms (the rapid exclusion test, the crossover test) in Computational Geometry to determine the springs that are intersected with the cutting plane. And then, we utilized the bilinear interpolation and OpenGL techniques to render the cutting procedure of the soft tissue. The experimental results show that our cutting simulation is effective and practical. [ABSTRACT FROM AUTHOR]

Symbol timing offset (STO) can result in intersymbol interference (ISI) and a rotated phase which value is proportional to the subcarrier index at the FFT output in an OFDM receiver. In order to avoid ISI, the FFT window start position has to be put in advance of the estimated point obtained by coarse STO estimation algorithms. But a large number of forward-shift samples will deteriorate the estimation of data subcarrier channels requiring interpolation from pilot subcarrier channels due to the phase rotation caused by a residual STO. In this paper we analyze the influence of STO on channel interpolation and propose a new compensation method for channel correction with STO. From the performance analysis of simulation results in the DVB-T application, the new algorithm not only has a better performance but also is attractive in using a simple residual STO estimation method such that few pilots are required for fine STO estimation compared to conventional approaches. [ABSTRACT FROM AUTHOR]

In this paper, we present a new approach of-spline curve fitting to a set of ordered points, which is motivated by an insight that properly selected points called dominant points can play an important role in producing better curve approximation. The proposed approach takes four main steps: parameterization, dominant point selection, knot placement, and least-squares minimization. The approach is substantially different from the conventional approaches in knot placement and dominant point selection. In the knot placement, the knots are determined by averaging the parameter values of the dominant points, which basically transforms-spline curve fitting into the problem of dominant point selection. We describe the properties of the knot placement including the property of local modification useful for adaptive curve refinement. We also present an algorithm for dominant point selection based on the adaptive refinement paradigm. The approach adaptively refines a-spline curve by selecting fewer dominant points at flat regions but more at complex regions. For the same number of control points, the proposed approach can generate a-spline curve with less deviation than the conventional approaches. When adopted in error-bounded curve approximation, it can generate a-spline curve with far fewer control points while satisfying the desired shape fidelity. Some experimental results demonstrate its usefulness and quality. [Copyright &y& Elsevier]

Reconstruction of freeform surfaces from scattered coordinate data is a difficult problem encountered in many surface fitting and geometric modeling applications. Conventional tessellation and parametric surface fitting techniques are limited because they require prior knowledge about the connectivity between the sampled points. The method of surface reconstruction described in this paper exploits the learning capability of a self-organizing feature map (SOFM) to adaptively fit a deformable sphere to the unorganized 3D coordinate data. The learning algorithm automatically establishes the connectivity between the measured points by iteratively changing the topological relationships within the map. By incorporating additional constraints during the learning process it is possible to have the deformable map follow the shape of objects with surface holes and cavities. Several examples of freeform surfaces with varying levels of complexity are discussed in order to demonstrate the performance of the algorithm. [ABSTRACT FROM AUTHOR]

Time delay estimation (TDE) lies at the heart of signal processing algorithms in a broad range of application areas, including communications, coherent imaging, speech processing, and acoustics. In medical ultrasound for example, TDE is used in blood flow estimation, tissue motion measurement, tissue elasticity estimation, phase aberration correction, and a number of other algorithms. Because of its central significance, TDE accuracy, precision, and computational cost are of critical importance. Furthermore, because TDE is typically performed au sampled signals—and delay estimates are usually desired over a continuous domain—time delay estimator performance should be considered in conjunction with associated interpolation. In this paper we present a new time-delay estimator that directly determines continuous time-delay estimates from sampled data. The technique forms a spline-based, piecewise continuous representation of the reference signal then solves for the minimum of the sum squared error between the reference and the delayed signals to determine their relative time delay. Computer simulation results clearly show that the proposed algorithm significantly outperforms other algorithms in terms of jitter and bias over a broad range of conditions. We also describe a modified version of the algorithm that includes companding with only a minor increase in computational cost. [ABSTRACT FROM AUTHOR]