Performance comparison of reduced models for leak detection in water distribution networks

This paper presents a methodology for comparing the performance of model-reduction strategies to be used with a diagnostic methodology for leak detection in water distribution networks. The goal is to find reduction strategies that are suitable for error-domain model falsification, a model based data interpretation methodology. Twelve reduction strategies are derived from five strategy categories. Categories differ according to the manner in which nodes are selected for deletion. A node is selected for deletion according to: (1) the diameter of the pipes; (2) the number of pipes linked to a node; (3) the angle of the pipes in the case of two-pipe nodes; (4) the distribution of the water demand; and, (5) a pair-wise combination of some categories.The methodology is illustrated using part of a real network. Performance is evaluated first by judging the equivalency of the reduced network with the initial network (before the application of any reduction procedure) and secondly, by assessing the compatibility with the diagnostic methodology. The results show that for each reduction strategy the equivalency of networks is verified. Computational time can be reduced to less than 20% of the non-reduced network in the best case. Results of diagnostic performance show that the performance decreases when using reduced networks. The reduction strategy with the best diagnostic performance is that based on the angle of two-pipe nodes, with an angle threshold of 165°. In addition, the sensitivity of the performance of the reduced networks to variation in leak intensity is evaluated. Results show that the reduction strategies where the number of nodes is significantly reduced are the most sensitive.Finally this paper describes a Pareto analysis that is used to select the reduction strategy that is a good compromise between reduction of computational time and performance of the diagnosis. In this context, the extension strategy is the most attractive.     

Locally linear discriminant embedding: An efficient method for face recognition

In this paper an efficient feature extraction method named as locally linear discriminant embedding (LLDE) is proposed for face recognition. It is well known that a point can be linearly reconstructed by its neighbors and the reconstruction weights are under the sum-to-one constraint in the classical locally linear embedding (LLE). So the constrained weights obey an important symmetry: for any particular data point, they are invariant to rotations, rescalings and translations. The latter two are introduced to the proposed method to strengthen the classification ability of the original LLE. The data with different class labels are translated by the corresponding vectors and those belonging to the same class are translated by the same vector. In order to cluster the data with the same label closer, they are also rescaled to some extent. So after translation and rescaling, the discriminability of the data will be improved significantly. The proposed method is compared with some related feature extraction methods such as maximum margin criterion (MMC), as well as other supervised manifold learning-based approaches, for example ensemble unified LLE and linear discriminant analysis (En-ULLELDA), locally linear discriminant analysis (LLDA). Experimental results on Yale and CMU PIE face databases convince us that the proposed method provides a better representation of the class information and obtains much higher recognition accuracies.     

Test frame updating in CPM testing of Prolog programs

Category Partition Method (CPM) is a general approach to specification-based program testing, where test frame reduction and refinement are two important issues. Test frame reduction is necessary since too many test frames may be produced, and test frame refinement is important since during CPM testing new information about test frame generation may be achieved and considered incrementally. Besides the information provided by testers or users, implementation related knowledge offers alternative information for reducing and refining CPM test frames. This paper explores the idea by proposing a call patterns semantics based test frame updating method for Prolog programs, in which a call patterns analysis is used to collect information about the way in which procedures are used in a program. The updated test frames will be represented as constraints. The effect of our test frame updating is two-fold. On one hand, it removes “uncared” data from the original set of test frames; on the other hand, it refines the test frames to which we should pay more attention. The first effect makes the input domain on which a procedure must be tested a subset of the procedure’s input domain, and the latter makes testers stand more chance to find out the faults that are more likely to show their presence in the use of the program under consideration. Our test frame updating method preserves the effectiveness of CPM testing with respect to the detection of faults we care. The test case generation from the updated set of test frames is also discussed. In order to show the applicability of our method an approximation call patterns semantics is proposed, and the test frame updating on the semantics is illustrated by an example.

遗传算法与文本特征选择方法相结合的研究

对文本特征选择的传统方法进行了深入分析并对各自的优缺点进行了详细的对比;其次,通过利用遗传算法自身的寻优特点,把它与传统特征选择方法相结合,并得出了算法。最后,在对各自算法进行了分析,表明了在性能上有了明显的提高。     

Multi-Objective Modified Particle Swarm Optimization for Test Suite Reduction (MOMPSO)

Software testing plays a pivotal role in entire software development lifecycle. It provides researchers with extensive opportunities to develop novel methods for the optimized and cost-effective test suite Although implementation of such a cost-effective test suite with regression testing is being under exploration still it contains lot of challenges and flaws while incorporating with any of the new regression testing algorithm due to irrelevant test cases in the test suite which are not required. These kinds of irrelevant test cases might create certain challenges such as code-coverage in the test suite, fault-tolerance, defects due to uncovered-statements and overall-performance at the time of execution. With this objective, the proposed a new Modified Particle Swarm optimization used for multi-objective test suite optimization. The experiment results involving six subject programs show that MOMPSO method can outer perform with respect to both reduction rate (90.78% to 100%) and failure detection rate (44.56% to 55.01%). Results proved MOMPSO outperformed the other stated algorithms.     

基于LMD的PWM整流电路故障特征提取新方法

脉冲宽度调制(PWM)整流电路结构日益复杂,对其可靠运行提出了更高的要求;对局域均值分解(LMD)用于PWM整流电路的故障特征提取进行研究,提出一种基于LMD和加权频带能量法的特征提取新方法;该方法通过逐步抽取调频调幅成分将故障信号在频域上展开,然后基于信号能量的频带分布特点,充分考虑各频带成分与故障的相关性,构造故障特征向量,实现特征提取;最后以PWM整流电路为例进行仿真,相电压380V,仿真时间0.5s,0.1s时注入故障;结果表明,该方法能有效地提取故障信号的特征,并降低特征向量的维数。     

Monte Carlo and variance reduction methods for structural reliability analysis: A comprehensive review

Monte Carlo methods have attracted constant and even increasing attention in structural reliability analysis with a wide variety of developments seamlessly presented over decades. Along the way, a number of specialized reviews and benchmark studies have been provided from time to time, aiming at summarizing and comparing selected few approaches in detail, mainly from an implementation point of view. In contrast, the aim of the present survey is to play a comprehensive role as a methodological guidebook on Monte Carlo simulation and its related, especially variance reduction, techniques through a covering of 444 references in the relevant literature. To achieve this goal, we present an extensive review of formulations and techniques along with insightful summaries of developments of existing numerical methods, ranging from the general formulation, sub-categories and variants, to their combined uses with other simulation techniques and surrogate models, as well as the key advantages and assumptions.     

A review on mechanisms and recent developments of nanomaterials based carbon fiber reinforced composites for enhanced interface performance

Carbon fiber reinforced composites have attracted lots of attention in many fields. However, on account of the poor infiltration of resin to carbon fiber, the weak interface performance between fiber and resin has been restricting the interface properties of composites. In recent progress, the review attaches more importance to the introduction of the third phase monomer, which mainly uses physical and chemical methods to assemble nanomaterials (such as carbon nanotubes, graphene, etc.) on the carbon fiber surface to modify the interface structure of the carbon fiber reinforced composites, and all of them have been demonstrated in this paper. Furthermore, the effects of introducing nanomaterials on the structure of the fiber/resin interface and the relationship between multi-scale interface structure and properties have been investigated. It can be seen that the design idea of researchers mainly uses one or more theories to improve the interface properties of carbon fiber reinforced composites, such as transition layer, chemical bonding, mechanical interlocking, infiltration, diffusion, and adsorption. In brief, this work provides some novel insights for the preparation of carbon fiber reinforced composites with excellent interlaminar shear strength.     

电镀塑料制品对结构设计及成形工艺的要求

为保证电镀塑料制品的质量,提出了符合电镀要求的塑料制品设计原则,并且指出在注塑成形时,对塑料经过充分干燥,采用较高的注塑温度,较低的注射压力和较慢的注射速度,是使镀层获得良好结合强度的先决条件。