Iterative Method for Constructing Complete Complementary Sequences with Lengths of 2^mN

Complete complementary sequences are widely used in spectrum spread communications because of their ideal correlation functions. A previous method generates complete complementary sequences with lengths of N^nN （n,N ∈ Z^＋）. This paper presents a new iterative method to construct complete complementary sequences with lengths of 2^mN （m,N ∈ Z^＋）. The analysis proves that this method can produce many sequence sets that do not appear in sequence sets generated by the former method, especially shorter sequence sets. The result will certainly increase the application of complete complementary sequences in communication engineering and related fields.     

On Vector Quasi-Variational Inequality Problems in H-Space

The purpose to this paper is to study the existence problem of solutions to the vector quasi-variational inequality for vector-valued functions in H-space.     

对"晨光"体育活动的审度与思考

在总结河南省“晨光”体育活动成功经验的基础上 ,对提高学校体育的水平与质量进行了理论性论证 ,进而提出了“晨光”体育活动应推广与普及的合理化建议及可行性措施 .     

Rigidity of the scattering length spectrum

In this paper we consider properties of obstacles satisfying some non-degeneracy conditions that can be recovered from the scattering length spectrum (SLS). Clearly the latter tells us whether the obstacle K is trapping or non-trapping. If the set of trapped points is relatively small, then the SLS also determines the volume of the obstacle, the number of its connected components, and whether its boundary is convex everywhere or it has non-trivial concavities. Under the additional assumption that the curvature of the obstacle does not vanish of infinite order, it is proved that from the SLS one can recover certain information about the number of reflection points of any simply reflecting ray in the exterior of the obstacle. Finally, for some special classes of obstacles (e.g. star-shaped ones), it is shown that the SLS completely determines the obstacle. Received: 2 March 1999 / Revised version: 16 January 2001 / Published online: 5 September 2002     

Solving the Gleason problem on linearly convex domains

Let be a bounded, connected linearly convex set in with boundary. We show that the maximal ideal (both in ) and ) consisting of all functions vanishing at is generated by the coordinate functions . Received: 2 July 2001; in final form: 26 September 2001 / Published online: 28 February 2002     

Non-trivial simple poles at negative integers and mass concentration at singularity

Let (X,0) be the germ of a normal space of dimension n+1 and let f be the germ at 0 of a holomorphic function on X. Assume both X and f have an isolated singularity at 0. Denote by J the image of the restriction map , where F is the Milnor fibre of f at 0. We prove that the canonical Hermitian form on , given by poles of order at in the meromorphic extension of , passes to the quotient by J and is non-degenerate on . We show that any non-zero element in J produces a “mass concentration” at the singularity which is related to a simple pole concentrated at for (in a non-na?ve sense). We conclude with an application to the asymptotic expansion of oscillatory integrals , for , when . Received: 28 May 2001 / Published online: 26 April 2002     

A comparative XPS and UPS study of VOx layers on mineral TiO2(001)‐anatase supports

Four vanadium oxide layers on mineral TiO₂(001)‐anatase supports with different thickness (3–33 Å) were prepared with reactive d.c. magnetron sputtering and were extensively studied with photoelectron spectroscopy. Al Kα radiation and 150 eV synchrotron radiation were used as excitation sources. The evolution of the 2p, 3s and 3p core level line shapes of V and Ti as a function of the vanadium oxide thickness was studied, as well as the O1s and O2s core lines and the valence band. All the V2p spectra of the deposited vanadium oxide layers consist of at least 60% V⁵⁺, the rest being V⁴⁺. The V3p region is complicated by multiplet splitting, which prevents the determination of the vanadium oxidation state. The V3p multiplet splitting is different for the two excitation energies. No reduction of the titania support surface due to the vanadium oxide deposition was observed. Copyright © 2006 John Wiley & Sons, Ltd.     

Fluorinated,crosslinkable terpolymers based on vinylidene fluoride and bearing sulfonic acid side groups for fuel‐cell membranes

The radical terpolymerization of 8‐bromo‐1H,1H,2H‐perfluorooct‐1‐ene with vinylidene fluoride (VDF) and perfluoro(4‐methyl‐3,6‐dioxaoct‐7‐ene) sulfonyl fluoride is presented. Changing the feed compositions of these three fluorinated comonomers enabled us to obtain different random‐type poly[vinylidene fluoride‐ter‐perfluoro(4‐methyl‐3,6‐dioxaoct‐7‐ene) sulfonyl fluoride‐ter‐8‐bromo‐1H,1H,2H‐perfluorooct‐1‐ene] terpolymers containing various sulfonyl fluoride and brominated side groups. Yields higher than 70% were reached in all cases. The hydrolysis of the sulfonyl fluoride group into the ? SO₃Li function in the presence of lithium carbonate was quantitatively achieved without the content of VDF being affected, and so dehydrofluorination of the VDF base unit was avoided. These original terpolymers were then crosslinked via dangling bromine atoms in the presence of a peroxide/triallyl isocyanurate system, which produced films insoluble in organic solvents such as acetone and dimethylformamide (which totally dissolved uncured terpolymers). The acidification of ? SO₃Li into the ? SO₃H function enabled protonic membranes to be obtained. The thermal stabilities of the crosslinked materials were higher than those of the uncured terpolymers, and their electrochemical performances were investigated. According to the contents of the sulfonic acid side functions, the ion‐exchange capacities ranged from 0.6 to 1.5 mequiv of H⁺/g, whereas the water uptake and conductivities ranged from 5–26% (±11%) and from 0.5 to 6.0 mS/cm, respectively. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 44: 4566–4578, 2006     

An improved linearization strategy for zero-one quadratic programming problems

We present a new linearized model for the zero-one quadratic programming problem, whose size is linear in terms of the number of variables in the original nonlinear problem. Our derivation yields three alternative reformulations, each varying in model size and tightness. We show that our models are at least as tight as the one recently proposed in [7], and examine the theoretical relationship of our models to a standard linearization of the zero-one quadratic programming problem. Finally, we demonstrate the efficacy of solving each of these models on a set of randomly generated test instances.     

超模的同构定理

本文利用模论导出超模的三个同构定理,同时,给出超模的Jordan-Holder定理,最后,探讨了超模的基本关系∈~*,并研究其性质．