大中直径螺旋焊管切管机的试验研究

介绍一种采用机械式铣削方法(旋风铣)来切断螺旋焊管的移动式切管机,并在实验的基础上与其它方式的切管方法进行了分析对比,从而肯定了这种切管方式的较大的优越性.     

步进电机细分技术在经济型数控机床中的应用

本文叙述了步进电机细分原理及微机控制系统，并将其应用于经济型数控铣床的横向进给伺服系统，有效提高了开环数控系统的定位精度。     

链式输送竹片软化机研究

简述了链式输送竹片软化机的设计指导思想和设计方案，重点介绍软化机的构成，参数的确定以及它的优点。     

加工硬质合金端铣刀刀槽时的工艺调整计算

硬质合金端铣刀刀体上的刀槽，通常将设计为槽底与铣刀轴线倾斜δ角，槽侧壁与铣刀轴线倾角为ω且偏移一个距离为ｅ，以使刀齿装夹在刀体上后获得端铣刀所需的几何角度。本文主要论述在万能铣床上铣削铣刀体上具有δ、ω、ｅ的刀槽时必要的工艺调整，利用矢量及座标转换推导了加工刀槽时必要的参数计算公式，为高效率、高质量地进行铣刀体刀槽的加工提供了一种精确可行的参数计算方法。     

调制不稳定性对级联放大光纤传输系统信噪比的影响

在考虑光纤损耗和级联放大器的情况下，推导了调制不稳定性的产生条件和增益的普适解析表达式，分析了调制不稳定性对信噪比的影响，给出了一个新的计算信噪比的表达式。     

论加快发展民营经济的重要性及主要措施

在我国,民营经济已成为提供有效供给,促进经济增长的主力军;发展民营经济有利于推动国有经济的改革和重组;有利于促进二元经济结构向一元经济转化.加快民营经济发展应解放思想,解决民营经济的市场准入问题;营造良好的法律、融资和政策环境.     

虚拟机在操作系统开发中的应用研究

虚拟机是使用软件模拟的方法在电脑上模拟出来的计算机，利用它来开发OS软件能显著地缩短开发周期，降低开发难度。本文从实战出发，介绍了将虚拟机应用在OS开发实战中的应用方法。     

激发数学学习兴趣的策略

针对多数学生对学习数学有枯燥、乏味的感觉，阐述了必须在教学中采用生动的富有感染力的教学方法，以激发学生对数学学习的浓厚兴趣，使学生在提出问题和解决问题中养成善于思考，勇于探索的良好品质。     

“String” formulation of the dynamics of the forward interest rate curve

We propose a formulation of the term structure of interest rates in which the forward curve is seen as the deformation of a string. We derive the general condition that the partial differential equations governing the motion of such string must obey in order to account for the condition of absence of arbitrage opportunities. This condition takes a form similar to a fluctuation-dissipation theorem, albeit on the same quantity (the forward rate), linking the bias to the covariance of variation fluctuations. We provide the general structure of the models that obey this constraint in the framework of stochastic partial (possibly non-linear) differential equations. We derive the general solution for the pricing and hedging of interest rate derivatives within this framework, albeit for the linear case (we also provide in the appendix a simple and intuitive derivation of the standard European option problem). We also show how the “string” formulation simplifies into a standard N-factor model under a Galerkin approximation. Received: 30 January 1998 / Revised: 12 February 1998 / Accepted: 16 February 1998     

Fast neighborhood search for the single machine total weighted tardiness problem

Most successful heuristics for solving 1||∑w_jT_j are based on swap moves. We present an algorithm which improves the complexity of searching the swap neighborhood from O(n³) to O(n²). We show that this result also improves the complexity of the recently developed dynasearch heuristics.