Evidence for the bulk nature of self-assembled monolayer surface of fluorinated alkyl thiol from hyperthermal energy ion-surface collisions

Kinetic energy distributions of fragment ions from hyperthermal energy collisions of ions with a self-assembled monolayer surface of fluorinated alkyl thiol on gold substrate and a LiF surface (vapor deposited on titanium substrate) have been measured as a function of scattering angle and fragment ion mass. These distributions for the thiol surface show two energetically and angularly distinct pathways for the dissociation of ions while those from LiF show only one peak. A plot of the velocities of the fragment ions as a Newton diagram for these two processes clearly demonstrates that one process is due to the collision of ions with a fraction of the molecular chain of the monolayer surface molecule with scattering over a broader angular range while the other process is due to collision of the projectile ions with the monolayer surface acting as a bulk surface with fragment ions scattering close to the surface parallel and resembles the Newton diagram from the LiF surface.     

Application of Wavelet Packet De-noising in Time-Frequency Analysis of the Local Wave Method

The local wave method is a very good time-frequency method for nonstationary vibration signal analysis. But the interfering noise has a big influence on the accuracy of time-frequency analysis. The wavelet packet de-noising method can eliminate the interference of noise and improve the signal-noise-ratio. This paper uses the local wave method to decompose the de-noising signal and perform a time-frequency analysis. We can get better characteristics. Finally, an example of waveletpacket denoising and a local wave time-frequency spectrum application of diesel engine surface vibration signal is put forward.     

南冲高架桥某基桩的检测与处理

详细论述了南冲高架桥 6-2桩的检测过程 ,说明了岩溶地质对桩基质量的影响 ,并对此影响和预防措施进行了论述     

Superfluid Contributions to General Turbulence Theory

We analyse a numerical solution of a mathematical model of thermal superfluid turbulence. We elaborate on key points of the statistical phenomenology and point out their impact on fundamental issues of general turbulence theory.     

基于绿色制造的切削机床-车间系统降噪研究

机床-车间系统是切削制造过程的基本生产单元，是实施绿色制造很关键的一环，从广义的角度看运转噪声和切削噪声都是机床噪声的一部分，基于绿色制造的机床-车间系统降噪关键在于降低机床噪声。本文对切削机床-车间系统的噪声特性进行了分析；总结了机床设计和制造（改造）过程中一些降低机床运转噪声的措施；提出了用调度等方法降低系统的切削噪声；并进行了实例分析。     

基于De Bruijn图的De Novo序列组装软件性能分析

随着新一代测序技术的发展,一些新的全基因组组装算法应运而生,特别是针对第三代高通量测序仪产生的海量短序列的组装软件被不断开发出来,这些组装软件渐渐走向市场。但是,由于这些组装软件的适用性和其性能的差别,选择一款性能优良的组装工具或者开发并行高吞吐的组装工具成为了当前面临的一大难题。本文选取基于 De Bruijn 图算法开发的 4 款 De Novo 组装的软件（Velvet、SOAPdenovo、IDBA、ABySS）对 4 种物种的基因组的模拟数据进行测试,并从软件的算法、组装性能和组装质量 3 个方面分析这 4 个软件的性能,同时根据其算法特点推断影响这些软件性能的关键因素,并给出软件的使用建议以及开发并行序列组装工具来组装超大规模的基因数据应该注意的问题。     

The use of mindmapping software for patent search and management

Modern information technologies and in particular the internet have revolutionized the patent information professionals' work in terms of speed of access and information comprehensiveness from both company internal and external digital sources. Here, I describe how the digital mindmapping technique can be used to complement existing intellectual property management software solutions to meet the challenge of optimizing and managing patent search workflows as well as to rapidly organise and access highly dynamic, heterogeneous and scattered patent information sources. Both eye catching and highly memorable and at the same time self-explanatory mindmapping examples are presented. These were designed to include basic and advanced level digital mindmapping features tailored to significantly speed up and maintain a high work quality level of patent search professionals. A special emphasis is put on the great benefit of organising and accessing the plethora of internet-based worldwide online patent registers through mindmapping, both in terms of managing the constantly changing deep links to the actual search options for e.g., legal status information, and keeping track of the offered level of content.     

On the complexity of deciding avoidability of sets of partial words

Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k≥2, is NP-hard [F. Blanchet-Sadri, R. Jungers, J. Palumbo, Testing avoidability on sets of partial words is hard, Theoret. Comput. Sci. 410 (2009) 968-972]. Building on their work, we analyze in this paper the complexity of natural variations on the problem. While some of them are NP-hard, others are shown to be efficiently decidable. Using some combinatorial properties of de Bruijn graphs, we establish a correspondence between lengths of cycles in such graphs and periods of avoiding words, resulting in a tight bound for periods of avoiding words. We also prove that Avoidability can be solved in polynomial space, and reduces in polynomial time to the problem of deciding the avoidability of a finite set of partial words of equal length over the binary alphabet. We give a polynomial bound on the period of an infinite avoiding word, in the case of sets of full words, in terms of two parameters: the length and the number of words in the set. We give a polynomial space algorithm to decide if a finite set of partial words is avoided by a non-ultimately periodic infinite word. The same algorithm also decides if the number of words of length n avoiding a given finite set of partial words grows polynomially or exponentially with n.