面阵探测器的像点亚像素定位研究

面阵探测器可直接探测点目标图像的位置，但其定位精度受到探测器分辨率的限制。因此，亚像元精度技术得到了发展。它是利用目标像点的灰度分布特性，通过内插细分算法，确定出像点位置。可将定位精度提高1—2个数量级。本文介绍了几种实现目标像点亚像素定位的内插细分算法。对它们的计算公式、特点进行了分析，并进行了实验验证。     

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     

The Equivalence of Several Basic Theorems for Subdifferentials

Several different basic tools are used for studying subdifferentials. They are a nonlocal fuzzy sum rule in (Borwein et al., 1996; Zhu, 1996), a multidirectional mean value theorem in (Clarke and Ledyaev, 1994; Clarke et al., 1998), local fuzzy sum rules in (Ioffe, 1984, 1990) and an extremal principle in (Kruger and Mordukhovich, 1980; Mordukhovich, 1976, 1980, 1994). We show that all these basic results are equivalent and discuss some interesting consequences of this equivalence.     

ContributionsSign-balanced covering matrices

A q × n array with entries from 0, 1,…,q − 1 is said to form a difference matrix if the vector difference (modulo q) of each pair of columns consists of a permutation of [0, 1,… q − 1]; this definition is inverted from the more standard one to be found, e.g., in Colbourn and de Launey (1996). The following idea generalizes this notion: Given an appropriate δ (-[−1, 1]^t, a λq × n array will be said to form a (t, q, λ, Δ) sign-balanced matrix if for each choice C₁, C₂,…, C_t of t columns and for each choice = (₁,…,_t) Δ of signs, the linear combination ∑_j=1^t _jC_j contains (mod q) each entry of [0, 1,…, q − 1] exactly λ times. We consider the following extremal problem in this paper: How large does the number k = k(n, t, q, λ, δ) of rows have to be so that for each choice of t columns and for each choice (₁, …, _t) of signs in δ, the linear combination ∑_j=1^t _jC_j contains each entry of [0, 1,…, q t- 1] at least λ times? We use probabilistic methods, in particular the Lovász local lemma and the Stein-Chen method of Poisson approximation to obtain general (logarithmic) upper bounds on the numbers k(n, t, q, λ, δ), and to provide Poisson approximations for the probability distribution of the number W of deficient sets of t columns, given a random array. It is proved, in addition, that arithmetic modulo q yields the smallest array - in a sense to be described.     

Dimensional Properties of Fractional Brownian Motion

Let B^α = {B^α（t）,t E R^N} be an （N,d）-fractional Brownian motion with Hurst index α∈ （0, 1）. By applying the strong local nondeterminism of B^α, we prove certain forms of uniform Hausdorff dimension results for the images of B^α when N 〉 αd. Our results extend those of Kaufman for one-dimensional Brownian motion.     

A CLASS OF NEW NONCONFORMING FINITE ELEMENTS

A class of new nine-parameter nonconforming finite elements with convergent prop-erties are constructed in terms of the approach of interpolation methods in this paper. All of those finite elements can be viewed as the generalization of Zienkiewicz's finite element by dis-lurbing its parameters.     

On the Decomposition of Hopf Module Coalgebra

In1969,Sweedler[1]giventhedecompositiontheoreyofcoalgebraswhicharecocommu-tative.In1975,Kaplansky[2]showedthatanycoalgebracanbeuniquelydecomposedintoadirectsumofitsindecomposablesubcoalgebras.From1978to1992,Shudo[3]andXu[4]consructuredtheindecomposabledirectsumcomponentsofacoalggebra,viadefineequivalenceralationforthesetofsimplesubcoalgebras.Asweknow,themodolecoalgebraisthennaturalgeneralizationofcoalgebra.AndittakesplayanimportentroleintheDrinfelddouble.Inthispaper,wediscussthedecompositio…     

Some path properties of generalized Lévy sheet

Let X(t) be an N parameter generalized Lévy sheet taking values in ℝ^d with a lower index α, ℜ = {(s, t] = ∏ _i=1 ^N (s _i, t _i], s _i < t _i}, E(x, Q) = {t ∈ Q: X(t) = x}, Q ∈ ℜ be the level set of X at x and X(Q) = {x: ∃t ∈ Q such that X(t) = x} be the image of X on Q. In this paper, the problems of the existence and increment size of the local times for X(t) are studied. In addition, the Hausdorff dimension of E(x, Q) and the upper bound of a uniform dimension for X(Q) are also established.     

Three-pencil lattices on triangulations

In this paper, three-pencil lattices on triangulations are studied. The explicit representation of a lattice, based upon barycentric coordinates, enables us to construct lattice points in a simple and numerically stable way. Further, this representation carries over to triangulations in a natural way. The construction is based upon group action of S ₃ on triangle vertices, and it is shown that the number of degrees of freedom is equal to the number of vertices of the triangulation.      

Freedom from the interpolation property for tense calculi associated with Ershov spaces

We study into the question whether calculi associated with Ershov topological spaces possess Craig’s interpolation property. Supported by RFBR grant No. 06-01-00358, by INTAS grant No. 04-77-7080, and by the Council for Grants (under RF President) and State Aid of Fundamental Science Schools, project NSh-4787.2006.1. __________ Translated from Algebra i Logika, Vol. 46, No. 6, pp. 745–762, November–December, 2007.