Catalog footprint

What is connected

33works
26topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

33 published item(s)

preprint2026arXiv

Image Synthesis Using Spintronic Deep Convolutional Generative Adversarial Network

The computational requirements of generative adversarial networks (GANs) exceed the limit of conventional Von Neumann architectures, necessitating energy efficient alternatives such as neuromorphic spintronics. This work presents a hybrid CMOS-spintronic deep convolutional generative adversarial network (DCGAN) architecture for synthetic image generation. The proposed generative vision model approach follows the standard framework, leveraging generator and discriminators adversarial training with our designed spintronics hardware for deconvolution, convolution, and activation layers of the DCGAN architecture. To enable hardware aware spintronic implementation, the generator's deconvolution layers are restructured as zero padded convolution, allowing seamless integration with a 6-bit skyrmion based synapse in a crossbar, without compromising training performance. Nonlinear activation functions are implemented using a hybrid CMOS domain wall based Rectified linear unit (ReLU) and Leaky ReLU units. Our proposed tunable Leaky ReLU employs domain wall position coded, continuous resistance states and a piecewise uniaxial parabolic anisotropy profile with a parallel MTJ readout, exhibiting energy consumption of 0.192 pJ. Our spintronic DCGAN model demonstrates adaptability across both grayscale and colored datasets, achieving Fr'echet Inception Distances (FID) of 27.5 for the Fashion MNIST and 45.4 for Anime Face datasets, with testing energy (training energy) of 4.9 nJ (14.97~nJ/image) and 24.72 nJ (74.7 nJ/image).

preprint2026arXiv

IndIGO-D: Probing Compact Binary Coalescences in the Decihertz GW Band

We study IndIGO-D, a decihertz gravitational-wave mission concept, focusing on a specific configuration in which three spacecraft fly in formation to form an L-shaped interferometer in a heliocentric orbit. The two orthogonal arms share a common vertex, providing a space-based analogue of terrestrial Michelson detectors, while operating in an optimised configuration that yields ppm-level arm-length stability. Assuming 1000 km arm length, we analyse the orbital motion and antenna response, and assess sensitivity across the [0.1 - 10] Hz band bridging LISA and next-generation ground-based interferometers. Using fiducial sensitivity curves provided by the IndIGO-D collaboration, we compute horizon distances for different source classes. Intermediate-mass black-hole binaries with masses $10^{2}$ - $10^{3} \, M_\odot$ are detectable to redshifts $z \sim 10^{3}$, complementing the reach of LISA and terrestrial detectors. Binary neutron star systems are observable to a horizon distance of $z \lesssim 0.3$, allowing continuous multi-band coverage with Voyager-class interferometers from the decihertz regime to merger. A Bayesian parameter-estimation study of a GW170817-like binary shows that the sky localization area improves from $\sim 21 \,\mathrm{deg}^2$ at one month to $0.3 \,\mathrm{deg}^2$ at six hours pre-merger! These sky areas are readily tiled by wide-field time-domain telescopes such as the Rubin Observatory, whose $9.6 \,\mathrm{deg}^2$ field of view and r-band depth enable high-cadence, repeated coverage of GW170817-like kilonovae at this distance and beyond. IndIGO-D exploits the rapid evolution of binaries in the decihertz band to bridge the gap between millihertz and terrestrial observations, enabling early warnings on timescales from months to hours and enhancing the prospects for multi-band and multi-messenger discoveries.

preprint2026arXiv

Quantifying Potential Observation Missingness in Inverse Reinforcement Learning

Inverse reinforcement learning (IRL), which infers reward functions from demonstrations, is a valuable tool for modeling and understanding decision-making behavior. Many variants of IRL have been developed to capture complexities of human decision-making, such as subjective beliefs, imperfect planning, and dynamic goals. However, an often-overlooked issue in real-world behavioral datasets is that the recorded data may be missing observations that were available to the original decision-maker. In use-inspired settings such as healthcare, this can make expert actions appear suboptimal, even when they were near-optimal given the information available at the time. As a result, the rewards learned by standard IRL may be misleading. In this paper, we identify the minimal perturbations to the recorded observations needed for the expert's actions to appear optimal. We develop a practical algorithm for this problem and demonstrate its utility for quantifying the possible extent of missing observations in behavioral datasets through extensive experiments on synthetic navigation tasks, a cancer treatment simulator, and ICU treatment data.

preprint2022arXiv

A Joint Learning Approach for Semi-supervised Neural Topic Modeling

Topic models are some of the most popular ways to represent textual data in an interpret-able manner. Recently, advances in deep generative models, specifically auto-encoding variational Bayes (AEVB), have led to the introduction of unsupervised neural topic models, which leverage deep generative models as opposed to traditional statistics-based topic models. We extend upon these neural topic models by introducing the Label-Indexed Neural Topic Model (LI-NTM), which is, to the extent of our knowledge, the first effective upstream semi-supervised neural topic model. We find that LI-NTM outperforms existing neural topic models in document reconstruction benchmarks, with the most notable results in low labeled data regimes and for data-sets with informative labels; furthermore, our jointly learned classifier outperforms baseline classifiers in ablation studies.

preprint2022arXiv

A Probabilistic Chemical Programmable Computer

The exponential growth of the power of modern digital computers is based upon the miniaturisation of vast nanoscale arrays of electronic switches, but this will be eventually constrained by fabrication limits and power dissipation. Chemical processes have the potential to scale beyond these limits performing computations through chemical reactions, yet the lack of well-defined programmability limits their scalability and performance. We present a hybrid digitally programmable chemical array as a probabilistic computational machine that uses chemical oscillators partitioned in interconnected cells as a computational substrate. This hybrid architecture performs efficient computation by distributing between chemical and digital domains together with error correction. The efficiency is gained by combining digital with probabilistic chemical logic based on nearest neighbour interactions and hysteresis effects. We demonstrated the implementation of one- and two- dimensional Chemical Cellular Automata and solutions to combinatorial optimization problems.

preprint2022arXiv

Joint Symmetry Detection and Shape Matching for Non-Rigid Point Cloud

Despite the success of deep functional maps in non-rigid 3D shape matching, there exists no learning framework that models both self-symmetry and shape matching simultaneously. This is despite the fact that errors due to symmetry mismatch are a major challenge in non-rigid shape matching. In this paper, we propose a novel framework that simultaneously learns both self symmetry as well as a pairwise map between a pair of shapes. Our key idea is to couple a self symmetry map and a pairwise map through a regularization term that provides a joint constraint on both of them, thereby, leading to more accurate maps. We validate our method on several benchmarks where it outperforms many competitive baselines on both tasks.

preprint2022arXiv

Preserving Privacy in Federated Learning with Ensemble Cross-Domain Knowledge Distillation

Federated Learning (FL) is a machine learning paradigm where local nodes collaboratively train a central model while the training data remains decentralized. Existing FL methods typically share model parameters or employ co-distillation to address the issue of unbalanced data distribution. However, they suffer from communication bottlenecks. More importantly, they risk privacy leakage. In this work, we develop a privacy preserving and communication efficient method in a FL framework with one-shot offline knowledge distillation using unlabeled, cross-domain public data. We propose a quantized and noisy ensemble of local predictions from completely trained local models for stronger privacy guarantees without sacrificing accuracy. Based on extensive experiments on image classification and text classification tasks, we show that our privacy-preserving method outperforms baseline FL algorithms with superior performance in both accuracy and communication efficiency.

preprint2022arXiv

Real-time Recognition of Yoga Poses using computer Vision for Smart Health Care

Nowadays, yoga has become a part of life for many people. Exercises and sports technological assistance is implemented in yoga pose identification. In this work, a self-assistance based yoga posture identification technique is developed, which helps users to perform Yoga with the correction feature in Real-time. The work also presents Yoga-hand mudra (hand gestures) identification. The YOGI dataset has been developed which include 10 Yoga postures with around 400-900 images of each pose and also contain 5 mudras for identification of mudras postures. It contains around 500 images of each mudra. The feature has been extracted by making a skeleton on the body for yoga poses and hand for mudra poses. Two different algorithms have been used for creating a skeleton one for yoga poses and the second for hand mudras. Angles of the joints have been extracted as a features for different machine learning and deep learning models. among all the models XGBoost with RandomSearch CV is most accurate and gives 99.2\% accuracy. The complete design framework is described in the present paper.

preprint2022arXiv

Recent results with radiation-tolerant TowerJazz 180 nm MALTA Sensors

To achieve the physics goals of future colliders, it is necessary to develop novel, radiation-hard silicon sensors for their tracking detectors. We target the replacement of hybrid pixel detectors with Depleted Monolithic Active Pixel Sensors (DMAPS) that are radiation-hard, monolithic CMOS sensors. We have designed, manufactured and tested the MALTA series of sensors, which are DMAPS in the 180 nm TowerJazz CMOS imaging technology. MALTA have a pixel pitch well below current hybrid pixel detectors, high time resolution (< 2 ns) and excellent charge collection efficiency across pixel geometries. These sensors have a total silicon thickness of between 50-300 $μ$m, implying reduced material budgets and multiple scattering rates for future detectors which utilize such technology. Furthermore, their monolithic design bypasses the costly stage of bump-bonding in hybrid sensors and can substantially reduce detector costs. This contribution presents the latest results from characterization studies of the MALTA2 sensors, including results demonstrating the radiation tolerance of these sensors.

preprint2021arXiv

Matrix Decomposition on Graphs: A Functional View

We propose a functional view of matrix decomposition problems on graphs such as geometric matrix completion and graph regularized dimensionality reduction. Our unifying framework is based on the key idea that using a reduced basis to represent functions on the product space is sufficient to recover a low rank matrix approximation even from a sparse signal. We validate our framework on several real and synthetic benchmarks (for both problems) where it either outperforms state of the art or achieves competitive results at a fraction of the computational effort of prior work.

preprint2021arXiv

Scale Normalized Image Pyramids with AutoFocus for Object Detection

We present an efficient foveal framework to perform object detection. A scale normalized image pyramid (SNIP) is generated that, like human vision, only attends to objects within a fixed size range at different scales. Such a restriction of objects' size during training affords better learning of object-sensitive filters, and therefore, results in better accuracy. However, the use of an image pyramid increases the computational cost. Hence, we propose an efficient spatial sub-sampling scheme which only operates on fixed-size sub-regions likely to contain objects (as object locations are known during training). The resulting approach, referred to as Scale Normalized Image Pyramid with Efficient Resampling or SNIPER, yields up to 3 times speed-up during training. Unfortunately, as object locations are unknown during inference, the entire image pyramid still needs processing. To this end, we adopt a coarse-to-fine approach, and predict the locations and extent of object-like regions which will be processed in successive scales of the image pyramid. Intuitively, it's akin to our active human-vision that first skims over the field-of-view to spot interesting regions for further processing and only recognizes objects at the right resolution. The resulting algorithm is referred to as AutoFocus and results in a 2.5-5 times speed-up during inference when used with SNIP.

preprint2020arXiv

ASAP-NMS: Accelerating Non-Maximum Suppression Using Spatially Aware Priors

The widely adopted sequential variant of Non Maximum Suppression (or Greedy-NMS) is a crucial module for object-detection pipelines. Unfortunately, for the region proposal stage of two/multi-stage detectors, NMS is turning out to be a latency bottleneck due to its sequential nature. In this article, we carefully profile Greedy-NMS iterations to find that a major chunk of computation is wasted in comparing proposals that are already far-away and have a small chance of suppressing each other. We address this issue by comparing only those proposals that are generated from nearby anchors. The translation-invariant property of the anchor lattice affords generation of a lookup table, which provides an efficient access to nearby proposals, during NMS. This leads to an Accelerated NMS algorithm which leverages Spatially Aware Priors, or ASAP-NMS, and improves the latency of the NMS step from 13.6ms to 1.2 ms on a CPU without sacrificing the accuracy of a state-of-the-art two-stage detector on COCO and VOC datasets. Importantly, ASAP-NMS is agnostic to image resolution and can be used as a simple drop-in module during inference. Using ASAP-NMS at run-time only, we obtain an mAP of 44.2\%@25Hz on the COCO dataset with a V100 GPU.

preprint2020arXiv

Communication and networking technologies for UAVs: A survey

With the advancement in drone technology, in just a few years, drones will be assisting humans in every domain. But there are many challenges to be tackled, communication being the chief one. This paper aims at providing insights into the latest UAV (Unmanned Aerial Vehicle) communication technologies through investigation of suitable task modules, antennas, resource handling platforms, and network architectures. Additionally, we explore techniques such as machine learning and path planning to enhance existing drone communication methods. Encryption and optimization techniques for ensuring long lasting and secure communications, as well as for power management, are discussed. Moreover, applications of UAV networks for different contextual uses ranging from navigation to surveillance, URLLC (Ultra reliable and low latency communications), edge computing and work related to artificial intelligence are examined. In particular, the intricate interplay between UAV, advanced cellular communication, and internet of things constitutes one of the focal points of this paper. The survey encompasses lessons learned, insights, challenges, open issues, and future directions in UAV communications. Our literature review reveals the need for more research work on drone to drone and drone to device communications.

preprint2020arXiv

Deep Geometric Functional Maps: Robust Feature Learning for Shape Correspondence

We present a novel learning-based approach for computing correspondences between non-rigid 3D shapes. Unlike previous methods that either require extensive training data or operate on handcrafted input descriptors and thus generalize poorly across diverse datasets, our approach is both accurate and robust to changes in shape structure. Key to our method is a feature-extraction network that learns directly from raw shape geometry, combined with a novel regularized map extraction layer and loss, based on the functional map representation. We demonstrate through extensive experiments in challenging shape matching scenarios that our method can learn from less training data than existing supervised approaches and generalizes significantly better than current descriptor-based learning methods. Our source code is available at: https://github.com/LIX-shape-analysis/GeomFmaps.

preprint2020arXiv

Listwise Learning to Rank with Deep Q-Networks

Learning to Rank is the problem involved with ranking a sequence of documents based on their relevance to a given query. Deep Q-Learning has been shown to be a useful method for training an agent in sequential decision making. In this paper, we show that DeepQRank, our deep q-learning to rank agent, demonstrates performance that can be considered state-of-the-art. Though less computationally efficient than a supervised learning approach such as linear regression, our agent has fewer limitations in terms of which format of data it can use for training and evaluation. We run our algorithm against Microsoft's LETOR listwise dataset and achieve an NDCG@1 (ranking accuracy in the range [0,1]) of 0.5075, narrowly beating out the leading supervised learning model, SVMRank (0.4958).

preprint2020arXiv

Multiview-Consistent Semi-Supervised Learning for 3D Human Pose Estimation

The best performing methods for 3D human pose estimation from monocular images require large amounts of in-the-wild 2D and controlled 3D pose annotated datasets which are costly and require sophisticated systems to acquire. To reduce this annotation dependency, we propose Multiview-Consistent Semi Supervised Learning (MCSS) framework that utilizes similarity in pose information from unannotated, uncalibrated but synchronized multi-view videos of human motions as additional weak supervision signal to guide 3D human pose regression. Our framework applies hard-negative mining based on temporal relations in multi-view videos to arrive at a multi-view consistent pose embedding. When jointly trained with limited 3D pose annotations, our approach improves the baseline by 25% and state-of-the-art by 8.7%, whilst using substantially smaller networks. Lastly, but importantly, we demonstrate the advantages of the learned embedding and establish view-invariant pose retrieval benchmarks on two popular, publicly available multi-view human pose datasets, Human 3.6M and MPI-INF-3DHP, to facilitate future research.

preprint2020arXiv

OpenEDS2020: Open Eyes Dataset

We present the second edition of OpenEDS dataset, OpenEDS2020, a novel dataset of eye-image sequences captured at a frame rate of 100 Hz under controlled illumination, using a virtual-reality head-mounted display mounted with two synchronized eye-facing cameras. The dataset, which is anonymized to remove any personally identifiable information on participants, consists of 80 participants of varied appearance performing several gaze-elicited tasks, and is divided in two subsets: 1) Gaze Prediction Dataset, with up to 66,560 sequences containing 550,400 eye-images and respective gaze vectors, created to foster research in spatio-temporal gaze estimation and prediction approaches; and 2) Eye Segmentation Dataset, consisting of 200 sequences sampled at 5 Hz, with up to 29,500 images, of which 5% contain a semantic segmentation label, devised to encourage the use of temporal information to propagate labels to contiguous frames. Baseline experiments have been evaluated on OpenEDS2020, one for each task, with average angular error of 5.37 degrees when performing gaze prediction on 1 to 5 frames into the future, and a mean intersection over union score of 84.1% for semantic segmentation. As its predecessor, OpenEDS dataset, we anticipate that this new dataset will continue creating opportunities to researchers in eye tracking, machine learning and computer vision communities, to advance the state of the art for virtual reality applications. The dataset is available for download upon request at http://research.fb.com/programs/openeds-2020-challenge/.

preprint2020arXiv

Price Optimization in Fashion E-commerce

With the rapid growth in the fashion e-commerce industry, it is becoming extremely challenging for the E-tailers to set an optimal price point for all the products on the platform. By establishing an optimal price point, they can maximize overall revenue and profit for the platform. In this paper, we propose a novel machine learning and optimization technique to find the optimal price point at an individual product level. It comprises three major components. Firstly, we use a demand prediction model to predict the next day demand for each product at a certain discount percentage. Next step, we use the concept of price elasticity of demand to get the multiple demand values by varying the discount percentage. Thus we obtain multiple price demand pairs for each product and we have to choose one of them for the live platform. Typically fashion e-commerce has millions of products, so there can be many permutations. Each permutation will assign a unique price point for all the products, which will sum up to a unique revenue number. To choose the best permutation which gives maximum revenue, a linear programming optimization technique is used. We have deployed the above methods in the live production environment and conducted several AB tests. According to the AB test result, our model is improving the revenue by 1 percent and gross margin by 0.81 percent.

preprint2020arXiv

The ABC130 barrel module prototyping programme for the ATLAS strip tracker

For the Phase-II Upgrade of the ATLAS Detector, its Inner Detector, consisting of silicon pixel, silicon strip and transition radiation sub-detectors, will be replaced with an all new 100 % silicon tracker, composed of a pixel tracker at inner radii and a strip tracker at outer radii. The future ATLAS strip tracker will include 11,000 silicon sensor modules in the central region (barrel) and 7,000 modules in the forward region (end-caps), which are foreseen to be constructed over a period of 3.5 years. The construction of each module consists of a series of assembly and quality control steps, which were engineered to be identical for all production sites. In order to develop the tooling and procedures for assembly and testing of these modules, two series of major prototyping programs were conducted: an early program using readout chips designed using a 250 nm fabrication process (ABCN-25) and a subsequent program using a follow-up chip set made using 130 nm processing (ABC130 and HCC130 chips). This second generation of readout chips was used for an extensive prototyping program that produced around 100 barrel-type modules and contributed significantly to the development of the final module layout. This paper gives an overview of the components used in ABC130 barrel modules, their assembly procedure and findings resulting from their tests.

preprint2020arXiv

Towards Automatic Generation of Questions from Long Answers

Automatic question generation (AQG) has broad applicability in domains such as tutoring systems, conversational agents, healthcare literacy, and information retrieval. Existing efforts at AQG have been limited to short answer lengths of up to two or three sentences. However, several real-world applications require question generation from answers that span several sentences. Therefore, we propose a novel evaluation benchmark to assess the performance of existing AQG systems for long-text answers. We leverage the large-scale open-source Google Natural Questions dataset to create the aforementioned long-answer AQG benchmark. We empirically demonstrate that the performance of existing AQG methods significantly degrades as the length of the answer increases. Transformer-based methods outperform other existing AQG methods on long answers in terms of automatic as well as human evaluation. However, we still observe degradation in the performance of our best performing models with increasing sentence length, suggesting that long answer QA is a challenging benchmark task for future research.

preprint2019arXiv

Combined collider constraints on neutralinos and charginos

Searches for supersymmetric electroweakinos have entered a crucial phase, as the integrated luminosity of the Large Hadron Collider is now high enough to compensate for their weak production cross-sections. Working in a framework where the neutralinos and charginos are the only light sparticles in the Minimal Supersymmetric Standard Model, we use gambit to perform a detailed likelihood analysis of the electroweakino sector. We focus on the impacts of recent ATLAS and CMS searches with 36 fb$^{-1}$ of 13 TeV proton-proton collision data. We also include constraints from LEP and invisible decays of the $Z$ and Higgs bosons. Under the background-only hypothesis, we show that current LHC searches do not robustly exclude any range of neutralino or chargino masses. However, a pattern of excesses in several LHC analyses points towards a possible signal, with neutralino masses of $(m_{\tildeχ_1^0}, m_{\tildeχ_2^0}, m_{\tildeχ_3^0}, m_{\tildeχ_4^0})$ = (8-155, 103-260, 130-473, 219-502) GeV and chargino masses of $(m_{\tildeχ_1^{\pm}}, m_{\tildeχ_2^{\pm}})$ = (104-259, 224-507) GeV at the 95% confidence level. The lightest neutralino is mostly bino, with a possible modest Higgsino or wino component. We find that this excess has a combined local significance of $3.3σ$, subject to a number of cautions. If one includes LHC searches for charginos and neutralinos conducted with 8 TeV proton-proton collision data, the local significance is lowered to 2.9$σ$. We briefly consider the implications for dark matter, finding that the correct relic density can be obtained through the Higgs-funnel and $Z$-funnel mechanisms, even assuming that all other sparticles are decoupled. All samples, gambit input files and best-fit models from this study are available on Zenodo.

preprint2019arXiv

Giant enhancement of Piezo-resistance in ballistic graphene due to transverse electric fields

We investigate the longitudinal and transverse piezoresistance effect in suspended graphene in the ballistic regime. Utilizing parametrized tight binding Hamiltonian from ab initio calculations along with Landauer quantum transport formalism, we devise a methodology to evaluate the piezoresistance effect in 2D materials especially in graphene. We evaluate the longitudinal and transverse gauge factor of graphene along armchair and zigzag directions in the linear elastic limit ($0\%$-$10\%$). The longitudinal and transverse gauge factors are identical along armchair and zigzag directions. Our model predicts a significant variation ($\approx 1000\% $ change) in transverse gauge factor compared to longitudinal gauge factor along with sign inversion. The calculated value of longitudinal gauge factor is $\approx 0.3$ whereas the transverse gauge factor is $\approx -3.3$. We rationalize our prediction using deformation of Dirac cone and change in separation between transverse modes due to longitudinal and transverse strain, leading to an inverse change in gauge factor. The results obtained herein may serve as a template for high strain piezoresistance effect of graphene in nano electromechanical systems.

preprint2019arXiv

Measurement of the relative response of TowerJazz Mini-MALTA CMOS prototypes at Diamond Light Source

This paper outlines the results of investigations into the effects of radiation damage in the mini-MALTA prototype. Measurements were carried out at Diamond Light Source using a micro-focus X-ray beam, which scanned across the surface of the device in 2 $\mathrm{μm}$ steps. This allowed the in-pixel photon response to be measured directly with high statistics. Three pixel design variations were considered: one with the standard continuous $\mathrm{n^-}$ layer layout and front-end, and extra deep p-well and $\mathrm{n^-}$ gap designs with a modified front-end. Five chips were measured: one unirradiated, one neutron irradiated, and three proton irradiated.

preprint2016arXiv

Composites of FeCl3 and TiO2 with Bismaleimide resins

Ferric Chloride-Bismaleimide (FeCl3-BMI) and Titania-Bismaleimide (TiO2-BMI) composite were synthesized using PVA as a binder. The composite systems were deposited on glass slide as a homogenous coating. XRD and FTIR studies of the composite system showed its crystalline and structural configuration. A mixed phase of TiO2 and BMI as well as short range crystallinity was observed. An increase in crystallinity with temperature was also seen. The percentage of N-H symmetric stretching was also found to increase with temperature.

preprint2016arXiv

Controlling Search in Very large Commonsense Knowledge Bases: A Machine Learning Approach

Very large commonsense knowledge bases (KBs) often have thousands to millions of axioms, of which relatively few are relevant for answering any given query. A large number of irrelevant axioms can easily overwhelm resolution-based theorem provers. Therefore, methods that help the reasoner identify useful inference paths form an essential part of large-scale reasoning systems. In this paper, we describe two ordering heuristics for optimization of reasoning in such systems. First, we discuss how decision trees can be used to select inference steps that are more likely to succeed. Second, we identify a small set of problem instance features that suffice to guide searches away from intractable regions of the search space. We show the efficacy of these techniques via experiments on thousands of queries from the Cyc KB. Results show that these methods lead to an order of magnitude reduction in inference time.

preprint2016arXiv

On the Design of MAC Protocol and Transmission Scheduling for Internet of Things

With the ubiquitous sensing enabled by wireless sensor network technologies, Internet of Things (IoT) is developed to many areas of modern day living. The inexpensive IoT devices and platforms capable of wireless communications enable the ability to measure, infer and understand environmental indicators, from delicate ecologies and natural resources to urban environments. In this paper, we firstly investigate a scalable multimode-based MAC protocol, IoT-MAC, which consists of a channel contention period and a data transmission period, to reduce contention of channel access due to coexist of many IoT devices. Secondly, we study a data transmission scheduling algorithm to maximise data collection under the constraints of radio link quality and remaining energy of the IoT node, while ensuring a fair access to the radio channel. To study the performance of data reception rate, packet loss rate and latency, we evaluate the IoT-MAC and scheduling algorithm with varying data rate and different network scale.

preprint2016arXiv

Substrate effect and nanoindentation fracture toughness based on pile up and failure

The effect of substrate was studied using nanoindentation on thin films. Soft films on hard substrate showed more pile up than usual which was attributed to the dislocation pile up at the film substrate interface. The effect of tip blunting on the load depth and hardness plots of nanoindentation was shown. The experimental date of variation of Vickers hardness with film thickness and loads were fitted and new parameters were analyzed. The delaminated area was analyzed using geometrical shapes using optical view of the failure region along with the load displacement Indentation fracture using Nanoindentation using Berkovich indenter has been studied. Indentation fracture toughness (KR) was analyzed based on computational programs. The contact mechanics during nanoindentation was studied with parameters related to indenter shape and tip sharpness. Elastic, plastic and total energies were computationally determined. The energy difference was related to shear stress being generated with elastic to plastic transition. Change in the nature of residual stress was related to film thickness.

preprint2016arXiv

Ultra-sensitive nanoscale magnetic field sensors based on resonant spin filtering

Solid state magnetic field sensors based on magneto-resistance modulation find direct applications in communication devices, specifically in proximity detection, rotational reference detection and current sensing. In this work, we propose sensor structures based on the magneto-resistance physics of resonant spin-filtering and present device designs catered toward exceptional magnetic field sensing capabilities. Using the non-equilibrium Green's function spin transport formalism self consistently coupled to the Poisson's equation, we present highly-tunable pentalayer magnetic tunnel junction structures that are capable of exhibiting an ultra-high peak tunnel magneto resistance $(\approx 2500 \%$). We show how this translates to device designs featuring an ultra-high current sensitivity enhancement of over 300\% in comparison with typical trilayer MTJ sensors, and a wider tunable range of field sensitivity. We also demonstrate that a dynamic variation in sensor functionalities with the structural landscape enables a superior design flexibility over typical trilayer sensors. An optimal design exhibiting close to a 700\% sensitivity increase as a result of angle dependent spin filtering is then presented.This work sets a stage to engineer spintronic building blocks via the design of functional structures tailored to exhibit ultra-sensitive spin filtering.

preprint2016arXiv

VConv-DAE: Deep Volumetric Shape Learning Without Object Labels

With the advent of affordable depth sensors, 3D capture becomes more and more ubiquitous and already has made its way into commercial products. Yet, capturing the geometry or complete shapes of everyday objects using scanning devices (e.g. Kinect) still comes with several challenges that result in noise or even incomplete shapes. Recent success in deep learning has shown how to learn complex shape distributions in a data-driven way from large scale 3D CAD Model collections and to utilize them for 3D processing on volumetric representations and thereby circumventing problems of topology and tessellation. Prior work has shown encouraging results on problems ranging from shape completion to recognition. We provide an analysis of such approaches and discover that training as well as the resulting representation are strongly and unnecessarily tied to the notion of object labels. Thus, we propose a full convolutional volumetric auto encoder that learns volumetric representation from noisy data by estimating the voxel occupancy grids. The proposed method outperforms prior work on challenging tasks like denoising and shape completion. We also show that the obtained deep embedding gives competitive performance when used for classification and promising results for shape interpolation.

preprint2015arXiv

Deep Hierarchical Parsing for Semantic Segmentation

This paper proposes a learning-based approach to scene parsing inspired by the deep Recursive Context Propagation Network (RCPN). RCPN is a deep feed-forward neural network that utilizes the contextual information from the entire image, through bottom-up followed by top-down context propagation via random binary parse trees. This improves the feature representation of every super-pixel in the image for better classification into semantic categories. We analyze RCPN and propose two novel contributions to further improve the model. We first analyze the learning of RCPN parameters and discover the presence of bypass error paths in the computation graph of RCPN that can hinder contextual propagation. We propose to tackle this problem by including the classification loss of the internal nodes of the random parse trees in the original RCPN loss function. Secondly, we use an MRF on the parse tree nodes to model the hierarchical dependency present in the output. Both modifications provide performance boosts over the original RCPN and the new system achieves state-of-the-art performance on Stanford Background, SIFT-Flow and Daimler urban datasets.

preprint2015arXiv

Time Critical Multitasking for Multicore Microcontroller using XMOS Kit

This paper presents the research work on multicore microcontrollers using parallel, and time critical programming for the embedded systems. Due to the high complexity and limitations, it is very hard to work on the application development phase on such architectures. The experimental results mentioned in the paper are based on xCORE multicore microcontroller form XMOS. The paper also imitates multi-tasking and parallel programming for the same platform. The tasks assigned to multiple cores are executed simultaneously, which saves the time and energy. The relative study for multicore processor and multicore controller concludes that micro architecture based controller having multiple cores illustrates better performance in time critical multi-tasking environment. The research work mentioned here not only illustrates the functionality of multicore microcontroller, but also express the novel technique of programming, profiling and optimization on such platforms in real time environments.

preprint2014arXiv

Locally Scale-Invariant Convolutional Neural Networks

Convolutional Neural Networks (ConvNets) have shown excellent results on many visual classification tasks. With the exception of ImageNet, these datasets are carefully crafted such that objects are well-aligned at similar scales. Naturally, the feature learning problem gets more challenging as the amount of variation in the data increases, as the models have to learn to be invariant to certain changes in appearance. Recent results on the ImageNet dataset show that given enough data, ConvNets can learn such invariances producing very discriminative features [1]. But could we do more: use less parameters, less data, learn more discriminative features, if certain invariances were built into the learning process? In this paper we present a simple model that allows ConvNets to learn features in a locally scale-invariant manner without increasing the number of model parameters. We show on a modified MNIST dataset that when faced with scale variation, building in scale-invariance allows ConvNets to learn more discriminative features with reduced chances of over-fitting.

preprint2010arXiv

Innovative Rated-Resource Peer-to-Peer Network

Peer-to-Peer (P2P) networks provide a significant solution for file sharing among peers connected to Internet. It is fast and completely decentralised system with robustness. But due to absence of a server documents on a P2P network are not rated which makes it difficult for a peer to obtain precise information in result of a query. In past, some researchers tried to attach ratings to the peers itself but it was complex and less effective. In this paper, a novel P2P architecture is proposed which attaches ratings to the uploaded document directly. These ratings then become as <Rating> element in its XML advertisement which has several child elements for information classification. The attached <Rating> element is extracted from the advertisement in real time and the document is then sorted accordingly. Therefore, the information can be easily sorted based on a request by a peer according to the relevance of matter. The information regarding relevance is obtained by the peer issuing the query. This research leads to a smart P2P model, the Rated-Resource P2P network (R2P2P).