Results for "Shayan Monabbati"

total 120took 0.12s
Timing Control of Single Neuron Spikes with Optogenetic StimulationOct 31 2017Feb 13 2018This paper predicts the ability to externally control the firing times of a cortical neuron whose behavior follows the Izhikevich neuron model. The Izhikevich neuron model provides an efficient and biologically plausible method to track a cortical neuron's ... More
Modeling Interference-Free Neuron Spikes with Optogenetic StimulationMay 14 2019This paper predicts the ability to externally control the firing times of a cortical neuron whose behavior follows the Izhikevich neuron model. The Izhikevich neuron model provides an efficient and biologically plausible method to track a cortical neuron's ... More
Improving the Resolution of CNN Feature Maps Efficiently with MultisamplingMay 28 2018We describe a new class of subsampling techniques for CNNs, termed multisampling, that significantly increases the amount of information kept by feature maps through subsampling layers. One version of our method, which we call checkered subsampling, significantly ... More
Generating photon pairs from a silicon microring resonator using an electronic step recovery diode for pump pulse generationApr 01 2016Generation of photon pairs from compact, manufacturable and inexpensive silicon (Si) photonic devices at room temperature may help develop practical applications of quantum photonics. An important characteristic of photon-pair generation is the two-photon ... More
Revisiting Hyper-Parameter Tuning for Search-based Test Data GenerationJun 05 2019Search-based software testing (SBST) has been studied a lot in the literature, lately. Since, in theory, the performance of meta-heuristic search methods are highly dependent on their parameters, there is a need to study SBST tuning. In this study, we ... More
A Feature-Based Analysis on the Impact of Set of Constraints for e-Constrained Differential EvolutionJun 23 2015Different types of evolutionary algorithms have been developed for constrained continuous optimization. We carry out a feature-based analysis of evolved constrained continuous optimization instances to understand the characteristics of constraints that ... More
A Feature-Based Comparison of Evolutionary Computing Techniques for Constrained Continuous OptimisationSep 23 2015Evolutionary algorithms have been frequently applied to constrained continuous optimisation problems. We carry out feature based comparisons of different types of evolutionary algorithms such as evolution strategies, differential evolution and particle ... More
Analysis of Optical Pulse Propagation with ABCD MatricesMar 04 2001We review and extend the analogies between Gaussian pulse propagation and Gaussian beam diffraction. In addition to the well-known parallels between pulse dispersion in optical fiber and CW beam diffraction in free space, we review temporal lenses as ... More
Pion Interactions and the Standard Model at High PrecisionDec 20 2018Pions were predicted by H. Yukawa as force carriers of the inter-nucleon forces, and were detected in 1947. Today they are known to be bound states of quarks and anti-quarks of the two lightest flavours. They satisfy Bose statistics, and are the lightest ... More
Sparse Architectures for Text-Independent Speaker Verification Using Deep Neural NetworksMay 19 2018Aug 09 2018Network pruning is of great importance due to the elimination of the unimportant weights or features activated due to the network over-parametrization. Advantages of sparsity enforcement include preventing the overfitting and speedup. Considering a large ... More
Sharp Bounds on Random Walk Eigenvalues via Spectral EmbeddingNov 03 2012Aug 15 2016Spectral embedding of graphs uses the top k eigenvectors of the random walk matrix to embed the graph into R^k. The primary use of this embedding has been for practical spectral clustering algorithms [SM00,NJW02]. Recently, spectral embedding was studied ... More
On Variants of the Matroid Secretary ProblemApr 20 2011Dec 11 2011We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the "random assignment" model where the weights are assigned randomly to the elements ... More
Improved ARV Rounding in Small-set Expanders and Graphs of Bounded Threshold RankApr 07 2013Apr 11 2013We prove a structure theorem for the feasible solutions of the Arora-Rao-Vazirani SDP relaxation on low threshold rank graphs and on small-set expanders. We show that if G is a graph of bounded threshold rank or a small-set expander, then an optimal solution ... More
Partitioning into ExpandersSep 12 2013Dec 06 2013Let G=(V,E) be an undirected graph, lambda_k be the k-th smallest eigenvalue of the normalized laplacian matrix of G. There is a basic fact in algebraic graph theory that lambda_k > 0 if and only if G has at most k-1 connected components. We prove a robust ... More
On the Peculiarities of Design: An Engineering PerspectiveMay 17 2013It is a fact of our existence, that no matter where we are, we most often find ourselves either hearing, seeing, talking, or even engaged in design related activities. Despite this reality, the notion of 'design', and in particular 'engineering design', ... More
Large-Scale Fading Behavior for a Cellular Network with Uniform Spatial DistributionFeb 04 2013Dec 26 2014Large-scale fading (LSF) between interacting nodes is a fundamental element in radio communications, responsible for weakening the propagation, and thus worsening the service quality. Given the importance of channel-losses in general, and the inevitability ... More
Approximation Algorithms for Finding Maximum Induced ExpandersNov 09 2015We initiate the study of approximating the largest induced expander in a given graph $G$. Given a $\Delta$-regular graph $G$ with $n$ vertices, the goal is to find the set with the largest induced expansion of size at least $\delta \cdot n$. We design ... More
An L1 Representer Theorem for Multiple-Kernel RegressionNov 02 2018Nov 07 2018The theory of RKHS provides an elegant framework for supervised learning. It is the foundation of all kernel methods in machine learning. Implicit in its formulation is the use of a quadratic regularizer associated with the underlying inner product which ... More
A Feature-Based Prediction Model of Algorithm Selection for Constrained Continuous OptimisationFeb 09 2016With this paper, we contribute to the growing research area of feature-based analysis of bio-inspired computing. In this research area, problem instances are classified according to different features of the underlying problem in terms of their difficulty ... More
The Kadison-Singer Problem for Strongly Rayleigh Measures and Applications to Asymmetric TSPDec 03 2014Jul 22 2015Marcus, Spielman, and Srivastava in their seminal work \cite{MSS13} resolved the Kadison-Singer conjecture by proving that for any set of finitely supported independently distributed random vectors $v_1,\dots, v_n$ which have "small" expected squared ... More
Cellular-Based Statistical Model for Mobile DispersionJun 02 2013While analyzing mobile systems we often approximate the actual coverage surface and assume an ideal cell shape. In a multi-cellular network, because of its tessellating nature, a hexagon is more preferred than a circular geometry. Despite this reality, ... More
A Polynomial Time MCMC Method for Sampling from Continuous DPPsOct 20 2018We study the Gibbs sampling algorithm for continuous determinantal point processes. We show that, given a warm start, the Gibbs sampler generates a random sample from a continuous $k$-DPP defined on a $d$-dimensional domain by only taking $\text{poly}(k)$ ... More
Submodular Maximization by Simulated AnnealingJul 09 2010We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [FOCS'07] showed a 2/5-approximation for the unconstrained problem and also proved that no approximation better ... More
Approximating the Expansion Profile and Almost Optimal Local Graph ClusteringApr 10 2012Nov 05 2012Spectral partitioning is a simple, nearly-linear time, algorithm to find sparse cuts, and the Cheeger inequalities provide a worst-case guarantee for the quality of the approximation found by the algorithm. Local graph partitioning algorithms [ST08,ACL06,AP09] ... More
A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank GraphsDec 08 2012Kolla and Tulsiani [KT07,Kolla11} and Arora, Barak and Steurer [ABS10] introduced the technique of subspace enumeration, which gives approximation algorithms for graph problems such as unique games and small set expansion; the running time of such algorithms ... More
The Asymmetric Traveling Salesman Problem on Graphs with Bounded GenusSep 15 2009Jan 14 2011We give a constant factor approximation algorithm for the asymmetric traveling salesman problem when the support graph of the solution of the Held-Karp linear programming relaxation has bounded orientable genus.
Analytical Coexistence Benchmark for Assessing the Utmost Interference Tolerated by IEEE 802.20Jun 08 2013Whether it is crosstalk, harmonics, or in-band operation of wireless technologies, interference between a reference system and a host of offenders is virtually unavoidable. In past contributions, a benchmark has been established and considered for coexistence ... More
An Exact Path-Loss Density Model for Mobiles in a Cellular SystemJun 04 2013In trying to emulate the spatial position of wireless nodes for purpose of analysis, we rely on stochastic simulation. And, it is customary, for mobile systems, to consider a base-station radiation coverage by an ideal cell shape. For cellular analysis, ... More
Harnessing Simultaneously the Benefits of UWB and MBWA: A Practical ScenarioMay 30 2013UWB has a very large bandwidth in a WPAN network, which is best used for HD-video applications. Meanwhile, MBWA is a WMAN option optimized for wireless-IP in a fast moving vehicle. In this paper, we propose a practical engineering scenario that harnesses ... More
Can Research be Taught?Jun 06 2013The word 'researcher' is loaded and often confusing. It takes years to become one and to master all of its aspects. In this paper, we investigate whether or not this process of 'becoming' can be catalyzed through education. The focus will be on wireless ... More
Quantum light generation on a silicon chip using waveguides and resonatorsOct 04 2012Integrated optical devices may replace bulk crystal or fiber based assemblies with a more compact and controllable photon pair and heralded single photon source and generate quantum light at telecommunications wavelengths. Here, we propose that a periodic ... More
Trees That GrowOct 15 2016We study the notion of extensibility in functional data types, as a new approach to the problem of decorating abstract syntax trees with additional sets of information. We observed the need for such extensibility while redesigning the data types representing ... More
A Higher-Order Cheeger's InequalityJul 13 2011Dec 08 2011A basic fact in algebraic graph theory is that the number of connected components in an undirected graph is equal to the multiplicity of the eigenvalue 1 in the normalized adjacency matrix of the graph. In particular, the graph is disconnected if and ... More
Closed-Form Path-Loss Predictor for Gaussianly Distributed NodesJun 04 2013The emulation of wireless nodes spatial position is a practice used by deployment engineers and network planners to analyze the characteristics of a network. In particular, nodes geolocation will directly impact factors such as connectivity, signals fidelity, ... More
Simple and Generic Simulator Algorithm for Inhomogeneous Random Spatial DeploymentApr 10 2013We conceptualized a straightforward and flexible approach for random spatial inhomogeneity by proposing the area-specific deployment (ASD) algorithm, which takes into account the clustering tendency of users. In fact, the ASD method has the advantage ... More
Two-dimensional Burst Error Correcting Code using Finite Field Fourier TransformsJul 06 2015Aug 02 2015We construct two-dimensional codes for correcting burst errors using the finite field Fourier transform. The encoding procedure is performed in the transformed domain using the conjugacy property of the finite field Fourier transform. The decoding procedure ... More
Security Protection for Magnetic Tunnel JunctionApr 27 2017Energy efficiency is one of the most important parameters for designing and building a computing system nowadays. Introduction of new transistor and memory technologies to the integrated circuits design have brought hope for low energy very large scale ... More
Security Analysis of Tunnel Field-Effect Transistor for Low Power HardwareApr 25 2017Security and energy are considered as the most important parameters for designing and building a computing system nowadays. Today's attacks target different layers of the computing system (i.e. software and hardware). Introduction of new transistor technologies ... More
Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSPNov 17 2014Sep 01 2015We show that the integrality gap of the natural LP relaxation of the Asymmetric Traveling Salesman Problem is $\text{polyloglog}(n)$. In other words, there is a polynomial time algorithm that approximates the value of the optimum tour within a factor ... More
A Universal upper bound on Graph Diameter based on Laplacian EigenvaluesDec 12 2012We prove that the diameter of any unweighted connected graph G is O(k log n/lambda_k), for any k>= 2. Here, lambda_k is the k smallest eigenvalue of the normalized laplacian of G. This solves a problem posed by Gil Kalai.
Design Based Teaching for Science and Engineering StudentsJun 07 2013In this paper, we will explain a successfully proven lecturing method based entirely on system design. Wireless communications will be used as an example to explain this new teaching philosophy.
Resolving the Multiple Withdrawal Attack on ERC20 TokensJul 01 2019Custom tokens are an integral component of decentralized applications (dapps) deployed on Ethereum and other blockchain platforms. For Ethereum, the ERC20 standard is a widely used token interface and is interoperable with many existing dapps, user interface ... More
Dynamic Matching Market DesignFeb 15 2014We introduce a simple benchmark model of dynamic matching in networked markets, where agents arrive and depart stochastically and the network of acceptable transactions among agents forms a random graph. We analyze our model from three perspectives: waiting, ... More
ECG Arrhythmia Classification Using Transfer Learning from 2-Dimensional Deep CNN FeaturesDec 11 2018Due to the recent advances in the area of deep learning, it has been demonstrated that a deep neural network, trained on a huge amount of data, can recognize cardiac arrhythmias better than cardiologists. Moreover, traditionally feature extraction was ... More
SCANN: Synthesis of Compact and Accurate Neural NetworksApr 19 2019Artificial neural networks (ANNs) have become the driving force behind recent artificial intelligence (AI) research. An important problem with implementing a neural network is the design of its architecture. Typically, such an architecture is obtained ... More
SoK: Transparent Dishonesty: front-running attacks on BlockchainFeb 13 2019We consider front-running to be a course of action where an entity benefits from prior access to privileged market information about upcoming transactions and trades. Front-running has been an issue in financial instrument markets since the 1970s. With ... More
Log-Concave Polynomials I: Entropy and a Deterministic Approximation Algorithm for Counting Bases of MatroidsJul 02 2018Nov 05 2018We give a deterministic polynomial time $2^{O(r)}$-approximation algorithm for the number of bases of a given matroid of rank $r$ and the number of common bases of any two matroids of rank $r$. To the best of our knowledge, this is the first nontrivial ... More
ECG Heartbeat Classification: A Deep Transferable RepresentationApr 19 2018Jul 12 2018Electrocardiogram (ECG) can be reliably used as a measure to monitor the functionality of the cardiovascular system. Recently, there has been a great attention towards accurate categorization of heartbeats. While there are many commonalities between different ... More
A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph ProblemMay 07 2012May 08 2012In the k-arc connected subgraph problem, we are given a directed graph G and an integer k and the goal is the find a subgraph of minimum cost such that there are at least k-arc disjoint paths between any pair of vertices. We give a simple (1 + 1/k)-approximation ... More
Second harmonic microscopy of poled x-cut thin film lithium niobate: Understanding the contrast mechanismJun 07 2019Thin film lithium niobate is of great recent interest and an understanding of periodically poled thin-films is crucial for both fundamental physics and device developments. Second-harmonic (SH) microscopy allows for the non-invasive visualization and ... More
Photon pair generation from compact silicon microring resonators using microwatt-level pump powersNov 11 2015Feb 13 2016Microring resonators made from silicon are becoming a popular microscale device format for generating photon pairs at telecommunications wavelengths at room temperature. In compact devices with a footprint less than $5\times 10^{-4}$ mm$^2$, we demonstrate ... More
SoK: Transparent Dishonesty: front-running attacks on BlockchainFeb 13 2019Apr 09 2019We consider front-running to be a course of action where an entity benefits from prior access to privileged market information about upcoming transactions and trades. Front-running has been an issue in financial instrument markets since the 1970s. With ... More
A PAC RL Algorithm for Episodic POMDPsMay 25 2016Jun 01 2016Many interesting real world domains involve reinforcement learning (RL) in partially observable environments. Efficient learning in such domains is important, but existing sample complexity bounds for partially observable RL are at least exponential in ... More
Buy your coffee with bitcoin: Real-world deployment of a bitcoin point of sale terminalFeb 12 2018In this paper we discuss existing approaches for Bitcoin payments, as suitable for a small business for small-value transactions. We develop an evaluation framework utilizing security, usability, deployability criteria,, examine several existing systems, ... More
Revisiting Circular-Based Random Node SimulationJun 03 2013In literature, a stochastic model for spreading nodes in a cellular cell is available. Despite its existence, the current method does not offer any versatility in dealing with sectored layers. Of course, this needed adaptability could be created synthetically ... More
Time-Space Tradeoffs for Learning from Small Test Spaces: Learning Low Degree Polynomial FunctionsAug 08 2017We develop an extension of recently developed methods for obtaining time-space tradeoff lower bounds for problems of learning from random test samples to handle the situation where the space of tests is signficantly smaller than the space of inputs, a ... More
Re-identification of Humans in Crowds using Personal, Social and Environmental ConstraintsDec 07 2016This paper addresses the problem of human re-identification across non-overlapping cameras in crowds.Re-identification in crowded scenes is a challenging problem due to large number of people and frequent occlusions, coupled with changes in their appearance ... More
Monte Carlo Markov Chain Algorithms for Sampling Strongly Rayleigh Distributions and Determinantal Point ProcessesFeb 16 2016Mar 24 2016Strongly Rayleigh distributions are natural generalizations of product and determinantal probability distributions and satisfy strongest form of negative dependence properties. We show that the "natural" Monte Carlo Markov Chain (MCMC) is rapidly mixing ... More
Capacity and Performance of Adaptive MIMO System Based on Beam-NullingJul 23 2008In this paper, we propose a scheme called "beam-nulling" for MIMO adaptation. In the beam-nulling scheme, the eigenvector of the weakest subchannel is fed back and then signals are sent over a generated subspace orthogonal to the weakest subchannel. Theoretical ... More
An Improved Approximation Algorithm for TSP in the Half Integral CaseAug 01 2019We design a $1.49993$-approximation algorithm for the metric traveling salesperson problem (TSP) for instances in which an optimal solution to the subtour linear programming relaxation is half-integral. These instances received significant attention over ... More
Anomaly Generation using Generative Adversarial Networks in Host Based Intrusion DetectionDec 11 2018Generative adversarial networks have been able to generate striking results in various domains. This generation capability can be general while the networks gain deep understanding regarding the data distribution. In many domains, this data distribution ... More
On the Bias of Reed-Muller Codes over Odd Prime FieldsJun 18 2018We study the bias of random bounded-degree polynomials over odd prime fields and show that, with probability exponentially close to 1, such polynomials have exponentially small bias. This also yields an exponential tail bound on the weight distribution ... More
An Analytic Analysis of the Pion Decay Constant in Three-Flavoured Chiral Perturbation TheoryMar 01 2017Oct 05 2017A representation of the two-loop contribution to the pion decay constant in $SU(3)$ chiral perturbation theory is presented. The result is analytic upto the contribution of the three (different) mass sunset integrals, for which an expansion in their external ... More
Wavelet Analysis of the Besov Regularity of Lévy White NoisesJan 28 2018In this paper, we characterize the local smoothness and the asymptotic growth rate of L\'evy white noises. We do so by identifying the weighted Besov spaces in which they are localized. We extend known results in two ways. First, we obtain new bounds ... More
Approximating the Largest Root and Applications to Interlacing FamiliesApr 12 2017We study the problem of approximating the largest root of a real-rooted polynomial of degree $n$ using its top $k$ coefficients and give nearly matching upper and lower bounds. We present algorithms with running time polynomial in $k$ that use the top ... More
TAPER: Time-Aware Patient EHR RepresentationAug 11 2019Effective representation learning of electronic health records is a challenging task and is becoming more important as the availability of such data is becoming pervasive. The data contained in these records are irregular and contain multiple modalities ... More
Space Expansion of Feature Selection for Designing more Accurate Error PredictorsDec 30 2018Approximate computing is being considered as a promising design paradigm to overcome the energy and performance challenges in computationally demanding applications. If the case where the accuracy can be configured, the quality level versus energy efficiency ... More
Simply Exponential Approximation of the Permanent of Positive Semidefinite MatricesApr 11 2017We design a deterministic polynomial time $c^n$ approximation algorithm for the permanent of positive semidefinite matrices where $c=e^{\gamma+1}\simeq 4.84$. We write a natural convex relaxation and show that its optimum solution gives a $c^n$ approximation ... More
A Simply Exponential Upper Bound on the Maximum Number of Stable MatchingsNov 03 2017Nov 08 2017Stable matching is a classical combinatorial problem that has been the subject of intense theoretical and empirical study since its introduction in 1962 in a seminal paper by Gale and Shapley. In this paper, we provide a new upper bound on $f(n)$, the ... More
Language Modelling for Sound Event Detection with Teacher Forcing and Scheduled SamplingJul 19 2019A sound event detection (SED) method typically takes as an input a sequence of audio frames and predicts the activities of sound events in each frame. In real-life recordings, the sound events exhibit some temporal structure: for instance, a "car horn" ... More
Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave UtilitiesDec 15 2016Apr 06 2017Recently Cole and Gkatzelis gave the first constant factor approximation algorithm for the problem of allocating indivisible items to agents, under additive valuations, so as to maximize the Nash Social Welfare. We give constant factor algorithms for ... More
Analytic representation of $F_K/F_π$ in two loop chiral perturbation theoryNov 30 2017Apr 09 2018We present an analytic representation of $F_K/F_\pi$ as calculated in three-flavour two-loop chiral perturbation theory, which involves expressing three mass scale sunsets in terms of Kamp\'e de F\'eriet series. We demonstrate how approximations may be ... More
Composable Core-sets for Determinant Maximization: A Simple Near-Optimal AlgorithmJul 06 2019``Composable core-sets'' are an efficient framework for solving optimization problems in massive data models. In this work, we consider efficient construction of composable core-sets for the determinant maximization problem. This can also be cast as the ... More
Online Stochastic Matching: Online Actions Based on Offline StatisticsJul 09 2010Aug 02 2011We consider the online stochastic matching problem proposed by Feldman et al. [FMMM09] as a model of display ad allocation. We are given a bipartite graph; one side of the graph corresponds to a fixed set of bins and the other side represents the set ... More
Sum Capacity Bounds and Design of Suboptimal Codes for Asynchronous CDMA SystemsMar 17 2019In this paper, we study two issues in asynchronous communication systems. The first issue is the derivation of sum capacity bounds for finite dimensional asynchronous systems. In addition, asymptotic results for the sum capacity bounds are obtained. The ... More
Power Control for Sum Rate Maximization on Interference Channels Under Sum Power ConstraintJul 16 2014In this paper, we consider the problem of power control for sum rate maximization on multiple interfering links (TX-RX pairs)under sum power constraint. We consider a single frequency network, where all pairs are operating in same frequency band,thereby ... More
A first look at the usability of bitcoin key managementFeb 12 2018Bitcoin users are directly or indirectly forced to deal with public key cryptography, which has a number of security and usability challenges that differ from the password-based authentication underlying most online banking services. Users must ensure ... More
Laminar convective heat transfer of shear-thinning liquids in rectangular channels with longitudinal vortex generatorsJul 10 2018Heat and fluid flow in a rectangular channel heat sink equipped with longitudinal vortex generators have been numerically investigated in the range of Reynolds numbers between 25 and 200. Aqueous solutions of carboxymethyl cellulose (CMC) with different ... More
Language Modelling for Sound Event Detection with Teacher Forcing and Scheduled SamplingJul 19 2019Jul 22 2019A sound event detection (SED) method typically takes as an input a sequence of audio frames and predicts the activities of sound events in each frame. In real-life recordings, the sound events exhibit some temporal structure: for instance, a "car horn" ... More
Data-Driven Vehicle Trajectory ForecastingFeb 09 2019An active area of research is to increase the safety of self-driving vehicles. Although safety cannot be guarenteed completely, the capability of a vehicle to predict the future trajectories of its surrounding vehicles could help ensure this notion of ... More
Identifying Benefits and risks associated with utilizing cloud computingJan 21 2014Cloud computing is an emerging computing model where IT and computing operations are delivered as services in highly scalable and cost effective manner. Recently, embarking this new model in business has become popular. Companies in diverse sectors intend ... More
Composable Core-sets for Determinant Maximization Problems via Spectral SpannersJul 31 2018We study a spectral generalization of classical combinatorial graph spanners to the spectral setting. Given a set of vectors $V\subseteq \Re^d$, we say a set $U\subseteq V$ is an $\alpha$-spectral spanner if for all $v\in V$ there is a probability distribution ... More
Multi-way spectral partitioning and higher-order Cheeger inequalitiesNov 04 2011Nov 21 2014A basic fact in spectral graph theory is that the number of connected components in an undirected graph is equal to the multiplicity of the eigenvalue zero in the Laplacian matrix of the graph. In particular, the graph is disconnected if and only if there ... More
Support and Approximation Properties of Hermite SplinesFeb 07 2019In this paper, we formally investigate two mathematical aspects of Hermite splines which translate to features that are relevant to their practical applications. We first demonstrate that Hermite splines are maximally localized in the sense that their ... More
Log-Concave Polynomials II: High-Dimensional Walks and an FPRAS for Counting Bases of a MatroidNov 05 2018Jan 18 2019We design an FPRAS to count the number of bases of any matroid given by an independent set oracle, and to estimate the partition function of the random cluster model of any matroid in the regime where $0<q<1$. Consequently, we can sample random spanning ... More
Embedding by NormalisationMar 16 2016This paper presents the insight that practical embedding techniques, commonly used for implementing Domain-Specific Languages, correspond to theoretical Normalisation-By-Evaluation (NBE) techniques, commonly used for deriving canonical form of terms with ... More
Unsupervised adversarial domain adaptation for acoustic scene classificationAug 17 2018A general problem in acoustic scene classification task is the mismatched conditions between training and testing data, which significantly reduces the performance of the developed methods on classification accuracy. As a countermeasure, we present the ... More
A first look at browser-based CryptojackingMar 07 2018In this paper, we examine the recent trend towards in-browser mining of cryptocurrencies; in particular, the mining of Monero through Coinhive and similar code- bases. In this model, a user visiting a website will download a JavaScript code that executes ... More
Support and Approximation Properties of Hermite SplinesFeb 07 2019Feb 08 2019In this paper, we formally investigate two mathematical aspects of Hermite splines which translate to features that are relevant to their practical applications. We first demonstrate that Hermite splines are maximally localized in the sense that their ... More
Biscotti: A Ledger for Private and Secure Peer-to-Peer Machine LearningNov 24 2018Feb 23 2019Federated Learning is the current state of the art in supporting secure multi-party ML: data is maintained on the owner's device and is aggregated through a secure protocol. However, this process assumes a trusted centralized infrastructure for coordination ... More
An Analytic Approach to Sunset Diagrams in Chiral Perturbation Theory: Theory and PracticeAug 08 2016Jan 09 2017We demonstrate the use of several code implementations of the Mellin-Barnes method available in the public domain to derive analytic expressions for the sunset diagrams that arise in the two-loop contribution to the pion mass and decay constant in three-flavoured ... More
An Analytic Approach to Sunset Diagrams in Chiral Perturbation Theory: Theory and PracticeAug 08 2016We demonstrate the use of several code implementations of the Mellin-Barnes method available in the public domain to derive analytic expressions for the sunset diagrams that arise in the two-loop contribution to the pion mass and decay constant in three-flavoured ... More
Leading Logarithms of the Two Point Function in Massless O(N) and SU(N) Models to any Order from Analyticity and UnitarityMar 19 2018Leading (large) logarithms in non-renormalizable theories have been investigated in the recent past. Besides some general considerations, explicit results for the expansion coefficients (in terms of leading logarithms) of partial wave amplitudes and of ... More
Log-Concave Polynomials III: Mason's Ultra-Log-Concavity Conjecture for Independent Sets of MatroidsNov 05 2018We give a self-contained proof of the strongest version of Mason's conjecture, namely that for any matroid the sequence of the number of independent sets of given sizes is ultra log-concave. To do this, we introduce a class of polynomials, called completely ... More
Everything old is new again: Quoted Domain Specific LanguagesJul 26 2015Aug 04 2015We describe a new approach to domain specific languages (DSLs), called Quoted DSLs (QDSLs), that resurrects two old ideas: quotation, from McCarthy's Lisp of 1960, and the subformula property, from Gentzen's natural deduction of 1935. Quoted terms allow ... More
On the Feasibility of Decentralized Derivatives MarketsFeb 14 2018In this paper, we present Velocity, a decentralized market deployed on Ethereum for trading a custom type of derivative option. To enable the smart contract to work, we also implement a price fetching tool called PriceGeth. We present this as a case study, ... More
Nash Social Welfare, Matrix Permanent, and Stable PolynomialsSep 22 2016Sep 23 2016We study the problem of allocating $m$ items to $n$ agents subject to maximizing the Nash social welfare (NSW) objective. We write a novel convex programming relaxation for this problem, and we show that a simple randomized rounding algorithm gives a ... More
Can New Physics hide inside the proton?May 13 2019Modern global analyses of the structure of the proton include collider measurements which probe energies well above the electroweak scale. While these provide powerful constraints on the parton distribution functions (PDFs), they are also sensitive to ... More
Analytic representations of $m_K$, $F_K$, $m_η$ and $F_η$ in two loop $SU(3)$ chiral perturbation theoryApr 17 2018In this work, we consider expressions for the masses and decay constants of the pseudoscalar mesons in $SU(3)$ chiral perturbation theory. These involve sunset diagrams and their derivatives evaluated at $p^2=m_P^2$ ($P=\pi, K, \eta$). Recalling that ... More
Improved Cheeger's Inequality: Analysis of Spectral Partitioning Algorithms through Higher Order Spectral GapJan 23 2013Let \phi(G) be the minimum conductance of an undirected graph G, and let 0=\lambda_1 <= \lambda_2 <=... <= \lambda_n <= 2 be the eigenvalues of the normalized Laplacian matrix of G. We prove that for any graph G and any k >= 2, \phi(G) = O(k) \lambda_2 ... More