Distributed Transformations of Hamiltonian Shapes based on Line Moves

We consider a discrete system of $n$ simple indistinguishable devices, called \emph{agents}, forming a \emph{connected} shape $S_I$ on a two-dimensional square grid. Agents are equipped with a linear-strength mechanism, called a \emph{line move}, by which an agent can push a whole line of consecutive agents in one of the four directions in a single time-step. We study the problem of transforming an initial shape $S_I$ into a given target shape $S_F$ via a finite sequence of line moves in a distributed model, where each agent can observe the states of nearby agents in a Moore neighbourhood. Our main contribution is the first distributed connectivity-preserving transformation that exploits line moves within a total of $O(n \log_2 n)$ moves, which is asymptotically equivalent to that of the best-known centralised transformations. The algorithm solves the \emph{line formation problem} that allows agents to form a final straight line $S_L$, starting from any shape $S_I$, whose \emph{associated graph} contains a Hamiltonian path

LIPIcs, Volume 258, SoCG 2023, Complete Volume

LIPIcs, Volume 258, SoCG 2023, Complete Volum

LIPIcs, Volume 248, ISAAC 2022, Complete Volume

LIPIcs, Volume 248, ISAAC 2022, Complete Volum

Growing machines

Thesis (Ph. D.)--Massachusetts Institute of Technology, School of Architecture and Planning, Program in Media Arts and Sciences, 2004.Includes bibliographical references.construction is developed in three dimensions. It is similarly shown that right-angled tetrahedrons, when folded from an edge-connected string, can generate any three dimensional structure where the primitive pixel (or voxel) is a rhombic hexahedron. This construction also suggests a concept of 3D completeness for assembly, somewhat analogous to the concept of Turing completeness in computation. In combination, these pieces of work suggest that a manufacturing system based on four tiles, with seven states per tile, is capable of self-replication of arbitrary 3D structure by copying, then folding, bit strings of those tiles where the desired structure is encoded in the tile sequence.Biological systems are replete with examples of high complexity structures that have "self assembled," or more accurately, programmatically assembled from many smaller, simpler components. By comparison, the fabrication systems engineered by humans are typically top down, or subtractive, processes where systems of limited complexity are carved from bulk materials. Self-assembly to date has resembled crystallization more than it has the programmatic assembly of complex or useful structures--these systems are information limited. This thesis explores the programming of self-assembling systems by the introduction of small amounts of state to the sub-units of the assembly. A six-state, kinematic, conformational latching component is presented that is capable of self-replicating bit strings of two shape differentiated versions of the same component where the two variants represent the 0 and 1 bits. Individual units do not assemble until a string is introduced to the assembly environment to be copied. Electro-mechanical state machine emulators were constructed. Operating on an air table, the units demonstrated logic limited aggregation, or error-preventing assembly, as well as autonomous self-replication of bit strings. A new construction was developed that demonstrates that any two dimensional shape composed of square pixels can be deterministically folded from a linear string of vertex-connected square tiles. This non-intersecting series of folds implies a 'resolution' limit of four tiles per pixel. It is shown that four types of tiles, patterned magnetically, is sufficient to construct any shape given sequential folding. The construction was implemented to fold the letters 'M I T' from sequences of the 4 tile types. An analogousSaul Thomas Griffith.Ph.D

Developing Police Patrol Strategies Based on the Urban Street Network

In urban areas, crime and disorder have been long-lasting problems that spoil the economic and emotional well-being of residents. A significant way to deter crime, and maintain public safety is through police patrolling. So far, the deployment of police forces in patrolling has relied mainly on expert knowledge, and is usually based on two-dimensional spatial units, giving insufficient consideration to the underlying urban structure and collaboration among patrol officers. This approach has led to impractical and inefficient police patrol strategies, as well as a workload imbalance among officers. Therefore, it is of essential importance to devise advanced police patrol strategies that incorporate urban structure, the collaboration of the patrol officers, and a workload balance. This study aims to develop police patrol strategies that would make intelligent use of the street network layout in urban areas. The street network is a key component in urban structure and is the domain in which crime and policing take place. By explicitly considering street network configurations in their operations, police forces are enabled to provide timely responses to emergency calls and essential coverage to crime hotspots. Although some models have considered street networks in patrolling to some extent, challenges remain. First, most existing methods for the design of police districts use two-dimensional units, such as grid cells, as basic units, but using streets as basic units would lead to districts that are more accessible and usable. Second, the routing problem in police patrolling has several unique characteristics, such as patrollers potentially starting from different stations, but most existing routing strategies have failed to consider these. Third, police patrolling strategies should be validated using real-world scenarios, whilst most existing strategies in the literature have only been tested in small hypothetical instances without realistic settings. In this thesis, a framework for developing police patrol strategies based on the urban street network is proposed, to effectively cover crime hotspots, as well as the rest of the territory. This framework consists of three strategies, including a districting model, a patrol routing strategy for repeated coverage, and a patrol routing strategy for infrequent coverage. Various relevant factors have been considered in the strategy design, including the underlying structure of the street network and the collaboration among patrollers belonging to different stations. Moreover, these strategies have been validated by the patrolling scenarios in London. The results demonstrate that these strategies outperform the current corresponding benchmark strategies, which indicates that they may have considerable potential in future police operations

Approaches to Building a Quantum Computer Based on Semiconductors

Throughout this Ph.D., the quest to build a quantum computer has accelerated, driven by ever-improving fidelities of conventional qubits and the development of new technologies that promise topologically protected qubits with the potential for lifetimes that exceed those of comparable conventional qubits. As such, there has been an explosion of interest in the design of an architecture for a quantum computer. This design would have to include high-quality qubits at the bottom of the stack, be extensible, and allow the layout of many qubits with scalable methods for readout and control of the entire device. Furthermore, the whole experimental infrastructure must handle the requirements for parallel operation of many qubits in the system. Hence the crux of this thesis: to design an architecture for a semiconductor-based quantum computer that encompasses all the elements that would be required to build a large scale quantum machine, and investigate the individual these elements at each layer of this stack, from qubit to readout to control