Lower bounds for testing bipartiteness in dense graphs

We study the space complexity of refuting unsatisfiable random k-CNFs in the resolution proof system. We prove that for any large enough /spl Delta/, with high probability a random k-CNF over n variables and /spl Delta/n clauses requires resolution clause space of /spl Omega/(n/spl middot//spl Delta//sup -1+/spl epsiv//k-2-/spl epsiv//), for any 0 >/spl radic/n. This bound is nearly tight. Specifically, we show that with high probability, a random 3-CNF with /spl Delta/n clauses requires tree-like refutation size of exp(/spl Omega/(n//spl Delta//sup 1+/spl epsiv//1-/spl epsiv//)), for any 0</spl epsiv/<1/2. Our space lower bound is the consequence of three main contributions. 1. We introduce a 2-player matching game on bipartite graphs G to prove that there are no perfect matchings in G. 2. We reduce lower bounds for the clause space of a formula F in resolution to lower bounds for the complexity of the game played on the bipartite graph G(F) associated with F. 3. We prove that the complexity of the game is large whenever G is an expander graph. Finally, a simple probabilistic analysis shows that for a random formula F, with high probability G(F) is an expander. We also extend our result to the case of G-PHP, a generalization of the pigeonhole principle based on bipartite graphs G. We prove that the clause space for G-PHP can be reduced to the game complexity on G.

Estimating the size of the maximum matching is a canonical problem in graph analysis, and one that has attracted extensive study over a range of different computational models. We present improved streaming algorithms for approximating the size of maximum matching with sparse (bounded arboricity) graphs. &#13;\n&#13;\n* (Insert-Only Streams) We present a one-pass algorithm that takes O(alpha log n) space and approximates the size of the maximum matching in graphs with arboricity alpha within a factor of O(alpha). This improves significantly upon the state-of-the-art tilde{O}(alpha n^{2/3})-space streaming algorithms, and is the first poly-logarithmic space algorithm for this problem. &#13;\n&#13;\n* (Dynamic Streams) Given a dynamic graph stream (i.e., inserts and deletes) of edges of an underlying alpha-bounded arboricity graph, we present an one-pass algorithm that uses space tilde{O}(alpha^{10/3}n^{2/3}) and returns an O(alpha)-estimator for the size of the maximum matching on the condition that the number edge deletions in the stream is bounded by O(alpha n). For this class of inputs, our algorithm improves the state-of-the-art tilde{O}(\\alpha n^{4/5})-space algorithms, where the \\tilde{O}(.) notation hides logarithmic in n dependencies.&#13;\n&#13;\nIn contrast to prior work, our results take more advantage of the streaming access to the input and characterize the matching size based on the ordering of the edges in the stream in addition to the degree distributions and structural properties of the sparse graphs.

We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of O(log n+log log(1//spl epsiv/)) on the circuit depth for computing an approximation of the QFT with respect to the modulus 2/sup n/ with error bounded by /spl epsiv/. Thus, even for exponentially small error, our circuits have depth O(log n). The best previous depth bound was O(n), even for approximations with constant error. Moreover, our circuits have size O(n log(n//spl epsiv/)). As an application of this depth bound, we show that P. Shor's (1997) factoring algorithm may be based on quantum circuits with depth only O(log n) and polynomial size, in combination with classical polynomial-time pre- and postprocessing. Next, we prove an /spl Omega/(log n) lower bound on the depth complexity of approximations of the QFT with constant error. This implies that the above upper bound is asymptotically tight (for a reasonable range of values of /spl epsiv/). We also give an upper bound of O(n(log n)/sup 2/ log log n) on the circuit size of the exact QFT modulo 2/sup n/, for which the best previous bound was O(n/sup 2/). Finally, based on our circuits for the QFT with power-of-2 moduli, we show that the QFT with respect to an arbitrary modulus m can be approximated with accuracy /spl epsiv/ with circuits of depth O((log log m)(log log 1//spl epsiv/)) and size polynomial in log m+log(1//spl epsiv/).

In this paper, we provide the first optimal algorithm for the remaining open question from the seminal paper of Alon, Matias, and Szegedy: approximating large frequency moments. We give an upper bound on the space required to find a k-th frequency moment of O(n^(1-2/k)) bits that matches, up to a constant factor, the lower bound of Woodruff et. al for constant epsilon and constant k. Our algorithm makes a single pass over the stream and works for any constant k > 3. It is based upon two major technical accomplishments: first, we provide an optimal algorithm for finding the heavy elements in a stream; and second, we provide a technique using Martingale Sketches which gives an optimal reduction of the large frequency moment problem to the all heavy elements problem. We also provide a polylogarithmic improvement for frequency moments, frequency based functions, spatial data streams, and measuring independence of data sets.

We resolve a number of long-standing open problems in online graph coloring. More specifically, we develop tight lower bounds on the performance of online algorithms for fundamental graph classes. An important contribution is that our bounds also hold for randomized online algorithms, for which hardly any results were known. Technically, we construct lower bounds for chordal graphs. The constructions then allow us to derive results on the performance of randomized online algorithms for the following further graph classes: trees, planar, bipartite, inductive, bounded-treewidth and disk graphs. It shows that the best competitive ratio of both deterministic and randomized online algorithms is Theta(log n), where n is the number of vertices of a graph. Furthermore, we prove that this guarantee cannot be improved if an online algorithm has a lookahead of size O(n/log n) or access to a reordering buffer of size n^(1-epsilon), for any 0 < epsilon <= 1. A consequence of our results is that, for all of the above mentioned graph classes except bipartite graphs, the natural First Fit coloring algorithm achieves an optimal performance, up to constant factors, among deterministic and randomized online algorithms.

Given a bipartite graph, the maximum balanced biclique (MBB) problem, discovering a mutually connected while disjoint sets of equal size with the maximum cardinality, plays a significant role for mining the bipartite graph and has numerous applications. Despite the NP-hardness of the MBB problem, in this paper, we show that an exact MBB can be discovered extremely fast in bipartite graphs for real applications. We propose two exact algorithms dedicated for small dense and large sparse bipartite graphs respectively. For dense bipartite graphs, an O*(1.3803n) algorithm is proposed. This algorithm in fact can find an MBB very fast for small dense bipartite graphs that are common for applications such as VLSI design. This is because, using our proposed novel techniques, the search can fast converge to sufficiently dense bipartite graphs which we prove to be polynomial-time solvable. For large sparse bipartite graphs typical for applications such as biological data analysis, an O*(1.3803 δ) algorithm is proposed, where δ is only a few hundred for large sparse bipartite graphs with millions of vertices. The indispensible optimization that leads to this time complexity is: we transform a large sparse bipartite graph into a limited number of dense subgraphs such that each of the dense subgraphs has up to δ vertices and then apply our proposed algorithm for dense bipartite graphs on each of the subgraphs. To further speed up this algorithm, tighter upper bounds, faster heuristics and more effective reductions are proposed, allowing an MBB to be discovered within a few seconds for bipartite graphs with millions of vertices. Extensive experiments are conducted on synthetic and real large bipartite graphs to demonstrate the efficiency and effectiveness of our proposed algorithms and techniques.

A finite-difference time-domain (FDTD) analysis is presented to simulate, up to the high-frequency regime, transients on multiconductor transmission lines above dissipative earth. Excitation is in the high-frequency regime if the pulse has significant spectral content up to /spl omega//spl ap//spl omega//sub c/, with /spl omega//sub c/ the frequency where the conduction and displacement current densities have equal magnitude. Thus, /spl omega//sub c/=/spl sigma//sub g///spl epsi//sub 0//spl epsi//sub rg/ with /spl sigma//sub g/ and /spl epsi//sub rg/ the ground conductance and relative permittivity. The FDTD algorithm extends the formulation of Agrawal et al. (1980), by incorporating the theory of D'Amore and Sarto for the interaction of wide-band transients with the earth. Careful experimental testing of the new algorithm is presented. The measurement configuration consists of two parallel wires; first suspended above an aluminum sheet to test the code in the low-frequency regime; then above a block of absorbing material for experiments in the high-frequency regime. The end of one of the conductors is driven with a 2-ns synthesized impulse by a stepped-frequency, automatic network analyzer. Reflected and cross-talk signals are presented in the time domain. These show good agreement with the numerically predicted common mode, differential mode and mode-converted pulses.

Summary form only given. The single-particle theory of electron multipactor is now well understood. The multipactor parameter space is spanned by the normalized magnetic and electric field parameters. In particular, for given normalized magnetic field /spl Omega/ multipactor can errupt within a certain range of electric field amplitudes /spl epsi//sub 1/</spl epsi/</spl epsi//sub 2/; to each value /spl epsi/ corresponds a different locked-phase /spl phi/. Once a multipactor has been launched, it is very important to know the saturation level; the latter determines the cavity power losses when the multipactor is a parasitic side effect, or the saturated current when a multipactor is deliberately triggered for the production of short period high current pulsed beams. The collective space charge effects must be included to address multipactor saturation. One proposed approach employs a single charge sheet and yields saturation when the secondary emission coefficient /spl delta/ equals one. Setting /spl delta/=1 fixes the impact parameters and therefore the value of the driving electric field /spl epsi/; the external RF field adjusts to that value through the nonlinear effect of the induced multipactor current on the cavity LC circuit. A limitation of the method is that one must start near the appropriate /spl epsi/ since the range of the voltage self-adjustment is usually small. A most general approach introduced here is based on multilayered space charge cloud involving electrons emitted at slightly different times. There is a continuous distribution of impact energies and interaction phases between the leading and the trailing edge of the bunch.

The regularity lemma of Szemeredi turned out to be the most powerful tool for studying the testability of graph properties in the dense graph model. In fact, as we argue in this paper, this lemma can be used in order to prove (essentially) all the previous results in this area. More precisely, a barrier for obtaining an efficient testing algorithm for a graph property P was having an efficient regularity lemma for graphs satisfying P. The problem is that for many natural graph properties (e.g. triangle freeness) it is known that a graph can satisfy P and still only have regular partitions of tower-type size. This means that there was no viable path for obtaining reasonable bounds on the query complexity of testing such properties. In this paper we consider the property of being induced C_4-free, which also suffers from the fact that a graph might satisfy this property but still have only regular partitions of tower-type size. By developing a new approach for this problem we manage to overcome this barrier and thus obtain a merely exponential bound for testing this property. This is the first substantial progress on a problem raised by Alon in 2001, and more recently by Alon, Conlon and Fox. We thus obtain the first example of an efficient testing algorithm that cannot be derived from an efficient version of the regularity lemma.

Summary form only given. We present the reflectance spectra of conducting polyaniline film protonated with sulfuric acid (PANI-H/sub 2/SO/sub 4/) and of newly processed film protonated with camphor sulfonic acid (PANI-CSA) over a wide spectral range (0.006 eV-6 eV) at room temperature. The reflectance of PANI-H/sub 2/SO/sub 4/reveals the signatures of the intraband excitations in the infrared (IR), including increasing reflectance approaching to far-IR and a reflectance minimum around 1.7 eV. However, the corresponding optical conductivity (/spl sigma/(/spl omega/)) and the real part of dielectric function (/spl epsiv//sub 1/(/spl omega/)) are far from those of a metal. Instead, the optical spectra indicate that the charge carriers are localized with considerable oscillator strength within the gap. On the other hand, the optical spectra of PANI- CSA are characterized by distinct metal-like signatures arising from the combination of the Drude-like free carrier excitations in the far-IR and the existence of plasma resonance around 1.2 eV. These results indicate that the new processing of polyaniline with functionalized sulfonic acid (with surfactants as counterions) has greatly improved the homogeneity of the material and has resulted in a significant decrease in the extent of molecular scale disorder, thereby leading to the delocalization of the charge carriers in PANI-CSA. However, the deviation of /spl sigma/(/spl omega/) and /spl epsiv//sub 1/(/spl omega/) from the normal Drude metallic behaviors below 0.2 eV indicates that disorder induced localization still plays an important role in PANI-CSA. We present a quantitative analysis of /spl sigma/(/spl omega/) and /spl spl epsiv//sub 1/(/spl omega/) of PANI-CSA in terms of the localization modified Drude model, implying that PANI-CSA is a disordered metal on the metal-insulator boundary.

We introduce a simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs and analyze the algorithm by analyzing a corresponding discrete-time random process. As a result, we obtain a simple criterion involving the fractions of nodes of different degrees on both sides of the graph which is necessary and sufficient for the decoding process to finish successfully with high probability. By carefully designing these graphs we can construct for any given rate R and any given real number /spl epsiv/ a family of linear codes of rate R which can be encoded in time proportional to ln(1//spl epsiv/) times their block length n. Furthermore, a codeword can be recovered with high probability from a portion of its entries of length (1+/spl epsiv/)Rn or more. The recovery algorithm also runs in time proportional to n ln(1//spl epsiv/). Our algorithms have been implemented and work well in practice; various implementation issues are discussed.

This paper presents two kinds of robust controllers for stabilizing singularly perturbed discrete bilinear systems. The first one is an /spl epsi/-dependent controller that stabilizes the closed-loop system for all /spl epsi//spl isin/(0, /spl epsi//sub 0/*), where /spl epsi//sub 0/* is the prespecified upper bound of the singular perturbation parameter. The second one is an /spl epsi/-independent controller, which is able to stabilize the system in the entire state space for all /spl epsi//spl isin/(0, /spl epsi/*), where /spl epsi/* is the exact upper /spl epsi/-bound. The /spl epsi/* can be calculated by the critical stability criterion once the robust controller is determined. An example is presented to illustrate the proposed schemes.

In this thesis we analyze and develop methods based on model order reduction (MOR) for the solution of optimization problems constrained by time-dependent partial differential equations (PDEs). The methods combine a direct solution approach with model reduction via proper orthogonal decomposition (POD) and the discrete empirical interpolation method (DEIM). The reduced-order models (ROMs) are used to approximate the high-dimensional dynamic systems originating from a spatial discretization of a PDE. However, when used in an optimization algorithm, conventional POD/DEIM ROMs often lack the ability to give adequate approximations of the gradient. We propose methods for a suitable enhancement of the ROMs for the optimization purpose which are based on the inclusion of derivative information in the POD and DEIM subspaces. We distinguish two types of error between quantities evaluated with the high-dimensional model and its ROM approximation in dependency on the optimization variable q: The reconstruction error which is evaluated with the same q0 which is used constructing the ROM and the prediction error which assesses approximations at q with a ROM constructed at q0 different to q. The novel reconstruction results we present include estimates for solutions of the adjoint equation and the sensitivity equations as well as for the gradient of the objective function. Based on the estimates we explain how the POD and DEIM bases should be extended with either adjoint or sensitivity information. The enhanced ROMs allow control of the reconstruction error for the objective and its gradient up to machine precision. Moreover, we propose a POD prediction estimate for the objective of the optimization problem in a neighborhood of q where the ROM is constructed. In case of sensitivity-extended POD and DEIM bases we give an analogous result for solutions of the states. The derivative-extended ROMs are then used to develop adaptive algorithms for the solution of optimal control and parameter estimation problems which results in great runtime improvements for the optimization while ensuring high approximation quality of the solution of the original problem. For the parameter estimation case a novel a posteriori error estimate is proposed which assesses the quality of suboptimal solutions obtained with the ROM. A further fundamental contribution is a discussion of discretize-then-optimize (DTO) vs. optimize-then-discretize (OTD) approaches in the context of MOR for optimization. We analyze advantages and disadvantages of both approaches and discuss to which extent our methods exhibit properties of either strategy. We also give examples of representative optimization problems in which standard POD/DEIM ROMs show an inacceptable behavior and can be successfully solved by derivative-extended ROMs. We have further implemented the developed methods emphasizing an efficient realization which is important for the investigation of the MOR potential. We showcase the practical performance of the proposed algorithms and the superiority of derivative-extended over conventional ROMs on two academic and one industry-relevant application which exhibit a variety of challenges for the model reduction approach in optimization.

Differential displacement due to a gravitational force gradient, acting on two superconducting test masses which are elastically suspended from the instrument frame, is sensed by a superconducting quantum interference device (SQUID), coupled to the masses by a current flowing in the sensing circuits. The SQUID transducer absorbs energy from the masses, and, hence, it reacts with a random force (fluctuation-dissipation principle). This force increases if the coupling current grows. Additionally, the transducer outputs an amplification noise that is independent of the coupling. This output noise is equivalent to a force, applied to the masses, which decreases with stronger coupling, Hence, the strength of the total equivalent gravity gradient noise has a minimum with respect to the coupling. The minimum is found to be about 1.5/spl epsiv//sub A//spl omega//sub 0//sup 2//(ml/sup 2/), where /spl epsiv//sub A/ means the equivalent energy sensitivity, in the white noise limit, of the SQUID junctions; /spl omega//sub 0/ is the natural frequency of the mass suspension; m is the test mass, and l is the base length,.

Robust multivariable controllers for stable infinite-dimensional systems in the Callier-Desoer (CD) algebra are discussed. In particular, the following robust regulation problem is solved. Given reference and disturbance signals, which are linear combinations of signals of the form t/sup j/ sin(/spl omega//sub k/t+/spl phi//sub k/), j/spl ges/0, k=0, /spl middot//spl middot//spl middot/, n, find a low-order finite-dimensional controller so that the outputs asymptotically track the reference signals, asymptotically reject the disturbance signals, and the closed-loop system is stable and robust with respect to a class of perturbations in the plant. The proposed controller consists of a positive scalar gain /spl epsi/ and certain polynomial matrices K/sub k/(s) for k=0, /spl middot//spl middot//spl middot/, n. The main result of the paper shows that the matrices K/sub k/(s) must satisfy certain stability conditions involving the values of the plant transfer function only at the reference and disturbance signal frequencies /spl omega//sub k/ for k=0, /spl middot//spl middot//spl middot/, n. The controller has unstable poles on the imaginary axis. The behavior of these poles as a function of the scalar parameter /spl epsi/ in the form of a Puiseux series is given.