配电所微机自动化系统防雷概述

配电所微机综合自动化保护系统为电力系统安全可靠运行、故障快速处理提供了保障,为铁路通信、信号等设施的安全用电奠定了坚实基础,但雷击事件以其极高的电压幅值和不可预测性成为微机自动化系统的天敌,有效防止雷击,减少雷电干扰,成为影响配电所自动化系统安全运行的关键,本文对此进行了讨论。     

导致大学生英语阅读理解障碍的文化因素及教学对策研究

英语阅读水平的高低是衡量英语学习者语言综合水平的重要体现。在大学英语教学中，阅读理解是教学的重要活动。教师必须了解制约大学生英语阅读理解能力提高的各种因素，同时深入了解大学生学习的认知风格、学习动机、学习方法等。就导致大学生英语阅读理解障碍的文化因素进行分析研究，试图找出消除英语阅读理解障碍的途径及教学对策。     

我国举证时限制度的立法现状及几点建议

举证时限制度是最高人民法院《关于民事诉讼证据的若干规定》中重点解决的问题之一,这一制度的确立,标志着我国举证责任制度从证据随时提出主义到证据适时提出主义的转变。章对举证时限制度的含义、立法目的、立法现状及完善等进行了探讨。     

烹饪职业教育中学生全面素质的培养

职业教育是培养初中级技术人员、管理人员、技术工人和城乡各行各业熟练劳动者,提高全民族素质最直接、最有意义、最迅速的途径,是振兴当代经济的重要措施.烹饪职业学校应加强学生的技能训练,提高教学质量,培养具有全面素质的烹饪专业人才,以适应社会的需求.     

计算机程序设计教与学

计算机程序设计课程是高等院校计算机专业的专业必修课,但在编程的学习中,很少有学生觉得编程容易。本文通过对此问题的思考分析发现,存在诸多的影响因素。这其中有课程本身固有的一些因素,更与编程参与者的教与学的方式、经验、态度等密切相关。针对此问题,本文提出一些有效的教学手段与学习方法,并提出了课程建设的一些思路。     

A modal proof theory for final polynomial coalgebras

An infinitary proof theory is developed for modal logics whose models are coalgebras of polynomial functors on the category of sets. The canonical model method from modal logic is adapted to construct a final coalgebra for any polynomial functor. The states of this final coalgebra are certain “maximal” sets of formulas that have natural syntactic closure properties.

The syntax of these logics extends that of previously developed modal languages for polynomial coalgebras by adding formulas that express the “termination” of certain functions induced by transition paths. A completeness theorem is proven for the logic of functors which have the Lindenbaum property that every consistent set of formulas has a maximal extension. This property is shown to hold if the deducibility relation is generated by countably many inference rules.

A counter-example to completeness is also given. This is a polynomial functor that is not Lindenbaum: it has an uncountable set of formulas that is deductively consistent but has no maximal extension and is unsatisfiable, even though all of its countable subsets are satisfiable.     

An Integrated Approach to High Integrity Software Verification

Using automated reasoning techniques, we tackle the niche activity of proving that a program is free from run-time exceptions. Such a property is particularly valuable in high integrity software, for example, safety- or security-critical applications. The context for our work is the SPARK Approach for the development of high integrity software. The SPARK Approach provides a significant degree of automation in proving exception freedom. Where this automation fails, however, the programmer is burdened with the task of interactively constructing a proof and possibly also having to supply auxiliary program annotations. We minimize this burden by increasing the automation, through an integration of proof planning and a program analysis oracle. We advocate a ‘cooperative’ integration, where proof-failure analysis directly constrains the search for auxiliary program annotations. The approach has been successfully tested on industrial data.     

Integrating a SAT Solver with an LCF-style Theorem Prover

This paper describes the integration of a leading SAT solver with Isabelle/HOL, a popular interactive theorem prover. The SAT solver generates resolution-style proofs for (instances of) propositional tautologies. These proofs are verified by the theorem prover. The presented approach significantly improves Isabelle's performance on propositional problems, and furthermore exhibits counterexamples for unprovable conjectures.     

水速溶性聚乙烯醇包装膜的研究进展

介绍了由于聚乙烯醇具有活性羟基，通过改性使它具有水溶性和热熔性几种主要的技术及制膜方法，薄膜的性能测试，薄膜的表征，以及国外在这方面的研究动态和我国在这方面所做的工作。     

高等数学课程中的不等式的证明

不等式的证明是高等数学课程教学中的一个难点 ,研讨不等式的证明方法 ,对该课程中出现的不等式的证明方法 ,进行归纳 ,总结 ,对提高教学质量是很有意义的