我国水利水电混凝土防渗墙的发展

４０年来，我国水利水电混凝土防渗技术，从无到有逐渐发展至今，已能够在各种特殊地层中修建各种用途的混凝土防渗墙。通过大量实践，积累了丰富经验。在科学研究、勘测设计和施工技术及现代化管理方面也获得很大进展，解决了在复杂地质条件下建坝所遇到的规模较大的常规地基处理技术，也掌握了特殊地基处理的某些关键技术。     

Interactive key frame selection model

Video summarization can provide a fine representation of the content of video stream and reduce a large amount of data involved in video indexing, browsing, and retrieval. Moreover, Key frame selection is an important step in the research of content-based video analysis and retrieval. Although there exist a variety of methods for key frame selection, they are heuristic and closed systems, which cannot dynamically generate video summary with user’s preference. In this paper, an M-estimator and epipolar line distance constraint camera motion estimation algorithm is introduced as camera parameters is an important motion feature for key frame selection, and Broyden-Fletcher-Goldfarb-Shanno (BFGS) method is applied to optimize estimated parameters. Moreover, since Interactive Computing is a novel-computing model that represents the transition of algorithm to interaction, an interactive model of key frame selection (IKFS) is presented as a result of improving the model of key frame selection (KFS). The model of KFS and IKFS are proved to satisfy the criterion of induction and coinduction, respectively. Experimental results show that the processing scheme generates flexible and desirable summarizations whose distortion rate is lower than current method. Above all, IKFS is an extension to KFS.     

局域网通讯安全的实现

尽管当前有许多维护网络安全的策略，但是局域网内部通讯安全却往往被忽略，文章首先分析当前一些安全策略在维护局域网内部通讯安全的不足，然后提出一种具有加密功能的以太网网卡，用以解决局域网内部通讯的安全问题。     

试析当前汉语流行语中的英语借词现象

考察当前汉语流行语中英语借词现象的成因,并分析其不同的吸收方式及各自的理据和语用价值,最后对这一现象今后的发展做出顺应时代且符合语言发展规律的预测.     

Effect of partitioning on microstructure and properties of a medium carbon Ti Mo bearing high strength Q&P steel

In order to investigate the effect of partitioning procedures on microstructure and properties of a medium carbon Ti Mo bearing steel, the salt bath experiment, field emission SEM, TEM and tensile tests as well as wear tests were utilized to clarify the microstructural evolution and property changes treated by different partitioning parameters. The results show that the microstructures consist of tempered lath martensite, cementite and (Ti, Mo)C particles. With prolonging partitioning time or increasing partitioning temperature, the amount of laths martensite decreases and thicker martensite plates with blunt boundaries appear. In addition, with increasing partitioning temperature from 310℃ to 400℃, the tensile strength, hardness and low temperature toughness are simultaneously decreased, and the reduction reaches up to about 300MPa, 100HV and 20J, respectively. Finally, the wear performance of the samples partitioned below Ms is obviously better than that of samples partitioned above Ms. The morphology of worn surface of samples partitioned below Ms is characterized by plastic fatigue morphology, while the worn surfaces of samples partitioned above Ms are mainly dominated by grooves.     

Key processing with control vectors

A method is presented for controlling cryptographic key usage based on control vectors. Each cryptographic key has an associated control vector that defines the permitted uses of the key within the cryptographic system. At key generation, the control vector is cryptographically coupled to the key by way of a special encryption process. Each encrypted key and control vector are stored and distributed within the cryptographic system as a single token. Decryption of a key requires respecification of the control vector. As part of the decryption process, the cryptographic hardware verifies that the requested use of the key is authorized by the control vector. This article focuses mainly on the use of control vectors in cryptosystems based on the Data Encryption Algorithm.     

Protecting against key-exposure: strongly key-insulated encryption with optimal threshold

Key-insulated encryption schemes use a combination of key splitting and key evolution to protect against key exposure. Existing schemes, however scale poorly, having cost proportional to the number t of time periods that may be compromised by the adversary, and thus are practical only for small values of t. Yet in practice t might be large. This paper presents a strongly key-insulated encryption scheme with optimal threshold. In our scheme, t need not be known in advance and can be as large as one less than the total number of periods, yet the cost of the scheme is not impacted. This brings key-insulated encryption closer to practice. Our scheme is based on the Boneh-Franklin identity-based encryption (IBE) scheme [9], and exploits algebraic properties of the latter. Another contribution of this paper is to show that (not strongly) key-insulated encryption with optimal threshold and allowing random-access key updates (which our scheme and all others known allow) is equivalent to a restricted form of IBE. This means that the connection between key-insulated encryption and IBE is not accidental. Supported in part by NSF grants CCR-0098123, ANR-0129617 and CCR-0208842, and by an IBM Faculty Partnership Development Award. Supported in part by an NSF graduate fellowship.     

Preview benefit and parafoveal-on-foveal effects from word n + 2.

Using the gaze-contingent boundary paradigm with the boundary placed after word n, the experiment manipulated preview of word n + 2 for fixations on word n. There was no preview benefit for 1st-pass reading on word n + 2, replicating the results of K. Rayner, B. J. Juhasz, and S. J. Brown (2007), but there was a preview benefit on the 3-letter word n + 1, that is, after the boundary but before word n + 2. Additionally, both word n + 1 and word n + 2 exhibited parafoveal-on-foveal effects on word n. Thus, during a fixation on word n and given a short word n + 1, some information is extracted from word n + 2, supporting the hypothesis of distributed processing in the perceptual span. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

一种密钥管理的新方案

本文提出了一种新的4级密钥管理方案.该方案通过一个密码操作核心的精心设计,为各用户使用系统的各种功能提供了方便的手段,同时确保了系统的安全性.此外,该方案还大大降低了系统开发费用和保密通信的复杂度.因此,该方案克服了以往方案中的缺陷,已被正在开发的系统SUTU采用.     

Covering a string

We consider the problem of finding the repetitive structures of a given stringx. The periodu of the stringx grasps the repetitiveness ofx, sincex is a prefix of a string constructed by concatenations ofu. We generalize the concept of repetitiveness as follows: A stringw covers a stringx if there is a superstring ofx which is constructed by concatenations and superpositions ofw. A substringw ofx is called aseed ofx ifw coversx. We present anO(n logn)-time algorithm for finding all the seeds of a given string of lengthn.Partially supported by SERC Grants GR/F 00898 and GR/J 17844, NATO Grant CRG 900293, ESPRIT BRA Grant 7131 for ALCOMII, and MRC Grant G 9115730.Partially supported by MRC Grant G 9115730 and S.N.U. Posco Research Fund 94-15-1112.