浅谈PhotoshopCS背景分离技术

本文阐述了PhotoshopCS中几种工具和菜单命令的用法,并用图例重点展示了几种典型分离图例背景的方法。     

手握工具的美学研究

手握工具的美学研究是近年来现代设计技术研究的一个热点问题,手握工具中的优秀的美学设计产品在市场上也越来越多的涌现出来。但是,人们对于手握工具美学的真正含义并不是非常清晰。本文就手握工具的美学的含义和内容做了具体的分析,并把产品设计中的手握工具的美学思维同秩序设计思维、精致设计思维、细节设计思维、人性化设计思维相结合,对手握工具美学的含义进行了新的探索,通过对人机交互发展过程的简要总结,结合几个典型产品设计案例的深入研究和分析,揭示出了人机交互中手握工具的设计美学与产品的内在关系。     

台达PLC在液压码坯机电气控制中的应用

本文介绍了台达DVP—PLC—ES系列PLC在液压码坯机电气控制系统中的应用。使用PLC,不但成功代替了原继电器控制系统的控制和维护功能,而且还增加了节能功能,优化了系统,降低了人工维护成本,具有广阔的市场前景。     

程序理解

程序理解是从计算机程序中获取有关信息的过程。作为程序维护中必不可少的环节,一直受到大家的关注。结合最近比较熟门的软件重建工程,分析程序理解中出现的一些问题以及解决方案。     

数控仿形加工中心自动换刀的程序设计

数迭仿形加工中心具有高效的加工能力和超精密度的加工精度。本文从FIDIA数控系统的AUCOL2指令的性能特点出发,叙述了自动换刀系统的工艺流程序设计及换刀程序。     

Tool integration for flexible simulation of distributed algorithms

Over the last two decades, considerable research has been done in distributed operating systems, which can be attributed to faster processors and better communication technologies. A distributed operating system requires distributed algorithms to provide basic operating system functionality like mutual exclusion, deadlock detection, etc. A number of such algorithms have been proposed in the literature. Traditionally, these distributed algorithms have been presented in a theoretical way, with limited attempts to simulate actual working models. This paper discusses our experience in simulating distributed algorithms with the aid of some existing tools, including OPNET and Xplot. We discuss our efforts to define a basic model‐based framework for rapid simulation and visualization, and illustrate how we used this framework to evaluate some classic algorithms. We have also shown how the performance of different algorithms can be compared based on some collected statistics. To keep the focus of this paper on the approach itself, and our experience with tool integration, we only discuss some relatively simple models. Yet, the approach can be applied to more complex algorithm specifications. Copyright © 2001 John Wiley & Sons, Ltd.     

切削过程的虚拟现实系统

介绍虚拟现实的基本特性和系统构成,利用WTK、VC＋＋、OpenGL等软件设计了切削过程的虚拟现实系统,实现了车床的虚拟加工过程的仿真。     

UIMS的表示方法的研究

用户接口是任何交互式系统中至关重要的关键部件之一。它的开发已成为系统设计和实现中最为困难费时的“瓶颈“。用户接口管理系统ＵＩＭＳ接受了这一新的挑战,已成为人机交互和软件工程学科中的重要研究方向。本文将试图较全面地介绍和总结ＵＩＭＳ结构模型和表示方法等。     

Predicting dam failure risk for sustainable flood retention basins: A generic case study for the wider Greater Manchester area

This study aims to provide a rapid screening tool for assessment of sustainable flood retention basins (SFRBs) to predict corresponding dam failure risks. A rapid expert-based assessment method for dam failure of SFRB supported by an artificial neural network (ANN) model has been presented. Flood storage was assessed for 110 SFRB and the corresponding Dam Failure Risk was evaluated for all dams across the wider Greater Manchester study area. The results show that Dam Failure Risk can be estimated by using the variables Dam Height, Dam Length, Maximum Flood Water Volume, Flood Water Surface Area, Mean Annual Rainfall (based on Met Office data), Altitude, Catchment Size, Urban Catchment Proportion, Forest Catchment Proportion and Managed Maximum Flood Water Volume. A cross-validation R² value of 0.70 for the ANN model signifies that the tool is likely to predict variables well for new data sets. Traditionally, dams are considered safe because they have been built according to high technical standards. However, many dams that were constructed decades ago do not meet the current state-of-the-art dam design guidelines. Spatial distribution maps show that dam failure risks of SFRB located near cities are higher than those situated in rural locations. The proposed tool could be used as an early warning system in times of heavy rainfall.     

Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts

This paper deals with the two-dimensional bin packing problem with conflicts (BPC-2D). Given a finite set of rectangular items, an unlimited number of rectangular bins and a conflict graph, the goal is to find a conflict-free packing of the items minimizing the number of bins used. In this paper, we propose a new framework based on a tree-decomposition for solving this problem. It proceeds by decomposing a BPC-2D instance into subproblems to be solved independently. Applying this decomposition method is not straightforward, since merging partial solutions is hard. Several heuristic strategies are proposed to make an effective use of the decomposition. Computational experiments show the practical effectiveness of our approach.