UNIX系统发展综述

本文首先分析ＵＮＩＸ的４个发展阶段以及各阶段取得成功的原因，然后在安全性，多处理机，实时处理，微内核，国际化和流机制等几个方面说明ＵＮＩＸ在技术上的发展近况，指出要解决的问题，最后说明了它面临的新挑战。     

基于PVM的并行Lisp机制与实现

本文提出了一种基于分布存储结构和消息传递平台的并行Ｌｉｓｐ语言，给出了Ｌｉｓｐ语言的并行机制，举例说明了并行Ｌｉｓｐ程序的设计方法，并用一个实际系统ＰＡＲＬｉｓｐ阐明了在ＰＶＭ上的主要实现方法，给出了性能测试结果。     

海洋石油开发工业污染物产生系数和排放系数研究

污染物产生系数和排放系数是工程环境影响评价的重要指标,但对于海洋石油开发工程环境影响评价来说,迄今尚无具权威性的系数可资使用。在我国近海石油开发工程污染源系统调查的基础上,对海洋石油开发行业污染物产生系数和排放系数的定义、计算方法、应用范围及应用方式进行了探讨,研究结果可为海洋石油开发工程项目环境影响评价及环境保护管理,以及行业或企业有关标准的制定提供参考。     

基于MATLAB的远程电机调速系统设计

详细介绍了利用MATLAB语言实现串行通信的原理和步骤,并给出了在MATLAB环境下实现远程电机调速的具体应用,实验结果表明该方案具有简单、实用、实时性能好,控制精度高等特点.     

Public grid computing participation: An exploratory study of determinants

Using the Internet, “public” computing grids can be assembled using “volunteered” PCs. To achieve this, volunteers download and install a software application capable of sensing periods of low local processor activity. During such times, this program on the local PC downloads and processes a subset of the project's data. At the completion of processing, the results are uploaded to the project and the cycle repeats.     

Minimum spanning trees made easier via multi-objective optimization

Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate the Pareto front, multi-objective optimization problems are considered as more difficult than single-objective problems. One should not forget that the fitness vector with respect to more than one objective contains more information that in principle can direct the search of evolutionary algorithms. Therefore, it is possible that a single-objective problem can be solved more efficiently via a generalized multi-objective model of the problem. That this is indeed the case is proved by investigating the computation of minimum spanning trees.This work was supported by the Deutsche Forschungsgemeinschaft (DFG) as part of the Collaborative Research Center Computational Intelligence (SFB 531) and by the German-Israeli Foundation (GIF) in the project Robustness Aspects of Algorithms.     

局域网语音实时传输的实现

语音实时传输是语音聊天软件的核心技术。文中在分析语音实时传输原理的前提下,探讨了局域网语音实时传输的设备的初始化、内存分配、语音录制、播放和传输等具体方法,并以C Builder6.0提供的控件为基础,以API函数给为工具,给出了局域网实时语音聊天的具体实例,实现了局域网用户间的语音实时传输。     

1D selection of 2D objects in head-worn displays

In current desktop user interfaces, selection is usually accomplished easily with a mouse or a similar two-dimensional locator. In wearable computing, however, controlling two dimensions simultaneously gets significantly harder: a change in one dimension results easily in an undesired change in the other dimension as well when the user is occupied with a parallel task – such as walking. We present a way to overcome this problem by applying one-dimensional selection for graphical user interfaces in head-worn displays. Our new interaction technique allows a wearable computer user to perform object selection tasks easily and accurately. The technique is based on a visible circle on the screen. The user controls the circle, altering its radius with a one-dimensional valuator. The midpoint of the circle is in the middle of the screen. The object currently on the perimeter of the circle is highlighted and can be selected. Our preliminary usability evaluation, applying our custom evaluation method designed especially for walking users, indicates that the proposed technique is usable also when walking.     

基于Client/Server模式的火电厂能损在线监测系统

为了对机组主要设备和系统的运行状态实施在线监测，使机组运行在最佳状态，提高机组的经济性，并加强对能耗指标的管理，而开发了能损在线监测、诊断和能耗指标管理系统，文章对此系统进行了简单的介绍。     

Proactive resource allocation for asynchronous real-time distributed systems in the presence of processor failures

We present two proactive resource allocation algorithms, RBA^*-FT and OBA-FT, for fault-tolerant asynchronous real-time distributed systems. The algorithms consider an application model where task timeliness is specified by Jensen's benefit functions and the anticipated application workload during future time intervals is described by adaptation functions. In addition, we assume that reliability functions of processors are available a priori. Given these models, our objective is to maximize aggregate task benefit and minimize aggregate missed deadline ratio in the presence of processor failures. Since determining the optimal solution is computationally intractable, the algorithms heuristically compute sub-optimal resource allocations, but in polynomial time. Experimental results reveal that RBA^*-FT and OBA-FT outperform their non-fault-tolerant counterparts in the presence of processor failures. Furthermore, RBA^*-FT performs better than OBA-FT, although OBA-FT incurs better worst-case and amortized computational costs. Finally, we observe that both algorithms robustly withstand errors in the estimation of anticipated failures.