MLSI-RT: memorize LOS range measurements identified residual test location algorithm and performance analysis

The dominant error source of mobile terminal location in wireless sensor networks （WSNs） is the non-line-of-sight （NLOS） propagation error. Among the algorithms proposed to mitigate the influence of NLOS propagation error, residual test （RT） is an efficient one, however with high computational complexity （CC）. An improved algorithm that memorizes the light of sight （LOS） range measurements （RMs） identified memorize LOS range measurements identified residual test （MLSI-RT） is presented in this paper to address this problem. The MLSI-RT is based on the assumption that when all RMs are from LOS propagations, the normalized residual follows the central Chi-Square distribution while for NLOS cases it is non-central. This study can reduce the CC by more than 90%.

Polynomial-time algorithm for the legal firing sequences problem of a type of synchronous composition Petri nets

As far as we know, the testing problem of legal firing sequence is NP-complete for gener-al Petri net, the related results of this problem on the polynomial-time solvability are limited only to some special net classes, such as persistent Petri nets, conflict-free Petri nets and state machine Petri nets. In this paper, the language properties of synchronous composition net are discussed. Based on these results, the testing algorithm polynomial-time complexity for legal firing sequence is proposed. Therefore, net classification of polynomial-time solvability for testing legal firing sequence is extended.

Testing content addressable memories with physical fault models

Content addressable memory （CAM） is widely used and its tests mostly use functional fault models. However, functional fault models cannot describe some physical faults exactly. This paper introduces physical fault models for write-only CAM. Two test algorithms which can cover 100% targeted physical faults are also proposed. The algorithm for a CAM module with N-bit match output signal needs only 2N＋2L＋4 comparison operations and 5N writing operations, where N is the number of words and L is the word length. The algorithm for a HIT-signal-only CAM module uses 2N＋2L＋5 comparison operations and 8N writing operations. Compared to previous work, the proposed algorithms can test more physical faults with a few more operations. An experiment on a test chip shows the effectiveness and efficiency of the proposed physical fault models and algorithms.

A Usable Selection Range Standard Based on Test Suite Reduction Algorithms

In this paper, we analyze the features and distinctions of 6 classical algorithms： greedy algorithm （G）, greedy evolution algorithm （GE）, heuristics algorithm （H）, greedy heuristic G （GRE）, integer linear programming algorithm （ILP） and genetic algorithm （GA） to ensure the main influencing factors-the performance of algorithms and the running time of algorithms. What＇s more, we would not only present a research design that aims at gaining deeper understanding about the algorithm classification and its function as well as their distinction, but also make an empirical study in order to obtain a practical range standard that can guide the selection of reduction algorithms. When the size of a test object （product of test requirements and test cases） is smaller than 2000×2000, G algorithm is the commonly recommended algorithm. With the growth of test size, the usage of GE and GRE becomes more general.

A Complete Critical Path Algorithm for Test Generation of Combinational Circuits

It is known that critical path test generation method is not a complete algorithm for combinational circuits with reconvergent-fanout.In order to make it a complete algorithm,we put forward a reconvergent-fanout- oriented technique,the principal critical path algorithm,propagating the critical value back to primary inputs along a single path,the principal critical path,and allowing multiple path sensitization if needed.Relationship among test patterns is also discussed to accelerate test generation.

Improved 2-D Stability Margin Test for 2-D Discrete Systems

An improved 2 D stability margin test and its algorithm for 2 D discrete systems are proposed.The stability margin test procedure can be slmplified by using the inner term polynomials of B(z 1,z 2) to construct a margin test table.Different from other well known 2 D stability margin test algorithms,the new approach can directly obtain the stability margin.

Estimation of crowd density from UAVs images based on corner detection procedures and clustering analysis

With rapid developments in platforms and sensors technology in terms of digital cameras and video recordings,crowd monitoring has taken a considerable attentions in many disciplines such as psychology,sociology,engineering,and computer vision.This is due to the fact that,monitoring of the crowd is necessary to enhance safety and controllable movements to minimize the risk particularly in highly crowded incidents(e.g.sports).One of the platforms that have been extensively employed in crowd monitoring is unmanned aerial vehicles(UAVs),because UAVs have the capability to acquiring fast,low costs,high-resolution and real-time images over crowd areas.In addition,geo-referenced images can also be provided through integration of on-board positioning sensors(e.g.GPS/IMU)with vision sensors(digital cameras and laser scanner).In this paper,a new testing procedure based on feature from accelerated segment test(FAST)algorithms is introduced to detect the crowd features from UAV images taken from different camera orientations and positions.The proposed test started with converting a circle of 16 pixels surrounding the center pixel into a vector and sorting it in ascending/descending order.A single pixel which takes the ranking number 9(for FAST-9)or 12(for FAST-12)was then compared with the center pixel.Accuracy assessment in terms of completeness and correctness was used to assess the performance of the new testing procedure before and after filtering the crowd features.The results show that the proposed algorithms are able to extract crowd features from different UAV images.Overall,the values of Completeness range from 55 to 70%whereas the range of correctness values was 91 to 94%.

Enhancing fatigue life of cylinder-crown integrated structure by optimizing dimension

Cylinder-crown integrated hydraulic press （CCIHP） is a new press structure. The hemispherical hydraulic cylinder also functions as a main portion of crown, which has lower weight and higher section modulus compared with the conventional hydraulic cylinder and press crown. As a result, the material strength capacity is better utilized. During the engineering design of cylinder-crown integrated structure, in order to increase the fatigue life, structural optimization on the basis of the adaptive macro genetic algorithms （AMGA） is first conducted to both reduce weight and decrease peak stress. It is shown that the magnitude of the maximum principal stress is decreased by 28.6%, and simukaneously the total weight is reduced by 4.4%. Subsequently, strain-controlled fatigue test is carried out, and the stress-strain hysteresis loops and cyclic hardening curve are obtained. Based on linear fit, the fatigue properties are calculated and used for the fatigue life prediction. It is shown that the predicted fatigue life is significantly increased from 157000 to 1070000 cycles after structural optimization. Finally, according to the optimization design, a 6300 kN CCIHP has been manufactured, and priority application has been also suggested.

Generation method of minimal-complete-coverage interoperability test sequence based on digraph

Even if two implementations of a protocol pass the conformance testing,it cannot guarantee that they can interoperate properly;so direct testing of interoperation is considered indispensable.During the interoperability testing,a minimal number of test sequences are expected to check as many as possible implementation errors.By using minimal-complete-coverage criterion,the test sequence generation based on digraph can produce more effective test sequences.