基于中介真值度量的模糊综合评判

中介逻辑是一种以清晰的和模糊的事物为研究对象的非经典逻辑系统。基于中介逻辑与距离测度,以中介真值程度函数为工具,建立了模糊评判矩阵,并综合评判因素中肯定信息与否定信息的真值程度确立评判指数,进而以评判指数作为总体评判的数量依据,对评判对象进行比较,从而建立了一种新的模糊评判模型;并讨论了它在一个具体的模糊评判实例中的应用。     

改革主观题的评判方法，使程序设计回归真实

程序设计中的主观题自动评判历来是一个难题,我们提出了一个全新的程序设计主观题自动评判方案,并完成了系统的设计开发。本文则较为详细地给出了改革的主导思想、系统的功能和使用效果。     

基于关系代数的模糊综合评判算法的研究和实现

模糊综合评判有着广泛的实际应用背景。关系代数是数据库技术的一个非常重要的理论基础,SQL语言是关系代数在数据库技术中的表现形式。把关系代数与模糊综合评判结合起来,有着重要的实践意义。基于关系代数的RFCE就是关系代数与模糊综合评判结合的结晶。     

多级模糊综合评判通用程序

提供一个用PoxPro for Windows编写的多级模糊综合评判通用程序,适用于任意级别的评判问题。     

多级模糊综合评判通用程序

提供一个用FoxProforWindows编写的多级模糊综合评判通用程序,适用于任意级别的评判问题.     

模型试验方案的计算机模糊评判与选择

模型试验方案的最优选择是一件很复杂的工作,但如果将模糊评判和计算选择相结合,则可大大加速方案的选择,本文从一个简化的模型试验实例出发,详细论述了如何用计算机模糊评判方法选择出最优方案,为其它方案的选择提供一个范例.     

基于模糊理论的安全控制测评模型的研究*

提出了一种综合运用层次分析法和模糊综合评判法来定量评判和分析测评数据的方法,解决了受主观影响的不确定性问题,并建立了相应的评判模型。最后通过一个应用实例验证了模糊综合安全控制测评模型的合理性和科学性。     

多目标多级模糊综合评判在教学评估上的应用

教师教学评估是高等院校教学质量管理的重要环节,对提高课堂教学质量具有积极意义和重要作用。教师教学评估是一个多目标、多层次的模糊综合评判问题,在模糊综合评判中将有关的模糊概念用模糊集合表示,通过模糊运算获得用模糊集合表示的评价结果。针对教学评估体系输入和输出之间的复杂关系,在介绍了模糊变换的基础上,提出了适用于教师教学评估的多目标多级模糊综合评判模型,且用实例进行了说明。     

模糊综合评判开发工具的设计与实现

以图论、数理逻辑和关系数学理论为指导,结合模糊数学理论,研制开发了一个基于树和最小生成树算法的多级模糊综合评判开发工具。旨在帮助各专业工程师设计、建立和调试模糊综合评判模块或模糊综合评判软件,提高软件系统的设计效率,缩短软件系统的研究周期,降低软件系统的开发成本。     

多目标多级模糊综合评判在教学评估上的应用

教师教学评估是高等院校教学质量管理的重要环节,对提高课堂教学质量具有积极意义和重要作用.教师教学评估是一个多目标、多层次的模糊综合评判问题,在模糊综合评判中将有关的模糊概念用模糊集合表示,通过模糊运算获得用模糊集合表示的评价结果.针对教学评估体系输入和输出之间的复杂关系,在介绍了模糊变换的基础上,提出了适用于教师教学评估的多目标多级模糊综合评判模型,且用实例进行了说明.     

A data-directed approach to program construction

The present paper discusses a method of program construction based on the specification of the data types. The input and output data types and the mapping between them are specified at a high level of abstraction and this non-procedural specification is used to develop a program schema. The data type and mapping specifications are modified to include a concrete representation of the data and these are used to expand the program schema into a program. A graphical representation for data and program specifications is also introduced and it is shown how this can simplify the techniques and be very useful in program construction. The method is illustrated by developing two programs—the line justifier program described by Gries and the bubblesort.     

用Petri网分析串行程序的并行性

为把串行程序转换为并行程序,最重要且最基本的工作是数据相关性分析,而数据相关性分析主要的内容之一是循环程序中数据组元素间的数据相关性分析。传统的分析方法是通过数组的下标进行分析计算,但这种计算每次只是对两个语句间的相关性作出结论,而无法知道是否有第三个或更多的语句在这同一数据处相关,从而很难确定这两个语句是否可以并行。将Petri网用于数据相关性分析理论中,可以从全局的观点分析出同一数据处所有语句的相关性,从而可以提出将串行程序转换为并行程序的有效方法。     

带有异常结构程序的数据流分析

以数据流分析为基础的程序理解是软件工程重要研究领域之一。现在大多数的程序设计语言提供了异常处理机制,但程序中的异常结构会影响数据流分析。如果不考虑这种影响,把得到的数据流分析信息用于程序理解中,会产生严重的后果。文中以Java语言程序为例,提出了一种数据流分析方法,该方法充分考虑了异常结构对数据流分析的影响,从而保证数据流分析信息的正确性与准确性。     

一种基于文件传输路径的分布式程序实时性评估方法

首先根据分布式系统实时性评估的基本思想，结合分布式程序执行的特点，对分布式程序的实时性评估进行理论分析．然后．根据分布式程序在系统中所处的位置、程序执行时所需的数据文件和数据文件的传输路径，确定每个数据文件的最小传输时间和最大传输时间．在此基础上，计算出程序的最早响应时间和最迟响应时间，从而形成一种基于文件传输路径的分布式程序实时性评估方法、通过实例评估和模拟分析，说明了这种评估方法是有效性的．     

Excel中基于VBA的嵌入式"化工实验数据处理"自定义程序

由VBA创建的嵌入式"化工实验数据处理"自定义程序,是一个跨Microsoft Office各应用程序的联合解决方案,嵌入Microsoft Office的Excel中,利用Excel应用程序的自动计算功能和图表功能,使化工实验数据的转换与处理、自动导入与自动输出等过程,在常用办公软件中得以实现,实用且给人以启迪。     

Program complexity using Hierarchical Abstract Computers

A model of program complexity is introduced which combines structural control flow measures with data flow measures. This complexity measure is based upon the prime program decomposition of a program written for a Hierarchical Abstract Computer. It is shown that this measure is consistent with the ideas of information hiding and data abstraction. Because this measure is sensitive to the linear form of a program, it can be used to measure different concrete representations of the same algorithm, as in a structured and an unstructured version of the same program. Application of the measure as a model of system complexity is given for “upstream” processes (e.g. specification and design phases) where there is no source program to measure by other techniques.     

一种用于测试数据生成的动态程序切片算法

介绍了程序切片技术的基本概念，提出了一种基于前向分析的动态程序切片算法，探讨了程序切片在软件测试数据生成中的应用，结果表明可以有效地提高基于路径的测试数据生成效率。     

Improving effective bandwidth through compiler enhancement of global cache reuse

The performance of modern machines is increasingly limited by insufficient memory bandwidth. One way to alleviate this bandwidth limitation for a given program is to minimize the aggregate data volume the program transfers from memory. In this article we present compiler strategies for accomplishing this minimization. Following a discussion of the underlying causes of bandwidth limitations, we present a two-step strategy to exploit global cache reuse—the temporal reuse across the whole program and the spatial reuse across the entire data set used in that program. In the first step, we fuse computation on the same data using a technique called reuse-based loop fusion to integrate loops with different control structures. We prove that optimal fusion for bandwidth is NP-hard and we explore the limitations of computation fusion using perfect program information. In the second step, we group data used by the same computation through the technique of affinity-based data regrouping, which intermixes the storage assignments of program data elements at different granularities. We show that the method is compile-time optimal and can be used on array and structure data. We prove that two extensions—partial and dynamic data regrouping—are NP-hard problems. Finally, we describe our compiler implementation and experiments demonstrating that the new global strategy, on average, reduces memory traffic by over 40% and improves execution speed by over 60% on two high-end workstations.     

Automated software test data generation

An alternative approach to test-data generation based on actual execution of the program under test, function-minimization methods and dynamic data-flow analysis is presented. Test data are developed for the program using actual values of input variables. When the program is executed, the program execution flow is monitored. If during program execution an undesirable execution flow is observed then function-minimization search algorithms are used to automatically locate the values of input variables for which the selected path is traversed. In addition, dynamic data-flow analysis is used to determine those input variables responsible for the undesirable program behavior, significantly increasing the speed of the search process. The approach to generating test data is then extended to programs with dynamic data structures and a search method based on dynamic data-flow analysis and backtracking is presented. In the approach described, values of array indexes and pointers are known at each step of program execution; this information is used to overcome difficulties of array and pointer handling     

An exercise in program design using SIMULA class invariants

The concept of an invariant assertion has been shown by Hoare to be central to the problem of proving correctness of data representation in a program. A consequent approach for program design is to establish the parts of an overall invariant which characterize the components of the design. In this way it is feasible to synthesize a verified program. There is a gulf between verification theory and practical reality in this area, but the SIMULA class concept is close to the data representation technique required for such an approach. Some of the benefits and problems of this approach to design have been explored by the development of a SIMULA program to simulate a bounded delay resource allocation strategy in a job scheduling environment.