基于用“动态汛限水位”来利用雨洪资源

雨洪资源的依法利用,早已在国外广泛展开。国内的雨洪资源利用,还面临着重新计算汛限水位高度,然后再依法予以重新确认的难题。唯有如此,才能缓解各级行政部门为了多产粮而＂压＂水库管理部门不顾风险的超汛限蓄水。因此,现阶段用＂动态汛限水位＂来化解矛盾,使水库管理部门从被迫接受潜规则的超汛限蓄水,转变为可以摆上台面的依法科学合理...     

TAPI软电话通信系统的模块化设计

首先分析了TAPI协议的结构、通信编程原理和编程应用环境,重点介绍了TAPI协议的层次化模型结构及其模块化设计方法,该方法可以对进一步研究和开发TAPI软电话应用产品提供借鉴。     

自适应均衡器的FPGA实现

在无线通信系统中,由于多径效应的干扰导致信号在传输过程中不可避免地产生码间干扰,因此必须在接收端增加均衡器,以消除码间干扰,提高传输质量。该自适应均衡器设计以FPGA为设计平台,使用自上而下的模块化的设计方法,利用StratixⅡ系列EP1C20F324C6芯片,采用横向滤波器结构,设计并行结构的8阶复数滤波器。最后在QuartusⅡ中进行仿真与综合,结果显示I、Q两路误差信号趋于零,从而实现自适应均衡,降低误码率。     

基于动态联盟的一种身份信任计算模型

在动态联盟中,身份管理是确保信息安全的一种手段,但是随着联盟成员数日益增多,传统的身份管理难以妥善应对当前较为复杂的环境,尤其当成员之间无交互历史时,数据交换的可靠性无法保障。文中研究了不同计算环境中的多种信任管理方法,并把P2P的推荐评价机制应用到动态联盟的身份管理中,提出了一种基于推荐的身份信任管理的算法。在这种算法中,身份的信任值由多因素加权综合而成,其中推荐信任值在算法中起到关键的作用。该算法试图为解决复杂的动态联盟环境下的身份管理问题提供一种途径。     

将硬件引入“面向对象程序设计”课程实验教学

针对“面向对象程序设计”课程实验内容的设置容易使学生产生学之无用的思想及学后不会用的问题,结合电子信息专业培养特色,压缩了传统的、基本的实验内容,增加了应用性强的实验项目,并将硬件引入实验教学。实践表明,改进后的实验教学模式效果良好。     

多平台下动态采集税控数据的技术研究

在商业税收领域中,不同的行业、商家,可能会采用不同的系统平台来完成他们各自的销售任务,这就给国家税收时获取税控数据带来了一定的挑战。本文基于国家信息化标准委员会针对税控收款机的国家标准,提出并实现了一种在多平台下动态采集税控数据的解决方案。     

Limit load and shakedown analysis of plastic structures under stochastic uncertainty

Problems from plastic analysis are based on the convex, linear or linearised yield/strength condition and the linear equilibrium equation for the stress (state) vector. In practice one has to take into account stochastic variations of several model parameters. Hence, in order to get robust maximum load factors, the structural analysis problem with random parameters must be replaced by an appropriate deterministic substitute problem. A direct approach is proposed based on the primary costs for missing carrying capacity and the recourse costs (e.g. costs for repair, compensation for weakness within the structure, damage, failure, etc.). Based on the mechanical survival conditions of plasticity theory, a quadratic error/loss criterion is developed. The minimum recourse costs can be determined then by solving an optimisation problem having a quadratic objective function and linear constraints. For each vector a(·) of model parameters and each design vector x, one obtains then an explicit representation of the “best” internal load distribution F^∗. Moreover, also the expected recourse costs can be determined explicitly. Consequently, an explicit stochastic nonlinear program results for finding a robust maximal load factor μ^∗. The analytical properties and possible solution procedures are discussed.     

Continuous State Dynamic Programming via Nonexpansive Approximation

This paper studies fitted value iteration for continuous state numerical dynamic programming using nonexpansive function approximators. A number of approximation schemes are discussed. The main contribution is to provide error bounds for approximate optimal policies generated by the value iteration algorithm.      

Exact methods and a heuristic for the optimization of an integrated replenishment-storage planning problem

In this paper we study the coordination of different activities in a supply chain issued from a real case. Multiple suppliers send raw materials (RMs) to a distribution center (DC) that delivers them to a unique plant where the storage of the RMs and the finished goods is not possible. Then, the finished goods are directly shipped to multiple customers having just‐in‐time (JIT) demands. Under these hypotheses, we show that the problem can be reduced to multiple suppliers and one DC. Afterwards, we analyze two cases; in the first, we consider an uncapacitated storage at DC, and in the second, we analyze the capacitated storage case. For the first case, we show that the problem is NP‐hard in the ordinary sense using the Knapsack decision problem. We then propose two exact methods: a mixed integer linear program (MILP) and a pseudopolynomial dynamic program. A classical dynamic program and an improved one using the idea of Shaw and Wagelmans are given. With numerical tests we show that the dynamic program gives the optimal solution in reasonable time for quite large instances compared with the MILP. For the second case, the capacity limitation in DC is assumed, which makes the problem solving more challenging. We propose an MILP and a dynamic programming‐based heuristic that provides solutions close to the optimal solution in very short times.     

基于UML可适应的教学考评系统分析与设计

该文给出了UML的概念与要点,应用UML对教学考评系统进行了建模。给出了系统的用例模型、整体结构模型、静态模型、动态模型,并分析了模型对教学考评变化的可适应性。