3G技术在地震网络系统的安全应用价值探析

从地震的发生频率上来看,我国是一个多发的国家。同时在地震中由于受到各种灾害而引起的损失也是最严重的。所以,对地震的信号进行实时性监测并完成信号数据的快速传输必须要应用先进的技术手段。文章主要介绍的就是目前应用十分广泛的3G技术在地震的网络系统中的安全应用。     

启发式教学的Visual FoxPro课堂实践

《VisualFoxPro程序设计》是医学院校普遍开设的计算机课程,结合医学院校中《VisualFox—Pro程序设计》课程特点,提出在课堂教学过程巧用启发式教学。并结合教学实例说明启发式教学能充分调动学生积极性,使学生真正参与课堂．从而取得好的教学效果。     

编程思维训练通用模型研究与实现

程序设计类课程是培养学生逻辑编程能力的基本课程之一,但目前普遍反映出学生对此类课程的学习兴趣不浓,对程序设计与实现的逻辑思维混乱不清,学习效果较差。如何脱离编程语言本身,运用模拟现实生活的思维训练模型来形象地展示编程的原理与逻辑流程,以提高学生对程序设计的逻辑思维能力和学习效果是本文研究的重点。     

基于Flash Builder4.0＋ MyEclipse8.5的新病案首页系统设计与实现

采用Flash Builder4.0、MyEclipse8.5为开发工具,Oracle 10g为数据库,开发了新病案首页系统,详细阐述了系统的设计流程、功能分析和数据库设计与实现。     

Stability analysis and H∞ control for hybrid complex dynamical networks with coupling delays

This paper formulates and studies a model of complex dynamical networks with switching topology and coupling delays. Based on the hybrid control and Lyapunov function, the stability and robust H_∞ control of such networks with impulsive and switching effects, which have not been studied before, are addressed with some criteria derived. Examples are given to illustrate the effectiveness of the theoretical results. Copyright © 2011 John Wiley & Sons, Ltd.     

Low‐voltage and high‐transmittance blue‐phase liquid‐crystal device with slanted electrodes

Abstract— A low‐voltage (～10 V_rms) and high‐transmittance (～90%) polymer‐stabilized blue‐phase liquid‐crystal (BPLC) device with a slanted‐electrodes structure is proposed. Unlike the vertical‐field‐switching (VFS) mode in which oblique incident light and a vertical field are employed, the proposed device utilizes normal incident light and an oblique field. The slanted electrodes generate a strong and uniform oblique electric field, which contributes in obtaining low voltage and high transmittance. Moreover, no couple films or prism sheets are needed, which helps to enhance the optical efficiency and simplify of the device structure. This device has great potential application for emerging BPLC displays and photonic devices.     

An integrated head pose and eye gaze tracking approach to non-intrusive visual attention measurement for wide FOV simulators

Eye gaze tracking is very useful for quantitatively measuring visual attention in virtual environments. However, most eye trackers have a limited tracking range, e.g., ±35° in the horizontal direction. This paper proposed a method to combine head pose tracking and eye gaze tracking together to achieve a large range of tracking in virtual driving simulation environments. Multiple parallel multilayer perceptrons were used to reconstruct the relationship between head images and head poses. Head images were represented with the coefficients extracted from Principal Component Analysis. Eye gaze tracking provides precise results on the front view, while head pose tracking is more suitable for tracking areas of interest than for tracking points of interest on the side view.     

A fast two-step block type decision algorithm for intra prediction in H.264/AVC high profile

Intra coding in H.264/AVC can significantly improve the compression efficiency but at the cost of high computational complexity. To reduce the complexity, this paper presents an efficient block type decision algorithm for intra prediction. In H.264/AVC high profile, three kinds of block types are supported. This algorithm determines the optimal block type by two steps. The first step is based on the fact that the block type of intra prediction is highly dependent on the smoothness of macroblock. An edge-based feature is introduced to characterize the smoothness, by comparing it with two thresholds impossible block type is firstly filtered out. Then the second step is based on the correlation of block type chosen for different chroma modes. Experimental results show that the proposed fast algorithm can achieve 72.8% time saving on average for encoding the all intra-frame sequence with average 0.75% bit rate increase and 0.05dB PSNR degradation when comparing with the reference software.     

Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses

This paper presents the following results on sets that are complete for NP.

1. If there is a problem in NP that requires $2^{n^{\Omega(1)}}$ time at almost all lengths, then every many-one NP-complete set is complete under length-increasing reductions that are computed by polynomial-size circuits.
2. If there is a problem in co-NP that cannot be solved by polynomial-size nondeterministic circuits, then every many-one NP-complete set is complete under length-increasing reductions that are computed by polynomial-size circuits.
3. If there exist a one-way permutation that is secure against subexponential-size circuits and there is a hard tally language in NP??co-NP, then there is a Turing complete language for NP that is not many-one complete.

Our first two results use worst-case hardness hypotheses whereas earlier work that showed similar results relied on average-case or almost-everywhere hardness assumptions. The use of average-case and worst-case hypotheses in the last result is unique as previous results obtaining the same consequence relied on almost-everywhere hardness results.