This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms. 相似文献
This paper describes the performance and simulation of a compact integrated optical processor for the real-time reconstruction of two-dimensional images in airborne stripmap synthetic aperture radar applications. The functional behavior of the processor is explained in some detail. The design criteria are briefly given. The simulation step allowed the main processor characteristics and properties to be identified. A number of comparisons were obtained in airborne SAR mission scenarios between the predictions of the optical device and those achieved by the modern electronic digital approach, based on the wavefront reconstruction method by matched filtering. 相似文献
Electron beam processing of poly(ethylene terephthalate) (PET) films is found to promote significant changes in the melting heat, intrinsic viscosity and polymer film-liquid (water, isooctane and toluene) boundary surface tension. These properties are featured with several maximums depending on the absorbed dose and correlating with the modification of PET surface functionality. Studies using adsorption of acid-base indicators and IR-spectroscopy revealed that the increase of PET surface hydrophilicity is determined by the oxidation of methylene and methyne groups. Electron beam treatment of PET films on the surface of N-vinylpyrrolidone aqueous solution provided graft copolymerization with this comonomer at optimum process parameters (energy 700 keV, current 1 mA, absorbed dose 50 kGy). 相似文献
A model for parallel and distributed programs, the dynamic process graph (DPG), is investigated under graph-theoretic and complexity aspects. Such graphs embed constructors for parallel programs, synchronization mechanisms as well as conditional branches. They are capable of representing all possible executions of a parallel or distributed program in a very compact way. The size of this representation can be as small as logarithmic with respect to the size of any execution of the program.
In a preceding paper [A. Jakoby, et al., Scheduling dynamic graphs, in: Proc. 16th Symposium on Theoretical Aspects in Computer Science STACS'99, LNCS, vol. 1563, Springer, 1999, pp. 383–392] we have analysed the expressive power of the general model and various variants of it. We have considered the scheduling problem for DPGs given enough parallelism taking into account communication delays between processors when exchanging data. Given a DPG the question arises whether it can be executed (that means whether the corresponding parallel program has been specified correctly), and what is its minimum schedule length.
In this paper we study a subclass of dynamic process graphs called
-output DPGs, which are appropriate in many situations, and investigate their expressive power. In a previous paper we have shown that the problem to determine the minimum schedule length is still intractable for this subclass, namely this problem is
-complete as is the general case. Here we will investigate structural properties of the executions of such graphs. A natural graph-theoretic conjecture that executions must always split into components that are isomorphic to subgraphs turns out to be wrong. We are able to prove a weaker property. This implies a quadratic upper bound on the schedule length that may be necessary in the worst case, in contrast to the general case, where the optimal schedule length may be exponential with respect to the size of the representing DPG. Making this bound constructive, we obtain an approximation to a
-complete problem. Computing such a schedule and then executing the program can be done on a parallel machine in polynomial time in a highly distributive fashion. 相似文献