模糊串匹配算法及其应用

本文分析了模糊字符串几种类型和它的表示方法，并给出模糊匹配的算法及Ｃ语言的源程序，同时也指出了在文枉编辑器的应用例子。     

B2O3/TiO2-ZrO2催化剂上环己酮肟的气相Beckmann重排反应

用共沉淀法制备了TiO2-ZrO2复合氧化物载体，BET，DTA，XRD表征结果表明，该复合载体具有较大的比表面和较好的热稳定性，对于环己酮肟气相Beckmann重排反应制己内酰胺，用复合载体制备的B2O3／TiO2-ZrO2催化剂，比分别以TiO2,ZrO2为载体所制备的B2O3/TiO2和B2O3／ZrO2催化剂具有更高的活性和选择性，实验表明，催化剂表面中等强度的酸位是环己酮肟气相Beckmann重排反应的有效活性中心。     

Dynamic Survivability in WDM Mesh Networks Under Dynamic Traffic

Network survivability is a crucial requirement in WDM mesh networks. In this paper, we systematically consider the problem of dynamic survivability with dynamic single link failure in WDM networks under dynamic traffic demands. Specifically, we investigate various protection schemes, such as dedicated path protection (DPP), shared path protection (SPP), dedicated link protection (DLP), shared link protection (SLP), and two restoration schemes, path restoration (PR) and link restoration (LR). Moreover, two new shared protection methods are proposed, i.e., SRLG-based shared link protection (SRLG-SLP) and SRLG-based shared path protection (SRLG-SPP). The SRLG (shared risk link group) constraint defines the availability of protection resources to a working path, which requires that any two working paths sharing the same risk of failure (or in the same SRLG) cannot share the same protection resources. Furthermore, in our study, we consider a more practical dynamic single-link failure model, in which the link-failure-interarrival time and link-failure-holding time are considered as two independent parameters. Based on this link-failure model, extensive simulations are done to analyze and compare the dynamic survivable performance of various protection and restoration schemes. Resource utilization, protection efficiency, restoration efficiency, and service disruption ratio are employed as survivable performance metrics versus traffic load, link-failure frequency, and link-failure reparation time to evaluate the survivable performance. Many meaningful results are given. In addition, we show that the developed SRLG-SLP and SRLG-SPP protection schemes perform very well in terms of protection efficiency and service disruption ratio, while sacrificing some performance in terms of resource utilization.     

Using rainbow net simulation to measure fault tolerance in a multiprocessor

The Rainbow net simulation technique is applied to modelling the impact of system load and fault handling on the availability of a fault-tolerant multiprocessor architecture. Rainbow nets are described along with the motivation for creating this modelling technique. A Rainbow net fault-handling model is created for the fault-tolerant multiprocessor architecture and the topology is shown to remain constant in size, independent of the number of processor, memory and I/O elements configured in the system. Simulation is performed with a varying load in terms of the number of active jobs the system must support. Results are given showing how the fault-tolerant capability varies with load. Two new metrics for evaluating fault tolerance are introduced; namely full fault-tolerability and partial fault-tolerability. They are based on simple observations in the model.     

Synthesis of p‐aminophenol from the hydrogenation of nitrobenzene over metal–solid acid bifunctional catalyst

BACKGROUND: A single‐step conversion of nitrobenzene (NB) to p‐aminophenol (PAP) through catalytic hydrogenation is a widely used synthesis route for PAP. The main shortcoming of this route is the use of sulfuric acid for rearrangement of the phenylhydroxylamine (PHA) intermediate. In this paper, S₂O₈^2?/ZrO₂ (PSZ) solid acid and Pt‐S₂O₈^2?/ZrO₂ (Pt‐PSZ) bifunctional catalysts were prepared for the synthesis of PAP in non‐acid medium. RESULTS: Calcination temperature has a substantial effect on the acidity, structure and activity for PHA rearrangement of PSZ. The highest PAP yield was 33.8% over PSZ calcined at 823 K when the reaction was carried out in water at 423 K. A high PAP yield of 23.9% was achieved by a single‐step reaction of nitrobenzene over Pt‐PSZ bifunctional catalysts. CONCLUSION: PSZ solid acid exhibits high activity for PHA rearrangement. Perfect tetragonal ZrO₂ and much stronger acid sites play important roles in catalytic activity. Inhibiting the hydrogenation activity by reducing the amount of Pt loading on Pt‐PSZ can improve the competition of PHA rearrangement on acid sites with hydrogenation of PHA on metal active sites, resulting in better selectivity to PAP. Copyright © 2008 Society of Chemical Industry     

Quality of manual data collection in Java software: an empirical investigation

Data collection, both automatic and manual, lies at the heart of all empirical studies. The quality of data collected from software informs decisions on maintenance, testing and wider issues such as the need for system re-engineering. While of the two types stated, automatic data collection is preferable, there are numerous occasions when manual data collection is unavoidable. Yet, very little evidence exists to assess the error-proneness of the latter. Herein, we investigate the extent to which manual data collection for Java software compared with its automatic counterpart for the same data. We investigate three hypotheses relating to the difference between automated and manual data collection. Five Java systems were used to support our investigation. Results showed that, as expected, manual data collection was error-prone, but nowhere near the extent we had initially envisaged. Key indicators of mistakes in manual data collection were found to be poor developer coding style, poor adherence to sound OO coding principles, and the existence of relatively large classes in some systems. Some interesting results were found relating to the collection of public class features and the types of error made during manual data collection. The study thus offers an insight into some of the typical problems associated with collecting data manually; more significantly, it highlights the problems that poorly written systems have on the quality of visually extracted data.     

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.     

基于状态维修过程中的故障预测问题分析

故障预测作为基于状态维修实现的关键,可以有效支持维修管理者的决策。参照国际标准化组织对故障预测的定义,划分故障预测过程,提出预测方法性能评估至少存在的两种方式,在分类和比较现有预测方法的基础上,明确预测方法的适用范围和限制条件,为工程预测系统的构建提供参考。     

字符串近似匹配查询技术综述

字符串匹配是计算机科学中最经典、研究最广泛的问题之一,并且已经被应用到了众多领域当中。然而随着计算机和网络技术的飞速发展以及新问题的不断提出,人们逐渐发现在实际应用中有时更需要进行近似字符串匹配。因此,研究高效的近似字符串匹配算法具有重要的理论价值和实际意义。     

带特征指标约束描述的设计模式分类挖掘

为解决设计模式挖掘正确率较低的问题, 提出一种带特征指标约束描述的设计模式分类挖掘方法。归纳了47种特征指标, 给出了设计模式约束定义, 对设计模式特征进行了描述, 以Adapter模式、Command模式、Factory Method模式为例, 分结构型、行为型与创建型3类挖掘设计模式, 设计了3个基准系统与4个经典系统的设计模式挖掘试验。试验结果表明, 本研究方法对基准系统的Adapter模式、Command模式、Factory Method模式挖掘正确率为96.13%、91.67%、72.23%, 对经典系统挖掘正确率分别为84.3%、81.26%、73.17%, 与传统方法比较, 本研究方法取得了较好的效果。