基于B/S模式的网络辅助教学系统的研究与设计

介绍了基于BS模式的网络教学系统的硬件网络拓扑结构设计以及软件的总体结构设计，并对关键子系统的设计做了说明。     

ICAI软件生存周期模型初探

该文在分析智能型计算机辅助教学(ICAI)软件开发特点,总结现有软件生存周期模型优缺点的基础上,提出了一种适合于ICAI软件开发的智能模型。并将该模型应用于《GIS设计》课程的ICAI设计中。     

基于Web的CAGD计算机辅助教学系统

计算机辅助几何设计(CAGD)是一门理论联系实际、抽象思维与形象思维相结合的工程基础课程,同时具有很强的理论性和实践性,需要采用计算机辅助手段辅助教学,达到较理想的效果。该文提出了一个采用Java相关技术实现的基于Web的CAGD计算机辅助教学系统,系统具有分布性、实践性、人机交互性和综合性,可作为校内CAGD课程教学的辅助工具,也可用来进行远程教学。     

Completeness of the Accumulation Calculus

The accumulation calculs(AC for short)is an interval based temporal logic to specify and reason about hybrid real-time systems.This paper presents a formal proof system for AC,and proves that the system is complete relative to that of Interval Temporal Logic(ITL for short)on real domain.     

Knowledge-directed Adaptation in Multi-level Agents

Most work on adaptive agents have a simple, single layerarchitecture. However, most agent architectures support three levels ofknowledge and control: a reflex level for reactive responses, a deliberatelevel for goal-driven behavior, and a reflective layer for deliberateplanning and problem decomposition. In this paper we explore agentsimplemented in Soar that behave and learn at the deliberate and reflectivelevels. These levels enhance not only behavior, but also adaptation. Theagents use a combination of analytic and empirical learning, drawing from avariety of sources of knowledge to adapt to their environment. We hypothesize that complete, adaptive agents must be able to learn across all three levels.     

断层垂向封闭模式及研究方法

在深入研究断层垂向封闭机理的基础上，建立了断层垂向封闭的三种地质模式，并利用断层面压力、断移地层的砂泥比值和断层填充物与围岩声波时差的相对关系，分别研究了三种不同地质条件下的断层垂向封闭性。实例应用表明，这些方法用于研究断层垂向封闭性是可行的。     

Interval Routing Schemes

Interval routing was introduced to reduce the size of routing tables: a router finds the direction where to forward a message by determining which interval contains the destination address of the message, each interval being associated to one particular direction. This way of implementing a routing function is quite attractive but very little is known about the topological properties that must satisfy a network to support an interval routing function with particular constraints (shortest paths, limited number of intervals associated to each direction, etc.). In this paper we investigate the study of the interval routing functions. In particular, we characterize the set of networks which support a linear or a linear strict interval routing function with only one interval per direction. We also derive practical tools to measure the efficiency of an interval routing function (number of intervals, length of the paths, etc.), and we describe large classes of networks which support optimal (linear) interval routing functions. Finally, we derive the main properties satisfied by the popular networks used to interconnect processors in a distributed memory parallel computer. Received February 7, 1996; revised November 25, 1996.     

Finding hidden independent sets in interval graphs

We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied interval graph G) in which our goal is to discover an (unknown) independent set X by making the fewest queries of the form “Is point p covered by an interval in X?” Our interest in this problem stems from two applications: experimental gene discovery with PCR technology and the game of Battleship (in a 1-dimensional setting). We provide adaptive algorithms for both the verification scenario (given an independent set, is it X?) and the discovery scenario (find X without any information). Under some assumptions, these algorithms use an asymptotically optimal number of queries in every instance.     

一种基于免疫原理的入侵检测系统模型

自然免疫系统与计算机安全问题有很多相似性,两者主要工作都是如何区分“自我”与“非 我”。根据人工免疫的原理、体系结构,本文建立了一种新的基于人工免疫原理的网络入侵检测系统模型,以 改进现有网络入侵检测系统的性能,并详细给出了该模型在计算机中的具体实现、数学描述、系统结构。     

A least squares approach to principal component analysis for interval valued data

Principal Component Analysis (PCA) is a well-known technique, the aim of which is to synthesize huge amounts of numerical data by means of a low number of unobserved variables, called components. In this paper, an extension of PCA to deal with interval valued data is proposed. The method, called Midpoint Radius Principal Component Analysis (MR-PCA), recovers the underlying structure of interval valued data by using both the midpoints (or centers) and the radii (a measure of the interval width) information. In order to analyze how MR-PCA works, the results of a simulation study and two applications on chemical data are proposed.