Self-propelled Worm-like Filaments: Spontaneous Spiral Formation, Structure, and Dynamics

Worm-like filaments that are propelled homogeneously along their tangent vector are studied by Brownian dynamics simulations. Systems in two dimensions are investigated, corresponding to filaments adsorbed to interfaces or surfaces. A large parameter space covering weak and strong propulsion, as well as flexible and stiff filaments is explored. For strongly propelled and flexible filaments, the free-swimming filaments spontaneously form stable spirals. The propulsion force has a strong impact on dynamic properties, such as the rotational and translational mean square displacement and the rate of conformational sampling. In particular, when the active self-propulsion dominates thermal diffusion, but is too weak for spiral formation, the rotational diffusion coefficient has an activity-induced contribution given by $v_c/\xi_P$, where $v_c$ is the contour velocity and $\xi_P$ the persistence length. In contrast, structural properties are hardly affected by the activity of the system, as long as no spirals form. The model mimics common features of biological systems, such as microtubules and actin filaments on motility assays or slender bacteria, and artificially designed microswimmers

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges

Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mathematics and Computer Science (including Artificial Intelligence and Multiagent Systems) on the other side. Typical computational problems studied in this field include the vulnerability of voting procedures against attacks, or preference aggregation in multi-agent systems. Parameterized Algorithmics is a subfield of Theoretical Computer Science seeking to exploit meaningful problem-specific parameters in order to identify tractable special cases of in general computationally hard problems. In this paper, we propose nine of our favorite research challenges concerning the parameterized complexity of problems appearing in this context

Arbitration and the Batson Principle

As disputants more frequently utilize arbitration to resolve disputes, the likelihood that discriminatory arbitrator selection will occur also increases. While some disputants might consent to selecting an arbitrator for particular reasons, it is troublesome to think that repeat players, such as employers and businesses, might use their greater knowledge and experience with the arbitral process to gain control over the arbitrator selection process through the use of peremptory challenges. Opponents of arbitration have attempted to adopt existing legal arguments to address this problem. Unfortunately, however, neither the state action doctrine nor the use of the existing public policy exception to the enforcement of an arbitration agreement or arbitral award will be successful as a means to challenge the use of discriminatory peremptory strikes. Because existing legal arguments fail to address this growing problem, this Article proposes an amendment to the Federal and Uniform Arbitration Acts to address the problem of discriminatory arbitrator selection. The proposed statute, which would ban discrimination in the selection of an arbitrator on the basis of race, ethnicity, national origin, sex, religion, or sexual orientation, mirrors the classifications that the Batson principle encompasses and thus is justifiable for both practical and constitutional reasons

Network-Based Vertex Dissolution

We introduce a graph-theoretic vertex dissolution model that applies to a number of redistribution scenarios such as gerrymandering in political districting or work balancing in an online situation. The central aspect of our model is the deletion of certain vertices and the redistribution of their load to neighboring vertices in a completely balanced way. We investigate how the underlying graph structure, the knowledge of which vertices should be deleted, and the relation between old and new vertex loads influence the computational complexity of the underlying graph problems. Our results establish a clear borderline between tractable and intractable cases.Comment: Version accepted at SIAM Journal on Discrete Mathematic

Digital Beamforming and Traffic Monitoring Using the new FSAR System of DLR

In November 2006 the first X-band test flight of DLR’s new FSAR system has been performed successfully and in February 2007 the first flight campaign has been conducted for acquiring experimental multi-channel data of controlled ground moving targets. In the paper the performed experiments and the used setup of the FSAR X-band section are described and preliminary results in the field of ground moving target indication and digital beamforming are presented

Partitioning Perfect Graphs into Stars

The partition of graphs into "nice" subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size stars, a problem known to be NP-complete even for the case of stars on three vertices. We perform a thorough computational complexity study of the problem on subclasses of perfect graphs and identify several polynomial-time solvable cases, for example, on interval graphs and bipartite permutation graphs, and also NP-complete cases, for example, on grid graphs and chordal graphs.Comment: Manuscript accepted to Journal of Graph Theor