A feasibility study of a direct-mapping parallel processing method to solve linear equations in load-flow calculation

With the growing size and complexity of power systems, system analysis—such as transients calculation—takes much time. Hence, fast calculation methods are required. Although parallel processing is a hopeful method, there have been difficulties in the parallel solution of linear equations which appear in power-flow calculations by the Newton-Raphson method. This paper aims at the fast calculation of the power-flow problem by means of parallel processing. In order to improve the suitability to the parallel solution of the differential equation in transients calculation, we assume the use of a direct-mapping parallel processing machine to map directly the network of a power system onto a network of processors. Under this assumption, we propose a new parallel-processing-oriented method in which the linear equation is solved by linear iterations between nodes with Aitken acceleration. We simulate the method on three model power systems and compare this Parallel Iterative Method (PIN) with a Parallel Direct Method (PDM) which uses the banded matrix according to the number of operations required. As a result, we can expect that PIM may solve linear equations faster than PDM with m processors, although the PIM might be inferior to the PDM with m × m processors, where m denotes the half-band width of the banded matrix.     

Satellite SAR Remote Sensing of Great Lakes Ice Cover,Part 2. Ice Classification and Mapping

During the 1997 winter season, shipborne polarimetric backscatter measurements of Great Lakes (freshwater) ice types using the Jet Propulsion Laboratory C-band scatterometer, together with surface-based ice physical characterization measurements and environmental parameters, were acquired concurrently with Earth Resource Satellite 2 (ERS-2) and RADARSAT Synthetic Aperture Radar (SAR) data. This polarimetric data set, composed of over 20 variations of different ice types measured at incident angles from 0° to 60° for all polarizations, was processed to radar cross-section to establish a library of signatures (look-up table) for different ice types. The library is used in the computer classification of calibrated satellite SAR data. Computer analysis of ERS-2 and RADARSAT ScanSAR images of Great Lakes ice cover using a supervised classification technique indicates that different ice types in the ice cover can be identified and mapped, and that wind speed and direction can have an influence on the classification of water as ice based on single frequency, single polarization data. Once satellite SAR data are classified into ice types, the ice map provides important and necessary input for environmental protection and management, ice control and ice breaking operations, and ice forecasting and modeling efforts.     

In-chain functionalization by alternating anionic copolymerization of styrene and 1-(4-dimethylaminophenyl)-1-phenylethylene

Anionic copolymerizations of styrene (M₁) with excess 1-(4-dimethyl-aminophenyl)-1-phenylethylene (M₂) were conducted in benzene at 25°C for 24h, using sec-butyllithium as initiator. Narrow molecular weight distribution copolymers with M?;_n = 16.1 × 10³ g/mol (M?_w/M?_n = 1.04) and 38.2 × 10³g/mol (M?_w/M?_n = 1.05), and 24 and 38 moles of M₂ per macromolecule, respectively, were characterized by size exclusion chromatography, ¹H NMR spectroscopy and DSC. The monomer reactivity ratio, r₁ = 5.6, was obtained from the copolymer composition at complete consumption of M₁, assuming that the rate constant k₂₂ =0,i.e. r₂ =0. The polymers exhibited T_g values of 128 and 119°C, respectively, which correspond to an estimated T_g = 217°C for the hypothetical homopolymer of M₂.     

On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks

This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.

A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system.     

化工搅拌器的参数优选

本文提出了确定化工用搅拌器搅拌时间的一种简单试验方法,并用正交表安排寻找最佳搅拌参数的试验和整理试验数据,得到了有实用价值的结果。     

PIRF-Nav 2.0: Fast and online incremental appearance-based loop-closure detection in an indoor environment

This paper presents a fast and online incremental solution for an appearance-based loop-closure detection problem in a dynamic indoor environment. Closing the loop in a dynamic environment has been an important topic in robotics for decades. Recently, PIRF-Nav has been reported as being successful in achieving high recall rate at precision 1. However, PIRF-Nav has three main disadvantages: (i) the computational expense of PIRF-Nav is beyond real-time, (ii) it utilizes a large amount of memory in the redundant process of keeping signatures of places, and (iii) it is ill-suited to an indoor environment. These factors hinder the use of PIRF-Nav in a general environment for long-term, high-speed mobile robotic applications. Therefore, this paper proposes two techniques: (i) new modified PIRF extraction that makes the system more suitable for an indoor environment and (ii) new dictionary management that can eliminate redundant searching and conserve memory consumption. The results show that our proposed method can complete tasks up to 12 times faster than PIRF-Nav with only a slight percentage decline in recall. In addition, we collected additional data from a university canteen crowded during lunch time. Even in this crowded indoor environment, our proposed method has better real-time processing performance compared with other methods.     

对DAG-MAP算法的研究

DAG－MAP是一个面向延迟优化的FPGA工艺映射算法,其中的标记过程是该算法的核心.文章对原算法中的标记过程进行了研究,并且提出了一个改进的标记方法.通过对MCNC标准测试电路的实验结果表明该算法比原算法更为有效,并且算法所用时间没有明显的增加.     

Combinatorial optimization under uncertainty

In this paper, the general problem of Euclidean combinatorial optimization under uncertainty is formulated for the first time and the concepts of a stochastic multiset, a multiset of fuzzy numbers, a stochastic Euclidean combinatorial set, and general Euclidean combinatorial set of fuzzy stochastic numbers that combines the properties of both types of uncertainty are introduced. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 35–44, September–October 2008.     

Sparse shape functions for tetrahedral <Emphasis Type="Italic">p</Emphasis>-FEM using integrated Jacobi polynomials

Summary In this paper, we investigate the discretization of an elliptic boundary value problem in 3D by means of the hp-version of the finite element method using a mesh of tetrahedrons. We present several bases based on integrated Jacobi polynomials in which the element stiffness matrix has nonzero entries, where p denotes the polynomial degree. The proof of the sparsity requires the assistance of computer algebra software. Several numerical experiments show the efficiency of the proposed bases for higher polynomial degrees p.      

光存储材料CaS∶Eu,Sm的正交实验制备及表征

CaS∶Eu,Sm材料在光存储、光探测领域具有广阔应用前景,但制备过程中影响其发光性能的因素较多,彼此又有交互作用,不易获得最佳工艺参数。本文采用高温固相反应法,通过正交实验设计系统研究了灼烧温度、灼烧时间、稀土掺杂浓度、助溶剂用量对CaS：Eu,Sm发光性能影响的主次关系,经正交分析和验证实验确定了最佳工艺参数应为：Eu∶Sm∶Ca mol%=0.3∶0.3∶99.4%,1100℃灼烧0.5h,助熔剂LiF用量为7%。采用X射线粉末衍射仪、荧光分光光度计（耦合1064nm激光激励源）对样品的物相及发光性能进行了测试与表征。