多晶硅锭中硬质点分析及控制研究

以多晶硅锭中硬质点为研究对象,通过实验研究和数值模拟的方法,对多晶硅锭中硬质点进行形貌和成分分析,并提出改善控制方法。研究结果表明硅锭中部的硬质点较细小,主要由SiC组成;硅锭头部的硬质点较粗大,主要由SiC和Si3N4组成,还有少量O的存在。进一步研究发现多晶硅定向凝固铸锭炉的热场结构对于多晶硅锭硬质点形成有直接影响,通过改进热场结构,优化晶体生长界面,显著减少了铸锭中硬质点的数量。     

Household endotoxin reduction in the Louisa Environmental Intervention Project for rural childhood asthma

Endotoxin exacerbates asthma. We designed the Louisa Environmental Intervention Project (LEIP) and assessed its effectiveness in reducing household endotoxin and improving asthma symptoms in rural Iowa children. Asthmatic school children (N = 104 from 89 homes) of Louisa and Keokuk counties in Iowa (aged 5-14 years) were recruited and block-randomized to receive extensive (education + professional cleaning) or educational interventions. Environmental sampling collection and respiratory survey administration were done at baseline and during three follow-up visits. Mixed-model analyses were used to assess the effect of the intervention on endotoxin levels and asthma symptoms in the main analysis and of endotoxin reduction on asthma symptoms in exploratory analysis. In the extensive intervention group, dust endotoxin load was significantly reduced in post-intervention visits. The extensive compared with the educational intervention was associated with significantly decreased dust endotoxin load in farm homes and less frequent nighttime asthma symptoms. In exploratory analysis, dust endotoxin load reduction from baseline was associated with lower total asthma symptoms score (Odds ratio: 0.52, 95% confidence interval: 0.29-0.92). In conclusion, the LEIP intervention reduced household dust endotoxin and improved asthma symptoms. However, endotoxin reductions were not sustained post-intervention by residents.     

基于哈希链的软件定义网络路径安全

针对软件定义网络中，控制器无法保证下发的网络策略能够在转发设备上得到正确执行的安全问题，提出一种新的转发路径监控安全方案。首先以控制器的全局视图能力为基础，设计了基于OpenFlow协议的路径凭据交互处理机制；然后采用哈希链和消息验证码作为生成和处理转发路径凭据信息的关键技术；最后在此基础上，对Ryu控制器和Open vSwitch开源交换机进行深度优化，添加相应处理流程，建立轻量级的路径安全机制。测试结果表明，该机制能够有效保证数据转发路径安全，吞吐量消耗比SDN数据层可信转发方案（SDNsec）降低20%以上，更适用于路径复杂的网络环境，但时延和CPU使用率的浮动超过15%，有待进一步优化。     

基于词法特征的恶意域名快速检测算法

针对互联网中恶意域名攻击事件频发，现有域名检测方法实时性不强的问题，提出一种基于词法特征的恶意域名快速检测算法。该算法根据恶意域名的特点，首先将所有待测域名按照长度进行正则化处理后赋予权值；然后利用聚类算法将待测域名划分成多个小组，并利用改进的堆排序算法按照组内权值总和计算各域名小组优先级，根据优先级降序依次计算各域名小组中每一域名与黑名单上域名之间的编辑距离；最后依据编辑距离值快速判定恶意域名。算法运行结果表明，基于词法特征的恶意域名快速检测算法与单一使用域名语义和单一使用域名词法的恶意域名检测算法相比，准确率分别提高1.7%与2.5%，检测速率分别提高13.9%与6.8%，具有更高的准确率和实时性。     

An adaptive image steganographic scheme based on Noise Visibility Function and an optimal chaotic based encryption method

Steganography is the science of hiding secret message in an appropriate digital multimedia in such a way that the existence of the embedded message should be invisible to anyone apart from the sender or the intended recipient. This paper presents an irreversible scheme for hiding a secret image in the cover image that is able to improve both the visual quality and the security of the stego-image while still providing a large embedding capacity. This is achieved by a hybrid steganography scheme incorporates Noise Visibility Function (NVF) and an optimal chaotic based encryption scheme. In the embedding process, first to reduce the image distortion and to increase the embedding capacity, the payload of each region of the cover image is determined dynamically according to NVF. NVF analyzes the local image properties to identify the complex areas where more secret bits should be embedded. This ensures to maintain a high visual quality of the stego-image as well as a large embedding capacity. Second, the security of the secret image is brought about by an optimal chaotic based encryption scheme to transform the secret image into an encrypted image. Third, the optimal chaotic based encryption scheme is achieved by using a hybrid optimization of Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) which is allowing us to find an optimal secret key. The optimal secret key is able to encrypt the secret image so as the rate of changes after embedding process be decreased which results in increasing the quality of the stego-image. In the extracting process, the secret image can be extracted from the stego-image losslessly without referring to the original cover image. The experimental results confirm that the proposed scheme not only has the ability to achieve a good trade-off between the payload and the stego-image quality, but also can resist against the statistics and image processing attacks.     

Low complexity quantum private queries protocol

Private information retrieval(PIR) is an important privacy protection issue of secure multi-party computation, but the PIR protocols based on classical cryptography are vulnerable because of new technologies,such as quantum computing and cloud computing. The quantum private queries(QPQ) protocols available, however, has a high complexity and is inefficient in the face of large database. This paper, based on the QKD technology which is mature now, proposes a novel QPQ protocol utilizing the key dilution and auxiliary parameter. Only N quits are required to be sent in the quantum channel to generate the raw key, then the straight k bits in the raw key are added bitwise to dilute the raw key, and a final key is consequently obtained to encrypt the database. By flexible adjusting of auxiliary parameters θ and k, privacy is secured and the query success ratio is improved. Feasibility and performance analyses indicate that the protocol has a high success ratio in first-trial query and is easy to implement, and that the communication complexity of O(N) is achieved.     

Elitist clonal selection algorithm for optimal choice of free knots in B-spline data fitting

Data fitting with B-splines is a challenging problem in reverse engineering for CAD/CAM, virtual reality, data visualization, and many other fields. It is well-known that the fitting improves greatly if knots are considered as free variables. This leads, however, to a very difficult multimodal and multivariate continuous nonlinear optimization problem, the so-called knot adjustment problem. In this context, the present paper introduces an adapted elitist clonal selection algorithm for automatic knot adjustment of B-spline curves. Given a set of noisy data points, our method determines the number and location of knots automatically in order to obtain an extremely accurate fitting of data. In addition, our method minimizes the number of parameters required for this task. Our approach performs very well and in a fully automatic way even for the cases of underlying functions requiring identical multiple knots, such as functions with discontinuities and cusps. To evaluate its performance, it has been applied to three challenging test functions, and results have been compared with those from other alternative methods based on AIS and genetic algorithms. Our experimental results show that our proposal outperforms previous approaches in terms of accuracy and flexibility. Some other issues such as the parameter tuning, the complexity of the algorithm, and the CPU runtime are also discussed.     

Correlation between motion of source bender element and feedback signal induced by self-monitoring

Since the introduction of bender element tests to soil testing, the reliability of the estimated travel time has been the most serious problem. The author has previously shown a potential solution whereby removing the response of the bender element subsystem from the whole response could dramatically improve the accuracy of the travel time estimation. In order to lay the foundation for estimating the response of the bender element subsystem, this paper examines the correlation between the displacements of the element and the induced feedback signals by employing a self-monitoring element. The response of the self-monitoring element is modeled as a transfer function involving two internal transfer functions that relate the input signals to the displacements and the displacements to the feedback signals, respectively. Using a laser displacement sensor, the displacements are directly measured through the entire surface and reveal the three-dimensional bending motion of the element oscillating in both longitudinal and width directions. The feedback signals are similar to, but inconsistent with, the tip displacements, and an attempt is made to correct the feedback signals. Finally, a conclusion is given on the potential for estimating the response of the bender element subsystem using the self-monitoring element.     

A stiffness parameter and truncation error criterion for adaptive path following in structural mechanics

We explore a truncation error criterion to steer adaptive step length refinement and coarsening in incremental-iterative path following procedures, applied to problems in large-deformation structural mechanics. Elaborating on ideas proposed by Bergan and collaborators in the 1970s, we first describe an easily computable scalar stiffness parameter whose sign and rate of change provide reliable information on the local behavior and complexity of the equilibrium path. We then derive a simple scaling law that adaptively adjusts the length of the next step based on the rate of change of the stiffness parameter at previous points on the path. We show that this scaling is equivalent to keeping a local truncation error constant in each step. We demonstrate with numerical examples that our adaptive method follows a path with a significantly reduced number of points compared to an analysis with uniform step length of the same fidelity level. A comparison with Abaqus illustrates that the truncation error criterion effectively concentrates points around the smallest-scale features of the path, which is generally not possible with automatic incrementation solely based on local convergence properties.     

一种快速解压的无损压缩算法

随着信息技术的不断发展,大量数据给存储和传输都带来了巨大的挑战。数据压缩能够有效减少数据量,方便数据的处理和传输。无损压缩是一种利用数据的冗余特点进行压缩的压缩方法,解压时可以完全还原数据而不会有任何失真。在研究LZO算法的快速解压原理基础上,设计了一种新的压缩算法。该算法通过减少压缩数据中压缩块的数量,降低了解压程序的执行开销。测试结果表明,新算法可实现比LZO算法更快的解压速度。