We study the problem of reconstructing binary images from four projections data in a fuzzy environment. Given the uncertainly projections,w e want to find a binary image that respects as best as possible these projections. We provide an iterative algorithm based on fuzzy integer programming and linear membership functions.

In general, we expect a dynamic programming solution to consist of 3 parts. First, it must clearly identify what the subproblems are, and include a short justification that the problems exhibit the optimal substructure property, if this is not obvious. Second, the recurrence relation between subproblems must be stated, including the base cases. For the recurrence relation to be valid, there mus...

This paper presents an improvement of the Orthogonal Dynamic Programming optical flow technique that permits a better use of all the available information during the iterative search of the vector field in the case of stereo PIV. The two-component apparent vector fields are computed simultaneously (synchronously) for all available viewpoints. Coherency constraints issued from the geometry of th...

In this paper, we address the dynamic spectrum allocation problem in next generation cellular networks under the coordinated dynamic spectrum access (CDSA) model. Firstly, considering spectrum demands of base stations, we formulate spectrum allocation under physical interference models as a nonlinear optimization problem. Then, we propose a demand-driven dynamic spectrum allocation algorithm by...

A novel formulation for combined scheduling and control of multi-product, continuous chemical processes is introduced in which nonlinear model predictive control (NMPC) and noncyclic continuous-time scheduling are efficiently combined. A decomposition into nonlinear programming (NLP) dynamic optimization problems and mixed-integer linear programming (MILP) problems, without iterative alternatio...

This paper deals with solvability of the following functional equation arising in dynamic programming of multistage decision processes f(x) = opt y∈D { u(x, y)(p(x, y) + f(a(x, y))) + v(x, y) opt{q(x, y), f(b(x, y))} } , ∀x ∈ S. Using the Banach fixed point theorem and new iterative techniques, we obtain the existence and uniqueness of solutions for the above equation in the complete metric spa...

A Hierarchical Parallelizing Compiler for VLIW/MIMD Machines p. 49 Dynamic Dependence Analysis: A Novel Method for Data Dependence Evaluation p. 64 On the Feasibility of Dynamic Partitioning of Pointer Structures p. 82 Compiler Analysis for Irregular Problems in Fortran D p. 97 Data Ensembles in Orca C p. 112 Compositional C++: Compositional Parallel Programming p. 124 Data Parallelism and Lind...

This paper presents a linear matrix inequality (LMI) approach for designing a robust decentralized structure constrained controller for power systems. The problem of designing a fixed-structure H2/H∞ dynamic output feedback controller is first reformulated as an extension of a static output feedback controller design problem for the extended system. The resulting optimization problem has biline...