Exact Lagrangian submanifolds in simply-connected cotangent bundles

We consider exact Lagrangian submanifolds in cotangent bundles. Under certain additional restrictions (triviality of the fundamental group of the cotangent bundle, and of the Maslov class and second Stiefel–Whitney class of the Lagrangian submanifold) we prove such submanifolds are Floer-cohomologically indistinguishable from the zero-section. This implies strong restrictions on their topology. An essentially equivalent result was recently proved independently by Nadler [16], using a different approach.     

On a local energy decay estimate of solutions to the hyperbolic type Stokes equations

In this paper, we discuss a local energy decay estimate of solutions to the initial-boundary value problem for the hyperbolic type Stokes equations of incompressible fluid flow in an exterior domain and a perturbed half-space. The equations are linearized version of the hyperbolic Navier–Stokes equations introduced by Racke and Saal [15], which are obtained as a delayed case for the deformation tensor in the incompressible Navier–Stokes equations. Our proof of the local energy decay estimate is based on Dan and Shibata [2]. In [2], they treated the dissipative wave equations in an exterior domain and discussed the local energy decay estimate. Our approach uses the fact that applying the Helmholtz projection to the hyperbolic type Stokes equations, we obtain equations similar to the dissipative wave ones.     

How to make a linear network code (strongly) secure

A linear network code is called k-secure if it is secure even if an adversary eavesdrops at most k edges. In this paper, we show an efficient deterministic construction algorithm of a linear transformation T that transforms an (insecure) linear network code to a k-secure one for any k, and extend this algorithm to strong k-security for any k . Our algorithms run in polynomial time if k is a constant, and these time complexities are explicitly presented. We also present a concrete size of \(|\mathsf{F}|\) for strong k-security, where \(\mathsf{F}\) is the underling finite field.     

Sparse quasi-Newton updates with positive definite matrix completion

Quasi-Newton methods are powerful techniques for solving unconstrained minimization problems. Variable metric methods, which include the BFGS and DFP methods, generate dense positive definite approximations and, therefore, are not applicable to large-scale problems. To overcome this difficulty, a sparse quasi-Newton update with positive definite matrix completion that exploits the sparsity pattern of the Hessian is proposed. The proposed method first calculates a partial approximate Hessian , where , using an existing quasi-Newton update formula such as the BFGS or DFP methods. Next, a full matrix H _k+1, which is a maximum-determinant positive definite matrix completion of , is obtained. If the sparsity pattern E (or its extension F) has a property related to a chordal graph, then the matrix H _k+1 can be expressed as products of some sparse matrices. The time and space requirements of the proposed method are lower than those of the BFGS or the DFP methods. In particular, when the Hessian matrix is tridiagonal, the complexities become O(n). The proposed method is shown to have superlinear convergence under the usual assumptions.      

Nonrelativistic limit in the energy space for nonlinear Klein-Gordon equations

We study the nonrelativistic limit of the Cauchy problem for the nonlinear Klein-Gordon equation and prove that any finite energy solution converges to the corresponding solution of the nonlinear Schr?dinger equation in the energy space, after the infinite oscillation in time is removed. We also derive the optimal rate of convergence in . Received: 13 July 2000 / Published online: 1 February 2002     

Degree Bounded Spanning Trees

In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for every independent set ${S \subseteq V(G)}In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for every independent set S í V(G){S \subseteq V(G)} of cardinality n(k−1) + c + 2, there exists a vertex set X í S{X \subseteq S} of cardinality k such that the degree sum of vertices in X is at least |V(G)| − c −1. Then G has a spanning tree T with maximum degree at most k+éc/nù{k+\lceil c/n\rceil} and ?_{v ? V(T)}max{d_T(v)-k,0} ￡ c{\sum_{v\in V(T)}\max\{d_T(v)-k,0\}\leq c} .     

Structure and properties of self-assembled fluorocarbon–silica nanocomposites

The formation of fluorocarbon–silica nanocomposites by the self-assembly of a fluorinated surfactant and aminoalkoxysilane coupling agents was studied by X-ray diffraction, electron microscopy, NMR spectroscopy and thermal analysis. The prepared materials posses a lamellar nanostructure consisting of non-crystalline fluorinated and condensed silica layers, the latter being very thin. The prepared materials show interesting properties for applications, such as hydrophobicity, thermal stability, high content of aminopropyl groups and low dielectric constant (≈2.8), which is almost independent on frequency. Moreover, the dielectric response can be interpreted in the framework of the Maxwell–Wagner model.