Lusternik-Schnirelmann 定理的推广

本文根据Brouwer映射度的理论和微分拓扑的基本方法推广了Lusternik_Schnirelmann定理     

在Lp（s）空间中多元的Bernstein－Kantorovich算子的逼近性质

本文对定义在单形上的Ｂｅｒｎｓｔｅｉｎ－Ｋａｎｔｏｒｏｖｉｃｈ（以下简记为Ｂ－Ｋ）算子，给出了几个弱型不等式，得到了     

Estimation of vector ARMAX models

The asymptotic properties of maximum likelihood estimates of a vector ARMAX system are considered under general conditions, relating to the nature of the exogenous variables and the innovation sequence and to the form of the parameterization of the rational transfer functions, from exogenous variables and innovations to the output vector. The exogenous variables are assumed to be such that the sample serial covariances converge to limits. The innovations are assumed to be martingale differences and to be nondeterministic in a fairly weak sense. Stronger conditions ensure that the asymptotic distribution of the estimates has the same covariance matrix as for Gaussian innovations but these stronger conditions are somewhat implausible. With each ARMAX structure may be associated an integer (the McMillan degree) and all structures for a given value of this integer may be topologised as an analytic manifold. Other parameterizations and topologisations of spaces of structures as analytic manifolds may also be considered and the presentation is sufficiently general to cover a wide range of these. Greater generality is also achieved by allowing for general forms of constraints.     

Single Machine Batch Scheduling Problem with Resource Dependent Setup and Processing Time in the Presence of Fuzzy Due Date

We consider a batch scheduling problem on a single machine which processes jobs with resource dependent setup and processing time in the presence of fuzzy due-dates given as follows:1. There are n independent non-preemptive and simultaneously available jobs processed on a single machine in batches. Each job j has a processing time and a due-date.2. All jobs in a batch are completed together upon the completion of the last job in the batch. The batch processing time is equal to the sum of the processing times of its jobs. A common machine setup time is required before the processing of each batch.3. Both the job processing times and the setup time can be compressed through allocation of a continuously divisible resource. Each job uses the same amount of the resource. Each setup also uses the same amount of the resource.4. The due-date of each job is flexible. That is, a membership function describing non-decreasing satisfaction degree about completion time of each job is defined.5. Under above setting, we find an optimal batch sequence and resource values such that the total weighted resource consumption is minimized subject to meeting the job due-dates, and minimal satisfaction degree about each due-date of each job is maximized. But usually we cannot optimize two objectives at a time. So we seek non-dominated pairs i.e. the batch sequence and resource value, after defining dominance between solutions.A polynomial algorithm is constructed based on linear programming formulations of the corresponding problems.     

Ellipticity of the Linearly Polarized He-Ne Laser Radiation Reflected by the Leaves of Plants

The phenomenon of elliptical polarization of the linearly polarized radiation reflected near the Brewster angle by the leaves of plants has been investigated. It has been shown that the appearance of ellipticity is associated with the complex structure of the cuticle.__________Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 72, No. 2, pp. 236–240, March–April, 2005.     

Spectrophotometric determination of deacetylation degree of chitinous materials dissolved in phosphoric acid

A simple spectrophotometric method is proposed for determining deacetylation degrees (DD) of chitinous materials using phosphoric acid as the UV-transparent solvent system. Calibrating by the extinction coefficients (A(210)) of D-glucosamine and N-acetyl-D-glucosamine, DD values (24-88%) were computed numerically. The results correlated well (R(2) = 0.9805, n = 50) with those obtained by solid-state (13)C NMR. Comparison of the results obtained by the proposed UV method and solid-state (13)C NMR.     

The Fredholm alternative for the one-dimensional p-Laplacian

In this paper we consider the solvability of the boundary value problem

     

Sparse <Emphasis Type="Italic">H</Emphasis>-Colourable Graphs of Bounded Maximum Degree

Let F be a graph of order at most k. We prove that for any integer g there is a graph G of girth at least g and of maximum degree at most 5k¹³ such that G admits a surjective homomorphism c to F, and moreover, for any F-pointed graph H with at most k vertices, and for any homomorphism h from G to H there is a unique homomorphism f from F to H such that h=fc. As a consequence, we prove that if H is a projective graph of order k, then for any finite family of prescribed mappings from a set X to V(H) (with ||=t), there is a graph G of arbitrary large girth and of maximum degree at most 5k^26mt (where m=|X|) such that and up to an automorphism of H, there are exactly t homomorphisms from G to H, each of which is an extension of an f.Supported in part by the National Science Council under grant NSC89-2115-M-110-012Final version received: June 9, 2003     

一类二阶泛函微分方程周期解存在性问题

利用重合度理论研究一类二阶泛函微分方程x″(t)+f(t,x_t)x′~n+β(t)g(x(t-τ(t)))=p(t)的周期解问题,本文得到了周期解存在的新的结果。