total 183took 0.12s

Practical Issues of Action-conditioned Next Image PredictionFeb 08 2018The problem of action-conditioned image prediction is to predict the expected next frame given the current camera frame the robot observes and an action selected by the robot. We provide the first comparison of two recent popular models, especially for ... More

Structure of nilpotent Lie algebra by its multiplierMar 08 2010For a finite dimensional Lie algebra $L$, it is known that $s(L)=\f{1}{2}(n-1)(n-2)+1-\mathrm{dim} M(L)$ is non negative. Moreover, the structure of all finite nilpotent Lie algebras is characterized when $s(L)=0,1$ in \cite{ni,ni4}. In this paper, we ... More

A Short Proof of the Bernstein Inequality for Formal Power SeriesAug 30 2017Let $k$ be a field of characteristic zero, let $R$ be the ring of formal power series in $n$ variables over $k$ and let $D(R,k)$ be the ring of $k-$linear differential operators in $R$. If $M$ is a finitely generated $D(R,k)-$module then $d(M)\geq n$ ... More

Valuation SemiringsSep 10 2015Mar 30 2017The main scope of this paper is to introduce valuation semirings in general and discrete valuation semirings in particular. In order to do that, first we define valuation maps and investigate them. Then we define valuation semirings with the help of valuation ... More

On zero-divisors of semimodules and semialgebrasFeb 02 2017Mar 25 2018In Section 1 of the paper, we prove McCoy's property for the zero-divisors of polynomials in semirings. We also investigate zero-divisors of semimodules and prove that under suitable conditions, the monoid semimodule $M[G]$ has very few zero-divisors ... More

Classifying $p$-groups via their multiplierMar 04 2010The author in $($On the order of Schur multiplier of non-abelian $p$-groups. J. Algebra (2009).322: 4479--4482$)$ showed that for any $p$-group $G$ of order $p^n$ there exists a nonnegative integer $s(G)$ such that the order of Schur multiplier of $G$ ... More

Characterizing finite $p$-groups by their Schur multipliersJan 24 2010It has been proved in \cite{ge} for every $p$-group of order $p^n$, $|\mathcal{M}(G)|=p^{\f{1}{2}n(n-1)-t(G)}$, where $t(G)\geq 0$. In \cite{be, el, zh}, the structure of $G$ has been characterized for $t(G)=0,1,2,3$ by several authors. Also in \cite{sa}, ... More

Zero-Divisors of Content AlgebrasJun 22 2010Sep 02 2015In this article, we prove that in content extentions minimal primes extend to minimal primes and discuss zero-divisors of a content algebra over a ring who has Property (A) or whose set of zero-divisors is a finite union of prime ideals. We also examine ... More

A Simple Criterion for Irrationality of Some Real NumbersJun 20 2018Jul 29 2018In this paper, we calculate the limit of the average of the decimals of some real numbers. For example, we show that the limit of the average of the decimals of simply normal numbers is 9/2. We also prove that if a real number $r$ cannot be represented ... More

Eversible and reversible semigroups and semiringsFeb 14 2019The main purpose of this paper is to investigate the zero-divisors of semigroups with zero and semirings and in particular, to discuss eversible and reversible semigroups and semirings. We also introduce a new ring-like algebraic structure called prenearsemiring ... More

Pseudocomplementation and Minimal Prime Ideals in SemiringsMar 27 2017In the first section of the present work, we introduce the concept of pseudocomplementation for semirings and show semiring version of some known results in lattice theory. We also introduce semirings with pc-functions and prove some interesting results ... More

Some remarks on semirings and their idealsApr 02 2018Nov 19 2018In this paper, we give semiring version of some classical results in commutative algebra related to Euclidean rings, PIDs, UFDs, G-domains, and GCD and integrally closed domains.

On the Anderson-Badawi $ω_{R[X]}(I[X])=ω_R(I)$ conjectureJan 02 2014Apr 18 2016Let $R$ be a commutative ring with an identity different from zero and $n$ be a positive integer. Anderson and Badawi, in their paper on $n$-absorbing ideals, define a proper ideal $I$ of a commutative ring $R$ to be an $n$-absorbing ideal of $R$, if ... More

Zero-divisors of semigroup modulesFeb 09 2010Apr 12 2018Let $M$ be an $R$-module and $S$ a semigroup. Our goal is to discuss zero-divisors of the semigroup module $M[S]$. Particularly we show that if $M$ is an $R$-module and $S$ a commutative, cancellative and torsion-free monoid, then the $R[S]$-module $M[S]$ ... More

Auslander ModulesMay 11 2017Jan 25 2018In this paper, we introduce the notion of Auslander modules, inspired from Auslander's zero-divisor conjecture (theorem) and give some interesting results for these modules. We also investigate torsion-free modules.

On piecewise expanding mapsNov 25 2017Apr 02 2019We study the statistical properties of piecewise expanding maps in the general setting of metric measure spaces. We provide sufficient conditions for exponential mixing of such systems with explicit estimates on the constants. We also provide sufficient ... More

Zero-divisors of semigroup modulesFeb 09 2010Sep 02 2015Let $M$ be an $R$-module and $S$ a semigroup. Our goal is to discuss zero-divisors of the semigroup module $M[S]$. Particularly we show that if $M$ is an $R$-module and $S$ a commutative, cancellative and torsion-free monoid, then the $R[S]$-module $M[S]$ ... More

On piecewise expanding mapsNov 25 2017Oct 18 2018We study the statistical properties of piecewise expanding maps in the general setting of metric measure spaces. We provide sufficient conditions for exponential mixing of such systems with explicit estimates on the constants. We also provide sufficient ... More

A New Lower Bound for Semigroup Orthogonal Range SearchingMar 19 2019We report the first improvement in the space-time trade-off of lower bounds for the orthogonal range searching problem in the semigroup model, since Chazelle's result from 1990. This is one of the very fundamental problems in range searching with a long ... More

Some properties on the tensor square of Lie algebrasJun 11 2010Oct 31 2011In the present paper we extend and improve the results of \cite{bl, br} for the tensor square of Lie algebras. More precisely, for any Lie algebra $L$ with $L/L^2$ of finite dimension, we prove $L\otimes L\cong L\square L\oplus L\wedge L$ and $Z^{\wedge}(L)\cap ... More

Some Remarks on Ideals of Commutative SemiringsMay 03 2018The main purpose of this paper is to investigate prime, primary, and maximal ideals of semirings. The localization and primary decomposition of ideals in semirings are also studied.

Eisenstein's Irreducibility Criterion for Polynomials over SemiringsNov 06 2018Nov 19 2018In this short note, we generalize Eisenstein's irreducibility criterion for semirings.

Non abelian tensor square of non abelian prime power groupsDec 16 2010Jan 09 2015For every $p$-group of order $p^n$ with the derived subgroup of order $p^m$, Rocco in \cite{roc} has shown that the order of tensor square of $G$ is at most $p^{n(n-m)}$. In the present paper not only we improve his bound for non-abelian $p$-groups but ... More

Valuation SemiringsSep 10 2015Sep 13 2016The main task of this paper is to introduce valuation semirings in general and discrete valuation semirings in particular. In order to do that, first we define valuation maps and investigate them. Then we define valuation semirings with the help of valuation ... More

On the tensor square of non-abelian nilpotent finite dimensional Lie algebrasFeb 12 2010Jul 02 2010For every finite $p$-group $G$ of order $p^n$ with derived subgroup of order $p^m$, Rocco in \cite{roc} proved that the order of tensor square of $G$ is at most $p^{n(n-m)}$. This upper bound has been improved recently by author in \cite{ni}. The aim ... More

On the Content of Polynomials Over Semirings and Its ApplicationsAug 28 2012Sep 08 2015In this paper, we prove that Dedekind-Mertens lemma holds only for those semimodules whose subsemimodules are subtractive. We introduce Gaussian semirings and prove that bounded distributive lattices are Gaussian semirings. Then we introduce weak Gaussian ... More

Content Algebras Over Commutative Rings With Zero-DivisorsJul 11 2008Sep 02 2015Let $M$ be an $R$-module and $c$ the function from $M$ to the ideals of $R$ defined by $c(x) = \cap \lbrace I \colon I \text{is an ideal of} R \text{and} x \in IM \rbrace $. $M$ is said to be a content $R$-module if $x \in c(x)M $, for all $x \in M$. ... More

Algebraic properties of expectation semiringsNov 19 2018In this paper, we investigate the algebraic properties of the expectation semirings which are semiring version of the concept of trivial extension in ring theory. We discuss ideals, primes, maximals and primary ideals of these semirings. We also discuss ... More

Characterizing finite $p$-groups by their Schur multipliers, $t(G)=5$Jan 25 2010Dec 07 2013Let $G$ be a finite $p$-group of order $p^n$. It is known that $|\mathcal{M}(G)|=p^{\f{1}{2}n(n-1)-t(G)}$ and $t(G)\geq 0$. The structure of $G$ characterized when $t(G)\leq 4$ in \cite{be,el,ni,sa,zh}. The structure description of $G$ is determined in ... More

Stretched-exponential mixing for $\mathscr{C}^{1+α}$ skew products with discontinuitiesMay 27 2014Consider the skew product $F:\mathbb{T}^2 \to \mathbb{T}^2$, $F(x,y)= (f(x),y+\tau(x))$, where $f:\mathbb{T}^1\to \mathbb{T}^1$ is a piecewise $\mathscr{C}^{1+\alpha}$ expanding map on a countable partition and $\tau:\mathbb{T}^1 \to \mathbb{R}$ is piecewise ... More

Coarse Network Coding: A Simple Relay Strategy to Resolve InterferenceSep 07 2010Sep 08 2010Reminiscent of the parity function in network coding for the butterfly network, it is shown that forwarding an even/odd indicator bit for a scalar quantization of a relay observation recovers 1 bit of information at the two destinations in a noiseless ... More

Uncertainty decomposition and robust stability of uncertain linear stochastic quantum networksSep 26 2016This paper presents a systematic method to analyze the robustness of uncertain linear stochastic quantum systems (LSQS), when uncertainties are defined in optical realization. A decomposition theorem is stated which separates the nominal and uncertain ... More

DeepPos: Deep Supervised Autoencoder Network for CSI Based Indoor LocalizationNov 27 2018The widespread mobile devices facilitated the emergence of many new applications and services. Among them are location-based services (LBS) that provide services based on user's location. Several techniques have been presented to enable LBS even in indoor ... More

Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay ChannelsSep 05 2006This paper describes an efficient implementation of binning for the relay channel using low-density parity-check (LDPC) codes. We devise bilayer LDPC codes to approach the theoretically promised rate of the decode-and-forward relaying strategy by incorporating ... More

The structure, capability and the Schur multiplier of generalized Heisenberg Lie algebrasJun 15 2017Jul 07 2017From [Problem 1729, Groups of prime power order, Vol. 3], Berkovich et al. asked to obtain the Schur multiplier and the representation of a group $G$, when $G$ is a special $p$-group minimally generated by $d$ elements and $|G'|=p^{\frac{1}{2}d(d-1)}$. ... More

Characterization of finite dimensional nilpotent Lie algebras by the dimension of their Schur multipliers, $s(L)=5$Feb 11 2019It is known that the dimension of the Schur multiplier of a non-abelian nilpotent Lie algebra $L$ of dimension $n$ is equal to $\frac{1}{2}(n-1)(n-2)+1-s(L)$ for some $ s(L)\geq0 $. The structure of all nilpotent Lie algebras has been given for $ s(L) ... More

Sorting and Permuting without Bank Conflicts on GPUsJul 06 2015In this paper, we look at the complexity of designing algorithms without any bank conflicts in the shared memory of Graphical Processing Units (GPUs). Given input of size $n$, $w$ processors and $w$ memory banks, we study three fundamental problems: sorting, ... More

A Nonlinear Approach to Interference AlignmentJun 01 2011Cadambe and Jafar (CJ) alignment strategy for the K-user scalar frequency-selective fading Gaussian channel, with encoding over blocks of 2n+1 random channel coefficients (subcarriers) is considered. The linear zero-forcing (LZF) strategy is compared ... More

On Achievability of Gaussian Interference Channel Capacity to within One BitJan 13 2011Feb 07 2011In the earlier version of this paper, it was wrongly claimed that time-sharing is required to achieve the capacity region of the Gaussian interference channel to within one bit, especially at corner points. The flaw in the argument of the earlier version ... More

Fast Multi-Layer Laplacian EnhancementJun 23 2016A novel, fast and practical way of enhancing images is introduced in this paper. Our approach builds on Laplacian operators of well-known edge-aware kernels, such as bilateral and nonlocal means, and extends these filter's capabilities to perform more ... More

Approximation and Inapproximability Results for Maximum Clique of Disc Graphs in High DimensionsDec 31 2006Mar 14 2009We prove algorithmic and hardness results for the problem of finding the largest set of a fixed diameter in the Euclidean space. In particular, we prove that if $A^*$ is the largest subset of diameter $r$ of $n$ points in the Euclidean space, then for ... More

On 2-absorbing ideals of commutative semiringsMay 30 2018In Section 2, we investigate 2-absorbing ideals of commutative semirings. In Section 3, we characterize those semirings that their 2-absorbing ideals are prime.

Synthetic Human Model Dataset for Skeleton Driven Non-rigid Motion Tracking and 3D ReconstructionMar 07 2019We introduce a synthetic dataset for evaluating non-rigid 3D human reconstruction based on conventional RGB-D cameras. The dataset consist of seven motion sequences of a single human model. For each motion sequence per-frame ground truth geometry and ... More

A note on some special $p$-groupsJul 13 2018Recently Rai obtained an upper bound for the order of the Schur multiplier of a $d$-generator special $p$-group when its derived subgroup has the maximum value $ p^{\frac{1}{2}d(d-1)}$ for $ d\geq 3 $ and $ p\neq 2. $ Here we try to obtain the Schur multiplier, ... More

Characterizing nilpotent Lie algebras rely on the dimension of their $2$-nilpotent multipliersJun 03 2018Jul 02 2018There are some results on nilpotent Lie algebras $ L $ investigate the structure of $ L $ rely on the study of its $2$-nilpotent multiplier. It is showed that the dimension of the $2$-nilpotent multiplier of $ L $ is equal to $ \frac{1}{3} n(n-2)(n-1)+3-s_2(L).$ ... More

The Schur multiplier, the non-abelian tensor and exterior square of some Heisenberg Lie algebrasJul 29 2018Recently, the authors obtained the Schur multiplier, the tensor square and the non-abelian exterior square of $d$-generator generalized Heisenberg Lie algebras of rank $ \frac{1}{2}d(d-1).$ Here, we intend to obtain the same for a $d$-generator generalized ... More

Correlation-induced triplet superconductivity on the graphene latticeAug 04 2009We investigate the possibility of superconductivity on the graphene lattice within the repulsive Hubbard model using the variational cluster approximation (VCA). We find that singlet superconductivity is impossible; instead, triplet superconductivity ... More

Some results on the Schur multiplier of nilpotent Lie algebrasJan 14 2017For a non-abelian Lie algebra $L$ of dimension $n$ with the derived subalgebra of dimension $m$ , the first author earlier proved that the dimension of its Schur multiplier is bounded by $\frac{1}{2}(n+m-2)(n-m-1)+1$. In the current work, we give some ... More

Zero-divisor graphs of nilpotent-free semigroupsDec 01 2011May 21 2012We find strong relationships between the zero-divisor graphs of apparently disparate kinds of nilpotent-free semigroups by introducing the notion of an \emph{Armendariz map} between such semigroups, which preserves many graph-theoretic invariants. We ... More

Relay Strategies Based on Cross-Determinism for the Broadcast Relay ChannelOct 11 2010We consider a two-user Gaussian multiple-input multiple-output (MIMO) broadcast channel with a common multiple-antenna relay, and a shared digital (noiseless) link between the relay and the two destinations. For this channel, this paper introduces an ... More

A remark on the capability of finite $p$-groupsMar 25 2010In this paper we classify all capable finite $p$-groups with derived subgroup of order $p$ and $G/G'$ of rank $n-1$.

On 2-absorbing ideals of commutative semiringsMay 30 2018Mar 11 2019In this paper, we investigate 2-absorbing ideals of commutative semirings and prove that if $\mathfrak{a}$ is a nonzero proper ideal of a subtractive valuation semiring $S$ then $\mathfrak{a}$ is a 2-absorbing ideal of $S$ if and only if $\mathfrak{a}=\mathfrak{p}$ ... More

Exponential Mixing for Skew Products with DiscontinuitiesMay 27 2014We consider the skew product $F: (x,u) \mapsto (f(x), u + \tau(x))$, where the base map $f : \mathbb{T}^{1} \to \mathbb{T}^{1}$ is piecewise $\mathcal{C}^{2}$, covering and uniformly expanding, and the fibre map $\tau : \mathbb{T}^{1} \to \mathbb{R}$ ... More

The Hubbard model on the triangular lattice: Spiral order and spin liquidNov 02 2007Apr 15 2008We investigate the half-filled Hubbard model on an isotropic triangular lattice with the variational cluster approximation. By decreasing the on-site repulsion $U$ (or equivalently increasing pressure) we go from a phase with long range, three-sublattice, ... More

Style-Transfer via Texture-SynthesisSep 10 2016Sep 20 2016Style-transfer is a process of migrating a style from a given image to the content of another, synthesizing a new image which is an artistic mixture of the two. Recent work on this problem adopting Convolutional Neural-networks (CNN) ignited a renewed ... More

On the complexity of range searching among curvesJul 15 2017Modern tracking technology has made the collection of large numbers of densely sampled trajectories of moving objects widely available. We consider a fundamental problem encountered when analysing such data: Given $n$ polygonal curves $S$ in $\mathbb{R}^d$, ... More

Eventually Expanding MapsJul 29 2008Aug 17 2011In this paper we show that the piecewise linear map f(x) = px for x in [0,1/p], and sx-s/p for x in (1/p,1], p > 1, 0 < s < 1 which has an expanding, onto branch and a contracting branch is eventually piecewise expanding and exact.

On the dimension of Schur multiplier of Lie algebras of maximal classDec 01 2017The paper is devoted to obtain an upper bound for the Schur multiplier of nilpotent Lie algebras of maximal class. It improves the later upper bounds on the Schur multiplier of such Lie algebras.

The exterior degree of a pair of finite groupsJan 22 2011Mar 07 2013The exterior degree of a pair of finite groups $(G,N)$, which is a generalization of the exterior degree of finite groups, is the probability for two elements $(g,n)$ in $(G,N)$ such that $g\wedge n=1$. In the present paper, we state some relations between ... More

Certain functors of nilpotent Lie algebra with the derived subalgebra of dimension twoDec 13 2017By considering the nilpotent Lie algebra with the derived subalgebra of dimension $ 2$, we compute some functors include the Schur multiplier, the exterior square and the tensor square of these Lie algebras. We also give the corank of such Lie algebras. ... More

Capability of Nilpotent Lie algebras with small derived SubalgebraFeb 23 2010Mar 07 2013In this paper, we classify all capable nilpotent Lie algebras with derived subalgebra of dimension at most 1.

A further investigation on the order of the Schur multiplier of $p$- groupsJun 07 2017Oct 24 2017For a $p$-group $G$ of order $ p^n$ with the derived subgroup of order $ p^k $ if $ d=d(G), $ the minimal number of elements required to generate $ G, $ then the order of Schur multiplier of $G$ is bounded by $ p^{\frac{1}{2}(d-1)(n-k+2)+1}. $ In the ... More

A Tractable Fault Detection and Isolation Approach for Nonlinear Systems with Probabilistic PerformanceAug 08 2014Jan 22 2016This article presents a novel perspective along with a scalable methodology to design a fault detection and isolation (FDI) filter for high dimensional nonlinear systems. Previous approaches on FDI problems are either confined to linear systems or they ... More

The Calabi metric and desingularization of Einstein orbifoldsOct 07 2016Feb 22 2019Consider an Einstein orbifold $(M_0,g_0)$ of real dimension $2n$ having a singularity with orbifold group the cyclic group of order $n$ in ${\rm{SU}}(n)$ which is generated by an $n$th root of unity times the identity. Existence of a Ricci-flat K\"ahler ... More

Finitely Additive, Modular and Probability Functions on Pre-semiringsMar 10 2016Jan 25 2018In this paper, we define finitely additive, probability and modular functions over semiring-like structures. We investigate finitely additive functions with the help of complemented elements of a semiring. We also generalize some classical results in ... More

Real-time Predictive Analytics for Improving Public Transportation Systems' ResilienceSep 30 2016Public transit systems are a critical component of major metropolitan areas. However, in the face of increasing demand, most of these systems are operating close to capacity. Under normal operating conditions, station crowding and boarding denial are ... More

Data Structure Lower Bounds for Document Indexing ProblemsApr 21 2016We study data structure problems related to document indexing and pattern matching queries and our main contribution is to show that the pointer machine model of computation can be extremely useful in proving high and unconditional lower bounds that cannot ... More

On the non-uniqueness of the instantaneous frequencyJul 08 2016Aug 18 2016In this article, we investigate the debated Instantaneous Frequency (IF) topic. Here, we show that IF is non-unique inherently. We explain how this non-uniqueness can be quantified and explained from a mathematical perspective. The non-uniqueness of the ... More

Finitely Additive, Modular and Probability Functions on Pre-semiringsMar 10 2016In this paper, we define finitely additive, probability and modular functions over semiring-like structures. We investigate finitely additive functions with the help of complemented elements of a semiring. Then with the help of those observations, we ... More

Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable ReformulationsMay 19 2015Sep 19 2016We consider stochastic programs where the distribution of the uncertain parameters is only observable through a finite training dataset. Using the Wasserstein metric, we construct a ball in the space of (multivariate and non-discrete) probability distributions ... More

Estimations of the low dimensional homology of Lie algebras with large abelian idealsFeb 27 2013Dec 16 2013A Lie algebra $L$ of dimension $n \ge1 $ may be classified, looking for restrictions of the size on its second integral homology Lie algebra $H_2(L,\mathbb{Z})$, denoted by $M(L)$ and often called Schur multiplier of $L$. In case $L$ is nilpotent, we ... More

The Calabi metric and desingularization of Einstein orbifoldsOct 07 2016Consider an Einstein orbifold $(M_0,g_0)$ of real dimension $2n$ having a singularity with orbifold group the cyclic group of order $n$ in ${\rm{SU}}(n)$ which is generated by an $n$th root of unity times the identity. Existence of a Ricci-flat K\"ahler ... More

Independent Range Sampling, Revisited AgainMar 19 2019We revisit the range sampling problem: the input is a set of points where each point is associated with a real-valued weight. The goal is to store them in a structure such that given a query range and an integer $k$, we can extract $k$ independent random ... More

On graphs of bounded semilatticesNov 03 2017Nov 06 2018In this paper, we introduce the graph $G(S)$ of a bounded semilattice $S$, which is a generalization of the intersection graph of the substructures of an algebraic structure. We prove some general theorems about these graphs; as an example, we show that ... More

Linear Support Tensor Machine: Pedestrian Detection in Thermal Infrared ImagesSep 26 2016Pedestrian detection in thermal infrared images poses unique challenges because of the low resolution and noisy nature of the image. Here we propose a mid-level attribute in the form of multidimensional template, or tensor, using Local Steering Kernel ... More

A note on the Schur multiplier of a nilpotent Lie algebraJan 04 2010Jun 19 2012For a nilpotent Lie algebra $L$ of dimension $n$ and dim$(L^2)=m$, we find the upper bound dim$(M(L))\leq {1/2}(n+m-2)(n-m-1)+1$, where $M(L)$ denotes the Schur multiplier of $L$. In case $m=1$ the equality holds if and only if $L\cong H(1)\oplus A$, ... More

On the tensor degree of finite groupsMar 06 2013We study the number of elements $x$ and $y$ of a finite group $G$ such that $x \otimes y= 1_{_{G \otimes G}}$ in the nonabelian tensor square $G \otimes G$ of $G$. This number, divided by $|G|^2$, is called the tensor degree of $G$ and has connection ... More

The Stochastic Reach-Avoid Problem and Set Characterization for DiffusionsFeb 20 2012Jan 22 2016In this article we approach a class of stochastic reachability problems with state constraints from an optimal control perspective. Preceding approaches to solving these reachability problems are either confined to the deterministic setting or address ... More

Non-monotonic Casimir interaction: The role of amplifying dielectricsJan 25 2016The normal and the lateral Casimir interactions between corrugated ideal metallic plates in the presence of an amplifying or an absorptive dielectric slab has been studied by the path-integral quantization technique. The effect of the amplifying slab, ... More

Performance Bounds for the Scenario Approach and an Extension to a Class of Non-convex ProgramsJul 01 2013Dec 06 2013We consider the Scenario Convex Program (SCP) for two classes of optimization problems that are not tractable in general: Robust Convex Programs (RCPs) and Chance-Constrained Programs (CCPs). We establish a probabilistic bridge from the optimal value ... More

Deep Leaf Segmentation Using Synthetic DataJul 28 2018Aug 17 2018Automated segmentation of individual leaves of a plant in an image is a prerequisite to measure more complex phenotypic traits in high-throughput phenotyping. Applying state-of-the-art machine learning approaches to tackle leaf instance segmentation requires ... More

On the multiple exterior degree of finite groupsAug 05 2011Apr 20 2012Recently, two first authors have introduced a group invariant, which is related to the number of elements $x$ and $y$ of a finite group $G$ such that $x\wedge y=1$ in the exterior square $G\wedge G$ of $G$. Research on this probability gives some relations ... More

RAISR: Rapid and Accurate Image Super ResolutionJun 03 2016Oct 04 2016Given an image, we wish to produce an image of larger size with significantly more pixels and higher image quality. This is generally known as the Single Image Super-Resolution (SISR) problem. The idea is that with sufficient training data (corresponding ... More

$c$-nilpotent multiplier and $c$-capability of the direct sum of Lie algebrasDec 13 2017In this paper, we determine the behavior of the $c$-nilpotent multiplier of Lie algebras with respect to the direct sums. Then we give some results on the $c$-capability of the direct sum of finite dimensional Lie algebras.

A Bayesian Approach to Joint Estimation of Multiple Graphical ModelsFeb 10 2019The problem of joint estimation of multiple graphical models from high dimensional data has been studied in the statistics and machine learning literature, due to its importance in diverse fields including molecular biology, neuroscience and the social ... More

The Bogomolov multiplier of Lie algebrasMay 15 2018In this paper, we extend the notion of the Bogomolov multipliers and the CP-extensions to Lie algebras. Then we compute the Bogomolov multipliers for Abelian, Heisenberg and nilpotent Lie algebras of class at most 6. Finally we compute the Bogomolov multipliers ... More

DeepRED: Deep Image Prior Powered by REDMar 25 2019May 06 2019Inverse problems in imaging are extensively studied, with a variety of strategies, tools, and theory that have been accumulated over the years. Recently, this field has been immensely influenced by the emergence of deep-learning techniques. One such contribution, ... More

Approximating the Simplicial DepthDec 15 2015Dec 27 2015Let $P$ be a set of $n$ points in $d$-dimensions. The simplicial depth, $\sigma_P(q)$ of a point $q$ is the number of $d$-simplices with vertices in $P$ that contain $q$ in their convex hulls. The simplicial depth is a notion of data depth with many applications ... More

DeepRED: Deep Image Prior Powered by REDMar 25 2019Inverse problems in imaging are extensively studied, with a variety of strategies, tools, and theory that have been accumulated over the years. Recently, this field has been immensely influenced by the emergence of deep-learning techniques. One such contribution, ... More

Improving Observability of Stochastic Complex Networks under the Supervision of Cognitive Dynamic SystemsNov 07 2014Much has been said about observability in system theory and control; however, it has been recently that observability in complex networks has seriously attracted the attention of researchers. This paper examines the state-of-the-art and discusses some ... More

Parameter Selection Algorithm For Continuous VariablesJan 19 2017In this article, we propose a new algorithm for supervised learning methods, by which one can both capture the non-linearity in data and also find the best subset model. To produce an enhanced subset of the original variables, an ideal selection method ... More

Approximations of Stochastic Hybrid Systems: A Compositional ApproachAug 26 2015Apr 24 2016In this paper we propose a compositional framework for the construction of approximations of the interconnection of a class of stochastic hybrid systems. As special cases, this class of systems includes both jump linear stochastic systems and linear stochastic ... More

On The Relative N-Tensor Nilpotent Degree of Finite GroupsJul 01 2018In this paper, we introduce the relative $n$-tensor nilpotent degree of a finite group $G$ with respect to a subgroup $H$ of $G$. The aim of this paper is to investigate this concept and give some results on this topic.

Motion Planning for Continuous Time Stochastic Processes: A Dynamic Programming ApproachNov 06 2012Jan 22 2016We study stochastic motion planning problems which involve a controlled process, with possibly discontinuous sample paths, visiting certain subsets of the state-space while avoiding others in a sequential fashion. For this purpose, we first introduce ... More

The Little Engine that Could: Regularization by Denoising (RED)Nov 09 2016Removal of noise from an image is an extensively studied problem in image processing. Indeed, the recent advent of sophisticated and highly effective denoising algorithms lead some to believe that existing methods are touching the ceiling in terms of ... More

Building an Ontology for the Domain of Plant Science using ProtégéOct 10 2018Oct 11 2018Due to the rapid development of technology, large amounts of heterogeneous data generated every day. Biological data is also growing in terms of the quantity and quality of data considerably. Despite the attempts for building a uniform platform to handle ... More

Capable Lie algebras with the derived subalgebra of dimension two over an arbitrary fieldDec 05 2017Apr 16 2018In this paper, we classify all capable nilpotent Lie algebras with the derived subalgebra of dimension 2 over an arbitrary field. Moreover, the explicit structure of such Lie algebras of class 3 is given.

Deep Leaf Segmentation Using Synthetic DataJul 28 2018Mar 21 2019Automated segmentation of individual leaves of a plant in an image is a prerequisite to measure more complex phenotypic traits in high-throughput phenotyping. Applying state-of-the-art machine learning approaches to tackle leaf instance segmentation requires ... More

Convergence of algorithms for reconstructing convex bodies and directional measuresAug 01 2006We investigate algorithms for reconstructing a convex body $K$ in $\mathbb {R}^n$ from noisy measurements of its support function or its brightness function in $k$ directions $u_1,...,u_k$. The key idea of these algorithms is to construct a convex polytope ... More

Secure Transmissions Using Artificial Noise in MIMO Wiretap Interference Channel: A Game Theoretic ApproachDec 23 2016We consider joint optimization of artificial noise (AN) and information signals in a MIMO wiretap interference network, wherein the transmission of each link may be overheard by several MIMO-capable eavesdroppers. Each information signal is accompanied ... More