A smooth homotopy method for incomplete markets

Mathematical Programming - In the general equilibrium with incomplete asset markets (GEI) model, the excess demand functions are typically not continuous at the prices for which the assets have...     

On Necessary Optimality Conditions with Higher-Order Complementarity Slackness for Set-Valued Optimization Problems

Set-Valued and Variational Analysis - We aim to establish Karush-Kuhn-Tucker multiplier rules involving higher-order complementarity slackness under Hölder metric subregularity. These rules...     

Particle Model for the Reservoirs in the Simple Symmetric Exclusion Process

Journal of Statistical Physics - In this paper, we will study the long time behavior of the simple symmetric exclusion process in the “channel” $$\varLambda _N=[1,N]\cap \mathbb {N}$$...     

Convergence estimates of Galerkin-wavelet solutions to a Cauchy problem for a class of periodic pseudodifferential equations

A class of Cauchy problems for interesting complicated periodic pseudodifferential equations is considered. By the Galerkin-wavelet method and with weak solutions one can find sufficient conditions to establish convergence estimates of weak Galerkin-wavelet solutions to a Cauchy problem for this class of equations.

     

A floating-point genetic algorithm for solving the unit commitment problem

This paper proposes a floating-point genetic algorithm (FPGA) to solve the unit commitment problem (UCP). Based on the characteristics of typical load demand, a floating-point chromosome representation and an encoding–decoding scheme are designed to reduce the complexities in handling the minimum up/down time limits. Strategic parameters of the FPGA are characterized in detail, i.e., the evaluation function and its constraints, population size, operation styles of selection, crossover operation and probability, mutation operation and probability. A dynamic combination scheme of genetic operators is formulated to explore and exploit the FPGA in the non-convex solution space and multimodal objective function. Experiment results show that the FPGA is a more effective technique among the various styles of genetic algorithms, which can be applied to the practical scheduling tasks in utility power systems.     

Polynomial decay rate for the dissipative wave equation

Using Fourier integral operators with special amplitude functions, we analyze the stabilization of the wave equation in a three-dimensional bounded domain on which exists a trapped ray bouncing up and down infinitely between two parallel parts of the boundary.     

Infrared spectroscopic analyses of transformations of chemical species on the silica highly-reacted with gaseous BF3.

Transformations of chemical species formed by the reaction of gaseous BF3 with high pressure and silica preheated at 473 and 1093 K were studied with the use of infrared absorption spectrometry. The species containing -BF2 and the species containing >BF were transformed to each other on the highly-reacted silica depending on the pressure of BF3 in cell, and some of the species containing -BF2 were also desorbed without their transformations to the species containing >BF. H2O played important roles in these transformations.     

Thermoelastoplastic deformation of a thick-walled cylinder with a radial crack

The thermoelastoplastic fracture mechanics problem of a thick-walled cylinder subjected to internal pressure and a nonuniform temperature field is solved by the method of elastic solutions combined with the finite-element method. The correctness of the solution is provided by using the Barenblatt crack model, in which the stress and strain fields are regular. The elastoplastic problem of a cracked cylinder subjected to internal pressure and a nonuniform temperature field are solved. The calculation results are compared with available data. __________ Translated from Prikladnaya Mekhanika i Tekhnicheskaya Fizika, Vol. 49, No. 3, pp. 173–183, May–June, 2008.     

Some New Results on Key Distribution Patterns and Broadcast Encryption

This paper concerns methods by which a trusted authority can distribute keys and/or broadcast a message over a network, so that each member of a privileged subset of users can compute a specified key or decrypt the broadcast message. Moreover, this is done in such a way that no coalition is able to recover any information on a key or broadcast message they are not supposed to know. The problems are studied using the tools of information theory, so the security provided is unconditional (i.e., not based on any computational assumption).In a recent paper st95a, Stinson described a method of constructing key predistribution schemes by combining Mitchell-Piper key distribution patterns with resilient functions; and also presented a construction method for broadcast encryption schemes that combines Fiat-Naor key predistribution schemes with ideal secret sharing schemes. In this paper, we further pursue these two themes, providing several nice applications of these techniques by using combinatorial structures such as orthogonal arrays, perpendicular arrays, Steiner systems and universal hash families.