Uniformity in Computable Structure Theory

We investigate the effects of adding uniformity requirements to concepts in computable structure theory such as computable categoricity (of a structure) and intrinsic computability (of a relation on a computable structure). We consider and compare two different notions of uniformity, previously studied by Kudinov and by Ventsov. We discuss some of their results and establish new ones, while also exploring the connections with the relative computable structure theory of Ash, Knight, Manasse, and Slaman and Chisholm and with previous work of Ash, Knight, and Slaman on uniformity in a general computable structure-theoretical setting.     

Bounds for the Least Laplacian Eigenvalue of a Signed Graph

A signed graph is a graph with a sign attached to each edge. This paper extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the relationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph are investigated.     

合金铸铁激光处理的探讨——Ⅱ.激光辐照工艺参数的控制

用热传导方程控制激光辐照温度,建立了一种新回归方程以控制激光辐照硬化深度,选用卡尔丹公式列热传导方程及同归方程联立求解,可得到同时满足一定的硬化深度及表面最高温度双重要求的工艺参数,此种方法可作为激光硬化处理工艺参数的控制或预报,对本合金铸铁的激光硬化处理,其表面温度的下限应大于其熔点温度,即以表面产生微熔的快速冷凝处理为宜,并以选取低功率慢扫描为最佳。     

Chern and Pontryagin Numbers in Perfect Symmetries of Spheres

The paper presents a procedure for constructing smooth actions of finite perfect groups on spheres with fixed point sets having certain prescribed properties (Theorem A); in particular, having any prescribed configuration of Chern and Pontryagin numbers (Corollary C). The main ingredients used are equivariant thickening and equivariant surgery.     

Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets

This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms.     

非空交定理及其应用

本文得到了广义区间空间中几个参数型非空交定理，并用此结果证明了一些新型极大极小定理，截口定理，重合定理，以及变分不等式解的存在性定理。本文中的结果包含（１，３，５－１２，１４－１６）中相应结果。     

Lipschitz条件题设的完善

本文给出了函数单侧极值点的定义,并证明了连续函数的单侧极值点所成之集与实数集等势,且利用此完善了函数满足Lipschitz 条件的题设。     

Assessing the Error Probability of the Model Selection Test

The asymptotic error probability of Linhart's model selection test isevaluated, and compared with the nominal significance level. We examine thecase where the expected discrepancies of the candidate models from the truemodel are asymptotically equal. The local alternatives method is employed inthe limiting operation of the asymptotic evaluation. Although the errorprobability under the null hypothesis is actually shown to be equal to orless than the level for most situations, intolerable violations of the errorcontrol are observed for nested models: It is often erroneously concludedthat the smaller model is significantly better than the larger model. Toprevent this violation, a modification of Linhart's test statistic isproposed. The effectiveness of the proposed test is confirmed throughtheoretical analysis and numerical simulations.     

The Potts model representation and a Robinson–Schensted correspondence for the partition algebra

We construct a correspondence between the set of partitions of a finite set M and the set of pairs of walks to the same vertex on a graph giving the Bratteli diagram of the partition algebra on M. This is the precise analogue of the correspondence between the set of permutations of a finite set and the set of pairs of Young tableaux of the same shape, called the Robinson–Schensted correspondence.     

Near-barrier fusion reactions induced by α on197Au,193Ir,191Ir,185Re,181Ta,121Sb and69Ga nuclei

Fusion-evaporation cross-sections for the α-induced reactions upon¹⁹⁷Au,¹⁹³Ir,¹⁹¹Ir,¹⁸⁵Re,¹⁸¹Ta,¹²¹Sb and⁶⁹Ga nuclei at bombarding energies near the Coulomb barrier have been measured by off-line observation of the γ-rays emitted in the radioactive decay of the residual nuclei using stacked foil technique. The total fusion cross-section for the systems have been compared with simple statistical model calculations using the code ALICE/91 as well as with the coupled channel calculations that include the β₂ and ν₄ slatic deformations and dynamic couplings of the vibrational/rotational states of the target and the projet tile using the code CCDEF.