Banach空间中二阶积分-微分方程的初值问题

使用锥理论及单调迭代技术，首先讨论了Banach空间中一阶积分-微分方程初值问题的最小最大解的存在性，并在此基础上讨论了带有一阶微分项的二阶积分-微分方程初值问题的最小最大解的存在性。     

Railway wheel fault diagnosis using a fuzzy-logic method

A simple method for diagnosis of railway wheel defects using fuzzy-logic is proposed. The method is based on vibration measurements at different train speeds on healthy wheels and wheels with defects known a priori. The measured vibrations are statistically analyzed and confidence intervals for healthy and defective wheels depending on train speed and frequency of analysis are established. To facilitate the implementation of the method a fuzzy-logic is adopted. The fuzzy-logic model stores the obtained experience in a database and performs the decision making on damage extent and consequently the need of preventive maintenance. In view of the obtained results, the advantages and the limitations of the proposed approach as well as suggestions for further improvements are presented and discussed.     

The Ring of Invariants of Three (3 × 3)-Matrices over a Field of Prime Characteristic

We find a minimal system of generators and a homogeneous system of parameters for the algebra of invariants of three matrices of third order over a field of an arbitrary characteristic.     

A minimal pair joining to a plus cupping Turing degree

A computably enumerable (c.e.) degree a is called nonbounding, if it bounds no minimal pair, and plus cupping, if every nonzero c.e. degree x below a is cuppable. Let NB and PC be the sets of all nonbounding and plus cupping c.e. degrees, respectively. Both NB and PC are well understood, but it has not been possible so far to distinguish between the two classes. In the present paper, we investigate the relationship between the classes NB and PC , and show that there exists a minimal pair which join to a plus cupping degree, so that PC ? NB . This gives a first known difference between NB and PC . (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A New Modal Lindström Theorem

We prove new Lindstr?m theorems for the basic modal propositional language, and for some related fragments of first-order logic. We find difficulties with such results for modal languages without a finite-depth property, high-lighting the difference between abstract model theory for fragments and for extensions of first-order logic. In addition we discuss new connections with interpolation properties, and the modal invariance theorem. Mathematics Subject Classification (2000): Primary 03B45; Secondary 03C95     

Stochastic resonance in perspective

Summary We outline the historical development of stochastic resonance (SR), a phenomenon in which the signal and/or the signal-to-noise ratio in a nonlinear system increase with increasing intensity of noise. We discuss basic theoretical ideas explaining and describing SR, and we review some revealing experimental data that place SR within the wider context of statistical physics. We emphasize the close relationship of SR to some effects that are well known in condensed-matter physics. Paper presented at the International Workshop ?Fluctuations in Physics and Biology: Stochastic Resonance, Signal Processing and Related Phenomena?, Elba, 5–10 June 1994.     

一类非线性积分,微分方程的逼近解

在不主紧型条件和耗散型条件的情形下，得到了Ｂａｎａｃｈ空间中一类非线性积分，微分方程的逼近解。     

Statistical mechanics of warm and cold unfolding in proteins

We present a statistical mechanics treatment of the stability of globular proteins which takes explicitly into account the coupling between the protein and water degrees of freedom. This allows us to describe both the cold and the warm unfolding, thus qualitatively reproducing the known thermodynamics of proteins. Received: 19 March 1998 / Revised and Accepted: 25 May 1998     

Interpreting Intuitionistic Propositional Logic in Terms of Intuitionistic Protothetics

An algebra of sentences of the quite intuitionistic protothetics, that is, an intuitionistic propositional logic with quantifiers augmented by the negation of the excluded middle, is a faithful model of intuitionistic propositional logic.     

Locally minimal uniformly oriented shortest networks

The Steiner problem in a λ-plane is the problem of constructing a minimum length network interconnecting a given set of nodes (called terminals), with the constraint that all line segments in the network have slopes chosen from λ uniform orientations in the plane. This network is referred to as a minimum λ-tree. The problem is a generalization of the classical Euclidean and rectilinear Steiner tree problems, with important applications to VLSI wiring design.A λ-tree is said to be locally minimal if its length cannot be reduced by small perturbations of its Steiner points. In this paper we prove that a λ-tree is locally minimal if and only if the length of each path in the tree cannot be reduced under a special parallel perturbation on paths known as a shift. This proves a conjecture on necessary and sufficient conditions for locally minimal λ-trees raised in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222]. For any path P in a λ-tree T, we then find a simple condition, based on the sum of all angles on one side of P, to determine whether a shift on P reduces, preserves, or increases the length of T. This result improves on our previous forbidden paths results in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222].