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.     

QoS Negotiation and Renegotiation Based on Mobile Agents

As the Quality of Service （QoS） becomes increasingly important in the Internet development, there are more and more researches focusing on the issues of QoS negotiation. Mobile software agents represent a valid alternative to the implementation of strategies for the negotiation. In this paper, a QoS negotiation and renegotiation system architecture based on mobile agents is proposed. These agents perform the task in the whole process and therefore reduce the network load, overcome latency, and avoid frequent exchange information between clients and server. The simulation results show that it can improve the network resource utility about 10%.     

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.     

美孚油回收利用的可行性实验研究

本文针对美孚油回收液与兰炼8#油混合利用进行可行性实验研究，经过重度、粘度、可燃性等方面的实验研究，表明美孚油回收液与兰炼8#油混合可以用在电动轮上并且获得良好的效果。     

网格计算及其应用

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

基于质粒的DNA计算模型研究

论文给出了一种基于环状质粒DNA计算的新方法,这种计算质粒包含一个特殊的插入DNA序列片断,每个片断定位在匹配的限制性内切位点,通过剪切和粘贴实现计算过程。论文同时给出了生物计算模型和相关的数学描述,这种模式的计算有待进一步研究。     

移动IP的分层管理及在CDMA中的实现技术

介绍了移动IP技术 ,指出了传统移动IP技术在无线通信网中的不足 ,接着论述了分层管理的思想。通过对移动IP扩展协议HAWAII的分析 ,最后提出了把HAWAII用于CDMA中进行分层管理的架构     

网格技术在广播电视中的应用

网格是继Internet和Web技术之后的第三个信息技术浪潮。简述了网格的定义、特点和基本体系结构 ,并且分析了网格技术在广播电视中的应用     

Trust for Ubiquitous,Transparent Collaboration

In this paper, trust-based recommendations control the exchange of personal information between handheld computers. Combined with explicit risk analysis, this enables unobtrusive information exchange, while limiting access to confidential information. The same model can be applied to a wide range of mobile computing tasks, such as managing personal address books and electronic diaries, to automatically provide an appropriate level of security. Recommendations add structure to the information, by associating categories with data and with each other, with degrees of trust belief and disbelief. Since categories also in turn confer privileges and restrict actions, they are analogous to rôles in a Rôle-Based Access Control system, while principals represent their trust policies in recommendations. Participants first compute their trust in information, by combining their own trust assumptions with others' policies. Recommendations are thus linked together to compute a considered, local trust assessment. Actions are then moderated by a risk assessment, which weighs up costs and benefits, including the cost of the user's time, before deciding whether to allow or forbid the information exchange, or ask for help. By unifying trust assessments and access control, participants can take calculated risks to automatically yet safely share their personal information.