Modified Einstein's gravity as a possible missing link between sub- and super-Chandrasekhar type Ia supernovae

We explore the effect of modification to Einstein's gravity in white dwarfs for the first time in the literature, to the best of our knowledge. This leads to significantly sub- and super-Chandrasekhar limiting masses of white dwarfs, determined by a single model parameter. On the other hand, type Ia supernovae (SNeIa), a key to unravel the evolutionary history of the universe, are believed to be triggered in white dwarfs having mass close to the Chandrasekhar limit. However, observations of several peculiar, under- and over-luminous SNeIa argue for exploding masses widely different from this limit. We argue that explosions of the modified gravity induced sub- and super-Chandrasekhar limiting mass white dwarfs result in under- and over-luminous SNeIa respectively, thus unifying these two apparently disjoint sub-classes and, hence, serving as a missing link. Our discovery raises two fundamental questions. Is the Chandrasekhar limit unique? Is Einstein's gravity the ultimate theory for understanding astronomical phenomena? Both the answers appear to be no!

Biofunctionalized surface-modified silver nanoparticles for gene delivery

Silver nanoparticles (AgNPs) find use in different biomedical applications including wound healing and cancer. We propose that the efficacy of the nanoparticles can be further augmented by using these particles for gene delivery applications. The objective of this work was to engineer biofunctionalized stable AgNPs with good DNA binding ability for efficient transfection and minimal toxicity. Herein, we report on the one-pot facile green synthesis of polyethylene glycol (PEG) stabilized chitosan-g-polyacrylamide modified AgNPs. The size of the PEG stabilized AgNPs was 38 +/- 4 nm with a tighter size distribution compared to the unstabilized nanoparticles which showed bimodal distribution of particle sizes of 68 +/- 5 nm and 7 +/- 4 nm. To enhance the efficiency of gene transfection, the Arg-Gly-Asp-Ser (RGDS) peptide was immobilized on the silver nanoparticles. The transfection efficiency of AgNPs increased significantly after immobilization of the RGDS peptide reaching up to 42 +/- 4% and 30 +/- 3% in HeLa and A549 cells, respectively, and significantly higher than 34 +/- 3% and 23 +/- 2%, respectively, with the use of polyethyleneimine (25 kDa). These nanoparticles were found to induce minimal cellular toxicity. Differences in cellular uptake mechanisms with RGDS immobilization resulting in improved efficiency are elucidated. This study presents biofunctionalized AgNPs for potential use as efficient nonviral carriers for gene delivery with minimal cytotoxicity toward augmenting the therapeutic efficacy of AgNPs used in different biomedical products.

Optical and dielectric study of strontium modified barium zirconium titanate ceramic prepared by high energy ball milling

Strontium modified barium zirconium titanate with general formula Ba1-xSrxZr0.05Ti0.95O3 ceramics have been prepared by solid state and high energy ball milling technique. The X-ray diffraction and Rietveld refinement studies show that all the compositions have single phase symmetry. The composition BaZr0.05Ti0.95O3 shows orthorhombic symmetric with space group Amm2. The structure changes from orthorhombic to tetragonal with strontium doping up to x = 0.3 and with further addition, changes to cubic. The scanning electron micrographs show that the grain size decreases with increase in strontium content. The temperature dependent dielectric behavior shows three phase transition in the parent material which merges with an increase in Sr content The transition temperature and dielectric constant decreases with an increase in Sr concentration. The phase transition becomes more diffused with increment in doping concentration. The ferroelectric behavior of the ceramics is studied by the hysteresis loop. The optical behavior is studied by the UV-visible spectroscopy and found that the optical band gap increases with Sr concentration. (C) 2015 Elsevier B.V. All rights reserved.

Algorithm for Autonomous Reorganization of Mobile Wireless Camera Sensor Networks to Improve Coverage

In this paper, sensing coverage by wireless camera-embedded sensor networks (WCSNs), a class of directional sensors is studied. The proposed work facilitates the autonomous tuning of orientation parameters and displacement of camera-sensor nodes in the bounded field of interest (FoI), where the network coverage in terms of every point in the FoI is important. The proposed work is first of its kind to study the problem of maximizing coverage of randomly deployed mobile WCSNs which exploits their mobility. We propose an algorithm uncovered region exploration algorithm (UREA-CS) that can be executed in centralized and distributed modes. Further, the work is extended for two special scenarios: 1) to suit autonomous combing operations after initial random WCSN deployments and 2) to improve the network coverage with occlusions in the FoI. The extensive simulation results show that the performance of UREA-CS is consistent, robust, and versatile to achieve maximum coverage, both in centralized and distributed modes. The centralized and distributed modes are further analyzed with respect to the computational and communicational overheads.

An organically modified exfoliated graphite electrode for the voltammetric determination of lead ions in contaminated water samples

This work presents a new electrode, 2-benzoylnaphtho 2,1-b]furan hydrazone exfoliated graphite paste electrode (B-EGPE) fabricated for the differential pulse anodic stripping voltammetric determination of lead (Pb). Under the optimal conditions, Pb2+ could be detected in the concentration range from 2.75 x 10(-7) to 1.5 x 10(-6) mol/L with the linear regression equation, y = 19.41 x 10(-6) x + 0.4249 x 10(-9) with R = 0.99. Interferences from other ions were investigated and the proposed method was further applied to the trace levels of Pb2+ detection in real samples with satisfactory results.

An Alternating l(p) - l(2) Projections Algorithm (ALPA) for Speech Modeling using Sparsity Constraints

We address the problem of separating a speech signal into its excitation and vocal-tract filter components, which falls within the framework of blind deconvolution. Typically, the excitation in case of voiced speech is assumed to be sparse and the vocal-tract filter stable. We develop an alternating l(p) - l(2) projections algorithm (ALPA) to perform deconvolution taking into account these constraints. The algorithm is iterative, and alternates between two solution spaces. The initialization is based on the standard linear prediction decomposition of a speech signal into an autoregressive filter and prediction residue. In every iteration, a sparse excitation is estimated by optimizing an l(p)-norm-based cost and the vocal-tract filter is derived as a solution to a standard least-squares minimization problem. We validate the algorithm on voiced segments of natural speech signals and show applications to epoch estimation. We also present comparisons with state-of-the-art techniques and show that ALPA gives a sparser impulse-like excitation, where the impulses directly denote the epochs or instants of significant excitation.

A Split-and-Merge Dictionary Learning Algorithm for Sparse Representation: Application to Image Denoising

In big data image/video analytics, we encounter the problem of learning an over-complete dictionary for sparse representation from a large training dataset, which cannot be processed at once because of storage and computational constraints. To tackle the problem of dictionary learning in such scenarios, we propose an algorithm that exploits the inherent clustered structure of the training data and make use of a divide-and-conquer approach. The fundamental idea behind the algorithm is to partition the training dataset into smaller clusters, and learn local dictionaries for each cluster. Subsequently, the local dictionaries are merged to form a global dictionary. Merging is done by solving another dictionary learning problem on the atoms of the locally trained dictionaries. This algorithm is referred to as the split-and-merge algorithm. We show that the proposed algorithm is efficient in its usage of memory and computational complexity, and performs on par with the standard learning strategy, which operates on the entire data at a time. As an application, we consider the problem of image denoising. We present a comparative analysis of our algorithm with the standard learning techniques that use the entire database at a time, in terms of training and denoising performance. We observe that the split-and-merge algorithm results in a remarkable reduction of training time, without significantly affecting the denoising performance.

A Fast and Fault-Tolerant Distributed Algorithm for Near-Optimal TDMA Scheduling in WSNs

The time division multiple access (TDMA) based channel access mechanisms perform better than the contention based channel access mechanisms, in terms of channel utilization, reliability and power consumption, specially for high data rate applications in wireless sensor networks (WSNs). Most of the existing distributed TDMA scheduling techniques can be classified as either static or dynamic. The primary purpose of static TDMA scheduling algorithms is to improve the channel utilization by generating a schedule of smaller length. But, they usually take longer time to schedule, and hence, are not suitable for WSNs, in which the network topology changes dynamically. On the other hand, dynamic TDMA scheduling algorithms generate a schedule quickly, but they are not efficient in terms of generated schedule length. In this paper, we propose a novel scheme for TDMA scheduling in WSNs, which can generate a compact schedule similar to static scheduling algorithms, while its runtime performance can be matched with those of dynamic scheduling algorithms. Furthermore, the proposed distributed TDMA scheduling algorithm has the capability to trade-off schedule length with the time required to generate the schedule. This would allow the developers of WSNs, to tune the performance, as per the requirement of prevalent WSN applications, and the requirement to perform re-scheduling. Finally, the proposed TDMA scheduling is fault-tolerant to packet loss due to erroneous wireless channel. The algorithm has been simulated using the Castalia simulator to compare its performance with those of others in terms of generated schedule length and the time required to generate the TDMA schedule. Simulation results show that the proposed algorithm generates a compact schedule in a very less time.

A Simple Label Switching Algorithm for Semisupervised Structural SVMs

In structured output learning, obtaining labeled data for real-world applications is usually costly, while unlabeled examples are available in abundance. Semisupervised structured classification deals with a small number of labeled examples and a large number of unlabeled structured data. In this work, we consider semisupervised structural support vector machines with domain constraints. The optimization problem, which in general is not convex, contains the loss terms associated with the labeled and unlabeled examples, along with the domain constraints. We propose a simple optimization approach that alternates between solving a supervised learning problem and a constraint matching problem. Solving the constraint matching problem is difficult for structured prediction, and we propose an efficient and effective label switching method to solve it. The alternating optimization is carried out within a deterministic annealing framework, which helps in effective constraint matching and avoiding poor local minima, which are not very useful. The algorithm is simple and easy to implement. Further, it is suitable for any structured output learning problem where exact inference is available. Experiments on benchmark sequence labeling data sets and a natural language parsing data set show that the proposed approach, though simple, achieves comparable generalization performance.

A modified auxiliary excitation signal for achieving unidirectional ion ejection in quadrupole ion trap mass spectrometers operating in the resonance ejection mode

This paper proposes a technique to cause unidirectional ion ejection in a quadrupole ion trap mass spectrometer operated in the resonance ejection mode. In this technique a modified auxiliary dipolar excitation signal is applied to the endcap electrodes. This modified signal is a linear combination of two signals. The first signal is the nominal dipolar excitation signal which is applied across the endcap electrodes and the second signal is the second harmonic of the first signal, the amplitude of the second harmonic being larger than that of the fundamental. We have investigated the effect of the following parameters on achieving unidirectional ion ejection: primary signal amplitude, ratio of amplitude of second harmonic to that of primary signal amplitude, different operating points, different scan rates, different mass to charge ratios and different damping constants. In all these simulations unidirectional ejection of destabilized ions has been successfully achieved. (C) 2015 Elsevier B.V. All rights reserved.

An automatic algorithm for mixed mode crack growth rate based on drop potential method

A new automatic algorithm for the assessment of mixed mode crack growth rate characteristics is presented based on the concept of an equivalent crack. The residual ligament size approach is introduced to implementation this algorithm for identifying the crack tip position on a curved path with respect to the drop potential signal. The automatic algorithm accounting for the curvilinear crack trajectory and employing an electrical potential difference was calibrated with respect to the optical measurements for the growing crack under cyclic mixed mode loading conditions. The effectiveness of the proposed algorithm is confirmed by fatigue tests performed on ST3 steel compact tension-shear specimens in the full range of mode mixities from pure mode Ito pure mode II. (C) 2015 Elsevier Ltd. All rights reserved.

Hybrid Working Set Algorithm for SVM Learning With a Kernel Coprocessor on FPGA

Support vector machines (SVM) are a popular class of supervised models in machine learning. The associated compute intensive learning algorithm limits their use in real-time applications. This paper presents a fully scalable architecture of a coprocessor, which can compute multiple rows of the kernel matrix in parallel. Further, we propose an extended variant of the popular decomposition technique, sequential minimal optimization, which we call hybrid working set (HWS) algorithm, to effectively utilize the benefits of cached kernel columns and the parallel computational power of the coprocessor. The coprocessor is implemented on Xilinx Virtex 7 field-programmable gate array-based VC707 board and achieves a speedup of upto 25x for kernel computation over single threaded computation on Intel Core i5. An application speedup of upto 15x over software implementation of LIBSVM and speedup of upto 23x over SVMLight is achieved using the HWS algorithm in unison with the coprocessor. The reduction in the number of iterations and sensitivity of the optimization time to variation in cache size using the HWS algorithm are also shown.

A modified approach to numerical solution of Fredholm integral equations of the second kind

A modified approach to obtain approximate numerical solutions of Fredholin integral equations of the second kind is presented. The error bound is explained by the aid of several illustrative examples. In each example, the approximate solution is compared with the exact solution, wherever possible, and an excellent agreement is observed. In addition, the error bound in each example is compared with the one obtained by the Nystrom method. It is found that the error bound of the present method is smaller than the ones obtained by the Nystrom method. Further, the present method is successfully applied to derive the solution of an integral equation arising in a special Dirichlet problem. (C) 2015 Elsevier Inc. All rights reserved.

Imprint of modified Einstein's gravity on white dwarfs: Unifying Type Ia supernovae

We establish the importance of modified Einstein's gravity (MG) in white dwarfs (WDs) for the first time in the literature. We show that MG leads to significantly sub- and super-Chandrasekhar limiting mass WDs, depending on a single model parameter. However, conventional WDs on approaching Chandrasekhar's limit are expected to trigger Type Ia supernovae (SNeIa), a key to unravel the evolutionary history of the universe. Nevertheless, observations of several peculiar, under-and over-luminous SNeIa argue for the limiting mass widely different from Chandrasekhar's limit. Explosions of MG induced sub-and super-Chandrasekhar limiting mass WDs explain under-and over-luminous SNeIa respectively, thus unifying these two apparently disjoint sub-classes. Our discovery questions both the global validity of Einstein's gravity and the uniqueness of Chandrasekhar's limit.

Prior image based temporally constrained reconstruction algorithm for magnetic resonance guided high intensity focused ultrasound

Purpose: A prior image based temporally constrained reconstruction ( PITCR) algorithm was developed for obtaining accurate temperature maps having better volume coverage, and spatial, and temporal resolution than other algorithms for highly undersampled data in magnetic resonance (MR) thermometry. Methods: The proposed PITCR approach is an algorithm that gives weight to the prior image and performs accurate reconstruction in a dynamic imaging environment. The PITCR method is compared with the temporally constrained reconstruction (TCR) algorithm using pork muscle data. Results: The PITCR method provides superior performance compared to the TCR approach with highly undersampled data. The proposed approach is computationally expensive compared to the TCR approach, but this could be overcome by the advantage of reconstructing with fewer measurements. In the case of reconstruction of temperature maps from 16% of fully sampled data, the PITCR approach was 1.57x slower compared to the TCR approach, while the root mean square error using PITCR is 0.784 compared to 2.815 with the TCR scheme. Conclusions: The PITCR approach is able to perform more accurate reconstructions of temperature maps compared to the TCR approach with highly undersampled data in MR guided high intensity focused ultrasound. (C) 2015 American Association of Physicists in Medicine.