Static shear strength and fatigue life of refill friction stir spot welded AA 6061-T6 sheets

This study was aimed at evaluating the static shear strength and fatigue properties of the newly developed refilled friction stir spot welded AA 6061-T6 joints. The keyhole, the process disadvantage of conventional friction stir spot welding, was refilled successfully, using an additional filler plate, with specially designed tools. Two different tool profiles, namely, convex and concave, were used for the refilling process. Sound and defect free joints were obtained by the refilling process. Joints refilled with convex tools showed better static shear strength than those with the concave ones. The variation of microhardness in different regions of the weld was analysed. Fatigue tests were conducted on the lap shear specimens at a stress ratio of R=0.1. The optical micrographs of the welds after fatigue failure in both the conventional and refilled processes were examined to study the fatigue crack propagation and failure modes.

Optimal sequential wireless relay placement on a random lattice path

Our work is motivated by impromptu (or ``as-you-go'') deployment of wireless relay nodes along a path, a need that arises in many situations. In this paper, the path is modeled as starting at the origin (where there is the data sink, e.g., the control center), and evolving randomly over a lattice in the positive quadrant. A person walks along the path deploying relay nodes as he goes. At each step, the path can, randomly, either continue in the same direction or take a turn, or come to an end, at which point a data source (e.g., a sensor) has to be placed, that will send packets to the data sink. A decision has to be made at each step whether or not to place a wireless relay node. Assuming that the packet generation rate by the source is very low, and simple link-by-link scheduling, we consider the problem of sequential relay placement so as to minimize the expectation of an end-to-end cost metric (a linear combination of the sum of convex hop costs and the number of relays placed). This impromptu relay placement problem is formulated as a total cost Markov decision process. First, we derive the optimal policy in terms of an optimal placement set and show that this set is characterized by a boundary (with respect to the position of the last placed relay) beyond which it is optimal to place the next relay. Next, based on a simpler one-step-look-ahead characterization of the optimal policy, we propose an algorithm which is proved to converge to the optimal placement set in a finite number of steps and which is faster than value iteration. We show by simulations that the distance threshold based heuristic, usually assumed in the literature, is close to the optimal, provided that the threshold distance is carefully chosen. (C) 2014 Elsevier B.V. All rights reserved.

Small strong epsilon nets

Let P be a set of n points in R-d. A point x is said to be a centerpoint of P if x is contained in every convex object that contains more than dn/d+1 points of P. We call a point x a strong centerpoint for a family of objects C if x is an element of P is contained in every object C is an element of C that contains more than a constant fraction of points of P. A strong centerpoint does not exist even for halfspaces in R-2. We prove that a strong centerpoint exists for axis-parallel boxes in Rd and give exact bounds. We then extend this to small strong epsilon-nets in the plane. Let epsilon(S)(i) represent the smallest real number in 0, 1] such that there exists an epsilon(S)(i)-net of size i with respect to S. We prove upper and lower bounds for epsilon(S)(i) where S is the family of axis-parallel rectangles, halfspaces and disks. (C) 2014 Elsevier B.V. All rights reserved.

Mixed finite elements for electromagnetic analysis

The occurrence of spurious solutions is a well-known limitation of the standard nodal finite element method when applied to electromagnetic problems. The two commonly used remedies that are used to address this problem are (i) The addition of a penalty term with the penalty factor based on the local dielectric constant, and which reduces to a Helmholtz form on homogeneous domains (regularized formulation); (ii) A formulation based on a vector and a scalar potential. Both these strategies have some shortcomings. The penalty method does not completely get rid of the spurious modes, and both methods are incapable of predicting singular eigenvalues in non-convex domains. Some non-zero spurious eigenvalues are also predicted by these methods on non-convex domains. In this work, we develop mixed finite element formulations which predict the eigenfrequencies (including their multiplicities) accurately, even for nonconvex domains. The main feature of the proposed mixed finite element formulation is that no ad-hoc terms are added to the formulation as in the penalty formulation, and the improvement is achieved purely by an appropriate choice of finite element spaces for the different variables. We show that the formulation works even for inhomogeneous domains where `double noding' is used to enforce the appropriate continuity requirements at an interface. For two-dimensional problems, the shape of the domain can be arbitrary, while for the three-dimensional ones, with our current formulation, only regular domains (which can be nonconvex) can be modeled. Since eigenfrequencies are modeled accurately, these elements also yield accurate results for driven problems. (C) 2014 Elsevier Ltd. All rights reserved.

An Eigen Approach to Transmit Beamforming in Wireless Networks With Single Antenna Receivers

In this paper, we propose an eigen framework for transmit beamforming for single-hop and dual-hop network models with single antenna receivers. In cases where number of receivers is not more than three, the proposed Eigen approach is vastly superior in terms of ease of implementation and computational complexity compared with the existing convex-relaxation-based approaches. The essential premise is that the precoding problems can be posed as equivalent optimization problems of searching for an optimal vector in the joint numerical range of Hermitian matrices. We show that the latter problem has two convex approximations: the first one is a semi-definite program that yields a lower bound on the solution, and the second one is a linear matrix inequality that yields an upper bound on the solution. We study the performance of the proposed and existing techniques using numerical simulations.

On strong centerpoints

Let P be a set of n points in R-d and F be a family of geometric objects. We call a point x is an element of P a strong centerpoint of P w.r.t..F if x is contained in all F is an element of F that contains more than cn points of P, where c is a fixed constant. A strong centerpoint does not exist even when F is the family of halfspaces in the plane. We prove the existence of strong centerpoints with exact constants for convex polytopes defined by a fixed set of orientations. We also prove the existence of strong centerpoints for abstract set systems with bounded intersection. (C) 2014 Elsevier B.V. All rights reserved.

On the impact of a concave nosed axisymmetric body on a free surface

We report on an experimental study of the vertical impact of a concave nosed axisymmetric body on a free surface. Previous studies have shown that bodies with a convex nose, like a sphere, produce a well defined splash with a relatively large cavity behind the model. In contrast, we find that with a concave nose, there is hardly a splash and the cavity extent is greatly reduced. This may be explained by the fact that in the concave nosed case, the initial impact is between a confined air pocket and the free surface unlike in the convex nosed case. From measurements of the unsteady pressure in the concave nose portion, we show that in this case, the maximum pressures are significantly lower than the classically expected ``water hammer'' pressures and also lower than those generally measured on other geometries. Thus, the presence of an air pocket in the case of a concave nosed body adds an interesting dimension to the classical problem of impact of solid bodies on to a free surface. (C) 2015 AIP Publishing LLC.

GLOBAL REGISTRATION OF MULTIPLE POINT CLOUDS USING SEMIDEFINITE PROGRAMMING

Consider N points in R-d and M local coordinate systems that are related through unknown rigid transforms. For each point, we are given (possibly noisy) measurements of its local coordinates in some of the coordinate systems. Alternatively, for each coordinate system, we observe the coordinates of a subset of the points. The problem of estimating the global coordinates of the N points (up to a rigid transform) from such measurements comes up in distributed approaches to molecular conformation and sensor network localization, and also in computer vision and graphics. The least-squares formulation of this problem, although nonconvex, has a well-known closed-form solution when M = 2 (based on the singular value decomposition (SVD)). However, no closed-form solution is known for M >= 3. In this paper, we demonstrate how the least-squares formulation can be relaxed into a convex program, namely, a semidefinite program (SDP). By setting up connections between the uniqueness of this SDP and results from rigidity theory, we prove conditions for exact and stable recovery for the SDP relaxation. In particular, we prove that the SDP relaxation can guarantee recovery under more adversarial conditions compared to earlier proposed spectral relaxations, and we derive error bounds for the registration error incurred by the SDP relaxation. We also present results of numerical experiments on simulated data to confirm the theoretical findings. We empirically demonstrate that (a) unlike the spectral relaxation, the relaxation gap is mostly zero for the SDP (i.e., we are able to solve the original nonconvex least-squares problem) up to a certain noise threshold, and (b) the SDP performs significantly better than spectral and manifold-optimization methods, particularly at large noise levels.

THREE-LAYER FLUID FLOW OVER A SMALL OBSTRUCTION ON THE BOTTOM OF A CHANNEL

Many boundary value problems occur in a natural way while studying fluid flow problems in a channel. The solutions of two such boundary value problems are obtained and analysed in the context of flow problems involving three layers of fluids of different constant densities in a channel, associated with an impermeable bottom that has a small undulation. The top surface of the channel is either bounded by a rigid lid or free to the atmosphere. The fluid in each layer is assumed to be inviscid and incompressible, and the flow is irrotational and two-dimensional. Only waves that are stationary with respect to the bottom profile are considered in this paper. The effect of surface tension is neglected. In the process of obtaining solutions for both the problems, regular perturbation analysis along with a Fourier transform technique is employed to derive the first-order corrections of some important physical quantities. Two types of bottom topography, such as concave and convex, are considered to derive the profiles of the interfaces. We observe that the profiles are oscillatory in nature, representing waves of variable amplitude with distinct wave numbers propagating downstream and with no wave upstream. The observations are presented in tabular and graphical forms.

Optimal power allocation for protective jamming in wireless networks: A flow based model

We address the problem of passive eavesdroppers in multi-hop wireless networks using the technique of friendly jamming. The network is assumed to employ Decode and Forward (DF) relaying. Assuming the availability of perfect channel state information (CSI) of legitimate nodes and eavesdroppers, we consider a scheduling and power allocation (PA) problem for a multiple-source multiple-sink scenario so that eavesdroppers are jammed, and source-destination throughput targets are met while minimizing the overall transmitted power. We propose activation sets (AS-es) for scheduling, and formulate an optimization problem for PA. Several methods for finding AS-es are discussed and compared. We present an approximate linear program for the original nonlinear, non-convex PA optimization problem, and argue that under certain conditions, both the formulations produce identical results. In the absence of eavesdroppers' CSI, we utilize the notion of Vulnerability Region (VR), and formulate an optimization problem with the objective of minimizing the VR. Our results show that the proposed solution can achieve power-efficient operation while defeating eavesdroppers and achieving desired source-destination throughputs simultaneously. (C) 2015 Elsevier B.V. All rights reserved.

Making risk minimization tolerant to label noise

In many applications, the training data, from which one needs to learn a classifier, is corrupted with label noise. Many standard algorithms such as SVM perform poorly in the presence of label noise. In this paper we investigate the robustness of risk minimization to label noise. We prove a sufficient condition on a loss function for the risk minimization under that loss to be tolerant to uniform label noise. We show that the 0-1 loss, sigmoid loss, ramp loss and probit loss satisfy this condition though none of the standard convex loss functions satisfy it. We also prove that, by choosing a sufficiently large value of a parameter in the loss function, the sigmoid loss, ramp loss and probit loss can be made tolerant to nonuniform label noise also if we can assume the classes to be separable under noise-free data distribution. Through extensive empirical studies, we show that risk minimization under the 0-1 loss, the sigmoid loss and the ramp loss has much better robustness to label noise when compared to the SVM algorithm. (C) 2015 Elsevier B.V. All rights reserved.

The tarani mutation alters surface curvature in Arabidopsis leaves by perturbing the patterns of surface expansion and cell division

The leaf surface usually stays flat, maintained by coordinated growth. Growth perturbation can introduce overall surface curvature, which can be negative, giving a saddle-shaped leaf, or positive, giving a cup-like leaf. Little is known about the molecular mechanisms that underlie leaf flatness, primarily because only a few mutants with altered surface curvature have been isolated and studied. Characterization of mutants of the CINCINNATA-like TCP genes in Antirrhinum and Arabidopsis have revealed that their products help maintain flatness by balancing the pattern of cell proliferation and surface expansion between the margin and the central zone during leaf morphogenesis. On the other hand, deletion of two homologous PEAPOD genes causes cup-shaped leaves in Arabidopsis due to excess division of dispersed meristemoid cells. Here, we report the isolation and characterization of an Arabidopsis mutant, tarani (tni), with enlarged, cup-shaped leaves. Morphometric analyses showed that the positive curvature of the tni leaf is linked to excess growth at the centre compared to the margin. By monitoring the dynamic pattern of CYCLIN D3;2 expression, we show that the shape of the primary arrest front is strongly convex in growing tni leaves, leading to excess mitotic expansion synchronized with excess cell proliferation at the centre. Reduction of cell proliferation and of endogenous gibberellic acid levels rescued the tni phenotype. Genetic interactions demonstrated that TNI maintains leaf flatness independent of TCPs and PEAPODs.

Novel Biobjective Clustering (BiGC) Based on Cooperative Game Theory

We propose a new approach to clustering. Our idea is to map cluster formation to coalition formation in cooperative games, and to use the Shapley value of the patterns to identify clusters and cluster representatives. We show that the underlying game is convex and this leads to an efficient biobjective clustering algorithm that we call BiGC. The algorithm yields high-quality clustering with respect to average point-to-center distance (potential) as well as average intracluster point-to-point distance (scatter). We demonstrate the superiority of BiGC over state-of-the-art clustering algorithms (including the center based and the multiobjective techniques) through a detailed experimentation using standard cluster validity criteria on several benchmark data sets. We also show that BiGC satisfies key clustering properties such as order independence, scale invariance, and richness.

Two player game variant of the Erdos-Szekeres problem

The classical Erdos-Szekeres theorem states that a convex k-gon exists in every sufficiently large point set. This problem has been well studied and finding tight asymptotic bounds is considered a challenging open problem. Several variants of the Erdos-Szekeres problem have been posed and studied in the last two decades. The well studied variants include the empty convex k-gon problem, convex k-gon with specified number of interior points and the chromatic variant. In this paper, we introduce the following two player game variant of the Erdos-Szekeres problem: Consider a two player game where each player playing in alternate turns, place points in the plane. The objective of the game is to avoid the formation of the convex k-gon among the placed points. The game ends when a convex k-gon is formed and the player who placed the last point loses the game. In our paper we show a winning strategy for the player who plays second in the convex 5-gon game and the empty convex 5-gon game by considering convex layer configurations at each step. We prove that the game always ends in the 9th step by showing that the game reaches a specific set of configurations.

L-infinity norms of holomorphic modular forms in the case of compact quotient

We prove a sub-convex estimate for the sup-norm of L-2-normalized holomorphic modular forms of weight k on the upper half plane, with respect to the unit group of a quaternion division algebra over Q. More precisely we show that when the L-2 norm of an eigenfunction f is one, parallel to f parallel to(infinity) <<(epsilon) k(1/2-1/33+epsilon) for any epsilon > 0 and for all k sufficiently large.