On minimum cost isolated failure immune networks

A telecommunications network is isolated failure immune (IFI) if and only if communication between operative sites can be completed as long as network failures are isolated. It is known that the class of minimal IFI networks is equivalent to the class of spanning 2-trees. To the best of our knowledge, this work is the first computational study dealing with the construction of a minimum cost IFI network. The problem is known to be NP-complete. We develop a tabu search based heuristic for solving the minimum cost spanning 2-tree (MCS2T) problem. The complex structure of 2-trees makes the tabu search heuristic highly dependent on the starting solution. We develop four heuristic algorithms to obtain diversified good starting solutions. They are: completion of a 2-tree from a spanning tree, two greedy approaches, and a method based on the recursive definition of a 2-tree. We also formulate an integer programming problem (IP) whose objective function value is a lower bound to the MCS2T problem. We solve the IP by developing a constraint generation scheme. The algorithms were tested on complete random graphs with Euclidean distances and on two real data sets (Civil Aeronautics Board) with instances of 10, 15, 20 and 25 nodes. As a result of this research for small problems (10 and 15 nodes), the heuristic solutions are on average within 0.8% from the optimal solution and for large problems (20 and 25 nodes), the average error is less than 2.8%.     

Investigation on the styrene-butadiene rubber cleavage with periodic acid under the influence of ultrasonic radiation

Summary The cleavage of styrene-butadiene rubber (SBR) with periodic acid (H₅IO₆) and simultaneous injection of ultrasonic radiation has been performed. Two frequencies, 25 and 40 kHz, respectively, have been used. The results demonstrate clearly that 40 kHz ultrasound radiation accelerates significantly the cleavage reaction. The Pearl String Model theory had been used to elucidate this process.     

A Novel Magnetic Hardening Mechanism for Nd-Fe-B Permanent Magnets Based on Solid-State Phase Transformation

Permanent magnets based on neodymium-iron-boron (Nd-Fe-B) alloys provide the highest performance and energy density, finding usage in many high-tech applications. Their magnetic performance relies on the intrinsic properties of the hard-magnetic Nd₂Fe₁₄B phase combined with control over the microstructure during production. In this study, a novel magnetic hardening mechanism is described in such materials based on a solid-state phase transformation. Using modified Nd-Fe-B alloys of the type Nd₁₆Fe_bal-x-y-zCo_xMo_yCu_zB₇ for the first time it is revealed how the microstructural transformation from the metastable Nd₂Fe₁₇B_x phase to the hard-magnetic Nd₂Fe₁₄B phase can be thermally controlled, leading to an astonishing increase in coercivity from ≈200 kAm⁻¹ to almost 700 kAm⁻¹. Furthermore, after thermally treating a quenched sample of Nd₁₆Fe₅₆Co₂₀Mo₂Cu₂B₇, the presence of Mo leads to the formation of fine FeMo₂B₂ precipitates, in the range from micrometers down to a few nanometers. These precipitates are responsible for the refinement of the Nd₂Fe₁₄B grains and so for the high coercivity. This mechanism can be incorporated into existing manufacturing processes and can prove to be applicable to novel fabrication routes for Nd-Fe-B magnets, such as additive manufacturing.     

Special issue on information systems quality management in practice

Software Quality Journal -     

Nanocrystalline Nd–Fe–B Anisotropic Magnets by Flash Spark Plasma Sintering

Flash spark plasma sintering (flash SPS) is an attractive method to obtain Nd–Fe–B magnets with anisotropic magnetic properties when starting from melt-spun powders. Compared to the benchmark processing route via hot pressing with subsequent die upsetting, flash SPS promises electroplasticity as an additional deformation mechanism and reduced tool wear, while maximizing magnetic properties by tailoring the microstructure—fully dense and high texture. A detailed parameter study is conducted to understand the influence of Flash SPS parameters on the densification and magnetic properties of commercial MQU-F powder. It is revealed that the presintering conditions and preheating temperature before applying the power pulse play a major role for tailoring grain size and texture in the case of hot deformation via Flash SPS. Detailed microstructure and magnetic domain evaluation disclose the texture enhancement with increasing flash SPS temperature at the expense of coercivity. The best compromise between remanence and coercivity (1.37 T and 1195 kA m⁻¹, respectively) is achieved through a combination of presintering at 500 °C for 120 s and preheating temperature of 600 °C, resulting in a magnet with energy product (BH)_max of 350 kJm⁻³. These findings show the potential of flash SPS to obtain fully dense anisotropic nanocrystalline magnets with high magnetic performance.     

Robust solutions to Stackelberg games: Addressing bounded rationality and limited observations in human cognition

How do we build algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such as oligopolistic markets and security domains. In Stackelberg games, one player, the leader, commits to a strategy and the follower makes her decision with knowledge of the leader's commitment. Existing algorithms for Stackelberg games efficiently find optimal solutions (leader strategy), but they critically assume that the follower plays optimally. Unfortunately, in many applications, agents face human followers (adversaries) who — because of their bounded rationality and limited observation of the leader strategy — may deviate from their expected optimal response. In other words, human adversaries' decisions are biased due to their bounded rationality and limited observations. Not taking into account these likely deviations when dealing with human adversaries may cause an unacceptable degradation in the leader's reward, particularly in security applications where these algorithms have seen deployment. The objective of this paper therefore is to investigate how to build algorithms for agent interactions with human adversaries.To address this crucial problem, this paper introduces a new mixed-integer linear program (MILP) for Stackelberg games to consider human adversaries, incorporating: (i) novel anchoring theories on human perception of probability distributions and (ii) robustness approaches for MILPs to address human imprecision. Since this new approach considers human adversaries, traditional proofs of correctness or optimality are insufficient; instead, it is necessary to rely on empirical validation. To that end, this paper considers four settings based on real deployed security systems at Los Angeles International Airport (Pita et al., 2008 [35]), and compares 6 different approaches (three based on our new approach and three previous approaches), in 4 different observability conditions, involving 218 human subjects playing 2960 games in total. The final conclusion is that a model which incorporates both the ideas of robustness and anchoring achieves statistically significant higher rewards and also maintains equivalent or faster solution speeds compared to existing approaches.     

A new discretized Lyapunov–Krasovskii functional for stability analysis and control design of time‐delayed TS fuzzy systems

This paper proposes a new Lyapunov–Krasovskii functional to cope with stability analysis and control design for time‐delay nonlinear systems modeled in the Takagi–Sugeno (TS) fuzzy form. The delay‐dependent conditions are formulated as linear matrix inequalities (LMIs), solvable through several numerical tools. By using the Gu's discretization technique and by employing an appropriated fuzzy functional, less conservative conditions are obtained. Numerical results illustrate the efficiency of the proposed methods. Copyright © 2010 John Wiley & Sons, Ltd.