Bending wave intensity in a thick beam

I.IntroductionMeasurementSofbendingwaveintensityinoneortwodimensi0na1structuresbecomequitepopularandgetavarietyofindustria1app1icati0ns.Theexistingintensitytheory['-']wasderivedbasedontheclassicaIBernou11i-Eu1ertheorywhichisanapproximatetheoryforana-lyzingstructuralvibration.Inthe1ow-frequencylimitwherebendingwavelengthsaremuchlongincomparisonwiththethicknessofthestructurealongwhichtheypr0pagate(i.e.,thinstructurcs),theuse0ftheclassica1theorywi1lresu1tinanegligiblyerro/`].Forshortwave-1ength…     

Gentzen型模糊推理

本文建立了能同时处理证据、规则的不确定性以及证据与规则近似匹配的Gentzen型模糊推理的语形方法．     

Newton's method for sections on Riemannian manifolds: Generalized covariant -theory

One kind of the L-average Lipschitz condition is introduced to covariant derivatives of sections on Riemannian manifolds. A convergence criterion of Newton's method and the radii of the uniqueness balls of the singular points for sections on Riemannian manifolds, which is independent of the curvatures, are established under the assumption that the covariant derivatives of the sections satisfy this kind of the L-average Lipschitz condition. Some applications to special cases including Kantorovich's condition and the γ-condition as well as Smale's α-theory are provided. In particular, the result due to Ferreira and Svaiter [Kantorovich's Theorem on Newton's method in Riemannian manifolds, J. Complexity 18 (2002) 304–329] is extended while the results due to Dedieu Priouret, Malajovich [Newton's method on Riemannian manifolds: covariant alpha theory, IMA J. Numer. Anal. 23 (2003) 395–419] are improved significantly. Moreover, the corresponding results due to Alvarez, Bolter, Munier [A unifying local convergence result for Newton's method in Riemannian manifolds, Found. Comput. Math. to appear] for vector fields and mappings on Riemannian manifolds are also extended.     

An integer linear programming approach for approximate string comparison

We introduce a problem called maximum common characters in blocks (MCCB), which arises in applications of approximate string comparison, particularly in the unification of possibly erroneous textual data coming from different sources. We show that this problem is NP-complete, but can nevertheless be solved satisfactorily using integer linear programming for instances of practical interest. Two integer linear formulations are proposed and compared in terms of their linear relaxations. We also compare the results of the approximate matching with other known measures such as the Levenshtein (edit) distance.     

Charge-conserving electron density averaging for a set of nuclear configurations

The Löwdin-Inverse Löwdin Transformation (LILT) technique combined with the Diophantine Density Matrix Purification (DDMP) method is suggested for a charge-preserving density averaging approach for a range of nuclear configurations.     

The case for an interval-based representation of linguistic truth

This paper develops an interval-based approach to the concept of linguistic truth. A special-purpose interval logic is defined, and it is argued that, for many applications, this logic provides a potentially useful alternative to the conventional fuzzy logic.The key idea is to interpret the numerical truth value v(p) of a proposition p as a degree of belief in the logical certainty of p, in which case p is regarded as true, for example, if v(p) falls within a certain range, say, the interval [0.7, 1]. This leads to a logic which, although being only a special case of fuzzy logic, appears to be no less linguistically correct and at the same time offers definite advantages in terms of mathematical simplicity and computational speed.It is also shown that this same interval logic can be generalized to a lattice-based logic having the capacity to accommodate propositions p which employ fuzzy predicates of type 2.     

Tableau method for residuated logic

Residuated logic is a generalization of intuitionistic logic, which does not assume the idempotence of the conjunction operator. Such generalized conjunction operators have proved important in expert systems (in the area of Approximate Reasoning) and in some areas of Theoretical Computer Science. Here we generalize the intuitionistic tableau procedure and prove that this generalized tableau method is sound for the semantics (the class of residuated algebras) of residuated propositional calculus (RPC). Since the axioms of RPC are complete for the semantics we may conclude that whenever a formula 0 is tableau provable, it is deducible in RPC. We present two different approaches for constructing residuated algebras which give us countermodels for some formulas φ which are not tableau provable. The first uses the fact that the theory of residuated algebras is equational, to construct quotients of free algebras. The second uses finite algebras. We end by discussing a number of open questions.     

带核集分划问题的一个线性1／7近似算法

设有整数集Ｓ＝｛ｒ１，ｒ２；ｐ１，ｐ２，…，ｐｎ｝，这里ｒｉ≥０，ｐｊ＞０（ｉ＝１，２；ｊ＝１，２，…，ｎ），寻找一个Ｓ的最优分划Ｐ＝（Ｓ＊１，Ｓ＊２）使得：（１）ｒｉ属于不同子集，（２）Ｓ＊１与Ｓ＊２中元素总和较大者尽可能地小．这是一个ＮＰ－完备问题，本文给出一个线性时间近似算法，它的近似界为８７．     

A critical study of basis set effects and the use of approximate natural orbitals in SCF-CI calculations of molecular geometries and heats of reaction

SCF-CI calculations have been performed on a number of chemical reactions between closed shell molecules in order to determine the heats of reaction. Contracted Gaussian type atomic basis sets of three different qualities were used and the CI calculations were performed in a truncated approximate natural orbital space. The conclusions to be drawn from these calculations are rather pessimistic. For heats of reaction, errors up to 6 kcal/mole are obtained on the SCF-level with a double zeta plus polarization atomic basis. A further improvement is only possible if extended basis sets are used. Correlation effects on heats of reaction are of the same size and CI calculations are therefore only meaningful with large atomic basis sets.For the CI calculations a one-electron space of approximate natural orbitals, obtained from second order RS perturbation theory, was used. Different truncations, using the occupation number as criterion, were tested. The general conclusion is that errors in energy differences obtained with a truncated basis set are of the same magnitude as the error in the total correlation energy. In practice this means that not more than 20–30% of the approximate natural orbitals can be deleted if the error is to be kept less than a few kcal/mole.Finally the truncation error in calculations of bond distances was tested for a few cases. Errors of around 10% of the total change due to correlation were found when 30% of the lowest occupied natural orbitals were deleted.