图书馆服务质量评价模型研究

图书馆服务质量是不同属性的综合体,它包括许多很难被测量的不可感知属性,这种特性给被测者在接受问卷调查时带来了一些困难.为了避免上述情况出现,在分析了图书馆服务质量综合评价中现存主要问题和影响因素的基础上,建立了基于灰色局势决策的模糊多属性决策模型,将灰色系统和模糊集理论引入定性指标值的测度中,得到了满意的结果.     

基于C/S和B/S模式的高校基建项目管理信息系统的设计与实现

通过结合华中科技大学基建与后勤管理处MIS系统的开发实例,提出了建立高校基建后勤管理信息系统建设的必要性和可能性,并给出了系统的整体结构和主要功能,最后分析了系统实现过程中的一些问题.     

Web环境下IT招标项目风险评价决策支持系统研究

分析了IT招标项目的基本风险特征,并针对因IT招标项目中风险因素多、不确定性大而导致复杂的复合决策问题,在传统决策支持系统的基础上设计了综合推理方式的.NET架构下Web环境IT项目风险评价决策支持系统,分析了系统的功能、特点和设计方法,详细讨论了系统的结构,并给出系统运作过程和实现方法.     

The Center Location Improvement Problem Under the Hamming Distance

In this paper, we consider the center location improvement problems under the sum-type and bottleneck-type Hamming distance. For the sum-type problem, we show that achieving an algorithm with a worst-case ratio of O(log |V|) is NP-hard, and for the bottleneck-type problem, we present a strongly polynomial algorithm.     

Total completion time minimization in online hierarchical scheduling of unit-size jobs

This paper investigates an online hierarchical scheduling problem on m parallel identical machines. Our goal is to minimize the total completion time of all jobs. Each job has a unit processing time and a hierarchy. The job with a lower hierarchy can only be processed on the first machine and the job with a higher hierarchy can be processed on any one of m machines. We first show that the lower bound of this problem is at least \(1+\min \{\frac{1}{m}, \max \{\frac{2}{\lceil x\rceil +\frac{x}{\lceil x\rceil }+3}, \frac{2}{\lfloor x\rfloor +\frac{x}{\lfloor x\rfloor }+3}\}\), where \(x=\sqrt{2m+4}\). We then present a greedy algorithm with tight competitive ratio of \(1+\frac{2(m-1)}{m(\sqrt{4m-3}+1)}\). The competitive ratio is obtained in a way of analyzing the structure of the instance in the worst case, which is different from the most common method of competitive analysis. In particular, when \(m=2\), we propose an optimal online algorithm with competitive ratio of \(16\) \(/\) \(13\), which complements the previous result which provided an asymptotically optimal algorithm with competitive ratio of 1.1573 for the case where the number of jobs n is infinite, i.e., \(n\rightarrow \infty \).     

Characterizations of <Emphasis Type="Italic">k</Emphasis>-cutwidth critical trees

The cutwidth problem for a graph G is to embed G into a path such that the maximum number of overlap edges (i.e., the congestion) is minimized. The investigations of critical graphs and their structures are meaningful in the study of a graph-theoretic parameters. We study the structures of k-cutwidth \((k>1)\) critical trees, and use them to characterize the set of all 4-cutwidth critical trees.     

Three‐Stage Decision‐Making Model under Restricted Conditions for Emergency Response to Ships Not under Control

A ship that is not under control (NUC) is a typical incident that poses serious problems when in confined waters close to shore. The emergency response to NUC ships is to select the best risk control options, which is a challenge in restricted conditions (e.g., time limitation, resource constraint, and information asymmetry), particularly in inland waterway transportation. To enable a quick and effective response, this article develops a three‐stage decision‐making framework for NUC ship handling. The core of this method is (1) to propose feasible options for each involved entity (e.g., maritime safety administration, NUC ship, and ships passing by) under resource constraint in the first stage, (2) to select the most feasible options by comparing the similarity of the new case and existing cases in the second stage, and (3) to make decisions considering the cooperation between the involved organizations by using a developed Bayesian network in the third stage. Consequently, this work provides a useful tool to achieve well‐organized management of NUC ships.