Searcharxiv⌕ Search

arXiv subjects

Adrian Popescu

Publications and source records attributed to Adrian Popescu.

44 records · Page 3Linked to original sources

Scalable domain adaptation of convolutional neural networks

Convolutional neural networks (CNNs) tend to become a standard approach to solve a wide array of computer vision problems. Besides important theoretical and practical advances in their design, their success is built on the existence of manually labeled visual resources, such as ImageNet. The creation of such datasets is cumbersome and here we focus on alternatives to manual labeling. We hypothesize that new resources are of uttermost importance in domains which are not or weakly covered by ImageNet, such as tourism photographs. We first collect noisy Flickr images for tourist points of interest and apply automatic or weakly-supervised reranking techniques to reduce noise. Then, we learn domain adapted models with a standard CNN architecture and compare them to a generic model obtained from ImageNet. Experimental validation is conducted with publicly available datasets, including Oxford5k, INRIA Holidays and Div150Cred. Results show that low-cost domain adaptation improves results compared to the use of generic models but also compared to strong non-CNN baselines such as triangulation embedding.

cs.CV↗

Four generated, squarefree, monomial ideals

Let $I\supsetneq J$ be two squarefree monomial ideals of a polynomial algebra over a field generated in degree $\geq d$, resp. $\geq d+1$ . Suppose that $I$ is either generated by three monomials of degrees $d$ and a set of monomials of degrees $\geq d+1$, or by four special monomials of degrees $d$. If the Stanley depth of $I/J$ is $\leq d+1$ then the usual depth of $I/J$ is $\leq d+1$ too.

math.AC↗

Depth and Stanley Depth of the Canonical Form of a factor of monomial ideals

In this paper we show that the depth and the Stanley depth of the factor of two monomial ideals is invariant under taking a so called canonical form. It follows easily that the Stanley Conjecture holds for the factor if and only if it holds for its canonical form. In particular, we construct an algorithm which simplifies the depth computation and using the canonical form we massively reduce the run time for the sdepth computation.

math.AC↗

An algorithm to compute the Hilbert depth

We present an algorithm which computes the Hilbert depth of a graded module based on a theorem of Uliczka. Connected to a Herzog's question we see that the Hilbert depth of a direct sum of modules can be strictly bigger than the Hilbert depth of all the summands.

math.AC↗

Current induced torques between ferromagnets and compensated antiferromagnets: symmetry and phase coherence effects

It is shown that the current-induced torques between a ferromagnetic layer and an antiferromagnetic layer with a compensated interface vanish when the ferromagnet is aligned with an axis of spin-rotation symmetry of the antiferromagnet. For properly chosen geometries this implies that the current induced torque can stabilize the out-of-plane (or hard axis) orientation of the ferromagnetic layer. This current-induced torque relies on phase coherent transport, and we calculate the robustness of this torque to phase breaking scattering. From this it is shown that the torque is not linearly dependent on applied current, but has an absolute maximum.

cond-mat.mes-hall↗

Effect of Packet Delay Variation on Video-Voice over DiffServ-MPLS in IPv4-IPv6 Networks

Over the last years, we have witnessed a rapid deployment of real-time applications on the Internet as well as many research works about Quality of Service (QoS), in particular IPv4 (Internet Protocol version 4). The inevitable exhaustion of the remaining IPv4 address pool has become progressively evident. As the evolution of Internet Protocol (IP) continues, the deployment of IPv6 QoS is underway. Today, there is limited experience in the deployment of QoS for IPv6 traffic in MPLS backbone networks in conjunction with DiffServ (Differentiated Services) support. DiffServ itself does not have the ability to control the traffic which has been taken for end-to-end path while a number of links of the path are congested. In contrast, MPLS Traffic Engineering (TE) is accomplished to control the traffic and can set up end-to-end routing path before data has been forwarded. From the evolution of IPv4 QoS solutions, we know that the integration of DiffServ and MPLS TE satisfies the guaranteed QoS requirement for real-time applications. This paper presents a QoS performance study of real-time applications such as voice and video conferencing in terms of Packet Delay Variation (PDV) over DiffServ with or without MPLS TE in IPv4/IPv6 networks using Optimized Network Engineering Tool (OPNET). We also study the interaction of Expedited Forwarding (EF), Assured Forwarding (AF) traffic aggregation, link congestion, as well as the effect of performance metric such as PDV. The effectiveness of DiffServ and MPLS TE integration in IPv4/IPv6 network is illustrated and analyzed. This paper shows that IPv6 experiences more PDV than their IPv4 counterparts.

cs.NI↗

Special Stanley Decompositions

Let $I$ be an intersection of three monomial prime ideals of a polynomial algebra $S$ over a field. We give a special Stanley decomposition of $I$ which provides a lower bound of the Stanley depth of $I$, greater than or equal to $\depth\ (I)$, that is, Stanley's Conjecture holds for $I$.

math.AC↗