A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf
.
Filters
Linearization by Program Transformation
[chapter]
2004
Lecture Notes in Computer Science
of general terms into weak linear terms Use of legal paths in term transformation
Conclusions & Future Work • Conclusions: Transformation of general terms into weak linear terms Use of legal paths in ...
)(λx.x) is not
Weak linear terms have nice properties • Weak linear term are strongly normalizable • Non-duplicating reduction • Type inference for weak linear terms is:
Decidable Polynomial Transforming ...
doi:10.1007/978-3-540-25938-1_14
fatcat:w6uzzxpgijd4npz6dgdqxnd73u
Improving brain tumor characterization on MRI by probabilistic neural networks and non-linear transformation of textural features
2008
Computer Methods and Programs in Biomedicine
The proposed classifier is a modified probabilistic neural network (PNN), incorporating a non-linear least squares features transformation (LSFT) into the PNN classifier. ...
Additionally, the present study demonstrated that by employing textural features from MR images and by conditioning those features by means of a non-linear least squares features transformation (LSFT), ...
Georgiadis, et al., Improving brain tumor characterization on MRI by probabilistic neural networks and non-linear transformation of textural features, Comput. ...
doi:10.1016/j.cmpb.2007.10.007
pmid:18053610
fatcat:gmi5bakgijdrjivezjysmatarq
Simulation of a Compressible Powder Flow under Oscillatory Shear Stress Modeled as a Non - Linear Fluid by Using an Explicit Solution Method
2018
Journal of Engineering Science and Technology Review
The simulation results were compared qualitatively with experimental results, and the solution method was verified by comparing the simulation results of a viscous glycerin flow with the results of the ...
carried out by Obregon et al ...
The motion of the powders is caused by the shear stress applied by the moving walls to the particles. ...
doi:10.25103/jestr.114.11
fatcat:ac6mkhbddjfmfgqxgp5waeb33e
Interval Linear Programming under Transformations: Optimal Solutions and Optimal Value Range
[article]
2018
arXiv
pre-print
In this paper, we discuss the common transformations used in linear programming, such as imposing non-negativity on free variables or splitting equations into inequalities, and their effects on interval ...
Interval linear programming provides a tool for solving real-world optimization problems under interval-valued uncertainty. ...
Due to the dependency problem, transforming an interval program into a desired form by applying the standard transformations used in classical linear programming may change its feasible or optimal solutions ...
arXiv:1802.09872v1
fatcat:slpyntd2svh3lfle6sbr3q7l7u
Extension of Wolfe Method for Solving Quadratic Programming with Interval Coefficients
2017
Journal of Applied Mathematics
The next step is transforming linear programming with interval coefficients model into two classic linear programming models with special characteristics, namely, the optimum best and the worst optimum ...
The extension process of Wolfe method involves the transformation of the quadratic programming with interval coefficients model into linear programming with interval coefficients model. ...
This method transforms the quadratic programming problem into a linear programming problem. ...
doi:10.1155/2017/9037857
fatcat:ow6qihwxyfgw7nidt35mpdzxlq
Applying Transformation Characteristics to Solve the Multi Objective Linear Fractional Programming Problems
2017
International Journal of Computer Science & Information Technology (IJCSIT)
In this paper, we proposed the transformation characteristics to solve the multi objective linear fractional programming (MOLFP) problems. ...
fractional programming problem MOLFPP in this research. ...
The MOLFPP can be transformed into the equivalent appropriate multi objective linear programming problem by using the transformation characteristics. ...
doi:10.5121/ijcsit.2017.9207
fatcat:ufb3wmgsrfhbdhymcldjfrxl6e
Linear programs in a simple reversible language
2003
Theoretical Computer Science
that can be implemented by linear homogeneous programs corresponds exactly to the group of integer modular matrices. ...
We show that such programs implement exactly the linear transformations corresponding to the group of integer positive modular matrices, while in ESRL, an extended version of SRL, the set of transformations ...
In this proof by program and transformation we mean, respectively, a linear homogeneous program and a linear homogeneous transformation. ...
doi:10.1016/s0304-3975(02)00486-3
fatcat:pgylgun3nba5phpk7dwz6gw5fa
Right-, left- and multi-linear rule transformations that maintain context information
1990
Very Large Data Bases Conference
Our transformation can handle calls whose input arguments are not manifest constants but are computed by other calls in the query, and it can handle predicates containing pseudo-left-linear rules together ...
This work extends the work presented in "Eficient evaluation of right-, left-, and multi-linear rules" by J. Naughton, R. Ramakrishnan, Y. Sagiv, and J. Ullman. ...
The NRSU-transformed program generally performed better than the contexttransformed program as the tuples generated by the NRSU-transformed program were smaller. ...
dblp:conf/vldb/KempRS90
fatcat:ua4il2vugbagxpt3beesd5wyjm
CPS Transformation of Flow Information, Part II: Administrative Reductions
2001
BRICS Report Series
(By "a linear beta-reduction" we mean the beta-reduction of a linear lambda-abstraction, i.e., of a lambda-abstraction whose parameter occurs exactly once in its body.) ...
Furthermore, we show how to CPS transform control-flow information in one pass.<br /> <br />Superseded by BRICS-RS-02-36. ...
The resulting programs contain all administrative redexes induced by Plotkin's transformation. ...
doi:10.7146/brics.v8i40.21700
fatcat:bj36dbp3xfbatmfy3qhic2zu3m
Invertible Linear Transforms of Numerical Abstract Domains
[chapter]
2018
Lecture Notes in Computer Science
domain M (A) can be obtained by analysing on the original domain A a linearly transformed program P M . ...
Given an invertible square matrix M and a numerical abstraction A, we show that for a linear program P (i.e., using linear assignments and linear tests only), the analysis using the linearly transformed ...
The doctoral fellowship of Marco Zanella is funded by Fondazione Bruno Kessler (FBK), Trento, Italy. ...
doi:10.1007/978-3-319-99725-4_21
fatcat:5nin5ihswfhiveu2y7gktppfwm
Transforming and Solving Multi-Objective Linear Plus Linear Fractional Programming Problem
2020
Diyala Journal for Pure Science
In this paper, we transformed multi-objective linear plus linear fractional programming problems to single QPP and then solved by methods of QPP. ...
He clearly delineated a calculation for fractional programming with nonlinear as well as linear terms within numerator and denominator. ...
Transforming and Solving Multi-Objective Linear Plus Linear Fractional Programming Problem Snoor O. Abdalla, Ayad M. Ramadan and Ronak M. ...
doi:10.24237/djps.16.04.531c
fatcat:hefjaproebhe3fmr7jlme7hqrm
CPS transformation of flow information, Part II: administrative reductions
2003
Journal of functional programming
(By 'a linear β-reduction' we mean the β-reduction of a linear λ-abstraction, i.e., of a λabstraction whose parameter occurs exactly once in its body.) ...
Together, Palsberg and Wand's article and the present article show how to map in linear time the least solution of the flow constraints of a program into the least solution of the flow constraints of the ...
The resulting programs contain all administrative redexes induced by Plotkin's transformation. ...
doi:10.1017/s0956796803004702
fatcat:pvbphomkcvazxk4j3gft3bo7xu
CPS Transformation of Flow Information, Part II: Administrative Reductions
2002
BRICS Report Series
(By "a linear beta-reduction" we mean the beta-reduction of a linear lambda-abstraction, i.e., of a lambda-abstraction whose parameter occurs exactly once in its body.) ...
<br /> <br />Together, Palsberg and Wand's article and the present article show how to map in linear time the least solution of the flow constraints of a program into the least solution of the flow constraints ...
The resulting programs contain all administrative redexes induced by Plotkin's transformation. ...
doi:10.7146/brics.v9i36.21751
fatcat:4ymvxwksezfnffqsgltzbchq3q
Privacy-preserving vertically partitioned linear program with nonnegativity constraints
2012
Optimization Letters
By employing two random matrix transformation we construct a secure linear program based on the privately held data without revealing that data. ...
The secure linear program has the same minimum value as the original linear program. ...
Acknowledgement This work is supported by the National Natural Science Foundation of China ((10971191, 11171316). ...
doi:10.1007/s11590-012-0518-0
fatcat:x3j35ndby5csfnc62lha6lti5u
On transformations into linear database logic programs
[chapter]
1996
Lecture Notes in Computer Science
and present both positive and negative results (i.e. demonstrate programs that cannot be transformed into a linear program by any transformation technique), and b) We d e v elop an algorithm which transforms ...
In this paper we i n vestigate the problem of transformation into linear programs from two di erent perspectives: a) We discuss the expressivity of linear programs by demonstrating the fact that this subclass ...
are in NC 2 . 4 Transforming piecewise linear to linear programs In this section we s h o w that a piecewise linear Datalog program can always be transformed into an equivalent linear program using unfold ...
doi:10.1007/3-540-62064-8_36
fatcat:qebfiaymlja2xj7nlxw5shx2aa
« Previous
Showing results 1 — 15 out of 1,172,683 results