Subnanosecond switching, plasma electrode pockels cell for high-contrast imaging with partially coherent light

A high-contrast optical switch for imaging partially coherent light (~150 times the diffraction limit) requires that it have a large angular acceptance. We describe the development of a high-speed Pockels cell that uses a thin crystal to simultaneously achieve high-contrast (greater than 1800:1) and large-angular acceptance (greater than 7 mrad for a 5-mm aperture). A KD*P crystal was used in a longitudinal-mode configuration with plasma discharges forming low-resistance, high optical transmission electrodes to couple the switching voltage. Rise times of the switched optical pulse of the order of 500 ps were observed. Characterization of the device in the near and far fields was also performed.     

Dual-key-binding cancelable palmprint cryptosystem for palmprint protection and information security

Biometric cryptosystems and cancelable biometrics are both practical and promising schemes to enhance the security and privacy of biometric systems. Though a number of bio-crypto algorithms have been proposed, they have limited practical applicability because they lack of cancelability. Since biometrics are immutable, the users whose biometrics are stolen cannot use bio-crypto systems anymore. Cancelable biometric schemes are of cancelability; however, they are difficult to compromise the conflicts between the security and performance. By embedded a novel cancelable palmprint template, namely “two dimensional (2D) Palmprint Phasor”, the proposed palmprint cryptosystem overcomes the lack of cancelability in existing biometric cryptosystems. Besides, the authentication performance is enhanced when users have different tokens/keys. Furthermore, we develop a novel dual-key-binding cancelable palmprint cryptosystem to enhance the security and privacy of palmprint biometric. 2D Palmprint Phasor template is scrambled by the scrambling transformation based on the chaotic sequence that is generated by both the user's token/key and strong key extracted from palmprint. Dual-key-binding scrambling not only has more robustness to resist against chosen plain text attack, but also enhances the secure requirement of non-invertibility. 2D Palmprint Phasor algorithm and dual-key-binding scrambling both increase the difficulty of adversary's statistical analysis. The experimental results and security analysis confirm the efficiency of the proposed scheme.     

Numerical solution of PDEs via integrated radial basis function networks with adaptive training algorithm

This paper develops a mesh-free numerical method for solving PDEs, based on integrated radial basis function networks (IRBFNs) with adaptive residual subsampling training scheme. The multiquadratic function is chosen as the transfer function of the neurons. The nonlinear algebraic equation systems for weights training are solved by Levenberg–Marquardt algorithm. The performance of the proposed method is demonstrated in numerical examples by approximating several functions and solving nonlinear PDEs. The result of numerical experiments shows that the IRBFNs with the adaptive procedure requires less neurons to attain the desired accuracy than conventional radial basis function networks.     

Bayesian projection approaches to variable selection in generalized linear models

A Bayesian approach to variable selection which is based on the expected Kullback-Leibler divergence between the full model and its projection onto a submodel has recently been suggested in the literature. For generalized linear models an extension of this idea is proposed by considering projections onto subspaces defined via some form of L₁ constraint on the parameter in the full model. This leads to Bayesian model selection approaches related to the lasso. In the posterior distribution of the projection there is positive probability that some components are exactly zero and the posterior distribution on the model space induced by the projection allows exploration of model uncertainty. Use of the approach in structured variable selection problems such as ANOVA models is also considered, where it is desired to incorporate main effects in the presence of interactions. Projections related to the non-negative garotte are able to respect the hierarchical constraints. A consistency result is given concerning the posterior distribution on the model induced by the projection, showing that for some projections related to the adaptive lasso and non-negative garotte the posterior distribution concentrates on the true model asymptotically.     

物位计测量技术分析及应用研究

雷达物位技术是物位测量技术中发展较快的技术之一,但我国雷达物位仪表的研发还比较落后。分析了雷达物位计市场所占比重最大的两种测量方式——雷达脉冲测量和连续波线性调频测量的信号处理方式,比较了它们各自的优缺点,并指出了在应用中应注意的问题;同时,探讨了物位计开发过程中的技术难点,并根据我国现有的技术条件提出了相应的解决方案。     

Improved methods for extracting frequent itemsets from interim‐support trees

Mining association rules in relational databases is a significant computational task with lots of applications. A fundamental ingredient of this task is the discovery of sets of attributes (itemsets) whose frequency in the data exceeds some threshold value. In this paper we describe two algorithms for completing the calculation of frequent sets using a tree structure for storing partial supports, called interim‐support (IS) tree. The first of our algorithms (T‐Tree‐First (TTF)) uses a novel tree pruning technique, based on the notion of (fixed‐prefix) potential inclusion, which is specially designed for trees that are implemented using only two pointers per node. This allows to implement the IS tree in a space‐efficient manner. The second algorithm (P‐Tree‐First (PTF)) explores the idea of storing the frequent itemsets in a second tree structure, called the total support tree (T‐tree); the main innovation lies in the use of multiple pointers per node, which provides rapid access to the nodes of the T‐tree and makes it possible to design a new, usually faster, method for updating them. Experimental comparison shows that these techniques result in considerable speedup for both algorithms compared with earlier approaches that also use IS trees (Principles of Data Mining and Knowledge Discovery, Proceedings of the 5th European Conference, PKDD, 2001, Freiburg, September 2001 (Lecture Notes in Artificial Intelligence, vol. 2168). Springer: Berlin, Heidelberg, 54–66; Journal of Knowledge‐Based Syst. 2000; 13 :141–149). Further comparison between the two new algorithms, shows that the PTF is generally faster on instances with a large number of frequent itemsets, provided that they are relatively short, whereas TTF is more appropriate whenever there exist few or quite long frequent itemsets; in addition, TTF behaves well on instances in which the densities of the items of the database have a high variance. Copyright © 2008 John Wiley & Sons, Ltd.     

Fast fractal prediction of surge over underwater vehicle

In order to realize accurate control of underwater vehicles, this paper proposed a fractal prediction model of surge. Firstly, we introduce the current state-of-the-art of fractal prediction; secondly, we complete a fractal analysis with the R_S method, calculating the fractal dimension of surge using the short-time dimension method; thirdly, we correct the vertical scaling factor of the Iterated Function System (IFS) using the fractal dimension. Then the predictive value can be calculated through anti-iteration according to the statistical significantly IFS and proposing a fractal prediction model. Finally, we complete a simulation analysis based on the actual data and a comparison to another prediction algorithm. The result shows that the fractal prediction algorithm of this article has better comprehensive performance.     

客户关系管理

客房关系管理（CRM）是世界各地主要企业正在讨论的一个热点问题。随着现代企业信息化管理的不断发展,实行有效的CRM策略对企业的生存和发展显得越来越重要。本文介绍了客户关系管理的系统组成、功能、作用、技术支持等方面的内容,讨论了它的数据处理过程及未来的发展。