A paradigm for active decision support

Active decision support is concerned with developing advanced forms of decision support where the support tools are capable of actively participating in the decision making process, and decisions are made by fruitful callaboration between the human and the machine. It is currently an active and leading area of research within the field of decision support systems. The objective of this paper is to share the details of our research in this area. We present our overall research strategy for exploring advanced forms of decision support and discuss in detail our research prototype called JANUS that implements our ideas. We establish the contributions of our work and discuss our experiences and plans for future.     

Designing emotional, metaphoric, natural and intuitive interfaces for interactive art, edutainment and mobile communications

We are artists working since 1991 on the creation of interactive computer installations for which we design metaphoric, emotional, natural, intuitive and multi-modal interfaces. The interactive experiences we create are situated between art, design, entertainment and edutainment. When creating our interactive systems we often develop novel interface technologies that match conceptual and metaphoric content with technically novel interface solutions. While our main focus is to design interactive systems for the art context, our interactive or immersive systems also often find use in edutainment and in mobile communications areas. The following article summarizes some of our key concepts for our interface designs and presents some of our interactive technologies in more detail.     

Stabilization of Time‐Varying and Disturbed Complex Dynamical Networks with Different‐Dimensional Nodes and Uncertain Nonlinearities

This paper investigates the stabilization problem for time‐varying and disturbed complex dynamical networks (CDNs) with different‐dimensional nodes and uncertain nonlinearities. To be consistent with the properties of real‐world networks, both the disturbances of our networks and the nonlinear structures of the nodes permit are completely unknown but bounded. Furthermore, the norm bounds of the uncertain nonlinearities and disturbances (NBUND) are applied to design the stabilization controllers. When the NBUND are known in advance, some decentralized state feedback controllers are proposed to stabilize our networks. And when they are unknown, adaptive decentralized stabilization schemes are brought forward for our network models. The effectiveness and feasibility of our theoretical results are verified by two simulation examples.     

Adaptive Control based on Extended Neural Network for SISO Uncertain Nonlinear Systems

This paper proposes a novel adaptive control criterion for a class of single-input-single-output (SISO) uncertain nonlinear systems by using extended neural networks (ENNs). Distinguished from the traditional neural networks, our ENNs are composed of radial basis function neural networks (RBFNNs), scalers and saturators. And these ENNs are used to approximate the uncertainties in the nonlinear systems. Based on the Lyapunov stability theory and our ENNs, an adaptive control scheme is designed to guarantee that all the signals in the closed-loop system are uniformly ultimately bounded (UUB). It is also worth pointing out that our control method makes the construction of RBFNNs and the design of adaptive laws separated, which means only the outputs of ENNs and one update law of the parameter in the scaler are to be adjusted. Thus, our control scheme can effectively reduce the online computation burden of the adaptive parameters. Finally, simulation examples are given to verify the effectiveness of our theoretical result.     

Is Governance

ATRANSFORMATION TOWARDS plurality has begun in the do-main called Information Servic-es. Many of our corporations already have an international work-force. Many of our data centers al-ready have diffuse architectures based upon Open Source and shared resources. Many of our engineering depart-ments are addressing globalization/ localization at the library and metada-ta levels. Even some of our user inter-face specialists are addressing the realization that their prime “user” may not speak English.     

以“批判的地域主义”拯救我们的建筑设计

面对“全球文化趋同”的蛊惑,我们的建筑设计师或直接缴械投降,或以“地域主义”苦苦支撑,中国的建筑个性正在走向两个极端:一是盲目的推行“国际主义”,放任内心深处的传统价值观的深刻堕落;一方面以非理性的“机械性地域主义”来抵御“文化趋同”的侵袭,大量制造“假古董”,假装我们的传统文化依然根深叶茂。然而不论是哪一种倾向,都不能改变我们的建筑设计正经历着民族性格的沦丧。“批判的地域主业”给我们提出了解决问题的新的思路。     

我们需要怎样的设计

社会对民众的不诚实;设计者对社会对消费者的不诚实;设计者对自己的不诚实。这三个层面的不诚实,决定了我们要考虑的绝对是"我们的设计在哪里",而不是"我们需要怎样的设计"。     

对我国信息系统认证与认可过程的探讨

该文首先简要介绍了美国的信息系统认证与认可过程和我国现阶段的信息系统测评认证的现状。通过我国与美国的信息系统认证与认可过程的比较,分析了我国现阶段信息系统测评认证过程特点,并对今后信息系统测评认证的发展给出了相关建议。     

Response to "Comments on 'Formal methods application: an empirical tale of software development"'

We respond to criticism by D. Berry and W. Tichy of our paper that appeared in the March 2002 issue of IEEE Transactions on Software Engineering. Many of the supposed faults they identify in our experiment are a result of a misunderstanding on their part, while others are inherent aspects of an educational experiment. We present counterarguments that explain why our experiment is valid.     

半导体感应加热电源

分析了我国传统感应加热电源存在的问题，说明加热电源半导体化是其发展目标，阐述国内为实现这一目标所做的工作及其展望。     

Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results

This paper summarizes the main existing approaches to propagate resource constraints in Constraint-Based scheduling and identifies some of their limitations for using them in an integrated planning and scheduling framework. We then describe two new algorithms to propagate resource constraints on discrete resources and reservoirs. Unlike most of the classical work in scheduling, our algorithms focus on the precedence relations between activities rather than on their absolute position in time. They are efficient even when the set of activities is not completely defined and when the time window of activities is large. These features explain why our algorithms are particularly suited for integrated planning and scheduling approaches. All our algorithms are illustrated with examples. Encouraging preliminary results are reported on pure scheduling problems as well as some possible extensions of our framework.     

Scheduling DAG's for asynchronous multiprocessor execution

A new approach is given for scheduling a sequential instruction stream for execution “in parallel” on asynchronous multiprocessors. The key idea in our approach is to exploit the fine grained parallelism present in the instruction stream. In this context, schedules are constructed by a careful balancing of execution and communication costs at the level of individual instructions, and their data dependencies. Three methods are used to evaluate our approach. First, several existing methods are extended to the fine grained situation. Our approach is then compared to these methods using both static schedule length analyses, and simulated executions of the scheduled code. In each instance, our method is found to provide significantly shorter schedules. Second, by varying parameters such as the speed of the instruction set, and the speed/parallelism in the interconnection structure, simulation techniques are used to examine the effects of various architectural considerations on the executions of the schedules. These results show that our approach provides significant speedups in a wide-range of situations. Third, schedules produced by our approach are executed on a two-processor Data General shared memory multiprocessor system. These experiments show that there is a strong correlation between our simulation results, and these actual executions, and thereby serve to validate the simulation studies. Together, our results establish that fine grained parallelism can be exploited in a substantial manner when scheduling a sequential instruction stream for execution “in parallel” on asynchronous multiprocessors     

An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness

In this communication, we strive to apply a novel simulated annealing to consider scheduling hybrid flowshop problems to minimize both total completion time and total tardiness. To narrow the gap between the theory and the practice of the hybrid flowshop scheduling, we integrate two realistic and practical assumptions which are sequence-dependent setup and transportation times into our problem. We apply a metaheuristic based on simulated annealing (SA) which strikes a compromise between intensification and diversification mechanisms to augment the competitive performance of our proposed SA. A comprehensive calibration of different parameters and operators are done. We employ Taguchi method to select the optimum parameters with the least possible number of experiments. For the purpose of performance evaluation of our proposed algorithm, we generate a benchmark against which the adaptations of high performing algorithms in the literature are brought into comparison. Moreover, we investigate the impacts of increase of number of jobs on the performance of our algorithm. The efficiency and effectiveness of our hybrid simulated annealing are inferred from all the computational results obtained in various situations.     

论数字时代下我国高校的“数字化”教学模式

随着数字时代的到来,我国高校传统的教学模式也得到了数字化的改变与发展。但是我国目前的数字化教学模式还没有达到一种成熟的状态,仍然存在各种问题。我门必须充分发挥数字网络和数字媒体的技术优势,正确处理好教师、学生、课程内容和数字化教学手段的关系,才能改善我国目前的数字化教学模式,优化教学效果。     

On 3D input devices

We provide an overview of some of our input device developments, which we designed in response to the need for more advanced 3D interfaces. Some of our devices are more task-specific and others are more general, but all of them support six or more degrees of freedom (DOF) and work in three dimensions. In our work, we try to understand the essential requirements of individual tasks and task combinations to develop corresponding devices and interaction techniques. This is our way of developing input devices for the 3D domain that work better for certain application areas than 2D mouses, gloves, and wands.     

关于建模与仿真VV&A原则的研究

通过借鉴国内外在该领域的研究成果 ,提出了建模与仿真VV&A原则。该文在国内首次对建模与仿真VV&A原则进行了详细的论述。     

New paradigm,new market and new theatre in ergonomics

Change is the only constant in today's technology-driven world. As industry moves towards an unprecedented revolution, the momentum and impact of the change are both rapid and profound. This will affect our profession drastically. We will need to redefine our goals and strategies to cope with these new challenges. In this paper, a new paradigm of thinking, a new market for our discipline and a new theatre of ergonomics in the future are proposed and explained.     

IPV6技术在数字化校园建设中安全防范研究

随着校园网的日益发展,IPv6网络在我国数字化校园网中广泛部署,其安全问题也日益突出。基于我院数字化校园网庞大的实验环境,该文从分析IPV6数字化校园网的安全特点入手,对IPV6技术在我院数字化校园建设中体现的安全问题进行了分析,阐述了保证IPv6对解决我院数字化校园网安全实现的一些策略。     

Rigorous Learning Curve Bounds from Statistical Mechanics

In this paper we introduce and investigate a mathematically rigorous theory of learning curves that is based on ideas from statistical mechanics. The advantage of our theory over the well-established Vapnik-Chervonenkis theory is that our bounds can be considerably tighter in many cases, and are also more reflective of the true behavior of learning curves. This behavior can often exhibit dramatic properties such as phase transitions, as well as power law asymptotics not explained by the VC theory. The disadvantages of our theory are that its application requires knowledge of the input distribution, and it is limited so far to finite cardinality function classes.We illustrate our results with many concrete examples of learning curve bounds derived from our theory.     

THE CATEGORY THEORY OF TIME SYSTEMS

In this paper we show a categorical treatment of general time systems using the categorization method presented in our previous paper. Various concepts about general time systems are categorized in the unified framework. Some category theoretical tools for the investigation of such time systems are presented. Using those tools some basic properties of time systems are explored in our framework. In particular, a conceptual equivalence between the causality and the state space representability is proved in the categorical terms. These results show that our method can be a universal tool for a categorization and a categorical treatment of mathematically defined general systems.