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

Five Novel Taccalonolides from the Roots of the Vietnamese Plant Tacca paxiana

Chemical investigation of the roots of the Vietnamese plant Tacca paxiana resulted in the isolation of five new steroidal compounds, taccalonolide R ( 6 ), S ( 7 ), T ( 8 ), U ( 9 ), and V ( 10 ). Their structures were established on the basis of NMR and mass‐spectral data. In addition, the five known taccalonolides A ( 1 ), B ( 2 ), E ( 3 ), K ( 4 ), and N ( 5 ) were also isolated and identified.     

Effect of solvent nature on spin exchange in rigid nitroxide biradicals

Intramolecular electron spin exchange as a function of temperature and solvent viscosity and polarity has been studied by X-band electron paramagnetic resonance (EPR) spectroscopy in two rigid nitroxide biradicals existing in one spatial conformation only. Temperature variations of the isotropic hyperfine splitting constanta and exchange integral value |J/a| were measured from EPR spectra and subsequently analyzed. The interaction of polar solvent molecules with >N-O fragments of nitroxide groups led to a slight decrease of the |J/a| value with the increase of temperatureT. In contrast, the interaction of polar solvent molecules with functional groups inside the bridge resulted in a noticeable increase of |J/a| vs.T. In the last case, a coverse relationship between the values of |J/a| and the hyperfine splitting constanta has been observed for solvents with different polarity.     

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.     

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.