Regularity of Viscosity Solutions of the Biased Infinity Laplacian Equation

In this paper, we are interested in the regularity estimates of the nonnegative viscosity super solution of the $β$−biased infinity Laplacian equation $$∆^β_∞u = 0,$$ where $β ∈ \mathbb{R}$ is a fixed constant and $∆^β_∞u := ∆^N_∞u + β|Du|,$ which arises from the random game named biased tug-of-war. By studying directly the $β$−biased infinity Laplacian equation, we construct the appropriate exponential cones as barrier functions to establish a key estimate. Based on this estimate, we obtain the Harnack inequality, Hopf boundary point lemma, Lipschitz estimate and the Liouville property etc.     

?*-extensions of tori, higher chow groups and applications to incidence equivalence relations for algebraic cycles

LetX be a smooth projective variety over an algebraically closed fieldk. We repeat Bloch's construction of aG _m -biextension (torseur)E over CH _hom ^p (X)×CH _hom ^q (X) forp+q=dim(X)+1. First we show that in characteristic zeroE comes via pullback from the Poincaré biextension over the corresponding product of intermediate Jacobians which has been conjectured by Bloch and Murre. Then the relations betweenE and various equivalence relations for algebraic cycles are studied. In particular we reprove Murre's theorem stating that Griffiths' conjecture holds for codimension 2 cycles, i.e. every 2-codimensional cycle which is algebraically and incidence equivalent to zero has torsion Abel-Jacobi invariant.     

Dynamic complexity of optimal paths and discount factors for strongly concave problems

We study the relationship between the dynamical complexity of optimal paths and the discount factor in general infinite-horizon discrete-time concave problems. Given a dynamic systemx _t+1=h(x _t ), defined on the state space, we find two discount factors 0 < ^{* **} < 1 having the following properties. For any fixed discount factor 0 < < ^*, the dynamic system is the solution to some concave problem. For any discount factor ^** < < 1, the dynamic system is not the solution to any strongly concave problem. We prove that the upper bound ^** is a decreasing function of the topological entropy of the dynamic system. Different upper bounds are also discussed.This research was partially supported by MURST, National Group on Nonlinear dynamics in Economics and Social Sciences. The author would like to thank two anonymous referees for helpful comments and suggestions.     

Probabilistic approach to homoclinic chaos

Three-dimensional systems possessing a homoclinic orbit associated to a saddle focus with eigenvalues ±i, – and giving rise to homoclinic chaos when the Shil'nikov condition < is satisfied are studied. The 2D Poincaré map and its 1D contractions capturing the essential features of the flow are given. At homoclinicity, these 1D maps are found to be piecewise linear. This property allows one to reduce the Frobenius—Perron equation to a master equation whose solution is analytically known. The probabilistic properties such as the time autocorrelation function of the state variablex are explicitly derived.     

Equivalent conditions involving common fixed points for maps on the unit interval

Let be a continuous self-map of the unit interval . Equivalent conditions are given to ensure that has a common fixed point with every continuous map that commutes with on a suitable subset of . This extends a recent result of Gerald Jungck.

     

Lipschitzian inverse functions,directional derivatives,and applications inC 1,1 optimization

The paper shows that Thibault's limit sets allow an iff-characterization of local Lipschitzian invertibility in finite dimension. We consider these sets as directional derivatives and extend the calculus in a way that can be used to clarify whether critical points are strongly stable inC ^1,1 optimization problems.Many fruitful discussions with colleagues D. Klatte and K. Tammer as well as with H. Th. Jongen and F. Nozicka have influenced the present investigations in a very constructive manner. For the original papers concerning the sets f(x; u), the author is indebted to Prof. L. Thibault.     

Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison

We consider the following global optimization problems for a Lipschitz functionf implicitly defined on an interval [a, b]. Problem P: find a globally-optimal value off and a corresponding point; Problem Q: find a set of disjoint subintervals of [a, b] containing only points with a globally-optimal value and the union of which contains all globally optimal points. A two-phase algorithm is proposed for Problem P. In phase I, this algorithm obtains rapidly a solution which is often globally-optimal. Moreover, a sufficient condition onf for this to be the case is given. In phase II, the algorithm proves the-optimality of the solution obtained in phase I or finds a sequence of points of increasing value containing one with a globally-optimal value. The new algorithm is empirically compared (on twenty problems from the literature) with a best possible algorithm (for which the optimal value is assumed to be known), with a passive algorithm and with the algorithms of Evtushenko, Galperin, Shen and Zhu, Piyavskii, Timonov and Schoen. For small, the new algorithm requires only a few percent more function evaluations than the best possible one. An extended version of Piyavskii's algorithm is proposed for problem Q. A sufficient condition onf is given for the globally optimal points to be in one-to-one correspondance with the obtained intervals. This result is achieved for all twenty test problems.The research of the authors has been supported by AFOSR grants 0271 and 0066 to Rutgers University. Research of the second author has been also supported by NSERC grant GP0036426, FCAR grant 89EQ4144 and partially by AFOSR grant 0066. We thank Nicole Paradis for her help in drawing the figures.     

基于拉曼光谱法的降糖类药物的判别方法比较

采用了四种聚类方法对降糖类药物拉曼光谱进行了快速、无损判别。采集九种降糖类药品共48个样品的拉曼光谱,经截波、基线校正、平滑、矢量归一化等预处理后,分别采用K-均值、系统聚类法、自组织图(SOM)及PCA-SOM四种不同聚类方法做聚类判别。结果表明,自组织图与K-均值、系统聚类法相比,聚类结果较好,并且SOM结合PCA后的PCA-SOM结果最优。为降糖类药品的快速判别从聚类的角度提供了一种新的方法。     

A layer potential analysis for transmission problems for Brinkman‐type systems in Lipschitz domains in

The aim of this paper is to establish a well‐posedness result for a boundary value problem of transmission‐type for the standard and generalized Brinkman systems in two Lipschitz domains in , the former being bounded, and the latter, its complement in . As a first step, we establish a well‐posedness result for a transmission problem for the standard Brinkman systems on complementary Lipschitz domains in by making use of the Potential theory developed for such a system. As a second step, we prove our desired result (in L²‐based Sobolev spaces) by using a method based on Fredholm operator theory and the well‐posedness result from the previous step.