Modern computer server systems are increasingly managed at a low level by baseboard management controllers (BMCs). BMCs processors with access to the most critical parts of platform, below OS or hypervisor, including control over power delivery every system component. Buggy poorly designed BMC software not only poses security threat machine, it can permanently render hardware inoperative. Despi...

This article considers the computational complexity of automatically deter mining assembly sequences for mechanical products Speci cally we address the partitioning problem given an assembly of rigid parts identify a proper subassembly that can be removed as a rigid object without disturbing the rest of the assembly We examine the complexity of the partitioning problem un der various types of r...

We analyze the structure of the state space of chess by means of transition path sampling Monte Carlo simulation. Based on the typical number of moves required to transpose a given configuration of chess pieces into another, we conclude that the state space consists of several pockets between which transitions are rare. Skilled players explore an even smaller subset of positions that populate s...

The concept of genome sequencing is quite simple. Break your genome up into many different small fragments, clone those fragments into a cloning vector, isolate many clones, and sequence each clone. All of the techniques used for sequencing are well established. These are the same techniques that scientists used for the past twenty years to characterize many different individual genes. Using th...

This paper considers the problem of scheduling n jobs in the generalized tardiness flow shop problem with m machines. Seven algorithms are developed for finding a schedule with minimum total tardiness of jobs in the generalized flow shop problem. Two simple rules, the shortest processing time (SPT), and the earliest due date (EDD) sequencing rules, are modified and employed as the core of seque...