Experimental deformation analysis of an adhesively bonded multi-material joint for marine applications

The strength and deformation of full-scale adhesively bonded multi-material joints is studied in this paper. Four joints with a thick layer of methyl methacrylate adhesive (MMA) have been manufactured in shipyard conditions. In two specimens, cracks have been introduced at steel–adhesive and composite–adhesive interfaces. One cracked and one un-cracked specimen were subjected to quasi-static tensile testing; the two remaining specimens were stepwise loaded/unloaded with increasing load until failure. The strain in the adhesive layers was measured with digital image correlation (DIC). This showed a predominant shear deformation and dissimilar shear strain patterns for different bond lines. Fibre Bragg (FBG) sensors were used to monitor strains at steel and composite constituents and to detect the onset and evolution of damage in the un-cracked specimen. Strains measured by FBG sensors correspond well with DIC results at nearby regions. All specimens failed by delamination of the composite panel near the composite–adhesive interface.     

Parallelization of a dynamic SVD clustering algorithm and its application in information retrieval

We describe an implementation of a parallel document clustering scheme based on latent semantic indexing, which uses singular value decomposition. Given a set of documents, the clustering algorithm is dynamic in the sense that it automatically infers the number of clusters to be output. The parallel version has been implemented on a LAN and on a dual‐core system. Experimental evaluation of the algorithm shows an average speed‐up of 6.22 for the LAN implementation and an average speed‐up of 3.71 for the dual‐core implementation, while still maintaining a precision and recall in the range [0.85, 1]. To put these implementations in the context of information retrieval, we use the parallel clustering algorithm and develop a document similarity search system. The similarity search system shows good performance in terms of precision and recall. Copyright © 2010 John Wiley & Sons, Ltd.     

Diagnosing rediscovered software problems using symptoms

This paper presents an approach to automatically diagnosing rediscovered software failures using symptoms, in environments in which many users run the same procedural software system. The approach is based on the observation that the great majority of field software failures are rediscoveries of previously reported problems and that failures caused by the same defect often share common symptoms. Based on actual data, the paper develops a small software failure fingerprint, which consists of the procedure call trace, problem detection location, and the identification of the executing software. The paper demonstrates that over 60 percent of rediscoveries can be automatically diagnosed based on fingerprints; less than 10 percent of defects are misdiagnosed. The paper also discusses a pilot that implements the approach. Using the approach not only saves service resources by eliminating repeated data collection for and diagnosis of reoccurring problems, but it can also improve service response time for rediscoveries     

Batch RNAi selector: a standalone program to predict specific siRNA candidates in batches with enhanced sensitivity

RNA interference (RNAi) is a popular and effective method for silencing gene expression. siRNAs should be gene-specific and effective to achieve specific and potent gene silencing. However, most currently available siRNA design programs are web-based programs that either require each sequence be submitted individually, making large-batch analyses difficult to conduct, or only provide limited options for searching off-target candidates (e.g. NCBI-BLAST). We have developed a stand-alone, enhanced RNAi design program that overcomes these shortcomings. We have implemented WU-BLAST, FASTA and SSEARCH homology searches for siRNA candidates to improve gene specific siRNA selection and to identity siRNA candidates that could lead to off-target gene silencing. We also included many new features such as siRNA score calculation and calculation of siRNA internal stability to help select highly potent siRNAs. This program is freely available for academic and commercial use (), and can be installed and run on any Linux machine. Our program automates the search for siRNAs and the resulting data files including a list of siRNA primers with scores and database search results for each siRNA candidate are stored locally for easy retrieval and inspection when needed.     

Apportioning: a technique for efficient reachability analysis ofconcurrent object-oriented programs

The object-oriented paradigm in software engineering provides support for the construction of modular and reusable program components and is attractive for the design of large and complex distributed systems. Reachability analysis is an important and well-known tool for static analysis of critical properties in concurrent programs, such as deadlock freedom. It involves the systematic enumeration of all possible global states of program execution and provides the same level of assurance for properties of the synchronization structure in concurrent programs, such as formal verification. However, direct application of traditional reachability analysis to concurrent object-oriented programs has many problems, such as incomplete analysis for reusable classes (not safe) and increased computational complexity (not efficient). We propose a novel technique called apportioning, for safe and efficient reachability analysis of concurrent object-oriented programs, that is based upon a simple but powerful idea of classification of program analysis points as local (having influence within a class) and global (having possible influence outside a class). We have developed a number of apportioning-based algorithms, having different degrees of safety and efficiency. We present the details of one of these algorithms, formally show its safety for an appropriate class of programs, and present experimental results to demonstrate its efficiency for various examples     

Java based replicated server objects and their remote method invocations in a distributed environment

A distributed system is said to be fault‐tolerant if it is able to provide important services despite partial failures of the computers or software objects in the system. These systems are needed to support applications such as remote access and control, virtual mobile offices and wide area collaborative systems where there are chances of failures in the network and software objects. Fault‐tolerance is usually achieved by replicating the objects in the system. Traditional distributed applications constructed using Java RMI (remote method invocation) are not fault‐tolerant because of the lack of support of object replication. The objective of the present work is to design a remote method invocation that supports server object replication. To provide a fault‐tolerant service to the remote client objects, server objects are actively replicated. The problems associated with the method invocation in the context of active server object replication are presented and solutions are discussed and implemented. Copyright © 2001 John Wiley & Sons, Ltd.     

Development of environmentally responsive hydrogels with metal affinity behavior

This work describes initial efforts to incorporate affinity ligands within an environmentally responsive hydrogel. Metal affinity ligands were chosen as model affinity groups and thermally responsive N‐isopropyl acrylamide/acrylamide copolymers were used as the base hydrogels. The ? NH₂ group of the acrylamide serves as a reactive group for functionalization with metal affinity ligands. The gels were synthesized by free radical polymerization and Cu²⁺ was bound to the gel via 1,4‐butanediol diglycidyl ether (BDE) as a linker and iminodiacetic acid (IDA) as a chelating ligand. The base acrylamide gels were also functionalized with metal affinity ligands to allow for comparison with thermally responsive affinity gels. The results show the effectiveness of this technique for both these types of gels, and an improved method to immobilize metal affinity groups on to thermally sensitive N‐isopropyl acrylamide gels was also developed. It was seen that the yields for the reaction with BDE decreased with increased reaction time in both kinds of gels, whereas reaction with IDA showed a decrease in yields with increase in temperature for N‐isoporpyl acrylamide gels and increase in yields for acrylamide gels. Further techniques were developed to overcome diffusional resistances and stresses in the thermally responsive N‐isopropyl acrylamide gels so as to improve the distribution of Cu²⁺ ions. © 2007 Wiley Periodicals, Inc. J Appl Polym Sci, 2007     

Two-Color Capillary Electrophoresis with On-Column Excitation and Wave-Guide Based Fluorescent Detection

An optical wave-guide based two-color capillary electrophoresis laser induced fluorescence (CE-LIF) instrument is described. The wave-guide based approach allows for on column excitation and detection with two-color discrimination. The instrument is designed to allow either electrokinetic or hydrodynamic injections. In its present configuration, the attainable limit of detection (LOD, S/N = 3) was 50 X 10⁻²¹ moles of fluorescein with a 488-nm excitation source. This study was designed to test the instrument design for applications in protein analyses. Fluorescent dyes with two different wavelengths were simultaneously separated and detected as were complexes formed by labeled antibodies to NFκB p65 and cdc2p34. Quantification of both proteins in THP-1 cell lysates performed using this approach illustrates a rapid screening application of this instrument.     

SAT-Solving the Coverability Problem for Petri Nets

Net unfoldings have attracted great attention as a powerful technique for combating state space explosion in model checking, and have been applied to verification of finite state systems including 1-safe (finite) Petri nets and synchronous products of finite transition systems. Given that net unfoldings represent the state space in a distributed, implicit manner the verification algorithm is necessarily a two step process: generation of the unfolding and reasoning about it. In his seminal work McMillan (K.L. McMillan, Symbolic Model Checking. Kluwer Academic Publishers, 1993) showed that deadlock detection on unfoldings of 1-safe Petri nets is NP-complete. Since the deadlock problem on Petri nets is PSPACE-hard it is generally accepted that the two step process will yield savings (in time and space) provided the unfoldings are small.In this paper we show how unfoldings can be extended to the context of infinite-state systems. More precisely, we show how unfoldings can be constructed to represent sets of backward reachable states of unbounded Petri nets in a symbolic fashion. Furthermore, based on unfoldings, we show how to solve the coverability problem for unbounded Petri nets using a SAT-solver. Our experiments show that the use of unfoldings, in spite of the two-step process for solving coverability, has better time and space characteristics compared to a traditional reachability based implementation that considers all interleavings for solving the coverability problem.     

TCP onloading for data center servers

To meet the increasing networking needs of server workloads, servers are starting to offload packet processing to peripheral devices to achieve TCP/IP acceleration. Researchers at Intel Labs have experimented with alternative solutions that improve the server's ability to process TCP/IP packets efficiently and at very high rates.