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...     

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}$$...     

Dual Characterizations of Set Containments with Strict Convex Inequalities

Characterizations of the containment of a convex set either in an arbitrary convex set or in the complement of a finite union of convex sets (i.e., the set, described by reverse-convex inequalities) are given. These characterizations provide ways of verifying the containments either by comparing their corresponding dual cones or by checking the consistency of suitable associated systems. The convex sets considered in this paper are the solution sets of an arbitrary number of convex inequalities, which can be either weak or strict inequalities. Particular cases of dual characterizations of set containments have played key roles in solving large scale knowledge-based data classification problems where they are used to describe the containments as inequality constraints in optimization problems. The idea of evenly convex set (intersection of open half spaces), which was introduced by W. Fenchel in 1952, is used to derive the dual conditions, characterizing the set containments.     

Diffraction by a wedge at skew incidence: integral representations of Cauchy-Carleman for the electromagnetic fields

An electromagnetic diffraction problem in a wedge shaped region is reduced to a system of coupled functional difference equations by means of Sommerfeld integrals and Malyuzhinets theorem. By introducing an integral operator it is shown that the solutions of this system of functional equations can be defined in terms of integral representations whose kernels are solutions of a singular integral equation of Cauchy-Carleman type for which an explicit solution is given.     

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.     

Chemical isolation of element 106 from aqueous solutions according to model experiments with short-lived tungsten isotopes

The short-lived isotopes of W and their descendants have been isolated from the products of the bombardment of¹⁴⁴Sm with²⁴Mg by a fast continuous ion-exchange method, using HF solution media. The feasibility of this method for isolation of element 106 is discussed.     

Analysis of plane and axisymmetric flows of incompressible fluids with the stream tube method: Numerical simulation by trust-region optimization algorithm

New concepts for the study of incompressible plane or axisymmetric flows are analysed by the stream tube method. Flows without eddies and pure vortex flows are considered in a transformed domain where the mapped streamlines are rectilinear or circular. The transformation between the physical domain and the computational domain is an unknown of the problem. In order to solve the non-linear set of relevant equations, we present a new algorithm based on a trust region technique which is effective for non-convex optimization problems. Experimental results show that the new algorithm is more robust compared to the Newton-Raphson method.