Catalog footprint

What is connected

52works
33topics
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

52 published item(s)

preprint2026arXiv

Decoder Generates Manufacturable Structures: A Framework for 3D-Printable Object Synthesis

This paper presents a novel decoder-based approach for generating manufacturable 3D structures optimized for additive manufacturing. We introduce a deep learning framework that decodes latent representations into geometrically valid, printable objects while respecting manufacturing constraints such as overhang angles, wall thickness, and structural integrity. The methodology demonstrates that neural decoders can learn complex mapping functions from abstract representations to valid 3D geometries, producing parts with significantly improved manufacturability compared to naive generation approaches. We validate the approach on diverse object categories and demonstrate practical 3D printing of decoder-generated structures.

preprint2026arXiv

Field-Localized Forgery Detection for Digital Identity Documents

Digital identity verification systems used in remote onboarding rely on document images to authenticate users, making them vulnerable to localized manipulations of key identity fields such as facial photographs and textual information. Existing forgery detection methods, developed primarily for natural-image forensics, show limited transferability to structured identity documents. We propose FLiD, a lightweight field-localized framework that targets critical identity regions rather than processing full-document images. A fine-tuned object detector first localizes face and text fields; a frozen MobileNetV3-Small backbone then extracts compact field-level embeddings, which are classified by lightweight neural network with only 191K trainable parameters. FLiD achieves AUC scores of 0.880 (face), 0.954 (text), and 0.923 (both-field attacks), with corresponding EERs of 18.05%, 11.61%, and 15.16%, representing absolute reductions of 29-35 percentage points over a full-document baseline trained from scratch. FLiD also consistently outperforms general-purpose manipulation detectors (TruFor, MMFusion, UniVAD) across all attack scenarios while requiring 13x fewer parameters and 21x fewer FLOPs

preprint2026arXiv

PRISM: Generation-Time Detection and Mitigation of Secret Leakage in Multi-Agent LLM Pipelines

Multi-agent LLM systems introduce a security risk in which sensitive information accessed by one agent can propagate through shared context and reappear in downstream outputs, even without explicit adversarial intent. We formalise this phenomenon as propagation amplification, where leakage risk increases across agent boundaries as sensitive content is repeatedly exposed to downstream generators. Existing defences, including prompt-based safeguards, static pattern matching, and LLM-as-judge filtering, are not designed for this setting: they either operate after generation, rely primarily on surface-form patterns, or add substantial latency without modelling the generation process itself. To resolve these issues, we propose PRISM, a real-time defence that treats credential leakage as a sequential risk accumulation problem during generation. At each decoding step, PRISM combines 16 signals spanning lexical, structural, information-theoretic, behavioural, and contextual features into a calibrated risk score, enabling per-token intervention through green, yellow, and red risk zones. Our central observation is that credential reproduction is often preceded by a measurable shift in generation dynamics, characterised by entropy collapse and increasing logit concentration. When combined with text-structural cues such as identifier-pattern detection, these temporal signals provide an early warning of leakage before a secret is fully reconstructed. Across a 2,000-task adversarial benchmark covering 13 attack categories and three pressure levels in a heterogeneous four-agent pipeline, PRISM achieves F1 = 0.832 with precision = 1.000 and recall = 0.712, while producing no observed leakage on our benchmark (0.0% task-level leak rate) and preserving output utility of 0.893. It substantially outperforms the strongest baseline, Span Tagger, which achieves F1 = 0.719 with a 15.0% task-level leak rate.

preprint2026arXiv

Semi-Contention-Free Access in IoT NOMA Networks: A Reinforcement Learning Framework

The unprecedented surge of massive Internet of things (mIoT) traffic in beyond fifth generation (B5G) communication systems calls for transformative approaches for multiple access and data transmission. While classical model-based tools have been proven to be powerful and precise, an imminent trend for resource management in B5G networks is promoting solutions towards data-driven design. Considering an IoT network with devices spread in clusters covered by a base station, we present in this paper a novel model-free multiple access and data transmission framework empowered by reinforcement learning, designed for power-domain non-orthogonal multiple access networks to facilitate uplink traffic of small data packets. The framework supports two access modes referred to as contention-based and semi-contention-free, with its core component being a policy gradient algorithm executed at the base station. The base station performs access control and optimal radio resource allocation by periodically broadcasting two control parameters to each cluster of devices that considerably reduce data detection failures with a minimum computation requirement on devices. Numerical results, in terms of system and cluster throughput, throughput fairness, access delay, and energy consumption, demonstrate the efficiency and scalability of the framework as network size and traffic load vary.

preprint2026arXiv

Single-Configuration Attack Success Rate Is Not Enough: Jailbreak Evaluations Should Report Distributional Attack Success

Many jailbreak attack research papers report attack success rates for a limited number of parameter settings, even though there are many combinations of parameter settings that could be used. Further, when new jailbreak papers are released, they often benchmark results against single configurations of existing attacks. This position paper argues such practices are fundamentally insufficient for characterising the threat posed by parameterised jailbreak attacks, and comparing attacks. Most jailbreak attacks expose multiple internal parameters, system prompt templates, conversation rounds, cipher dispersion, teaching shots, and ASR varies substantially across these parameters. Reporting only the best-case configuration discards two pieces of information that defenders genuinely need: how typical that performance is across the variant space, and how much of the attack surface is missed by selecting a single variant. We propose two new measures for jailbreak attacks: the Variant Sensitivity Measure (VSM) and Union Coverage (UC). VSM quantifies how far the best reported ASR deviates from the mean ASR across the tested variant space, UC is the total fraction of prompts resulting in unsafe responses across all tested configurations. We empirically demonstrate the importance of these measures using two attack families across three open-source target models. For PAIR, the best template reaches 69% ASR on Mistral-7B and 75% on Qwen3-0.6B, while UC rises to 88% and 93%, respectively. For bijection on Mistral-7B, the best variant reaches 81% ASR, but the 36-variant union covers 100% of HarmBench-100 prompts. We argue that distributional reporting, publishing VSM alongside ASR and enumerating variant coverage as fully as compute allows, should become the new minimum standard for parameterised jailbreak evaluation.

preprint2024arXiv

Boundary transfer matrix spectrum of measurement-induced transitions

Measurement-induced phase transitions (MIPTs) are known to be described by non-unitary conformal field theories (CFTs) whose precise nature remains unknown. Most physical quantities of interest, such as the entanglement features of quantum trajectories, are described by boundary observables in this CFT. We introduce a transfer matrix approach to study the boundary spectrum of this field theory, and consider a variety of boundary conditions. We apply this approach numerically to monitored Haar and Clifford circuits, and to the measurement-only Ising model where the boundary scaling dimensions can be derived analytically. Our transfer matrix approach provides a systematic numerical tool to study the spectrum of MIPTs.

preprint2022arXiv

Black Phosphorus n-type doping by Cu: a microscopic surface investigation

We study surface charge transfer doping of exfoliated black phosphorus (bP) flakes by copper using scanning tunneling microscopy (STM) and spectroscopy (STS) at room temperature. The tunneling spectra reveal a gap in correspondence of Cu islands, which is attributed to Coulomb blockade phenomena. Moreover, using line spectroscopic measurements across small copper islands, we exploit the potential of the local investigation, showing that the n-type doping effect of copper on bP is short-ranged. These experimental results are substantiated by first-principles simulations, which quantify the role of cluster size for an effective n-type doping of bP and explain the Coulomb blockade by an electronic decoupling of the topmost bP layer from the underlying layers driven by the copper cluster. Our results provide novel understanding, difficult to retrieve by transport measurements, of the doping of bP by copper, which appears promising for the implementation of ultra-sharp p-n junctions in bP.

preprint2022arXiv

Enhancement of High Harmonic Generation in Bulk Floquet Systems

We formulate a theory of bulk optical current for a periodically driven system, which accounts for the mixing of external drive and laser field frequencies and, therefore, the broadening of the harmonic spectrum compared to the undriven system. We express the current in terms of Floquet-Bloch bands and their non-adiabatic Berry connection and curvature. Using this expression, we relate spatio-temporal symmetries of the driven model to selection rules for current harmonics. We illustrate the application of this theory by studying high harmonic generation in the periodically driven Su-Schrieffer-Heeger model. In the high frequency and low field amplitude limit, we find analytical expressions for current harmonics. We also calculate the current numerically beyond the high frequency limit and verify that when the drive breaks a temporal symmetry, harmonics forbidden in the undriven model become available. Moreover, we find significant enhancement in higher harmonics when the system is driven, even for low field amplitudes. Our work offers a unified Floquet approach to nonlinear optical properties of solids, which is useful for realistic calculations of high harmonic spectra of electronic systems subject to multiple periodic drives.

preprint2022arXiv

Exploring System Performance of Continual Learning for Mobile and Embedded Sensing Applications

Continual learning approaches help deep neural network models adapt and learn incrementally by trying to solve catastrophic forgetting. However, whether these existing approaches, applied traditionally to image-based tasks, work with the same efficacy to the sequential time series data generated by mobile or embedded sensing systems remains an unanswered question. To address this void, we conduct the first comprehensive empirical study that quantifies the performance of three predominant continual learning schemes (i.e., regularization, replay, and replay with examples) on six datasets from three mobile and embedded sensing applications in a range of scenarios having different learning complexities. More specifically, we implement an end-to-end continual learning framework on edge devices. Then we investigate the generalizability, trade-offs between performance, storage, computational costs, and memory footprint of different continual learning methods. Our findings suggest that replay with exemplars-based schemes such as iCaRL has the best performance trade-offs, even in complex scenarios, at the expense of some storage space (few MBs) for training examples (1% to 5%). We also demonstrate for the first time that it is feasible and practical to run continual learning on-device with a limited memory budget. In particular, the latency on two types of mobile and embedded devices suggests that both incremental learning time (few seconds - 4 minutes) and training time (1 - 75 minutes) across datasets are acceptable, as training could happen on the device when the embedded device is charging thereby ensuring complete data privacy. Finally, we present some guidelines for practitioners who want to apply a continual learning paradigm for mobile sensing tasks.

preprint2022arXiv

GridShift: A Faster Mode-seeking Algorithm for Image Segmentation and Object Tracking

In machine learning and computer vision, mean shift (MS) qualifies as one of the most popular mode-seeking algorithms used for clustering and image segmentation. It iteratively moves each data point to the weighted mean of its neighborhood data points. The computational cost required to find the neighbors of each data point is quadratic to the number of data points. Consequently, the vanilla MS appears to be very slow for large-scale datasets. To address this issue, we propose a mode-seeking algorithm called GridShift, with significant speedup and principally based on MS. To accelerate, GridShift employs a grid-based approach for neighbor search, which is linear in the number of data points. In addition, GridShift moves the active grid cells (grid cells associated with at least one data point) in place of data points towards the higher density, a step that provides more speedup. The runtime of GridShift is linear in the number of active grid cells and exponential in the number of features. Therefore, it is ideal for large-scale low-dimensional applications such as object tracking and image segmentation. Through extensive experiments, we showcase the superior performance of GridShift compared to other MS-based as well as state-of-the-art algorithms in terms of accuracy and runtime on benchmark datasets for image segmentation. Finally, we provide a new object-tracking algorithm based on GridShift and show promising results for object tracking compared to CamShift and meanshift++.

preprint2022arXiv

Plagiarism deterrence for introductory programming

Plagiarism in introductory programming courses is an enormous challenge for both students and institutions. For students, relying on the work of others too early in their academic development can make it impossible to acquire necessary skills for independent success in the future. For institutions, widespread student cheating can dilute the quality of the educational experience being offered. Currently available solutions consider only pairwise comparisons between student submissions and focus on punitive deterrence. Our approach instead relies on a class-wide statistical characterization that can be clearly and securely shared with students via an intuitive new p-value representing independence of student effort. A pairwise, compression-based similarity detection algorithm captures relationships between assignments more accurately. An automated deterrence system is used to warn students that their behavior is being closely monitored. High-confidence instances are made directly available for instructor review using our open-source toolkit. An unbiased scoring system aids students and the instructor in understanding true independence of effort. Preliminary results indicate that the system can provide meaningful measurements of independence from week one, improving the efficacy of technical education.

preprint2022arXiv

Structural and electromechanical characterization of lead magnesium niobate-lead titanate (PMN-0.3PT) piezoceramic for energy harvesting applications

Efficient mechanical energy harvesting using the principle of piezoelectric effect demands specific material-property requirements. This includes a combination of large piezoelectric charge coefficient (dij), large elastic strain (εy), small elastic compliance (Sij), and small dielectric permittivity (\k{appa}ij). The present work undertakes structural, electrical, mechanical, and electromechanical characterization of pyrochlore-free lead magnesium niobate-lead titanate (1-x)[Pb(Mg(1/3)Nb(2/3)O3)]-xPbTiO3 at x = 0.3 or PMN-0.3PT, to estimate the above critical parameters for mechanical energy harvesting. Pyrochlore-free PMN-0.3PT ceramic with co-existing monoclinic (Pm and Cm) phases was synthesized using solid-state reaction method. Piezoelectric charge coefficient (d33), dielectric permittivity (\k{appa}33^T), elastic compliance (s33^E), and electromechanical coupling factor (k33), were estimated to be, 200 pC/N (approx), 1.06 (approx) x 10^-8 F/m, 13.16 (approx) x 10^-12 m2/N, and 0.54 (approx), respectively, using room temperature impedance measurement on a poled sample with specified dimensions (EN 50324-1:2002 and CEI/IEC 60483:1976). Polarization leakage due to transport of various charged defects was identified to be responsible for the reduced electromechanical properties compared to those reported for single crystals. Elastic strain (εy) vis-à-vis flexibility (fFOM) of the PMN-0.3PT was estimated to be 4.5 x 10-4. Energy harvesting under dynamic mechanical loading shows a maximum short-circuit current density, 95 nA/cm2, and an open-circuit electric field, 98 V/cm. With its impressive performance, PMN-0.3PT ceramic constitutes an important material for piezoelectric energy harvesting.

preprint2021arXiv

Quasiparticle and Nonquasiparticle Transport in Doped Quantum Paraelectrics

Charge transport in doped quantum paralectrics (QPs) presents a number of puzzles, including a pronounced $T^2$ regime in the resistivity. We analyze charge transport in a QP within a model of electrons coupled to a soft transverse optical (TO) mode via a two-phonon mechanism. For $T$ above the soft-mode frequency but below some characteristic scale ($E_0$), the resistivity scales with the occupation number of phonons squared, i.e., as $T^2$. The $T^2$ scattering rate does not depend on the carrier number density and is not affected by a crossover between degenerate and non-degenerate regimes, in agreement with the experiment. Temperatures higher than $E_0$ correspond to a non-quasiparticle regime, which we analyze by mapping the Dyson equation onto a problem of supersymmetric quantum mechanics. The combination of scattering by two TO phonons and by a longitudinal optical mode explains the data quite well.

preprint2021arXiv

Score-Based Generative Modeling through Stochastic Differential Equations

Creating noise from data is easy; creating data from noise is generative modeling. We present a stochastic differential equation (SDE) that smoothly transforms a complex data distribution to a known prior distribution by slowly injecting noise, and a corresponding reverse-time SDE that transforms the prior distribution back into the data distribution by slowly removing the noise. Crucially, the reverse-time SDE depends only on the time-dependent gradient field (\aka, score) of the perturbed data distribution. By leveraging advances in score-based generative modeling, we can accurately estimate these scores with neural networks, and use numerical SDE solvers to generate samples. We show that this framework encapsulates previous approaches in score-based generative modeling and diffusion probabilistic modeling, allowing for new sampling procedures and new modeling capabilities. In particular, we introduce a predictor-corrector framework to correct errors in the evolution of the discretized reverse-time SDE. We also derive an equivalent neural ODE that samples from the same distribution as the SDE, but additionally enables exact likelihood computation, and improved sampling efficiency. In addition, we provide a new way to solve inverse problems with score-based models, as demonstrated with experiments on class-conditional generation, image inpainting, and colorization. Combined with multiple architectural improvements, we achieve record-breaking performance for unconditional image generation on CIFAR-10 with an Inception score of 9.89 and FID of 2.20, a competitive likelihood of 2.99 bits/dim, and demonstrate high fidelity generation of 1024 x 1024 images for the first time from a score-based generative model.

preprint2020arXiv

Bayesian Structure Adaptation for Continual Learning

Continual Learning is a learning paradigm where learning systems are trained with sequential or streaming tasks. Two notable directions among the recent advances in continual learning with neural networks are ($i$) variational Bayes based regularization by learning priors from previous tasks, and, ($ii$) learning the structure of deep networks to adapt to new tasks. So far, these two approaches have been orthogonal. We present a novel Bayesian approach to continual learning based on learning the structure of deep neural networks, addressing the shortcomings of both these approaches. The proposed model learns the deep structure for each task by learning which weights to be used, and supports inter-task transfer through the overlapping of different sparse subsets of weights learned by different tasks. Experimental results on supervised and unsupervised benchmarks shows that our model performs comparably or better than recent advances in continual learning setting.

preprint2020arXiv

Elasticity of Jammed Packings of Sticky Disks

Numerous soft materials jam into an amorphous solid at high packing fraction. This non-equilibrium phase transition is best understood in the context of a model system in which particles repel elastically when they overlap. Recently, however, it was shown that introducing any finite amount of attraction between particles changes the universality class of the transition. The properties of this new ``sticky jamming'' class remain almost entirely unexplored. We use molecular dynamics simulations and scaling analysis to determine the shear modulus, bulk modulus, and coordination of marginal solids close to the sticky jamming point. In each case, the behavior of the system departs sharply and qualitatively from the purely repulsive case.

preprint2020arXiv

In Silico Investigations on the Potential Inhibitors for COVID-19 Protease

A novel strain of coronavirus, namely, COVID-19 has been identified in Wuhan city of China in December 2019. There are no specific therapies available and investigations regarding the treatment of the COVID-19 are still lacking. This prompted us to perform a preliminary in silico study on the COVID-19 protease with anti-malarial compounds in the search of potential inhibitor. We have calculated log P and log S values in addition to molecular docking and PASS predictions. Among the seven studied compounds, mepacrine appears as the potential inhibitor of the COVID-19 followed by chloroquine, hydroxychloroquine and phomarin. Therefore, these anti-malarial drugs may be potential drug candidate for the treatment of this novel coronavirus. A detailed analysis on these inhibitors is currently in progress and clinical studies are invited to investigate their potential medicinal use for the COVID-19.

preprint2020arXiv

Linear Response Theory and Optical Conductivity of Floquet Topological Insulators

Motivated by the quest for experimentally accessible dynamical probes of Floquet topological insulators, we formulate the linear response theory of a periodically driven system. We illustrate the applications of this formalism by giving general expressions for optical conductivity of Floquet systems, including its homodyne and heterodyne components and beyond. We obtain the Floquet optical conductivity of specific driven models, including two-dimensional Dirac material such as the surface of a topological insulator, graphene, and the Haldane model irradiated with circularly or linearly polarized laser, as well as semiconductor quantum well driven by an ac potential. We obtain approximate analytical expressions and perform numerically exact calculations of the Floquet optical conductivity in different scenarios of the occupation of the Floquet bands, in particular, the diagonal Floquet distribution and the distribution obtained after a quench. We comment on experimental signatures and detection of Floquet topological phases using optical probes.

preprint2020arXiv

Marketplace for AI Models

Artificial intelligence shows promise for solving many practical societal problems in areas such as healthcare and transportation. However, the current mechanisms for AI model diffusion such as Github code repositories, academic project webpages, and commercial AI marketplaces have some limitations; for example, a lack of monetization methods, model traceability, and model auditabilty. In this work, we sketch guidelines for a new AI diffusion method based on a decentralized online marketplace. We consider the technical, economic, and regulatory aspects of such a marketplace including a discussion of solutions for problems in these areas. Finally, we include a comparative analysis of several current AI marketplaces that are already available or in development. We find that most of these marketplaces are centralized commercial marketplaces with relatively few models.

preprint2020arXiv

MCQA: Multimodal Co-attention Based Network for Question Answering

We present MCQA, a learning-based algorithm for multimodal question answering. MCQA explicitly fuses and aligns the multimodal input (i.e. text, audio, and video), which forms the context for the query (question and answer). Our approach fuses and aligns the question and the answer within this context. Moreover, we use the notion of co-attention to perform cross-modal alignment and multimodal context-query alignment. Our context-query alignment module matches the relevant parts of the multimodal context and the query with each other and aligns them to improve the overall performance. We evaluate the performance of MCQA on Social-IQ, a benchmark dataset for multimodal question answering. We compare the performance of our algorithm with prior methods and observe an accuracy improvement of 4-7%.

preprint2020arXiv

Microstructure evolution and densification during spark plasma sintering of nanocrystalline W-5wt.%Ta alloy

The present work reports the effect of Ta on densification and microstructure evolution during non-isothermal and spark plasma sintering of nanocrystalline W. Nanocrystalline W-5wt.%Ta alloy powder was synthesized using mechanical alloying. The nanocrystalline powder was characterized thoroughly using X-ray diffraction line profile analysis. Furthermore, the shrinkage behavior of nanocrystalline powder was investigated during non-isothermal sintering using dilatometry. Subsequently, the alloy powder was consolidated using spark plasma sintering up to 1600 °C. The role of Ta on stabilizing the microstructure during spark plasma sintering of nanocrystalline W was investigated in detail using electron backscatter diffraction. The average grain size of spark plasma sintered W-5wt.%Ta alloy was observed as 1.73 micron.

preprint2020arXiv

Non-Markovian resonance fluorescence

We derive a general formula for the non-Markovian fluorescence spectrum of a multi-level system interacting with a bosonic environment. To this end, we apply linear-response theory to describe the dynamics of a detector monitoring the emission spectrum of a general multi-level system. The resultant emission lineshape function is directly related to the two-time correlation of system observables, which we derive using Nakajima-Zwanzig Generalized Master Equation without assuming a Markov approximation.

preprint2020arXiv

On Implicit Regularization in $β$-VAEs

While the impact of variational inference (VI) on posterior inference in a fixed generative model is well-characterized, its role in regularizing a learned generative model when used in variational autoencoders (VAEs) is poorly understood. We study the regularizing effects of variational distributions on learning in generative models from two perspectives. First, we analyze the role that the choice of variational family plays in imparting uniqueness to the learned model by restricting the set of optimal generative models. Second, we study the regularization effect of the variational family on the local geometry of the decoding model. This analysis uncovers the regularizer implicit in the $β$-VAE objective, and leads to an approximation consisting of a deterministic autoencoding objective plus analytic regularizers that depend on the Hessian or Jacobian of the decoding model, unifying VAEs with recent heuristics proposed for training regularized autoencoders. We empirically verify these findings, observing that the proposed deterministic objective exhibits similar behavior to the $β$-VAE in terms of objective value and sample quality.

preprint2020arXiv

Regularized Autoencoders via Relaxed Injective Probability Flow

Invertible flow-based generative models are an effective method for learning to generate samples, while allowing for tractable likelihood computation and inference. However, the invertibility requirement restricts models to have the same latent dimensionality as the inputs. This imposes significant architectural, memory, and computational costs, making them more challenging to scale than other classes of generative models such as Variational Autoencoders (VAEs). We propose a generative model based on probability flows that does away with the bijectivity requirement on the model and only assumes injectivity. This also provides another perspective on regularized autoencoders (RAEs), with our final objectives resembling RAEs with specific regularizers that are derived by lower bounding the probability flow objective. We empirically demonstrate the promise of the proposed model, improving over VAEs and AEs in terms of sample quality.

preprint2020arXiv

Trustworthy AI in the Age of Pervasive Computing and Big Data

The era of pervasive computing has resulted in countless devices that continuously monitor users and their environment, generating an abundance of user behavioural data. Such data may support improving the quality of service, but may also lead to adverse usages such as surveillance and advertisement. In parallel, Artificial Intelligence (AI) systems are being applied to sensitive fields such as healthcare, justice, or human resources, raising multiple concerns on the trustworthiness of such systems. Trust in AI systems is thus intrinsically linked to ethics, including the ethics of algorithms, the ethics of data, or the ethics of practice. In this paper, we formalise the requirements of trustworthy AI systems through an ethics perspective. We specifically focus on the aspects that can be integrated into the design and development of AI systems. After discussing the state of research and the remaining challenges, we show how a concrete use-case in smart cities can benefit from these methods.

preprint2020arXiv

Weakly Supervised Disentanglement with Guarantees

Learning disentangled representations that correspond to factors of variation in real-world data is critical to interpretable and human-controllable machine learning. Recently, concerns about the viability of learning disentangled representations in a purely unsupervised manner has spurred a shift toward the incorporation of weak supervision. However, there is currently no formalism that identifies when and how weak supervision will guarantee disentanglement. To address this issue, we provide a theoretical framework to assist in analyzing the disentanglement guarantees (or lack thereof) conferred by weak supervision when coupled with learning algorithms based on distribution matching. We empirically verify the guarantees and limitations of several weak supervision methods (restricted labeling, match-pairing, and rank-pairing), demonstrating the predictive power and usefulness of our theoretical framework.

preprint2019arXiv

Alpha Particle X-Ray Spectrometer (APXS) On-board Chandrayaan-2 Rover -- Pragyan

Alpha Particle X-ray Spectrometer (APXS) is one of the two scientific experiments on Chandrayaan-2 rover named as Pragyan. The primary scientific objective of APXS is to determine the elemental composition of the lunar surface in the surrounding regions of the landing site. This will be achieved by employing the technique of X-ray fluorescence spectroscopy using in-situ excitation source Cm-244 emitting both X-rays and alpha particles. These radiations excite characteristic X-rays of the elements by the processes of particle induced X-ray emission (PIXE) and X-ray fluorescence (XRF). The characteristic X-rays are detected by the state-of-the-art X-ray detector known as Silicon Drift Detector (SDD), which provides high energy resolution as well as high efficiency in the energy range of 1 to 25 keV. This enables APXS to detect all major rock forming elements such as, Na, Mg, Al, Si, Ca, Ti and Fe. The Flight Model (FM) of the APXS payload has been completed and tested for various instrument parameters. The APXS provides energy resolution of 135 eV at 5.9 keV for the detector operating temperature of about -35 deg C. The design details and the performance measurement of APXS are presented in this paper.

preprint2019arXiv

Mixed baroclinic convection in a cavity

We study the convective patterns that arise in a nearly semi-cylindrical cavity fed in with hot fluid at the upper boundary, bounded by a cold, porous semi-circular boundary at the bottom, and infinitely extended in the third direction. While this configuration is relevant to continuous casting processes that are significantly more complex, we focus on the flow patterns associated with the particular form of mixed convection that arises in it. Linear stability analysis and direct numerical simulations (DNS) are conducted, using the spectral element method to identify observable states. The nature of the bifurcations is determined through Stuart--Landau analysis for completeness. The base flow consists of two counter-rotating rolls driven by the baroclinic imbalance due to the curved isothermal boundary. These are however suppressed by the through-flow, which is found to have a stabilising influence as soon as the Reynolds number $Re$ based on the through-flow exceeds 25. For a sufficiently high Rayleigh number, this base flow is linearly unstable to three different modes, depending on $Re$. For $Re\leq75$, the rolls destabilise through a supercritical bifurcation into a travelling wave. For $100\leq Re \leq 110$, a subcritical bifurcation leads to a standing oscillatory mode, whereas for $Re\geq150$, the unstable mode is non-oscillatory and grows out of a supercritical bifurcation. The direct numerical simulations confirm that in all cases, the dominant mode returned by the linear stability analysis precisely matches the topology and evolution of the flow patterns that arise out of the fully nonlinear dynamics.

preprint2019arXiv

Transient flows and reorientations of large-scale convection in a cubic cell

The transient processes of a turbulent large-scale convective circulation (LSC) in a cubic cell are investigated using large-eddy simulations for Rayleigh number $\Ray=10^8$ and Prandtl number $\Pran=0.7$. For the first time, we have explicitly shown that LSC is accompanied by large-scale azimuthal flows with non-zero total angular momentum. It is also shown that solid-body rotation of the entire fluid is not realized. It is found that correlation between rotation of LSC plane and the mean azimuthal motion is high during quasiperiodic oscillations of LSC near the diagonal plane and relatively weak during LSC reorientations. We propose a new plausible scenario for the reorientations of the LSC in a cube that does not involve a mean azimuthal flow. Instead of a single-roll, we introduce the superposition of a pair of large-scale orthogonal quasi-two-dimensional (Q2D) rolls and the reorientation of the LSC occurs as a result of the cessation of one of the Q2D rolls. This scenario is consistent with all known experimental and numerical data.

preprint2019arXiv

Turbulence in a stably stratified fluid: Onset of global anisotropy as a function of the Richardson number

It is necessary to introduce an external forcing to induce turbulence in a stably stratified fluid. The Heisenberg eddy viscosity technique should in this case suffice to calculate a space-time averaged quantity like the global anisotropy parameter as a function of the Richardson number. We find analytically that the anisotropy increases linearly with the Richardson number, with a small quadratic correction. A numerical simulation of the complete equations shows the linear behaviour.

preprint2016arXiv

Dynamics of large-scale quantities in Rayleigh-Bénard convection

In this paper we estimate the relative strengths of various terms of the Rayleigh-Bénard equations. Based on these estimates and scaling analysis, we derive a general formula for the large-scale velocity, $U$, or the Péclet number that is applicable for arbitrary Rayleigh number $\mathrm{Ra}$ and Prandtl number $\mathrm{Pr}$. Our formula fits reasonably well with the earlier simulation and experimental results. Our analysis also shows that the wall-bounded convection has enhanced viscous force compared to free turbulence. We also demonstrate how correlations deviate the Nusselt number scaling from the theoretical prediction of $\mathrm{Ra}^{1/2}$ to the experimentally observed scaling of nearly $\mathrm{Ra}^{0.3}$.

preprint2016arXiv

Fully-adaptive Feature Sharing in Multi-Task Networks with Applications in Person Attribute Classification

Multi-task learning aims to improve generalization performance of multiple prediction tasks by appropriately sharing relevant information across them. In the context of deep neural networks, this idea is often realized by hand-designed network architectures with layers that are shared across tasks and branches that encode task-specific features. However, the space of possible multi-task deep architectures is combinatorially large and often the final architecture is arrived at by manual exploration of this space subject to designer's bias, which can be both error-prone and tedious. In this work, we propose a principled approach for designing compact multi-task deep learning architectures. Our approach starts with a thin network and dynamically widens it in a greedy manner during training using a novel criterion that promotes grouping of similar tasks together. Our Extensive evaluation on person attributes classification tasks involving facial and clothing attributes suggests that the models produced by the proposed method are fast, compact and can closely match or exceed the state-of-the-art accuracy from strong baselines by much more expensive models.

preprint2016arXiv

Near isotropic behaviour of turbulent thermal convection

We investigate the anisotropy in turbulent convection in a 3D box using direct numerical simulation. We compute the anisotropic parameter $A = u_\perp^{2}/(2u_{\parallel}^{2})$, where $u_{\perp}$ and $u_{\parallel}$ are the components of velocity perpendicular and parallel to the buoyancy direction, the shell and ring spectra, and shell-to-shell energy transfers. We observe that the flow is nearly isotropic for the Prandtl number $\mathrm{Pr} \approx 1$, but the anisotropy increases with the Prandtl number. For $\mathrm{Pr}=\infty$, $A \approx 0.3$, thus anisotropy is not very significant even in extreme cases. We also observe that $u_{\parallel}$ feeds energy to $u_{\perp}$ via pressure. The computation of shell-to-shell energy transfers reveals that the energy transfer in turbulent convection is local and forward, similar to hydrodynamic turbulence. These results are consistent with the Kolmogorov's spectrum observed by Kumar et al.~[Phys. Rev. E {\bf 90}, 023016 (2014)] for turbulent convection.

preprint2016arXiv

S3Pool: Pooling with Stochastic Spatial Sampling

Feature pooling layers (e.g., max pooling) in convolutional neural networks (CNNs) serve the dual purpose of providing increasingly abstract representations as well as yielding computational savings in subsequent convolutional layers. We view the pooling operation in CNNs as a two-step procedure: first, a pooling window (e.g., $2\times 2$) slides over the feature map with stride one which leaves the spatial resolution intact, and second, downsampling is performed by selecting one pixel from each non-overlapping pooling window in an often uniform and deterministic (e.g., top-left) manner. Our starting point in this work is the observation that this regularly spaced downsampling arising from non-overlapping windows, although intuitive from a signal processing perspective (which has the goal of signal reconstruction), is not necessarily optimal for \emph{learning} (where the goal is to generalize). We study this aspect and propose a novel pooling strategy with stochastic spatial sampling (S3Pool), where the regular downsampling is replaced by a more general stochastic version. We observe that this general stochasticity acts as a strong regularizer, and can also be seen as doing implicit data augmentation by introducing distortions in the feature maps. We further introduce a mechanism to control the amount of distortion to suit different datasets and architectures. To demonstrate the effectiveness of the proposed approach, we perform extensive experiments on several popular image classification benchmarks, observing excellent improvements over baseline models. Experimental code is available at https://github.com/Shuangfei/s3pool.

preprint2015arXiv

A new Initial Centroid finding Method based on Dissimilarity Tree for K-means Algorithm

Cluster analysis is one of the primary data analysis technique in data mining and K-means is one of the commonly used partitioning clustering algorithm. In K-means algorithm, resulting set of clusters depend on the choice of initial centroids. If we can find initial centroids which are coherent with the arrangement of data, the better set of clusters can be obtained. This paper proposes a method based on the Dissimilarity Tree to find, the better initial centroid as well as every bit more accurate cluster with less computational time. Theory analysis and experimental results indicate that the proposed method can effectively improve the accuracy of clusters and reduce the computational complexity of the K-means algorithm.

preprint2015arXiv

A Shell Model for Buoyancy-Driven Turbulence

In this paper we present a unified shell model for stably stratified and convective turbulence. Numerical simulation of this model for stably stratified flow shows Bolgiano-Obukhbov scaling in which the kinetic energy spectrum varies as $k^{-11/5}$. We also observe a dual scaling ($k^{-11/5}$ and $k^{-5/3}$) for a limited range of parameters. The shell model of convective turbulence yields Kolmogorov's spectrum. These results are consistent with the energy flux and energy feed due to buoyancy, and are in good agreement with direct numerical simulations of Kumar {\em et al.} [Phys. Rev. E {\bf 90}, 023016 (2014)].

preprint2015arXiv

Exact and Heuristic Algorithms for Semi-Nonnegative Matrix Factorization

Given a matrix $M$ (not necessarily nonnegative) and a factorization rank $r$, semi-nonnegative matrix factorization (semi-NMF) looks for a matrix $U$ with $r$ columns and a nonnegative matrix $V$ with $r$ rows such that $UV$ is the best possible approximation of $M$ according to some metric. In this paper, we study the properties of semi-NMF from which we develop exact and heuristic algorithms. Our contribution is threefold. First, we prove that the error of a semi-NMF of rank $r$ has to be smaller than the best unconstrained approximation of rank $r-1$. This leads us to a new initialization procedure based on the singular value decomposition (SVD) with a guarantee on the quality of the approximation. Second, we propose an exact algorithm (that is, an algorithm that finds an optimal solution), also based on the SVD, for a certain class of matrices (including nonnegative irreducible matrices) from which we derive an initialization for matrices not belonging to that class. Numerical experiments illustrate that this second approach performs extremely well, and allows us to compute optimal semi-NMF decompositions in many situations. Finally, we analyze the computational complexity of semi-NMF proving its NP-hardness, already in the rank-one case (that is, for $r = 1$), and we show that semi-NMF is sometimes ill-posed (that is, an optimal solution does not exist).

preprint2014arXiv

Energy spectrum of Buoyancy-driven Flows

Using high-resolution direct numerical simulation and arguments based on the kinetic energy flux $Π_u$, we demonstrate that for stably stratified flows, the kinetic energy spectrum $E_u(k) \sim k^{-11/5}$, the entropy spectrum $E_θ(k) \sim k^{-7/5}$, and $Π_u(k) \sim k^{-4/5}$ (Bolgiano-Obukhov scaling). This scaling is due to the depletion of kinetic energy because of buoyancy. For weaker buoyancy in stratified flows, $E_u(k)$ follows Kolmgorov's spectrum with a constant energy flux. We also argue that for Rayleigh Bénard convection, the Bolgiano-Obukhov scaling will not hold for the bulk flow due to the positive energy supply by buoyancy and non-decreasing $Π_u(k)$.

preprint2014arXiv

Energy Spectrum of Buoyancy-Driven Turbulence

Using high-resolution direct numerical simulation and arguments based on the kinetic energy flux $Π_u$, we demonstrate that for stably stratified flows, the kinetic energy spectrum $E_u(k) \sim k^{-11/5}$, the entropy spectrum $E_θ(k) \sim k^{-7/5}$, and $Π_u(k) \sim k^{-4/5}$, consistent with the Bolgiano-Obukhov scaling. This scaling arises due to the conversion of kinetic energy to the potential energy by buoyancy. For weaker buoyancy, this conversion is weak, hence $E_u(k)$ follows Kolmogorov's spectrum with a constant energy flux. For Rayleigh Bénard convection, we show that the energy supply rate by buoyancy is positive, which leads to an increasing $Π_u(k)$ with $k$, thus ruling out Bolgiano-Obukhov scaling for the convective turbulence. Our numerical results show that convective turbulence for unit Prandt number exhibits a constant $Π_u(k)$ and $E_u(k) \sim k^{-5/3}$ for a narrow band of wavenumbers.

preprint2014arXiv

Prefrontal Cortex Motivated Cognitive Architecture for Multiple Robots

In this paper, we introduce a cerebral cortex inspired architecture for robots in which we have mapped hierarchical cortical representation of human brain to logic flow and decision making process. Our work focuses on the two major features of human cognitive process, viz. the perception action cycle and its hierarchical organization, and the decision making process. To prove the effectiveness of our proposed method, we incorporated this architecture in our robot which we named as Cognitive Insect Robot inspired by Brain Architecture (CIRBA). We have extended our research to the implementation of this cognitive architecture of CIRBA in multiple robots and have analyzed the level of cognition attained by them

preprint2013arXiv

Near-separable Non-negative Matrix Factorization with $\ell_1$- and Bregman Loss Functions

Recently, a family of tractable NMF algorithms have been proposed under the assumption that the data matrix satisfies a separability condition Donoho & Stodden (2003); Arora et al. (2012). Geometrically, this condition reformulates the NMF problem as that of finding the extreme rays of the conical hull of a finite set of vectors. In this paper, we develop several extensions of the conical hull procedures of Kumar et al. (2013) for robust ($\ell_1$) approximations and Bregman divergences. Our methods inherit all the advantages of Kumar et al. (2013) including scalability and noise-tolerance. We show that on foreground-background separation problems in computer vision, robust near-separable NMFs match the performance of Robust PCA, considered state of the art on these problems, with an order of magnitude faster training time. We also demonstrate applications in exemplar selection settings.

preprint2013arXiv

Top-flavored dark matter and the forward-backward asymmetry

We propose a simple model where dark matter (DM) carries top flavor and couples to the Standard Model through the top quark within a framework of minimal flavor violation (MFV). Top-flavored DM can explain the anomalous top forward-backward asymmetry observed at the Tevatron, while remaining consistent with other top observables at colliders. By virtue of its large coupling to top, DM acquires a sizable loop coupling to the Z boson, and the relic density is set by annihilation through the Z. We also discuss contraints from current direct detection searches, emphasizing the role of spin-dependent searches to probe this scenario.

preprint2013arXiv

Tracking Down the Top Quark Forward-Backward Asymmetry with Monotops

We revisit the possibility that the top quark forward-backward asymmetry arises from the on-shell production and decay of scalar top partners to top-antitop pairs with missing transverse energy. Although the asymmetry is produced by t-channel exchange of a light mediator, the model remains unconstrained by low energy atomic parity violation tests. An interesting connection to the active neutrino sector through a Type-I seesaw operator helps to evade stringent monojet constraints and opens up a richer collider phenomenology. After performing a global fit to top data from both the Tevatron and the LHC, we obtain a viable region of parameter space consistent with all phenomenological and collider constraints. We also discuss the discovery potential of a predicted monotop signal and related lepton charge asymmetry at the LHC.

preprint2013arXiv

Very Light Scalar Top Quarks at the LHC

A very light scalar top (stop) superpartner is motivated by naturalness and electroweak baryogenesis. When the mass of the stop is less than the sum of the masses of the top quark and the lightest neutralino superpartner, as well as the of the masses of the lightest chargino and the bottom quark, the dominant decay channels of the stop will be three-body, four-body, or flavour violating. In this work, we investigate the direct and indirect constraints on a light stop, we compute the relative decay branching fractions to these channels, and we study the sensitivity of existing LHC searches to each of them.

preprint2012arXiv

A Binary Classification Framework for Two-Stage Multiple Kernel Learning

With the advent of kernel methods, automating the task of specifying a suitable kernel has become increasingly important. In this context, the Multiple Kernel Learning (MKL) problem of finding a combination of pre-specified base kernels that is suitable for the task at hand has received significant attention from researchers. In this paper we show that Multiple Kernel Learning can be framed as a standard binary classification problem with additional constraints that ensure the positive definiteness of the learned kernel. Framing MKL in this way has the distinct advantage that it makes it easy to leverage the extensive research in binary classification to develop better performing and more scalable MKL algorithms that are conceptually simpler, and, arguably, more accessible to practitioners. Experiments on nine data sets from different domains show that, despite its simplicity, the proposed technique compares favorably with current leading MKL approaches.

preprint2012arXiv

Fast Conical Hull Algorithms for Near-separable Non-negative Matrix Factorization

The separability assumption (Donoho & Stodden, 2003; Arora et al., 2012) turns non-negative matrix factorization (NMF) into a tractable problem. Recently, a new class of provably-correct NMF algorithms have emerged under this assumption. In this paper, we reformulate the separable NMF problem as that of finding the extreme rays of the conical hull of a finite set of vectors. From this geometric perspective, we derive new separable NMF algorithms that are highly scalable and empirically noise robust, and have several other favorable properties in relation to existing methods. A parallel implementation of our algorithm demonstrates high scalability on shared- and distributed-memory machines.

preprint2012arXiv

Identification of Nonlinear Systems From the Knowledge Around Different Operating Conditions: A Feed-Forward Multi-Layer ANN Based Approach

The paper investigates nonlinear system identification using system output data at various linearized operating points. A feed-forward multi-layer Artificial Neural Network (ANN) based approach is used for this purpose and tested for two target applications i.e. nuclear reactor power level monitoring and an AC servo position control system. Various configurations of ANN using different activation functions, number of hidden layers and neurons in each layer are trained and tested to find out the best configuration. The training is carried out multiple times to check for consistency and the mean and standard deviation of the root mean square errors (RMSE) are reported for each configuration.

preprint2012arXiv

Learning Task Grouping and Overlap in Multi-task Learning

In the paradigm of multi-task learning, mul- tiple related prediction tasks are learned jointly, sharing information across the tasks. We propose a framework for multi-task learn- ing that enables one to selectively share the information across the tasks. We assume that each task parameter vector is a linear combi- nation of a finite number of underlying basis tasks. The coefficients of the linear combina- tion are sparse in nature and the overlap in the sparsity patterns of two tasks controls the amount of sharing across these. Our model is based on on the assumption that task pa- rameters within a group lie in a low dimen- sional subspace but allows the tasks in differ- ent groups to overlap with each other in one or more bases. Experimental results on four datasets show that our approach outperforms competing methods.

preprint2011arXiv

Kinetically-Enhanced Anomaly Mediation

We investigate a modification of anomaly-mediated supersymmetry breaking (AMSB) with an exotic U(1)_x gauge sector that can solve the tachyonic slepton problem of minimal AMSB scenarios. The new U(1)_x multiplet is assumed to couple directly to the source of supersymmetry breaking, but only indirectly to the minimal supersymmetric Standard Model (MSSM) through kinetic mixing with hypercharge. If the MSSM sector is also sequestered from the source of supersymmetry breaking, the contributions to the MSSM soft terms come from both AMSB and the U(1)_x kinetic coupling. We find that this arrangement can give rise to a flavour-universal, phenomenologically viable, and distinctive spectrum of MSSM superpartners. We also investigate the prospects for discovery and the most likely signatures of this scenario at the Large Hadron Collider (LHC).

preprint2011arXiv

Pricing of average strike Asian call option using numerical PDE methods

In this paper, a standard PDE for the pricing of arithmetic average strike Asian call option is presented. A Crank-Nicolson Implicit Method and a Higher Order Compact finite difference scheme for this pricing problem is derived. Both these schemes were implemented for various values of risk free rate and volatility. The option prices for the same set of values of risk free rate and volatility was also computed using Monte Carlo simulation. The comparative results of the two numerical PDE methods shows close match with the Monte Carlo results, with the Higher Order Compact scheme exhibiting a better match. To the best of our knowledge, this is the first work to use the numerical PDE approach for pricing Asian call options with average strike.

preprint2010arXiv

Neutrino Mass, Sneutrino Dark Matter and Signals of Lepton Flavor Violation in the MRSSM

We study the phenomenology of mixed-sneutrino dark matter in the Minimal R-Symmetric Supersymmetric Standard Model (MRSSM). Mixed sneutrinos fit naturally within the MRSSM, as the smallness (or absence) of neutrino Yukawa couplings singles out sneutrino A-terms as the only ones not automatically forbidden by R-symmetry. We perform a study of randomly generated sneutrino mass matrices and find that (i) the measured value of $Ω_{DM}$ is well within the range of typical values obtained for the relic abundance of the lightest sneutrino, (ii) with small lepton-number-violating mass terms $m_{nn}^{2} {\tilde n} {\tilde n}$ for the right-handed sneutrinos, random matrices satisfying the $Ω_{DM}$ constraint have a decent probability of satisfying direct detection constraints, and much of the remaining parameter space will be probed by upcoming experiments, (iii) the $m_{nn}^{2} {\tilde n} {\tilde n}$ terms radiatively generate appropriately small Majorana neutrino masses, with neutrino oscillation data favoring a mostly sterile lightest sneutrino with a dominantly mu/tau-flavored active component, and (iv) a sneutrino LSP with a significant mu component can lead to striking signals of e-mu flavor violation in dilepton invariant-mass distributions at the LHC.

preprint2009arXiv

The Dark Side of the Electroweak Phase Transition

Recent data from cosmic ray experiments may be explained by a new GeV scale of physics. In addition the fine-tuning of supersymmetric models may be alleviated by new O(GeV) states into which the Higgs boson could decay. The presence of these new, light states can affect early universe cosmology. We explore the consequences of a light (~ GeV) scalar on the electroweak phase transition. We find that trilinear interactions between the light state and the Higgs can allow a first order electroweak phase transition and a Higgs mass consistent with experimental bounds, which may allow electroweak baryogenesis to explain the cosmological baryon asymmetry. We show, within the context of a specific supersymmetric model, how the physics responsible for the first order phase transition may also be responsible for the recent cosmic ray excesses of PAMELA, FERMI etc. We consider the production of gravity waves from this transition and the possible detectability at LISA and BBO.