Nash equilibria in random games

We consider Nash equilibria in 2‐player random games and analyze a simple Las Vegas algorithm for finding an equilibrium. The algorithm is combinatorial and always finds a Nash equilibrium; on m × n payoff matrices, it runs in time O(m²nloglog n + n²mloglog m) with high probability. Our result follows from showing that a 2‐player random game has a Nash equilibrium with supports of size two with high probability, at least 1 − O(1/log n). Our main tool is a polytope formulation of equilibria. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

Is there a universal scale of time?

The assumption that the same universal scale of time applies for different physical laws depends uponthe hypothesis that there is a unique universal scale of time in the universe. Intrinsic to that hypothesis is the assumption that if extraneous factors that affect physical clocks and processes that run on different physical principles could be removed, all clocks are synchronizable with one another. The consequences of that hypothesis not being true are considered. It was found thatclock asynchrony implies that: (1) a mass variation theory is probable; (2) there is a need for multiple clocks; and (3) t in the equations of physics is referring to clocks rather than time such that the properties of time are reduced to its direction (as characterized by thermodynamics and cosmology).     

On Nondeterminism,Enumeration Reducibility and Polynomial Bounds

Enumeration reducibility is a notion of relative computability between sets of natural numbers where only positive information about the sets is used or produced. Extending e-reducibility to partial functions characterises relative computability between partial functions. We define a polynomial time enumeration reducibility that retains the character of enumeration reducibility and show that it is equivalent to conjunctive non-deterministic polynomial time reducibility. We define the polynomial time e-degrees as the equivalence classes under this reducibility and investigate their structure on the recursive sets, showing in particular that the pe-degrees of the computable sets are dense and do not form a lattice, but that minimal pairs exist. We define a jump operator and use it to produce a characterisation of the polynomial hierarchy.     

Neutron dosimetry at low and high fluences with CR-39

In the Laboratory of Nuclear Microanalysis, we have developed two techniques for neutron dosimetry; the first for low fluence, the second for high fluence. These two techniques use a Solid State Nuclear Track Detector (SSNTD): the CR-39. The low fluence technique is based on the measurement of etched tracks resulting from a neutron-proton conversion. A Monte Carlo code performs a simulation of the (n,p) collision in the detector, and a numerical computer code of latent track etching allows the evaluation of the etched track parameters. The object of this is to obtain characteristics of a neutron fluence from the measured etched track parameters. When there is a high fluence and high doses, CR-39 is unsuited for optical microscopy analysis. This is because of track overlapping which makes it impossible to carry out counting and exploitation. We have therefore developed a new method permitting the reading of samples based on the measurement of the angular distribution of coherent light (He---Ne laser) transmitted through the irradiated etched SSNTD. We present these two techniques and our initial results.     

利用双光子吸收效应测量激光脉冲的相干时间

研究了利用反向泵浦－探测双光子吸收材料的方法来测量脉冲激光的相干时间，并测量量了２３ｐｓ，５３２ｎｍ Ｎｄ：ＹＡＧ激光脉冲的相干时间。实验和理论分析表明，光束相干作用增加了双光子吸收，利用此方法可测量其它脉宽激光的相干时间。     

带复数核的第一类Fredholm积分方程的正则化方法及其应用

本文推广了Ｔｉｋｈｏｎｏｖ正则化方法，导出了带复数核的第一类Ｆｒｅｄｈｏｌｍ积分方程的正则解应满足的正则积分微分方程，并讨论了正则解的收敛性·作为这一方法的应用，数值求解了与二维摇板造波问题相应的一类逆问题，并给出了选择最佳正则参数的一个实用的方法     

MINIMUM PERIOD CONTROL PROBLEM FOR INFINITE DIMENSIONAL SYSTEM

ＭＩＮＩＭＵＭＰＥＲＩＯＤＣＯＮＴＲＯＬＰＲＯＢＬＥＭＦＯＲＩＮＦＩＮＩＴＥＤＩＭＥＮＳＩＯＮＡＬＳＹＳＴＥＭＰＡＨＬＩＰＩＮＧＬＩＸＵＮＪＩＮＧＭａｎｕｓｃｒｉｐｔｒｅｃｅｉｖｅｄＤｅｃｅｍｂｅｒ１２，１９９４．ＲｅｖｉｓｅｄＡｐｒｉｌ１６...     

关于刚体转动惯量测定的计时方法研究

本文给出了在刚体转动惯量的测定中测定时间的计时装置，减小了计量时间所带来的误差。