A general pattern, which can include different types of permanent magnet (PM) arrangement in PM synchronous motors (PMSMs) is presented. By varying the geometric parameters of the general pattern, the template can automatically produce different types of PM arrangement in the rotor. By choosing the best arrangement of PMs using optimization method, one can obtain a better performance and lower ...

OPTIMAL TOPOLOGICAL ARRANGEMENTS OF QUEUES IN CLOSED FINITE QUEUEING NETWORKS MAY 2015 LENING WANG M.S.M.E., UNIVERSITY OF MASSACHUSETTS AMHERST Directed by: Professor J. MacGregor Smith Closed queueing networks are widely used in many different kinds of scientific and business applications. Since the demands of saving energy and reducing costs are becoming more and more significant with develo...

We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between pairs of vertices measured with respect to the tree topology is at most a given value. We show that data arrangement is strongly NP-complete for any fixed d ≥ 2 and explain the connection between data arrangement and ar...

Enzymes within biochemical pathways are often colocalized, yet the consequences of specific spatial enzyme arrangements remain poorly understood. We study the impact of enzyme arrangement on reaction efficiency within a reaction-diffusion model. The optimal arrangement transitions from a cluster to a distributed profile as a single parameter, which controls the probability of reaction versus di...

A linear arrangement of an n-vertex graph is a one-to-one mapping of its vertices to the integers f1; : : : ; ng. The bandwidth of a linear arrangement is the maximum diierence between mapped values of adjacent vertices. The problem of nding a linear arrangement with smallest possible bandwidth in NP-hard. We present a random-ized algorithm that runs in nearly linear time and outputs a linear a...

This paper proposes a distributed fault-tolerant algorithm for one-to-all broadcasting in the oneport communication model on the arrangement graph. Exploiting the hierarchical properties of the arrangement graph to constitute different-sized broadcasting trees for different-sized subgraphs, we propose a distributed algorithm with optimal time complexity and without message redundancy for one-to...

In this paper, we study the arrangement of displays in flight instrument panels of multi-purpose civil helicopters following a user-centered design method based on ergonomics principles. Our methodology can also be described as a user-interface arrangement methodology based on user opinions and preferences. This study can be outlined as gathering user-centered data using two different research ...