Results for "Saeed Amizadeh"

total 805took 0.12s
Variational Dual-Tree Framework for Large-Scale Transition Matrix ApproximationOct 16 2012In recent years, non-parametric methods utilizing random walks on graphs have been used to solve a wide range of machine learning problems, but in their simplest form they do not scale well due to the quadratic complexity. In this paper, a new dual-tree ... More
The Bregman Variational Dual-Tree FrameworkSep 26 2013Graph-based methods provide a powerful tool set for many non-parametric frameworks in Machine Learning. In general, the memory and computational complexity of these methods is quadratic in the number of examples in the data which makes them quickly infeasible ... More
PDP: A General Neural Framework for Learning Constraint Satisfaction SolversMar 05 2019There have been recent efforts for incorporating Graph Neural Network models for learning full-stack solvers for constraint satisfaction problems (CSP) and particularly Boolean satisfiability (SAT). Despite the unique representational power of these neural ... More
Coded Elastic ComputingDec 16 2018Feb 05 2019Cloud providers have recently introduced low-priority machines to reduce the cost of computations. Exploiting such opportunity for machine learning tasks is challenging inasmuch as low-priority machines can elastically leave (through preemption) and join ... More
Beyond Batch Processing: Towards Real-Time and Streaming Big DataMar 13 2014Aug 01 2014Today, big data is generated from many sources and there is a huge demand for storing, managing, processing, and querying on big data. The MapReduce model and its counterpart open source implementation Hadoop, has proven itself as the de facto solution ... More
Herbrand Consistency of Some Arithmetical TheoriesMay 15 2010Jun 08 2010G\"odel's second incompleteness theorem is proved for Herbrand consistency of some arithmetical theories with bounded induction, by using a technique of logarithmic shrinking the witnesses of bounded formulas, due to Z. Adamowicz [Herbrand consistency ... More
Dynamics of Singular Holomorphic Foliations on the Complex Projective PlaneSep 17 1998This manuscript is an introduction to the theory of holomorphic foliations on the complex projective plane. Historically the subject has emerged from the theory of ODEs in the complex domain and various attempts to solve Hilbert's 16th Problem, but with ... More
About Fall Colorings of GraphsSep 15 2009A fall $k$-coloring of a graph $G$ is a proper $k$-coloring of $G$ such that each vertex of $G$ sees all $k$ colors on its closed neighborhood. In this paper, we answer some questions of \cite{dun} about some relations between fall colorings and some ... More
Computation in Logic and Logic in ComputationDec 20 2016The theory of addition in the domains of natural (N), integer (Z), rational (Q), real (R) and complex (C) numbers is decidable, so is the theory of multiplication in all those domains. By Godel's Incompleteness Theorem the theory of addition and multiplication ... More
Quasicomplemented residuated latticesApr 20 2019In this paper, the class of quasicomplemented residuated lattices is introduced and investigated, as a subclass of residuated lattices in which any prime filter not containing any dense element is a minimal prime filter. The notion of disjunctive residuated ... More
Herbrand Consistency of Some Finite Fragments of Bounded Arithmetical TheoriesOct 09 2011We formalize the notion of Herbrand Consistency in an appropriate way for bounded arithmetics, and show the existence of a finite fragment of ${\rm I\Delta_0}$ whose Herbrand Consistency is not provable in the thoery ${\rm I\Delta_0}$. We also show the ... More
Pyro-Align: Sample-Align based Multiple Alignment system for Pyrosequencing Reads of Large NumberJan 19 2009Pyro-Align is a multiple alignment program specifically designed for pyrosequencing reads of huge number. Multiple sequence alignment is shown to be NP-hard and heuristics are designed for approximate solutions. Multiple sequence alignment of pyrosequenceing ... More
On Fall Colorings of GraphsSep 15 2009A fall $k$-coloring of a graph $G$ is a proper $k$-coloring of $G$ such that each vertex of $G$ sees all $k$ colors on its closed neighborhood. We denote ${\rm Fall}(G)$ the set of all positive integers $k$ for which $G$ has a fall $k$-coloring. In this ... More
Axiomatizing Mathematical Theories: MultiplicationDec 20 2016Axiomatizing mathematical structures is a goal of Mathematical Logic. Axiomatizability of the theories of some structures have turned out to be quite difficult and challenging, and some remain open. However axiomatization of some mathematical structures ... More
Godel's Incompleteness Phenomenon - ComputationallyNov 30 2012Dec 10 2016We argue that Godel's completeness theorem is equivalent to completability of consistent theories, and Godel's incompleteness theorem is equivalent to the fact that this completion is not constructive, in the sense that there are some consistent and recursively ... More
Separating Bounded Arithmetics by Herbrand ConsistencyAug 02 2010Dec 10 2016The problem of $\Pi_1-$separating the hierarchy of bounded arithmetic has been studied in the paper. It is shown that the notion of Herbrand Consistency, in its full generality, cannot $\Pi_1-$separate the theory ${\rm I\Delta_0+\bigwedge_j\Omega_j}$ ... More
Herbrand Consistency of Some Arithmetical TheoriesMay 15 2010Dec 10 2016G\"odel's second incompleteness theorem is proved for Herbrand consistency of some arithmetical theories with bounded induction, by using a technique of logarithmic shrinking the witnesses of bounded formulas, due to Z. Adamowicz [Herbrand consistency ... More
Theorems of Tarski's Undefinability and Godel's Second Incompleteness - ComputationallySep 01 2015Jun 10 2017We present a version of Godel's Second Incompleteness Theorem for recursively enumerable consistent extensions of a fixed axiomatizable theory, by incorporating some bi-theoretic version of the derivability conditions (first discussed by M. Detlefsen ... More
Theorems of Tarski's Undefinability and Godel's Second Incompleteness - ComputationallySep 01 2015We show that the existence of a finitely axiomatized theory which can prove all the true $\Sigma_1$ sentences may imply Godel's Second Incompleteness Theorem, by incorporating some bi-theoretic version of the derivability conditions (first discussed by ... More
Godel's Incompleteness Phenomenon - ComputationallyNov 30 2012Sep 06 2014We argue that Godel's completeness theorem is equivalent to completability of consistent theories, and Godel's incompleteness theorem is equivalent to the fact that this completion is not constructive, in the sense that there are some consistent and recursively ... More
A brief note about the Scott entanglement measureOct 31 2018Scott studied various interesting aspects of multipartite entanglement measures. He has defined a class of related multipartite entanglement measures in the obvious manner. Recently, Jafarpour et al. (Int. J. Quantum Inform. 13, 1550047 2015) have calculated ... More
Approximating Weighted Duo-Preservation in Comparative GenomicsAug 30 2017Motivated by comparative genomics, Chen et al. [9] introduced the Maximum Duo-preservation String Mapping (MDSM) problem in which we are given two strings $s_1$ and $s_2$ from the same alphabet and the goal is to find a mapping $\pi$ between them so as ... More
Learning in anonymous nonatomic games with applications to first-order mean field gamesApr 02 2017We introduce a model of anonymous games with the player dependent action sets. We propose several learning procedures based on the well-known Fictitious Play and Online Mirror Descent and prove their convergence to equilibrium under the classical monotonicity ... More
Numerical study of the one-dimensional quantum compass modelAug 12 2010Jul 25 2012The ground state magnetic phase diagram of the one-dimensional quantum compass model (QCM) is studied using the numerical Lanczos method. A detailed numerical analysis of the low energy excitation spectrum is presented. The energy gap and the spin-spin ... More
On Local Antimagic Chromatic Number of GraphsApr 24 2018A {\it local antimagic labeling} of a connected graph $G$ with at least three vertices, is a bijection $f:E(G) \rightarrow \{1,2,\ldots , |E(G)|\}$ such that for any two adjacent vertices $u$ and $v$ of $G$, the condition $\omega _{f}(u) \neq \omega _{f}(v)$ ... More
On critical points of proper holomorphic maps on the unit diskJun 15 1996We prove that a proper holomorphic map on the unit disk in the complex plane is uniquely determined up to post-composition with a Moebius transformation by its critical points.
On b-continuity Of Kneser Graphs of type KG(2k+1,k)Sep 15 2009Sep 27 2010In this paper, we will introduce an special kind of graph homomorphisms namely semi-locally-surjective graph homomorphisms and show some relations between semi-locally-surjective graph homomorphisms and colorful colorings of graphs and then we prove that ... More
Conformal Fitness and Uniformization of Holomorphically Moving DisksFeb 12 2013Let $\{U_t \}_{t \in {\mathbb D}}$ be a family of topological disks on the Riemann sphere containing the origin 0 whose boundaries undergo a holomorphic motion over the unit disk $\mathbb D$. We study the question of when there exists a family of Riemann ... More
Herbrand Consistency of Some Finite Fragments of Bounded Arithmetical TheoriesOct 09 2011Dec 10 2016We formalize the notion of Herbrand Consistency in an appropriate way for bounded arithmetics, and show the existence of a finite fragment of ${\rm I\Delta_0}$ whose Herbrand Consistency is not provable in the thoery ${\rm I\Delta_0}$. We also show the ... More
Reduced products of metric structures: a metric Feferman-Vaught theoremNov 04 2014Apr 05 2016We extend the classical Feferman-Vaught theorem to logic for metric structures. This implies that the reduced powers of elementarily equivalent structures are elementarily equivalent, and therefore they are isomorphic under the Continuum Hypothesis. We ... More
Separating Bounded Arithmetics by Herbrand ConsistencyAug 02 2010Aug 30 2010The problem of $\Pi_1-$separating the hierarchy of bounded arithmetic has been studied in the paper. It is shown that the notion of Herbrand Consistency, in its full generality, cannot $\Pi_1-$separate the theory ${\rm I\Delta_0+\bigwedge_j\Omega_j}$ ... More
Unique Set Cover on Unit Disks and Unit SquaresJul 25 2016We study the Unique Set Cover problem on unit disks and unit squares. For a given set $P$ of $n$ points and a set $D$ of $m$ geometric objects both in the plane, the objective of the Unique Set Cover problem is to select a subset $D'\subseteq D$ of objects ... More
SAW*-algebras are essentially non-factorizableSep 16 2012Sep 28 2013In this paper we solve a question of Simon Wassermann, whether the Calkin algebra can be written as a C*-tensor product of two infinite dimensional C*-algebras. More generally we show that there is no surjective *-homomorphism from a SAW*-algebra onto ... More
Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many BuyersJun 06 2011Jun 15 2012For Bayesian combinatorial auctions, we present a general framework for approximately reducing the mechanism design problem for multiple buyers to single buyer sub-problems. Our framework can be applied to any setting which roughly satisfies the following ... More
Explicit Solution For Klein-Gordon Equation, in Four Dimensions, For any Arbitrary potential. A New ApproachMay 31 2003Klein-Gordon Equation has been solved in four dimension. The potential has been chosen to be any arbitrary field Potential.
A note on fall colorings of Kneser graphsSep 15 2009Nov 09 2018A fall coloring of a graph G is a proper coloring of G with k colors such that each vertex sees all k colors on its closed neighborhood. In this short note, we characterize all fall colorings of Kneser graphs of type KG(n,2).
On Fall Colorings of Kneser GraphsSep 15 2009A fall k-coloring of a graph G is a proper k-coloring of G such that each vertex of G sees all k colors on its closed neighborhood. In this note, we characterize all fall colorings of Kneser graphs of type KG(n,2) for n\geq2 and study some fall colorings ... More
Conditional gradient type methods for composite nonlinear and stochastic optimizationFeb 02 2016In this paper, we present a conditional gradient type (CGT) method for solving a class of composite optimization problems where the objective function consists of a (weakly) smooth term and a strongly convex term. While including this strongly convex ... More
Gravitational Waves and Inspiraling Compact Binaries in Alternative Theories of GravityAug 23 2013This dissertation consists of four parts. In Part I, we briefly review fundamental theories of gravity, performed experimental tests, and gravitational waves. The framework and the methods that we use in our calculations are discussed in Part II. This ... More
On The Circular Altitude of GraphsFeb 05 2018Peter Cameron introduced the concept of the circular altitude of graphs; a parameter which was shown by Bamberg et al. that provides a lower bound on the circular chromatic number. In this note, we investigate this parameter and show that the circular ... More
A Note on Approximating Weighted Independence on Intersection Graphs of Paths on a GridAug 30 2017Sep 06 2018A graph $G$ is called $B_k$-VPG, for some constant $k\geq 0$, if it has a string representation on an axis-parallel grid such that each vertex is a path with at most $k$ bends and two vertices are adjacent in $G$ if and only if the corresponding paths ... More
Conditional gradient type methods for composite nonlinear and stochastic optimizationFeb 02 2016Jan 01 2018In this paper, we present a conditional gradient type (CGT) method for solving a class of composite optimization problems where the objective function consists of a (weakly) smooth term and a (strongly) convex regularization term. While including a strongly ... More
New physics in inclusive semileptonic $B$ decays including nonperturbative correctionsNov 18 2018Feb 01 2019In this work we study the effects of New Physics (NP) operators on the inclusive $\bar{B} \to X_c \tau^- \bar{\nu}_\tau$ decay including power $(\mathcal{O}(1/m_b^2))$ corrections in the NP operators. In analogy with $R(D^{(*)})$ observables, we study ... More
On Axiomatizability of the Multiplicative Theory of NumbersJul 15 2017Feb 14 2018The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be multiplicative, ... More
Comment on: Multipartite entanglement in four-qubit graph stateJan 29 2017The following comment is based on an article by M. Jafarpour and L. Assadi [Eur. Phys. J. D 70, 62 (2016), doi:10.1140/epjd/e2016-60555-5] which with an exploitation of Scott measure (or generalized Meyer-Wallach measure) the entanglement quantity of ... More
Resource Allocation and Relay Selection for Collaborative CommunicationsOct 24 2008We investigate the relay selection problem for a decode and forward collaborative network. Users are able to collaborate; decode messages of each other, re-encode and forward along with their own messages. We study the performance obtained from collaboration ... More
Concurrence and entanglement entropy in a dimerized spin-1/2 two-leg ladderMay 30 2011Sep 28 2011We consider the isotropic spin-1/2 two-leg ladders with the dominant spatially modulated rung exchanges. We study the effect of a uniform magnetic field on the ground state phase diagram of the model using the perturbation theory and the numerical Lanczos ... More
On the Capacity of Pairwise Collaborative NetworksJul 05 2008We derive expressions for the achievable rate region of a collaborative coding scheme in a two-transmitter, two-receiver Pairwise Collaborative Network (PCN) where one transmitter and receiver pair, namely relay pair, assists the other pair, namely the ... More
An extension of compact operators by compact operators with no nontrivial multipliersSep 15 2016We construct an essential extension of $\mathcal K(\ell_2({\mathfrak{c}}))$ by $\mathcal K(\ell_2)$, where ${\mathfrak{c}}$ denotes the cardinality of continuum, i.e., a $C^*$-algebra $\mathcal A\subseteq \mathcal B(\ell_2)$ satisfying the short exact ... More
On biaccessible points in the Julia set of a Cremer quadratic polynomialJan 15 1998We prove that the only possible biaccessible points in the Julia set of a Cremer quadratic polynomial are the Cremer fixed point and its preimages. This gives a partial answer to a question posed by C. McMullen on whether such a Julia set can contain ... More
Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic ProgrammingSep 22 2013In this paper, we introduce a new stochastic approximation (SA) type algorithm, namely the randomized stochastic gradient (RSG) method, for solving an important class of nonlinear (possibly nonconvex) stochastic programming (SP) problems. We establish ... More
On certain maximal hyperelliptic curves related to Chebyshev polynomialsFeb 17 2019Mar 08 2019We study hyperelliptic curves arising from Chebyshev polynomials. The aim of this paper is to characterize the pairs $(q,d)$ such that the hyperelliptic curve $\cC$ over a finite field $\FF_{q^2}$ corresponding to the equation $y^2 = \varphi_{d}(x)$ is ... More
An Overview of Multiple Sequence Alignment SystemsJan 18 2009An overview of current multiple alignment systems to date are described.The useful algorithms, the procedures adopted and their limitations are presented.We also present the quality of the alignments obtained and in which cases(kind of alignments, kind ... More
Modelling of Walking Humanoid Robot With Capability of Floor Detection and Dynamic Balancing Using Colored Petri NetApr 10 2014Most humanoid robots have highly complicated structure and design of robots that are very similar to human is extremely difficult. In this paper, modelling of a general and comprehensive algorithm for control of humanoid robots is presented using Colored ... More
First-Order Continuous Induction, and a Logical Study of Real Closed FieldsNov 01 2018Apr 11 2019Over the last century, the principle of "induction on the continuum" has been studied by different authors in different formats. All of these different readings are equivalent to one of the three versions that we isolate in this paper. We also formalize ... More
Independent sets of some graphs associated to commutative ringsJan 08 2013Let $G=(V,E)$ be a simple graph. A set $S\subseteq V$ is independent set of $G$, if no two vertices of $S$ are adjacent. The independence number $\alpha(G)$ is the size of a maximum independent set in the graph. %An independent set with cardinality Let ... More
Universal AF-algebrasMar 25 2019We study the approximately finite-dimensional (AF) $C^*$-algebras that appear as inductive limits of sequences of finite-dimensional $C^*$-algebras and left-invertible embeddings. We show that there is such a separable AF-algebra $\mathcal A_\mathfrak{F}$ ... More
A Sawtooth Permanent Magnetic Lattice for Ultracold Atoms and BECsJan 28 2011We propose a new permanent magnetic lattice for creating periodic arrays of Ioffe-Pritchard permanent magnetic microtraps for holding and controlling ultracold atoms and Bose-Einstein condensates (BECs). Lattice can be designed on thin layer of magnetic ... More
On Ext-indices of ring extensionsDec 18 2007In this paper we are concerned with the finiteness property of Ext-indices of several ring extensions. In this direction, we introduce some conjectures and discuss the relationship of them. Also we give affirmative answers to these conjectures in some ... More
$n$-normal residuated latticesDec 30 2018The notion of $n$-normal residuated lattice, as a class of residuated lattices in which every prime filter contains at most $n$ minimal prime filters, is introduced and studied. Before that, the notion of $\omega$-filter is introduced and it is observed ... More
Spatial-Spectral Sensing using the Shrink & Match Algorithm in Asynchronous MIMO OFDM SignalsMar 14 2013Mar 28 2013Spectrum sensing (SS) in cognitive radio (CR) systems is of paramount importance to approach the capacity limits for the Secondary Users (SU), while ensuring the undisturbed transmission of Primary Users (PU). In this paper, we formulate a cognitive radio ... More
On Margulis cusps of hyperbolic 4-manifoldsApr 19 2013Jul 30 2013We study the geometry of the Margulis region associated with an irrational screw translation $g$ acting on the 4-dimensional real hyperbolic space. This is an invariant domain with the parabolic fixed point of $g$ on its boundary which plays the role ... More
Local rings with quasi-decomposable maximal idealApr 03 2017Aug 08 2018Let $(R,\frak m)$ be a commutative noetherian local ring. In this paper, we prove that if $\frak m$ is decomposable, then for any finitely generated $R$-module $M$ of infinite projective dimension $\frak m$ is a direct summand of (a direct sum of) syzygies ... More
Study of the effect of nearest neighbors on ferromagnetic to paramagnetic phase transition in 2d lattices by Monte Carlo algorithmOct 02 2016In this work we try to use the Monte Carlo algorithm, metropolis, and study the behavior of 2D magnetic systems; Honeycomb, Hexagonal and square lattices. In this study we use Heisenberg Model of magnetism, with considering only nearest neighbors in the ... More
Maximizing Sequence-Submodular Functions and its Application to Online AdvertisingSep 21 2010In this paper we study a general class of online maximization problems which are as follows. We are given a time constraint T. We have to choose a sequence of actions from a set of possible actions and also the length of time to run each action subject ... More
Andre-Quillen homology and complete intersection dimensionsJul 02 2013Jul 24 2013We study the relation between the vanishing of Andre-Quillen homology and complete intersection dimensions. As an application, we solve a problem of Avramov and Iyengar related to Quillen's conjecture. We also extend some of the existing results in the ... More
Emergent Space-Time via a Geometric Renormalization MethodJun 26 2016We present a purely geometric renormalization scheme for metric spaces (including uncolored graphs), which consists of a coarse graining and a rescaling operation on such spaces. The coarse graining is based on the concept of quasi-isometry, which yields ... More
Constructibility and Rosserizability of the Proofs of Boolos and Chaitin for Godel's Incompleteness TheoremDec 08 2016The proofs of Chaitin and Boolos for Godel's Incompleteness Theorem are studied from the perspectives of constructibility and Rosserizability. By Rosserization of a proof we mean that the independence of the true but unprovable sentence can be shown by ... More
Noncommutative Cantor-Bendixson derivatives and scattered $C^*$-algebrasNov 01 2016We analyze the sequence obtained by consecutive applications of the Cantor-Bendixson derivative for a noncommutative scattered $C^*$-algebra $\mathcal A$, using the ideal $\mathcal I^{At}(\mathcal A)$ generated by the minimal projections of $\mathcal ... More
Random Walk Sampling for Big Data over NetworksApr 16 2017It has been shown recently that graph signals with small total variation can be accurately recovered from only few samples if the sampling set satisfies a certain condition, referred to as the network nullspace property. Based on this recovery condition, ... More
A New Method To Find The Nash Equilibrium Point in Financial Transmission Rights Bidding ProblemFeb 21 2019Financial transmission right (FTR) is an important tool and an especially feature for stopping congestion charges in restructured electricity markets. Participants in the transmission market as players are assumed to be a generation company (Gencos) which ... More
A Unified Analysis Approach for LMS-based Variable Step-Size AlgorithmsJan 11 2015The least-mean-squares (LMS) algorithm is the most popular algorithm in adaptive filtering. Several variable step-size strategies have been suggested to improve the performance of the LMS algorithm. These strategies enhance the performance of the algorithm ... More
Sample-Align-D: A High Performance Multiple Sequence Alignment System using Phylogenetic Sampling and Domain DecompositionJan 18 2009Multiple Sequence Alignment (MSA) is one of the most computationally intensive tasks in Computational Biology. Existing best known solutions for multiple sequence alignment take several hours (in some cases days) of computation time to align, for example, ... More
On Arithmetical Truth of the Self-Referential SentencesJul 14 2016Feb 14 2018We take an argument of G\"odel's from his ground-breaking 1931 paper, generalize it, and examine its validity. The argument in question is this: the sentence $G$ says about itself that it is not provable, and $G$ is indeed not provable; therefore, $G$ ... More
Zeroth-order Nonconvex Stochastic Optimization: Handling Constraints, High-Dimensionality and Saddle-PointsSep 17 2018Jan 14 2019In this paper, we propose and analyze zeroth-order stochastic approximation algorithms for nonconvex and convex optimization, with a focus on addressing constrained optimization, high-dimensional setting and saddle-point avoiding. To handle constrained ... More
Teaching Quality Assurance and Project Management to Undergraduate Computing Students in PakistanJun 30 2009Software Project Management (SPM) and Software Quality Assurance (SQA) are key components of undergraduate Computing programmes at educational establishments in Pakistan. Because of the nature of these subjects, there are a number of issues that need ... More
A Note on Approximating 2-TransmittersDec 05 2015A k-transmitter in a simple orthogonal polygon P is a mobile guard that travels back and forth along an orthogonal line segment s inside P. The k-transmitter can see a point p in P if there exists a point q on s such that the line segment pq is normal ... More
The hull-kernel topology on residuated latticesDec 30 2018The notion of hull-kernel topology on a collection of prime filters in a residuated lattice is introduced and investigated. It is observed that any collection of prime filters is a $T_0$ topological space under the hull-kernel and the dual hull-kernel ... More
Godel-Rosser's Incompleteness Theorems for Non-Recursively Enumerable TheoriesJun 09 2015Dec 10 2016Godel's First Incompleteness Theorem is generalized to definable theories, which are not necessarily recursively enumerable, by using a couple of syntactic-semantic notions, one is the consistency of a theory with the set of all true $\Pi_n$-sentences ... More
Constrained Orthogonal Segment StabbingApr 30 2019Let $S$ and $D$ each be a set of orthogonal line segments in the plane. A line segment $s\in S$ \emph{stabs} a line segment $s'\in D$ if $s\cap s'\neq\emptyset$. It is known that the problem of stabbing the line segments in $D$ with the minimum number ... More
On a Certain Fallacy (probably committed by Godel)Jul 14 2016We take an argument of G\"odel's from his groundbreaking 1931 paper, generalize it, and examine its (in)validity. The argument in question is this: "$A$ says of itself that it has property $F$, and $A$ does have property $F$; therefore, $A$ is true."
Kernel-based Detection of Coincidentally Correct Test Cases to Improve Fault Localization EffectivenessMar 25 2018Although empirical studies have confirmed the effectiveness of spectrum-based fault localization (SBFL) techniques, their performance may be degraded due to presence of some undesired circumstances such as the existence of coincidental correctness (CC) ... More
FPA-FL: Incorporating Static Fault-proneness Analysis into Statistical Fault LocalizationDec 09 2017Despite the proven applicability of the statistical methods in automatic fault localization, these approaches are biased by data collected from different executions of the program. This biasness could result in unstable statistical models which may vary ... More
A Bennett Inequality for the Missing MassMar 20 2015Dec 01 2015Novel concentration inequalities are obtained for the missing mass, i.e. the total probability mass of the outcomes not observed in the sample. We derive distribution-free deviation bounds with sublinear exponents in deviation size for missing mass and ... More
openCoT: The opensource Cloud of Things platformJan 02 2019In order to address the complexity and extensiveness of technology, Cloud Computing is utilized with four main service models. The most recent service model, function-as-a-service, enables developers to develop their application in a function-based structure ... More
$C^1$ Quintic Splines on Domains Enclosed by Piecewise Conics and Numerical Solution of Fully Nonlinear Elliptic EquationsFeb 17 2016We introduce bivariate $C^1$ piecewise quintic finite element spaces for curved domains enclosed by piecewise conics satisfying homogeneous boundary conditions, construct local bases for them using Bernstein-B\'ezier techniques, and demonstrate the effectiveness ... More
Probability of Stability of Synchronization in Random Networks of Mismatched OscillatorsJul 27 2014The stability of synchronization state in networks of oscillators are studied under the assumption that oscillators and their couplings have slightly mismatched parameters. A generalized master stability function is provided that takes the mismatches ... More
Quantum corrections of the biquadratic interaction in the 1D spin-1/2 frustrated ferromagnetic systemsApr 13 2012Quantum corrections of the biquadratic interaction in the 1D spin-1/2 frustrated ferromagnetic Heisenberg model are studied. The biquadratic interaction for spin-1/2 chains is eliminated and transformed to the quadratic interaction. Doing a numerical ... More
Variational problems without having any non-trivial Lie variational symmetriesJul 02 2010In this paper we construct variational problems without Lie non-trivial variational symmetry and solving them using new class of symmetries ($\mu$-symmetry) which introduced by Guiseppe Gaeta and Paola Morando (2004). The central object in this paper ... More
Synchronization Probability in Large Random NetworksNov 26 2012In a generalized framework, where multi-state and inter-state linkages are allowed, we derive a sufficient condition for the stability of synchronization in a network of chaotic attractors. This condition explicitly relates the network structure and the ... More
Group analysis for generalized reaction-diffusion convection equationJul 07 2010symmetry, group classification, differential invariants, Lie-classical method,infinitesimal criterion method, RDC equation, KPP equation, similarity solutions.
Robust PI Control Design Using Particle Swarm OptimizationJun 14 2010This paper presents a set of robust PI tuning formulae for a first order plus dead time process using particle swarm optimization. Also, tuning formulae for an integrating process with dead time, which is a special case of a first order plus dead time ... More
Accelerated Gradient Methods for Nonconvex Nonlinear and Stochastic ProgrammingOct 14 2013In this paper, we generalize the well-known Nesterov's accelerated gradient (AG) method, originally designed for convex smooth optimization, to solve nonconvex and possibly stochastic optimization problems. We demonstrate that by properly specifying the ... More
Can Adversarially Robust Learning Leverage Computational Hardness?Oct 02 2018Nov 06 2018Making learners robust to adversarial perturbation at test time (i.e., evasion attacks) or training time (i.e., poisoning attacks) has emerged as a challenging task. It is known that for some natural settings, sublinear perturbations in the training phase ... More
Kripke Semantics for Fuzzy LogicsJul 14 2016Dec 10 2016Kripke frames (and models) provide a suitable semantics for sub-classical logics, for example Intuitionistic Logic (of Brouwer and Heyting) axiomatizes the reflexive and transitive Kripke frames (with persistent satisfaction relations), and the Basic ... More
Loading Arbitrary Knowledge Bases in Matrix BrowserJun 30 2009This paper describes the work done on Matrix Browser, which is a recently developed graphical user interface to explore and navigate complex networked information spaces. This approach presents a new way of navigating information nets in windows explorer ... More
Multi-Armed Bandit for Energy-Efficient and Delay-Sensitive Edge Computing in Dynamic Networks with UncertaintyApr 12 2019In the emerging edge-computing paradigm, mobile devices offload the computational tasks to an edge server by routing the required data over the wireless network. The full potential of edge-computing becomes realized only if the devices select the most ... More
On Decidability of the Ordered Structures of NumbersSep 15 2017Feb 14 2018The ordered structures of natural, integer, rational and real numbers are studied here. It is known that the theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language of order and ... More
On Constructivity and the Rosser Property: a closer look at some Gödelean proofsDec 08 2016Feb 14 2018The proofs of Kleene, Chaitin and Boolos for G\"odel's First Incompleteness Theorem are studied from the perspectives of constructivity and the Rosser property. A proof of the incompleteness theorem has the Rosser property when the independence of the ... More
Diagonalizing by Fixed-PointsMar 04 2013Dec 10 2016A universal schema for diagonalization was popularized by N. S. Yanofsky (2003) in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function. It was shown that many self-referential ... More