A lambda-encoding such as the CPS transformation gives rise to administrative redexes. In his seminal article “Call-by-name, call-by-value and the lambda-calculus”, 25 years ago, Plotkin tackled administrative reductions using a so-called colon translation. In “Representing control, a study of the CPS transformation”, 15 years later, Danvy and Filinski integrated administrative reductions in th...

The intensional transformation is a promising technique for implementing lazy functional languages based on a demand-driven execution model. Despite its theoretical elegance and its simple and efficient execution model, the intensional transformation suffered, until now, from two main drawbacks: it could only be applied to programs that manipulate primitive data-types and it could only compile ...

The singular value decomposition (SVD) technique is extended to incorporate the additive components for approximation of a rectangular matrix by the outer products of vectors. While dual vectors of the regular SVD can be expressed one via linear transformation of the other, the modified SVD corresponds to the general linear transformation with the additive part. The method obtained can be relat...

To establish the estimation models, the linear regression technique is used to analyze the historical data. This technique is also applied in combination with logarithm transformation of the collected data. Our results show that the correlation coefficients (or R) between size (FFP) and real effort and size (FFP) and cost are 89% and 88% respectively. With logarithm transformation, the correlat...

This paper presents an original coarse-to-fine technique for creating mosaics of color images related by projective transformations. The actual projective transformation is first approximated with an afine transformation whose parameters are estimated by means of an algorithm operating in the frequency domain. The projective transformation is then computed with an algorithm based on feature mat...

We present and evaluate a new object transformation technique for multi-touch surfaces. Specifying complete object transformations for a two-dimensional space requires a minimum of four degrees of freedom (DOF): two for position, one for rotation, and another for scaling. Many existing techniques for object transformation are designed to function with traditional input devices such as mice, sin...

Fold-unfold is a well known program transformation technique. Its major drawback is that folding requires an Eureka step to invent new procedures. In the context of logic programming, we present a technique where the folding is driven by an example. The transformation is aimed at programs suffering from inefficiencies due to the repetition of identical subcomputations. The execution of an examp...

This paper describes a constraint transformation technique for optimal control problems (OCP) with nonlinear single-input single-output (SISO) systems subject to output constraints. An input-output transformation and saturation functions are used to transform the system dynamics into a new unconstrained representation. This method allows to reformulate the original OCP into an unconstrained cou...

A key technology to enable separation of concerns is the final step of reintegrating multiple, possibly independentlydeveloped modules. We argue for a technique of transformation, where the process of modifying a class to exhibit new behevior is controlled by a user-supplied program. Additionally, we argue that performing such a process as a program is loaded offers benefits in flexibility, per...

in this paper, a reliable approach is introduced to approximate periodic solutions of a system of coupled integrable dispersionless. the system is firstly, transformed into an ordinary differential equation by wave transformation. the solution of ode is obtained by the homotopy perturbation method. to show the periodic behavior of the solution, a modification based on the laplace transforms and...