神经计算机并行模拟结构

神经网络实现技术是神经网络研究的一个极重要的领域。本文首先分析了神经网络模拟对并行计算机系统的要求,认为影响神经网络计算机速度和容量提高的主要因素是单个处理单元的速度、单个处理单元的局部存储器的容量以及互连网络的通信带宽。要提高模拟神经计算机的速度和容量,就要有相应的并行结构来支持。在定量的需求分析的基础上,本文还提出了一种模拟神经计算机的并行结构。     

应用内弹道势平衡理论对单一曲线数据的处理方法研究

本文利用弹后空间一维均相流假设推导了弹道参数λ_ε,λ,λ_ε的理论表达式。同时对三个参数的相关量进行了研究,得出了与ε相关的关系。利用多通道数据解决了λ-ε的变化规律。文中给出一套完整的膛内火药燃烧规律的处理方法,并对实例进行了计算。     

Production-location problems with demand considerations

The production-location problem of a profit maximizing firm is considered. A model is developed for a single firm, facing the joint problems of determining the optimal plant location, the optimal input mix, and the optimal plant size. A homothetic production function is used as the model of the production technologies, and the existence of a sequential “separability” between the production, or input mix, problem and the location problem is demonstrated.     

On finding spanning eulerian subgraphs

In this article, we examine the problem of producing a spanning Eulerian subgraph in an undirected graph. After the ?-completeness of the general problem is established, we present polynomial-time algorithms for both the maximization and minimization versions where instances are defined on a restricted class of graphs referred to as series-parallel. Some novelties in the minimization case are discussed, as are heuristic ideas.     

Approximation for the departure process of a queue in a network

A simple renewal process is identified to approximate the complex departure process of a queue often found in queueing network models. The arrival process to the queue is the superposition or merging of several independent component-renewal processes that are approximations of departure processes from other queues and external arrival processes; there is a single server with exponential service times, and the waiting space is infinite. The departure process of this queue is of interest because it is the arrival process to other queues in the network. The approximation proposed is a hybrid; the mean and variance of the approximating departure intervals is a weighted average of those determined by basic methods in Whitt [41] with the weighting function empirically determined using simulation. Tandem queueing systems with superposition arrival processes and exponential service times are used to evaluate the approximation. The departure process of the first queue in the tandem is approximated by a renewal process, the tandem system is replaced by two independent queues, and the second queue is solved analytically. When compared to simulation estimates, the average absolute error in hybrid approximations of the expected number in the second queue is 6%, a significant improvement over 22–41% in the basic methods.     

Minimizing mean absolute deviation of completion times about a common due date

We consider a single machine scheduling problem in which the objective is to minimize the mean absolute deviation of job completion times about a common due date. We present an algorithm for determining multiple optimal schedules under restrictive assumptions about the due date, and an implicit enumeration procedure when the assumptions do not hold. We also establish the similarity of this problem to the two parallel machines mean flow time problem.