Hilbert重级数定理的一个改进

The object of this note is to prove the followingTheorem Let{a_n}and{b_n}be sequences of real numbers such that0<∑∑a_n~2<+∞and0<∑b_n~2<+∞.Then we have the inequalitysum from m=1 to∞sum from n=1 to∞a_mb_n/m+n<{sum from n=1 to∞(π-θ/n~(1/2)a_n~2}~1/2{sum from n=1 to∞(π-θ/n~(1/2)b_n~2}~1/2 (1)whereθ=3/2~(1/2)-1=1.121320343.     

Synthesis and Reactions of Some New Pyrrolylfuro[2,3‐d]Pyrimidines and Pyrrolopyrazinofuropyrimidines

5‐Amino‐4‐methyl‐2‐phenyl‐6‐substitutedfuro[2,3‐d]pyrimidines ( 2a‐c ) were reacted with 2,5‐dimethoxytetrahydrfuran to afford the pyrrolyl derivatives 3a‐c . Compound 3a was chosen as intermediate for the synthesis of poly fused heterocycles incorporated furopyrimidines moiety 4–11 . Some of the synthesized compounds were screened for their antibacterial and antifungal activities.     

Measurement of the Seperation between Atoms beyond Diffraction Limit

We propose a scheme to obtain the distance of two identical atoms placed inside the standing wave field by monitoring the collective resonance fluorescence spectrum emitted by the two particles. We find three different parameter ranges, depending on the distance of the atoms as compared to the transition wavelength. For large interparticle distances, dipole-dipole coupling is negligible, and the main system evolution arises from the interaction with the standing wave field. In the small-distance limit, the dynamics is dominated by the dipole-dipole interaction. Finally, in the intermediate region, a rich interplay of the various couplings arises, which however is lifted for strong driving laser fields. The present measurement procedure allows us to distinguish the three cases. In each of the cases, we show how to determine the distance of the two particles and their respective positions relative to the nodes of the standing wave field with fractional-wavelength precision.     

Attractors and Dimensions for Discretizations of a Dissipative Zakharov Equations

Abstract In this paper, a dissipative Zakharov equations are discretized by difference method.We make priorestimates for the algebric system of equations. It is proved that for each mesh size,there exist attractors forthe discretized system.The bounds of the Hausdorff dimensions of the discrete attractors are obtained,and thevarious bounds are dependent of the mesh sizes.     

Two modifications of the least cost per period heuristic for dynamic lot-sizing

This paper proposes two constructive heuristics for the well-known single-level uncapacitated dynamic lot-sizing problem. The proposed heuristics, called net least period cost (nLPC) and nLPC(i), are developed by modifying the average period cost concept from Silver and Meal's heuristic, commonly known as least period cost (LPC). An improved tie-breaking stopping rule and a locally optimal decision rule are proposed in the second heuristic to enhance performance. We test the effectiveness of the proposed heuristics by using 20 benchmarking test problems frequently used in the literature. Furthermore, we perform a large-scale simulation study involving three factors, 50 experimental conditions, and 100?000 randomly generated problems to evaluate the proposed heuristics against LPC and six other well-known constructive heuristics in the literature. The simulation results show that both nLPC and nLPC(i) produce average holding and setup costs lower than or equal to those of LPC in every one of the 50 experimental conditions. The proposed heuristics also outperform each of the six other heuristics evaluated in all experimental conditions, without an increase in computational requirements. Lastly, considering that both nLPC and nLPC(i) are fairly simple for practitioners to understand and that lot-sizing heuristics have been commonly used in practice, there should be a very good chance for practical applications of the proposed heuristics.     

Three New Polyoxygenated Steroids from Two Species of the South China Sea Gorgonian Muricella flexuosa and Menella verrucosa Brundin

Three new polyoxygenated steroids, muricesteroid ( 1 ), and menellsteroids A ( 2 ) and B ( 3 ), were isolated from two species of the South China Sea gorgonian Muricella flexuosa and Menella verrucosa Brundin , respectively. The structures of these new compounds were elucidated on the basis of extensive spectroscopic analysis, chemical methods and comparison with known related compounds.     

A finite model property for RMImin

It is proved that the variety of relevant disjunction lattices has the finite embeddability property. It follows that Avron's relevance logic RMI _min has a strong form of the finite model property, so it has a solvable deducibility problem. This strengthens Avron's result that RMI _min is decidable. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Time-domain numerical computation of noise reduction by diffraction and finite impedance of barriers

A new time-domain numerical method is presented for the estimation of noise reduction by the diffraction and finite impedance of barriers. High order finite difference schemes conventionally used for computational aeroacoustics, and time-domain impedance boundary conditions are utilized for the development of the time-domain method. Compared with other methods, this method can be applied more easily to the problems related to nonlinear noise propagation such as impulsive noise and broadband noise. Linearized Euler equations in Cartesian co-ordinates are considered and solved numerically. Straight and T-shaped barriers with and without surface admittance are calculated. In order to assess the accuracy of this time-domain method, comparison with the results of SYSNOISE software (Ver. 5.3) are made. There are very good agreements between the results of the present time-domain numerical method and the boundary element method of the SYSNOISE software.     

Hamiltonian N2‐locally connected claw‐free graphs

A graph G is N₂‐locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjá?ek conjectured that every 3‐connected N₂‐locally connected claw‐free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005