激光外差探测中的全息技术

利用全息技术对本振光束进行调制以实现与信号光束的匹配，进而提高外差效率的原理及实施方法，介绍了作为调制器用的全息位相光栅的研制技术，为在外差探测系统中应用全息技术提供了依据。     

再入机动目标动力学方程及雷达测量方程的建立

在北天东雷达直角坐标系内建立了再入目标的动力学方程及雷达测量方程，目标机动特性采用－阶马尔科夫过程描述。根据给定的在目标直角坐标系中的再入机动目标的弹道数据形成了雷达模拟测量信息。以上工作为再入机动目标的跟踪与弹道预报奠定了基础。     

浅谈柔性制造系统的现状及实施

本文以美国所用柔性制造系统为例，以大量翔实的数据。阐述了柔性制造系统使用的现状及存在的问题，并针对这些问题提出相应的措施。     

计算机电信集成技术及其发展

本文介绍了计算机电信集成技术及其进展，特别详尽分析了它的三种实现形式：点对点形式、交换机－计算机形式、客户／服务器形式。     

ATM网络安全通信的研究

文中讨论了ＡＴＭ网络安全通信中的若干重要问题，包括数据加密，加密系统中信元丢失引起的重要同步以及密这理等若干方面。     

Simultaneous H control of a finite collection of linear plants with a single nonlinear digital controller

This paper considers the problem of simultaneous H^∞ control of a finite collection of linear time-invariant systems via a nonlinear digital output feedback controller. The main result is given in terms of the existence of suitable solutions to Riccati algebraic equations and a dynamic programming equation. Our main result shows that if the simultaneous H^∞ control problem for k linear time-invariant plants of orders n₁,n₂,…,n_k can be solved, then this problem can be solved via a nonlinear time-invariant controller of order nn₁+n₂++n_k.     

On periodic resource scheduling for continuous-media databases

The Enhanced Pay-Per-View (EPPV) model for providing continuous-media services associates with each continuous-media clip a display frequency that depends on the clip's popularity. The aim is to increase the number of clients that can be serviced concurrently beyond the capacity limitations of available resources, while guaranteeing a constraint on the response time. This is achieved by sharing periodic continuous-media streams among multiple clients. The EPPV model offers a number of advantages over other data-sharing schemes (e.g., batching), which make it more attractive to large-scale service providers. In this paper, we provide a comprehensive study of the resource-scheduling problems associated with supporting EPPV for continuous-media clips with (possibly) different display rates, frequencies, and lengths. Our main objective is to maximize the amount of disk bandwidth that is effectively scheduled under the given data layout and storage constraints. Our formulation gives rise to -hard combinatorial optimization problems that fall within the realm of hard real-time scheduling theory. Given the intractability of the problems, we propose novel heuristic solutions with polynomial-time complexity. We also present preliminary experimental results for the average case behavior of the proposed scheduling schemes and examine how they compare to each other under different workloads. A major contribution of our work is the introduction of a robust scheduling framework that, we believe, can provide solutions for a variety of realistic EPPV resource-scheduling scenarios, as well as any scheduling problem involving regular, periodic use of a shared resource. Based on this framework, we propose various interesting research directions for extending the results presented in this paper. Received June 9, 1998 / Accepted October 13, 1998     

Enhanced abstract data types in object-relational databases

The explosion in complex multimedia content makes it crucial for database systems to support such data efficiently. This paper argues that the “blackbox” ADTs used in current object-relational systems inhibit their performance, thereby limiting their use in emerging applications. Instead, the next generation of object-relational database systems should be based on enhanced abstract data type (E-ADT) technology. An (E-ADT) can expose the semantics of its methods to the database system, thereby permitting advanced query optimizations. Fundamental architectural changes are required to build a database system with E-ADTs; the added functionality should not compromise the modularity of data types and the extensibility of the type system. The implementation issues have been explored through the development of E-ADTs in Predator. Initial performance results demonstrate an order of magnitude in performance improvements. Received January 1, 1998 / Accepted May 27, 1998     

Adaptive polygonization of geometrically constrained surfaces

n -dimensional space, where n>3. This definition can be used for given surfaces that are implicit or parametric. This paper presents a robust, adaptive polygonization algorithm for evaluating and visualizing geometrically constrained surfaces. Let be the constrained surface, a 2-surface in n-space, and let π() be its projection into the subspace spanned by the first three coordinates. Our polygonization algorithm computes π(). The method works directly with the n-space representation, but performs all major computations in 3-space. Techniques for triangulation, polygon decimation, and local refinement are also presented.