数字电视用户管理系统

课题实现了数字电视用户管理系统的设计与开发,以Oracle数据库作为后台数据库,以C Builder 6作为前台开发工具,包括表的设计与界面的设计.实现了数字电视用户管理系统基本功能,基本上满足了实际商业运营的需要.     

数据采集与监控软件Genie

Genie是具有国际先进水平的数据采集与监控软件，它提供了一个面向对象的图形化用户界面，因此简化了数据采集过程、控制应用程序开发和操作员界面。本文介绍了Genie的特点、功能、基本用途以及VISUALBA－SIC在设计这类监控软件中的作用。     

条件概率关系数据库模型

现实世界中大量存在着的不确定性信息，关系数据库模型仅视它们为空值，有必要增强其处理这类信息的能力，文章在总结前人工作的基础上推广关系数据库模型，创建有效处理随机型不确定性信息的条件概念关系数据库模型，该模型通过在关系模式中增加一个条件概率测度属性，为每条记录指定适当的条件概率的途径，来表示不确定性信息。文中以对象码为基本工具，创建了条件概率关系结构；以特征函数为基本工具，定义了一套基于该结构的代数运算规则。条件概率的语意比概率的语意广泛，灵活，因而该模型能有效克服概率关系模型的许多不足。     

基于物元分析和层次分析的选厂综合性能评估

利用物元分析法和层次分析法的特点，将物元分析和层次分析法有机的结合起来建立选厂性能综合评估模型，建立的评估模型表明该评估方法能够克服传统方法中参评人员的主观不确定性和认识上的模糊性，可用于选厂有关指标的综合评估。     

面向对象的CAPP系统工艺知识表达

知识是人们在长期的生活及社会实践中、科学研究及实验中积累起来的对客观世界的认识与经验。工艺知识表达是CAPP系统的重要部分。本文介绍了工艺知识的种类，同时介绍了对工艺知识进行表示与组织的几种方法。以工艺知识中的制造资源为例，着重介绍了面向对象方法的概念及其描述形式。     

Complex system reliability modelling with Dynamic Object Oriented Bayesian Networks (DOOBN)

Nowadays, the complex manufacturing processes have to be dynamically modelled and controlled to optimise the diagnosis and the maintenance policies. This article presents a methodology that will help developing Dynamic Object Oriented Bayesian Networks (DOOBNs) to formalise such complex dynamic models. The goal is to have a general reliability evaluation of a manufacturing process, from its implementation to its operating phase. The added value of this formalisation methodology consists in using the a priori knowledge of both the system's functioning and malfunctioning. Networks are built on principles of adaptability and integrate uncertainties on the relationships between causes and effects. Thus, the purpose is to evaluate, in terms of reliability, the impact of several decisions on the maintenance of the system. This methodology has been tested, in an industrial context, to model the reliability of a water (immersion) heater system.     

A reconfigurable VLSI-based double-lens tracking camera

Watching and tracking an object while seeing a much wider view is one of advantages of the eye system. We proposed and developed a tracking camera system that mimics the eyes by using double-lens modules. In the system, a wide view is captured through the wide-lens module, while the target in it is tracked and magnified through the telescopic lens module. Electronic circuits for tracking control are implemented onto the reconfigurable VLSI or FPGA in order to embed the parallelism in the tracking algorithm into the hardware. A successfully developed FPGA-based prototype performs high-speed tracking at the video-rate. This work was present in part at the 12th International Symposium on Artificial Life and Robotics, Oita, Japan, January 25–27, 2007     

Adding Support for Persistence to CLOS via Its Metaobject Protocol

Language-level support for object persistence frees programmers from having to confront a broad class of database issues from within their applications. By virtue of its metaobject protocol, CLOS is a language whose semantics can be tailored by individual programmers. We used the metaobject protocol to extend CLOS with support for object persistence. Our goal was to obtain a version of CLOS with persistence to which we could easily port a commercial geometric CAD modeling system. We describe the design and implementation of our persistence extension and highlight the strengths and weaknesses exhibited by the CLOS metaobject protocol during our experiment. For many aspects of the implementation we found that the metaobject protocol was ideal. In other cases we had to choose among paying a large performance penalty, extending the protocol, and bypassing the protocol by modifying the language implementation directly.     

The operational semantics of user-defined relationships in object oriented database systems

In semantic data models, abstract relationship (e.g. generalization, aggregation, etc.) semantics are defined, specifying how insertion, deletion and modification operations made at a higher level of abstraction can affect the objects abstracted over and vice versa. These semantics, also known as structural constraints, are expressed through so-called update rules. This perspective has been somewhat lost in most object-oriented systems, where user-defined relationships are supported as simple pointers and their semantics are embedded, distributed and replicated within the operations accessing these pointers. This paper inherits and extends the treatment of relationships found in semantic data models to behavioural object-oriented models by presenting an approach to uniformly capture the update rules for user-defined relationships. The stress is not on supporting relationships as first-class objects, but on describing their update rules (or operational semantics) through a set of constructors namely, reaction, anticipation, delegation and exception. The approach has been borne out by an implementation in an active object-oriented database system.     

Proactive replication for rare objects in unstructured peer-to-peer networks

Unstructured peer-to-peer (P2P) networks have become a very popular architecture for content distribution in large-scale and dynamic environments. The search efficiency problem in unstructured P2P networks has not been adequately addressed so far, especially concerning search for rare objects. In this paper, we propose a proactive replication strategy to improve search efficiency for rare objects. It uses an object-probing technique for peers to decide whether or not to establish replications for their objects when they join the network. This strategy can effectively increase the popularity of rare objects in order to enhance search efficiency. We also present a rare object search algorithm to reduce the overhead caused by the replication strategy. When a peer forwards a search request, the forward probability is calculated according to its neighbors' degrees and the number of neighbors' objects. Therefore, the search request is forwarded to the peers more likely containing target objects. Simulations show that our proactive replication strategy greatly improves search efficiency for rare objects with moderate communication overhead. The rare object search algorithm not only improves search efficiency for rare objects, but also achieves load balance in search.