An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction

23 p. -- An extended abstract of this work appears in the proceedings of the 2012 ACM/IEEE Symposium on Logic in Computer Science

Valuing Flexibility: The case of an Integrated Gasification Combined Cycle Power Plant

In this paper we analyze the valuation of options stemming from the flexibility in an Integrated Gasification Combined Cycle (IGCC) Power Plant. First we use as a base case the opportunity to invest in a Natural Gas Combined Cycle (NGCC) Power Plant, deriving the optimal investment rule as a function of fuel price and the remaining life of the right to invest. Additionally, the analytical solution for a perpetual option is obtained. Second, the valuation of an operating IGCC Power Plant is studied, with switching costs between states and a choice of the best operation mode. The valuation of this plant serves as a base to obtain the value of the option to delay an investment of this type. Finally, we derive the value of an opportunity to invest either in a NGCC or IGCC Power Plant, that is, to choose between an inflexible and a flexible technology, respectively. Numerical computations involve the use of one- and two-dimensional binomial lattices that support a mean-reverting process for the fuel prices. Basic parameter values refer to an actual IGCC power plant currently in operation.

Fault-tolerant almost exact state transmission

We show that a category of one-dimensional XY-type models may enable high-fidelity quantum state transmissions, regardless of details of coupling configurations. This observation leads to a fault-tolerant design of a state transmission setup. The setup is fault-tolerant, with specified thresholds, against engineering failures of coupling configurations, fabrication imperfections or defects, and even time-dependent noises. We propose an experimental implementation of the fault-tolerant scheme using hard-core bosons in one-dimensional optical lattices.

Subdiffusion of nonlinear waves in quasiperiodic potentials

19 p.

Adaptive Scalable SVD Unit for Fast Processing of Large LSE Problems

Singular Value Decomposition (SVD) is a key linear algebraic operation in many scientific and engineering applications. In particular, many computational intelligence systems rely on machine learning methods involving high dimensionality datasets that have to be fast processed for real-time adaptability. In this paper we describe a practical FPGA (Field Programmable Gate Array) implementation of a SVD processor for accelerating the solution of large LSE problems. The design approach has been comprehensive, from the algorithmic refinement to the numerical analysis to the customization for an efficient hardware realization. The processing scheme rests on an adaptive vector rotation evaluator for error regularization that enhances convergence speed with no penalty on the solution accuracy. The proposed architecture, which follows a data transfer scheme, is scalable and based on the interconnection of simple rotations units, which allows for a trade-off between occupied area and processing acceleration in the final implementation. This permits the SVD processor to be implemented both on low-cost and highend FPGAs, according to the final application requirements.

Results on proximal and generalized weak proximal contractions including the case of iteration-dependent range sets

This paper presents some further results on proximal and asymptotic proximal contractions and on a class of generalized weak proximal contractions in metric spaces. The generalizations are stated for non-self-mappings of the forms for and , or , subject to and , such that converges uniformly to T, and the distances are iteration-dependent, where , , and are non-empty subsets of X, for , where is a metric space, provided that the set-theoretic limit of the sequences of closed sets and exist as and that the countable infinite unions of the closed sets are closed. The convergence of the sequences in the domain and the image sets of the non-self-mapping, as well as the existence and uniqueness of the best proximity points, are also investigated if the metric space is complete. Two application examples are also given, being concerned, respectively, with the solutions through pseudo-inverses of both compatible and incompatible linear algebraic systems and with the parametrical

Frame presentations: variants of the reals, rings of functions, their Dedekind completions, and the unit circle

176 p.