自动化控制课程教法新探

自动控制是自动化专业的一门专业基础课,涵盖了诸多通识课程的知识,然而当前校内的自动化控制课程教学方法相对陈旧、落后,与技术前沿与工业实践严重脱节。为了解决这个问题,本文首先梳理了自动化控制课程的诸多现存问题,进而深入论述与分析了加速教学改革,强化实践环节的具体方法,具有较高的创新性与可实践性。     

基于VBA的高级工考试自动评分研究

计算机系统管理员的高级工考试是一项资格认证考试,与之相适应需要一项自动的评分系统.其中选择题的自动评分已经实现,而操作题需要手工阅卷.为了实现对操作题的答题结果自动评分,采用VBA技术分析考生的操作结果,可以实现自动阅卷且准确性高.     

建筑工程计算机辅助招投标系统研究与设计

基于实践,详细分析建筑工程招投标的流程及其安全性需求,设计并实现一种安全高效的建筑工程计算机辅助招投标系统。针对该系统的安全保密要求,提出和解决系统的安全体系设计问题,保证招标信息在传输和存储过程中的完整性和机密性。此外,针对在Delphi平台上开发此系统时遇到的若干特殊功能需求,提供其解决思路与解决方案。     

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

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

基于图像分块的二维投影特征提取能力研究

人脸识别研究的主要目的是提高识别率,关键技术在于提取有效的人脸特征。提出了分块多投影和分块双向多投影二维特征提取方法。分块多投影特征提取方法,针对现有分块单投影特征提取方法中每一子图均采用相同投影矩阵,而对人脸局部信息不加以区别,利用二维主成分分析方法,构造了分块多投影矩阵,使不同的子图投影到不同的子空间,与传统二维主成分方法和分块单投影方法相比,有效地利用人脸局部信息,降低了特征维数,提高了识别率,在ORL人脸库上实验表明了其有效性。     

基于SOA的科技项目管理系统平台的研究

为了实现可动态重构、能快速适应业务需求变化的科技项目管理系统,论文在分析面向服务架构(SOA)的思想和科技项目管理领域需求的基础上,提出了基于面向服务架构的科技项目管理系统平台的设计框架,该框架主要包含了可重用的服务仓库和业务流程服务集成引擎。论文详细阐述框架中主要构件模块和业务流程服务引擎。通过项目实践表明,在该框架指导下能有效解决目前科技项目管理系统中存在的问题。     

A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements

We introduce a simple, linear time algorithm for recognizing trivially perfect (TP) graphs. It improves upon the algorithm of Yan et al. [J.-H. Yan, J.-J. Chen, G.J. Chang, Quasi-threshold graphs, Discrete Appl. Math. 69 (3) (1996) 247–255] in that it is certifying, producing a P₄ or a C₄ when the graph is not TP. In addition, our algorithm can be easily modified to recognize the complement of TP graphs (co-TP) in linear time as well. It is based on lexicographic BFS, and in particular the technique of partition refinement, which has been used in the recognition of many other graph classes [D.G. Corneil, Lexicographic breadth first search—a survey, in: WG 2004, in: Lecture Notes in Comput. Sci., vol. 3353, Springer, 2004, pp. 1–19].     

Rigidity of a simple extended lower triangular matrix

For the all-ones lower triangular matrices, the upper and lower bounds on rigidity are known to match [P. Pudlak, Z. Vavrin, Computation of rigidity of order n²/r for one simple matrix, Comment Math. Univ. Carolin. 32 (2) (1991) 213-218]. In this short note, we apply these techniques to the all-ones extended lower triangular matrices, to obtain upper and lower bounds with a small gap between the two; we show that the rigidity is .     

A new vertex result for robustness problems with interval matrix uncertainty

This paper¹ addresses a family of robustness problems in which the system under consideration is affected by interval matrix uncertainty. The main contribution of the paper is a new vertex result that drastically reduces the number of extreme realizations required to check robust feasibility. This vertex result allows one to solve, in a deterministic way and without introducing conservatism, the corresponding robustness problem for small and medium size problems. For example, consider quadratic stability of an autonomous n_x dimensional system. In this case, instead of checking vertices, we show that it suffices to check 2^2n_x specially constructed systems. This solution is still exponential, but this is not surprising because the problem is NP-hard. Finally, vertex extensions to multiaffine interval families and some sufficient conditions (in LMI form) for robust feasibility are presented. Some illustrative examples are also given.     

A multiperiod set covering location model for dynamic redeployment of ambulances

Emergency medical service (EMS) providers continually seek ways to improve system performance particularly the response time to incidents. The demand for ambulances fluctuate throughout the week, depending on the day of week, and even the time of day, therefore EMS operators can improve system performance by dynamic relocation/redeployment of ambulances in response to fluctuating demand patters. The objective of the model is to determine the minimum number of ambulances and their locations for each time cluster in which significant changes in demand pattern occur while meeting coverage requirement with a predetermined reliability. The model is further enhanced by calculating ambulance specific busy probabilities and validated by a comprehensive simulation model. Computational results on experimental data sets and data from an EMS agency are provided.