in this article differential transformation method (dtms) has been used to solve neutral functional-differential equations with proportional delays. the method can simply be applied to many linear and nonlinear problems and is capable of reducing the size of computational work while still providing the series solution with fast convergence rate. exact solutions can also be obtained from the kno...

We study the problem of matching two polyhedral terrains, where one can be changed vertically by a linear transformation of the third coordinate (scaling and translation). We give an algorithm that minimizes the maximum distance over all linear transformations in O(npolylog n) expected time. We also study matching two 1-dimensional terrains, and give a (1+ ε)-approximation algorithm for minimiz...

y m i = vl i for i = 0, . . . ,m 1 Extraction . Here, x 2 X ✓ R denotes a vector of input variables, y = y(x) 2 R the corresponding output variables, and ' some smooth intermediate assignments from a library ⌘ +, , ⇤, /, p ·, exp, sin, cos, . . . . However, the smoothness assumption is violated in most real applications. For example, the evaluation routines of many physical applications contain...

Bounds are given for the empirical and expected Rademacher complexity of classes of linear transformations from a Hilbert space H to a …nite dimensional space. The results imply generalization guarantees for graph regularization and multi-task subspace learning. 1 Introduction Rademacher averages have been introduced to learning theory as an e¢ cient complexity measure for function classes, mot...

In recent years, constructions based on Brownian bridge [11], principal component analysis[1], and linear transformation [7] have been proposed in the context of derivative pricing to further enhance QMC through dimension reduction. Motivated by [16, 18] and the ANOVA decomposition, this paper (i) formally justifies the dimension minimizing algorithm of Tan and Imai [7], and (ii) proposes a new...

With the rapid increase in computing, storage and networking resources, data is not only collected and stored, but also collaboratively analyzed. This creates a serious privacy problem which often inhibits the use of the distributed data. In this paper, we focus on the problem of linear programming, which is the most important sub-class of optimization problems. Specifically, distributed linear...

We provide a general expression and different classification schemes for the general two-dimensional canonical integral transformations that describe the propagation of coherent light through lossless first-order optical systems. Main theorems for these transformations, such as shift, scaling, derivation, etc., together with the canonical integral transforms of selected functions, are derived.

Technical products are often shipped with voluminous documentations. As to complex software products, machine-readable manuals are provided in most cases in addition to the printed version of a documentation. Although electronically stored text has many advantages in contrast to the traditional medium “paper”, the question arises how to manage the text of an online documentation. If the fact is...

This paper extends the framework of linear loop transformations adding a new non-lineal step at the transformation process. The current framework of linear loop transformation cannot identify a significant fraction of parallelism. For this reason, we present a method to complement it with some basic transformations in order to extract the maximum loop parallelism in perfect nested loops with ti...