A New Image Analysis Based Method for Measuring Electrospun Nanofiber Diameter

In this paper, a new image analysis based method for electrospun nanofiber diameter measurement has been presented. The method was tested by a simulated image with known characteristics and a real web. Mean (M) and standard deviation (STD) of fiber diameter obtained using this method for the simulated image were 15.02 and 4.80 pixels respectively, compared to the true values of 15.35 and 4.47 pixels. For the real web, applying the method resulted in M and STD of 324 and 50.4 nm which are extremely close to the values of 319 and 42 nm obtained using manual method. The results show that this approach is successful in making fast, accurate automated measurements of electrospun fiber diameters.     

Extending the Kernighan/Lin Heuristic for Hardware and Software Functional Partitioning

The Kernighan/Lin graph partitioning heuristic, also known as min-cut or group migration, has been extended over several decades very successfully for circuit partitioning. Those extensions customized the heuristic and its associated data structure to rapidly compute the minimum-cut metric central to circuit partitioning; as such, those extensions are not directly applicable to other problems. In this paper, we extend the heuristic for functional partitioning, which in turn can solve the much investigated codesign problem of partitioning a system's coarse-grained functions among hardware and software components. The key extension customizes the heuristic and data structure to rapidly compute execution-time and communication metrics, crucial to hardware and software partitioning, and leads to near-linear time-complexity and excellent resulting quality. Another extension uses a new criteria for terminating the heuristic, eliminating time-consuming and unnecessary fine-tuning of a partition. Our experiments demonstrate extremely fast execution times (just a few seconds) with results matched only by the slower simulated annealing heuristic, meaning that the extended Kernighan/Lin heuristic will likely prove hard to beat for hardware and software functional partitioning.     

A complete VARMA modelling methodology based on scalar components

Abstract. This article proposes an extension to scalar component methodology for the identification and estimation of VARMA models. The complete methodology determines the exact positions of all free parameters in any VARMA model with a predetermined embedded scalar component structure. This leads to an exactly identified system of equations that is estimated using full information maximum likelihood.     

Classification and trend analysis of UML books (1997–2009)

Technical books of each subject area denote the level of maturity and knowledge demand in that area. According to the Google Books database, about 208 Unified Modeling Language (UML) books have been published from its inception in 1997 until 2009. While various book reviews are frequently published in various sources (e.g., IEEE Software Bookshelf), there are no studies to classify UML books into meaningful categories. Such a classification can help researchers in the area to identify trends and also reveal the level of activity in each sub-area of UML. The statistical survey reported in this article intends to be a first step in classification and trend analysis of the UML books published from 1997 to 2009. The study also sheds light on the quantity of books published in different focus areas (e.g., UML’s core concepts, patterns, tool support, Object Constraint Language and Model-Driven Architecture) and also on different application domains (e.g., database modeling, web applications, and real-time systems). The trends of book publications in each sub-area of UML are also used to track the level of maturity, to identify possible Hype cycles and also to measure knowledge demand in each area.     

An H∞non‐fragile observer‐based adaptive sliding mode controller design for uncertain fractional‐order nonlinear systems with time delay and input nonlinearity

In this paper the problem of non‐fragile adaptive sliding mode observer design is addressed for a class of nonlinear fractional‐order time‐delay systems with uncertainties, external disturbance, exogenous noise, and input nonlinearity. An H_∞ observer‐based adaptive sliding mode control considering the non‐fragility of the observer is proposed for this system. The sufficient asymptotic stability conditions are derived in the form of linear matrix inequalities. It is proven that the sliding surface is reachable in finite time. An illustrative example is provided which corroborates the effectiveness of the theoretical results.     

Conceptual aspects of geometric quantum computation

Geometric quantum computation is the idea that geometric phases can be used to implement quantum gates, i.e., the basic elements of the Boolean network that forms a quantum computer. Although originally thought to be limited to adiabatic evolution, controlled by slowly changing parameters, this form of quantum computation can as well be realized at high speed by using nonadiabatic schemes. Recent advances in quantum gate technology have allowed for experimental demonstrations of different types of geometric gates in adiabatic and nonadiabatic evolution. Here, we address some conceptual issues that arise in the realizations of geometric gates. We examine the appearance of dynamical phases in quantum evolution and point out that not all dynamical phases need to be compensated for in geometric quantum computation. We delineate the relation between Abelian and non-Abelian geometric gates and find an explicit physical example where the two types of gates coincide. We identify differences and similarities between adiabatic and nonadiabatic realizations of quantum computation based on non-Abelian geometric phases.     

ConsilientSFL: using preferential voting system to generate combinatorial ranking metrics for spectrum-based fault localization

Spectrum-based fault localization (SFL) techniques have shown considerable effectiveness in localizing software faults. They leverage a ranking metric to automatically assign suspiciousness scores to certain entities in a given faulty program. However, for some programs, the current SFL ranking metrics lose effectiveness. In this paper, we introduce ConsilientSFL that is served to synthesize a new ranking metric for a given program, based on a customized combination of a set of given ranking metrics. ConsilientSFL can be significant since it demonstrates the usage of voting systems into a software engineering task. First, several mutated, faulty versions are generated for a program. Then, the mutated versions are executed with the test data. Next, the effectiveness of each existing ranking metric is computed for each mutated version. After that, for each mutated version, the computed existing metrics are ranked using a preferential voting system. Consequently, several top metrics are chosen based on their ranks across all mutated versions. Finally, the chosen ranking metrics are normalized and synthesized, yielding a new ranking metric. To evaluate ConsilientSFL, we have conducted experiments on 27 subject programs from Code4Bench and Siemens benchmarks. In the experiments, we found that ConsilientSFL outperformed every single ranking metric. In particular, for all programs on average, we have found performance measures recall, precision, f-measure, and percentage of code inspection, to be nearly 7, 9, 12, and 5 percentages larger than using single metrics, respectively. The impact of this work is twofold. First, it can mitigate the issue with the choice and usage of a proper ranking metric for the faulty program at hand. Second, it can help debuggers find more faults with less time and effort, yielding higher quality software.

     

Effect of High‐Energy Ball Milling on Mechanical Properties of the Mg–Nb Composites Fabricated through Powder Metallurgy Process

New biocompatible and biodegradable Mg–Nb composites used as bone implant materials are fabricated through powder metallurgy process. Mg–Nb mixture powders are prepared through mechanical milling and manual mixing. Then, the Mg–Nb composites are fabricated through cold press and sintering processes. The effect of mechanical milling and Nb particles as reinforcements on the microstructures and mechanical properties of Mg–Nb composites are investigated. The mechanical milling process is found to be effective in reducing the size of Mg and Nb particles, distributing the Nb particles uniformly in the Mg matrix and obtaining Mg–Nb composite particles. The Mg–Nb composite particles can be bound together firmly during the sintering process, result in Mg–Nb composite structures with no intermetallic formation, lower porosity, and higher mechanical properties compared to composites prepared through manual mixing. Interestingly, the mechanical properties of manually mixed Mg–Nb composites appear to be even lower than that of pure Mg.

     

Model updating of multistory shear buildings for simultaneous identification of mass,stiffness and damping matrices using two different soft-computing methods

In this research, two novel methods for simultaneous identification of mass–damping–stiffness of shear buildings are proposed. The first method presents a procedure to estimate the natural frequencies, modal damping ratios, and modal shapes of shear buildings from their forced vibration responses. To estimate the coefficient matrices of a state-space model, an auto-regressive exogenous excitation (ARX) model cooperating with a neural network concept is employed. The modal parameters of the structure are then evaluated from the eigenparameters of the coefficient matrix of the model. Finally, modal parameters are used to identify the physical/structural (i.e., mass, damping, and stiffness) matrices of the structure. In the second method, a direct strategy of physical/structural identification is developed from the dynamic responses of the structure without any eigenvalue analysis or optimization processes that are usually necessary in inverse problems. This method modifies the governing equations of motion based on relative responses of consecutive stories such that the new set of equations can be implemented in a cluster of artificial neural networks. The number of neural networks is equal to the number of degree-of-freedom of the structure. It is shown the noise effects may partially be eliminated by using high-order finite impulse response (FIR) filters in both methods. Finally, the feasibility and accuracy of the presented model updating methods are examined through numerical studies on multistory shear buildings using the simulated records with various noise levels. The excellent agreement of the obtained results with those of the finite element models shows the feasibility of the proposed methods.     

Network Formation: Bilateral Contracting and Myopic Dynamics

We consider a network formation game where nodes wish to send traffic to each other. Nodes contract bilaterally with each other to form bidirectional communication links; once the network is formed, traffic is routed along shortest paths (if possible). Cost is incurred to a node from four sources: 1) routing traffic; 2) maintaining links to other nodes; 3) disconnection from destinations the node wishes to reach; and 4) payments made to other nodes. We assume that a network is stable if no single node wishes to unilaterally deviate, and no pair of nodes can profitably deviate together (a variation on the notion of pairwise stability). We study such a game under a form of myopic best response dynamics. In choosing their action, nodes optimize their single period payoff only. We characterize a simple set of assumptions under which these dynamics converge to a stable network; we also characterize an important special case, where the dynamics converge to a star centered at a node with minimum cost for routing traffic. In this sense, our dynamics naturally select an efficient equilibrium.