Nonnegative integral subset representations of integer sets

We consider an integer-subset representation problem motivated by a medical application in radiation therapy. We prove NP-completeness, derive nontrivial bounds, and report on the performance of a greedy heuristic.     

Information cut for clustering using a gradient descent approach

We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between probability density functions. We propose to optimize the Information Cut using a gradient descent-based approach. Our algorithm has several advantages compared to many other graph-based methods in terms of determining an appropriate affinity measure, computational complexity, memory requirements and coping with different data scales. We show that our method may produce clustering and image segmentation results comparable or better than the state-of-the art graph-based methods.     

A method for the efficient prioritization of infrastructure renewal projects

The infrastructure renewal program at MIT consists of a large number of projects with an estimated budget that could approach $1 billion. Infrastructure renewal at the Massachusetts Institute of Technology (MIT) is the process of evaluating and investing in the maintenance of facility systems and basic structure to preserve existing campus buildings. The selection and prioritization of projects must be addressed with a systematic method for the optimal allocation of funds and other resources. This paper presents a case study of a prioritization method utilizing multi-attribute utility theory. This method was developed at MIT's Department of Nuclear Engineering and was deployed by the Department of Facilities after appropriate modifications were implemented to address the idiosyncrasies of infrastructure renewal projects and the competing criteria and constraints that influence the judgment of the decision-makers. Such criteria include minimization of risk, optimization of economic impact, and coordination with academic policies, programs, and operations of the Institute. A brief overview of the method is presented, as well as the results of its application to the prioritization of infrastructure renewal projects. Results of workshops held at MIT with the participation of stakeholders demonstrate the feasibility of the prioritization method and the usefulness of this approach.     

啮合型同向旋转双螺杆挤出螺槽非充满的熔融理论研究 Ⅱ.模型的求解

根据啮合型同向旋转双螺杆挤出非充满熔融的理论模型，对描述非充满熔融过程的主要物理量：固相高度变化函数、熔融速率及熔融区总长等进行了计算分析，并对有关影响因素进行了讨论。     

THE APPLICATION OF COKELET''''S WAVE THEORY IN THE CALCULATION OF WAVE-CURRENT FIELD

By using Cokelet's wave theory,the limiting wave height and the relative waveangular frequency in wave-current field were calculated in this paper.It is indicated by numeri-cal calculation that if the water depth is not too small,the result given by authors'calculationare very close to the results of limiting wave height by Dalrymple(1975)and to the data of rel-ative wave angular frequency by linear wave theory;but if water depth is rather small,thereare some discrepancy,     

压水堆核电厂用全自动多螺栓四同步安装机的结构创新研究

首先在结构上创造了新型螺栓、螺母和一套崭新的安装机。在主机上去掉了精密、复杂、昂贵的机器人或机械手，改用结构简单的集成齿轮机构，以实现同步旋拧功能；运用现代流体传动与控制的理论，建立流本控制的数学模型和传递函数，从而实现了4个同步安装的效果。     

A New Approach to Abstract Syntax with Variable Binding

The permutation model of set theory with atoms (FM-sets), devised by Fraenkel and Mostowski in the 1930s, supports notions of ‘name-abstraction’ and ‘fresh name’ that provide a new way to represent, compute with, and reason about the syntax of formal systems involving variable-binding operations. Inductively defined FM-sets involving the name-abstraction set former (together with Cartesian product and disjoint union) can correctly encode syntax modulo renaming of bound variables. In this way, the standard theory of algebraic data types can be extended to encompass signatures involving binding operators. In particular, there is an associated notion of structural recursion for defining syntax-manipulating functions (such as capture avoiding substitution, set of free variables, etc.) and a notion of proof by structural induction, both of which remain pleasingly close to informal practice in computer science. Received October 2000 / Accepted in revised form April 2001     

由有穷自动机构造正则表达式的新算法

本文借助图论的理论，通过识别回路和不包含回路的由起始状态到终止状态的路径的方法，提出一种构造给定有穷自动机对应的正则表达式的新算法，并给出具体实例。     

A remark on bilinear systems and moduli spaces of instantons

Explicit equations are given for the moduli space of framed instantons as a quasi-affine variety, based on the representation theory of noncommutative power series, or equivalently, the minimal realization theory of bilinear systems.