基于agen t 的城市交通信号控制

利用agent技术对城市交通信号控制进行研究．首先给出了区域agent(ARA)的组成和结构，然后给出了城市交通控制的模型和协调算法．基于agent技术的城市交通控制系统能对交通状况进行实时反映和处理．在此模型基础上，应用博弈论的相关知识给出城市交通信号协调控制算法．最后通过仿真程序验证了该模型和算法的有效性和实用性．     

改进ARA*算法的移动机器人路径规划

针对传统ARA*移动机器人全局路径规划算法效率和安全性的缺陷,在ARA*算法的基础上进行了改进。用二叉排序树代替传统ARA*算法中用来存储节点信息的线性表,减少搜索一维数据结构最小值时需要查阅的数据个数,降低节点更新模块的时间复杂度,提高算法效率;为了保持机器人与障碍物之间的安全距离,提出了一种自适应的节点间连接方式选择策略,通过4连接与8连接的融合,移动机器人可以在局部无障碍范围内减少自身折转次数,避免路径冗余,在障碍物角点直角折转,降低移动机器人执行任务时的安全风险。仿真结果表明,改进后的ARA*算法搜索时间相比传统ARA*算法减少了43%;改进算法规划出的路径保证机器人始终能与障碍物保持安全距离。     

PMI中AA与ARA通信模型设计及形式化描述

授权管理基础设施（PMI）系统中属性权威（AA）与属性注册权威（ARA）通信状态多且变化复杂。提出了一个PMI中AA与ARA的通信模型，以避免不安全的中间状态出现。对该模型的特征进行了分析，运用有限状态机(FSM)对该模型进行形式化描述，并证明了其安全性。     

一种属性权威系统的设计与实现

设计并实现了一个属性权威（AA）系统，该系统由农业银行属性权威服务器系统（AB AA）、农业银行属性注册权威服务器系统（AB ARA）和农业银行目录服务器系统构成，用于提供属性证书的签名、发放及生命周期管理等。     

启发式路径搜索算法研究综述

描述了一类在真实世界中用于路径规划的启发式路径搜索算法。论述了这些算法的异同,这类算法主要包括静态算法(如A*),动态算法(如D*),Anytime算法(如ARA*)。本文的目的在于讨论它们在现实机器人系统中的应用,以及各自的优缺点。     

Data Management in the APPA System

Combining Grid and P2P technologies can be exploited to provide high-level data sharing in large-scale distributed environments. However, this combination must deal with two hard problems: the scale of the network and the dynamic behavior of the nodes. In this paper, we present our solution in APPA (Atlas Peer-to-Peer Architecture), a data management system with high-level services for building large-scale distributed applications. We focus on data availability and data discovery which are two main requirements for implementing large-scale Grids. We have validated APPA’s services through a combination of experimentation over Grid5000, which is a very large Grid experimental platform, and simulation using SimJava. The results show very good performance in terms of communication cost and response time. Work partially funded by ARA “Massive Data” of the French ministry of research and the European Strep Grid4All project.     

Grid Data Management: Open Problems and New Issues

Initially developed for the scientific community, Grid computing is now gaining much interest in important areas such as enterprise information systems. This makes data management critical since the techniques must scale up while addressing the autonomy, dynamicity and heterogeneity of the data sources. In this paper, we discuss the main open problems and new issues related to Grid data management. We first recall the main principles behind data management in distributed systems and the basic techniques. Then we make precise the requirements for Grid data management. Finally, we introduce the main techniques needed to address these requirements. This implies revisiting distributed database techniques in major ways, in particular, using P2P techniques. Work partially funded by ARA “Massive Data” of the French ministry of research (project Respire), the European Strep Grid4All project, the CAPES–COFECUB Daad project and the CNPq–INRIA Gridata project.     

HEURISTIC SEARCH UNDER CONTRACT

In this article, we present a heuristic search technique (Contract Search) that can be adapted automatically for a specific node contract. We analyze the node expansion characteristics of best‐first search techniques and identify a probabilistic model (rank profiles) that characterizes the search under restricted expansions. We use the model to formulate an optimal strategy to choose level dependent restriction bounds, maximizing the probability of obtaining the optimal cost goal node under the specified contract. We analyze the basic properties of the rank profiles and establish its relation with the search space configuration and heuristic error distributions. We suggest an approximation scheme for the profile function for unknown search spaces. We show how the basic framework can be adapted to achieve different objectives (like optimizing the expected quality) considering multiple goals and approximate solutions. Experimental comparison with anytime search techniques like ARA* and beam search on a number of search problems shows that Contract Search outperforms these techniques over a range of contract specifications.     

Safely composing security protocols

Security protocols are small programs that are executed in hostile environments. Many results and tools have been developed to formally analyze the security of a protocol in the presence of an active attacker that may block, intercept and send new messages. However even when a protocol has been proved secure, there is absolutely no guarantee if the protocol is executed in an environment where other protocols are executed, possibly sharing some common keys like public keys or long-term symmetric keys. In this paper, we show that security of protocols can be easily composed. More precisely, we show that whenever a protocol is secure, it remains secure even in an environment where arbitrary protocols satisfying a reasonable (syntactic) condition are executed. This result holds for a large class of security properties that encompasses secrecy and various formulations of authentication. This work has been partly supported by the RNTL project POSé and the ARA SSIA Formacrypt.     

Accurate CFD driven optimization of lifting surfaces for wing-body configuration

A robust and accurate method for the multipoint CFD driven constrained optimization of 2D airfoils for minimum drag, previously developed by the authors, is extended to the optimization of 3D lifting surfaces for wing-body aircraft configurations. The objective is to minimize total drag at fixed lift subject to numerous geometrical and aerodynamical constraints. The optimization method is based on the use of Genetic Algorithms, accurate full Navier-Stokes drag prediction and massive multilevel parallelization of the whole computational framework. The method was applied to the problem of multipoint optimization of wings incorporated into transport-type aircraft configurations, by the example of ARA M-100 wing-body shape (a NASA test case). For the considered class of problems, significant aerodynamic gains have been obtained.     

一种基于分簇蚁群策略的无线传感器网络路由算法

如何最大化地延长网络的生存时间是无线传感器（WSN）网络研究的核心问题.基于分簇策略,提出一种能量有效的路由算法（EEA）.该算法利用分簇原理减少了参与寻找最优路径的节点数,从而降低了系统的能耗.同时设计一种改进的最优路径评价标准,该标准兼顾了传输路径上各节点的剩余能量和最优路径上总的能量消耗.仿真结果表明,与其他蚁群策略的路由算法（如：基于蚁群算法的路由算法（ARA）和EEAWSN）相比,该算法能在寻找最优路径时避开剩余能量少的节点,使最优路径上各节点的能量呈整体性衰落,从而沿长了网络的寿命.     

Reducing network traffic in unstructured P2P systems using Top-k queries

A major problem of unstructured P2P systems is their heavy network traffic. This is caused mainly by high numbers of query answers, many of which are irrelevant for users. One solution to this problem is to use Top-k queries whereby the user can specify a limited number (k) of the most relevant answers. In this paper, we present FD, a (Fully Distributed) framework for executing Top-k queries in unstructured P2P systems, with the objective of reducing network traffic. FD consists of a family of algorithms that are simple but effective. FD is completely distributed, does not depend on the existence of certain peers, and addresses the volatility of peers during query execution. We validated FD through implementation over a 64-node cluster and simulation using the BRITE topology generator and SimJava. Our performance evaluation shows that FD can achieve major performance gains in terms of communication and response time. Recommended by: Sunil Prabhakar Work partially funded by the ARA Massive Data of the Agence Nationale de la Recherche.     

RAVA:基于强化关联的12345热线事件分拨方法

近年来,12345热线智能化成为地方政府数字化转型的典型代表。为解决手工事件分拨耗时长、效率低下等问题,该文提出了一种基于强化关联的12345热线事件分拨方法(RAVA)。首先,RAVA模型通过指针生成网络构建事件画像并得到事件编码。其次,使用基于强化联系的注意力机制(ARA)来捕获事件编码与“三定”职责拼接向量中的关联信息,得到“事件-三定”匹配结果。然后,将匹配结果与部门简介编码拼接并输入分类器。最后,经过答案重排序后输出12345热线事件所对应的分拨部门。在芜湖市12345热线数据集上的实验结果证明,相较于其他基线分拨方法,RAVA方法在多项指标上取得了更好的分拨效果。     

A self-adaptable query allocation framework for distributed information systems

In large-scale distributed information systems, where participants are autonomous and have special interests for some queries, query allocation is a challenge. Much work in this context has focused on distributing queries among providers in a way that maximizes overall performance (typically throughput and response time). However, preserving the participants’ interests is also important. In this paper, we make the following contributions. First, we provide a model to define the participants’ perception of the system regarding their interests and propose measures to evaluate the quality of query allocation methods. Then, we propose a framework for query allocation called Satisfaction-based Query Load Balancing (SQLB, for short), which dynamically trades consumers’ interests for providers’ interests based on their satisfaction. Finally, we compare SQLB, through experimentation, with two important baseline query allocation methods, namely Capacity based and Mariposa-like. The results demonstrate that SQLB yields high efficiency while satisfying the participants’ interests and significantly outperforms the baseline methods. Work partially funded by ARA “Massive Data” of the French ministry of research (Respire project) and the European Strep Grid4All project.     

基于深度学习的脑片图像区域划分方法

针对采用传统多模态配准方法进行小鼠脑片图像自动化区域划分精度差的问题,提出一种无监督多模态的脑片图像区域划分方法。首先,基于小鼠脑图谱获得脑片区域划分对应的ARA（Allen Reference Atlases）数据库中的Atlas脑图谱和Average Template脑图谱;然后,通过仿射变换预处理和PCANet-SR（Principal Component Analysis Net-based Structural Representation）网络处理将Average Template脑图谱与小鼠脑切片进行预配准及同模态转换,再根据U-net及空间变换网络实现无监督配准,并将配准变形关系作用到Atlas脑图谱上;最后,提取配准变形后的Atlas脑图谱的边缘轮廓并与原始小鼠脑切片进行融合,从而实现脑片图像的区域划分。实验结果表明,与现有PCANet-SR+B样条配准方法相比,所提方法的配准精度指标的均方根误差（RMSE）降低了1.6%,相关系数（CC）和互信息（MI）值分别提高了3.5%、0.78%;可快速实现无监督多模态的脑片图像配准任务,且使得脑片区域划分准确。     

单向累计函数技术分析

单向累计函数是与密码学密切相关的一门新兴技术。本文综述了单向累积函数及其相关的基本技术。详细分析了单向累积函数的构造方法,包括RSA单项累积函数和无冲突单向累积函数。在讨论了单向累积函数的技术发展方向之后,对其应用前景和应用领域做了详细介绍。     

控件重用技术的成就与缺陷

本文研究了微软的控件重用技术,通过与对象重用技术进行比较,本文总结了控件重用技术的成就,通过与代码组件合重用技术进行比较,本文指出了控件重用技术的缺陷。     

基于Java 3D技术和Swing技术的3D建模开发

该文介绍了基于Java技术中的Java3D技术和Swing技术的3D建模的开发。和其他技术开发3D模型相比,利用Java技术的面向对象技术开发的3D模型有着很多优势。比如,此3D模型支持多平台操作,适合编写非常复杂的应用程序。利用Java3D技术实现了盛放3D模型的基础类的开发,同时通过和Swing技术的合理结合实现了3D组件的用户图形界面化、用户操作简易化的特色。利用Java技术还克服了编程代码冗长、繁杂不利于管理这个技术难点。同时利用了Java技术的事件监听处理功能实现了对3D模型的编辑功能。优化了编程工作。文中以此3D组件在石油数值模拟软件中的应用为例说明了该组件具有的特色。     

AmbiKraf

This paper presents, AmbiKraf, a non-emissive fabric display that subtly animates patterns on common fabrics. We use thermochromic inks and peltier semiconductor elements to achieve this technology. With this technology we have produced numerous prototypes from animated wall paintings to pixilated fabric displays. The ability of this technology to subtly and ubiquitously change the color of the fabric itself has made us able to merge different fields and technologies with AmbiKraf. In addition, with an animated room divider screen, Ambikraf merged its technology with Japanese Byobu art to tighten the gap between traditional arts and contemporary technologies. Through this AmbiKraf Byobu art installation and other installations, we discuss the impact of this technology as a ubiquitous fabric display. With focus to improvements of some limitations of the existing system, we present our future vision that enables us to merge this technology into more applications fields thus making this technology a platform for ubiquitous interactions on our daily peripherals.     

在．NET框架的类对象中实现COM对象的引用

COM技术是原来微软为了解决组件调用而推出的一种解决方法．但在微软新的开发战略．NEI、平台下．没有沿用原来的COM技术．而是采用了一种新的技术：程序集方法。为了在,NET的开发环境下调用原来用COM技术实现组件的方法，文中介绍了,NET中的运行库可调用包装(RCW)技术，说明了如何用这一技术来解决这一问题,用Delphi6新建了一个COM组件，演示了在NFT的平台下利用RCW技术如何调用COM组件,说明了此方法的运用。例子证明利用RCW技术就能很好地在,NET框架的类对象中实现对COM对象的引用。