Coupling Matrix Representation of Nonreciprocal Filters Based on Time Modulated Resonators

This paper addresses the analysis and design of non-reciprocal filters based on time modulated resonators. We analytically show that time modulating a resonator leads to a set of harmonic resonators composed of the unmodulated lumped elements plus a frequency invariant element that accounts for differences in the resonant frequencies. We then demonstrate that harmonic resonators of different order are coupled through non-reciprocal admittance inverters whereas harmonic resonators of the same order couple with the admittance inverter coming from the unmodulated filter network. This coupling topology provides useful insights to understand and quickly design non-reciprocal filters and permits their characterization using an asynchronously tuned coupled resonators network together with the coupling matrix formalism. Two designed filters, of orders three and four, are experimentally demonstrated using quarter wavelength resonators implemented in microstrip technology and terminated by a varactor on one side. The varactors are biased using coplanar waveguides integrated in the ground plane of the device. Measured results are found to be in good agreement with numerical results, validating the proposed theory

A min-max theorem on tournaments

We present a structural characterization of all tournaments T = (V, A) such that, for any nonnegative integral weight function defined on V, the maximum size of a feedback vertex set packing is equal to the minimum weight of a triangle in T. We also answer a question of Frank by showing that it is N P-complete to decide whether the vertex set of a given tournament can be partitioned into two feedback vertex sets. In addition, we give exact and approximation algorithms for the feedback vertex set packing problem on tournaments. ©2007 Society for Industrial and Applied Mathematics.published_or_final_versio

An efficient algorithm for finding maximum cycle packings in reducible flow graphs

Reducible flow graphs occur naturally in connection with flow-charts of computer programs and are used extensively for code optimization and global data flow analysis. In this paper we present an O(n2m log (n 2/m)) algorithm for finding a maximum cycle packing in any weighted reducible flow graph with n vertices and m arcs. © Springer-Verlag 2004.postprin

A comparison of assimilation results from the ensemble Kalman Filter and a reduced-rank extended Kalman Filter

International audienceThe goal of this study is to compare the performances of the ensemble Kalman filter and a reduced-rank extended Kalman filter when applied to different dynamic regimes. Data assimilation experiments are performed using an eddy-resolving quasi-geostrophic model of the wind-driven ocean circulation. By changing eddy viscosity, this model exhibits two qualitatively distinct behaviors: strongly chaotic for the low viscosity case and quasi-periodic for the high viscosity case. In the reduced-rank extended Kalman filter algorithm, the model is linearized with respect to the time-mean from a long model run without assimilation, a reduced state space is obtained from a small number (100 for the low viscosity case and 20 for the high viscosity case) of leading empirical orthogonal functions (EOFs) derived from the long model run without assimilation. Corrections to the forecasts are only made in the reduced state space at the analysis time, and it is assumed that a steady state filter exists so that a faster filter algorithm is obtained. The ensemble Kalman filter is based on estimating the state-dependent forecast error statistics using Monte Carlo methods. The ensemble Kalman filter is computationally more expensive than the reduced-rank extended Kalman filter.The results show that for strongly nonlinear case, chaotic regime, about 32 ensemble members are sufficient to accurately describe the non-stationary, inhomogeneous, and anisotropic structure of the forecast error covariance and the performance of the reduced-rank extended Kalman filter is very similar to simple optimal interpolation and the ensemble Kalman filter greatly outperforms the reduced-rank extended Kalman filter. For the high viscosity case, both the reduced-rank extended Kalman filter and the ensemble Kalman filter are able to significantly reduce the analysis error and their performances are similar. For the high viscosity case, the model has three preferred regimes, each with distinct energy levels. Therefore, the probability density of the system has a multi-modal distribution and the error of the ensemble mean for the ensemble Kalman filter using larger ensembles can be larger than with smaller ensembles

The Maximum-Weight Stable Matching Problem: Duality and Efficiency

Given a preference system (G,≺) and an integral weight function defined on the edge set of G (not necessarily bipartite), the maximum-weight stable matching problem is to find a stable matching of (G,≺) with maximum total weight. In this paper we study this NP-hard problem using linear programming and polyhedral approaches. We show that the Rothblum system for defining the fractional stable matching polytope of (G,≺) is totally dual integral if and only if this polytope is integral if and only if (G,≺) has a bipartite representation. We also present a combinatorial polynomial-time algorithm for the maximum-weight stable matching problem and its dual on any preference system with a bipartite representation. Our results generalize Király and Pap's theorem on the maximum-weight stable-marriage problem and rely heavily on their work. © 2012 Society for Industrial and Applied Mathematics.published_or_final_versio

A Polyhedral Description of Kernels

postprin

An approximation algorithm for feedback vertex sets in tournaments

We obtain a necessary and sufficient condition in terms of forbidden structures for tournaments to possess the min-max relation on packing and covering directed cycles, together with strongly polynomial time algorithms for the feedback vertex set problem and the cycle packing problem in this class of tournaments. Applying the local ratio technique of Bar-Yehuda and Even to the forbidden structures, we find a 2.5-approximation polynomial time algorithm for the feedback vertex set problem in any tournament.published_or_final_versio

The circumference of a graph with no K3,t-minor, II

The class of graphs with no K3;t-minors, t>=3, contains all planar graphs and plays an important role in graph minor theory. In 1992, Seymour and Thomas conjectured the existence of a function α(t)>0 and a constant β>0, such that every 3-connected n-vertex graph with no K3;t-minors, t>=3, contains a cycle of length at least α(t)nβ. The purpose of this paper is to con¯rm this conjecture with α(t)=(1/2)t(t-1) and β=log1729 2.preprin

Total Dual Integrality in Some Facility Location Problems

published_or_final_versio