43,638 research outputs found

    A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints

    Get PDF
    Given a graph, a set of origin-destination (OD) pairs with communication requirements, and an integer k >= 2, the network design problem with vulnerability constraints (NDPVC) is to identify a subgraph with the minimum total edge costs such that, between each OD pair, there exist a hop-constrained primary path and a hop-constrained backup path after any k - 1 edges of the graph fail. Formulations exist for single-edge failures (i.e., k = 2). To solve the NDPVC for an arbitrary number of edge failures, we develop two natural formulations based on the notion of length-bounded cuts. We compare their strengths and flexibilities in solving the problem for k >= 3. We study different methods to separate infeasible solutions by computing length-bounded cuts of a given size. Experimental results show that, for single-edge failures, our formulation increases the number of solved benchmark instances from 61% (obtained within a two-hour limit by the best published algorithm) to more than 95%, thus increasing the number of solved instances by 1,065. Our formulation also accelerates the solution process for larger hop limits and efficiently solves the NDPVC for general k. We test our best algorithm for two to five simultaneous edge failures and investigate the impact of multiple failures on the network design

    Attack-Surface Metrics, OSSTMM and Common Criteria Based Approach to “Composable Security” in Complex Systems

    Get PDF
    In recent studies on Complex Systems and Systems-of-Systems theory, a huge effort has been put to cope with behavioral problems, i.e. the possibility of controlling a desired overall or end-to-end behavior by acting on the individual elements that constitute the system itself. This problem is particularly important in the “SMART” environments, where the huge number of devices, their significant computational capabilities as well as their tight interconnection produce a complex architecture for which it is difficult to predict (and control) a desired behavior; furthermore, if the scenario is allowed to dynamically evolve through the modification of both topology and subsystems composition, then the control problem becomes a real challenge. In this perspective, the purpose of this paper is to cope with a specific class of control problems in complex systems, the “composability of security functionalities”, recently introduced by the European Funded research through the pSHIELD and nSHIELD projects (ARTEMIS-JU programme). In a nutshell, the objective of this research is to define a control framework that, given a target security level for a specific application scenario, is able to i) discover the system elements, ii) quantify the security level of each element as well as its contribution to the security of the overall system, and iii) compute the control action to be applied on such elements to reach the security target. The main innovations proposed by the authors are: i) the definition of a comprehensive methodology to quantify the security of a generic system independently from the technology and the environment and ii) the integration of the derived metrics into a closed-loop scheme that allows real-time control of the system. The solution described in this work moves from the proof-of-concepts performed in the early phase of the pSHIELD research and enrich es it through an innovative metric with a sound foundation, able to potentially cope with any kind of pplication scenarios (railways, automotive, manufacturing, ...)

    Contingency-Constrained Unit Commitment with Post-Contingency Corrective Recourse

    Full text link
    We consider the problem of minimizing costs in the generation unit commitment problem, a cornerstone in electric power system operations, while enforcing an N-k-e reliability criterion. This reliability criterion is a generalization of the well-known NN-kk criterion, and dictates that at least (1ej)(1-e_ j) fraction of the total system demand must be met following the failures of kk or fewer system components. We refer to this problem as the Contingency-Constrained Unit Commitment problem, or CCUC. We present a mixed-integer programming formulation of the CCUC that accounts for both transmission and generation element failures. We propose novel cutting plane algorithms that avoid the need to explicitly consider an exponential number of contingencies. Computational studies are performed on several IEEE test systems and a simplified model of the Western US interconnection network, which demonstrate the effectiveness of our proposed methods relative to current state-of-the-art

    Participatory approach for integrated basin planning with focus on disaster risk reduction : the case of the Limpopo river

    Get PDF
    This paper defends the idea that a participatory approach is a suitable method for basin planning integrating both water and land aspects. Assertions made are based on scientific literature review and corroborated by field experience and research carried out in the Limpopo River basin, a transboundary river located in southern Africa which is affected by periodical floods. The paper explains how a basin strategic plan can be drafted and disaster risk reduction strategies derived by combining different types of activities using a bottom-up approach, despite an institutional context which operates through traditional top-down mechanisms. In particular, the "Living with Floods" experience in the lower Limpopo River, in Mozambique, is described as a concrete example of a disaster adaptation measure resulting from a participatory planning exercise. In conclusion, the adopted method and obtained results are discussed and recommendations are formulated for potential replication in similar contexts of the developing world

    A programing system for research and applications in structural optimization

    Get PDF
    The flexibility necessary for such diverse utilizations is achieved by combining, in a modular manner, a state-of-the-art optimization program, a production level structural analysis program, and user supplied and problem dependent interface programs. Standard utility capabilities in modern computer operating systems are used to integrate these programs. This approach results in flexibility of the optimization procedure organization and versatility in the formulation of constraints and design variables. Features shown in numerical examples include: variability of structural layout and overall shape geometry, static strength and stiffness constraints, local buckling failure, and vibration constraints

    Supply Chain Management in the Life Science Sector: Does Trust Play a Role?

    Get PDF
    Supply chain management has emerged as cross functional, cross company concept to improve coordination of entire value chains through coordinated actions of all companies in the value chain. It has received a major push from the availability of Internet-based information and communication technologies. The conditions in certain sectors are favorable for a realization of chain wide supply chain management. In other sectors, however, conditions are more complex and companies and value chains still struggle to exploit the potentials from supply chain management, in particular when it comes to cross enterprise coordination. This paper takes a complex supply network as example and discusses improvement potentials from supply chain management and developments in their implementation as well as barriers to the realization of chain wide supply chain management.supply chain management, trust, life science sector, Agribusiness, Industrial Organization,
    corecore