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分别对氢化松香乙酯粗产物及其精制产物进行了定性和定量分析,比较了柱层析前后化学组成的变化。     

6，7-二氢-5H-环戊烷并[b]吡啶

6,7-二氢-5H-环戊烷并[b]吡啶主要用于药物、杀菌剂和抗菌剂的研究,也被广泛应用于制备植物保护剂和合成树脂、防老剂以及塑料制品等。目前因其被作为第四代抗生素头孢匹罗的侧链而成为研究者竞相开发的热点。6,7-二氢-5H-环戊烷并[b]吡啶有实用价值的合成方法主要有N-羟基邻苯二甲酰胺法、丙烯醛法和己二酸二乙酯法。丙烯醛法中6,7-二氢-5H-环戊烷并[b]吡啶的收率为87.4%,具有较好的开发前景。     

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

基于自由运动一维标定物的多摄像机参数标定方法与实验

一维标定方法易于实现且标定效率高,为了克服现有一维标定方法的一些不足,本文提出一种用一维标定物标定多摄像机内外参数的方法,首先进行两两标定,在此过程中,假定主点坐标近似已知而仅考虑畸变、焦距、旋转和平移等参数,接着利用基本矩阵及一维标定物上特征点之间的几何约束,估计两摄像机的内外参数,两两标定完成后,采用Dijkstra最短路径法和捆绑调整对多摄像机系统进行全局标定(含主点坐标),仿真和真实实验表明本文的方法是切实有效的.     

基于改进K-Means聚类的煤炭交易者信誉度划分

针对目前煤炭销售中存在的煤炭质量信息分散性与质量计价政策对其质量精确性要求的矛盾,提出了采用对初始聚类中心优化选取的K-Means聚类算法,对大型煤炭企业及其联盟客户煤炭质量检验数据进行系统分析和挖掘,获得双方质量检验行为统计规律,进行交易双方信誉度等级划分,将不确定性的质量指标转化为确定性的交易者质量检验行为评价。该研究一方面可为煤炭企业在发生交易者质量纠纷情况下合理划分质量检验责任提供参考,监督和指导矿井和客户的质检管理工作;另一方面可以为煤炭企业提供销售决策辅助支持。     

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.