一种基于空间到达角的卫星电子侦察信号分选方法

在建立简化的卫星电子侦察空间模型的基础上，提出了一种利用空间到达角分选卫星电子侦察信号的新方法。通过仿真实验验证了这种方法的可行性。该方法可用于密集信号的预处理。     

人工神经网络理论及其应用

简要介绍了人工神经网络的发展过程和基本理论，从神经网络具有自学习功能、联想存储功能和高速寻找优化解的能力三个方面论述了其特点和优越性，详细阐述了在模式识别、信号处理、自动控制、人工智能、自适应的人机接口、优化计算、通信以及其它方面的应用，探讨和分析了其发展前景。     

珠钢滤波-无功补偿优化调整方案

本文主要论述了珠钢滤波-无功补偿优化调整方案在生产中的应用。     

最佳基数排序

基数排序由于其效率高而被广泛应用。通常,基数排序所用的基数是10,然而,如果求得一个基数r_(best),并且用r_(best)为基数进行基数排序使排序时间达到最小,则这将具有非常重要的意义。本文给出了求r_(best)的方法,分析了以r_(best)为基数进行基数排序的时间复杂度,提出了进一步提高效率的措施,并将以r_(best)为基数的基数排序速度与以10为基数的基数排序进行了比较。     

脉冲电镀最佳参数之探索和优化

本文利用正交实验法对脉冲电镀各控制参数进行试验,对影响分散能力、镀层可靠性及外观质量的各种因素进行探讨,寻找影响外观质量的显著因子并加以控制,同时进一步优化脉冲电镀的工艺参数。     

网络计划在银山前区转炉、连铸工程中的应用

以网络计划在银山前区转炉、连铸壬程中的应用实例，论述了施工网络计划执行过程中，跟踪、调整、优化、实施的重要性。     

管理信息系统建设中数据库的系统设计与管理

提出用系统的观念分类和管理数据库，挖掘数据库在管理信息系统建设中的潜在能力。     

A strategy for integrating product conceptualization and bid preparation

Collaboration with other members of the supply chain is one means by which small and medium sized enterprises (SMEs) can compete in today’s global business environment. Thus, early stages of the new product development process involve both technical activities, e.g., product platform definition, and commercial activities, e.g., bidding for contracts. This paper introduces an integrated collaborative bidding and design system (CBDS) to help SMEs coordinate the two aspects. General sorting was employed for initial requirements acquisition and platform definition; while a self-organizing map (SOM) neural network was combined with a concurrent cost-schedule estimation strategy for refinement of design options and bid evaluation/preparation. A case study on cellular phone design was then applied for illustrating the proposed prototype system.     

10000m^3内浮顶油罐双浮动吸油装置设计

介绍了某油库扩建工程中10 000 m3内浮顶油罐双DN500浮动吸油装置的结构设计,并对内浮顶罐浮动吸油装置的浮力进行了优化配置,此经验对我国内浮顶油罐浮动吸油装置的设计和使用具有一定的指导意义.     

Networks for sorting multitonic sequences

Lee and Batcher have designed networks that efficiently merge k separately provided sorted sequences of known lengths totalling n. We show that the design is still possible, and in fact easier to describe, if we do not make use of the lengths, or even the directions of monotonicity, of the individual sequences—the sequences can be provided in a single undelimited concatenation of length n. The depth of the simplest resulting network to sort sequences that are “k-tonic” and of length n is , generalizing Batcher's 1968 results for the extreme values of k (k=2 corresponding to merging, and k=n/2 corresponding to general sorting).The exposition is self-contained and can serve even as an introduction to sorting networks and Batcher's results.