一个新的具有指定接收者(t,n)门限签名加密方案

提出了一个具有指定接收考验证的签名加密方案。该方案是数字签名与公钥密码体制的有机集成。与普通数字签名方案相比，除了具有认证性、数据完整性外还具有保密性和接收方的隐私性。然后又利用门限方案首次构造了一个（t,n)门限签名加密方案。该(t,n)门限签名方案具有数据传输安全、顽健性、通信代价更小、执行效率更高等特点。     

视频特技切换台的原理与功能

本文较系统、通俗地介绍了模拟视频特技切换台的矩阵输入、混合/效果放大器(M/E)、下游键、系统控制和同步发生器等电路单元,介绍了特技切换台的切换、混合、扫变、键控的基本原理和功能。     

Some New Results on Key Distribution Patterns and Broadcast Encryption

This paper concerns methods by which a trusted authority can distribute keys and/or broadcast a message over a network, so that each member of a privileged subset of users can compute a specified key or decrypt the broadcast message. Moreover, this is done in such a way that no coalition is able to recover any information on a key or broadcast message they are not supposed to know. The problems are studied using the tools of information theory, so the security provided is unconditional (i.e., not based on any computational assumption).In a recent paper st95a, Stinson described a method of constructing key predistribution schemes by combining Mitchell-Piper key distribution patterns with resilient functions; and also presented a construction method for broadcast encryption schemes that combines Fiat-Naor key predistribution schemes with ideal secret sharing schemes. In this paper, we further pursue these two themes, providing several nice applications of these techniques by using combinatorial structures such as orthogonal arrays, perpendicular arrays, Steiner systems and universal hash families.     

关系模式关键字的一个求解算法

本文给出了关系数据库模式中求解关键字的一个算法。算法很简洁并且对于[1]定义的一大类问题,执行时间是多项式级的。     

Arithmetic operations inGF(2 m )

This article is concerned with various arithmetic operations inGF(2 ^m ). In particular we discuss techniques for computing multiplicative inverses and doing exponentiation. The method used for exponentiation is highly suited to parallel computation. All methods achieve much of their efficiency from exploiting a normal basis representation in the field.     

A NOVEL METHOD FOR CONSTRUCTION OF SIDE CHAIN OF BRASSINOSTEROIDS

Construction of the side chain of brassrnolide and its related compounds by the aldolreaction of lithofuran with 22-steroidal aldehyde obtained from hyodeoxycholic acid isdescribed. A key intermediate, 22R, 23R-γ-hydroxy-α, β-unsaturated lactone (16) wassynthesized.     

Fast folding and comparison of RNA secondary structures

Summary Computer codes for computation and comparison of RNA secondary structures, the Vienna RNA package, are presented, that are based on dynamic programming algorithms and aim at predictions of structures with minimum free energies as well as at computations of the equilibrium partition functions and base pairing probabilities.An efficient heuristic for the inverse folding problem of RNA is introduced. In addition we present compact and efficient programs for the comparison of RNA secondary structures based on tree editing and alignment.All computer codes are written in ANSI C. They include implementations of modified algorithms on parallel computers with distributed memory. Performance analysis carried out on an Intel Hypercube shows that parallel computing becomes gradually more and more efficient the longer the sequences are.

---

Schnelle Faltung und Vergleich von Sekundärstrukturen von RNA

Zusammenfassung Die im Vienna RNA package enthaltenen Computer Programme für die Berechnung und den Vergleich von RNA Sekundärstrukturen werden präsentiert. Ihren Kern bilden Algorithmen zur Vorhersage von Strukturen minimaler Energie sowie zur Berechnung von Zustandssumme und Basenpaarungswahrscheinlichkeiten mittels dynamischer Programmierung.Ein effizienter heuristischer Algorithmus für das inverse Faltungsproblem wird vorgestellt. Darüberhinaus präsentieren wir kompakte und effiziente Programme zum Vergleich von RNA Sekundärstrukturen durch Baum-Editierung und Alignierung.Alle Programme sind in ANSI C geschrieben, darunter auch eine Implementation des Faltungs-algorithmus für Parallelrechner mit verteiltem Speicher. Wie Tests auf einem Intel Hypercube zeigen, wird das Parallelrechnen umso effizienter je länger die Sequenzen sind.

     

市场化改革背景下养老机构服务供给博弈研究

考虑政府补贴、市场化程度、养老机构服务成本、老年人偏好等因素,构建了完全国有化、公私并存的半市场化和完全市场化三种情形下公办和民办养老机构之间的两阶段博弈模型,比较分析了市场化程度对养老机构服务价格制定和服务水平选择的影响,实证讨论了各参数变化对养老机构收益及社会福利的影响。研究表明:完全市场化机制会降低养老机构服务质量,完全国有化机制会陷入社会福利陷阱,探索公私并存的最佳市场化水平才能更好地提高社会福利;适度推进市场化改革,提高养老机构服务水平,降低民办养老机构服务成本,适度提高对民办养老机构的补贴,将有效缓解公办和民办养老机构的不公平竞争;提高老年人支付能力,推进养老机构供给侧结构性改革,将保障机构养老服务的有效供给,促进养老服务业的健康有序发展。     

Chosen plaintext attack on JPEG image encryption with adaptive key and run consistency

A JPEG image encryption with the adaptive key and run consistency of MCUs is proposed. The chosen-plaintext attack (CPA) is given here on this encryption scheme. First, the adaptive key can be reproduced from the encrypted image, so that the plaintext images with the same adaptive key can be constructed. Second, the existence of run consistency of MCUs (RCM) between the original image and the encrypted image facilitates rapid estimation. In addition, the single swap for the runs of MCUs with RCM is designed for more accurate estimation. Detailed cryptanalytic results suggest that this encryption scheme can only be used to realize perceptual encryption but not to provide content protection for digital images. Furthermore, applications of the CPA to break other encryption schemes with RCM are presented.     

一种3D眼镜虚拟试戴系统的实现

针对人脸图像试戴3D眼镜过程中存在的镜腿遮挡人脸问题,文中提出一种基于人脸图像的3D眼镜虚拟试戴技术。利用构建的人脸形状的三维模型,使其在虚拟试戴中对镜腿起到消隐作用,解决镜腿的遮挡问题。文中对输入的人脸图像进行关键点检测,结合Graham扫描法求得人脸形状的凸多边形,利用平移扫描构建人脸形状的三维模型。此外,文中根据定位人脸图像上的关键点以及姿态估计后对三维眼镜模型的变换,将眼镜模型佩戴到人脸图像上。实验结果表明,该方法对于多视角的人脸图像实现了虚拟试戴效果,解决了多种视角下人脸图像试戴过程中镜腿的遮挡问题,虚拟试戴中镜腿遮挡平均准确率为94.5%,遮挡精度较高。