风洞试验过程故障智能容错控制

本文以某型风洞为监测对象，着重介绍了风洞试验过程故障智能容错控制系统的基本配置、原理和方法，同时对诊断标准的确定、容错功能的实现等进行了分析和讨论。     

风洞试验过程故障智能容错控制

本文以某些风洞为监测对象，着重介绍了风洞试验过程故障智能容错控制系统的基本配置，原理和方法，同时对诊断标准的确定，容错功能的实现等进行了分析和讨论。     

分布、实时、容错一体化设计方法研究

针对分布式航天器系统的运行环境和特点，对嵌入式系统在空间环境、实时、容错、分布上的需求进行了分析，提出了分布、实时、容错一体化的嵌入式系统设计方法，从满足实时要求下的实时容错能力、免疫与自愈相结合的综合容错能力、单节点的容错与节点间容错相结合的分布容错能力和多种容错方法集成等4个方面，对设计方法进行了阐述。     

无线传感器网络中网络层故障容错技术研究进展

故障容错能提高无线传感器网络的稳定性和可靠性, 是无线传感器网络的一项关键技术。网络层容错及跨层协同优化设计是网络故障容错的重要研究内容, 主要对网络层容错技术研究进行了归纳和总结。网络层容错控制技术主要分为多路由传输、纠删编码/网络编码、数据重传机制、跨层协同优化与复合容错和仿生智能容错等, 并对网络层容错控制技术研究趋势作了探讨。     

基于虚拟化技术的仿真系统容错优化方法

节点崩溃或者仿真资源不足导致的分布式仿真系统故障,降低了仿真系统可靠性。为保证系统容错效果,降低容错开销,提出了一种基于虚拟化技术的仿真系统容错方法,按照系统故障发生的位置,对不同类型故障动态采用不同类型的容错策略。分析了检查点容错策略的优化方法,给出了最优设置间隔;结合虚拟化技术的优势,解决了副本容错策略的节点选择、副本数量以及位置分布问题;同时,引入基于虚拟机迁移的容错策略,并将其作为检查点容错策略和副本容错策略的补充,以降低容错开销。通过仿真实验数据对比,分析了动态容错策略与普通容错策略的性能,可知动态容错策略保证了系统容错性能,容错开销也保持在较低水平。     

计算机系统的容错技术方法

随着计算机技术的发展,计算机系统的可靠性越来越受到人们的重视,而容错技术是提高可靠性的一种有效方法。本文研究了计算机容错技术的各种方法,如硬件容错、信息容错、软件容错等,介绍了TMR（三模冗余）的原理及其缺点,详细研究了两种最基本的软件容错技术NVP和RB。这些容错技术可有效提高计算机系统的可靠性。     

Web Services容错管理框架-WSFMF

容错是提高Web Services可靠性和可用性的关键技术。本文提出了在Web Services中实现容错的三种方案：基于后台服务对象的容错、基于Web服务器的容错和基于Web服务的容错,并分析、比较了这三种方案的优缺点。在基于web服务的容错方案的基础上,提出了一个通用的Web Services容错管理框架-WSFMF,并分析了其实现关键,给出了相应的解决方案;最后在我们自主开发的Web Services平台-StarWS上进行了相应实现。     

一种基于组件的风洞通用测控平台设计

为了提高风洞测控系统及其软件的可扩展性和重用性,缩短软件开发周期,从风洞测控系统的特性与需求出发,综述了风洞测控软件通用化的现状,并基于面向对象思想和系统架构设计理念,提出了组件化风洞测控软件平台的层次结构,分析了用户定制层和功能实现层的组件划分、组件通信模式/接口和组件封装,讨论了基于组件的风洞测控平台原型系统设计,为风洞测控系统软件的进一步通用化提供了一种思路和方法。     

航空火控计算机的容错技术分析

可靠性是航空火控系统主要指标,而容错技术是提高航空火控系统可靠性的重要途径。本文根据可靠性原理和容错技术,分析了容错技术在火控系统中的应用,并用实际火控系统：飞机军械检测系统、平显自检系统,分别分析了故障检测技术、屏蔽技术和动态冗余技术,最后对火控计算机实现容错式硬件和容错软件进行了分析和研究。     

容错视频编码技术研究

本文对容错视频编码技术进行了分类概述。文章首先指出Internet视频通信中容错视频编码的必要性．并对容错视频通信系统的典型结构和基本思想进行了描述。然后文章对近年来出现的容错熵编码、容错预测编码和分层视频编码及区分保护等容错视频编码技术进行了分类介绍。     

Current and future research directions in network optimization

In this paper, we discuss a number of current and future research directions in network optimization. First, we categorize current research efforts as primarily methodological or primarily applied and we carefully define the boundaries of each class. In addition, we survey the present capabilities of network algorithms. Next, we delineate objectives in each class. Finally, we list several network problems for each class that should, in our opinion, be investigated and we give pertinent background information.     

A framework to test interval arithmetic libraries and their IEEE 1788-2015 compliance

As developers of libraries implementing interval arithmetic, we faced the same difficulties when it comes to testing our libraries. What must be tested? How can we devise relevant test cases for unit testing? How can we ensure a high (and possibly 100%) test coverage? Before considering these questions, we briefly recall the main features of interval arithmetic and of the IEEE 1788-2015 standard for interval arithmetic. After listing the different aspects that, in our opinion, must be tested, we contribute a first step towards offering a test suite for an interval arithmetic library. First we define a format that enables the exchange of test cases, so that they can be read and tried easily. Then we offer a first set of test cases, for a selected set of mathematical functions. Next, we examine how the Julia interval arithmetic library, IntervalArithmetic.jl, actually performs to these tests. As this is an ongoing work, we list extra tests that we deem important to perform.     

From designing objects to designing fields—from control to freedom

In this paper we want to explore Field as a concept and as a metaphor for understanding interactive systems. By interactive systems we mean both systems and artworks, where the user by interacting changes the course of events. We intend to show why we need new terms and why we consider Field to be a fruitful concept and term. Further we will show how the Field concept changes both our understanding of what we do as designers and composers and how we acknowledge our audience. We will exemplify the design consequences of the Field concept by going through some design considerations we made when designing the audio tactile installation Mufi.     

Refinement for user interface designs

Formal approaches to software development require that we correctly describe (or specify) systems in order to prove properties about our proposed solution prior to building it. We must then follow a rigorous process to transform our specification into an implementation to ensure that the properties we have proved are retained. Different transformation, or refinement, methods exist for different formal methods, but they all seek to ensure that we can guide the transformation in a way which preserves the desired properties of the system. Refinement methods also allow us to subsequently compare two systems to see if a refinement relation exists between the two. When we design and build the user interfaces of our systems we are similarly keen to ensure that they have certain properties before we build them. For example, do they satisfy the requirements of the user? Are they designed with known good design principles and usability considerations in mind? Are they correct in terms of the overall system specification? However, when we come to implement our interface designs we do not have a defined process to follow which ensures that we maintain these properties as we transform the design into code. Instead, we rely on our judgement and belief that we are doing the right thing and subsequent user testing to ensure that our final solution remains useable and satisfactory. We suggest an alternative approach, which is to define a refinement process for user interfaces which will allow us to maintain the same rigorous standards we apply to the rest of the system when we implement our user interface designs.     

移动警务系统中VPN和RADIUS用户认证技术的应用

本文将通过讨论VPN技术和RADIUS用户认证技术的组成原理,采用VPN技术和RADIUS用户认证技术相结合的方法,解决当承载网络采用CDMA1X时的公共移动通信网的安全接入问题。     

Partial evaluation of Maple

Having been convinced of the potential benefits of partial evaluation, we wanted to apply these techniques to code written in Maple, our Computer Algebra System of choice. Maple is a very large language, with a number of non-standard features. When we tried to implement a partial evaluator for it, we ran into a number of difficulties for which we could find no solution in the literature. Undaunted, we persevered and ultimately implemented a working partial evaluator with which we were able to very successfully conduct our experiments, first on small codes, and now on actual routines taken from Maple’s own library. Here, we document the techniques we had to invent or adapt to achieve these results.     

An Experiment in Abstract Machine Design

In this article we present Typed Feature Structures as an extension of Prolog, and show how to come up with a compilation scheme and an abstract machine using a design methodology based on partial evaluation. First we define the transformations used by our partial evaluator. Then we present the design methodology which we will use later. Next, we clarify the notion of Typed Feature Structures that underlies our work, and formally define the unification of such structures. Based on this definition, we develop a unification procedure with explicit heap representation. By partially evaluating this procedure with respect to some example programs, we show how to come up with the machine instructions and translation schemes. Finally, we briefly address coreferences, cyclic structures and the unification of types. © 1997 by John Wiley & Sons, Ltd.     

Observation and identification tools for non-linear systems: application to a fluid catalytic cracker

In this paper we recall general methodologies we developed for observation and identification in non-linear systems theory, and we show how they can be applied to real practical problems.

In a previous paper, we introduced a filter which is intermediate between the extended Kalman filter in its standard version and its high-gain version, and we applied it to certain observation problems. But we were missing some important cases. Here, we show how to treat these cases.

We also apply the same technique in the context of our identifiability theory.

As non-academic illustrations, we treat a problem of observation and a problem of identification, for a fluid catalytic cracker (FCC). This FCC unit is one of the most crucial from an economic point of view for the petroleum industry.     

多用户MIMO—OFDM的资源分配和性能分析

论文主要考虑多用户的MIMO-OFDM问题,以使得各个用户更公平有效地分配网络资源。文章首先给出MIMO-OFDM模型,然后引入反映用户满意程度的效益函数,并给出在MIMO-OFDM模型下的效益函数具体形式。其次,进行资源分配,重点考虑OFDM的各个子载波该分配给哪个用户,以及总功率该如何分配给各个子载波,从而实现系统的最优化。最后,文章给出了仿真结果,并着重对仿真结果进行了详细的性能分析。     

Programming pervasive spaces

With the invention of the PC and emergence of the network, we realized we need new concepts and capabilities to program networks of computers. Standards such as TCP/IP and IEEE 802 played a major role in transforming the first computer network concept (Arpanet) to the Internet we know today. However, we also had to invent new computing models such as the client-server model, transactions, distributed objects, Web services, disconnected operation, and computing grids. Furthermore, we had to invent various middleware to support these emerging models, hiding the underlying system's complexity and presenting a more programmable view to software and application developers. Today, with the advent of sensor networks and pinhead-size computers, we're moving much closer to realizing the vision of ubiquitous and pervasive computing. However, as we create pervasive spaces, we must think ahead to consider how we program them, just as we successfully programmed the mainframe and, later on, the Internet.