Comparison of a priori and a posteriori meshes for singularly perturbed nonlinear parameterized problems

This paper deals with the adaptive mesh generation for singularly perturbed nonlinear parameterized problems with a comparative research study on them. We propose an a posteriori error estimate for singularly perturbed parameterized problems by moving mesh methods with fixed number of mesh points. The well known a priori meshes are compared with the proposed one. The comparison results show that the proposed numerical method is highly effective for the generation of layer adapted a posteriori meshes. A numerical experiment of the error behavior on different meshes is carried out to highlight the comparison of the approximated solutions. (C) 2015 Elsevier B.V. All rights reserved.

Router Attack toward NoC-enabled MPSoC and Monitoring Countermeasures against such Threat

The growing number of applications and processing units in modern Multiprocessor Systems-on-Chips (MPSoCs) come along with reduced time to market. Different IP cores can come from different vendors, and their trust levels are also different, but typically they use Network-on-Chip (NoC) as their communication infrastructure. An MPSoC can have multiple Trusted Execution Environments (TEEs). Apart from performance, power, and area research in the field of MPSoC, robust and secure system design is also gaining importance in the research community. To build a secure system, the designer must know beforehand all kinds of attack possibilities for the respective system (MPSoC). In this paper we survey the possible attack scenarios on present-day MPSoCs and investigate a new attack scenario, i.e., router attack targeted toward NoC architecture. We show the validity of this attack by analyzing different present-day NoC architectures and show that they are all vulnerable to this type of attack. By launching a router attack, an attacker can control the whole chip very easily, which makes it a very serious issue. Both routing tables and routing logic-based routers are vulnerable to such attacks. In this paper, we address attacks on routing tables. We propose different monitoring-based countermeasures against routing table-based router attack in an MPSoC having multiple TEEs. Synthesis results show that proposed countermeasures, viz. Runtime-monitor, Restart-monitor, Intermediate manager, and Auditor, occupy areas that are 26.6, 22, 0.2, and 12.2 % of a routing table-based router area. Apart from these, we propose Ejection address checker and Local monitoring module inside a router that cause 3.4 and 10.6 % increase of a router area, respectively. Simulation results are also given, which shows effectiveness of proposed monitoring-based countermeasures.

Synthetic image super resolution using FeatureMatch

In this paper, we propose a super resolution (SR) method for synthetic images using FeatureMatch. Existing state-of-the-art super resolution methods are learning based methods, where a pair of low-resolution and high-resolution dictionary pair are trained, and this trained pair is used to replace patches in low-resolution image with appropriate matching patches from the high-resolution dictionary. In this paper, we show that by using Approximate Nearest Neighbour Fields (ANNF), and a common source image, we can by-pass the learning phase, and use a single image for dictionary. Thus, reducing the dictionary from a collection obtained from hundreds of training images, to a single image. We show that by modifying the latest developments in ANNF computation, to suit super resolution, we can perform much faster and more accurate SR than existing techniques. To establish this claim we will compare our algorithm against various state-of-the-art algorithms, and show that we are able to achieve better and faster reconstruction without any training phase.

Time scales of the stick-slip dynamics of the peeling of an adhesive tape

The stick-slip dynamics of the peeling of an adhesive tape is characterized by bifurcations that have been experimentally well studied. In this work, we investigate the time scale in which the the stick-slips happen leading to the bifurcations. This is fundamental to understanding the triboluminescence and acoustic emissions associated with the bifurcations. We establish a relationship between the time scale of the bifurcations and the inherent mathematical structure of the peeling dynamics by studying a characteristic time quantity associated with the dynamics.

Human action recognition in H.264/AVC compressed domain using meta-cognitive radial basis function network

In this paper, we propose a H.264/AVC compressed domain human action recognition system with projection based metacognitive learning classifier (PBL-McRBFN). The features are extracted from the quantization parameters and the motion vectors of the compressed video stream for a time window and used as input to the classifier. Since compressed domain analysis is done with noisy, sparse compression parameters, it is a huge challenge to achieve performance comparable to pixel domain analysis. On the positive side, compressed domain allows rapid analysis of videos compared to pixel level analysis. The classification results are analyzed for different values of Group of Pictures (GOP) parameter, time window including full videos. The functional relationship between the features and action labels are established using PBL-McRBFN with a cognitive and meta-cognitive component. The cognitive component is a radial basis function, while the meta-cognitive component employs self-regulation to achieve better performance in subject independent action recognition task. The proposed approach is faster and shows comparable performance with respect to the state-of-the-art pixel domain counterparts. It employs partial decoding, which rules out the complexity of full decoding, and minimizes computational load and memory usage. This results in reduced hardware utilization and increased speed of classification. The results are compared with two benchmark datasets and show more than 90% accuracy using the PBL-McRBFN. The performance for various GOP parameters and group of frames are obtained with twenty random trials and compared with other well-known classifiers in machine learning literature. (C) 2015 Elsevier B.V. All rights reserved.

PLAStiCC: Predictive Look-Ahead Scheduling for Continuous dataflows on Clouds

Scalable stream processing and continuous dataflow systems are gaining traction with the rise of big data due to the need for processing high velocity data in near real time. Unlike batch processing systems such as MapReduce and workflows, static scheduling strategies fall short for continuous dataflows due to the variations in the input data rates and the need for sustained throughput. The elastic resource provisioning of cloud infrastructure is valuable to meet the changing resource needs of such continuous applications. However, multi-tenant cloud resources introduce yet another dimension of performance variability that impacts the application's throughput. In this paper we propose PLAStiCC, an adaptive scheduling algorithm that balances resource cost and application throughput using a prediction-based lookahead approach. It not only addresses variations in the input data rates but also the underlying cloud infrastructure. In addition, we also propose several simpler static scheduling heuristics that operate in the absence of accurate performance prediction model. These static and adaptive heuristics are evaluated through extensive simulations using performance traces obtained from Amazon AWS IaaS public cloud. Our results show an improvement of up to 20% in the overall profit as compared to the reactive adaptation algorithm.

Co-Exploration of NLA Kernels and Specification of Compute Elements in Distributed Memory CGRAs

Coarse Grained Reconfigurable Architectures (CGRA) are emerging as embedded application processing units in computing platforms for Exascale computing. Such CGRAs are distributed memory multi- core compute elements on a chip that communicate over a Network-on-chip (NoC). Numerical Linear Algebra (NLA) kernels are key to several high performance computing applications. In this paper we propose a systematic methodology to obtain the specification of Compute Elements (CE) for such CGRAs. We analyze block Matrix Multiplication and block LU Decomposition algorithms in the context of a CGRA, and obtain theoretical bounds on communication requirements, and memory sizes for a CE. Support for high performance custom computations common to NLA kernels are met through custom function units (CFUs) in the CEs. We present results to justify the merits of such CFUs.

Synthesis of Instruction Extensions on HyperCell, a Reconfigurable Datapath

In this paper we present HyperCell as a reconfigurable datapath for Instruction Extensions (IEs). HyperCell comprises an array of compute units laid over a switch network. We present an IE synthesis methodology that enables post-silicon realization of IE datapaths on HyperCell. The synthesis methodology optimally exploits hardware resources in HyperCell to enable software pipelined execution of IEs. Exploitation of temporal reuse of data in HyperCell results in significant reduction of input/output bandwidth requirements of HyperCell.

Active learning in keyword search-based data integration

The problem of scaling up data integration, such that new sources can be quickly utilized as they are discovered, remains elusive: Global schemas for integrated data are difficult to develop and expand, and schema and record matching techniques are limited by the fact that data and metadata are often under-specified and must be disambiguated by data experts. One promising approach is to avoid using a global schema, and instead to develop keyword search-based data integration-where the system lazily discovers associations enabling it to join together matches to keywords, and return ranked results. The user is expected to understand the data domain and provide feedback about answers' quality. The system generalizes such feedback to learn how to correctly integrate data. A major open challenge is that under this model, the user only sees and offers feedback on a few ``top-'' results: This result set must be carefully selected to include answers of high relevance and answers that are highly informative when feedback is given on them. Existing systems merely focus on predicting relevance, by composing the scores of various schema and record matching algorithms. In this paper, we show how to predict the uncertainty associated with a query result's score, as well as how informative feedback is on a given result. We build upon these foundations to develop an active learning approach to keyword search-based data integration, and we validate the effectiveness of our solution over real data from several very different domains.

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.

Compressed domain human action recognition in H.264/AVC video streams

This paper discusses a novel high-speed approach for human action recognition in H.264/AVC compressed domain. The proposed algorithm utilizes cues from quantization parameters and motion vectors extracted from the compressed video sequence for feature extraction and further classification using Support Vector Machines (SVM). The ultimate goal of the proposed work is to portray a much faster algorithm than pixel domain counterparts, with comparable accuracy, utilizing only the sparse information from compressed video. Partial decoding rules out the complexity of full decoding, and minimizes computational load and memory usage, which can result in reduced hardware utilization and faster recognition results. The proposed approach can handle illumination changes, scale, and appearance variations, and is robust to outdoor as well as indoor testing scenarios. We have evaluated the performance of the proposed method on two benchmark action datasets and achieved more than 85 % accuracy. The proposed algorithm classifies actions with speed (> 2,000 fps) approximately 100 times faster than existing state-of-the-art pixel-domain algorithms.

SeamSeg: Video Object Segmentation using Patch Seams

In this paper, we propose a technique for video object segmentation using patch seams across frames. Typically, seams, which are connected paths of low energy, are utilised for retargeting, where the primary aim is to reduce the image size while preserving the salient image contents. Here, we adapt the formulation of seams for temporal label propagation. The energy function associated with the proposed video seams provides temporal linking of patches across frames, to accurately segment the object. The proposed energy function takes into account the similarity of patches along the seam, temporal consistency of motion and spatial coherency of seams. Label propagation is achieved with high fidelity in the critical boundary regions, utilising the proposed patch seams. To achieve this without additional overheads, we curtail the error propagation by formulating boundary regions as rough-sets. The proposed approach out-perform state-of-the-art supervised and unsupervised algorithms, on benchmark datasets.

Mass spectrometry based characterization of Hb Beckman variant in a falsely elevated HbA(1c) sample

Glycated hemoglobin (HbA(1c)) is a `gold standard' biomarker for assessing the glycemic index of an individual. HbA(1c) is formed due to nonenzymatic glycosylation at N-terminal valine residue of the P-globin chain. Cation exchange based high performance liquid chromatography (CE HPLC) is mostly used to quantify HbA(1c), in blood sample. A few genetic variants of hemoglobin and post-translationally modified variants of hemoglobin interfere with CE HPLC-based quantification,. resulting in its false positive estimation. Using mass spectrometry, we analyzed a blood sample with abnormally high HbA(1c) (52.1%) in the CE HPLC method. The observed HbA(1c) did not corroborate the blood glucose level of the patient. A mass spectrometry based bottom up proteomics approach, intact globin chain mass analysis, and chemical modification of the proteolytic peptides identified the presence of Hb Beckman, a genetic variant of hemoglobin, in the experimental sample. A similar surface area to charge ratio between HbA(1c) and Hb Beckman might have resulted in the coelution of the variant with HbA(1c) in CE HPLC. Therefore, in the screening of diabetes mellitus through the estimation of HbA(1c), it is important to look for genetic variants of hemoglobin in samples that show abnormally high glycemic index, and HbA(1c) must be estimated using an alternative method. (C) 2015 Elsevier Inc. All rights reserved.

Simulations of impinging droplets with surfactant-dependent dynamic contact angle

An arbitrary Lagrangian-Eulerian (ALE) finite element scheme for computations of soluble surfactant droplet impingement on a horizontal surface is presented. The numerical scheme solves the time-dependent Navier-Stokes equations for the fluid flow, scalar convection-diffusion equation for the surfactant transport in the bulk phase, and simultaneously, surface evolution equations for the surfactants on the free surface and on the liquid-solid interface. The effects of surfactants on the flow dynamics are included into the model through the surface tension and surfactant-dependent dynamic contact angle. In particular, the dynamic contact angle (theta(d)) of the droplet is defined as a function of the surfactant concentration at the contact line and the equilibrium contact angle (theta(0)(e)) of the clean surface using the nonlinear equation of state for surface tension. Further, the surface forces are included into the model as surface divergence of the surface stress tensor that allows to incorporate the Marangoni effects without calculating the surface gradient of the surfactant concentration on the free surface. In addition to a mesh convergence study and validation of the numerical results with experiments, the effects of adsorption and desorption surfactant coefficients on the flow dynamics in wetting, partially wetting and non-wetting droplets are studied in detail. It is observed that the effects of surfactants are more in wetting droplets than in the non-wetting droplets. Further, the presence of surfactants at the contact line reduces the equilibrium contact angle further when theta(0)(e) is less than 90 degrees, and increases it further when theta(0)(e) is greater than 90 degrees. Nevertheless, the presence of surfactants has no effect on the contact angle when theta(0)(e) = 90 degrees. The numerical study clearly demonstrates that the surfactant-dependent contact angle has to be considered, in addition to the Marangoni effect, in order to study the flow dynamics and the equilibrium states of surfactant droplet impingement accurately. The proposed numerical scheme guarantees the conservation of fluid mass and of the surfactant mass accurately. (C) 2015 Elsevier Inc. All rights reserved.