用单片机驱动线阵CCD的探讨

本文就弥补以往用单片机产生线阵 CCD驱动时序的不足进行了探讨 ;给出了使用 AVR单片机产生驱动TCD12 0 6线阵 CCD的具体实例及相应程序。其定时关系精确 ,驱动频率达到推荐的速率     

双重并行环境下最短路径的研究

并行问题和最短路径问题已成为一个热点研究课题,传统的最短路径算法已不能满足数据爆炸式增长的处理需求,尤其当网络规模很大时,所需的计算时间和存储空间也大大的增加;MapReduce模型的出现,带来了一种新的解决方法来解决最短路径;GPU具有强大的并行计算能力和存储带宽,与CPU相比具有明显的优势;通过研究MapReduce模型和GPU执行过程的分析,指出单独基于MapReduce模型的最短路径并行方法存在的问题,降低了系统的性能;论文的创新点是结合MapReduce和GPU形成双并行模型,并行预处理数据,针对最短路径中的数据传输和同步开销,增加数据动态处理器;最后实验从并行算法的性能评价指标平均加速比进行比较,结果表明,双重并行环境下的最短路径的计算,提高了加速比。     

Overview of hybrid optical neural networks

This paper reviews optical architectures for the implementation of hybrid neural networks. Optics is mainly applied to implementing the matrix-vector or tensor-matrix multiplication. In addition, the general background of neural networks as well as a brief discussion on holographic associative memory are also given.     

Sojourn Times in the <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">PH</Emphasis>/1 Processor Sharing Queue

We give in this paper an algorithm to compute the sojourn time distribution in the processor sharing, single server queue with Poisson arrivals and phase type distributed service times. In a first step, we establish the differential system governing the conditional sojourn times probability distributions in this queue, given the number of customers in the different phases of the PH distribution at the arrival instant of a customer. This differential system is then solved by using a uniformization procedure and an exponential of matrix. The proposed algorithm precisely consists of computing this exponential with a controlled accuracy. This algorithm is then used in practical cases to investigate the impact of the variability of service times on sojourn times and the validity of the so-called reduced service rate (RSR) approximation, when service times in the different phases are highly dissymmetrical. For two-stage PH distributions, we give conjectures on the limiting behavior in terms of an M/M/1 PS queue and provide numerical illustrative examples.This revised version was published online in June 2005 with corrected coverdate     

The Buffer-Bandwidth Trade-off Curve is Convex

To achieve a constant overflow probability, the two queueing resources, viz. buffer and bandwidth, can be traded off. In this paper we prove that, under general circumstances, the corresponding trade-off curve is convex in the 'many-sources scaling'. This convexity enables optimal resource partitioning in a queueing system supporting heterogeneous traffic, with heterogeneous quality-of-service requirements.     

Large deviations and the generalized processor sharing scheduling for a multiple-queue system

We establish asymptotic upper and lower bounds on the asymptotic decay rate of per-session queue length tail distributions for a multiple-queue system where a single constant rate server services the queues using the generalized processor sharing (GPS) scheduling discipline. In the special case where there are only two queues, the upper and lower bounds match, yielding the optimal bound proved in [15]. The dynamics of bandwidth sharing of a multiple-queue GPS system is captured using the notion of partial feasible sets, and the bounds are obtained using the sample-path large deviation principle. The results have implications in call admission control for high-speed communication networks. This revised version was published online in June 2006 with corrections to the Cover Date.     

A decomposition theorem and related results for the discriminatory processor sharing queue

In this paper, we study a discriminatory processor sharing queue with Poisson arrivals,K classes and general service times. For this queue, we prove a decomposition theorem for the conditional sojourn time of a tagged customer given the service times and class affiliations of the customers present in the system when the tagged customer arrives. We show that this conditional sojourn time can be decomposed inton+1 components if there aren customers present when the tagged customer arrives. Further, we show that thesen+1 components can be obtained as a solution of a system of non-linear integral equations. These results generalize known results about theM/G/1 egalitarian processor sharing queue.     

Who should be given priority in a queue?

We consider a memoryless single server queue with two classes of customers, each having its fixed entry fee. We show that profit and social welfare may benefit from a service discipline based on relative priorities.     

Fuzzy modelling environment for designing fuzzy controllers

Fuzzy control algorithms are developed based on fuzzy models of systems. The control issues are posed as multiobjective optimization problems involving goals and constraints imposed on system's variables. Two basic design modes embrace on- and off-line modes of control development. The first type of design deals with the time and state-dependent objectives and pertains to control determination based upon the current state of the fuzzy model. The second design mode gives rise to an explicit form of a fuzzy controller that is learned based on a given list of state-control associations. Both the fuzzy models as well as fuzzy controllers are realized as logic processors.     

The applicability matrix of a syntax-directed parsing processor

Some bottom-up syntax-directed parsing processors use a rectangular Boolean matrix called an applicability matrix to determine which rules might be used in the syntax analysis of an input string of terminal (basic) characters of a given language. By constructing a graph derived from the rules of a language specified in Backus Normal Form, and imposing a partial order on the vertices of this graph, it is shown in this paper that the applicability matrix may be partitioned into 2 submatrices, one of which is rectangular, and the other uppertriangular.