相关论文: Centralised Connectivity-Preserving Transformation…
In this work we study the problem of network morphism, an effective learning scheme to morph a well-trained neural network to a new one with the network function completely preserved. Different from existing work where basic morphing types…
Shape formation is one of the most thoroughly studied problems in programmable matter and swarm robotics. However, in many models, the class of shapes that can be formed is highly restricted due to the particles' limited memory. In the…
With the proliferation of mobile devices and the Internet of Things, deep learning models are increasingly deployed on devices with limited computing resources and memory, and are exposed to the threat of adversarial noise. Learning deep…
In micro- and nano-scale systems, particles can be moved by using an external force like gravity or a magnetic field. In the presence of adhesive particles that can attach to each other, the challenge is to decide whether a shape is…
Realizing a controllable network with multiple degrees of interaction is a challenge to physics and engineering. Here, we experimentally report an on-chip reconfigurable network based on nanoelectromechanical resonators with…
In this paper, we propose an optimization framework to design a network of positive linear systems whose structure switches according to a Markov process. The optimization framework herein proposed allows the network designer to optimize…
High-power structured light has a wide range of applications, from material processing and high-capacity optical communications to programmable electron beams, plasmas, and nuclear states. On-demand generation of structured light and…
It is shown that in the case of multicomponent integrable systems connected with algebras $A_n$, the discrete transformation $T$ possesses the fine structure and can be represented in the form $T=\prod T_i^{l_i}$, where $T_i$ are n…
Shape formation has been recently studied in distributed systems of programmable particles. In this paper we consider the shape recovery problem of restoring the shape when $f$ of the $n$ particles have crashed. We focus on the basic line…
Coupling $N$ large $m$ minimal models and flowing to IR fixed points is a systematic way to build new classes of compact unitary 2d CFTs which are likely to be irrational, and potentially have a positive Virasoro twist gap above the…
In this Letter we investigate networks that have been optimized to realize a trade-off between enhanced synchronization and cost of wire to connect the nodes in space. Analyzing the evolved arrangement of nodes in space and their…
Shape-programmed sheets morph from one surface into another upon activation by stimuli such as illumination, and have attracted much interest for their potential engineering applications, especially in soft robotics. Complex shape changes…
In geographic information systems and in the production of digital maps for small devices with restricted computational resources one often wants to round coordinates to a rougher grid. This removes unnecessary detail and reduces space…
Data describing the three-dimensional structure of physical networks is increasingly available, leading to a surge of interest in network science to explore the relationship between the shape and connectivity of physical networks. We…
We consider programmable matter consisting of simple computational elements, called particles, that can establish and release bonds and can actively move in a self-organized way, and we investigate the feasibility of solving fundamental…
Programmable photonic circuits are versatile platforms that route light through multiple interference paths using reconfigurable optoelectronic elements to perform complex discrete linear operations. These circuits offer the potential for…
Quantum spin models are ubiquitous in solid-state physics, but classical simulation of them remains extremely challenging. Experimental testbed systems with a variety of spin-spin interactions and measurement channels are therefore needed.…
Assembly planning is a fundamental problem in robotics and automation, which involves designing a sequence of motions to bring the separate constituent parts of a product into their final placement in the product. Assembly planning is…
We study the complexity of the following cell connection and separation problems in segment arrangements. Given a set of straight-line segments in the plane and two points $a$ and $b$ in different cells of the induced arrangement: (i)…
We numerically investigate that optimal robust onion-like networks can emerge even with the constraint of surface growth in supposing a spatially embedded transportation or communication system. To be onion-like, moderately long links are…