Formalization and specification for controlling process modularity in mobile computing

新的计算模式，普适计算和全局计算，正在作为高度分布式和移动计算的计算模式展现出来。这篇论文探讨了在抽象层面上支持这些新型计算模式的适合的形式化基础，关注在进程移动单位上的控制, 以便在分布式与移动计算环境下更好地协调进程的移动性。 论文的第一部分概述了针对分布式、移动计算的现有进程演算模型中的进程移动单元，并且设计了一种在此方面更优、更具弹性的进程框架。为了表示这种进程框架，我们提出了一种新的、针对移动和分布式系统的进程演算,这种进程演算的优点是动态、弹性的控制进程的移动单元；具体的思路就是扩展π- calculus以及其支持分布式和移动性的变体。我们把这种新的演算叫做Modular π-calculus。我们通过这种演算的提出来说明进程框架提供了一种针对移动进程更为合适的协调机制以及编程模型，例如移动的代理和动态组件载入的支持。之后，我们通过讨论互模拟的几种提法来具体说明能够反映演算设计的进程描述的关键，之后我们讨论了它们的具体性质。 本文的第二部分提出了一个对进程模型的行为和性质进行推理的规约框架。首先，提出了一个对Modularπ-calculus中进程的系统性质进行规约的模态逻辑。为了更好的理解该逻辑，文中对由这个逻辑推出的进程等价的特征进行了研究，并且证明了该逻辑的区分能力介于互模拟和结构一致之间。接下来关于这个规约框架的自动化，本文针对该逻辑和Modular π-calculus的有限控制子集，提出了模型检测算法，并且给出了算法正确性的证明。同时文中贯穿了一些实际且直观的例子，以展现本文提出的一组框架即演算、逻辑和模型算法的有效性。

图形处理器通用计算的实现与验证

讨论了显示卡用于通用科学计算的问题,并以大型矩阵的基本运算问题详细比较了CPU和GPU计算之间的差别。在基本的矩阵运算中,运用适当的矩阵分块,GPU的计算速度比CPU快50倍左右。而且,显示卡低廉的价格为更多科研工作者实现大规模运算提供了可能。

algorithms for computing weak bisimulation equivalence

IEEE Comp Soc, IFIP, Tianjin Normal Univ

Atom space distance and computing of molecular similarity

A mathematical model on computation of molecular similarity was suggested, The algorithmic techniques for measuring the degree of similarity between pairs of three-dimensional chemical molecules was represented by modified interatomic distance matrices. Current work was carried out on Indigo 2 work station with Sybyl software. Four groups of molecules were used to compute the molecules similarity to testing the mathematical model with satisfactory results.

Intelligence in Scientific Computing

Combining numerical techniques with ideas from symbolic computation and with methods incorporating knowledge of science and mathematics leads to a new category of intelligent computational tools for scientists and engineers. These tools autonomously prepare simulation experiments from high-level specifications of physical models. For computationally intensive experiments, they automatically design special-purpose numerical engines optimized to perform the necessary computations. They actively monitor numerical and physical experiments. They interpret experimental data and formulate numerical results in qualitative terms. They enable their human users to control computational experiments in terms of high-level behavioral descriptions.

Intellectual Property in Computing: (How) Should Software Be Protected? An Industry Perspective

The future of the software industry is today being shaped in the courtroom. Most discussions of intellectual property to date, however, have been frames as debates about how the existing law --- promulgated long before the computer revolution --- should be applied to software. This memo is a transcript of a panel discussion on what forms of legal protection should apply to software to best serve both the industry and society in general. After addressing that question we can consider what laws would bring this about.

Partial Evaluation for Scientific Computing: The Supercomputer Toolkit Experience

We describe the key role played by partial evaluation in the Supercomputer Toolkit, a parallel computing system for scientific applications that effectively exploits the vast amount of parallelism exposed by partial evaluation. The Supercomputer Toolkit parallel processor and its associated partial evaluation-based compiler have been used extensively by scientists at M.I.T., and have made possible recent results in astrophysics showing that the motion of the planets in our solar system is chaotically unstable.

Computing Upper and Lower Bounds on Likelihoods in Intractable Networks

We present techniques for computing upper and lower bounds on the likelihoods of partial instantiations of variables in sigmoid and noisy-OR networks. The bounds determine confidence intervals for the desired likelihoods and become useful when the size of the network (or clique size) precludes exact computations. We illustrate the tightness of the obtained bounds by numerical experiments.

Activity Zones for Context-Aware Computing

Location is a primary cue in many context-aware computing systems, and is often represented as a global coordinate, room number, or Euclidean distance various landmarks. A user?s concept of location, however, is often defined in terms of regions in which common activities occur. We show how to partition a space into such regions based on patterns of observed user location and motion. These regions, which we call activity zones, represent regions of similar user activity, and can be used to trigger application actions, retrieve information based on previous context, and present information to users. We suggest that context-aware applications can benefit from a location representation learned from observing users. We describe an implementation of our system and present two example applications whose behavior is controlled by users? entry, exit, and presence in the zones.