E-Government Partnerships Across Levels of Government

E-government Partnerships across Levels of Government, is an overview of the challenges and approaches to creating a collaborative and cooperative partnership across levels of government for e-government development and implementation.E-Governance; cooperative partenership; decentralization; federalism

Enclosings of Decompositions of Complete Multigraphs in 22-Edge-Connected rr-Factorizations

A decomposition of a multigraph $G$ is a partition of its edges into subgraphs $G(1), \ldots , G(k)$. It is called an $r$-factorization if every $G(i)$ is $r$-regular and spanning. If $G$ is a subgraph of $H$, a decomposition of $G$ is said to be enclosed in a decomposition of $H$ if, for every $1 \leq i \leq k$, $G(i)$ is a subgraph of $H(i)$. Feghali and Johnson gave necessary and sufficient conditions for a given decomposition of $\lambda K_n$ to be enclosed in some $2$-edge-connected $r$-factorization of $\mu K_{m}$ for some range of values for the parameters $n$, $m$, $\lambda$, $\mu$, $r$: $r=2$, $\mu>\lambda$ and either $m \geq 2n-1$, or $m=2n-2$ and $\mu = 2$ and $\lambda=1$, or $n=3$ and $m=4$. We generalize their result to every $r \geq 2$ and $m \geq 2n - 2$. We also give some sufficient conditions for enclosing a given decomposition of $\lambda K_n$ in some $2$-edge-connected $r$-factorization of $\mu K_{m}$ for every $r \geq 3$ and $m = (2 - C)n$, where $C$ is a constant that depends only on $r$, $\lambda$ and~$\mu$.Comment: 17 pages; fixed the proof of Theorem 1.4 and other minor change

OMP-type Algorithm with Structured Sparsity Patterns for Multipath Radar Signals

A transmitted, unknown radar signal is observed at the receiver through more than one path in additive noise. The aim is to recover the waveform of the intercepted signal and to simultaneously estimate the direction of arrival (DOA). We propose an approach exploiting the parsimonious time-frequency representation of the signal by applying a new OMP-type algorithm for structured sparsity patterns. An important issue is the scalability of the proposed algorithm since high-dimensional models shall be used for radar signals. Monte-Carlo simulations for modulated signals illustrate the good performance of the method even for low signal-to-noise ratios and a gain of 20 dB for the DOA estimation compared to some elementary method

Perfect graphs of arbitrarily large clique-chromatic number

We prove that there exist perfect graphs of arbitrarily large clique-chromatic number. These graphs can be obtained from cobipartite graphs by repeatedly gluing along cliques. This negatively answers a question raised by Duffus, Sands, Sauer, and Woodrow in [Two-coloring all two-element maximal antichains, J. Combinatorial Theory, Ser. A, 57 (1991), 109-116]

Limits of Structures and the Example of Tree-Semilattices

The notion of left convergent sequences of graphs introduced by Lov\' asz et al. (in relation with homomorphism densities for fixed patterns and Szemer\'edi's regularity lemma) got increasingly studied over the past $10$ years. Recently, Ne\v set\v ril and Ossona de Mendez introduced a general framework for convergence of sequences of structures. In particular, the authors introduced the notion of $QF$-convergence, which is a natural generalization of left-convergence. In this paper, we initiate study of $QF$-convergence for structures with functional symbols by focusing on the particular case of tree semi-lattices. We fully characterize the limit objects and give an application to the study of left convergence of $m$-partite cographs, a generalization of cographs