MIS系统建设的一个新的切入点

ＣＳＣＷ和ＷＦＭＳ是计算机领域一个新的研究方向,用ＣＳＣＷ和ＷＦＭＳ方法去扩充ＭＩＳ系统,是ＭＩＳ系统建设的新的切入点。本语文探讨了用ＣＳＣＷ和ＷＦＭＳ方法扩充ＭＩＳ系统的可能性和实施策略。     

ANSI／ISO的SQL和Foxpro的SQL的差异

本文在对ＡＮＳＩ／ＩＳＯ的ＳＱＬ简要总结的基础上论述了ＡＮＳＩ／ＩＳＯ的ＳＱＬ和Ｆｏｘｐｒｏ的ＳＱＬ在功能、语法格式及使用规则方面的差异。     

浅析Windows95的自举与卸载

本文剖析了Ｗｉｎｄｏｗｓ９５的自举过程，指出Ｗｉｎｄｏｗｓ９５自举时不依于ＤＯＳ的实模式内核文件：ＭＳ－ＤＯＳ扣的ＩＯ．ＳＹＳ和 ＭＳＤＯＳ．ＳＹＳ，或者ＩＢＭＤＯＳ的ＩＢＭＢＩＯ．ＣＯＭ和ＩＢＭＤＯＳ．ＣＯＭ和ＩＢＭＤＯＳ．ＣＯＭ。     

空间决策支持系统通用软件工具的试验研究

空间决策支持系统是近年来在常规决策支持系统和地理信息系统结合的基础上，发展起来的一种新型的信息系统。在本文中，作者简要地论述了ＳＤＳＳ的技术特点及其与ＧＩＳ、专家系统的差异，ＳＤＳＳ通用软件工具的设计思想及其原系统的总体结构以及建立ＳＤＳＳ通用软件工具原型系统的关键技术问题及其解决办法。在开发ＳＤＳＳ通用软件工具的过程中，引入了应用框架生成及其实例化的概念，为ＳＤＳＳ的发展和应用开拓了一条有效的作     

SCSI协议的实现

ＳＣＳＩ命令是ＳＣＳＩ协议的具体实现,本文将介绍目前在ＰＣ平台上开发ＳＣＳＩ接口程序中最流行的一种方法ＡＳＰＩ,并且利用此方法,细致地阐述了在ＷＩＮＤＯＷＳ系列操作系统下实现 ＳＣＳＩ命令的实现过程和步骤。     

基于组件技术的DSS模型设计与实现

决策支持系统（ＤＳＳ）是模型驱动的,ＤＳＳ中模型的设计与实现是一个有待进一步研究的问题,该文把组件引入到ＤＳＳ模型的设计与实现中,提出基于组件技术的ＤＳＳ模型设计与实现策略,给出基于组件思想的ＤＳＳ模型定义和运算,并描述基于组件技术的ＤＳＳ基模型和复合模型的实现方法。     

执行支持系统ESS的设计与实现

本文论述一种支持企业高层领导决策活动的执行支持系统ＥＳＳ的必要性和理论依据，及其设计与实现。ＥＳＳ是ＤＳＳ发展的新领域。它能为高层决策者提供现有信息系统ＭＩＳ，ＤＳＳ所不所提供的功能支持。     

DBMS安全和OS安全间的关系

数据库系统和ＯＳ安全的需求有许多相似之处，但也有差别。这篇文章着重讨论安全数据库的安全责任分配：数据库安全取决于三方面即保密性、完整性和可用性，责任分配为ＤＢＭＳ、ＯＳ和应用程序，而且很大程度上取决于ＯＳ的安全机制。本文首先对ＤＢＭＳ和ＯＳ安全需求进行了对比分析，然后讨论ＯＳ可以为ＤＢＭＳ提供的安全服务，以及如何影响ＤＢＭＳ的安全机制。并且力求定义ＤＢＭＳ和ＯＳ安全管理间界面。     

基于Internet的地理信息系统（WebGIS）的研究和开发

本文分析了ＧＩＳ的最新发展技术ＷｅｂＧＩＳ技术的概念,并对传统的ＧＩＳ技术和ＷｅｂＧＩＳ进行了比较,通过剖析ＧＩＳ的体系结构模型,探讨了开发ＷｅｂＧＩＳ的关键技术和ＷｅｂＧＩＳ系统的整体开发方案。     

浅谈以Intranet为支撑环境的MIS和DSS的组建

随着Ｉｎｔｒａｎｅｔ概念的日趋完善和推广应用的日益普及，不仅使管理信息系统和决策支持系统的内容得到很大的丰富和发展，而且还提出了许多极富挑战性的问题。本文重点探讨了新型ＭＩＳ和ＤＳＳ的体系结构，同时也简要阐述了ＭＩＳ和ＤＳＳ的开发方法以及在开如应该特别注意的一些问题。     

Multiple Objective Optimization Problems in Statistics

Many statistical problems can be viewed as optimization problems. A careful and detailed analysis of these procedures reveals that many of these problems are essentially multiple objective optimization problems. Furthermore, most of the standard statistical procedures aim at finding an efficient (non-dominated) solution. Our objective in this paper is to introduce some of the single sample statistical problems that can be formulated and solved as multiple objective optimization problems.     

决策问题结构的形式化研究

运用分形理论研究决策问题结构，对决策问题进行形式化描述，定义其结构函数和结构指数，并将决策问题从定性上分为良好结构、未结构化和纯不良结构。给出了关于决策问题结构的几个定理，讨论了决策问题结构化的测度，提出了决策问题简化的判据。     

A survey of problems,solution techniques,and future challenges in scheduling semiconductor manufacturing operations

In this paper, we discuss scheduling problems in semiconductor manufacturing. Starting from describing the manufacturing process, we identify typical scheduling problems found in semiconductor manufacturing systems. We describe batch scheduling problems, parallel machine scheduling problems, job shop scheduling problems, scheduling problems with auxiliary resources, multiple orders per job scheduling problems, and scheduling problems related to cluster tools. We also present important solution techniques that are used to solve these scheduling problems by means of specific examples, and report on known implementations. Finally, we summarize some of the challenges in scheduling semiconductor manufacturing operations.     

Suboptimal control of singularly perturbed systems and periodicoptimization

A traditional approach to singularly perturbed optimal control problems is based on an approximation of these problems by reduced problems which are obtained via the formal replacement of the fast variables by the states of equilibrium of the fast subsystems considered with frozen slow variables and controls. It is shown that such an approximation is valid if and only if certain families of periodic optimization problems admit steady state solutions. It is also shown how the solutions of these problems can be used to construct suboptimal controls for singularly perturbed problems when approximation by reduced problems is not possible     

A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results

A very close relationship between the compaction, retraction, and constraint satisfaction problems has been established earlier providing evidence that it is likely to be difficult to give a complete computational complexity classification of the compaction and retraction problems for reflexive or bipartite graphs. In this paper, we give a complete computational complexity classification of the compaction and retraction problems for all graphs (including partially reflexive graphs) with four or fewer vertices. The complexity classification of both the compaction and retraction problems is found to be the same for each of these graphs. This relates to a long-standing open problem concerning the equivalence of the compaction and retraction problems. The study of the compaction and retraction problems for graphs with at most four vertices has a special interest as it covers a popular open problem in relation to the general open problem. We also give complexity results for some general graphs. The compaction and retraction problems are special graph colouring problems, and can also be viewed as partition problems with certain properties. We describe some practical applications also.     

Disjunctive optimization,max-separable problems and extremal algebras

The paper was motivated by solution methods suggested in the literature for solving linear optimization problems over (max,+)- or (max,min)-algebras and certain class of so called max-separable optimization problems. General features of these optimization problems, which play a crucial role in the optimization methods were used to formulate a general class of optimization problems with disjunctive constraints and a max-separable objective function and suggest a solution procedure for solving such problems. Linear problems over (max,+)-algebras and the max-separable problems are contained in this general class of optimization problems as special cases.     

A comparison of usability evaluation methods for evaluating e-commerce websites

The importance of evaluating the usability of e-commerce websites is well recognised. User testing and heuristic evaluation methods are commonly used to evaluate the usability of such sites, but just how effective are these for identifying specific problems? This article describes an evaluation of these methods by comparing the number, severity and type of usability problems identified by each one. The cost of employing these methods is also considered. The findings highlight the number and severity level of 44 specific usability problem areas which were uniquely identified by either user testing or heuristic evaluation methods, common problems that were identified by both methods, and problems that were missed by each method. The results show that user testing uniquely identified major problems related to four specific areas and minor problems related to one area. Conversely, the heuristic evaluation uniquely identified minor problems in eight specific areas and major problems in three areas.     

约束分解技术回顾与展望

约束满足问题是一个强有力的知识表示框架,可以有效地解决许多问题。由于约束满足问题一般情况下是NP难度的问题,因此通过约束分解来降低计算的开销具有十分重要的意义。主要描述约束分解在约束满足问题中的地位、经典的分解技术和约束分解技术的发展历史,然后简要地分析这些分解技术。介绍了关于约束分解研究的最新状况,并描述、分析和总结其主要求解思想。最后根据存在的问题与不足提出了下一步的工作方向和研究思路。     

Logspace Optimization Problems and Their Approximability Properties

Logspace optimization problems are the logspace analogues of the well-studied polynomial-time optimization problems. Similarly to them, logspace optimization problems can have vastly different approximation properties even though their underlying decision problems have the same computational complexity. Natural problems - including the shortest path problems for directed graphs, undirected graphs, tournaments, and forests - exhibit such a varying complexity. In order to study the approximability of logspace optimization problems in a systematic way, polynomial-time approximation classes and polynomial-time reductions between optimization problems are transferred to logarithmic space. It is proved that natural problems are complete for different logspace approximation classes. This is used to show that under the assumption L ≠ NL some logspace optimization problems cannot be approximated with a constant ratio; some can be approximated with a constant ratio, but do not permit a logspace approximation scheme; and some have a logspace approximation scheme, but optimal solutions cannot be computed in logarithmic space.     

Application of vanishing variable methods to special structured transportation problems

Methods of determining vanishing variables in transportation problems have appeared in a literature published by Intrator and Lev [4]. This paper implements the theorems to special structured transportation problems in general, and tridiagonal transportation problems in particular. New rules are developed for reducing the amount of computations required for solving tridiagonal transportation problems. The rules will result in assigning optimal values to the variables (the values are often zero) and even decomposition of large problems into smaller sub problems.