注册表键值设置的实际应用

从初步认识、简单使用、异常情况处理三个方面介绍了注册表及其使用方法。     

On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks

This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.

A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system.     

Lattice-based key exchange on small integer solution problem

In this paper, we propose a new hard problem, called bilateral inhomogeneous small integer solution （Bi-ISIS）, which can be seen as an extension of the small integer solution problem on lattices. The main idea is that, instead of choosing a rectangle matrix, we choose a square matrix with small rank to generate Bi-ISIS problem without affecting the hardness of the underlying SIS problem. Based on this new problem, we present two new hardness problems： computational Bi-ISIS and decisional problems. As a direct application of these problems, we construct a new lattice-based key exchange （KE） protocol, which is analogous to the classic Diffie- Hellman KE protocol. We prove the security of this protocol and show that it provides better security in case of worst-case hardness of lattice problems, relatively efficient implementations, and great simplicity.     

读者决策采购（PDA）成功实施的关键性因素分析

读者决策采购作为一种全新的基于读者需求的资源建设模式,目前国内还没有高校图书馆实施。介绍了读者决策采购面临的问题,提出PDA要在我国高校图书馆成功实施,需制定严格的标准、选择合适书商并及时进行跟踪与评价。     

智能投币机在城市公交上使用的改进分析

通过鱼骨图的方法对现有智能公交投币机存在识别率偏低的问题进行了分析,提出在智能投币机中采用闭式五角叶轮或增加硬币预处理部分,对现有的智能公交投币机进行改进,使智能公交投币机的硬币辨识率得到提高.     

如何设定品牌标志的设计标准

品牌设计师通过知觉联想可以将文字语言转化为直接、可见的视觉图形传达给社会大众,这种语言上的转换是设计师发掘人们想象不到或想象不全面的一种表现方式,是艺术创造。同时,在没有限制,具有广泛可能性的创意、设计中,要把企业理念和目标等文字语言浓缩、整合出适合创意、设计的关键语,这一个个关键语就是品牌标志设计的依据和标准。有了这样的设计标准就会提高设计效率和准确性,减少在标志设计过程中的矛盾与摩擦,起到指引方向和检验最终方案的作用。     

WWW上路径模式发掘的研究

本文从互连网发展的趋势入手,对路径模式发掘进行了研究。先简要介绍数据库发掘的概况及网上数据发掘的特点,后结合关联法和组合概率法,并以算法和实例详细对之进行分析。     

论《罗伯特议事规则》在公共事业管理课程实训教学中的应用

文章立足于公共事业管理专业培养目标和实践教学的特点,分析了在公共事业管理专业开展《罗氏议事规则》实务训练的选题背景和必要性,论述了《罗氏规则》实训的设计方案及具体操作流程,总结了实训工作取得的成果,提出了增强实务训练效能的技巧和应注意的相关问题。     

公办高校廉政建设研究

通过对公办高校廉政建设存在问题的分析,提出了在国家整个党风廉政建设和反腐败工作的要求下,要结合高等教育事业发展的实际,从"制度反腐"、"源头防腐"和"动态反腐"的高校廉政建设工作基本思路。