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.     

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.     

网格计算及其应用

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

可编程光学二值双轨逻辑门

基于双轨逻辑,本文提出一种可级联的并行二值逻辑门。所有十六种二值逻辑运算可以采用偏振半波相延编程来实现。也提出了用电光晶体实现实时编程的方法。本文中给出了实验结果。     

客户机／服务器计算环境

本文介绍了客户机／服务器计算环境的基本概念和产生背景，阐述了客户机／服务器计算中操作系统的选择原则及企业级客户机／服务器计算环境的特点。     

中国爆破安全网

中国爆破安全网是由中国工程爆破协会主办的涉爆行业信息专业网 ,开通于 2 0 0 3年 4月。该网是民爆器材生产流通主管部门、使用部门和公安机关实施联网监控和规范化管理的有力工具 ,最主要的功能是为涉爆行业管理部门和从业单位提供一个功能完善的管理和办公平台。该网的开通 ,有利于民爆器材生产、销售、购买、使用流向监控制度的贯彻实行。文章介绍了网络的组成、建设原则 ,并给出了中国爆破安全网网络拓扑图     

Effects of shear flow on long-ranged correlations,spinodal demixing kinetics,and the location of the critical point and cloud point

A derivation of an expression for the shear rate-dependent Ornstein Zernike structure factor is discussed, together with the resulting anomalous behavior of the turbidity. The predicted scaling behavior of the turbidity, comprising the effect of both temperature and shear rate, is in good agreement with experiments on binary fluids. Then initial spinodal decomposition is discussed, and an explicit expression for the time- and shear rate-dependent effective diffusion coefficient is derived, which shows all the typical characteristics of anisotropic light scattering patterns that are observed experimentally for binary fluids. Next it is shown that the spinodal is shifted linearly with the (bare) Peclet number for not too large Peclet numbers, whereas the cloud point is singularly displaced into the unstable region due to a shear now. This is in agreement with an experiment on a two-polymer/solvent mixture and binary fluid mixtures. It is argued that light scattering is useless to determine the location of the spinodal of a sheared system.Paper presented at the Twelfth Symposium on Thermophysical Properties, June 19–24, 1994, Boulder, Colorado, U.S.A.     

Mesh‐independent p‐orthotropic enrichment using the generalized finite element method

This paper is aimed at presenting a simple yet effective procedure to implement a mesh‐independent p‐orthotropic enrichment in the generalized finite element method. The procedure is based on the observation that shape functions used in the GFEM can be constructed from polynomials defined in any co‐ordinate system regardless of the underlying mesh or type of element used. Numerical examples where the solution possesses boundary or internal layers are solved on coarse tetrahedral meshes with isotropic and the proposed p‐orthotropic enrichment. Copyright © 2002 John Wiley & Sons, Ltd.     

Interactive key frame selection model

Video summarization can provide a fine representation of the content of video stream and reduce a large amount of data involved in video indexing, browsing, and retrieval. Moreover, Key frame selection is an important step in the research of content-based video analysis and retrieval. Although there exist a variety of methods for key frame selection, they are heuristic and closed systems, which cannot dynamically generate video summary with user’s preference. In this paper, an M-estimator and epipolar line distance constraint camera motion estimation algorithm is introduced as camera parameters is an important motion feature for key frame selection, and Broyden-Fletcher-Goldfarb-Shanno (BFGS) method is applied to optimize estimated parameters. Moreover, since Interactive Computing is a novel-computing model that represents the transition of algorithm to interaction, an interactive model of key frame selection (IKFS) is presented as a result of improving the model of key frame selection (KFS). The model of KFS and IKFS are proved to satisfy the criterion of induction and coinduction, respectively. Experimental results show that the processing scheme generates flexible and desirable summarizations whose distortion rate is lower than current method. Above all, IKFS is an extension to KFS.     

Phase equilibria of quasi-binary systems consisting of multicomponent polymers 1 and 2. IV: Poly(ethylene oxide)/poly(propylene oxide) systems

To confirm the reliability of the theory of phase equibria of multicomponent polymer 1/multicomponent polymer 2 systems (i.e. quasi-binary systems) and the method of computer experiment based on this theory (Brit. Polym. J., 23 (1990)285; 23 (1990)299; Polym. Int., 29 (1992)219), could point curves (CPC), two-phase volume ratios ( R ) and critical solution points (CSP) have been determined experimentally for the quasi-binary mixtures of poly(ethylene oxide) (M¯_w = 647, M¯_w/M¯_n = 1.15; M¯_w and M¯_n, the weight-average and numberaverage molecular weights, respectively) and poly(propylene oxide) (M¯_w = 2028, M¯_w/M¯_n = 1.08; and M_w = 2987, M_w/M_n = 1.13). The hydroxyl end groups of both polymers were methoxylated in advance by the Cooper & Booth method (Polymer, 18 (1977)164). The thermodynamic interaction parameter between both polymers, χ₁₂, and the concentration dependence parameters for the above quasi-binary systems were determined by the method proposed in a previous paper (Brit. Polym. J., 23 (1990)299). CPC, R and CSP values calculated on the basis of the theory are in good agreement with the values determined experimentally.