145,582 research outputs found

    Generalized Network Dismantling

    Full text link
    Finding the set of nodes, which removed or (de)activated can stop the spread of (dis)information, contain an epidemic or disrupt the functioning of a corrupt/criminal organization is still one of the key challenges in network science. In this paper, we introduce the generalized network dismantling problem, which aims to find the set of nodes that, when removed from a network, results in a network fragmentation into subcritical network components at minimum cost. For unit costs, our formulation becomes equivalent to the standard network dismantling problem. Our non-unit cost generalization allows for the inclusion of topological cost functions related to node centrality and non-topological features such as the price, protection level or even social value of a node. In order to solve this optimization problem, we propose a method, which is based on the spectral properties of a novel node-weighted Laplacian operator. The proposed method is applicable to large-scale networks with millions of nodes. It outperforms current state-of-the-art methods and opens new directions in understanding the vulnerability and robustness of complex systems.Comment: 6 pages, 5 figure

    Shape memory alloy actuators for active disassembly using ‘smart’ materials of consumer electronic products

    Get PDF
    This paper reports the preliminary to current development of Shape Memory Alloy (SMA) actuators within their application in ‘Active Disassembly using Smart Materials’ (ADSM). This non-destructive self-dismantling process is to aid recycling of consumer electronic products. Actuators were placed in single and multi-stage hierarchical temperature regimes after being embedded into macro and sub-assemblies of electronic product assemblies. Findings include active disassembly and a hierarchical dismantling regime for product dismantling using developed SMA actuators embedded into candidate products

    Dismantling sparse random graphs

    Full text link
    We consider the number of vertices that must be removed from a graph G in order that the remaining subgraph has no component with more than k vertices. Our principal observation is that, if G is a sparse random graph or a random regular graph on n vertices with n tending to infinity, then the number in question is essentially the same for all values of k such that k tends to infinity but k=o(n).Comment: 7 page

    Dismantling the Mantel tests

    Get PDF
    The simple and partial Mantel tests are routinely used in many areas of evolutionary biology to assess the significance of the association between two or more matrices of distances relative to the same pairs of individuals or demes. Partial Mantel tests rather than simple Mantel tests are widely used to assess the relationship between two variables displaying some form of structure. We show that contrarily to a widely shared belief, partial Mantel tests are not valid in this case, and their bias remains close to that of the simple Mantel test. We confirm that strong biases are expected under a sampling design and spatial correlation parameter drawn from an actual study. The Mantel tests should not be used in case auto-correlation is suspected in both variables compared under the null hypothesis. We outline alternative strategies. The R code used for our computer simulations is distributed as supporting material

    Intra-industry trade and labor costs: The smooth adjustment hypothesis

    Get PDF
    We study a situation in which, owing to the exhaustion of non-renewable energy sources, conventional motor vehicles will turn out of use. We consider two scenarios: recycling or dismantling these motor vehicles. M|G|∞ queue system is used to study the process. Through it, we conclude that if the rate of dismantling and recycling of motor vehicles is greater than the rate at which they become idle, the system will tend to get balanced. The model allows also performing a brief study about the recycling or dismantling economic interest.

    Does the European Union have a reverse gear? Policy dismantling in a hyperconsensual polity

    Get PDF
    The financial crisis has triggered demands to halt and even reverse the expansion of European Union (EU) policies. But have these and previous demands actually resulted in policy dismantling? The existing literature has charted the rise of dismantling discourses such as subsidiarity and better regulation, but has not examined the net effect on the acquis. For the first time, this contribution addresses this gap in the literature through an empirical study of policy change between 1992 and 2014. It is guided by a coding framework which captures the direction of policy change. It reveals that, despite its disposition towards consensualism, the EU has become a new locus of policy dismantling. However, not all policies targeted have been cut; many have stayed the same and some have even expanded. It concludes by identifying new directions for research on a topic that has continually fallen into the analytical blind spot of EU scholars

    Written evidence given by Professor Alexander Pepper of the London School of Economics and Political Science to the UK Parliamentary Commission on banking standards

    Get PDF
    My contention is that many of the current problems with 'Bankers’ Pay' have their origins in the dismantling of the formal and informal institutions which regulated the labour markets in the financial centres in London and New York prior to 1986-1987

    Women and Opportunity

    Get PDF
    Women have made considerable progress over the last several decades in dismantling barriers to opportunity in education, employment, representation in government, and other domains. But opportunity remains severely constrained for many women, particularly low-income women, women of color, and immigrant wome
    corecore