Periodic solutions of nonlinear impulsive differential inclusions with constraints

In this paper we obtain the existence of periodic solutions for nonlinear ``invariance' problems monitored by impulsive differential inclusions subject to impulse effects.

     

Sinc-Galerkin method for solving linear sixth-order boundary-value problems

There are few techniques available to numerically solve sixth-order boundary-value problems with two-point boundary conditions. In this paper we show that the Sinc-Galerkin method is a very effective tool in numerically solving such problems. The method is then tested on examples with homogeneous and nonhomogeneous boundary conditions and a comparison with the modified decomposition method is made. It is shown that the Sinc-Galerkin method yields better results.

     

Fermi, Majorana and the Statistical Model of Atoms

We give an account of the appearance and first developments of the statistical model of atoms proposed by Thomas and Fermi, focusing on the main results achieved by Fermi and his group in Rome. Particular attention is addressed to the unknown contribution to this subject by Majorana, anticipating some important results reached later by leading physicists.     

Compensatory transfers in two-player decision problems

This paper presents an axiomatic characterization of a family of solutions to two-player quasi-linear social choice problems. In these problems the players select a single action from a set available to them. They may also transfer money between themselves.The solutions form a one-parameter family, where the parameter is a non-negative number, t.The solutions can be interpreted as follows: Any efficient action can be selected. Based on this action, compute for each player a “best claim for compensation”. A claim for compensation is the difference between the value of an alternative action and the selected efficient action, minus a penalty proportional to the extent to which the alternative action is inefficient. The coefficient of proportionality of this penalty is t. The best claim for compensation for a player is the maximum of this computed claim over all possible alternative actions. The solution, at the parameter value t, is to implement the chosen efficient action and make a monetary transfer equal to the average of these two best claims. The characterization relies on three main axioms. The paper presents and justifies these axioms and compares them to related conditions used in other bargaining contexts. In Nash Bargaining Theory, the axioms analogous to these three are in conflict with each other. In contrast, in the quasi-linear social choice setting of this paper, all three conditions can be satisfied simultaneously.This work was supported by the Division of Research at the Harvard Business School. Thanks are due to the Cowles Foundation for Research in Economics at Yale University for its kind hospitality during the Spring of 2002. I have received helpful advice and comments from Youngsub Chun, Ehud Kalai, Herve Moulin, Al Roth, Ilya Segal, Adam Szeidl, Richard Zeckhauser, and other members of the Theory Seminars at Harvard, MIT, Princeton, Rice and Northwestern.     

Boundary value problems for first order impulsive delay differential equations with a parameter

In this paper, by means of the method of upper and lower solutions and monotone iterative technique, the existence of maximal and minimal solutions of the boundary value problems for first order impulsive delay differential equations is established.     

Multiplicity results for positive solutions of some semi-positone three-point boundary value problems

In this paper, some multiplicity results for positive solutions of some singular semi-positone three-point boundary value problem be obtained by using the fixed point index method.     

Inflationary Cosmological Models Without Restrictions on a Scalar Field Potential

A new strategy of exact solutions construction in inflationary cosmology within the self-interacting scalar field theory is proposed. It is shown that inflationary models have no restrictions dictated by the slow-roll approximation on the self-interacting potential. The suggested approach makes it possible to compute precisely the e-folds numbers in inflationary scenarios. The scalar field with a logarithmic evolution in time is analyzed in details. Other possible types of scalar field evolution are discussed.     

带有单模糊映射的一般变分不等式解的存在性

众所周知，在各种变分不等式问题中，解的存在性是最基础也是最重要的问题之一．本文的目的是在Hilbert空间中研究带有单模糊映射的一般变分不等式解的存在性．此外，还讨论了几种特殊情况．     

Lame Function and Its Application to Some Nonlinear Evolution Equations

In this paper, based on the Lame function and Jacobi elliptic function, the perturbation method is appliedto some nonlinear evolution equations to derive their multi-order solutions.     

Randomization helps to perform independent tasks reliably

This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004