Complete ideals and singularities of space curves

We consider complete ideals supported on finite sequences of infinitely near points, in regular local rings with dimensions greater than two. We study properties of factorizations in Lipman special *-simple complete ideals. We relate it to a type of proximity, linear proximity, of the points, and give conditions in order to have unique factorization. Several examples are presented. Received: 2 February 2000 / in final form: 14 March 2001 / Published online: 18 January 2002     

Some formulae for the q-Bernoulli and Euler polynomials of higher order

The purpose of this paper is to give a proof of Kummer type congruence for the q-Bernoulli numbers of higher order, which is an answer to a part of the problem in a previous publication (see Indian J. Pure Appl. Math. 32 (2001) 1565-1570).     

On a bifurcation governed by hysteresis nonlinearity

We consider autonomous systems with a nonlinear part depending on a parameter and study Hopf bifurcations at infinity. The nonlinear part consists of the nonlinear functional term and the Prandtl--Ishlinskii hysteresis term. The linear part of the system has a special form such that the close-loop system can be considered as a hysteresis perturbation of a quasilinear Hamiltonian system. The Hamiltonian system has a continuum of arbitrarily large cycles for each value of the parameter. We present sufficient conditions for the existence of bifurcation points for the non-Hamiltonian system with hysteresis. These bifurcation points are determined by simple characteristics of the hysteresis nonlinearity.     

CMS physics overview

The principal physics goals of the Compact Muon Solenoid experiment under construction at the Large Hadron Collider at CERN in Geneva are reviewed. Procedures to search for the Standard Model Higgs boson, supersymmetric Higgses and other supersymmetric particles are described.     

Proton conductivity of phosphoric acid derivative of fullerene

The proton conductive property of methano [60] fullerene diphosphoric acid has been investigated under various humidity conditions at the temperature range between 15 and 45 °C. It shows proton conductivity as high as 10⁻² S cm⁻¹ at 25 °C under relative humidity of 95%. Thermal analyses including TG–DTA and thermal desorption mass spectroscopy (TDS) confirm that the compound is thermally stable up to 200 °C. Proton conduction of the compound depends very much on humidity or water content. The logarithmic conductivity at 25 °C is increased linearly with increasing relative humidity. The activation energy (E_a) estimated from the slope of log(σT) vs. 1/T is decreased from 1.08 to 0.52 eV, as the relative humidity is increased from 40% to 75%. The humidity dependence of conductivity is discussed in the light of the observed hydration isotherm.     

光纤白光干涉仪等臂长技术研究

介绍了几种光纤干涉仪等臂长技术,比较了各自的优缺点和适用范围,对光纤干涉仪的平衡有较大的参考价值。     

BP神经网络-FTIR方法测定苯乙烯-丙烯酸丁酯共聚物中单体含量

利用红外特征峰波数偏移值与单体含量间的非线性定量关系,BP人工神经网络-FTIR法在较宽的含量范围(10%-90%之间)之内,准确测定了苯乙烯-丙烯酸丁酯共聚物中丙烯酸丁酯单体含量,回收率在97.3%-101.8%之间.     

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.