The continuity of superposition operators on some sequence spaces defined by moduli

Let λ and μ be solid sequence spaces. For a sequence of modulus functions Φ = (ϕ k) let λ(Φ) = {x = (x _k ): (ϕk(|x _k |)) ∈ λ}. Given another sequence of modulus functions Ψ = (ψ_k), we characterize the continuity of the superposition operators P _f from λ(Φ) into μ (Ψ) for some Banach sequence spaces λ and μ under the assumptions that the moduli ϕk (k ∈ ℕ) are unbounded and the topologies on the sequence spaces λ(Φ) and μ(Ψ) are given by certain F-norms. As applications we consider superposition operators on some multiplier sequence spaces of Maddox type. This research was supported by Estonian Science Foundation Grant 5376.     

On the uniform decay for the Korteweg–de Vries equation with weak damping

The aim of this work is to consider the Korteweg–de Vries equation in a finite interval with a very weak localized dissipation namely the H^?1‐norm. Our main result says that the total energy decays locally uniform at an exponential rate. Our analysis improves earlier works on the subject (Q. Appl. Math. 2002; LX (1):111–129; ESAIM Control Optim. Calculus Variations 2005; 11 (3):473–486) and gives a satisfactory answer to a problem suggested in (Q. Appl. Math. 2002; LX (1):111–129). Copyright © 2007 John Wiley & Sons, Ltd.     

Performance Enhancement for Optical Fast Frequency-hopping CDMA Systems by BCH Channel Coding

In this paper, the impact of optical beat noise on the performance of optical fast frequency-hopping code-division multiple-access (FFH OCDMA) networks is analyzed. BCH/FFH-OCDMA to reduce the impact of optical beat noise is proposed. It is shown that, BCH/FFH-OCDMA has much better performance under the same bit rate, same chip time and same number of available wavelengths. Another advantage for BCH/FFH-OCDMA is that the code length of one-coincidence sequence will be shorter, which can greatly reduce the difficulty of fabrication for fiber gratings.     

液体可视图象序列中杂质小目标的检测方法

在分析红外图象和视图象差异的基础上，研究了一种适用于可视图像序列的运动小目标检测算法。受目标影响的象素点具有较弱的时间相关性，即相对普通象素点有较大的时间方差，根据此特征，用管道更新的方法产生新方差图象序列，再用管道更新的方法累积，增加信噪比，然后用基于统计均值的自适应门限方法分割出目标，最后将原图象的梯度倒数作为象素点强度的加权，有效地抑制灰度突变边界的传感器噪音，保存目标点。     

低复杂度序列的维数

本文研究符号空间中由零拓扑熵序列组成的集合.通过构造适当的自相似集,证明了该集合的盒维数为1,而Hausdorff维数为0.     

Residual currents and corridor of flow in the Rio de la Plata

The Rio de la Plata is a large and shallow water body that discharges onto the Atlantic Ocean. The main driving forces for the river flow are the bathymetry, tides, the outflow from the Paraná and Uruguay rivers and the winds. A numerical model covering the entire river was set up with the objective of increasing our understanding of the hydrographical features and morphological dynamics in the Estuary. The simulations revealed a counter-clockwise residual circulation in the Samborombón Bay and an eastward net flow near the Uruguayan coast. The residual flow is forced by both the tides and the bathymetry. The residence time for the entire river ranges from 40 to 80 days. However, residence times above 120 days was found in the Samborombón Bay. Three corridors of flow have been identified.     

Joint detection of a given number of reference fragments in a quasi-periodic sequence and its partition into segments containing series of identical fragments

The problem of joint a posteriori detection of reference fragments in a quasi-periodic sequence and its partition into segments containing series of recurring fragments from the reference tuple is solved. It is assumed that (i) an ordered reference tuple of sequences to be detected is given, (ii) the number of desired fragments is known, (iii) the index of the sequence term corresponding to the beginning of a fragment is a deterministic (not random) value, and (iv) a sequence distorted by an additive uncorrelated Gaussian noise is available for observation. It is established that the problem consists in testing a set of hypotheses about the mean of a random Gaussian vector. The cardinality of the set grows exponentially as the vector dimension (i.e., the sequence length) increases. An efficient a posteriori algorithm producing a maximum-likelihood optimal solution to the problem is substantiated. Time and space complexity bounds related to the parameters of the problem are derived. The results of numerical simulation are presented.     

Classes polaires associées aux distributions holomorphes de sous-espaces tangents*

Résumé. Nous définissons des classes polaires associées à une distribution holomorphe singulière de sous-espaces tangents d’une variété projective lisse. Nous prouvons que ces classes polaires peuvent être calculées en fonction des classes de Chern-Mather du faisceau tangent de la distribution et réciproquement. Nous utilisons leurs degrés pour borner les degrés de certaines classes polaires associés à une variété invariante. *Ce travail a été soutenu par l’Accord de Coopération France-Brésil (CNRS/CNPq) et par la Fondation CAPES-Brésil.     

Using the gradients of temperature and internal parameters in Continuum ThermodynamicsIntroduction des gradients de température et de paramètres internes en Thermodynamique des Milieux Continus

In this paper, the possibility of using the gradients of the temperature and of the internal parameters as additional state variables in Continuum Thermodynamics is considered. The expressions of the two principles are discussed and Clausius–Duhem inequality is derived under an appropriate statement of the internal entropy production. Several formulations are proposed and compared to existing results in the literature. To cite this article: P. Ireman, Q.S. Nguyen, C. R. Mecanique 332 (2004).     

Measurements of edge-uncolorability

Cubic bridgeless graphs with chromatic index four are called uncolorable. We introduce parameters measuring the uncolorability of those graphs and relate them to each other. For k=2,3, let c_k be the maximum size of a k-colorable subgraph of a cubic graph G=(V,E). We consider r₃=|E|−c₃ and . We show that on one side r₃ and r₂ bound each other, but on the other side that the difference between them can be arbitrarily large. We also compare them to the oddness ω of G, the smallest possible number of odd circuits in a 2-factor of G. We construct cyclically 5-edge connected cubic graphs where r₃ and ω are arbitrarily far apart, and show that for each 1c<2 there is a cubic graph such that ωcr₃. For k=2,3, let ζ_k denote the largest fraction of edges that can be k-colored. We give best possible bounds for these parameters, and relate them to each other.