Simultaneous measurement of mechanical and electrical contact resistances during nanoindentation of NiTi shape memory alloys

The nanoindentation technique can be employed in shape memory alloys (SMAs) to discern the transformation temperatures as well as to characterize their mechanical behavior. In this paper, we use it with simultaneous measurements of the mechanical and the electrical contact resistances (ECR) at room temperature to probe two SMAs: austenite (RTA) and martensite (RTM). Two different types of indenter tips - Berkovich and spherical - are employed to examine the SMAs' indentation responses as a function of the representative strain, epsilon(R). In Berkovich indentation, because of the sharp nature of the tip, and in consequence the high levels of strain imposed, discerning the two SMAs on the basis of the indentation response alone is difficult. In the case of the spherical tip, epsilon(R) is systematically varied and its effect on the depth recovery ratio, eta(d), is examined. Results indicate that RTA has higher eta(d) than RTM, but the difference decreases with increasing epsilon(R) such that eta(d) values for both the alloys would be similar in the fully plastic regime. The experimental trends in eta(d) vs. epsilon(R) for both the alloys could be described well with a eta(d) proportional to (epsilon(R))(-1) type equation, which is developed on the basis of a phenomenological model. This fit, in turn, directs us to the maximum epsilon(R), below which plasticity underneath the indenter would not mask the differences in the two SMAs. It was demonstrated that the ECR measurements complement the mechanical measurements in demarcating the reverse transformation from martensite to austenite during unloading of RTA, wherein a marked increase in the voltage was noted. A correlation between recovery due to reverse transformation during unloading and increase in voltage (and hence the electrical resistance) was found. (C) 2013 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

The Lovasz θ function, SVMs and finding large dense subgraphs

The Lovasz θ function of a graph, is a fundamental tool in combinatorial optimization and approximation algorithms. Computing θ involves solving a SDP and is extremely expensive even for moderately sized graphs. In this paper we establish that the Lovasz θ function is equivalent to a kernel learning problem related to one class SVM. This interesting connection opens up many opportunities bridging graph theoretic algorithms and machine learning. We show that there exist graphs, which we call SVM−θ graphs, on which the Lovasz θ function can be approximated well by a one-class SVM. This leads to a novel use of SVM techniques to solve algorithmic problems in large graphs e.g. identifying a planted clique of size Θ(n√) in a random graph G(n,12). A classic approach for this problem involves computing the θ function, however it is not scalable due to SDP computation. We show that the random graph with a planted clique is an example of SVM−θ graph, and as a consequence a SVM based approach easily identifies the clique in large graphs and is competitive with the state-of-the-art. Further, we introduce the notion of a ''common orthogonal labeling'' which extends the notion of a ''orthogonal labelling of a single graph (used in defining the θ function) to multiple graphs. The problem of finding the optimal common orthogonal labelling is cast as a Multiple Kernel Learning problem and is used to identify a large common dense region in multiple graphs. The proposed algorithm achieves an order of magnitude scalability compared to the state of the art.

Simultaneous feature selection and clustering using particle swarm optimization

Data clustering groups data so that data which are similar to each other are in the same group and data which are dissimilar to each other are in different groups. Since generally clustering is a subjective activity, it is possible to get different clusterings of the same data depending on the need. This paper attempts to find the best clustering of the data by first carrying out feature selection and using only the selected features, for clustering. A PSO (Particle Swarm Optimization)has been used for clustering but feature selection has also been carried out simultaneously. The performance of the above proposed algorithm is evaluated on some benchmark data sets. The experimental results shows the proposed methodology outperforms the previous approaches such as basic PSO and Kmeans for the clustering problem.

Simultaneous attitude control and trajectory tracking of a micro quadrotor: a SNAC aided nonlinear dynamic inversion approach

This paper presents an advanced single network adaptive critic (SNAC) aided nonlinear dynamic inversion (NDI) approach for simultaneous attitude control and trajectory tracking of a micro-quadrotor. Control of micro-quadrotors is a challenging problem due to its small size, strong coupling in pitch-yaw-roll and aerodynamic effects that often need to be ignored in the control design process to avoid mathematical complexities. In the proposed SNAC aided NDI approach, the gains of the dynamic inversion design are selected in such a way that the resulting controller behaves closely to a pre-synthesized SNAC controller for the output regulation problem. However, since SNAC is based on optimal control theory, it makes the dynamic inversion controller to operate near optimal and enhances its robustness property as well. More important, it retains two major benefits of dynamic inversion: (i) closed form expression of the controller and (ii) easy scalability to command tracking application even without any apriori knowledge of the reference command. Effectiveness of the proposed controller is demonstrated from six degree-of-freedom simulation studies of a micro-quadrotor. It has also been observed that the proposed SNAC aided NDI approach is more robust to modeling inaccuracies, as compared to the NDI controller designed independently from time domain specifications.

Simultaneous source localization and boundary mapping for contaminants

This paper addresses the problem of localizing the sources of contaminants spread in the environment, and mapping the boundary of the affected region using an innovative swarm intelligence based technique. Unlike most work in this area the algorithm is capable of localizing multiple sources simultaneously while also mapping the boundary of the contaminant spread. At the same time the algorithm is suitable for implementation using a mobile robotic sensor network. Two types of agents, called the source localization agents (or S-agents) and boundary mapping agents (or B-agents) are used for this purpose. The paper uses the basic glowworm swarm optimization (GSO) algorithm, which has been used only for multiple signal source localization, and modifies it considerably to make it suitable for both these tasks. This requires the definition of new behaviour patterns for the agents based on their terminal performance as well as interactions between them that helps the swarm to split into subgroups easily and identify contaminant sources as well as spread along the boundary to map its full length. Simulations results are given to demonstrate the efficacy of the algorithm.

Lovasz theta function, SVMs and Finding Dense Subgraphs

In this paper we establish that the Lovasz theta function on a graph can be restated as a kernel learning problem. We introduce the notion of SVM-theta graphs, on which Lovasz theta function can be approximated well by a Support vector machine (SVM). We show that Erdos-Renyi random G(n, p) graphs are SVM-theta graphs for log(4)n/n <= p < 1. Even if we embed a large clique of size Theta(root np/1-p) in a G(n, p) graph the resultant graph still remains a SVM-theta graph. This immediately suggests an SVM based algorithm for recovering a large planted clique in random graphs. Associated with the theta function is the notion of orthogonal labellings. We introduce common orthogonal labellings which extends the idea of orthogonal labellings to multiple graphs. This allows us to propose a Multiple Kernel learning (MKL) based solution which is capable of identifying a large common dense subgraph in multiple graphs. Both in the planted clique case and common subgraph detection problem the proposed solutions beat the state of the art by an order of magnitude.

Finding hidden females in a crowd: Mate recognition in fig wasps

Multi-species mating aggregations are crowded environments within which mate recognition must occur. Mating aggregations of fig wasps can consist of thousands of individuals of many species that attain sexual maturity simultaneously and mate in the same microenvironment, i.e, in syntopy, within the close confines of an enclosed globular inflorescence called a syconium - a system that has many signalling constraints such as darkness and crowding. All wasps develop within individual galled flowers. Since mating mostly occurs when females are still confined within their galls,, male wasps have the additional burden of detecting conspecific females that are ``hidden'' behind barriers consisting of gall walls. In Ficus racemosa, we investigated signals used by pollinating fig wasp males to differentiate conspecific females from females of other syntopic fig wasp species. Male Ceratosolen fusciceps could detect conspecific females using cues from galls containing females, empty galls, as well as cues from gall volatiles and gall surface hydrocarbons. In many figs, syconia are pollinated by single foundress wasps, leading to high levels of wasp inbreeding due to sibmating. In F. racemosa, as most syconia contain many foundresses, we expected male pollinators to prefer non-sib females to female siblings to reduce inbreeding. We used galls containing females from non-natal figs as a proxy for non-sibs and those from natal figs as a proxy for sibling females. We found that males preferred galls of female pollinators from natal figs. However, males were undecided when given a choice between galls containing non-pollinator females from natal syconia and pollinator females from non-natal syconia, suggesting olfactory imprinting by the natal syconial environment. (C) 2013 Elsevier Masson SAS. All rights reserved.

Simultaneous co-ordination of three cytosine ligands displaying different binding sites around the copper centres

We report the synthesis and structural characterization of a polymeric ternary copper-cytosine-phenanthroline complex, Cu-4(phen)(3)-(mu(3)-cyt)(2)(mu-OH)(cyt)(OH)Cl-3](n)center dot 16H(2)O, where three cytosine ligands with different binding sites have simultaneously complexed to the four copper metal centres. Interestingly, the complex exhibits two different coordination geometries around the metal centres.

Multidimensional free energy surface of unfolding of HP-36: Microscopic origin of ruggedness

The protein folding funnel paradigm suggests that folding and unfolding proceed as directed diffusion in a multidimensional free energy surface where a multitude of pathways can be traversed during the protein's sojourn from initial to final state. However, finding even a single pathway, with the detail chronicling of intermediates, is an arduous task. In this work we explore the free energy surface of unfolding pathway through umbrella sampling, for a small globular a-helical protein chicken-villin headpiece (HP-36) when the melting of secondary structures is induced by adding DMSO in aqueous solution. We find that the unfolding proceeds through the initial separation or melting of aggregated hydrophobic core that comprises of three phenylalanine residues (Phe7, Phe11, and Phe18). This separation is accompanied by simultaneous melting of the second helix. Unfolding is found to be a multistage process involving crossing of three consecutive minima and two barriers at the initial stage. At a molecular level, Phe18 is observed to reorient itself towards other hydrophobic grooves to stabilize the intermediate states. We identify the configuration of the intermediates and correlate the intermediates with those obtained in our previous works. We also give an estimate of the barriers for different transition states and observe the softening of the barriers with increasing DMSO concentration. We show that higher concentration of DMSO tunes the unfolding pathway by destabilizing the third minimum and stabilizing the second one, indicating the development of a solvent modified, less rugged pathway. The prime outcome of this work is the demonstration that mixed solvents can profoundly transform the nature of the energy landscape and induce unfolding via a modified route. A successful application of Kramer's rate equation correlating the free energy simulation results shows faster rate of unfolding with increasing DMSO concentration. This work perhaps presents the first systematic theoretical study of the effect of a chemical denaturant on the microscopic free energy surface and rates of unfolding of HP-36. (C) 2014 AIP Publishing LLC.

Hexamethylenetetramine mediated simultaneous nitrogen doping and reduction of graphene oxide for a metal-free SERS substrate

We report a one-pot hydrothermal synthesis of nitrogen doped reduced graphene oxide (N-rGO) and Ag nanoparticle decorated N-rGO hybrid nanostructures from graphene oxide (GO), metal ions and hexamethylenetetramine (HMT). HMT not only reduces GO and metal ions simultaneously but also acts as the source for the nitrogen (N) dopant. We show that the N-rGO can be used as a metal-free surface enhanced Raman spectroscopy (SERS) substrate, while the Ag nano-particles decorated N-rGO can be used as an effective SERS substrate as well as a template for decorating various other nanostructures on N-rGO.

Simultaneous Perturbation Newton Algorithms for Simulation Optimization

We present a new Hessian estimator based on the simultaneous perturbation procedure, that requires three system simulations regardless of the parameter dimension. We then present two Newton-based simulation optimization algorithms that incorporate this Hessian estimator. The two algorithms differ primarily in the manner in which the Hessian estimate is used. Both our algorithms do not compute the inverse Hessian explicitly, thereby saving on computational effort. While our first algorithm directly obtains the product of the inverse Hessian with the gradient of the objective, our second algorithm makes use of the Sherman-Morrison matrix inversion lemma to recursively estimate the inverse Hessian. We provide proofs of convergence for both our algorithms. Next, we consider an interesting application of our algorithms on a problem of road traffic control. Our algorithms are seen to exhibit better performance than two Newton algorithms from a recent prior work.

Simultaneous measurements of thickness and temperature profile of the lubricant film at chip-tool interface during machining process using luminescent sensors

Simultaneous measurements of thickness and temperature profile of the lubricant film at chip-tool interface during machining have been studied in this experimental programme. Conventional techniques such as thermography can only provide temperature measurement under controlled environment in a laboratory and without the addition of lubricant. The present study builds on the capabilities of luminescent sensors in addition to direct image based observations of the chip-tool interface. A suite of experiments conducted using different types of sensors are reported in this paper, especially noteworthy are concomitant measures of thickness and temperature of the lubricant. (C) 2014 Elsevier Ltd.

On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties

We study the problem of finding small s-t separators that induce graphs having certain properties. It is known that finding a minimum clique s-t separator is polynomial-time solvable (Tarjan in Discrete Math. 55:221-232, 1985), while for example the problems of finding a minimum s-t separator that induces a connected graph or forms an independent set are fixed-parameter tractable when parameterized by the size of the separator (Marx et al. in ACM Trans. Algorithms 9(4): 30, 2013). Motivated by these results, we study properties that generalize cliques, independent sets, and connected graphs, and determine the complexity of finding separators satisfying these properties. We investigate these problems also on bounded-degree graphs. Our results are as follows: Finding a minimum c-connected s-t separator is FPT for c=2 and W1]-hard for any ca parts per thousand yen3. Finding a minimum s-t separator with diameter at most d is W1]-hard for any da parts per thousand yen2. Finding a minimum r-regular s-t separator is W1]-hard for any ra parts per thousand yen1. For any decidable graph property, finding a minimum s-t separator with this property is FPT parameterized jointly by the size of the separator and the maximum degree. Finding a connected s-t separator of minimum size does not have a polynomial kernel, even when restricted to graphs of maximum degree at most 3, unless .

Simultaneous Determination of Catecholamines in Presence of Uric Acid and Ascorbic Acid at a Highly Sensitive Electrochemically Activated Carbon Paste Electrode

A simple yet remarkable, electrochemically activated carbon paste electrode (EACPE) was prepared by successive potential cycling of carbon paste in a 0.1 M NaOH solution and was effectively used for the simultaneous determination of catecholamines such as dopamine (DA), epinephrine (E) and Norepinephrine (NE) in presence of uric acid (UA) and ascorbic acid (AA). Taking DA as the ideal catecholamine, the electrochemical behaviors of DA, UA and AA such as scan rate and pH variation was studied by cyclic voltammetry (CV) in phosphate buffer solution (PBS, pH 7.1). This electrochemical sensor exhibited strong electrocatalytic activity towards the oxidation of a mixture of catecholamines, UA and AA with apparent reduction of overpotentials. Crider optimum conditions, limit of detection (S/N = 3) of DA, E, NE, UA and AA was found to be 0.08, 0.08, 0.07, 0.1 and 6.0 mu M, respectively by differential pulse voltammetry (DPV). The analytical performance of this modified electrode as a biosensor was also demonstrated for the determination of DA, UA and AA in dopamine injection, human urine and vitamin C tablets, respectively, in presence of other interfering substances. (C) 2015 The Electrochemical Society. All-rights reserved.

Simultaneous enhancement in mechanical strength, electrical conductivity, and electromagnetic shielding properties in PVDF-ABS blends containing PMMA wrapped multiwall carbon nanotubes

A unique approach was adopted to drive the multiwall carbon nanotubes (MWNTs) to the interface of immiscible PVDF-ABS blends by wrapping the nanotubes with a mutually miscible homopolymer (PMMA). A tailor made interface with an improved stress transfer was achieved in the blends with PMMA wrapped MWNTs. This manifested in an impressive 108% increment in the tensile strength and 48% increment in the Young's modulus with 3 wt% PMMA wrapped MWNTs in striking contrast to the neat blends. As the PMMA wrapped MWNTs localized at the interface of PVDF-ABS blends, the electrical conductivity could be tuned with respect to only MWNTs, which were selectively localized in the PVDF phase, driven by thermodynamics. The electromagnetic shielding properties were assessed using a vector network analyser in a broad range of frequency, X-band (8-12 GHz) and Ku-band (12-18 GHz). Interestingly, enhanced EM shielding was achieved by this unique approach. The blends with only MWNTs shielded the EM waves mostly by reflection however, the blends with PMMA wrapped MWNTs (3 wt%) shielded mostly by absorption (62%). This study opens new avenues in designing materials, which show simultaneous improvement in mechanical, electrical conductivity and EM shielding properties.