Search results for "SIG"
showing 10 items of 19670 documents
Contactless generation of cavitation in high temperature liquid metals and its impact on particle dispersion in solidified iron and steel samples
2021
Abstract A recently developed method for the contactless magnetic generation of cavitation is demonstrated for high-melting-point metals. The approach is based on the floating-zone technique, which is truly contactless and crucible-free as it uses electromagnetic forces. Using this method, ultra-high-temperature ceramic particles, such as TiN, TiB2 and TiC, are admixed in liquid iron and 316L steel. The dispersion and particle refinement caused by cavitation treatment during melting and solidification are investigated. Magnetic fields up to 8 T that correspond to pressure oscillation amplitude of 0.83 MPa are used. The signal emitted by the collapsing bubbles is captured and visualized for …
Stable layer-building strategy to enhance cold-spray-based additive manufacturing
2020
Abstract Cold spray (CS) has recently become one of the popular additive manufacturing (AM) processes for its advantages: high-forming efficiency, low temperature, and no phase changing of materials. These advantages may make CS able to form large volume objects and possibly directly iterate with material-removing processes to become a hybrid AM process. Current research proposes using a bulk-based volume-forming strategy (e.g. a tessellation-based method) for volume building. Although it can form 3D volumes, the control of the process is difficult and it has limitations in forming complex 3D near-net-shapes with acceptable accuracy. This also conflicts with the basic principle of AM, where…
Sampled Fictitious Play on Networks
2019
We formulate and solve the problem of optimizing the structure of an information propagation network between multiple agents. In a given space of interests (e.g., information on certain targets), each agent is defined by a vector of their desirable information, called filter, and a vector of available information, called source. The agents seek to build a directed network that maximizes the value of the desirable source-information that reaches each agent having been filtered en route, less the expense that each agent incurs in filtering any information of no interest to them. We frame this optimization problem as a game of common interest, where the Nash equilibria can be attained as limit…
A strategic oscillation simheuristic for the Time Capacitated Arc Routing Problem with stochastic demands
2021
Abstract The Time Capacitated Arc Routing Problem (TCARP) extends the classical Capacitated Arc Routing Problem by considering time-based capacities instead of traditional loading capacities. In the TCARP, the costs associated with traversing and servicing arcs, as well as the vehicle’s capacity, are measured in time units. The increasing use of electric vehicles and unmanned aerial vehicles, which use batteries of limited duration, illustrates the importance of time-capacitated routing problems. In this paper, we consider the TCARP with stochastic demands, i.e.: the actual demands on each edge are random variables which specific values are only revealed once the vehicle traverses the arc. …
Optimal control of discrete-time interval type-2 fuzzy-model-based systems with D-stability constraint and control saturation
2016
This paper investigates the optimal control problem for discrete-time interval type-2 (IT2) fuzzy systems with pole constraints. An IT2 fuzzy controller is characterized by two predefined functions, and the membership functions and the premise rules of the IT2 fuzzy controller can be chosen freely. The pole assignment is considered, which is constrained in a presented disk region. Based on Lyapunov stability theory, sufficient conditions of asymptotic stability with an H ∞ performance are obtained for the discrete-time IT2 fuzzy model based (FMB) system. Based on the criterion, the desired IT2 state-feedback controller is designed to guarantee that the closed-loop system is asymptotically s…
Game Theoretic Decentralized Feedback Controls in Markov Jump Processes
2017
This paper studies a decentralized routing problem over a network, using the paradigm of mean-field games with large number of players. Building on a state-space extension technique, we turn the problem into an optimal control one for each single player. The main contribution is an explicit expression of the optimal decentralized control which guarantees the convergence both to local and to global equilibrium points. Furthermore, we study the stability of the system also in the presence of a delay which we model using an hysteresis operator. As a result of the hysteresis, we prove existence of multiple equilibrium points and analyze convergence conditions. The stability of the system is ill…
The probabilistic pickup-and-delivery travelling salesman problem
2019
Abstract Transportation problems are essential in commercial logistics and have been widely studied in the literature during the last decades. Many of them consist in designing routes for vehicles to move commodities between locations. This article approaches a pickup-and-delivery single-vehicle routing problem where there is susceptibility to uncertainty in customer requests. The probability distributions of the requests are assumed to be known, and the objective is to design an a priori route with minimum expected length. The problem has already been approached in the literature, but through a heuristic method. This article proposes the first exact approach to the problem. Two mathematica…
An algebraic continuous time parameter estimation for a sum of sinusoidal waveform signals
2016
In this paper, a novel algebraic method is proposed to estimate amplitudes, frequencies, and phases of a biased and noisy sum of complex exponential sinusoidal signals. The resulting parameter estimates are given by original closed formulas, constructed as integrals acting as time-varying filters of the noisy measured signal. The proposed algebraic method provides faster and more robust results, compared with usual procedures. Some computer simulations illustrate the efficiency of our method. Copyright © 2016 John Wiley & Sons, Ltd.
JOINT TOPOLOGY LEARNING AND GRAPH SIGNAL RECOVERY VIA KALMAN FILTER IN CAUSAL DATA PROCESSES
2018
In this paper, a joint graph-signal recovery approach is investigated when we have a set of noisy graph signals generated based on a causal graph process. By leveraging the Kalman filter framework, a three steps iterative algorithm is utilized to predict and update signal estimation as well as graph topology learning, called Topological Kalman Filter or TKF. Similar to the regular Kalman filter, we first predict the a posterior signal state based on the prior available data and then this prediction is updated and corrected based on the recently arrived measurement. But contrary to the conventional Kalman filter algorithm, we have no information of the transition matrix and hence we relate t…
Fast Earth Mover's Distance Computation for Catadioptric Image Sequences
2016
International audience; Earth mover's distance is one of the most effective metric for comparing histograms in various image retrieval applications. The main drawback is its computational complexity which hinders its usage in various comparison tasks. We propose fast earth mover's distance computation by providing better initialization to the transportation simplex algorithm. The new approach enables faster EMD computation in Visual Memory (VM) compared to the state of the art methods. The new proposed strategy computes earth mover distance without compromising its accuracy.