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.     

基于GPRS的闸门监控系统设计

利用通用分组无线电业务(GPRS)通信技术、可编程逻辑控制器(PLC)和RS-485总线设计了稳定、经济的分布式闸门监控系统。该系统采用Internet/数字数据网(DDN)和GPRS Modem方式接入无线通信网络,并根据闸门监控系统的运行特点,采用GPRS实时通信与短信服务(SMS)通信相结合的方式,不仅保证了系统通信的稳定性和平衡性,且优化了系统的运行成本。最后,对基于GPRS的闸门监控系统的经济性和适用性进行了讨论。     

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.     

Tree-Based Concurrency Control in Distributed Groupware

We present a novel algorithm, called dARB, forsolving the concurrency control problem indistributed collaborative applications. Themain issue of concurrency control is resolvingthe conflicts resulting from simultaneousactions of multiple users. The algorithmreduces the need for manual conflict resolutionby using a distributed arbitration scheme. Themain advantages of our approach are thesimplicity of use and good responsiveness, asthere are no lock mechanisms. Our algorithmrequires the applications to use a tree as theinternal data structure. This makes itapplication independent and suitable forgeneral collaborative applications. The treerequirement is reasonable since many newapplications use XML (extensible MarkupLanguage) for data representation and exchange,and parsing XML documents results in treestructures. Example applications of thealgorithm, a group text editor and acollaborative 3D virtual environment calledcWorld, are implemented and evaluated in theDISCIPLE collaboration framework. We alsointroduce awareness widgets that users avoidgenerating the conflicting events and help inmanual conflict resolution.     

Centum-CS系统组态调试及维护

简要介绍了在洛阳石油化工总厂广泛使用的日本横河公司Centum—CS控制系统的组成，着重讨论了系统组态调试经验，以及日常维护和故障的分析判断处理。     

MHD simulation of high-current subsonic vacuum arc under different distributed axial magnetic fields

Based on two-temperature magnetic hydrodynamic (MHD) model, the influence of saddle-shaped distributed axial magnetic field (AMF, linearly increases along radial position) and bell-shaped distributed AMF (linearly decreases along radial position) on plasma loss and heat flux density to anode in subsonic high-current vacuum arc (HCVA) is simulated and analyzed. According to the simulation results, the saddle-shaped AMF can more effectively inhibit plasma loss from arc column than that of bell-shaped AMF. Comparisons between simulation results and experimental results further verify the correctness of model and simulation.     

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.     

网格计算及其应用

网络计算给互联网带来了新的活力，它是一种新型的分布计算技术，致力于解决复杂度很高的新应用问题，文中简述了网格计算的定义、体系结构、关键问题、当前几个有代表性的网格系统以及网格应用实例，并分析了风格计算发展趋势。     

基于RS485总线的面粉厂集散控制系统

概述了面粉厂的基本状况及技术要求，详细介绍了面粉厂控制系统的控制方案及设计方法。给出了基于RS485总线集散控制系统的硬件配置和软件设计。系统实际应用表明，该方法为实现低成本的网络控制系统提供了一个实例。