Optimum sweeps of simple polygons with two guards

A polygon P admits a sweep if two mobile guards can detect an unpredictable, moving target inside P  , no matter how fast the target moves. Two guards move on the polygon boundary and are required to always be mutually visible. The objective of this study is to find an optimum sweep such that the sum of the distances travelled by the two guards in the sweep is minimized. We present an O(n²)$O(n^2)$ time and O(n)$O(n)$ space algorithm for optimizing this metric, where n   is the number of vertices of the given polygon. Our result is obtained by reducing this problem to finding a shortest path between two nodes in a graph of size O(n)$O(n)$.     

合成氢化松香乙酯的新工艺研究

以DRC为催化剂,在无溶剂条件下,通过氢化松香与乙醇的直接酯化反应合成氢化松香乙酯。探索了反应温度、催化剂用量、反应时间、物料配比等因素对反应酯化率的影响,确定最佳反应条件为:反应温度180℃,催化剂用量为原料氢化松香质量的6%,反应时间6h,醇与酸的摩尔比为3∶1。在最佳条件下酯化率达92.2%。还探讨了用阴离子交换树脂柱层析分离纯化氢化松香乙酯粗产物的方法。此外,利用红外光谱对氢化松香乙酯精制产物进行了表征;用GC-MS分别对氢化松香乙酯粗产物及其精制产物进行了定性和定量分析,比较了柱层析前后化学组成的变化。     

Point-based online value iteration algorithm in large POMDP

Partially observable Markov decision process (POMDP) is an ideal framework for sequential decision-making under uncertainty in stochastic domains. However, it is notoriously computationally intractable to solving POMDP in real-time system. In order to address this problem, this paper proposes a point-based online value iteration (PBOVI) algorithm which involves performing value backup at specific reachable belief points, rather than over the entire belief simplex, to speed up computation processes, exploits branch-and-bound pruning approach to prune the AND/OR tree of belief states online, and proposes a novel idea to reuse the belief states that have been searched to avoid repeated computation. The experiment and simulation results show that the proposed algorithm can simultaneously satisfy the requirement of low errors and high timeliness in real-time system.     

基于EIGamal签名的隐私保护网上交易方案

针对网上交易时的用户个人隐私安全问题,依据不经意传输理论,基于ElGamal签名的不经意签名电子信封(OSBE)模型,提出了一个可保护用户隐私的网上交易数字商品方案.首先用户匿名付费给银行,然后银行将用户订购商品的数字签名发送给用户,接着用户使用数字签名与商家进行不经意信息交互,最后用户得到且只能得到自己订购的数字商品,商家并不知道用户订购何种数字商品.正确性证明和安全性分析结果表明,可以有效地保护用户在网上交易过程中的个人隐私,同时防止商家恶意欺诈行为.该方案签名相对较短,计算量较小,密钥动态变化,安全性更强.     

Efective Error-Tolerant Keyword Search for Secure Cloud Computing简

The existing solutions to keyword search in the cloud can be divided into two categories： searching on exact keywords and searching on error-tolerant keywords. An error-tolerant keyword search scheme permits to make searches on encrypted data with only an approximation of some keyword. The scheme is suitable to the case where users＇ searching input might not exactly match those pre-set keywords. In this paper, we first present a general framework for searching on error-tolerant keywords. Then we propose a concrete scheme, based on a fuzzy extractor, which is proved secure against an adaptive adversary under well-defined security definition. The scheme is suitable for all similarity metrics including Hamming distance, edit distance, and set difference. It does not require the user to construct or store anything in advance, other than the key used to calculate the trapdoor of keywords and the key to encrypt data documents. Thus, our scheme tremendously eases the users＇ burden. What is more, our scheme is able to transform the servers＇ searching for error-tolerant keywords on ciphertexts to the searching for exact keywords on plaintexts. The server can use any existing approaches of exact keywords search to search plaintexts on an index table.     

Preparation,characterization, and adsorption properties for metal ions of a novel chelating resin containing sulfoxide and diethylene glycol

A novel chelating resin containing sulfoxide and diethylene glycol, poly{4‐vinylbenzyl‐[2‐2‐(hydroxyethyl)ethoxyl]sulfoxide} (PVESO) was synthesized using chloromethylated polystyrene (PS‐Cl) as material. Its structure was characterized by elemental analysis, infrared spectra, and scanning electron microscopy (SEM). The adsorption capacities of the resin for Hg²⁺, Ag⁺, Cu²⁺, Zn²⁺, and Pb²⁺ at various pH values were determined. The maximum adsorption capacities for Hg²⁺ and Ag⁺ were 1.56 and 0.75 mmol g^?1 respectively. The resin had high selectivity for Hg²⁺ and Ag⁺ over the pH range 1.0–7.0. The adsorption capacities for Hg²⁺ and Ag⁺ under competitive condition were also determined by batch experiment method. In addition, the adsorption kinetics of the resin towards Hg²⁺ at different temperatures was also investigated. The results showed that the adsorption rate was governed by film diffusion at 20°C and 25°C, by particle diffusion at 30°C and 35°C. © 2006 Wiley Periodicals, Inc. J Appl Polym Sci 102: 6054–6059, 2006     

基于信息流动分析的动态社区发现方法

随着社交网络和微博等互联网应用的逐渐流行,其用户规模在迅速膨胀.在这些大规模网络中,社区发现可以为个性化服务推荐和产品推广提供重要依据.不同于传统的网络,这些新型网络的节点之间除了拓扑结构外,还进行频繁的信息交互.信息流动使得这些网络具有方向性和动态性等特征.传统的社区发现方法由于没有考虑到这些新的特征,并不适用于这些新型网络.在传染病动力学理论的基础上,从节点间信息流动的角度,提出一种动态社区发现方法.该方法通过对信息流动的分析来发现联系紧密、兴趣相近的节点集合,以实现动态的社区发现.在真实数据集上的实验结果表明：相对于传统的社区发现方法,所提出的方法能够更准确地发现社区,并且更能体现网络中社区的动态变化.     

Communicating Is Crowdsourcing: Wi-Fi Indoor Localization with CSI-Based Speed Estimation

Numerous indoor localization techniques have been proposed recently to meet the intensive demand for location-based service (LBS). Among them, the most popular solutions are the Wi-Fi fingerprint-based approaches. The core challenge is to lower the cost of fingerprint site-survey. One of the trends is to collect the piecewise data from clients and establish the radio map in crowdsourcing manner. However the low participation rate blocks the practical use. In this work, we propose a passive crowdsourcing channel state information (CSI) based indoor localization scheme, C²IL. Despite a crowdsourcing based approach, our scheme is totally transparent to the client and the only requirement is to connect to our 802.11n access points (APs). C²IL is built upon an innovative method to accurately estimate the moving speed solely based on 802.11n CSI. Knowing the walking speed of a client and its surrounding APs, a graph matching algorithm is employed to extract the received signal strength (RSS) fingerprints and establish the fingerprint map. For localization phase, we design a trajectory clustering based localization algorithm to provide precise real-time indoor localization and tracking. We develop and deploy a practical working system of C²IL in a large office environment. Extensive evaluations indicate that the error of speed estimation is within 3%, and the localization error is within 2 m at 80% time in a very complex indoor environment.