Partial-match retrieval for dynamic files

This paper studies file designs for answering partial-match queries for dynamic files. A partial-match query is a specification of the value of zero or more fields in a record. An answer to a query consists of a listing of all records in the file satisfying the values specified.The main contribution is a general method whereby certain primary key hasing schemes can be extended to partial-match retrieval schemes. These partial-match retrieval designs can handle arbitrarily dynamic files and can be optimized with respect to the number of page faults required to answer a query.We illustrate the method by considering in detail the extension of two recent dynamic primary key hashing schemes.     

Tightly controlled linear hashing without separate overflow storage

A hashing method is presented where the amount of storage required for a file can expand and shrink by very large factors. The performance of this method as measured by lookup time, insertion time and deletion time is very good even when the total storage utilization is as high as 90 percent. The user can completely control the storage utilization between two chosen bounds so that the storage requirement varies linearly with the number of records currently in the file.Unlike previous methods, no separate overflow storage pool is involved and one need not be concerned with expected and worst case requirements for overflow space. Indeed, the absence of requirements for such a separate overflow pool could allow the use of this method with primitive microprocessor operating systems.The choice of hashing functions is discussed and simulation results show great danger in blindly using the popular remainder method.Both an elementary analysis and simulation results are given.This research was supported by the National Science and Engineering Research Council of Canada.     

Partial match retrieval

The study of partial match file designs is continued. This study is concerned with a class of file designs which properly contains theABD designs of Rivest. A new family of partial match files is presented, the worst case performance is determined, and the implementation of these files is discussed.     

Dynamic hashing

A new file organisation called dynamic hashing is presented. The organisation is based on normal hashing, but the allocated storage space can easily be increased and decreased without reorganising the file, according to the number of records actually stored in the file. The expected storage utilisation is analysed and is shown to be approximately 69% all the time. Algorithms for inserting and deleting a record are presented and analysed. Retrieval of a record is fast, requiring only one access to secondary storage. There are no overflow records. The proposed scheme necessitates maintenance of a relatively small index structured as a forest of binary trees or slightly modified binary tries. The expected size of the index is analysed and a compact representation of the index is suggested.     

Partial functional linear quantile regression

This paper studies estimation in partial functional linear quantile regression in which the dependent variable is related to both a vector of finite length and a function-valued random variable as predictor variables. The slope function is estimated by the functional principal component basis. The asymptotic distribution of the estimator of the vector of slope parameters is derived and the global convergence rate of the quantile estimator of unknown slope function is established under suitable norm. It is showed that this rate is optimal in a minimax sense under some smoothness assumptions on the covariance kernel of the covariate and the slope function. The convergence rate of the mean squared prediction error for the proposed estimators is also be established. Finite sample properties of our procedures are studied through Monte Carlo simulations. A real data example about Berkeley growth data is used to illustrate our proposed methodology.     

Near Polygons from Partial Linear Spaces

We construct a nondegenerate near polygon from a partial linear space without isolated points. We also prove that the points of a near polygon at distance at most 2 from a fixed point induce a near polygon, which is related to the class of the near polygons obtained from the construction. We give also a characterization of the near polygons of Hamming type in terms of parallelism.     

Frequency loading and linear probing

It is well-known that the minimum expected search length for hash files which employ linear probing to solve the overflow problem is achieved by frequency loading. In this paper the resulting expected search length is computed. A rather simple formula for computing the expected length of unsuccessful searches is obtained as a by-product. An infinite number of buckets is assumed.     

Empirical likelihood for partial linear models

In this paper the empirical likelihood method due to Owen (1988,Biometrika,75, 237–249) is applied to partial linear random models. A nonparametric version of Wilks' theorem is derived. The theorem is then used to construct confidence regions of the parameter vector in the partial linear models, which has correct asymptotic coverage. A simulation study is conducted to compare the empirical likelihood and normal approximation based method. Research supported by NNSF of China and a grant to the first author for his excellent Ph.D. dissertation work in China. Research supported by Hong Kong RGC CERG No. HKUST6162/97P.     

几种最小二乘估计（LSE）效率的偏序

研究了几种最小二乘估计（ＬＳＥ）效率的偏序，证明了均方误差比（ＭＳＥＲ）效率在几种效率度量中是最优的。     

Additive Maps Preserving the Star Partial Order on B(H)

Let B(H) be the C*-algebra of all bounded linear operators on a complex Hilbert space H. It is proved that an additive surjective map φ on B(H) preserving the star partial order in both directions if and only if one of the following assertions holds.(1) There exist a nonzero complex number α and two unitary operators U and V on H such that φ(X) = αUXV or φ(X) = αUX*V for all X ∈ B(H).(2)There exist a nonzero α and two anti-unitary operators U and V on H such thatφ(X) = αUXV or φ(X) = αUX*V for all X ∈ B(H).     

Consistency and normality of Huber-Dutter estimators for partial linear model

For partial linear model Y = Xτβ0 g0(T) with unknown β0 ∈ Rd and an unknown smooth function g0, this paper considers the Huber-Dutter estimators of β0, scale σ for the errors and the function g0 approximated by the smoothing B-spline functions, respectively. Under some regularity conditions, the Huber-Dutter estimators of β0 and σ are shown to be asymptotically normal with the rate of convergence n-1/2 and the B-spline Huber-Dutter estimator of g0 achieves the optimal rate of convergence in nonparametric regression. A simulation study and two examples demonstrate that the Huber-Dutter estimator of β0 is competitive with its M-estimator without scale parameter and the ordinary least square estimator.     

Empirical likelihood-based subset selection for partially linear autoregressive models

Based on the empirical likelihood method, the subset selection and hypothesis test for parameters in a partially linear autoregressive model are investigated. We show that the empirical log-likelihood ratio at the true parameters converges to the standard chi-square distribution. We then present the definitions of the empirical likelihood-based Bayes information criteria （EBIC） and Akaike information criteria （EAIC）. The results show that EBIC is consistent at selecting subset variables while EAIC is not. Simulation studies demonstrate that the proposed empirical likelihood confidence regions have better coverage probabilities than the least square method, while EBIC has a higher chance to select the true model than EAIC.     

Content-based image retrieval using visually significant point features

This paper presents a new image retrieval scheme using visually significant point features. The clusters of points around significant curvature regions (high, medium, and weak type) are extracted using a fuzzy set theoretic approach. Some invariant color features are computed from these points to evaluate the similarity between images. A set of relevant and non-redundant features is selected using the mutual information based minimum redundancy-maximum relevance framework. The relative importance of each feature is evaluated using a fuzzy entropy based measure, which is computed from the sets of retrieved images marked relevant and irrelevant by the users. The performance of the system is evaluated using different sets of examples from a general purpose image database. The robustness of the system is also shown when the images undergo different transformations.     

随机截断下部分线性模型中参数估计的渐近性质

考虑部分线性回归模型Yi＝xiβ g(ti) σiej,i＝1,2,…,n其中σi^2＝／f(ui)．当Yi因受某种随机干扰而被右截断时,就截断分布巳知的情形,利用所获得的截断观察数据构造了β,g,f的估计量β^～n,g^～n,f^～n,并在一定条件下,证明了β^～n的渐近正态性,同时得到了g^～n,f^～n的最优收敛速度。     

Estimation in partial linear EV models with replicated observations

The aim of this work is to construct the parameter estimators in the partial linear errors-in-variables (EV) models and explore their asymptotic properties. Unlike other related references, the assumption of known error covariance matrix is removed when the sample can be repeatedly drawn at each designed point from the model. The estimators of interested regression parameters, and the model error variance, as well as the non-parametric function, are constructed. Under some regular conditions, all of the estimators prove strongly consistent. Meanwhile, the asymptotic normality for the estimator of regression parameter is also presented. A simulation study is reported to illustrate our asymptotic results.     

部分线性回归模型变窗宽一步局部M-估计

讨论了部分线性回归模型的变窗宽一步局部M-估计.用一步局部M-估计给出未知函数的估计,用平均方法给出参数估计.进一步通过两个引理证明一步M-估计的渐近正态性.所提出的方法继承了局部多项式的优点并且克服了最小二乘法缺乏稳健性的缺点.     

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.     

网格状有向图上的部分合作对策

本文通过在有向图上每个状态结点处定义合作函数,运用Berge C的关于图匕对策中策略的概念,在网格状有向图上考察部分合作动态对策.局中人在对策进程中将采取部分合作而不是完全合作,部分合作的主要特征是每个局中人的行为是合作行动与单独行动的组合.本文合作函数的设定允许局中人加入某个联盟之后再脱离该联盟,同时给出了有向图上部分合作对策的值、最优路径的算法及示例.     

A Survey on Explicit Representation Formulae for Fundamental Solutions of Linear Partial Differential Operators

In the present article, we aim at treating the existence of fundamental solutions of linear partial differential operators with constant coefficients from the viewpoint of setting up explicit formulae yielding fundamental solutions.