The Problem of Estimating the Uncertainty of the Fixed Point Temperature Due to the Presence of Impurities

The main problems in estimating the uncertainty due to the presence of impurities in the material: the absence in the documents of a unique definition of the quantity being measured – the fixed point temperature, the lack of agreed methods of realizing the fixed points and the insufficient justification of the equations used for the estimate, are analyzed. The results of a measurement of the melting point of gallium are presented, which differ in the conditions in which they were realized – with one and two liquid-solid interfaces and different solidification conditions, are presented. The reasons for the considerable difference between the values of the temperatures obtained in these experiments are discussed.     

不甩线圈的多星形移相变极

对于某些槽数和极数比的多星形移相变极电机,提出与前人不同的是在两种极数下均不甩去线圈的绕组方案,使绕组利用率高,且线圈及其联接都较简单.这种绕组方案在一种极数下并联支路略有不平衡,其所引起的电机定子铜耗的增加是极其有限的,不致影响电机的正常运行.     

基于WebGIS的云南省旅游信息系统的模块设计及算法实现

将GIS与网络技术结合是把GIS推向社会化的有效途径。本着重讨论WebGIS在云南旅游信息系统中构建的原理、模块的组成、数据的组织、应用的算法及其主要功能的实现，同时在此系统中采用虚拟现实技术．使该系统更加完善和实用。     

Memory of Distributed Computer Systems: Distinctive Features of Their Architectural-Structural Organization and Use

Distinctive features of architectural-structural organization and use of memory networks are considered with the aim of choosing an optimal configuration in designing distributed computer systems.     

K-230B镗床万向护板的设计

介绍了大型机床地坑移动盖板的一般设计思想,根据机床原有功能和结构特点,设计兼顾防尘防屑和美观大方两大特点的活动盖板,为同类设计提供一些参考。     

Parallel associative combinator evaluation II

A new evaluation model for SK combinator expressions is presented and used as a basis for the design of a novel processor. The resulting machine architecture resembles a dataflow ring, but executions are constrained to be fully lazy. An automatic dynamic load sharing mechanism for a distributed multiprocessor architecture is suggested, and initial simulation results are presented.     

Signals,timers, and continuations for multithreaded user‐level protocols

Precise timing and asynchronous I/O are appealing features for many applications. Unix kernels provide such features on a per‐process basis, using signals to communicate asynchronous events to applications. Per‐process signals and timers are grossly inadequate for complex multithreaded applications that require per‐thread signals and timers that operate at finer granularity. To respond to this need, we present a scheme that integrates asynchronous (Unix) signals with user‐level threads, using the ARIADNE system as a platform. This is done with a view towards support for portable, multithreaded, and multiprotocol distributed applications, namely the CLAM (connectionless, lightweight, and multiway) communications library. In the same context, we propose the use of continuations as an efficient mechanism for reducing thread context‐switching and busy‐wait overheads in multithreaded protocols. Our proposal for integrating timers and signal‐handling mechanisms not only solves problems related to race conditions, but also offers an efficient and flexible interface for timing and signalling threads. Copyright © 2006 John Wiley & Sons, Ltd.     

Metaheuristic downhill simplex method in combinatorial optimization

The concept of combinatorial objects is formalized. It allows strict definition of a combinatorial optimization problem (COP). An efficient metaheuristic method to solve COPs (H-method) is considered. It includes stochastic local search algorithms as a built-in procedure. A parallel implementation of the H-method is set forth and analyzed. The results from a numerical experiment and solution of some well-known COPs on personal computers and on the SKIT cluster supercomputer are presented. The study was supported by INTAS (Project 06-1000017-8909). __________ Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 70–79, November–December 2007.     

A stability classification method and its application to pipelined solution of linear recurrences

A new method of classification for numerical stability of parallel algorithms is proposed based on the theoretical foundation of forward error analysis. It partitions the algorithms according to their asymptotic stability—a measure introduced to relate the limiting behavior of the stability to the size of the problem. Using this method, the stability aspect of the pipelined solution technique for first-order and second-order linear recurrences—the core of a tridiagonal linear equation solver—is studied. In particular, it shows that the pipelined solution method of the first-order linear recurrences has the same degree of stability as the commonly used sequential evaluation algorithms. The stability problems of sequential and pipelined solution methods of the second-order linear recurrences are also studied.     

Locality-preserving hash functions for general purpose parallel computation

Consider the problem of efficiently simulating the shared-memory parallel random access machine (PRAM) model on massively parallel architectures with physically distributed memory. To prevent network congestion and memory bank contention, it may be advantageous to hash the shared memory address space. The decision on whether or not to use hashing depends on (1) the communication latency in the network and (2) the locality of memory accesses in the algorithm.We relate this decision directly to algorithmic issues by studying the complexity of hashing in the Block PRAM model of Aggarwal, Chandra, and Snir, a shared-memory model of parallel computation which accounts for communication locality. For this model, we exhibit a universal family of hash functions having optimal locality. The complexity of applying these hash functions to the shared address space of the Block PRAM (i.e., by permuting data elements) is asymptotically equivalent to the complexity of performing a square matrix transpose, and this result is best possible for all pairwise independent universal hash families. These complexity bounds provide theoretical evidence that hashing and randomized routing need not destroy communication locality, addressing an open question of Valiant.This work was started when the author was a student at Oxford University, supported by a National Science Foundation Graduate Fellowship and a Rhodes Scholarship. Any opinions, findings, conclusions, or recommendations expressed in this publication are those of the author and do not necessarily reflect the views of the National Science Foundation or the Rhodes Trust.