Merging potentially inconsistent items of structured text

Structured text is a general concept that is implicit in a variety of approaches to handling information. Syntactically, an item of structured text is a number of grammatically simple phrases together with a semantic label for each phrase. Items of structured text may be nested within larger items of structured text. The semantic labels in a structured text are meant to parameterize a stereotypical situation, and so a particular item of structured text is an instance of that stereotypical situation. Much information is potentially available as structured text including tagged text in XML, text in relational and object-oriented databases, and the output from information extraction systems in the form of instantiated templates. In this paper, we formalize the concept of structured text, and then focus on how we can identify inconsistency in the logical representation of items of structured text. We then present a new framework for merging logical theories that can be employed to merge inconsistent items of structured text. To illustrate, we consider the problem of merging reports such as weather reports.     

劝导技术及其设计评估的分析

劝导技术是利用计算机、设备及应用软件来影响人类想法及行为的技术。该文对劝导技术的发展及其现状进行了综述,并着重对劝导技术的可信度及其三类劝导技术应用结果通过心理学的角度进行了分析。系统生命周期是现代设计方法理念的一个重要概念,该文介绍了系统生命周期,并介绍了基于系统生命周期中的劝导技术的设计评估行为。该文为劝导技术产品研究设计分析提供了系统的理论的指导。     

电信计费分析数据仓库系统的设计与实现

该文主要研究如何用数据仓库及其技术解决电信计费分析的实际问题。     

Prefetching in Content Distribution Networks via Web Communities Identification and Outsourcing

Content distribution networks (CDNs) improve scalability and reliability, by replicating content to the “edge” of the Internet. Apart from the pure networking issues of the CDNs relevant to the establishment of the infrastructure, some very crucial data management issues must be resolved to exploit the full potential of CDNs to reduce the “last mile” latencies. A very important issue is the selection of the content to be prefetched to the CDN servers. All the approaches developed so far, assume the existence of adequate content popularity statistics to drive the prefetch decisions. Such information though, is not always available, or it is extremely volatile, turning such methods problematic. To address this issue, we develop self-adaptive techniques to select the outsourced content in a CDN infrastructure, which requires no apriori knowledge of request statistics. We identify clusters of “correlated” Web pages in a site, called Web site communities, and make these communities the basic outsourcing unit. Through a detailed simulation environment, using both real and synthetic data, we show that the proposed techniques are very robust and effective in reducing the user-perceived latency, performing very close to an unfeasible, off-line policy, which has full knowledge of the content popularity.     

Verification of bounded Petri nets using integer programming

Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit such a semantics is to consider (finite prefixes of) net unfoldings—themselves a class of acyclic Petri nets—which contain enough information, albeit implicit, to reason about the reachable markings of the original Petri nets. In [19], a verification technique for net unfoldings was proposed, in which deadlock detection was reduced to a mixed integer linear programming problem. In this paper, we present a further development of this approach. The essence of the proposed modifications is to transfer the information about causality and conflicts between the events involved in an unfolding, into a relationship between the corresponding integer variables in the system of linear constraints. Moreover, we present some problem-specific optimisation rules, reducing the search space. To solve other verification problems, such as mutual exclusion or marking reachability and coverability, we adopt Contejean and Devie's algorithm for solving systems of linear constraints over the natural numbers domain and refine it, by taking advantage of the specific properties of systems of linear constraints to be solved. Another contribution of this paper is a method of re-formulating some problems specified in terms of Petri nets as problems defined for their unfoldings. Using this method, we obtain a memory efficient translation of a deadlock detection problem for a safe Petri net into an LP problem. We also propose an on-the-fly deadlock detection method. Experimental results demonstrate that the resulting algorithms can achieve significant speedups.

Intranet／Extranet的安全技术

分析了Intranet/Extranet所面临的安全性问题,介绍了加密技术、信息完整性技术,鉴别交换技术、确认技术、入侵检测技术及访问控制技术等六种基本的安全技术,最后给出一个实例。     

分析化学实验成绩评定软件的开发

介绍了分析化学实验成绩评定软件的主要内容、设计思想及功能 ,该软件采用VisualFoxPro5 0中文版编程 ,可用于分析化学实验成绩的评定。内容包括 :实验数据输入、实验数据修改、实验数据处理、实验结果查询、实验数据打印、修改学生名单等。本软件具有操作简单、使用方便等特点     

Identification and control of open-loop unstable processes by relay methods

This paper describes a reliable automatic PID tuning method for open-loop unstable processes. Identification with low order models is performed by means of two relay tests, one with an additional delay, which does not require a priori knowledge about the process, with the only necessary condition being that the process be gain stabilisable. This paper provides an overview of the method, states conditions that need to be satisfied for its successful implementation, and demonstrates its application on a number of examples.     

企业网络安全系统的建设策略

本文从网络安全含义入手,对企业网络安全威胁、网络安全技术进行了分析和讨论,为企业网络建设提供理论参考。同时提出了企业网络安全系统的建设策略。     

Computing Green's function of the initial-boundary value problem for the wave equation in a layered cylinder

A new analytical method for the approximate computation of the time-dependent Green's function for the initial-boundary value problem of the three-dimensional wave equation on multi-layered bounded cylinder is suggested in this paper. The method is based on the derivation of eigenvalues and eigenfunctions for an ordinary differential equation with piecewise constant coefficients, and an approximate computation of Green's function in the form of the Fourier series with a finite number of terms relative to the orthogonal set of the derived eigenfunctions. The computational experiment confirms the robustness of the method.