A note on the value function for constrained control problems

We consider the Mayer optimal control problem with dynamics given by a nonconvex differential inclusion, whose trajectories are constrained to a given set and we obtain a relation between the costate function that appears in the maximum principle and the value function. This relation extends the known conditions existing in the literature for unconstrained problems to those for problems under state constraints.     

VFP环境下报表设计研究

Visual FoxPro是小型数据库应用系统开发工具,而报表设计是数据库应用系统开发的一个重要组成部分,直接决定系统的输出是否能够满足用户的需要。为此详细研究了报表设计方法,结合Microsoft的OLE技术,引入面向对象方法,提出了一种新的报表设计方法。实践应用证明,该方法非常适合设计复杂的报表。     

石化企业线性规划模型的自动生成

根据石化企业生产过程的实际情况，考虑原料供应量、装置加工能力、物料平衡和价格等情况．建芷反映企业生产情况的线性规划数学模型。分别阐述了模型的决策变量、目标函数和约束方程的自动生成的方法，并给出了模型文件的存储结构。     

水资源系统分析法在水资源优化配置中的应用

探讨了水资源系统分析法的步骤和数学模型,并以线性规划模型为例建立了水资源优化配置的数学模型,对水资源优化配置提供了一定的依据。     

HART通信协议在汽油机速度测量和监控方面的应用

首先介绍了HART通信协议及他的优点，然后介绍了HART通信协议在汽油机测速方面的软件实现。该软件主要采用目前流行的VB编程语言。可设计出界面友好、功能强大的测量和监控软件。     

Wavelength and Waveband Assignment for Ring Networks Based on Parallel Multi‐granularity Hierarchical OADMs

In this paper we study the optimization issues of ring networks employing novel parallel multi‐granularity hierarchical optical add‐drop multiplexers (OADMs). In particular, we attempt to minimize the number of control elements for the off‐line case. We present an integer linear programming formulation to obtain the lower bound in optimization, and propose an efficient heuristic algorithm called global bandwidth resource assignment that is suitable for the design of large‐scale OADM networks.     

Protecting local access telecommunications networks: Toward a minimum-cost solution

The problem of designing fibre-optic networks for local-access telecommunications generates (at least) three non-trivial subproblems. In the first of these subproblems one must determine how many fibre-optic cables (fibres) are required at either end of a street. In the next subproblem a minimum-cost network must be designed to support the fibres. The network must also provide distinct paths from either end of the street to the central exchange(s). Finally, the fibre-optic cables must be placed in protective covers. These covers are available in a number of different sizes, allowing some flexibility when covering each section of the network. In this paper we describe a dynamic programming (DP) formulation for finding a minimum-cost (protective) covering for the network (the third of the subproblems). This problem is a generalised set covering problem with side constraints and is further complicated by the introduction of fixed and variable welding costs. The DP formulation selects covers along each arc (in the network), but cannot exactly model the fixed costs and so does not guarantee optimality. We also describe an integer programming (IP) formulation for assessing the quality of the DP solutions. The cost of the networks constructed by the IP model is less than those designed using the DP model, but the saving is not significant for the problems examined (less than 0.1%). This indicates that the DP model will generally give very good solutions. Furthermore, as the problem dimensions grow, DP gives significantly better solution times than IP.     

结构化编程实现Sniffer

随着各高校校园网络规模的不断扩大和各种应用的急剧增加,各种新的网络问题也在不断出现。Sniffer是网络管理员进行网络管理的有效工具,可以有效地对网络进行实时监控,及时发现网络中存在的各种问题。本文首先介绍了Sniffer的工作原理,其次给出了实现Sniffer功能的编程流程图,并用C语言给出了编程所需的关键代码。     

一种实现最佳用户检测的非线性优化神经网络

本文提出并讨论了实现码分多址（CDMA）系统上最佳多用户检测（MUD）的一种神经网络方法。该方法通过将最佳多用户检测视为非线性优化组合问题，利用神经网络能有效求解非线性优化问题的优势，导出了一种非线性优化神经网络来实现最佳多用户检测，理论分析和计算机模拟表明，所提出的神经网络具有可实时应用的动态性能和较传统方法优越得多的误码率性能和抗多址干扰的性能。     

R-Calculus for ELP:An Operational Approach to Knowledge Base Maintenance

Sme concepts used in knowledge base maintenace,such as sequence,new law,user‘s rejection and reconstructions of a knowledge base,are first introduced,and then a framework for extended logic programming(ELP)is given,where an extended logic program is equivalent to a knowledge base.A transition system called R-calculus for ELP is provided.For a given knowledge base and a user‘s rejection,the R-calculus for ELP will deduce best revisions of the base.The soundness and the completeness of the R-calculus for ELP are proved,and the R-calculus for ELP is implemented in Prolog.In addition,the research is compared with other relevant work.