It is a key problem to understand the full extent to which the extended bracket polynomial can detect non-classicality for non-trivial virtual knots with unit Jones polynomial. Recall that the extended bracket is an invariant for long virtual knots …

This paper defines a new invariant of virtual knots and links that we call the extended bracket polynomial, and denote by <<K>> for a virtual knot or…

In this paper, we present a consensus-based framework for decentralized estimation of deterministic parameters in wireless sensor networks (WSNs). In…

In conclusion, it is apparent that MemNet works best on this task based on our experiments. Surprisingly, ETC performed better than expected on the tech reviews dataset. The main problem is still the class imbalance. This leads to low precision, rec…

The problem of aspect-based sentiment analysis deals with classifying sentiments (negative, neutral, positive) for a given aspect in a sentence. A tr…

In scientific applications, there often are several competing models that could be fit to the observed data, so quantification of the model uncertain…

The tradeoff between the user's memory size and the worst-case download time in the $(H,r,M,N)$ combination network is studied, where a central serve…

Networks are models representing relationships between entities. Often these relationships are explicitly given, or we must learn a representation wh…

In this paper we suggest a new algorithm for the computation of a best rank one approximation of tensors, called alternating singular value decomposi…

We consider the $M/M/1$-PS queue with processor sharing. We study the conditional sojourn time distribution of an arriving customer, conditioned on t…

One key task of fine-grained sentiment analysis of product reviews is to extract product aspects or features that users have expressed opinions on. T…

We consider the Halfin-Whitt diffusion process $X_d(t)$, which is used, for example, as an approximation to the $m$-server $M/M/m$ queue. We use rece…

Graph clustering becomes an important problem due to emerging applications involving the web, social networks and bio-informatics. Recently, many suc…

Mining discriminative subgraph patterns from graph data has attracted great interest in recent years. It has a wide variety of applications in diseas…

Lattice coding techniques may be used to derive achievable rate regions which outperform known independent, identically distributed (i.i.d.) random c…

Feature selection has been proven a powerful preprocessing step for high-dimensional data analysis. However, most state-of-the-art methods tend to ov…

Deep networks trained on large-scale data can learn transferable features to promote learning multiple tasks. Since deep features eventually transiti…

Many scientific datasets are of high dimension, and the analysis usually requires visual manipulation by retaining the most important structures of d…

An Interference Channel with Generalized Feedback (IFC-GF) is a model for a wireless network where several source-destination pairs compete for the s…

We consider the Erlang A model, or $M/M/m+M$ queue, with Poisson arrivals, exponential service times, and $m$ parallel servers, and the property that…

It is shown that for a constant $t\in \mathbb{N}$, every simple topological graph on $n$ vertices has $O(n)$ edges if it has no two sets of $t$ edges…

Recent experimental results from RHIC and LHC on hard photon emission rates in heavy-ion collisions indicate a large azimuthal asymmetry of photon em…

By signing up you accept our content policy

Already have an account? Sign in

No a member yet? Create an account