Performing permutations on interconnection networks by regularlychanging switch states

In this paper, we present an algorithm for performing permutations of messages on multistage interconnection networks. Permutations of messages are needed in many parallel algorithms. The proposed algorithm is feasible for any networks that can connect each input to each output using a set of N nonblocking connections, where N is the number of ports on the network. Messages are segmented into N submessages that are sent independently in each time step. For any permutation, the settings of switches are changed with fixed patterns. Partitioning of the network into independent subnetworks is also supported, each capable of simultaneously routing a different permutation     

Exploring quadrilaterals in a small group computing environment

Though cooperative learning has been a topic of considerable interest in educational research, there has been little study specific to learning in the mathematics content area of geometry. This paper seeks to address that gap through a design experiment featuring a novel small-group computing environment for supporting student learning about quadrilaterals. In this design, each student controls a unique point in a shared geometric space, and those points are linked such that a group of four students collectively forms a quadrilateral. We first present results from pre- and post-measures to show how the students learned from the activities and developed in terms of geometric reasoning. We then present three episodes, elaborated with the notion of appropriation, to explain how students took up ways of using the technological tools and of talking about geometric concepts from one another in the interactive environment. Our study found that students achieved learning gains in this novel environment, that the environment provided rich opportunities for peer interaction around geometric objects, and that student learning opportunities and interactions were characterized by processes of appropriating ways of talking about and using software features.     

Recovery of online service: Perceived justice and transaction frequency

Recovery of online service is an issue in need of study. The current study empirically examines (1) the relationships among perceived justice, satisfaction with recovery of online service and repurchase intention of online service/failure encounters; and (2) the moderating effects of transaction frequency on these relationships. The current study collects 187 self-administered questionnaires to gather customers’ perceptions of actual online service/failure encounters. Research findings demonstrate that distributive justice, interactional justice and procedural justice can positively lead to satisfaction with recovery of online service and repurchase intention toward online service. These results further show that customers with low transaction frequency tend to focus more on interactional justice to establish their satisfaction with recovery of online service. On the other hand, customers with high transaction frequency focus more on procedural justice.     

Extracting non-negative basis images using pixel dispersion penalty

Non-negativity matrix factorization (NMF) and its variants have been explored in the last decade and are still attractive due to its ability of extracting non-negative basis images. However, most existing NMF based methods are not ready for encoding higher-order data information. One reason is that they do not directly/explicitly model structured data information during learning, and therefore the extracted basis images may not completely describe the “parts” in an image [1] very well. In order to solve this problem, the structured sparse NMF has been recently proposed in order to learn structured basis images. It however depends on some special prior knowledge, i.e. one needs to exhaustively define a set of structured patterns in advance. In this paper, we wish to perform structured sparsity learning as automatically as possible. To that end, we propose a pixel dispersion penalty (PDP), which effectively describes the spatial dispersion of pixels in an image without using any manually predefined structured patterns as constraints. In PDP, we consider each part-based feature pattern of an image as a cluster of non-zero pixels; that is the non-zero pixels of a local pattern should be spatially close to each other. Furthermore, by incorporating the proposed PDP, we develop a spatial non-negative matrix factorization (Spatial NMF) and a spatial non-negative component analysis (Spatial NCA). In Spatial NCA, the non-negativity constraint is only imposed on basis images and such constraint on coefficients is released, so both subtractive and additive combinations of non-negative basis images are allowed for reconstructing any images. Extensive experiments are conducted to validate the effectiveness of the proposed pixel dispersion penalty. We also experimentally show that Spatial NCA is more flexible for extracting non-negative basis images and obtains better and more stable performance.     

Performance evaluation of enhancement of the layered self-scheduling approach for heterogeneous multicore cluster systems

Previously we have proposed a Layered Self-Scheduling (LSS) approach that is a hybrid MPI and OpenMP based loop self-scheduling approach for dealing with the heterogeneity problem on a cluster system consisting of multi-core compute nodes, where the allocation functions of several well-known schemes have been modified for better performance. Though LSS provides better performance than the conventional self-scheduling schemes, we found the performance can be improved further after our comprehensive experiments and analyses. The newly proposed task scheduling strategy, called Enhanced Layered Self-Scheduling (ELSS), aims at how to utilize the compute powers of multiple processor cores more efficiently in the master compute node and how to schedule tasks to have more stable performance improvements. We have evaluated the new task scheduling strategy by three benchmark applications: Matrix Multiplication, Monte Carlo Integration, and Mandelbrot Set Computation. It is recommended that the global scheduler adopts Guided Self-Scheduling (GSS) for all, and the local scheduler adopts the static scheme for applications with regular workload distribution but any scheme for applications with irregular workload distribution. Experimental results show the best speedups obtained by ELSS for the three benchmark programs are 1.373, 13.34 and 2.4, respectively, compared with that scheduled by LSS.     

用流延法制备优质陶瓷基片的研究

本文概括了流延成型工艺的现状，介绍了有机基流延成型工艺中溶剂及添加剂的作用和选择原则，同时介绍了几种新的流延成型工艺。     

Preparation and properties of mitochondria derived from synaptosomes

A method has been developed whereby a fraction of rat brain mitochondria (synaptic mitochondria) was isolated from synaptosomes. This brain mitochondrial fraction was compared with the fraction of "free" brain mitochondria (non-synaptic) isolated by the method of Clark & Nicklas (1970). (J. Biol. Chem. 245, 4724-4731). Both mitochondrial fractions are shown to be relatively pure, metabolically active and well coupled. 2. The oxidation of a number of substrates by synaptic and non-synaptic mitochondria was studied and compared. Of the substrates studied, pyruvate plus malate was oxidized most rapidly by both mitochondrial populations. However, the non-synaptic mitochondria oxidized glutamate plus malate almost twice as rapidly as the synaptic mitochondria. 3. The activities of certain tricarboxylic acid-cycle and related enzymes in synaptic and non-synaptic mitochondria were determined. Citrate synthase (EC 4.1.3.7), isocitrate dehydrogenase (EC 1.1.1.41) and malate dehydrogenase (EC 1.1.1.37) activities were similar in both fractions, but pyruvate dehydrogenase (EC 1.2.4.1) activity in non-synaptic mitochondria was higher than in synaptic mitochondria and glutamate dehydrogenase (EC 1.4.1.3) activity in non-synaptic mitochondria was lower than that in synaptic mitochondria. 4. Comparison of synaptic and non-synaptic mitochondria by rate-zonal separation confirmed the distinct identity of the two mitochondrial populations. The non-synaptic mitochondria had higher buoyant density and evidence was obtained to suggest that the synaptic mitochondria might be heterogeneous. 5. The results are also discussed in the light of the suggested connection between the heterogeneity of brain mitochondria and metabolic compartmentation.     

基于CAN总线的电子垃圾无害处理监控系统

介绍了一种基于CAN总线的电子垃圾无害处理监控系统,详细描述了系统的总体结构原理、硬件电路组成和软件的设计。该系统不仅能实时监测温度和湿度,而且还能监测粮食虫害的发生情况。     

星载遥感图像压缩系统容错技术研究

较强鲁棒性的压缩技术成为主流，压缩系统的容错性能变得越来越重要。本文分析了图像压缩中的几种常见容错技术，针对星载遥感图像的特点结合JPEG2000的相关容错技术，提出了适合硬件实现的容错方案。该方案采用Verilog语言设计并在FPGA上经过验证，最后应用在某型压缩平台上，效果良好。     

位置相关信息服务移动终端缓存替换研究

随着无线网络的快速发展,相应的无线应用服务越来越多,位置相关信息服务(LDISs)就是其中典型的例子。无线网络受信道带宽以及终端计算能力等因素的限制,缓存技术减少了网络开销并且支持在网络断接下使用数据的优点而成为研究热点。本文根据无线应用环境的特点,结合位置相关信息数据的特征,运用粗糙集(RoughSet,RS)这一强有力的数学工具,给出一种更加准确、实用的移动缓存替换策略。