铁路主要干线提速有关问题的研究

在对列车提速的必要性、原则和有限目标进行论述的基础上，就列车提速对运输技术设备的要求和运输组织方面的若干问题进行了初步探讨，分析了多速度客货列车混跑时，不同速度配比的组合方案对线路通过能力的影响，为干线提速的方案选定提供了基础     

架线式电机车安全制动距离的能量观

采用7t,10t架线式电机车和1t,3t矿车进行列车车组计算,讨论了安全制动距离对列车组成和运输能耗的影响。     

Basic Properties of the (t, n)-Threshold Visual Secret Sharing Scheme with Perfect Reconstruction of Black Pixels

In this paper we consider the (t, n)-threshold visual secret sharing scheme (VSSS) in which black pixels in a secret black-white images is reproduced perfectly as black pixels when we stack arbitrary t shares. This paper provides a new characterization of the (t, n)-threshold visual secret sharing scheme with such a property (hereafter, we call such a VSSS the (t, n)-PBVSSS for short). We use an algebraic method to characterize basis matrices of the (t, n)-PBVSSS in a certain class of matrices. We show that the set of all homogeneous polynomials each element of which yields basis matrices of the (t, n)-PBVSSS becomes a set of lattice points in an (n−t+1)-dimensional linear space. In addition, we prove that the optimal basis matrices in the sense of maximizing the relative difference among all the basis matrices in the class coincides with the basis matrices given by Blundo, Bonis and De Santis [3] for all n≥ t ≥ 2.     

电磁感应理论在磁悬浮列车中的应用

介绍了电磁感应和超导基本理论的实际应用－磁悬浮列车。以日本超导磁悬浮列车为例，阐述其作用原理，介绍了超导磁悬列车的发展状况。指出在物理教学中，理论学习与实际应用相结合是提高学生学习兴趣和培养创新能力的有效途径。     

基于移动Agent技术的医学图像检索方法

针对现有医学图像检索方法中，检索算法速度较慢、准确性较低以及远程检索时占用大量带宽等问题，设计并实现了一种基于移动Agent技术的医学图像检索方法，重点讨论了该方法实现的关键技术，包括提升框架下的M带整数小波变换和提取多通道纹理特征的检索算法．模拟实验结果表明，该方法实时性较强，占用网络带宽较少，采用的算法运算速度提高近10倍、运算复杂度降低约50％，提取的纹理特征能充分表达图像内容，较好地满足了医学图像的检索要求，实现了对医学图像库快速较准确的检索．     

300 km·h-1电动车组制动参数研究

在我国研制的先锋号电动车组制动系统的基础上 ,借鉴国外高速列车的经验 ,对自行研制 30 0km·h-1高速动车组制动系统的重要参数进行了研究 ,并提出了可供运用的设计值 .通过对先锋号动车组和 30 0km·h-1高速动车组制动参数的比较分析 ,指出先锋号制动系统的模式比较适合于 30 0km·h-1动车组 .     

关于足球运动员保持竞技状态的探讨

足球运动的不断发展和进步 ,赛事不断增加 ,赛季不断延长 ,比赛激烈性不断加大。如果在比赛中能够充分发挥运动员的竞技状态 ,这将对比赛起着不可估量的作用 ,而长期的保持这种状态 ,对整个赛季比赛的获胜至关重要。     

On polynomial symbols for subdivision schemes

Given a dilation matrix A :ℤ^d→ℤ^d, and G a complete set of coset representatives of 2π(A ^−Tℤ^d/ℤ^d), we consider polynomial solutions M to the equation ∑ _g∈G M(ξ+g)=1 with the constraints that M≥0 and M(0)=1. We prove that the full class of such functions can be generated using polynomial convolution kernels. Trigonometric polynomials of this type play an important role as symbols for interpolatory subdivision schemes. For isotropic dilation matrices, we use the method introduced to construct symbols for interpolatory subdivision schemes satisfying Strang–Fix conditions of arbitrary order. Research partially supported by the Danish Technical Science Foundation, Grant No. 9701481, and by the Danish SNF-PDE network.     

A New Integrated Design Method Based on Fuzzy Matter-Element Optimization

This paper puts forward a new integrated design met ho d based on fuzzy matter-element optimization.On the based of analyzing the mod el of multi-objective fuzzy matter-element , the paper defines the m atter-element weightily and changes solving multi-objective fuzzy optimization into solving dependent function K(x) of the single-objective optimization according to the optimization criterion. The paper particularly describes the realization approach of GA process of multi -objective fuzzy matter-eleme...     

On the departure process of a leaky bucket system with long-range dependent input traffic

Due to the strong experimental evidence that the traffic to be offered to future broadband networks will display long-range dependence, it is important to study the possible implications that such traffic may have for the design and performance of these networks. In particular, an important question is whether the offered traffic preserves its long-range dependent nature after passing through a policing mechanism at the interface of the network. One of the proposed solutions for flow control in the context of the emerging ATM standard is the so-called leaky bucket scheme. In this paper we consider a leaky bucket system with long-range dependent input traffic. We adopt the following popular model for long-range dependent traffic: Time is discrete. At each unit time a random number of sessions is initiated, having the distribution of a Poisson random variable with mean λ. Each of these sessions has a random duration τ, where the integer random variable τ has finite mean, infinite variance, and a regularly varying tail, i.e., P(τ >К) ~ К^-Lα L(К), where 1 < α < 2 L(·) is a slowly varying function. Once a session is initiated, it generates one cell at each unit of time until its termination. We examine the departure process of the leaky bucket policing mechanism driven by such an arrival process, and show that it too is long-range dependent for any token buffer size and any - finite or infinite - cell buffer size. Moreover, upper and lower bounds for the covariance sequence of the output process are established. The above results demonstrate that long-range dependence cannot be removed by the kinds of flow control schemes that are currently being envisioned for broadband networks. This revised version was published online in June 2006 with corrections to the Cover Date.