Search

In this paper, we propose a new mathematical model for power flow problem based on the linear and nonlinear matrix inequality theory. We start with rectangular model of power flow (PF) problem and then reformulate it as a Bilinear Matrix Inequality (BMI) model. A Theorem is proved which is able to convert this BMI model to a Linear Matrix Inequality (LMI) model along with One Nonconvex Quadratic Constraint (ONQC). Our proposed LMI-ONQC model for PF problem has only one single nonconvex quadratic constraint irrespective of the network size, while in the rectangular and BMI models the number of nonconvex constraints grows as the network size grows. This interesting property leads to reduced complexity level in our LMI-ONQC model which in turn makes it easier to solve for finding a PF solution. The non-conservativeness, iterative LMI solvability, well-defined and easy-to-understand geometry and pathwise connectivity of feasibility region are other important properties of proposed LMI-ONQC model which are discussed in this paper. An illustrative two-bus example is carefully studied to show different properties of our LMI-ONQC model. We have also tested our LMI-ONQC model on 30 different power-system cases including four ill-conditioned systems and compared it with a group of existing approaches. The numerical results show the promising performance of our LMI-ONQC model and its solution algorithm to find a PF solution. [ABSTRACT FROM AUTHOR]

Recently, hyperbolic deep neural networks (HDNNs) have been gaining momentum as the deep representations in the hyperbolic space provide high fidelity embeddings with few dimensions, especially for data possessing hierarchical structure. Such a hyperbolic neural architecture is quickly extended to different scientific fields, including natural language processing, single-cell RNA-sequence analysis, graph embedding, financial analysis, and computer vision. The promising results demonstrate its superior capability, significant compactness of the model, and a substantially better physical interpretability than its counterpart in the euclidean space. To stimulate future research, this paper presents a comprehensive review of the literature around the neural components in the construction of HDNN, as well as the generalization of the leading deep approaches to the hyperbolic space. It also presents current applications of various tasks, together with insightful observations and identifying open questions and promising future directions. [ABSTRACT FROM AUTHOR]

A dynamically weighted directed network (DWDN) is frequently encountered in various big data-related applications like a terminal interaction pattern analysis system (TIPAS) concerned in this study. It consists of large-scale dynamic interactions among numerous nodes. As the involved nodes increase drastically, it becomes impossible to observe their full interactions at each time slot, making a resultant DWDN High Dimensional and Incomplete (HDI). An HDI DWDN, in spite of its incompleteness, contains rich knowledge regarding involved nodes’ various behavior patterns. To extract such knowledge from an HDI DWDN, this paper proposes a novel Alternating direction method of multipliers (ADMM)-based Nonnegative Latent-factorization of Tensors (ANLT) model. It adopts three-fold ideas: a) building a data density-oriented augmented Lagrangian function for efficiently handling an HDI tensor's incompleteness and nonnegativity; b) splitting the optimization task in each iteration into an elaborately designed subtask series where each one is solved based on the previously solved ones following the ADMM principle to achieve fast convergence; and c) theoretically proving that its convergence is guaranteed with its efficient learning scheme. Experimental results on six DWDNs from real applications demonstrate that the proposed ANLT outperforms state-of-the-art models significantly in both computational efficiency and prediction accuracy for missing links of an HDI DWDN. Hence, this study proposes a novel and efficient approach to large-scale DWDN representation. [ABSTRACT FROM AUTHOR]

Recently, hyperbolic deep neural networks (HDNNs) have been gaining momentum as the deep representations in the hyperbolic space provide high fidelity embeddings with few dimensions, especially for data possessing hierarchical structure. Such a hyperbolic neural architecture is quickly extended to different scientific fields, including natural language processing, single-cell RNA-sequence analysis, graph embedding, financial analysis, and computer vision. The promising results demonstrate its superior capability, significant compactness of the model, and a substantially better physical interpretability than its counterpart in the euclidean space. To stimulate future research, this paper presents a comprehensive review of the literature around the neural components in the construction of HDNN, as well as the generalization of the leading deep approaches to the hyperbolic space. It also presents current applications of various tasks, together with insightful observations and identifying open questions and promising future directions. [ABSTRACT FROM AUTHOR]

A dynamically weighted directed network (DWDN) is frequently encountered in various big data-related applications like a terminal interaction pattern analysis system (TIPAS) concerned in this study. It consists of large-scale dynamic interactions among numerous nodes. As the involved nodes increase drastically, it becomes impossible to observe their full interactions at each time slot, making a resultant DWDN High Dimensional and Incomplete (HDI). An HDI DWDN, in spite of its incompleteness, contains rich knowledge regarding involved nodes’ various behavior patterns. To extract such knowledge from an HDI DWDN, this paper proposes a novel Alternating direction method of multipliers (ADMM)-based Nonnegative Latent-factorization of Tensors (ANLT) model. It adopts three-fold ideas: a) building a data density-oriented augmented Lagrangian function for efficiently handling an HDI tensor's incompleteness and nonnegativity; b) splitting the optimization task in each iteration into an elaborately designed subtask series where each one is solved based on the previously solved ones following the ADMM principle to achieve fast convergence; and c) theoretically proving that its convergence is guaranteed with its efficient learning scheme. Experimental results on six DWDNs from real applications demonstrate that the proposed ANLT outperforms state-of-the-art models significantly in both computational efficiency and prediction accuracy for missing links of an HDI DWDN. Hence, this study proposes a novel and efficient approach to large-scale DWDN representation. [ABSTRACT FROM AUTHOR]

A new smooth model is proposed in this paper to eliminate the non-differentiability of several types of limits in power flow models. The proposed smooth model accurately represents power system static models with limits as a continuously differentiable function. Analytic results are developed to show that each solution of the proposed smooth model is arbitrarily close to a solution of the corresponding original power flow model with limits. The proposed smooth model includes a wide range of devices with physical limits, such as generators, transformers, HVDCs, phase shifters, and shunts. In addition, it is shown that every generic static bifurcation in the original model is transformed into a saddle-node bifurcation in the smoothed model. Hence, the search for bifurcations in voltage stability assessment can be greatly simplified. Several numerical studies of the proposed smooth model on a 9241-bus power system and on a 13659-bus power system have shown promising results. [ABSTRACT FROM AUTHOR]

$\ell _{1}$ ℓ 1 -norm quantile regression is a common choice if there exists outlier or heavy-tailed error in high-dimensional data sets. However, it is computationally expensive to solve this problem when the feature size of data is ultra high. As far as we know, existing screening rules can not speed up the computation of the $\ell _{1}$ ℓ 1 -norm quantile regression, which dues to the non-differentiability of the quantile function/pinball loss. In this paper, we introduce the dual circumscribed sphere technique and propose a novel $\ell _{1}$ ℓ 1 -norm quantile regression screening rule. Our rule is expressed as the closed-form function of given data and eliminates inactive features with a low computational cost. Numerical experiments on some simulation and real data sets show that this screening rule can be used to eliminate almost all inactive features. Moreover, this rule can help to reduce up to 23 times of computational time, compared with the computation without our screening rule. [ABSTRACT FROM AUTHOR]

This paper presents a passive lumped model for DC cables and overhead lines, taking into account the frequency dependency of the per-unit-length parameters due to the skin and proximity effects. In comparison to distributed parameter line models, such as the Frequency-Dependent Phase model of PSCAD, the proposed model does not require line propagation delay extraction and does not impose any restrictions on the simulation timestep. As a result, for electrically short lines, the introduced model is more computationally efficient than distributed parameter models as it enables simulation using larger timesteps. The performance of the proposed model is evaluated in comparison with the PI model and the Frequency-Dependent Phase model through time-domain simulations of a DC microgrid and a radial DC distribution feeder. The studies performed in PSCAD focus on fault-induced transients. The results indicate that for electrically short lines the developed model is significantly more accurate compared to the PI model and provides similar accuracy with more computational efficiency compared to the Frequency-Dependent Phase model. [ABSTRACT FROM AUTHOR]

This paper presents frequency domain (FD) Norton-type equivalents of single- and three-phase photovoltaic (PV) generators, aimed at transient calculations. The proposed equivalents can be interfaced with a general frequency-dependent network and/or nonlinear loads and include voltage/current sources representing initial conditions aimed at partitioned-time transient simulation. The transient solution is performed via the numerical Laplace transform (NLT) in a sequential scheme by using time sub-windows with corresponding initial conditions and using reduced number of samples. The proposed approach overcomes the issue of computationally heavy simulations as in classical implementations of NLT. Two case studies involving PV generator and nonlinear load are presented to illustrate the performance of the proposed FD PV models. [ABSTRACT FROM AUTHOR]

This papers presents a numerical approach based on computational fluid dynamics (CFD) that was developed to ensure that gravity oil-water separators at Hydro-Québec electrical substations comply with the environmental legislation in place. More precisely, multiphase simulations are performed for two operating conditions of an in service separator, and an experimental setup is used to produce an oil spill and to measure the time-varying oil concentration at the separator outlet. The results show that, for the tested conditions, the oil droplet size at a separator inlet generally follows a log-normal distribution and that the droplet diameter varies between 100 and 1000 µm with a mean value of 475 µm. Furthermore, both the experimental and numerical results show that the time required for the oil droplets to reach the separator outlet is quite shorter than the theoretical mean residence time. Finally, this study demonstrates that the numerical model predicts the separator efficiency within 1% of the measured value, and that it can be a valuable tool to investigate existing separators or to design new ones. [ABSTRACT FROM AUTHOR]

Intelligent metasurfaces to create smart electromagnetic environments have attracted a surge of interest. The multiscale property of metasurfaces results in a huge computational challenge, further hindering their engineering development. Our previous paper has developed a fast finite difference time domain (FDTD) algorithm for patchlike metasurfaces analysis using the surface susceptibility model (SSM). This study extends that to efficient fishnetlike metasurfaces analysis using the surface porosity model (SPM), a useful complement to SSM. We introduce the SPM to FDTD, replacing brute force simulations, to accelerate fishnetlike metasurfaces analysis. At last, we conduct a series of numerical experiments, demonstrating that the proposed FDTD-SPM algorithm greatly reduces the number of computational meshing lattices and the consumed time. [ABSTRACT FROM AUTHOR]

Electromagnetic Transient (EMT) simulation tools are typically developed using conventional procedural programming languages. On the other hand, modern high-level and equation-based programming languages, such as Modelica, are currently available. Modelica allows formulating models that are easy to develop, maintain and understand by expressing what needs to be computed without stating how it should be computed. This paper presents a Modelica-based simulator for electromagnetic transients. It is demonstrated that this approach offers significant advantages for developing sophisticated models. Computational performance and accuracy are compared to a conventional EMT-type simulation tool. [ABSTRACT FROM AUTHOR]

Modular multilevel converters have become the technology of choice in high voltage direct current systems. They are composed of a large number of submodules, which poses significant computational challenges to electromagnetic transient simulations. To address this issue, scholars proposed several approaches that are a trade-off between simulation accuracy and computational burden, which mainly achieve numerical efficiency by adopting reduced and simplified models of the converter arm submodules. This paper proposes a different simulation paradigm based on sub-circuit isomorphism. It is suited for the analysis of intrinsically modular electronic circuits, as it exploits the common behavior of structurally identical submodules by clustering them together. This method does not require any simplification of the submodule electrical model and minimizes the number of equations to be solved at each time step of the time domain analysis, thereby significantly reducing the computational effort. Thus, this method is suitable for thorough simulations of ac/dc networks, which may require the implementation of detailed transistor-level representations of the converter submodules. [ABSTRACT FROM AUTHOR]

Objective: Computational modeling is increasingly used to design charging systems for implanted medical devices. The design of these systems must often satisfy conflicting requirements, such as charging speed, specific absorption rate (SAR) and coil size. Fast electromagnetic solvers are pivotal for enabling multi-criteria optimization. In this paper, we present an analytical model based on the quasi-static approximation as a fast, yet sufficiently accurate tool for optimizing inductive charging systems. Methods: The approximate model was benchmarked against full-wave simulations to validate accuracy and improvement in computation time. The coupling factor of two test coils was measured for lateral and axial displacements and the SAR was measured experimentally in a PAA phantom. Results: The approximate model takes only 11 seconds to compute a single iteration, while the full-wave model takes 5 hours to compute the same case. The maximum difference with full-wave simulations was less than 24% and the mean difference less than 2%. Adding a novel figure of merit into the multi-criterion optimization resulted in a 16% higher charging speed. The measured results of the SAR and coupling factor are within a 5 mm coil offset margin. Conclusion: The proposed approximate model succeeds as a rapid prototyping tool, enabling fast and sufficiently accurate optimization for wireless charging systems. Significance: The approximate model is the first of its kind to compute both the coupling factor and the SAR near conducting structures fast enough to enable optimization of charging speed. [ABSTRACT FROM AUTHOR]

Modeling of brain tumor dynamics has the potential to advance therapeutic planning. Current modeling approaches resort to numerical solvers that simulate the tumor progression according to a given differential equation. Using highly-efficient numerical solvers, a single forward simulation takes up to a few minutes of compute. At the same time, clinical applications of tumor modeling often imply solving an inverse problem, requiring up to tens of thousands of forward model evaluations when used for a Bayesian model personalization via sampling. This results in a total inference time prohibitively expensive for clinical translation. While recent data-driven approaches become capable of emulating physics simulation, they tend to fail in generalizing over the variability of the boundary conditions imposed by the patient-specific anatomy. In this paper, we propose a learnable surrogate for simulating tumor growth which maps the biophysical model parameters directly to simulation outputs, i.e. the local tumor cell densities, whilst respecting patient geometry. We test the neural solver in a Bayesian model personalization task for a cohort of glioma patients. Bayesian inference using the proposed surrogate yields estimates analogous to those obtained by solving the forward model with a regular numerical solver. The near real-time computation cost renders the proposed method suitable for clinical settings. The code is available at https://github.com/IvanEz/tumor-surrogate. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of fast transient simulation of high-speed coupled channels driven by transceivers that include transmitter feed-forward equalization (TX-FFE). Practical circuit hardware implementations of such drivers may not be correctly represented by industry-standard algorithmic modeling interfaces (AMIs), which are usually based on ideal digital finite impulse response filters. In particular, slow transients may arise when aggressive FFE is activated and particular switching sequences significantly stress local voltage regulators integrated in the output buffers. In this paper, we model this effect using a constructive hierarchical approximation of the analog waveforms that form a linearized vector Thevenin or Norton representation of the driver. This representation enables the accurate simulation of coupled channels including both differential- and common-mode signals. Analog waveforms at the receiver input are readily obtained by standard time-frequency transformations while including channel characteristics and any additional linear equalization block, if present. This proposed framework is compatible with industry-standard AMIs, extending their scope to coupled channels with nonideal TX-FFE circuit blocks. Eye diagrams and transient waveforms corresponding to millions of bits are computed in few seconds using a nonoptimized software implementation. Random jitter and crosstalk are seemlessly included as in standard AMI frameworks. The results of various numerical experiments on commercial transceivers are reported in this paper, confirming both the accuracy and the efficiency of the proposed framework. [ABSTRACT FROM AUTHOR]

This paper proposes a novel approach for power system dynamic simulation based on the differential transformation (DT). The DT is introduced to study power systems as high-dimensional nonlinear dynamical systems for the first time, and is able to avoid computations of high-order derivatives with nonlinear differential equations by its transform rules. This paper, first, proposes and proves several new transform rules for generic nonlinear functions that often appear in power system models, and then uses these rules to transform representative power system models such as the synchronous machine model with trigonometric functions and the exciter model with exponential and square root functions. This paper also designs a DT-based simulation scheme that allows significantly prolonged time steps to reduce simulation time compared to a traditional numerical approach. The numerical stability, accuracy, and time performance of the proposed new DT-based simulation approach are compared with widely used numerical methods on the IEEE 39-bus system and Polish 2383-bus system. [ABSTRACT FROM AUTHOR]

This paper introduces a fully automated greedy algorithm for the construction of parameterized behavioral models of electromagnetic structures, targeting at the same time uniform model stability and passivity. The proposed algorithm is able to determine a small set of parameter configurations for which an external solver provides on-the-fly the sampled scattering parameters of the structure over a predetermined frequency band. These samples are subjected to a multivariate rational/polynomial fitting process, which iteratively leads to a parameterized descriptor realization of the model. The main novel contribution in this paper is the adoption of a model-based approach for the adaptive augmentation of an initially small set of frequency responses, each corresponding to a randomly selected parameter configuration. In particular, the locations of the in-band passivity violations of intermediate macromodels constructed at each iteration are used as a proxy for the model-data error in those regions where input data are not available. This physics-based consistency check, which is enabled by recent developments in multivariate passivity characterization based on Skew-Hamiltonian–Hamiltonian (SHH) spectra, is combined with standard space exploration metrics to obtain a small-size and automatically determined distribution of points in the parameter space, leading to the construction of an accurate macromodel with a very limited number of external field solver runs. The embedded passivity check and enforcement process guarantees that either the final model is passive throughout the parameter space or the residual violations, if present, are negligible for practical purposes. Several examples validate the proposed approach for up to three concurrent parameters. [ABSTRACT FROM AUTHOR]

This paper presents a novel approach to dynamic phasor-based transient stability simulation. The proposed method is based on the modified nodal analysis (MNA) approach to circuit simulation, which is used to construct continuous differential-algebraic equations (DAEs). The proposed method makes use of the stamp technique, which makes it possible to construct a general purpose MNA-based simulator. Stamp-based models for common power system components are derived in this work. A new MNA-based synchronous machine model is presented, which represents machines as nonlinear inductances instead of subtransient equivalents. The resultant continuous DAEs are numerically solved using the general purpose variable step and variable order library IDA. Simulation results from the IEEE 68 bus test system, a real 400 bus power system, and the IEEE 39 bus test system with an embedded HVdc transmission system demonstrate that the proposed method is suitable for large ac networks with power electronic devices. The results demonstrate good agreement between the proposed method and electromagnetic transient (EMT) simulation. The results also demonstrate that the proposed method is fast and scalable with CPU times that are up to 200 times faster than EMT simulation. [ABSTRACT FROM AUTHOR]

To design a reliable and secure power system, it is necessary to have enough transmission capacity. The solution of transmission expansion planning (TEP) problem determines cost-optimal investment in future transmission equipment. In this paper, we propose a new global solver, named Global-TEP, for the TEP problem with an AC network representation (ACTEP), which is a mixed-integer nonlinear programming problem. The proposed solver is based on second-order cone relaxation, enhanced relaxation tightening constraints, and optimization-based/feasibility-based bound tightening techniques. Multiple enhanced relaxation tightening constraints are incorporated into the mixed-integer second-order cone relaxation of TEP in order to obtain a very strong relaxation as the lower bounding problem. In addition, a novel feasibility-based bound tightening technique is proposed to tighten the bounds of decision variables in a considerably short runtime. Finally, introducing a novel application of optimization-based bound tightening technique, Global-TEP is constructed that can solve the ACTEP problem efficiently with a guaranteed optimality gap. As illustrated by numerical case studies, Global-TEP is more scalable, more flexible, and much faster than the available global solvers. [ABSTRACT FROM AUTHOR]

For the popular second-order conic program (SOCP) formulation of AC optimal power flow (OPF) in a radial network, this paper first shows that it does not have the strong duality property in general. Then, through a series of restrictive reformulations, we derive a set of closed-form sufficient conditions on network parameters that ensure its strong duality. Numerical studies on IEEE 33-bus, 69-bus test networks and two real-world distribution systems confirm that non-negligible duality gaps do exist in this SOCP formulation, and also demonstrate the validity of the proposed sufficient conditions on closing the duality gap. Our results provide an analytical tool to ensure the strong duality of the SOCP power flow formulation and to support algorithm developments for its complex extensions. [ABSTRACT FROM AUTHOR]

This paper focuses on the transient modelling of a specific type of permanent magnet linear synchronous machine designed for line-start operation. The machine uses conductive ladders embedded in the mover to realise a permanent-magnet machine capable of line-start operation. Transient modelling of this type of machine under line-start conditions is critical to optimising machine design, and electrical and mechanical performance prediction, which leads us to devise a novel set of matrices of electrical parameters first. These matrices are developed considering both the impact of the conductive ladders and the longitudinal end effect based on electromagnetic field analysis. The model is then suitable for numerical computation in typical simulation environments. This yields a sufficiently accurate transient model that is verified by experimental results. Hence our novel model, that includes the longitudinal end effects and the effects of conductive ladders, is proven effective in predicting the line-start transients and associated electrical and mechanical performance. The novel model assists in the design optimisation stage where a compromise between synchronised performance and line-start operation is required. The novel machine type can then be investigated as a competitive candidate topology in various applications including electromagnetic launch. [ABSTRACT FROM AUTHOR]

With continuing advances in high-performance parallel computing platforms, parallel algorithms have become powerful tools for development of faster than real-time power system dynamic simulations. In particular, it has been demonstrated in recent years that parallel-in-time (Parareal) algorithms have the potential to achieve such an ambitious goal. The selection of a fast and reasonably accurate coarse operator of the Parareal algorithm is crucial for its effective utilization and performance. This paper examines semi-analytical solution (SAS) methods as the coarse operators of the Parareal algorithm and explores performance of the SAS methods to the standard numerical time integration methods. Two promising time-power series-based SAS methods were considered; Adomian decomposition method and Homotopy analysis method with a windowing approach for improving the convergence. Numerical performance case studies on 10-generator 39-bus system and 327-generator 2383-bus system were performed for these coarse operators over different disturbances, evaluating the number of Parareal iterations, computational time, and stability of convergence. All the coarse operators tested with different scenarios have converged to the same corresponding true solution (if they are convergent) and the SAS methods provide comparable computational speed, while having more stable convergence to the true solution in many cases. [ABSTRACT FROM AUTHOR]

Recently there has been an increasing interest in the multivariate Gaussian process (MGP) which extends the Gaussian process (GP) to deal with multiple outputs. One approach to construct the MGP and account for non-trivial commonalities amongst outputs employs a convolution process (CP). The CP is based on the idea of sharing latent functions across several convolutions. Despite the elegance of the CP construction, it provides new challenges that need yet to be tackled. First, even with a moderate number of outputs, model building is extremely prohibitive due to the huge increase in computational demands and number of parameters to be estimated. Second, the negative transfer of knowledge may occur when some outputs do not share commonalities. In this paper we address these issues. We propose a regularized pairwise modeling approach for the MGP established using CP. The key feature of our approach is to distribute the estimation of the full multivariate model into a group of bivariate GPs which are individually built. Interestingly pairwise modeling turns out to possess unique characteristics, which allows us to tackle the challenge of negative transfer through penalizing the latent function that facilitates information sharing in each bivariate model. Predictions are then made through combining predictions from the bivariate models within a Bayesian framework. The proposed method has excellent scalability when the number of outputs is large and minimizes the negative transfer of knowledge between uncorrelated outputs. Statistical guarantees for the proposed method are studied and its advantageous features are demonstrated through numerical studies. [ABSTRACT FROM AUTHOR]

Objective: Aortic dissection is a life-threatening event which starts most of the time with an intimal tear propagating along the aortic wall, while blood enters the medial layer and delaminates the medial lamellar units. Studies investigating the mechanisms underlying the initiation sequence of aortic dissection are rare in the literature, the majority of studies being focused on the propagation event. Numerical models can provide a deeper understanding of the phenomena involved during the initiation and the propagation of the initial tear, and how geometrical and mechanical parameters affect this event. In the present paper, we investigated the primary factors contributing to aortic dissection. Methods: A two-layer arterial model with an initial tear was developed, representing three different possible configurations depending on the initial direction of the tear. Anisotropic damage initiation criteria were developed based on uniaxial and shear experiments from the literature to predict the onset and the direction of crack propagation. We used the XFEM-based cohesive segment method to model the initiation and the early propagation of the tear along the aorta. A design of experiment was used to quantify the influence of 7 parameters reflecting crack geometry and mechanics of the wall on the critical pressure triggering the dissection and the directions of propagation of the tear. Results: The results showed that the obtained critical pressures (mean range from 206 to 251 mmHg) are in line with measurement from the literature. The medial tensile strength was found to be the most influential factor, suggesting that a medial degeneration is needed to reach a physiological critical pressure and to propagate a tear in an aortic dissection. The geometry of the tear and its location inside the aortic wall were also found to have an important role not only in the triggering of tear propagation, but also in the evolution of the tear into either aortic rupture or aortic dissection. A larger and deeper initial tear increases the risk of aortic dissection. Conclusion: The numerical model was able to reproduce the behaviour of the aorta during the initiation and propagation of an aortic dissection. In addition to confirm multiple results from the literature, different types of tears were compared and the influence of several geometrical and mechanical parameters on the critical pressure and direction of propagation was evaluated with a parametric study for each tear configuration. Significance: Although these results should be experimentally validated, they allow a better understanding of the phenomena behind aortic dissection and can help in improving the diagnosis and treatment of this disease. [ABSTRACT FROM AUTHOR]

Large blackouts in power grids are often the consequence of uncontrolled failure cascades. The ability to predict the failure cascade process in an efficient and accurate manner is important for power system contingency analysis. In this paper, we propose to apply the influence model for the prediction and screening of failure cascades in large scale DC and AC power networks. Then, the trained influence model is applied to some large power grids with thousands of buses and transmission lines. The prediction performance is evaluated in four different aspects, from the global perspective of the overall failure size to the individual information regarding the link failure time. The results show that under limited training samples, the proposed framework is capable of predicting the failure cascade size with a 7% error rate, the final state of links with a 10% error rate, and the failure time within 1 time unit for both the DC and AC model. One major advantage of the proposed method is that it can reduce the computational time of the failure cascade prediction by a few orders of magnitude with limited compromise in accuracy, as compared to the power flow based contingency analysis. Another important feature of the proposed method is that the trained influence parameters can reveal the critical initial contingencies. This information is very helpful for identifying the worst contingency scenarios for system operators. [ABSTRACT FROM AUTHOR]

Linearization of power flow is an important topic in power system analysis. The computational burden can be greatly reduced under the linear power flow (LPF) model while the model error is the main concern. Therefore, various linear power flow models have been proposed in literature and dedicated to seek better linear models. Many linear power flow models are based on some kind of transformation/simplification/Taylor expansion of AC power flow equations. In this paper, numerical performance and theoretical explanation of the data-based linear power flow model are investigated. The direct least-squares method with complete orthogonal decomposition is designed for addressing collinear data and big data. The resulted linear power flow model is named as least-squares distribution factors (LSDF) and its performance is investigated in cold-start applications. It is found that LSDF is in fact an approximation of the optimal LPF with minimum mean square error. It is also proved that the LSDF can give an accurate estimation of total system losses. Comprehensive numerical testing show that the LSDF can work very well for system with large load variations. The average error of LSDF is only about 1% of the average error of power transfer distribution factor (PTDF) in numerical testing. [ABSTRACT FROM AUTHOR]

In this paper, characteristic model-based modeling and control approaches for complex dynamical networks based on sampled data are studied. It shows that the characteristic model, in which underline network topological structures are simplified, can provide a straightforward and implicit description for network dynamics. The induced parameter estimation method can further make the model adaptive and purely data-driven. Moreover, a control law based on this model is also proposed to govern the network dynamics. Finally, the theoretical results are verified through numerical simulations of modeling and stabilizing a dynamical network. [ABSTRACT FROM AUTHOR]

Solving power flow (PF) equations is the basis of power flow analysis, which is important in determining the best operation of existing systems, performing security analysis, etc. However, PF equations can be out-of-date or even unavailable due to system dynamics, and uncertainties, making traditional numerical approaches infeasible. To address these concerns, researchers have proposed data-driven approaches to solve the PF problem by learning the mapping rules from historical system operation data. Nevertheless, prior data-driven approaches suffer from poor performance, and generalizability, due to overly simplified assumptions of the PF problem or ignorance of physical laws governing power systems. In this paper, we propose a physics-guided neural network to solve the PF problem, with an auxiliary task to rebuild the PF model. By encoding different granularity of Kirchhoff's laws, and system topology into the rebuilt PF model, our neural-network based PF solver is regularized by the auxiliary task, and constrained by the physical laws. The simulation results show that our physics-guided neural network methods achieve better performance, and generalizability compared to existing unconstrained data-driven approaches. Furthermore, we demonstrate that the weight matrices of the proposed neural networks embody power system physics by showing their similarities with the bus admittance matrices. [ABSTRACT FROM AUTHOR]

Quantization has been proven to be an effective method for reducing the computing and/or storage cost of DNNs. However, the trade-off between the quantization bitwidth and final accuracy is complex and non-convex, which makes it difficult to be optimized directly. Minimizing direct quantization loss (DQL) of the coefficient data is an effective local optimization method, but previous works often neglect the accurate control of the DQL, resulting in a higher loss of the final DNN model accuracy. In this paper, we propose a novel metric, called Vector Loss. Using this new metric, we decompose the minimization of the DQL to two independent optimization processes, which significantly outperform the traditional iterative L2 loss minimization process in terms of effectiveness, quantization loss as well as final DNN accuracy. We also develop a new DNN quantization solution called VecQ, which provides minimal direct quantization loss and achieve higher model accuracy. In order to speed up the proposed quantization process during model training, we accelerate the quantization process with a parameterized probability estimation method and template-based derivation calculation. We evaluate our proposed algorithm on MNIST, CIFAR, ImageNet, IMDB movie review and THUCNews text data sets with numerical DNN models. The results demonstrate that our proposed quantization solution is more accurate and effective than the state-of-the-art approaches yet with more flexible bitwidth support. Moreover, the evaluation of our quantized models on Salient Object Detection (SOD) tasks maintains comparable feature extraction quality with up to 16× weight size reduction. [ABSTRACT FROM AUTHOR]

The interest in the use of atmospheric-pressure plasma jets (APPJs) is constantly growing. APPJs offer various ranges for applications, such as wound healing, cancer treatment, and dental care. The complex plasma chemistry plays an important role in each of these fields but is often poorly understood. In this paper, the production of atomic oxygen in a radio frequency helium–oxygen plasma is investigated by means of a numerical simulation. A 1-D discharge of an atmospheric-pressure plasma jet is created with the plasma module of COMSOL Multiphysics, using a set of 25 reactions. Many 1-D simulations usually cannot estimate the power deposition in a correct way because of suspected arising losses, such as radiation and inefficiencies of the external circuit. In order to match the experimental power deposition of 13 W, high voltages (855 V) are required in the model. Such high voltages cause changes in the plasma characteristics like a switch in the glow mode. The impact of the voltage on the plasma is investigated by the comparison of a low-voltage (325 V) simulation, which matches the experimental oxygen production, and a high-voltage (855 V) simulation, which matches the experimental power deposition. Outcomes of this paper further support the idea that the power deposition measured in experiments is higher than the actual power deposition coupled to the plasma. [ABSTRACT FROM AUTHOR]

Prognostics play an increasingly important role in modern engineering systems for smart maintenance decision-making. In parametric regression-based approaches, the parametric models are often too rigid to model degradation signals in many applications. In this paper, we propose a Bayesian multiple-change-point (CP) modeling framework to better capture the degradation path and improve the prognostics. At the offline modeling stage, a novel stochastic process is proposed to model the joint prior of CPs and positions. All hyperparameters are estimated through an empirical two-stage process. At the online monitoring and remaining useful life (RUL) prediction stage, a recursive updating algorithm is developed to exactly calculate the posterior distribution and RUL prediction sequentially. To control the computational cost, a fixed-support-size strategy in the online model updating and a partial Monte Carlo strategy in the RUL prediction are proposed. The effectiveness and advantages of the proposed method are demonstrated through thorough simulation and real case studies. Note to Practitioners—Degradation signals have been widely used in determining the current health condition and estimate the remaining useful life (RUL) of a component or a system. Most of the existing prognostics utilize a parametric regression model to describe the evolution path of degradation signals for RUL prediction. The common functional forms of these models include simple linear, quadratic, and exponential functions. However, in many applications, the degradation signals show multiple-segment characteristics and the existing parametric forms are inadequate to capture the degradation trend. Motivated by such issue, this paper presents a multiple-change-point (CP) modeling approach, where the degradation signal is divided into several consecutive segments by CPs, and each segment is modeled by a unique parametric model. To capture the heterogeneity across different units, all the parameters, including the number and locations of CPs and model parameters of each segment, are assumed to be random variables following certain distributions. Then, we develop a statistical method to estimate these distributions using historical data. At the online monitoring stage, we develop an innovative updating algorithm to exactly calculate the closed forms of the posterior distributions of the latest CP, the current segment, and model parameters of the current segment. We also derive a closed form for the RUL distribution estimation. Later, several efficient approximation strategies are proposed to reduce the computational burden. Simulation studies and real case studies have shown that the proposed methodology has much better performance than those of existing approaches in handling degradation signals of multiple-segment characteristics. [ABSTRACT FROM AUTHOR]

This paper is devoted to the description of a new approach for large-scale electric power systems (EPS) simulation, so-called hybrid simulation approach. The design and research of EPS require solving a large number of non-trivial tasks. Due to the well-known EPS specificity, mathematical modeling is the only way to proceed. According to the hybrid approach, several simulation techniques (analogue, digital, and physical) are used to achieve the best results. An analogue part provides the elimination of methodological integration error, which appears in a case of numerical methods usage. A digital part allows the realization of control and parameter changing algorithms on software level. In a physical part, the connection and switching of modeled elements are provided in a way as in real EPS. In addition, the paper presents hardware features of the simulator—hybrid real-time power system simulator (HRTSim), which is an alternative to the digital simulators currently used. The important part of this paper is the result of comparative analysis of transient processes oscillograms obtained by HRTSim and real disturbance recorders in Tomsk region power system, as well as HRTSim and real-time digital simulator. [ABSTRACT FROM AUTHOR]

Simulating the interaction of RF-waves with charged particle beams is difficult and computationally expensive, even on present high-end computers. There is a tradeoff between fidelity and complexity/expense of the two primary techniques, particle-in-cell and envelope methods. This paper presents an approach based on the partial decomposition of the Maxwell equations to achieve a fully second-order set of ordinary differential equations (ODEs) describing the interaction. It has the potential for self-consistent inclusion of ac and dc space-charge effects through a solution of evanescent ODEs, effects that are handled poorly, if at all, by existing envelope methods. The resulting technique provides flexibility in adjusting simulation fidelity versus computational costs. The developments presented in this paper establish a mathematical framework for this technique and test its core aspects by demonstrating accurate solution of the ODEs using analytic sources. [ABSTRACT FROM AUTHOR]

This paper investigates the deployment issue of an emergency medical service (EMS) system to maintain the preferred service coverages under different considerations. Specifically, two coverage levels are introduced to reflect the requirements under the regular situation and the situation with ambulance unavailable. We propose the two-stage robust optimization (RO) models to design a reliable ambulance system subject to unavailability of the ambulances, with and without the ambulance relocation. For the RO problem with mixed-integer recourse for relocation, we customize the column and constraint generation method with an approximation strategy to handle the computational challenge. Our numerical study: 1) demonstrates that our RO formulations have a strong modeling capacity on designing the EMS system; 2) shows that our approximation algorithm performs very well; and 3) provides a quantitative evaluation of, including, relocation operations on the system performance. Note to Practitioners—This paper presents the novel optimization models to help ambulance deployment. Due to ambulance unavailability and relocation operations, traditional optimization formulations might not be sufficient for modeling or might be hard for computation. In this paper, we provide an uncertainty set-based approach to capture ambulance unavailability and to build the robust optimization models (with relocation recourse decisions). Also, efficient algorithms are designed to support practical instances. Numerical results are very supportive to our new models and computational methods. [ABSTRACT FROM AUTHOR]

Ranking and selection (R&S) procedures are powerful tools to enhance the efficiency of simulation-based optimization. In this paper, we consider the R&S problem subject to stochastic constraints and seek to improve the selection efficiency by incorporating the information from across the domain into quadratic regression metamodels. To better fulfill the quadratic assumption of the regression metamodel used in this paper, we divide the solution space into adjacent partitions such that the underlying functions of both the objective and constraint measures in each partition are approximately quadratic with homogeneous noise. Using the large deviations theory, we characterize the asymptotically optimal allocation rule by maximizing the rate at which the probability of false selection tends to zero. Numerical experiments demonstrate that our approach dramatically improves the selection efficiency by 50%–90% on some typical selection examples compared with the existing approaches. Note to Practitioners—Simulation is widely used for designing and analyzing complex discrete-event systems such as manufacturing production systems, transportation systems, and supply chain operations. However, efficiency is still a significant concern when using simulation for stochastic optimization problems, especially in the presence of stochastic constraints. This paper was motivated by the problem of selecting the best feasible design (solution) from a finite set of alternatives given anobjective and stochastic constraints, where the performances of the objective and constraint measures can be estimated via simulation. Different from the existing approaches in the literature, in this paper, we propose a new R&S procedure using regression metamodels. Given a fixed amount of computing budget, our approach determines the asymptotic optimal number of simulation replications for each design. It can be shown through numerical experiments that the proposed approach can significantly improve the selection efficiency by more than 50% over the existing methods on some typical benchmark examples. [ABSTRACT FROM AUTHOR]

The objective of this paper is to advance the state of the art of aggressive space mapping (ASM) by demonstrating how, for resonant structures, and microwave filters in particular, an ASM-based optimization procedure may converge to the desired target performance in just one step. This behavior is first justified in physical terms, using the electromagnetic cavity perturbation theory, and is then investigated numerically. Several practical filter design demonstrations are also presented. This paper is concluded with a conceptual definition of Space Alignment in the context of ASM. [ABSTRACT FROM AUTHOR]

Magnetic flux leakage (MFL) response predicting is important for defect estimation. This paper first proposes a concept of basic signal by discovering the combination property of the MFL response. The basic signal can be used to predict the MFL response conveniently by a basic signal combination method (BSCM), which is also innovatively put forward in this paper. In this method, the basic signal is calculated in advance, and the MFL response can be calculated by several transformation and combination operations. Both the simulation and experimental results demonstrate the feasibility of BSCM. Compared with other traditional methods (magnetic dipole method and finite-element method), BSCM shows a good performance on both the computational speed and accuracy. [ABSTRACT FROM AUTHOR]

This paper considers the scheduling of stochastic customer orders to minimize expected cycle time. Customer orders dynamically arrive at a machine station, and each order consists of multiple product types. Random workloads are required by each product type, and the workloads are assigned to a set of unrelated parallel machines in the station to be processed. The objective is to obtain the minimal long-run expected order cycle time through proper workload assignments. In view of the difficulty in evaluating the objective function, this paper models the targeted problem as a simulation optimization problem and proposes to solve it under the multifidelity model framework. To improve the efficiency in evaluating candidate solutions, a low-fidelity model is constructed to select solutions with better performances for high-fidelity simulations. The effectiveness of this low-fidelity model is demonstrated through a series of theoretical evidences. A simulation optimization algorithm, named Bound-Multi-fidelity Optimization with Ordinal Transformation and Optimal Sampling Bound-(MO2TOS), is developed by taking advantage of the properties of the low-fidelity model. Numerical experiments are conducted to evaluate the performance of the proposed algorithm against three other well-known simulation optimization algorithms in the literature. Results indicate that the Bound-MO2TOS outperforms all the other tested algorithms, and its performance is robust against changes in problem scale. Note to Practitioners—Customer order scheduling models have wide applications in industries where every single order may contain multiple product types and the entire order requires one shipment delivery. In many applications, such as pigments dyes manufacturing, auto repair, and grocery, consideration of customer orders rather than individual jobs is often preferred. Given the stochastic nature and the synchronization constraints of the problem, a multifidelity simulation algorithm named Bound-Multi-fidelity Optimization with Ordinal Transformation and Optimal Sampling Bound-(MO2TOS) is proposed. Experimental results suggest that the proposed algorithm outperforms three other popular simulation optimization algorithms under a variety of scenarios. It is admitted that further improvement can be made in refining the computation resource distribution process of Bound-MO2TOS. In the future research, such an improvement will be more thoroughly elaborated so that practitioners can utilize it to coordinate their productions better. [ABSTRACT FROM AUTHOR]

Day-Ahead Unit Commitment (UC) is an important problem faced by Independent System Operators (ISOs). Midcontinent ISO as the largest ISO in US, solves a complicated UC problem involving over 45,000 buses and 1,400 generation resources. With the increasing number of combined cycle units (CCs) represented by configuration-based modeling, solving the problem becomes more challenging. The state-of-the-practice branch-and-cut method suffers from poor performance when there are a large number of CCs. The goal of this paper is to solve such large UC problems with near-optimal solutions within time limits. In this paper, our recently developed Surrogate Lagrangian Relaxation, which overcomes major difficulties of Lagrangian Relaxation by not requiring dual optimal costs, is significantly enhanced through adding quadratic penalties on constraint violations to accelerate convergence. Quadratic penalty terms are linearized through a novel use of absolute value functions. Therefore, resource-level subproblems can be formulated and solved by branch-and-cut. Complicated constraints within a CC unit are thus handled within a subproblem. Subproblem solutions are then effectively coordinated. Computational improvements on key aspects are also incorporated to fine tune the algorithm. As demonstrated by MISO cases, the method provides near-optimal solutions within a time limit, and significantly outperforms branch-and-cut. [ABSTRACT FROM AUTHOR]

This paper presents a novel two-dimensional real-time modeling approach for a proton exchange membrane fuel cell (PEMFC) based on a tridiagonal matrix algorithm (Thomas algorithm). The Thomas algorithm consists of a forward elimination and a backward substitution, its arithmetic complexity of computations being much lower than the Gaussian elimination. In order to use this advanced numerical solver, the differential equations of reactant gas convection and diffusion phenomena in serpentine channels are transformed into a tridiagonal equations system. In addition, a three-level bisection algorithm has been developed to solve spatial physical quantities distribution for electrochemical domain. The real-time computing methods developed in this paper are then implemented in C language for a fast execution time in a real-time processor. The proposed real-time model is experimentally validated using a 1.2 kW Ballard NEXA fuel cell system, and its practical feasibilities in advanced real-time control for PEMFC systems have been experimentally demonstrated in an RT-LAB real-time simulator. [ABSTRACT FROM PUBLISHER]

With the recent proliferation of open-source packages for computing, power system differential-algebraic equation (DAE) modeling and simulation are being revisited to reduce the programming efforts. Existing open-source tools require manual efforts to develop code for numerical equations, sparse Jacobians, and discontinuous components. This paper proposes a hybrid symbolic-numeric framework, exemplified by an open-source Python-based library ANDES, which consists of a symbolic layer for descriptive modeling and a numeric layer for vector-based numerical computation. This method enables the implementation of DAE models by mixing and matching modeling components, through which models are described. In the framework, a rich set of discontinuous components and standard transfer function blocks are provided besides essential modeling elements for rapid modeling. ANDES can automatically generate robust and fast numerical simulation code, as well as and high-quality documentation. Case studies present a) two implementations of turbine governor model TGOV1, b) power flow computation time break down for MATPOWER systems, c) validation of time-domain simulation with commercial software using three test systems with a variety of models, and d) the full eigenvalue analysis for Kundur's system. Validation shows that ANDES closely matches the commercial tool DSATools for power flow, time-domain simulation, and eigenvalue analysis. [ABSTRACT FROM AUTHOR]

This paper investigates the performance of epidemic routing in mobile social networks considering several communities which are frequently visited by nodes. To this end, a monolithic Stochastic Reward Net (SRN) is proposed to evaluate the delivery delay and the average number of transmissions under epidemic routing by considering skewed location visiting preferences. This model is not scalable enough, in terms of the number of nodes and frequently visited locations. In order to achieve higher scalability, the folding technique is applied to the monolithic model, and an approximate folded SRN is proposed to evaluate performance of epidemic routing. Discrete-event simulation is used to validate the proposed models. Both SRN models for predicting the performance of epidemic routing exhibit high accuracy. We also propose an Ordinary Differential Equation (ODE) model for epidemic routing and compare it with the folded model. The obtained results show that the folded model is more accurate than the ODE model. Moreover, it is proved that the number of transmissions by the time of delivery follows a uniform distribution, for a general class of networks, where positions of nodes are always independent and identically distributed. [ABSTRACT FROM AUTHOR]

Compared to binary-state system models, multistate (MS) system models are more practical and useful when describing complex systems in applications, such as communication systems, oil pipeline systems, and grid or cloud computing infrastructures. This paper models a generalized sparsely connected MS consecutive- ${k}$ -out-of- ${n}$ : ${G}$ system. The proposed model is regarded as a natural extension of the consecutive- ${k}$ -out-of- ${n}$ system. Moreover, the proposed system model could cover three special MS submodels, i.e., a decreasing MS: ${G}$ system model, an increasing MS: ${G}$ system model, and a nonmonotonic MS: ${G}$ system model. Three corresponding real-world examples are given to illustrate the applications of the model. Meanwhile, by utilizing the well-known finite Markov chain imbedding method, the explicit system reliability and state distribution for the three kinds of submodels are presented, respectively. Finally, the developed indexes and analysis method are demonstrated by numerical examples. [ABSTRACT FROM AUTHOR]

The Partial Element Equivalent Circuit (PEEC) method is promising numerical technique for three-dimension electromagnetic modeling across various application fields. In the framework of the PEEC method, the partial elements modeling the magnetic and electric field coupling between elementary volumes and surfaces are computed by double-folded volume and surface integrals. Assuming the quasi-static hypothesis and an orthogonal mesh, the integrals have been computed by the analytical formulas derived in literature, which significantly reduces the computational time in comparison to the numerical integration. However, the existing analytical formulas are affected by significant numerical errors for certain PEEC structural mesh necessary to model the skin and proximity effects with a higher accuracy. To utilize the full potential of the PEEC method, the calculation of partial elements has to be carefully addressed, which has not been investigated in a comprehensive way so far. Accordingly, this paper presents a systematic accuracy analysis of the existing closed-form analytical formulas and methods for calculating the self and mutual inductances between two rectangular conductors. Additionally, a new strategy to select a proper analytical formula depending on the dimensions and positions of two conductors is proposed, which allows the mutual inductance extraction with a relative error of less than 0.1 $\%$. The new method is systematically validated on examples of 3-D dense PEEC systems using the quadruple precision arithmetic as reference. [ABSTRACT FROM AUTHOR]

The emerging voltage source converters (VSCs) such as hybrid cascaded multilevel converters (HCMCs) are promising converter technologies which enable higher converter efficiency, compactness, and DC fault resilience for high voltage direct current (HVDC) transmission. However, the large number of switching events due to the converters’ submodules introduces a heavy computational burden for electromagnetic transient (EMT) simulations. Efficient and accurate EMT-type converter models play a vital role in the control and design of HVDC converters. Several computationally efficient models for the HCMCs are proposed in this paper, including the detailed equivalent model (DEM) and several average value models (AVMs) of varying accuracy. Additionally, a combined model is proposed which allows the users to switch among the DEM and AVMs during dynamic simulations. The proposed models are validated against the DEM for dynamic transients. The simulation results demonstrate good modeling accuracy of the proposed models. The AVMs are also shown to significantly improve simulation efficiency compared to the DEM, which is very desirable especially for HCMCs with a large number of submodules. [ABSTRACT FROM AUTHOR]

Computing time-varying linear systems is widely encountered in engineering practice and scientific computation. Dynamic neural networks, as a class of modeling approaches, have been intensively explored in recent decades for solving linear equations. The time-varying nature of this problem and the noisy workspace for many engineering practice require two features of practical design: 1) fast convergence in time and 2) robustness against noises and disturbance. Existing solutions usually decouple the problem into two steps by designing a fast-convergent neural controller and then topped with an additional low-pass filter to reach noise robustness. However, due to the interplay of the mentioned two dynamical parts, the overall system may lose stability if the parameters are not well tuned. In this paper, we establish the first dynamical neural model for simultaneously achieving fast-convergence, particularly finite-time convergence, and noise-robustness, with the capability to reject the unknown noise when it is constant or varies slowly. To do so, a superior design formula activated by noise-tolerant nonlinear functions is proposed to enhance the capability of zeroing neural networks (ZNNs), achieving denoising and finite-time convergence in a unified design. According to this design formula, a novel recurrent neural network (RNN) with finite-time convergence and inherently noise-suppression performance [thus termed the finite-time robust RNN (FTRRNN)] is developed and applied to robotic motion tracking illustrated via time-varying linear equation system solving. Furthermore, theoretical analyses on the global stability, the finite-time convergence and the denoising ability of the proposed design formula and the corresponding FTRRNN model are presented in details. The upper bound on the convergence time is also analytically derived. A numerical example is supplied to verify the superior property of the FTRRNN model to the ZNN model according to the results of computing time-varying linear equation system in the presence of additive noises. Finally, an application to robotic motion tracking is presented to show that the presented FTRRNN model can successfully realize the ellipse-path tracking control of a planar two-link manipulator in front of the external disturbances, while the conventional ZNN model fails under the same conditions. [ABSTRACT FROM AUTHOR]

Medical imaging systems are commonly assessed and optimized by use of objective measures of image quality (IQ). The Ideal Observer (IO) performance has been advocated to provide a figure-of-merit for use in assessing and optimizing imaging systems because the IO sets an upper performance limit among all observers. When joint signal detection and localization tasks are considered, the IO that employs a modified generalized likelihood ratio test maximizes observer performance as characterized by the localization receiver operating characteristic (LROC) curve. Computations of likelihood ratios are analytically intractable in the majority of cases. Therefore, sampling-based methods that employ Markov-Chain Monte Carlo (MCMC) techniques have been developed to approximate the likelihood ratios. However, the applications of MCMC methods have been limited to relatively simple object models. Supervised learning-based methods that employ convolutional neural networks have been recently developed to approximate the IO for binary signal detection tasks. In this paper, the ability of supervised learning-based methods to approximate the IO for joint signal detection and localization tasks is explored. Both background-known-exactly and background-known-statistically signal detection and localization tasks are considered. The considered object models include a lumpy object model and a clustered lumpy model, and the considered measurement noise models include Laplacian noise, Gaussian noise, and mixed Poisson-Gaussian noise. The LROC curves produced by the supervised learning-based method are compared to those produced by the MCMC approach or analytical computation when feasible. The potential utility of the proposed method for computing objective measures of IQ for optimizing imaging system performance is explored. [ABSTRACT FROM AUTHOR]