P偏振光双表面反射比的角谱及其应用

p-偏振光在镀膜平板基片两面的反射光强度比值的角谱是膜层参数(折射率、消光系数和厚度)的函数.实验表明通过角谱的测量和数值模拟是精确测量薄膜参数的新途径.基于此原理,还试制出掺Sb的SnO2溶胶凝胶薄膜的光化学气敏传感器.     

直馏汽油异构化装置的运行

长庆油田公司第二助剂厂新建的 70kt a直馏汽油异构化装置 ,采用二个反应器 ,以常压直馏汽油为原料 ,采用非临氢重整催化剂 ,生产的异构化汽油的研究法辛烷值约 90 ,但改质汽油收率较低 ,仅 65 %左右     

Dislocation configurations in highT c oxide BiSrCaCuO

A study of dislocation configurations in superconducting oxide BiSrCaCuO has been made by transmission electron microscopy. Evidence was found for the presence of dislocation pairs composed of two parallel single dislocations holding together with the same Burgers vectors. The pair can further dissociate into partials, giving rise to a four-fold ribbon. Networks consisting of dislocation pairs were also observed. These phenomena are attributed to the possible ordering of strontium and calcium ions and the existence of some oxygen sheet of the Aurivillius type in the oxide crystal. Schemes to illustrate the configurations are suggested and discussed.     

基于XUL开发富客户端应用程序

首先本文介绍了开发富客户端应用程序的RIA技术,然后对当前一种可用的RIA技术—XUL的各方面特性以及由它实现富客户端的途径做了深入探讨,最后通过一个项目实例-订单管理系统演示了基于XUL开发富客户端应用程序的一种实现。     

V型立体纸雕的几何理论与算法的研究

立体书是一种独特的纸张艺术形式,有着精细的几何结构.针对一类特殊的V型立体纸雕进行了系统性的研究,给出了V型立体纸雕可实现性的充分条件,使其可以只借助2张支撑面的力量进行打开和关闭,同时在这个过程中所有的面片都保持刚性并且相互不产生自交.基于这些充分条件,文中分别实现了一个计算机辅助交互V型纸雕设计工具,以及一个基于体方法的自动生成算法.     

Authority updating: An expert authority evaluation algorithm considering post‐evaluation and power indices in social networks

In group assessment, the focus is on finding high‐authority experts to improve the reliability of assessment results. In this study, we propose an authority updating algorithm while considering the power and judgement reliability of an expert on the basis of social networks and post‐evaluations. A network power index is established and used to reflect the power of an expert while considering social networks. The measurement of the judgement reliability of an expert considers the post‐evaluation of the objects selected by experts, thereby more scientifically reflecting the reliability of experts. The analysis shows the following: although the social‐network structure influences the authority of experts, the influence weakens when the assessment group is a highly or even fully connected group; the network effect may increase the authority of some experts and reduce that of others, and it will weaken as the network connectivity increases; moreover, the judgement reliability and authority of an expert while considering post‐evaluation can encourage him/her to make fair assessments and strive to reduce his/her motivation and cognitive biases.     

From text to graph: a general transition-based AMR parsing using neural network

Neural Computing and Applications - Semantic understanding is an essential research issue for many applications, such as social network analysis, collective intelligence and content computing,...     

Proactive replication for rare objects in unstructured peer-to-peer networks

Unstructured peer-to-peer (P2P) networks have become a very popular architecture for content distribution in large-scale and dynamic environments. The search efficiency problem in unstructured P2P networks has not been adequately addressed so far, especially concerning search for rare objects. In this paper, we propose a proactive replication strategy to improve search efficiency for rare objects. It uses an object-probing technique for peers to decide whether or not to establish replications for their objects when they join the network. This strategy can effectively increase the popularity of rare objects in order to enhance search efficiency. We also present a rare object search algorithm to reduce the overhead caused by the replication strategy. When a peer forwards a search request, the forward probability is calculated according to its neighbors' degrees and the number of neighbors' objects. Therefore, the search request is forwarded to the peers more likely containing target objects. Simulations show that our proactive replication strategy greatly improves search efficiency for rare objects with moderate communication overhead. The rare object search algorithm not only improves search efficiency for rare objects, but also achieves load balance in search.     

Fuzzy local maximal marginal embedding for feature extraction

In graph-based linear dimensionality reduction algorithms, it is crucial to construct a neighbor graph that can correctly reflect the relationship between samples. This paper presents an improved algorithm called fuzzy local maximal marginal embedding (FLMME) for linear dimensionality reduction. Significantly differing from the existing graph-based algorithms is that two novel fuzzy gradual graphs are constructed in FLMME, which help to pull the near neighbor samples in same class nearer and nearer and repel the far neighbor samples of margin between different classes farther and farther when they are projected to feature subspace. Through the fuzzy gradual graphs, FLMME algorithm has lower sensitivities to the sample variations caused by varying illumination, expression, viewing conditions and shapes. The proposed FLMME algorithm is evaluated through experiments by using the WINE database, the Yale and ORL face image databases and the USPS handwriting digital databases. The results show that the FLMME outperforms PCA, LDA, LPP and local maximal marginal embedding.     

Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses

This paper presents the following results on sets that are complete for NP.

1. If there is a problem in NP that requires $2^{n^{\Omega(1)}}$ time at almost all lengths, then every many-one NP-complete set is complete under length-increasing reductions that are computed by polynomial-size circuits.
2. If there is a problem in co-NP that cannot be solved by polynomial-size nondeterministic circuits, then every many-one NP-complete set is complete under length-increasing reductions that are computed by polynomial-size circuits.
3. If there exist a one-way permutation that is secure against subexponential-size circuits and there is a hard tally language in NP??co-NP, then there is a Turing complete language for NP that is not many-one complete.

Our first two results use worst-case hardness hypotheses whereas earlier work that showed similar results relied on average-case or almost-everywhere hardness assumptions. The use of average-case and worst-case hypotheses in the last result is unique as previous results obtaining the same consequence relied on almost-everywhere hardness results.