No abstract uploaded!

Let$X$(-ϱ$B$^{$m$}×$C$^{$n$}be a compact set over the unit sphere ϱ$B$^{$m$}such that for each$z$∈ϱ$B$^{$m$}the fiber$X$_{$z$}={ω∈$C$^{$n$};($z, ω$)∈$X$} is the closure of a completely circled pseudoconvex domain in$C$^{$n$}. The polynomial hull $$\hat X$$ of$X$is described in terms of the Perron-Bremermann function for the homogeneous defining function of$X$. Moreover, for each point ($z$_{0},$w$_{0})∈Int $$\hat X$$ there exists a smooth up to the boundary analytic disc$F$:Δ→$B$^{$m$}×$C$^{$n$}with the boundary in$X$such that$F$(0)=($z$_{0},$w$_{0}).

The α-modulation spaces$M$^{$s$,α}_{$p$,$q$}($R$^{$d$}), α∈[0,1], form a family of spaces that contain the Besov and modulation spaces as special cases. In this paper we prove that a pseudodifferential operator σ($x$,$D$) with symbol in the Hörmander class$S$^{$b$}_{ρ,0}extends to a bounded operator σ($x$,$D$):$M$^{$s$,α}_{$p$,$q$}($R$^{$d$})→$M$^{$s$-$b$,α}_{$p$,$q$}($R$^{$d$}) provided 0≤α≤ρ≤1, and 1<$p$,$q$<∞. The result extends the well-known result that pseudodifferential operators with symbol in the class$S$^{$b$}_{1,0}maps the Besov space$B$^{$s$}_{$p$,$q$}($R$^{$d$}) into$B$^{$s$-$b$}_{$p$,$q$}($R$^{$d$}).

We consider the Cauchy problem for a second order weakly hyperbolic equation, with coefficients depending only on the time variable. We prove that if the coefficients of the equation belong to the Gevrey class $\gamma^{s_{0}}$ and the Cauchy data belong to $\gamma^{s_{1}}$ , then the Cauchy problem has a solution in $\gamma^{s_{0}}([0,T^{*}];\gamma^{s_{1}}(\mathbb{R}))$ for some$T$^{*}>0, provided 1≤$s$_{1}≤2−1/$s$_{0}. If the equation is strictly hyperbolic, we may replace the previous condition by 1≤$s$_{1}≤$s$_{0}.

A computational method, based on l1-minimization, is proposed for the problem of link flow correction, when the available traffic flow data on many links in a road network are inconsistent with respect to the flow conservation law. Without extra information, the problem is generally ill-posed when a large portion of the link sensors are unhealthy. It is possible, however, to correct the corrupted link flows accurately with the proposed method under a recoverability condition if there are only a few bad sensors which are located at certain links. We analytically identify the links that are robust to miscounts and relate them to the geometric structure of the traffic network by introducing the recoverability concept and an algorithm for computing it. The recoverability condition for corrupted links is simply the associated recoverability being greater than 1. In a more realistic setting, besides the unhealthy link sensors, small measurement noises may be present at the other sensors. Under the same recoverability condition, our method guarantees to give an estimated traffic flow fairly close to the ground-truth data and leads to a bound for the correction error. Both synthetic and real-world examples are provided to demonstrate the effectiveness of the proposed method.