Bayesian linear prediction in finite populations

In this paper, Bayesian linear prediction of the total of a finite population is considered in situations where the observation error variance is parameter dependent. Connections with least squares prediction (Royall (1976, J. Amer. Statist. Assoc., 71, 657–664)) in mixed linear models (Theil (1971, Principles of Econometrics, Wiley, New York)), are established. Extensions to the case of dynamic (state dependent) superpopulation models are also proposed.     

最近邻弱交换相互作用对纳米管中Blume-Capel模型热学性质的研究

利用有效场理论研究了纳米管上最近邻弱交换相互作用下spin-1纳米管中Blume-Capel模型的内能、比热和自由能,得到了系统的内能、比热和自由能与最近邻弱交换相互作用和晶场的关系。结果表明：最近邻弱交换相互作用和晶场强度等诸多因素相互竞争,使系统表现出比 = = =1时的BC模型更为复杂的热学性质;系统内能随温度的变化曲线表现出不连续性;比热随温度的变化出现奇异性;高温对自由能的影响更加明显。     

最近邻强交换相互作用对spin-1纳米管热力学性质的影响

利用有效场理论研究了纳米管上最近邻强交换相互作用下Blume-Capel模型的内能、比热和自由能,得到了系统的内能、比热和自由能与最近邻强交换相互作用、晶场强度和温度的关系.结果表明:最近邻强交换相互作用、晶场强度和温度等诸多因素相互竞争,使系统表现出比J_1=J_2=J=1时的BC模型更为丰富的热力学性质;系统内能随温度的变化曲线表现出不连续性;比热随温度的变化出现奇异性;一定条件下,基态时的自由能会发生突变.     

Function Spaces of Posets with Projections

This paper investigates function spaces of structures consisting of a partially ordered set together with some directed family of projections.More precisely, given a fixed directed index set (I,), we consider triples (D,,(p _i ) _iI ) with (D,) a poset and (p _i ) _iI a monotone net of projections of D. We call them (I,)-pop's (posets with projections). Our main purpose is to study structure preserving maps between (I,)-pop's. Such homomorphisms respect both order and projections.Any (I,)-pop is known to induce a uniformity and thus a topology. The set of all homomorphisms between two (I,)-pop's turns out to form an (I,)-pop itself. We show that its uniformity is the uniformity of uniform convergence. This enables us to prove that properties such as completeness and compactness transfer to function pop's.Concerning categorical properties of (I,)-pop's, we will see that we are in a lucky situation from a computer scientist's point of view: we obtain Cartesian closed categories. Moreover, by a D -construction we get (I,)-pop's that are isomorphic to their own exponent. This yields new models for the untyped -calculus.     

Shape-Memory Effect in Polymer Composites with a Compactible Filler

The shape-memory effect has been investigated in formed porous polymers and composites under heating. An epoxy polymer, ultrahigh-molecular polyethylene, and polypropylene were used as the polymeric matrix and carbon materials of different bulk density were taken for the filler. An unconventional shape-memory effect, which is accompanied by an increase in volume, was created. Processing schemes by which this effect can be achieved are proposed. They make it possible to obtain products of varying configuration.     

Robust Output Tracking Control of an Uncertain Linear System via a Modified Optimal Linear-Quadratic Method

This study investigates the robust output tracking problem for a class of uncertain linear systems. The uncertainties are assumed to be time invariant and to satisfy the matching conditions. According to the selected nominal parameters, an optimal solution with a prescribed degree of stability is determined. Then, an auxiliary input via the use of an adapting factor, connected to the nominal optimal control, is introduced to guarantee the robustness and prescribed degree of stability for the output tracking control of the uncertain linear systems. This method is very simple and effective and can reject bounded uncertainties imposed on the states. A maglev vehicle model example is given to show its effectiveness.     

Efimov's Effect in a Model of Perturbation Theory of the Essential Spectrum

A model operator similar to the energy operator of a system with a nonconserved number of particles is studied. The essential spectrum of the operator is described, and under some natural conditions on the parameters it is shown that there are infinitely many eigenvalues lying below the bottom of the essential spectrum.     

The Problem of Aliasing in Identifying Finite Parameter Continuous Time Stochastic Models

This note exposits the problem of aliasing in identifying finite parameter continuous time stochastic models, including econometric models, on the basis of discrete data. The identification problem for continuous time vector autoregressive models is characterised as an inverse problem involving a certain block triangular matrix, facilitating the derivation of an improved sufficient condition for the restrictions the parameters must satisfy in order that they be identified on the basis of equispaced discrete data. Sufficient conditions already exist in the literature but these conditions are not sharp and rule out plausible time series behaviour.     

Information and asymptotic efficiency of the case-cohort sampling design in Cox's regression model

Efficiencies of the maximum pseudolikelihood estimator and a number of related estimators for the case-cohort sampling design in the proportional hazards regression model are studied. The asymptotic information and lower bound for estimating the parametric regression parameter are calculated based on the effective score, which is obtained by determining the component of the parametric score orthogonal to the space generated by the infinite-dimensional nuisance parameter. The asymptotic distributions of the maximum pseudolikelihood and related estimators in an i.i.d. setting show that these estimators do not achieve the computed asymptotic lower bound. Simple guidelines are provided to determine in which instances such estimators are close enough to efficient for practical purposes.     

Optimal broadcast on parallel locality models

In this paper matching upper and lower bounds for broadcast on general purpose parallel computation models that exploit network locality are proven. These models try to capture both the general purpose properties of models like the PRAM or BSP on the one hand, and to exploit network locality of special purpose models like meshes, hypercubes, etc., on the other hand. They do so by charging a cost l(|i−j|) for a communication between processors i and j, where l is a suitably chosen latency function.An upper bound T(p)=∑_i=0^loglogp2ⁱ·l(p^1/2i) on the runtime of a broadcast on a p processor H-PRAM is given, for an arbitrary latency function l(k).The main contribution of the paper is a matching lower bound, holding for all latency functions in the range from l(k)=Ω(logk/loglogk) to l(k)=O(log²k). This is not a severe restriction since for latency functions l(k)=O(logk/log¹⁺log(k)) with arbitrary >0, the runtime of the algorithm matches the trivial lower bound Ω(logp) and for l(k)=Θ(log¹⁺k) or l(k)=Θ(k), the runtime matches the other trivial lower bound Ω(l(p)). Both upper and lower bounds apply for other parallel locality models like Y-PRAM, D-BSP and E-BSP, too.