A priori ordering protocols to support consensus-building in multiple stakeholder contexts

In a complex social, political, economic, technological, and/or environmental context, corporate, military, government, and other organizations are often faced with collective decision-making situations. The rationale for group decision exercises is that the judgment of many will usually prove superior to the judgment of one. However, it has been shown that collective decision exercises are often highly dependent on matters of perspective, values and opinion, all of which - being essentially subjective in nature - are beyond the reach of existing formal decision technology. Furthermore, it can be expected that many collective decision exercises - particularly those of strategic import - will not lend themselves to the quantitative analysis instruments that have long dominated the management and decision science repertoire. This does not, however, mean that they must remain entirely and forever outside the bounds of scientific rationality. The ordering protocols which are currently available do not have enough technical mechanics to be relied upon to bring us to any satisfying resolution of a priori disputation. Hence, we propose an a priori ordering reference model that might support consensus-building in a multiple stakeholders context. In order to detect whether the subjective arguments are products of proper reasons or merely instances of raw rhetoric and to suggest how any logical or syntactical flaws might best be repaired, we propose logical ordering facilities and protocols for integrating procedural and instrumental provisions for a group-decision process with two lines of technical innovation: the superimpositional ordering function and the logical ordering support facilities.     

Threshold cryptography based on Asmuth-Bloom secret sharing

In this paper, we investigate how threshold cryptography can be conducted with the Asmuth-Bloom secret sharing scheme and present three novel function sharing schemes for RSA, ElGamal and Paillier cryptosystems. To the best of our knowledge, these are the first provably secure threshold cryptosystems realized using the Asmuth-Bloom secret sharing. Proposed schemes are comparable in performance to earlier proposals in threshold cryptography.     

TPLIB－94 69群截面库的研制

介绍了ＴＰＬＩＢ－９４６９群截面库的研制。此载面库可供ＴＰＦＡＰ和ＣＡＲＭＰ等热中子反应堆物理计算程序使用。     

AKIMA方法在EXAFS谱解析中的应用

解析扩展Ｘ射线吸收精细结构谱（ＴｈｅＥｘｔｅｎｄｅｄＸ－ｒａｙＡｂｓｏｒｐｔｉｏｎＦｉｎｅＳｔｒｕｃｔｕｒｅＥＸＡＦＳ）的一种方法是曲线拟合，在曲线拟合中，能量阈值Ｅ０的确定有着很重要的意义，同时也有相当的难度，本文应用ＡＫＩＭＡ平滑数据点方法达到了对Ｅ０在数学意义上的精确求解，数据分析结果表明，这种方处理结果是令人满意的。     

Analytical Expression of the Threshold Pump Power of Erbium—doped Fiber Laeers Pumped at 980 nm and 1480nm Wavelengths

The rate equations,which is suiable to erbium-doped fiber lasers pumped at 980 nm and 1480 nm wavelengths respectively,are investigated,and analytical ex-pressions of the threshold pump powers under two pump wavelengths are derived.As a result,some important parmeters can be quantitatively specified.     

基于双阈值的滤波算法研究

针对均值滤波和中值滤波的不足,提出一种改进的基于双阈值滤波算法。该算法通过两个阈值和均值的关系来判断当前点应取的值。和传统的滤波算法相比．该算法在滤出噪声的同时,能最大限度保留原始图像信息,滤波效果较好。     

OPEN XML文档数字签名的C#实现

针对电子文档的安全性问题,分析了文档的各种数字签名情况,设计了一种能够完成多种签名方法,且能全面验证签名的文档签名系统。系统采用C#编程,从而提高了电子文档的安全性。     

Group codes on certain algebraic curves with many rational points

We construct a series of algebraic geometric codes using a class of curves which have many rational points. We obtain codes of lengthq ² over _q , whereq = 2q ₀ ² andq ₀ = 2 ⁿ , such that dimension + minimal distance q ² + 1 – q ₀ (q – 1). The codes are ideals in the group algebra _q [S], whereS is a Sylow-2-subgroup of orderq ² of the Suzuki-group of orderq ² (q ² + 1)(q – 1). The curves used for construction have in relation to their genera the maximal number of GF _q -rational points. This maximal number is determined by the explicit formulas of Weil and is effectively smaller than the Hasse—Weil bound.Supported by Deutsche Forschungsgemeinschaft while visiting Essen University     

RSA数字签名技术在信息化工程监理流程E化中的研究

提出的信息化工程监理流程的E化过程就是将监理流程通过现有的IT技术进行重新梳理、再造,达到电子化、网络化。将对在E化过程中数字签名的应用进行研究,以应对E化容易出现的伪造这一网络安全问题。主要讲述hash签名技术中单向散列函数对文件进行摘要处理,然后使用RSA公钥加密算法对摘要进行加密。也会对签名过程和验证过程给予解说。     

Beller-Yacobi协议的研究与模拟实现

本文着重分析了Beller-Yacobi协议及以其中用到的RSA加解密及签名算法,并以RSA加解密算法为例在.NET环境下使用C#语言模拟实现了其详细过程,最终实现了整个Beller-Yacobi密钥传输协议的过程。