我国山洪灾害防治技术研究综述

针对我国防洪减灾工作中亟待解决的山洪灾害问题,总结了国内山洪灾害防治技术的研究成果,从山洪灾害的成因、预测预报技术、预警技术、监测预警系统建设、灾情风险评估技术、形成机理、防治区划及防治对策等7个方面对我国山洪灾害防治技术主要成果进行分析,探讨了当前存在的不足及今后研究的方向。     

Evaluation of reservoir sedimentation using data driven techniques

The sedimentation is a pervasive complex hydrological process subjected to each and every reservoir in world at different extent. Hydrographic surveys are considered as most accurate method to determine the total volume occupied by sediment and its distribution pattern in a reservoir. But, these surveys are very cumbersome, time consuming and expensive. This complex sedimentation process can also be simulated through the well calibrated numerical models. However, these models generally are data extensive and require large computational time. Generally, the availability of such data is very scarce. Due to large constraints of these methods and models, in the present study, data driven approaches such as artificial neural networks (ANN), model trees (MT) and genetic programming (GP) have been investigated for the estimation of volume of sediment deposition incorporating the parameters influenced it along with conventional multiple linear regression data driven model. The aforementioned data driven models for the estimation of reservoir sediment deposition were initially developed and applied on Gobindsagar Reservoir. In order to generalise the developed methodology, the developed data driven models were also validated for unseen data of Pong Reservoir. The study depicted that the highly nonlinear models ANN and GP captured the trend of sediment deposition better than piecewise linear MT model, even for smaller length datasets.     

一种改进型FNG状态机的研究及实现

为了提高网络故障管理系统的效率,结合原有CFM技术,采用特殊故障屏蔽机制和告警优先级别机制相结合的综合性告警管理策略的FNG状态机,其设置了故障生命期限和故障再现期限值,增加了打印告警信息前的告警优先级别判断。在运行时,杜绝了用户界面的刷屏现象并能打印出三种级别的告警信息。测试结果表明,改进型FNG状态机可以突显高级别告警,单次显示重复性故障的告警,不显示短暂性故障的告警,从而减少了网络管理员定位故障的劳动量,提高了工作效率。     

基于PSO的属性选择方法

为了减少实例对属性选择的影响,本文提出了基于PSO的属性选择方法。该方法主要利用PSO算法求实例群的最优熵值,获得相应的属性阈值,并利用阈值确定属性的优先级,最后按优先级进行选择。在实验中,通过确定本体中概念属性的优先级来验证所提算法的性能。实验结果表明,该方法减少了对实例的依赖,计算量也相对减少。     

一种实用电子商务安全体系结构设计

电子商务的安全问题已经成为制约其发展的关键,为了提高电子商务的安全性,探讨了电子商务安全技术体系结构,揭示了各安全技术间的层次关系,创造性的提出了一种实用的电子商务安全体系,该体系基于技术手段,主要包括防火墙技术、对称加密技术、非对称加密技术、数字签名、身份认证等技术。从全局上把握了电子商务安全机制,并重点介绍了其中的核心技术。     

Solving a real-time allocation problem with constraint programming

In this paper, we present an original approach (CPRTA for “Constraint Programming for solving Real-Time Allocation”) based on constraint programming to solve a static allocation problem of hard real-time tasks. This problem consists in assigning periodic tasks to distributed processors in the context of fixed priority preemptive scheduling. CPRTA is built on dynamic constraint programming together with a learning method to find a feasible processor allocation under constraints. Two efficient new approaches are proposed and validated with experimental results. Moreover, CPRTA exhibits very interesting properties. It is complete (if a problem has no solution, the algorithm is able to prove it); it is non-parametric (it does not require specific tuning) thus allowing a large diversity of models to be easily considered. Finally, thanks to its capacity to explain failures, it offers attractive perspectives for guiding the architectural design process.     

Quasi-Upward Planarity

Abstract. An upward planar drawing of a directed graph (digraph) is a planar drawing such that all the edges are represented by curves monotonically increasing in the vertical direction. In this paper we introduce and study the concept of quasi-upward planarity. Quasi-upward planarity allows us to extend the upward planarity theory to a large class of digraphs including digraphs that also have directed cycles. First, we characterize the digraphs that have a quasi-upward planar drawing. Second, we give a polynomial time algorithm for computing ``optimal' quasi-upward planar drawings within a given planar embedding. Further, we apply branch and bound techniques to the problem of computing optimal quasi-upward planar drawings, considering all possible planar embeddings. The paper also contains experimental results about the proposed techniques.     

An ant colony optimization algorithm for DNA sequencing by hybridization

The reconstruction of DNA sequences from DNA fragments is one of the most challenging problems in computational biology. In recent years the specific problem of DNA sequencing by hybridization has attracted quite a lot of interest in the optimization community. Several metaheuristics such as tabu search and evolutionary algorithms have been applied to this problem. However, the performance of existing metaheuristics is often inferior to the performance of recently proposed constructive heuristics. On the basis of these new heuristics we develop an ant colony optimization algorithm for DNA sequencing by hybridization. An important feature of this algorithm is the implementation in a so-called multi-level framework. The computational results show that our algorithm is currently a state-of-the-art method for the tackled problem.     

Some problems of computer-aided testing and “interview-like tests”

Computer-based testing – is an effective teacher’s tool, intended to optimize course goals and assessment techniques in a comparatively short time. However, this is accomplished only if we deal with high-quality tests. It is strange, but despite the 100-year history of Testing Theory (see, Anastasi, A., Urbina, S. (1997). Psychological testing. Upper Saddle River, NJ: Prentice-Hall) there still exist some misconceptions. Modern wide-spread systems for computer based course management and testing reveal a set of problems corresponding to certain features of testing methods.     

协同设计环境中任务分解与调度的研究

在协同设计环境中,为了满足快速响应,低成本和高质量产品的设计需求,进一步提高产品的设计效率,提出了两级任务分解方法和双向选择优先的任务调度策略.借助计算机支持的协同设计技术,两级任务分解在协同设计联盟的抽象层次模型的基础上,采用了基于产品结构、特征服务和子任务目标属性的任务分解方法,从而降低了任务的复杂性.在此基础上,提出了双向选择优先的任务调度策略,以优化分布合作求解问题,并进行调度策略的仿真实验.仿真结果表明了该调度策略的优越性.