AIGO: a southern hemisphere detector for the worldwide array of ground-based interferometric gravitational wave detectors

This paper describes the proposed AIGO detector for the worldwide array of interferometric gravitational wave detectors. The first part of the paper summarizes the benefits that AIGO provides to the worldwide array of detectors. The second part gives a technical description of the detector, which will follow closely the Advanced LIGO design. Possible technical variations in the design are discussed

Alternative axiomatics and complexity of deliberative STIT theories

We propose two alternatives to Xu's axiomatization of the Chellas STIT. The first one also provides an alternative axiomatization of the deliberative STIT. The second one starts from the idea that the historic necessity operator can be defined as an abbreviation of operators of agency, and can thus be eliminated from the logic of the Chellas STIT. The second axiomatization also allows us to establish that the problem of deciding the satisfiability of a STIT formula without temporal operators is NP-complete in the single-agent case, and is NEXPTIME-complete in the multiagent case, both for the deliberative and the Chellas' STIT.Comment: Submitted to the Journal of Philosophical Logic; 13 pages excluding anne

Comparison of Josephson vortex flow transistors with different gate line configurations

We performed numerical simulations and experiments on Josephson vortex flow transistors based on parallel arrays of YBa2Cu3O(7-x) grain boundary junctions with a cross gate-line allowing to operate the same devices in two different modes named Josephson fluxon transistor (JFT) and Josephson fluxon-antifluxon transistor (JFAT). The simulations yield a general expression for the current gain vs. number of junctions and normalized loop inductance and predict higher current gain for the JFAT. The experiments are in good agreement with simulations and show improved coupling between gate line and junctions for the JFAT as compared to the JFT.Comment: 3 pages, 6 figures, accept. for publication in Appl. Phys. Let

Fixed-parameter tractability of multicut parameterized by the size of the cutset

Given an undirected graph $G$, a collection $\{(s_1,t_1),..., (s_k,t_k)\}$ of pairs of vertices, and an integer $p$, the Edge Multicut problem ask if there is a set $S$ of at most $p$ edges such that the removal of $S$ disconnects every $s_i$ from the corresponding $t_i$. Vertex Multicut is the analogous problem where $S$ is a set of at most $p$ vertices. Our main result is that both problems can be solved in time $2^{O(p^3)}... n^{O(1)}$, i.e., fixed-parameter tractable parameterized by the size $p$ of the cutset in the solution. By contrast, it is unlikely that an algorithm with running time of the form $f(p)... n^{O(1)}$ exists for the directed version of the problem, as we show it to be W[1]-hard parameterized by the size of the cutset

Quantum Fluctuations Driven Orientational Disordering: A Finite-Size Scaling Study

The orientational ordering transition is investigated in the quantum generalization of the anisotropic-planar-rotor model in the low temperature regime. The phase diagram of the model is first analyzed within the mean-field approximation. This predicts at $T=0$ a phase transition from the ordered to the disordered state when the strength of quantum fluctuations, characterized by the rotational constant $\Theta$, exceeds a critical value $\Theta_{\rm c}^{MF}$. As a function of temperature, mean-field theory predicts a range of values of $\Theta$ where the system develops long-range order upon cooling, but enters again into a disordered state at sufficiently low temperatures (reentrance). The model is further studied by means of path integral Monte Carlo simulations in combination with finite-size scaling techniques, concentrating on the region of parameter space where reentrance is predicted to occur. The phase diagram determined from the simulations does not seem to exhibit reentrant behavior; at intermediate temperatures a pronounced increase of short-range order is observed rather than a genuine long-range order.Comment: 27 pages, 8 figures, RevTe

The time of the Roma in times of crisis: Where has European neoliberal capitalism failed?

This paper argues that the economic and financial crisis that has ensnared Europe from the late 2000s has been instrumental in reshaping employment and social relations in a detrimental way for the majority of the European people. It argues that the crisis has exacerbated the socio-economic position of most Roma people, immigrants as well as of other vulnerable groups. This development is approached here as an outcome of the widening structural inequalities that underpin the crisis within an increasingly neoliberalised Europe. Through recent policy developments and public discourses from a number of European countries I show how rising inequalities nurture racialised social tensions. My account draws on classic and contemporary theoretical propositions that have been propounded about the nature of capitalism, its contemporary re-articulation as well as its ramification for the future of Europe

Optimality program in segment and string graphs

Planar graphs are known to allow subexponential algorithms running in time $2^{O(\sqrt n)}$ or $2^{O(\sqrt n \log n)}$ for most of the paradigmatic problems, while the brute-force time $2^{\Theta(n)}$ is very likely to be asymptotically best on general graphs. Intrigued by an algorithm packing curves in $2^{O(n^{2/3}\log n)}$ by Fox and Pach [SODA'11], we investigate which problems have subexponential algorithms on the intersection graphs of curves (string graphs) or segments (segment intersection graphs) and which problems have no such algorithms under the ETH (Exponential Time Hypothesis). Among our results, we show that, quite surprisingly, 3-Coloring can also be solved in time $2^{O(n^{2/3}\log^{O(1)}n)}$ on string graphs while an algorithm running in time $2^{o(n)}$ for 4-Coloring even on axis-parallel segments (of unbounded length) would disprove the ETH. For 4-Coloring of unit segments, we show a weaker ETH lower bound of $2^{o(n^{2/3})}$ which exploits the celebrated Erd\H{o}s-Szekeres theorem. The subexponential running time also carries over to Min Feedback Vertex Set but not to Min Dominating Set and Min Independent Dominating Set.Comment: 19 pages, 15 figure