Optimal task allocation in hypercube multiprocessor ensembles

Criteria are established to determine the optimal policy for allocating a set of uniform tasks onto a multiprocessor hypercube ensemble. It is shown that the optimal policy depends on the ratio of computation to intertask communication required by the distributed program, and that based on this ratio, tasks should be placed either all on one processor or uniformly distributed over the largest possible hypercube.     

对独立／依瓦自我构念与跨文化交际障碍成因研究的思考

文中将心理学所提出的自我构念理论融入到了跨文化交际障碍成因的研究中,通过对跨文化交际案例的分析说明自我构念的不同会对跨文化交际产生影响．若对自我构念缺乏正确认识和理解则会产生消极影响,易形成自我中心论和盲目崇拜论的误区,最终导致跨文化交际障碍,引发交际冲突．     

计算机与单片机的通信方式探讨

计算机通信是计算机的数据传输形式的一种,计算机通信的方式比较多,但是主要的传输方式比较固定。研究计算机通信,对于提高通信效率以及通信速度有着非常重要的意义。单片机是集成电路设计中的一种,单片机通信的研究意义在于能够更大程度上开发单片机的功能。本文从计算机的角度以及单片机的角度进行分析,探讨其不同的通信方式,为两者的通信形式进行探究。     

探析数据通信中的多路复用技术及其应用

现代社会科学技术飞速发展,各种技术之间相互依赖、相互促进.计算机和集成电路的出现为整个科技的发展提供了强有力的推进器,而大量计算机之间的交流需要依靠网络的连接,因此网络间的通信传输就显得尤为重要.本文就网络通信中的多路复用技术的主要方法及其应用领域作一简单的介绍.     

Bounded Consensus Algorithms for Multi‐Agent Systems in Directed Networks

In this paper, the consensus problem is investigated via bounded controls for the multi‐agent systems with or without communication. Based on the nested saturation method, the saturated control laws are designed to solve the consensus problem. Under the designed saturated control laws, the transient performance of the closed‐loop system can be improved by tuning the saturation level. First of all, asymptotical consensus algorithms with bounded control inputs are proposed for the multi‐agent systems with or without communication delays. Under these consensus algorithms, the states’ consensus can be achieved asymptotically. Then, based on a kind of novel nonlinear saturation functions, bounded finite‐time consensus algorithms are further developed. It is shown that the states’ consensus can be achieved in finite time. Finally, two examples are given to verify the efficiency of the proposed methods.     

Scheduling gain for frequency-selective Rayleigh-fading channels with application to self-organizing packet scheduling

This paper investigates packet scheduling in the context of Self-Optimizing Networks, and demonstrates how to improve coverage dynamically by adjusting the scheduling strategy. We focus on α-fair schedulers, and we provide methods for calculating the scheduling gain, including several closed form formulas. Scheduling gain is analyzed for different fading models, with a particular focus on the frequency-selective channel. We then propose a coverage-capacity self-optimization algorithm based on α-fair schedulers. A use case illustrates the implementation of the algorithm and simulation results show that important coverage gains are achieved at the expense of very little computing power.     

农业电子商务发展的现状与对策研究

该文在介绍国外农业电子商务发展的背案下,对我国农业电子商务发展的现状作了实例的分析和对策研究。     

Using online collaboration applications for group assignments: The interplay between design and human characteristics

In recent years, educators and students are increasingly employing online collaboration applications such as Google Docs™ and PBWorks™ for group projects and assignments. Yet, the effectiveness of these emerging technologies has not been rigorously examined. Anchoring upon and informed by the existing literature, two design characteristics – sociability and visibility, and two human characteristics – gender and age, are focused on, which are salient in online collaboration applications. A field experiment was conducted to examine the direct and moderating effects of design and human characteristics on learning outcomes. The research found that sociability improved process satisfaction and positive social environment while visibility enhanced academic performance and solution satisfaction of learners. Males had higher solution satisfaction while older learners had higher academic performance. Moderating effects were also found. Both theoretical and practical implications are drawn. In particular, a rubric for online collaboration application selection for academic performance is conceived. This study provides empirical support for online collaboration application effectiveness in education which will augur well for future adoption, use and evolution.     

Emotion understanding and performance during computer-supported collaboration

Individuals collaborating around and through computers benefit from receiving information that helps them understand one another, which is often termed awareness. This article explores what collaborators understand about each other’s emotions and the potential benefits for performance that might come from raising this understanding. In Experiment 1 co-located collaborators judged each other’s emotions after playing a game that required cooperative data collection and analysis. Their judgements were largely inaccurate and based on their own emotions, suggesting limited emotion understanding. Experiment 2 explored if this could be overcome by making collaborators aware of each other’s emotions. Co-located and remote collaborators played a cooperative puzzle-solving game under conditions of awareness or no awareness. Awareness was manipulated by making collaborators share their self-reported emotions during key moments of their game play. Both remote and co-located collaborators improved their performance after sharing their emotions. However, unlike co-located collaborators, remote collaborators also improved their understanding of each other’s emotions and experienced more positive affect. We conclude by discussing the content of collaborators’ emotion understanding and the probable mechanisms underlying the observed effects of being made aware of a partner’s emotions.