快速更改多个文件日期的FoxBASE程序

本文从包装艺术的角度出发，论述了在一个软件包中统一各文件日期和时间的意义和作用。分析了ＤＯＳ．ＰＣｔｏｏｌｓ在修改多个文件日期和时间方面的不足。在发出ＰｏｘＢＡＳＥ的ＣＯＰＹ命令的一个特殊功能的基础上，提出了用数据库技术实现快速更改多个文件日期和时间的方法，并给出了一个实用的ＦｏｘＥＡＳＥ程序。     

多个窗口整合为多个标签窗口

对于我们这些工作狂人,开启多个窗口已是很平常的事了,但窗口一多操作很不方便,能不能把同类窗口合并到同一窗口,以标签方式显示,这样管理起     

同时最小化多个窗口

我们只要单击任务栏上的“显示桌面”按钮,就可以将所有的窗口最小化。如果我们想一次把多个窗口最小化(注:不是把所有的窗口都最小化),则可使用如下方法:1.按住Ctrl键不放,用鼠标左键在任务栏上连续单击我们想要最小化的窗口按钮。2.按住Ctrl键,在任意一个要最小化的窗口按钮上右击鼠标,则出现一个快捷菜单。3.在出现的快捷菜单上选择“最小化”命令。同理,我们也可以同时最大化多个窗口,只要在快捷菜单同时最小化多个窗口@飘扬     

多ES集成式决策支持系统的实现方法探讨

本文在文献［１］提出了多ＥＳ集成式决策支持系统（ＭＥＳＩＤＳＳ）的基本概念并对其总体结构设计进行探讨的基础上，从多领域知识库系统的组织方式、多ＥＳ动态合作的实现和系统的工作过程等方面对ＭＥＳＩＤＳＳ的实现方法做了探讨。     

用帧技术在WEB上实现多窗口

本文主要介绍在ＩＮＴＥＲＮＥＴ网的ＷＥＢ服务器上用帧技术实现多窗口的方法及其在ＨＴＭＬ语言中的应用。     

用ⅡS4.0在同一域上创建、发布多个WEB网站

个ＷＥＢ服务器上如果只能有一个站点,使用起来很不方便。有时几个人,每人一个站点要同时独立发布。有了ＩＩＳ４．０,就可以解决这个问题。方法一：在同一个ＩＰ地址上发布多个ＷＥＢ站点。１）启动ＭＭＣ,看到ＷＥＢ服务器上所有的站点。用鼠标有键单击要在同一ＩＰ上发布的站点,选择Ｐｒｏｐｅｒｔｉｅｓ项,“ＷｅｂＳｉｔｅ选项卡,出现这个站点的属性表;如图１：２）按下Ａｄｖａｎｃｅｄ按钮,可以看到如图２的对话框。在ＭｕｌｔｉｐｌｅＩｄｅｎｔｉｔｉｅｓＦｏｒＴｈｉｓＷｅｂＳｉｔｅ列表中有一条记录,选中后,激活Ｅｄ…     

SUPERBASE：一个CIM环境下面向对象的多数据库集成系统

ＳＵＰＥＲＢＡＳＥ是一个ＣＩＭ环境下面向对象的多数据库集成系统，其目标是有效地集成分布在多个已存在的自治和异构的局部数据库中的信息，以实现各系统间的信息共享。本文首先介绍了ＳＵＰＥＲＢＡＳＥ的体系结构、模式集成机制；然后讨论了全局数据库和局部数据库间的数据副本问题，提出了相应的解决方法；最后给出了集成数据模型ＩＤＭ和集成数据语言ＩＤＬ。     

用内存映射文件防止应用程序运行多个实例

防止应用程序运行多个实例的方法常用的有以下几种,可都有局限性。归纳如下: 1.查找窗口法,利用FindWindow函数查找同名的窗口,如找到则说明运行了多个实例。这种方法对于无窗口或窗口名动态变化的应用程序不适用,同时也无法防止因窗口名相同而程序其实不同的程序运行而发生的误判。 2.枚举进程法,通过对系统运行的进程的枚举,查找是否有同名进程,如有则说明运行了多个实例。这种方法不仅编程繁琐而且无法防止因进程名相同而程序其实不同的程序运行而发生的误判。     

基于知识的多专家决策支持系统

由于决策支持系统（ＤＳＳ）和专家系统（ＥＳ）的不同行为特征,使它们在信息处理中的决策和问题求解方面不能相互兼顾。本文交讨论和ＥＳ结合的可行性,提出一种基于知识的多专家决策支持系统的结构模式,及实现多专家协同求解和决策的方法。     

QQ也能多个文件一次发

《电脑迷》2005年9月上的《一次巧发多个文件》 一文介绍了如何在MSN中一次发送多个文件的方法,但该文 提到了在QQ聊天窗口中无法一次发送多个文件的情况。经 过笔者一番实践,发现那只是文件发送在QQ聊天窗口中受     

基于不变量的程序运行保护方法

程序不变量反映了程序在特定点上的安全属性,可以作为运行保护时的监控对象.提出了一种程序运行保护方法,通过动态监控程序不变量,保护程序安全运行.该方法根据检测出的程序不变量,配置程序保护策略.运行环境支持对程序插装保护代码,执行保护策略.实验表明方法是有效的且使用方便,保护带来的性能损失不大.     

Mixed computation: potential applications and problems for study

Mixed computation is processing of an incomplete information. Its product are a partially processed information and a so-called residual program destined to complete in sequel the processing of the remaining information. Many kinds of practical work with programs are nothing more but obtaining a residual program. We demonstrate, as an example, the application of mixed computation to compilation. Under computational approach mixed computation generalizes the operational semantics of a language by inclusion of steps which generate residual program instructions. Under transformational approach the residual program is obtained as a result of a series of so-called basic transformations of the program text. We argue that the transformational approach is more fundamental, for it allows to describe mixed computation in all its variety and moreover, to relate mixed computation to other kinds of program manipulation: execution, optimization, macroprocessing, synthesis. Such an integrated approach leads us to a transformational machine concept.     

Computer implementation of the constraint method

A computer program based on the constraint method approach to finite elements is described. The program permits the user to select arbitrarily polynomial orders for the various fields to be approximated. A set of nodal variables enforcing C¹ continuity for arbitrary polynomial order is presented, and those aspects of the program algorithm which differ from conventional finite element programs are described, including the numerical determination of a set of independent variables. An example is presented and the results obtained by the constraint method program compared with results from a conventional program. The constraint method approach is seen to be competitive with the conventional approach.     

Dynamic method for software test data generation

Test data generation in program testing is the process of identifying a set of test data which satisfies a given testing criterion. Existing pathwise test data generators proceed by selecting program paths that satisfy the selected criterion and then generating program inputs for these paths. One of the problems with this approach is that unfeasible paths are often selected; as a result, significant computational effort can be wasted in analysing those paths. In this paper, an approach to test data generation, referred to as a dynamic approach for test data generation, is presented. In this approach, the path selection stage is eliminated. Test data are derived based on the actual execution of the program under test and function minimization methods. The approach starts by executing a program for an arbitrary program input. During program execution for each executed branch, a search procedure decides whether the execution should continue through the current branch or an alternative branch should be taken. If an undesirable execution flow is observed at the current branch, then a real-valued function is associated with this branch, and function minimization search algorithms are used to locate values of input variables automatically, which will change the flow of execution at this branch.     

消息传递并行程序的弱变异测试及其转化

并行程序执行的不确定性,增加了测试的复杂性和难度.研究消息传递并行程序的变异测试,提出其弱变异测试转化方法,以提高该程序变异测试的效率.首先,根据消息传递并行程序包含语句的类型和语句变异之后导致的变化构建相应的变异条件语句;然后,将构建好的所有变异条件语句插入到原程序中,形成新的被测程序,从而将原程序的弱变异测试问题转化为新程序的分支覆盖问题.这样做的好处是,能够利用已有的分支覆盖方法解决变异测试问题.将该方法应用于8个典型的消息传递并行程序测试中,实验结果表明,该方法不但是可行的,也是必要的.     

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     

Ontological and Algebra-Algorithmic Tools for Automated Design of Parallel Programs for Cloud Platforms

An approach to the automated development of programs is proposed on the basis of ontological facilities and algebra-algorithmic tools for program design and synthesis. The approach is illustrated by examples of developing a parallel weather forecasting program and also a software application destined to run the developed program on a cloud computing platform.     

一种Java程序Chopping方法

程序Chopping对于程序理解、分析、调试、测试等具有重要的意义。已有的Chopping方法主要基于相互连接的系统依赖图(SDG),对于大程序这种SDG描述通常非常复杂,易导致程序Chopping结果不准确。针对这一问题,基于带标签的Java程序描述方法,提出一种Java程序Chopping方法。该方法利用这种描述附带的程序依赖信息,分析参数依赖关系,并在此基础上给出Chopping算法。此程序Chopping方法能把Java程序方法间的程序Chopping问题转换到Java程序方法内进行分析,程序依赖图具有结点少、可重用、可并发构造等优点。最后通过实例和实验给出程序Chopping方法的实施过程及有效性。     

One approach for an ergonomics program in a large manufacturing environment

This paper describes the approach the Boeing Company's Everett Division chose to take during development of their ergonomics program. The program covers both factory and office environments, but the approach used in each area is different. The goal of the program was to develop a systematic process efficiently utilizing the available resources. Lessons learned during the three years of this program are also discussed.     

Semantic similarity-based grading of student programs

An automatic grading approach is presented based on program semantic similarity. Automatic grading of a student program is achieved by calculating semantic similarities between the student program and each correct model program after they are standardized. This approach was implemented in an on-line examination system for the programming language C. Different form other existing approaches, it can evaluate how close a student’s source code is to a correct solution and give a matching accuracy.