交互式远程教学系统的设计与实现

随着网络化技术的发展,基于网络的远程教学活动及教学系统逐渐成为学校教育的有效辅助手段。本文从远程教学系统的需求出发、分析了系统的结构和各组成部分的功能。重点介绍了考试管理模块的功能,以及该模块中部分功能的实现。     

AGAPIA v0.1: A Programming Language for Interactive Systems and Its Typing System

A model (consisting of rv-systems), a core programming language (for developing rv-programs), several specification and analysis techniques appropriate for modeling, programming and reasoning about interactive computing systems have been recently introduced by Stefanescu using register machines and space-time duality, see [Stefanescu, G. Interactive systems with registers and voices. Fundamenta Informaticae 73 (2006), 285–306. (Early draft, School of Computing, National University of Singapore, July 2004.)]. After that, Dragoi and Stefanescu have developed structured programming techniques for rv-systems and their verification, see, e.g., [Dragoi, C., and G. Stefanescu. Structured programming for interactive rv-systems. Institute of Mathematics of the Romanian Academy, IMAR Preprint 9/2006, Bucharest 2006. Dragoi, C., and G. Stefanescu. Towards a Hoare-like logic for structured rv-programs. Institute of Mathematics of the Romanian Academy, IMAR Preprint 10/2006, Bucharest, 2006. Dragoi, C., and G. Stefanescu. Implementation and verification of ring termination detection protocols using structured rv-programs. Annals of University of Bucharest, Mathematics-Informatics Series, 55 (2006), 129–138. Dragoi, C., and G. Stefanescu. Structured interactive programs with registers and voices and their verification. Draft, Bucharest, January 2007. Dragoi, C., and G. Stefanescu. On compiling structured interactive programs with registers and voices. In: “Proc. SOFSEM 2008,” 259–270. LNCS 4910, Springer, 2008.].In the present paper a kernel programming language AGAPIA v0.1 for interactive systems is introduced. The language contains definitions for complex spatial and temporal data, arithmetic and boolean expressions, modules, and while-programming statements with their temporal, spatial, and spatio-temporal versions. In AGAPIA v0.1 one can write programs for open processes located at various sites and having their temporal windows of adequate reaction to the environment. The main technical part of the paper describes a typing system for AGAPIA v0.1 programs.     

基于路径空间层次划分的区域匹配算法

随着仿真应用在广度及深度上的发展,基于因特网的分布交互仿真成为未来的发展方向.其面临的主要挑战之一是系统可扩缩性问题.采用高效的数据过滤机制是解决问题的有效手段.首先讨论了分布交互仿真存在的可扩缩性问题,介绍了HLA(high level yarchitecture)框架下数据过滤机制的原理、实现及存在的问题.针对大规模系统过滤匹配计算量大的问题,提出了一种基于路径空间层次划分方法.该方法利用空间位置关系知识进行启发式搜索,从而排除大量不相关区域的匹配计算,有效地降低了过滤机制的计算复杂度.     

Educational virtual environments: design rationale and architecture

The use of collaborative virtual environments in e-learning is one of the most promising uses of virtual reality technology. While much research has been done in the area of networked virtual environments corresponding to the sharing of events, very little research has been done on specific services and functionality. However both the requirements and the kind of the offered services affect significantly the design of a system. In this paper we present the design and implementation of a platform suitable for educational virtual environments, which are collaborative virtual environments aiming at offering collaborative e-learning services to the users. Apart from the platform itself, we present the technological choices, and a new method for sharing virtual environments. Furthermore, we present an e-learning environment to support e-learning services using collaborative virtual environments from both the technical and functional point of view, along with the end-user evaluation results.

Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition

The need to perform fast and accurate proximity queries arises frequently in physically-based modeling, simulation, animation, real-time interaction within a virtual environment, and game dynamics. The set of proximity queries include intersection detection, tolerance verification, exact and approximate minimum distance computation, and (disjoint) contact determination. Specialized data structures and algorithms have often been designed to perform each type of query separately. We present a unified approach to perform any of these queries seamlessly for general, rigid polyhedral objects with boundary representations which are orientable 2-manifolds. The proposed method involves a hierarchical data structure built upon a surface decomposition of the models. Furthermore, the incremental query algorithm takes advantage of coherence between successive frames. It has been applied to complex benchmarks and compares very favorably with earlier algorithms and systems.     

A Unified Subdivision Scheme for Polygonal Modeling

Subdivision rules have traditionally been designed to generate smooth surfaces from polygonal meshes. In this paper we propose to employ subdivision rules as a polygonal modeling tool, specifically to add additional level of detail to meshes. However, existing subdivision schemes have several undesirable properties making them ill suited for polygonal modeling. In this paper we propose a general set of subdivision rules which provides users with more control over the subdivision process. Most existing subdivision schemes are special cases. In particular, we provide subdivision rules which blend approximating spline based schemes with interpolatory ones. Also, we generalize subdivision to allow any number of refinements to be performed in a single step.     

Valence-Driven Connectivity Encoding for 3D Meshes

In this paper, we propose a valence-driven, single-resolution encoding technique for lossless compression of triangle mesh connectivity. Building upon a valence-based approach pioneered by Touma and Gotsman²² , we design a new valence-driven conquest for arbitrary meshes that always guarantees smaller compression rates than the original method. Furthermore, we provide a novel theoretical entropy study of our technique, hinting the optimality of the valence-driven approach. Finally, we demonstrate the practical efficiency of this approach (in agreement with the theoretical prediction) on a series of test meshes, resulting in the lowest compression ratios published so far, for both irregular and regular meshes, small or large.     

Windows NT的安全问题

本文从ＷｉｎｄｏｗｓＮＴ的交式登录过程、Ｗｉｎ３２ＷｉｎＬｏｇｏｎ进程进行用户信息登录、管理员利用域用户管理器用户建立帐号及设置安全属性、设置用户权限、目录访问权限类型、文件系统和打印机的安全性能、设置访问许可权、ＮＴＦＳ目录级别权限、对服务器系统进行物理性能方面的设置、审计、设置登录标语、注册表面的安全性,安全保障的几个方面、ＷｉｎｄｏｗｓＮＴ中的缺陷等诸多方面讨论了ＷｉｎｄｏｗｓＮＴ的安全问题     

What holds in a context?

In order to establish that [A] = [B] follows from a set of assumptions often one provesA =B and then invokes the principle of substitution of equals for equals. It has been observed that in the ancillary proof ofA =B one is allowed to use, in addition to those assumptions of which are free for , certain (open) sentencesP which may not be part of and may not follow from , but are related to the context . We show that in an appropriate formal system there is a closed form solution to the problem of determining precisely what sentencesP can be used. We say that those sentenceshold in the context under the set of assumptions . We suggest how the solution could be exploited in an interactive theorem prover.     

Sisl: Several Interfaces, Single Logic

Modern interactive services such as information and e-commerce services are becoming increasingly more flexible in the types of user interfaces they support. These interfaces incorporate automatic speech recognition and natural language understanding and include graphical user interfaces on the desktop and web-based interfaces using applets and HTML forms. To what extent can the user interface software be decoupled from the service logic software (the code that defines the essential function of a service)? Decoupling of user interface from service logic directly impacts the flexibility of services, or how easy they are to modify and extend. To explore these issues, we have developed Sisl, an architecture and domain-specific language for designing and implementing interactive services with multiple user interfaces. A key principle underlying Sisl is that all user interfaces to a service share the same service logic. Sisl provides a clean separation between the service logic and the software for a variety of interfaces, including Java applets, HTML pages, speech-based natural language dialogue, and telephone-based voice access. Sisl uses an event-based model of services that allows service providers to support interchangeable user interfaces (or add new ones) to a single consistent source of service logic and data. As part of a collaboration between research and development, Sisl is being used to prototype a new generation of call processing services for a Lucent Technologies switching product.