On problem transformability in VLSI

The two basic performance parameters that capture the complexity of any VLSI chip are the area of the chip,A, and the computation time,T. A systematic approach for establishing lower bounds onA is presented. This approach relatesA to the bisection flow, . A theory of problem transformation based on , which captures bothAT ² andA complexity, is developed. A fundamental problem, namely, element uniqueness, is chosen as a computational prototype. It is shown under general input/output protocol assumptions that any chip that decides ifn elements (each with (1+)lognbits) are unique must have =(nlogn), and thus, AT²=(n ²log² n), andA= (nlogn). A theory of VLSI transformability reveals the inherentAT ² andA complexity of a large class of related problems.This work was supported in part by the Semiconductor Research Corporation under contract RSCH 84-06-049-6.     

关于中国加入WTO后影视高等教育体系的构想

关于中国加入WTO以后,如何适应新的形势和面对新的竞争,从而构建新的影视高等教育体系?本文从以下三个方面进行了论述:21世纪是彩色读图时代,影视知识技术是人才所必备的三大基本知识技术之一;中国的影视教育必须构建学历教育、职业技能教育和成人继续教育相结合的国民教育体系以及四合一的教育教学模式和产学研相结合的人才培养体制及其运行机制。     

Efficient multiple-precision integer division algorithm

Design and implementation of division algorithm is one of the most complicated problems in multi-precision arithmetic. Huang et al. [1] proposed an efficient multi-precision integer division algorithm, and experimentally showed that it is about three times faster than the most popular algorithms proposed by Knuth [2] and Smith [3]. This paper reports a bug in the algorithm of Huang et al. [1], and suggests the necessary corrections. The theoretical correctness proof of the proposed algorithm is also given. The resulting algorithm remains as fast as that of [1].     

Optimum sweeps of simple polygons with two guards

A polygon P admits a sweep if two mobile guards can detect an unpredictable, moving target inside P  , no matter how fast the target moves. Two guards move on the polygon boundary and are required to always be mutually visible. The objective of this study is to find an optimum sweep such that the sum of the distances travelled by the two guards in the sweep is minimized. We present an O(n²)$O(n^2)$ time and O(n)$O(n)$ space algorithm for optimizing this metric, where n   is the number of vertices of the given polygon. Our result is obtained by reducing this problem to finding a shortest path between two nodes in a graph of size O(n)$O(n)$.     

Human interaction with policy flight simulators

Policy flight simulators are designed for the purpose of exploring alternative management policies at levels ranging from individual organizations to national strategy. This article focuses on how such simulators are developed and on the nature of how people interact with these simulators. These interactions almost always involve groups of people rather than individuals, often with different stakeholders in conflict about priorities and courses of action. The ways in which these interactions are framed and conducted are discussed, as well as the nature of typical results.     

计算思维影响下的应用型本科计算机基础教学改革探索

当前以计算思维能力培养为切入点的大学计算机课程改革工作已进入一个新的阶段,如何改革计算机基础教学以适应当前形势的发展,是计算机基础教学面临的挑战。以计算思维为导向,对应用型本科院校大学计算机基础课程的目标定位、教学内容、教学过程等教学环节作改革式探索。     

计算思维导向的计算机程序设计课程教学改革研究

根据程序设计类课程与计算思维之间的内在联系,提出以“案例教学、趣味教学、微课堂”为根本的教学改革,阐述如何在新的人才培养模式下构建教学方法,即通过优化教学内容、创新实践方法等一系列举措,将程序设计的思想与方法转化为学生的创新精神和创新能力。     

On the complexity of role updating feasibility problem in RBAC

In Role Based Access Control (RBAC) systems, it is necessary and important to update the role–permission assignments in order to reflect the evolutions of the system transactions. However, role updating is generally complex and challenging, especially for large-scale RBAC systems. This is because the resulting state is usually expected to meet various requirements and constraints. In this paper, we focus on a fundamental problem of role updating in RBAC, which determines whether there exists a valid role–permission assignment, i.e., whether it can satisfy all the requirements of the role updating and without violating any role–capacity or permission–capacity constraint. We formally define such a problem as the Role Updating Feasibility Problem (RUFP), and study the computational complexity of RUFP in different subcases. Our results show that although several subcases are solvable in linear time, this problem is NP-complete in the general case.     

Holographic algorithms on bases of rank 2

An essential problem in the design of holographic algorithms is to decide whether the required signatures can be realized under a suitable basis transformation (SRP). For holographic algorithms with matchgates on domain size 2, , ,  and  have built a systematical theory. In this paper, we reduce SRP on domain size k≥3$k\ge 3$ to SRP on domain size 2 for holographic algorithms with matchgates on bases of rank 2. Furthermore, we generalize the collapse theorem of [3] to domain size k≥3$k\ge 3$.