宽板塑性弯曲成形过程中的板厚变化规律

根据宽板弯曲过程中的变形与应力分布特征，提出了一种计算弯曲过程中板料厚度随弯曲程度变化的新的近似解答方法．该方法基于塑性增量理论，应用塑性成形过程的体积不变假设和弯曲过程的平面假设．作为算例，得到了理想刚塑性材料的板料厚度、变薄系数以及应变中性层内移系数随板料弯曲内表面曲率半径变化的规律，并与实验数据进行了比较，两吻合良好．     

完全与不完全叉形分岔实验

介绍一种可演示完全与不完全叉形分彷的实验装置，并分析其机理。本文对非线性动力学实验设计有一定启示作用。     

On a class of Riemann surfaces

It is considered the class of Riemann surfaces with dimT1 = 0, where T1 is a subclass of exact harmonic forms which is one of the factors in the orthogonal decomposition of the spaceΩH of harmonic forms of the surface, namely The surfaces in the class OHD and the class of planar surfaces satisfy dimT1 = 0. A.Pfluger posed the question whether there might exist other surfaces outside those two classes. Here it is shown that in the case of finite genus g, we should look for a surface S with dimT1 = 0 among the surfaces of the form Sg\K , where Sg is a closed surface of genus g and K a compact set of positive harmonic measure with perfect components and very irregular boundary.     

Speeding up the FMMR perfect sampling algorithm: A case study revisited

In a previous paper by the second author, two Markov chain Monte Carlo perfect sampling algorithms—one called coupling from the past (CFTP) and the other (FMMR) based on rejection sampling—are compared using as a case study the move‐to‐front (MTF) self‐organizing list chain. Here we revisit that case study and, in particular, exploit the dependence of FMMR on the user‐chosen initial state. We give a stochastic monotonicity result for the running time of FMMR applied to MTF and thus identify the initial state that gives the stochastically smallest running time; by contrast, the initial state used in the previous study gives the stochastically largest running time. By changing from worst choice to best choice of initial state we achieve remarkable speedup of FMMR for MTF; for example, we reduce the running time (as measured in Markov chain steps) from exponential in the length n of the list nearly down to n when the items in the list are requested according to a geometric distribution. For this same example, the running time for CFTP grows exponentially in n. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2003     

Chatter mitigation using the nonlinear tuned vibration absorber

A passive vibration absorber, termed the nonlinear tuned vibration absorber (NLTVA), is designed for the suppression of chatter vibrations. Unlike most passive vibration absorbers proposed in the literature for suppressing machine tool vibrations, the NLTVA comprises both a linear and a nonlinear restoring force. Its linear characteristics are tuned in order to optimize the stability properties of the machining operation, while its nonlinear properties are chosen in order to control the bifurcation behavior of the system and guarantee robustness of stable operation. In this study, the NLTVA is applied to turning machining.     

Letter: A Cylindrically Symmetric Solution in Einstein-Maxwell-Dilaton Gravity

We consider the existence of Einstein-Maxwell-dilaton plus fluid systems for the case of stationary cylindrically symmetric spacetimes. An exact inhomogeneous -order solution is found, where the parameter parametrizes the non-minimally coupled electromagnetic field. Some its physical attributes are investigated and a connection with the already known Gödel-type solution is given. It is shown that our solution also survives in the string-inspired charged gravity framework. We find that a magnetic field has positive influence on the chronology violation unlike the dilaton influence.     

Extensions of perfect GO-spaces and -discrete dense sets

In this paper, we prove that if a perfect GO-space has a -discrete dense set, then has a perfect linearly ordered extension. This answers a problem raised by H. R. Bennett, D. J. Lutzer and S. Purisch. And the result is also a partial answer to an old problem posed by H. R. Bennett and D. J. Lutzer.

     

On the Characterization of Linear Uniquely Decodable Codes

A Uniquely Decodable (UD) Code is a code such that any vector of the ambient space has a unique closest codeword. In this paper we begin a study of the structure of UD codes and identify perfect subcodes. In particular we determine all linear UD codes of covering radius 2.     

满足右零化子特殊升链条件的环

本文讨论了满足右零化子特殊升链条件的环的性质以及与左、右完备环，ＱＦ－环的关系；给出了满足右零化子特殊升链条件的环中素理想是完全素理想的条件，从而给出了Ｇｏｌｄｉｅ定理的一个应用．     

Ideals in a perfect closure, linear growth of primary decompositions, and tight closure

This paper is concerned with tight closure in a commutative Noetherian ring of prime characteristic , and is motivated by an argument of K. E. Smith and I. Swanson that shows that, if the sequence of Frobenius powers of a proper ideal of has linear growth of primary decompositions, then tight closure (of ) `commutes with localization at the powers of a single element'. It is shown in this paper that, provided has a weak test element, linear growth of primary decompositions for other sequences of ideals of that approximate, in a certain sense, the sequence of Frobenius powers of would not only be just as good in this context, but, in the presence of a certain additional finiteness property, would actually imply that tight closure (of ) commutes with localization at an arbitrary multiplicatively closed subset of .

Work of M. Katzman on the localization problem for tight closure raised the question as to whether the union of the associated primes of the tight closures of the Frobenius powers of has only finitely many maximal members. This paper develops, through a careful analysis of the ideal theory of the perfect closure of , strategies for showing that tight closure (of a specified ideal of ) commutes with localization at an arbitrary multiplicatively closed subset of and for showing that the union of the associated primes of the tight closures of the Frobenius powers of is actually a finite set. Several applications of the strategies are presented; in most of them it was already known that tight closure commutes with localization, but the resulting affirmative answers to Katzman's question in the various situations considered are believed to be new.