a higher-order duration calculus and its completeness

National Natural Science Foundation of China; Public Administration and Civil Service Bureau of Macau SAR; Companhia de Telecomunicacoes de Macau S.A.R.L.; Macau SAR Government Tourist Office

An eigenfunction expansion-variational method in prediction of the transverse thermal conductivity of fiber reinforced composites considering interfacial characteristics

An eigenfunction expansion-variational method based on a unit cell is developed to deal with the steady-state heat conduction problem of doubly-periodic fiber reinforced composites with interfacial thermal contact resistance or coating. The numerical results show a rapid convergence of the present method. The present solution provides a unified first-order approximation formula of the effective thermal conductivity for different interfacial characteristics and fiber distributions. A comparison with the present high-order results, available experimental data and micromechanical estimations demonstrates that the first-order approximation formula is a good engineering closed-form formula. An engineering equivalent parameter reflecting the overall influence of the thermal conductivities of the matrix and fibers and the interfacial characteristic on the effective thermal conductivity, is found. The equivalent parameter can greatly simplify the complicated relation of the effective thermal conductivity to the internal structure of a composite. (c) 2010 Elsevier Ltd. All rights reserved.

Unified expressions of all integral variational principles

In terms of the quantitative causal principle, this paper obtains a general variational principle, gives unified expressions of the general, Hamilton, Voss, Holder, Maupertuis-Lagrange variational principles of integral style, the invariant quantities of the general, Voss, Holder, Maupertuis-Lagrange variational principles are given, finally the Noether conservation charges of the general, Voss, Holder, Maupertuis-Lagrange variational principles axe deduced, and the intrinsic relations among the invariant quantities and the Noether conservation charges of all the integral variational principles axe achieved.

Starch grains from dental calculus reveal ancient plant foodstuffs at Chenqimogou site, Gansu Province

National Natural Science Foundation of China [40771205]; National Science Fund for Distinguished Young Scholars [40625002]; Chinese Academy of Sciences [KZCX2-YW-315]

CARPS: A Program which Solves Calculus Word Problems

A program was written to solve calculus word problems. The program, CARPS (CALculus Rate Problem Solver), is restricted to rate problems. The overall plan of the program is similar to Bobrow's STUDENT, the primary difference being the introduction of "structures" as the internal model in CARPS. Structures are stored internally as trees. Each structure is designed to hold the information gathered about one object. A description of CARPS is given by working through two problems, one in great detail. Also included is a critical analysis of STUDENT.

Quantum Stratonovich Stochastic Calculus and the Quantum Wong-Zakai Theorem

Gough, John, 'Quantum Stratonovich Stochastic Calculus and the Quantum Wong-Zakai Theorem', Journal of Mathematical Physics. 47, 113509, (2006)

Typability and Type Checking in the Second-Order Λ-Calculus Are Equivalent and Undecidable (Preliminary Draft)

We consider the problems of typability[1] and type checking[2] in the Girard/Reynolds second-order polymorphic typed λ-calculus, for which we use the short name "System F" and which we use in the "Curry style" where types are assigned to pure λ -terms. These problems have been considered and proven to be decidable or undecidable for various restrictions and extensions of System F and other related systems, and lower-bound complexity results for System F have been achieved, but they have remained "embarrassing open problems"[3] for System F itself. We first prove that type checking in System F is undecidable by a reduction from semi-unification. We then prove typability in System F is undecidable by a reduction from type checking. Since the reverse reduction is already known, this implies the two problems are equivalent. The second reduction uses a novel method of constructing λ-terms such that in all type derivations, specific bound variables must always be assigned a specific type. Using this technique, we can require that specific subterms must be typable using a specific, fixed type assignment in order for the entire term to be typable at all. Any desired type assignment may be simulated. We develop this method, which we call "constants for free", for both the λK and λI calculi.