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.     

Information fusion for automotive applications – An overview

This article focusses on the fusion of information from various automotive sensors like radar, video, and lidar for enhanced safety and traffic efficiency. Fusion is not restricted to data from sensors onboard the same vehicle but vehicular communication systems allow to propagate and fuse information with sensor data from other vehicles or from the road infrastructure as well. This enables vehicles to perceive information from regions that are hardly accessible otherwise and represents the basis for cooperative driving maneuvers. While the Bayesian framework builds the basis for information fusion, automobile environments are characterized by their a priori unknown topology, i.e., the number, type, and structure of the perceived objects is highly variable. Multi-object detection and tracking methods are a first step to cope with this challenge. Obviously, the existence or non-existence of an object is of paramount importance for safe driving. Such decisions are highly influenced by the association step that assigns sensor measurements to object tracks. Methods that involve multiple sequences of binary assignments are compared with soft-assignment strategies. Finally, fusion based on finite set statistics that (theoretically) avoid an explicit association are discussed.     

Learning a generic 3D face model from 2D image databases using incremental Structure-from-Motion

Over the last decade 3D face models have been extensively used in many applications such as face recognition, facial animation and facial expression analysis. 3D Morphable Models (MMs) have become a popular tool to build and fit 3D face models to images. Critical to the success of MMs is the ability to build a generic 3D face model. Major limitations in the MMs building process are: (1) collecting 3D data usually involves the use of expensive laser scans and complex capture setups, (2) the number of available 3D databases is limited, and typically there is a lack of expression variability and (3) finding correspondences and registering the 3D model is a labor intensive and error prone process.     

Boundary-Conforming Discontinuous Galerkin Methods via Extensions from Subdomains

A new way of devising numerical methods is introduced whose distinctive feature is the computation of a finite element approximation only in a polyhedral subdomain D{\mathsf{D}} of the original, possibly curved-boundary domain. The technique is applied to a discontinuous Galerkin method for the one-dimensional diffusion-reaction problem. Sharp a priori error estimates are obtained which identify conditions, on the subdomain D{\mathsf{D}} and the discretization parameters of the discontinuous Galerkin method, under which the method maintains its original optimal convergence properties. The error analysis is new even in the case in which D=W{\mathsf{D}}=\Omega . It allows to see that the uniform error at any given interval is bounded by an interpolation error associated to the interval plus a significantly smaller error of a global nature. Numerical results confirming the sharpness of the theoretical results are displayed. Also, preliminary numerical results illustrating the application of the method to two-dimensional second-order elliptic problems are shown.     

Reasoning with graph constraints

Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicability of transformation rules. However, we believe that graph constraints may also play a significant role in the area of visual software modelling or in the specification and verification of semi-structured documents or websites (i.e. HTML or XML sets of documents). In this sense, after some discussion on these application areas, we concentrate on the problem of how to prove the consistency of specifications based on this kind of constraints. In particular, we present proof rules for two classes of graph constraints and show that our proof rules are sound and (refutationally) complete for each class. In addition, we study clause subsumption in this context as a form to speed up refutation.     

Transmission power and data rate aware routing on wireless networks

Wireless networks can vary both the transmission power and modulation of links. Existing routing protocols do not take transmission power control (TPC) and modulation adaptation (also known as rate adaptation – RA) into account at the same time, even though the performance of wireless networks can be significantly improved when routing algorithms use link characteristics to build their routes. This article proposes and evaluates extensions to routing protocols to cope with TPC and RA. The enhancements can be applied to any link state or distance vector routing protocols. An evaluation considering node density, node mobility and link error show that TPC- and RA-aware routing algorithms improve the average latency and the end-to-end throughput, while consuming less energy than traditional protocols.