Adaptive user modelling in intelligent telephone and email assistants

With the burgeoning complexity and capabilities of modern information appliances and services, user modelling is becoming an increasingly important research area. Simple user profiles already personalise many software products and consumer goods such as digital TV recorders and mobile phones. A user model should be easy to initialise, and it must adapt in the light of interaction with the user. In many cases, a large amount of training data is needed to generate a user model, and adaptation is equivalent to retraining the system. This paper briefly outlines the user modelling problem and work done at BTexact on an intelligent personal assistant (IPA) which incorporates a user profile. We go on to describe FILUM, a more flexible method of user modelling, and show its application to the telephone assistant and email assistant components of the IPA, with tests to illustrate its usefulness.     

油库防爆电气设备运行安全管理注意事项

分析了油库防爆电气设备运行中安全管理应注意的几个事项。     

一个安全有效的身份鉴别协议与对应的数字签名方案

本文利用二元一次不定方程和Schnorr身份鉴别协议，构造出一个新的身份鉴别协议，该协议在RSA问题和离散对数问题是难解的假设下是安全的，同时给出了所对应的数字签名方案。     

固井设备发动机防爆系统研究

针对目前固井设备不具备防爆功能的问题, 烟台杰瑞石油装备技术有限公司研制了JCMS210固井混浆橇中Detroit8V—71N发动机防爆气控系统。在对柴油发动机的引燃源进行分析后, 阐述了防爆气控系统设计方案, 给出气控系统工作原理图。室内试验和中海油田服务股份有限公司的现场使用证明, 这种防爆气控系统性能良好, 工作可靠, 能满足ZONE2的防爆要求, 解决了固井设备的防爆问题。     

矢量图形智能判断技术的研究与应用

研究矢量图形识别是建立工程制图自动阅卷与计算机辅助教学系统的基础。由于组成二维矢量图形图元类型的多样化及图形整体位置状态的不确定性，增加了矢量图形的识别与判断难度。结合开发的《三视图智能解答》系统，研究其智能识别与判断技术。系统中引入三视图导航技术，解决了图形整体定位与识别问题。实现了对矢量图形图元素信息的分类和提取，能够对所提取的的信息与标准答案进行智能判断与评定。该方法已在AutoCAD2000环境下使用AutoLISP语言编程实现。     

船舶抗沉辅助决策系统的研究与设计

抗沉辅助决策系统是船舶常规和紧急状态下进行损管行动的关键性依据。目前抗沉计算分析系统,可对船舶基础状态、浮稳性等信息进行管理,并进行仿真和辅助决策,但大多存在算法效率低,决策生成速度和精度不足、人机交互接口脱离实际等问题。本文从船舶抗沉操作的实际执行过程出发,制定抗沉算法,根据实时装载和破损情况,对液舱采用注入水或排水的损管操作,生成调整措施,使船舶恢复良好的浮态与稳性。系统基于面向对象过程控制平台设计和实现,仿真结果验证了系统的有效性和高效性。     

无线传感器网络移动Sink网关系统的设计与实现*

针对无线传感器网络传统Sink网关的不足,提出了一种基于PDA的移动Sink网关系统的设计与实现方案,对其设计目标、体系结构和工作原理进行了论述,重点讨论了PDA与Sink节点之间的连接,PDA与Sink节点、PDA与GPS接收机及PDA与控制终端之间通信的一些关键技术.     

A novel method for camera external parameters online calibration using dotted road line

On board camera is the most important information source for driver assistant application which is based on computer vision. One problem for on board camera is that the external parameters are easy to be changed when moving on the road. Traditional method either calibrates external parameters offline or calibrates external parameters semi-online, which both need human intervention. By observation, it is found that corner connection of dotted road lane can form two groups of parallel lines. Using this geometric characteristics and through theoretical derivation, a novel online camera external parameter calibration method is proposed which focus on the situation when vehicle is moving. The pro of this method is that it maintains relatively high calculation accuracy and more important, it does not require any human intervention in whole calibration process. Experimental and comparison results show that this method is simple and have accurate results which fully meet the requirements of practical application.     

Drawing non‐layered tidy trees in linear time

The well‐known Reingold–Tilford algorithm produces tidy‐layered drawings of trees: drawings where all nodes at the same depth are vertically aligned. However, when nodes have varying heights, layered drawing may use more vertical space than necessary. A non‐layered drawing of a tree places children at a fixed distance from the parent, thereby giving a more vertically compact drawing. Moreover, non‐layered drawings can also be used to draw trees where the vertical position of each node is given, by adding dummy nodes. In this paper, we present the first linear‐time algorithm for producing non‐layered drawings. Our algorithm is a modification of the Reingold–Tilford algorithm, but the original complexity proof of the Reingold–Tilford algorithm uses an invariant that does not hold for the non‐layered case. We give an alternative proof of the algorithm and its extension to non‐layered drawings. To improve drawings of trees of unbounded degree, extensions to the Reingold–Tilford algorithm have been proposed. These extensions also work in the non‐layered case, but we show that they then cause a O(n²) run‐time. We then propose a modification to these extensions that restores the O(n) run‐time. Copyright © 2013 John Wiley & Sons, Ltd.