一种新型的加固计算机箱设计

介绍了一种新型加固计算机机箱,其独特的双层箱体结构,使它适合在各种复杂恶劣的环境条件下使用。通过设计实践,阐述了该箱体的结构特点和密封、隔振缓冲、电磁兼容等方面的具体解决方法,特别是箱体成型和综合热设计等关键技术。经环境试验和工程实际应用的检验,证明其具有较好的综合防护性能。     

创意——产品造型设计的灵魂

随着计算机在各个领域中的普遍应用,产品设计创意中平面表达和立体表达的基础训练慢慢地在设计中被忽略淡化,使不少设计者和在校的学生放松了对平面表达和立体表达基础的学习和研究应用。不少人在学习和实践时,时常遇到有好的创意、好的想法、好的构思却表达不清楚的现象存在。所以产品设计创意中"两个表达(平面表达、立体表达)"依然发挥着不可替代的重要作用,它是集艺术与科学技术为一体的综合性学科,是产品设计的"精髓和灵魂"所在。     

无锡惠山泥人的造型特征研究

无锡惠山泥人历史悠久,造型优美传神,是我国民间工艺的精粹。论文通过对无锡惠山泥人的造型特征进行分析,总结出其造型、色彩、及构图上的规律,以此为实例分析推动传统工艺文化的保护和发展。     

自适应半监督边界费舍尔分析

基于图的半监督算法已经成功地应用于人脸识别中,算法不仅考虑带标签数据而且利用一致性的假设。传统的算法一致性约束是定义在原特征空间中,但是在原特征空间中定义的一致性不是最好的。提出了自适应半监督边界费舍尔分析算法,它将一致性约束定义在原特征空间和期望低维特征空间中。在CMU PIE和YALE-B数据库上进行了实验,结果表明自适应半监督边界费舍尔分析算法在人脸识别率上有显著的提高。     

The Philosophy of Critical Realism—An Opportunity for Information Systems Research

It is argued that recent research in the information systems field has tended to either emphasise the structural/collective dimension or the agency/individual dimension, not both. Structuration theory is a more recent attempt to address both agency and structure, however there are a number of issues with the use of structuration theory in information systems research, not the least of which is its lack of recognition of the temporal and longitudinal nature of information systems development. A relatively new philosophy, critical realism, provides the potential for a new approach to social investigations in its provision of an ontology for the analytical separation of structure and agency. The philosophy is introduced and its implications for sociological investigation are discussed.     

数据库应用程序执行过程抽象

本文对数据库应用的执行流程进行了一个抽象,指出数据库应用流程通常都具有的几个步骤,从而使数据库应用程序的开发过程中可以更加有效的进行设计和实现。     

Re-engineering of the design process for concurrent engineering

According to the requirements of concurrent engineering, three interdependency relationships (uncoupled relationship, coupled relationship and decoupled relationship) between design activities are presented in this paper. And the coupled relationship plays an important role in concurrent product design process. To represent the precedence relationships among design activities, a directed graph is used to describe the design process. And the interdependency relationship between activities is illustrated by a Design Structure Matrix which is the transpose of the accessibility matrix of the corresponding graph. Using the DSM, an algorithm of recognizing the coupled activities during the design process is presented. Moreover, an algorithm to figure out the order levels of activities during the design process is proposed. And both algorithms are illustrated with a die design example.     

一种复杂非线性系统的智能变结构控制方法

采用一种智能结构方法实现复杂非线性系统的控制,给出了设计原则,并用第四代歼击机飞行控制系统设计一个复杂实例来说明方法的有效性,实例系统中包含了两种控制律：增益调参和非线性动态逆控制律,两种控制律都包括了对发动机推力矢量喷管的控制。文中采用了一种基于状态的控制律切换算法进行两类控制律的切换,考虑了变结构系统切换瞬态问题和强迫振荡问题,并给出了简便的解决方法。     

A Review of the Application of Meta-Heuristic Algorithms to 2D Strip Packing Problems

This paper is a review of the approachesdeveloped to solve 2D packing problems withmeta-heuristic algorithms. As packing tasks arecombinatorial problems with very large searchspaces, the recent literature encourages theuse of meta-heuristic search methods, inparticular genetic algorithms. The objective ofthis paper is to present and categorise thesolution approaches in the literature for 2Dregular and irregular strip packing problems.The focus is hereby on the analysis of themethods involving genetic algorithms. Anoverview of the methods applying othermeta-heuristic algorithms including simulatedannealing, tabu search, and artificial neuralnetworks is also given.     

An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains

We describe an efficient parallel algorithm for hidden-surface removal for terrain maps. The algorithm runs in O(log ⁴ n) steps on the CREW PRAM model with a work bound of O((n+k) \polylog ( n)) where n and k are the input and output sizes, respectively. In order to achieve the work bound we use a number of techniques, among which our use of persistent data structures is somewhat novel in the context of parallel algorithms. Received July 29, 1998; revised October 5, 1999.