Search

This paper studies transmission strategies for the downlink of a cloud radio access network, in which the base stations are connected to a centralized cloud computing-based processor with digital fronthaul or backhaul links. We provide a system-level performance comparison of two fundamentally different strategies, namely, the data-sharing strategy and the compression strategy, which differ in the way the fronthaul/backhaul is utilized. It is observed that the performance of both strategies depends crucially on the available fronthaul or backhaul capacity. When the fronthaul/backhaul capacity is low, the data-sharing strategy performs better, while under moderate-to-high fronthaul/backhaul capacity, the compression strategy is superior. Using insights from such a comparison, we propose a novel hybrid strategy, combining the data-sharing and compression strategies, which allows for better control over the fronthaul/backhaul capacity utilization. An optimization framework for the hybrid strategy is proposed. Numerical evidence demonstrates the performance gain of the hybrid strategy. [ABSTRACT FROM AUTHOR]

Few of the challenges with development of a single on–board motor for direct–drive electric vehicles include high torque density and low torque ripple. Therefore, in this paper, a 36–slot, 34–pole consequent pole six–phase permanent magnet synchronous machine (PMSM) has been optimized to address the aforementioned challenges for direct–drive application. Existing literature on optimization processes that rely solely on finite element models are restricted to three–phase machines only and also take longer computation time. Therefore, this paper proposes a novel optimization approach based on supervised machine learning for six–phase PMSM. In this approach, a non–conventional extended dual dq–frame model that accounts for higher order space harmonics in inductances and flux linkages has been developed and used for accurate computation of average torque and torque ripple of six–phase PMSM. Using the performance characteristics obtained from the extended dual dq–frame model for a set of initial design candidates, support vector regression algorithm is employed for supervised machine learning and increasing solutions in the design space. Furthermore, pareto front is used for selecting optimal machine models with maximum torque density and reduced torque ripple. Multi–objective trade–offs and comparison of initial and optimized designs based on average torque, torque ripple, efficiency and cost are performed. [ABSTRACT FROM AUTHOR]

As the semiconductor manufacturing process is moving towards the 3 nm node, there is a crucial need to reduce the edge placement error (EPE) to ensure proper functioning of the integrated circuit (IC) devices. EPE is the most important metric that quantify the fidelity of fabricated patterns in multi-patterning processes, and it is the combination of overlay errors and critical dimension (CD) errors. Recent advances in machine learning have enabled many new possibilities to improve the performance and efficiency of EPE optimization techniques. In this paper, we conducted a survey of recent research work that applied machine learning/ deep learning techniques for the purposes of enhancing virtual overlay metrology, reducing overlay error, and improving mask optimization methods for EPE reduction. Thorough discussions about the objectives, datasets, input features, models, key findings, and limitations are provided. In general, the results of the review work show a great potential of machine learning techniques in aiding the improvement of EPE in the field of semiconductor manufacturing. [ABSTRACT FROM AUTHOR]

By triggering the switches in sequence and controlling the brick charging voltage independently, a pulsed power system can generate flexible current waveform in the load, which could allow high-accurate magnetic pressure in experimental materials in the study of EOS data and dynamic response of material characterization. Currently, a 1.5-MA driver with 20 independent bricks has been developed, and a programmable 256-brick parallel discharge driver which is able to generate shaped current greater than 6.5 MA is under construction in the China Academy of Engineering Physics. In this paper, for these two multibrick parallel discharge drivers, the method of optimizing the output current waveform of the driver is studied by using the genetic algorithm and the corresponding optimization results of different target current waveforms are obtained. An experimental platform is set up for studying the gas switch breakdown characteristics. The self-breakdown and triggering breakdown experiments of the switch are conducted, and its breakdown characteristics are researched. Meanwhile, the effect of breakdown delay and jitter on the output current waveform is studied by simulation. This paper is of great significance to the actual operation of the multibrick parallel discharge drivers. [ABSTRACT FROM AUTHOR]

This paper investigates the dynamic access point (AP) clustering and precoding problem in the downlink of user-centric virtual cell networks. The goal is to maximize the weighted sum spectral efficiency (SE) while satisfying the power constraints and AP clustering constraints in adjacent time slots (TSs). By adopting the random walk mobility to model the mobile user equipments’ movement behaviors, we consider dynamic and time-varying channel conditions. Therefore, the weighted sum SE maximization programming takes the form of discrete-time sequence of mixed-integer non-convex optimization problems. In this paper, we propose to solve this sequential problem in two stages. In the first stage, a dynamic AP clustering approach based on discrete particle swarm optimization is developed. This approach takes the advantage of the channel correlation by exploiting the relationship between AP clustering solutions in adjacent TSs to improve the SE performance and reduce complexity. In the second stage, given the AP clustering solution obtained in the first stage, a distributed precoding algorithm is devised via applying the weighted minimum mean square error method. By combining these two stages, we propose a novel dynamic AP clustering and precoding algorithm (DAPC-Pre). The effectiveness of the proposed DAPC-Pre algorithm is verified by the simulation results. In particular, the proposed algorithm converges fast and significantly outperforms benchmark algorithms in terms of sum SE under different dynamic environments. [ABSTRACT FROM AUTHOR]

This paper treats the problem of optimal resource allocation over time in a finite-horizon setting, in which the resource become available only sequentially and in incremental values, and the utility function is concave and can freely vary over time. Such resource allocation problems have direct applications in data communication networks (e.g., energy harvesting systems). This problem is studied extensively for special choices of the concave utility function (time invariant and logarithmic) in which case the optimal resource allocation policies are well-understood. This paper treats this problem in its general form and analytically characterizes the structure of the optimal resource allocation policy and devises an algorithm for computing the exact solutions analytically. An observation instrumental to devising the provided algorithm is that there exist time instances at which the available resources are exhausted, with no carryover to future. This algorithm identifies all such instances, which in turn, facilitates breaking the original problem into multiple problems with significantly reduced dimensions. Furthermore, some widely used special cases in which the algorithm takes simpler structures are characterized, and the application to the energy harvesting systems is discussed. Numerical evaluations are provided to assess the key properties of the optimal resource allocation structure and to compare the performance with the generic convex optimization algorithms. [ABSTRACT FROM AUTHOR]

Total variation (TV) is a one of the most popular regularizers for stabilizing the solution of ill-posed inverse problems. This paper proposes a novel proximal-gradient algorithm for minimizing TV regularized least-squares cost functionals. Unlike traditional methods that require nested iterations for computing the proximal step of TV, our algorithm approximates the latter with several simple proximals that have closed form solutions. We theoretically prove that the proposed parallel proximal method achieves the TV solution with arbitrarily high precision at a global rate of converge that is equivalent to the fast proximal-gradient methods. The results in this paper have the potential to enhance the applicability of TV for solving very large-scale imaging inverse problems. [ABSTRACT FROM AUTHOR]

This paper considers the problem of user association to small-cell base stations (SBSs) in a heterogeneous and small-cell network (HetSNet). Two optimization problems are investigated, namely, maximizing the set of associated users to the SBSs (the unweighted problem) and maximizing the set of weighted associated users to the SBSs (the weighted problem), under signal-to-interference-plus-noise ratio constraints. Both problems are formulated as linear integer programs. The weighted problem is known to be NP-hard, and in this paper, the unweighted problem is proved to be NP-hard as well. Therefore, this paper develops two heuristic polynomial-time algorithms to solve both problems. The computational complexity of the proposed algorithms is evaluated and is shown to be far more efficient than the complexity of the optimal brute-force (BF) algorithm. Moreover, this paper benchmarks the performance of the proposed algorithms against the BF algorithm, the branch-and-bound CPLEX-based algorithm, and state-of-the-art algorithms, through numerical simulations. The results demonstrate the close-to-optimal performance of the proposed algorithms. They also show that the weighted problem can be solved to provide solutions that are fair between users or to balance the load among SBSs. [ABSTRACT FROM PUBLISHER]

The emergence of interference alignment (IA) as a degrees-of-freedom optimal strategy motivates the need to investigate whether IA can be leveraged to aid conventional network utility maximization algorithms, which are typically only capable of finding locally optimal solutions. To test the usefulness of IA in this context, this paper proposes a two-stage optimization framework for the downlink of a $G$ -cell multi-antenna network with $K$ users/cell. The first stage of the proposed framework focuses on nulling interference from a set of dominant interferers using IA, while the second stage optimizes transmit and receive beamformers to maximize a network-wide utility using the IA solution as the initial condition. Further, this paper establishes a set of new feasibility results for partial IA that can be used to guide the number of dominant interferers to be nulled in the first stage. Through simulations on specific topologies of a cluster of base stations, it is observed that the impact of IA depends on the choice of the utility function and the presence of out-of-cluster interference. In the absence of out-of-cluster interference, the proposed framework outperforms straightforward optimization when maximizing the minimum rate, while providing marginal gains when maximizing sum rate. However, the benefit of IA is greatly diminished in the presence of significant out-of-cluster interference. [ABSTRACT FROM AUTHOR]

Domain adaptation aims at extracting knowledge from auxiliary source domains to assist the learning task in a target domain. In classification problems, since the distributions of the source and target domains are different, directly using source data to build a classifier for the target domain may hamper the classification performance on the target data. Fortunately, in many tasks, there can be some features that are transferable, i.e., the source and target domains share similar properties. On the other hand, it is common that the source data contain noisy features which may degrade the learning performance in the target domain. This issue, however, is barely studied in existing works. In this paper, we propose to find a feature subset that is transferable across the source and target domains. As a result, the domain discrepancy measured on the selected features can be reduced. Moreover, we seek to find the most discriminative features for classification. To achieve the above goals, we formulate a new sparse learning model that is able to jointly reduce the domain discrepancy and select informative features for classification. We develop two optimization algorithms to address the derived learning problem. Extensive experiments on real-world data sets demonstrate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

This paper proposes a novel stochastic robust real-time power dispatch model considering wind uncertainty. In this dispatch model that incorporates automatic power generation control, system constraints are constructed with affinely adjustable robust optimization to enhance the system security, while the objective concerning the expected value of generation cost is optimized to improve the cost efficiency. The optimized objective is consistent with stochastic optimization, while the formulation for the objective is different. A Nataf conversion-based three-point estimate (NC-TPE) is adopted, which uses an approximating function to formulate the expected generation cost with deterministic estimate points. Compared to traditional stochastic sampling methods, the deterministic assessment method NC-TPE achieves an accurate formulation with more stable and efficient computation performance. The dispatch model is derived as a problem with nonconvex objective and bilinear constraints using the dual theory. To address the highly nonconvex problem, the objective and bilinear constraints are first converted to difference-of-convexity functions, and then a tailored difference-of-convexity optimization is employed to convexify the nonconvex functions, such that the original problem can be solved with an iterative quadratically constrained program. Numerical simulations demonstrate the economic superiority and robustness of the proposed model, as well as the effectiveness of the convexified solution. [ABSTRACT FROM AUTHOR]

In conventional multi-user multiple-input multiple-output (MU-MIMO) systems with frequency division duplexing (FDD), channel acquisition and precoder optimization processes have been designed separately although they are highly coupled. This paper studies an end-to-end design of downlink MU-MIMO systems which include pilot sequences, limited feedback, and precoding. To address this problem, we propose a novel deep learning (DL) framework which jointly optimizes the feedback information generation at users and the precoder design at a base station (BS). Each procedure in the MU-MIMO systems is replaced by intelligently designed multiple deep neural networks (DNN) units. At the BS, a neural network generates pilot sequences and helps the users obtain accurate channel state information. At each user, the channel feedback operation is carried out in a distributed manner by an individual user DNN. Then, another BS DNN collects feedback information from the users and determines the MIMO precoding matrices. A joint training algorithm is proposed to optimize all DNN units in an end-to-end manner. In addition, a training strategy which can avoid retraining for different network sizes for a scalable design is proposed. Numerical results demonstrate the effectiveness of the proposed DL framework compared to classical optimization techniques and other conventional DNN schemes. [ABSTRACT FROM AUTHOR]

Electric distribution grid operations typically rely on both centralized optimization and local non-optimal control techniques. As an alternative, distribution system operational practices can consider distributed optimization techniques that leverage communications among various neighboring agents to achieve optimal operation. With the rapidly increasing integration of distributed energy resources (DERs), distributed optimization algorithms are growing in importance due to their potential advantages in scalability, flexibility, privacy, and robustness relative to centralized optimization. Implementation of distributed optimization offers multiple challenges and also opportunities. This paper provides a comprehensive review of the recent advancements in distributed optimization for electric distribution systems and classifications using key attributes. Problem formulations and distributed optimization algorithms are provided for example use cases, including volt/var control, market clearing process, loss minimization, and conservation voltage reduction. Finally, this paper also presents future research needs for the applicability of distributed optimization algorithms in the distribution system. [ABSTRACT FROM AUTHOR]

In this paper, we consider an intelligent reflecting surface (IRS)-assisted cognitive radio system and maximize the secondary user (SU) rate by jointly optimizing the transmit power of secondary transmitter (ST) and the IRS’s reflect beamforming, subject to the constraints of the minimum required signal-to-interference-plus-noise ratio at the primary receiver, the ST’s maximum transmit power, and the unit modulus of the IRS reflect beamforming vector. This joint optimization problem can be solved suboptimally by the non-convex optimization techniques, which however usually require complicated mathematical transformations and are computationally intensive. To address this challenge, we propose an algorithm based on the deep deterministic policy gradient (DDPG) method. To achieve a higher learning efficiency and a lower reward variance, we propose another algorithm based on the soft actor-critic (SAC) method. In these proposed algorithms, a reward impact adjustment approach is proposed to improve their learning efficiency and stability. Simulation results show that the two proposed algorithms can achieve comparable SU rate performance with much shorter running time, as compared to the existing non-convex optimization-based benchmark algorithm, and that the proposed SAC-based algorithm learns faster and achieves a higher average reward with lower variance, as compared to the proposed DDPG-based algorithm. [ABSTRACT FROM AUTHOR]

State estimation plays a key role in the transition from the passive to the active operation of distribution systems, as it allows to monitor the networks and provides the necessary information to perform control actions. However, designing state estimators for distribution systems is challenging, due to the characteristics of the networks, such as limited measurement availability. Furthermore, the features of the distribution system present significant local variations, e.g., voltage level and number and type of customers, which makes it hard to design a “one-size-fits-all” state estimator. This paper introduces a unifying framework that allows to easily implement and compare diverse unbalanced static state estimation models. This is achieved by formulating state estimation as a general constrained optimization problem. The advantages of this approach are described and supported by numerical illustration on a large set of real distribution feeders. The framework is also implemented in software and made available open-source. [ABSTRACT FROM AUTHOR]

In this paper, we propose an optimization method for protograph-based spatially coupled low-density parity-check (SC-LDPC) codes under window decoding (WD). Previous works on constructing SC-LDPC codes for WD typically focused on optimizing asymptotic performance metrics such as the WD threshold. However, in this paper, it is observed that the WD threshold is not an appropriate metric to sufficiently explain the finite-length behavior of SC-LDPC codes under WD. Thus, we propose a new performance metric, called the window mean parameter, based on a scaling analysis to capture the WD performance more accurately and formulate a code optimization algorithm that optimizes the proposed performance metric. Since the proposed metric depends on the window size, the optimization algorithm can provide a code family of SC-LDPC codes optimized for various target window sizes. Simulation results confirm that the improvement in the proposed metric leads to a finite-length performance improvement, resulting in one to two orders of the frame error rate gain over the conventional SC-LDPC codes for a wide range of window sizes. Furthermore, we investigate structural characteristics of the proposed codes to provide a supplementary explanation for the performance improvement, which also promotes a better understanding of SC-LDPC codes for WD. [ABSTRACT FROM AUTHOR]

To overcome devices’ limitations in performing computation-intense applications, mobile edge computing (MEC) enables users to offload tasks to proximal MEC servers for faster task computation. However, the current MEC system design is based on average-based metrics, which fails to account for the ultra-reliable low-latency requirements in mission-critical applications. To tackle this, this paper proposes a new system design, where probabilistic and statistical constraints are imposed on task queue lengths, by applying extreme value theory. The aim is to minimize users’ power consumption while trading off the allocated resources for local computation and task offloading. Due to wireless channel dynamics, users are reassociated to MEC servers in order to offload tasks using higher rates or accessing proximal servers. In this regard, a user–server association policy is proposed, taking into account the channel quality as well as the servers’ computation capabilities and workloads. By marrying tools from Lyapunov optimization and matching theory, a two-timescale mechanism is proposed, where a user–server association is solved in the long timescale, while a dynamic task offloading and resource allocation policy are executed in the short timescale. The simulation results corroborate the effectiveness of the proposed approach by guaranteeing highly reliable task computation and lower delay performance, compared to several baselines. [ABSTRACT FROM AUTHOR]

Given two discrete random variables $X$ and $Y$ , with probability distributions $p=(p_{1}, \ldots , p_{n})$ and $q=(q_{1}, \ldots , q_{m})$ , respectively, let us denote by ${\mathcal{ C}}(p, q)$ the set of all couplings of $p$ and $q$ , that is, the set of all bivariate probability distributions that have $p$ and $q$ as marginals. In this paper, we study the problem of finding a joint probability distribution in ${\mathcal{ C}}(p, q)$ of minimum entropy (equivalently, a coupling that maximizes the mutual information between $X$ and $Y$), and we discuss several situations where the need for this kind of optimization naturally arises. Since the optimization problem is known to be NP-hard, we give an efficient algorithm to find a joint probability distribution in ${\mathcal{ C}}(p, q)$ with entropy exceeding the minimum possible at most by 1 bit, thus providing an approximation algorithm with an additive gap of at most 1 bit. Leveraging on this algorithm, we extend our result to the problem of finding a minimum-entropy joint distribution of arbitrary $k\geq {2}$ discrete random variables $X_{1}, \ldots , X_{k}$ , consistent with the known $k$ marginal distributions of the individual random variables $X_{1}, \ldots , X_{k}$. In this case, our algorithm has an additive gap of at most $\log k$ from optimum. We also discuss several related applications of our findings and extensions of our results to entropies different from the Shannon entropy. [ABSTRACT FROM AUTHOR]

We consider an $\ell _{2}$ -regularized non-convex optimization problem for recovering signals from their noisy phaseless observations. We design and study the performance of a message passing algorithm that aims to solve this optimization problem. We consider the asymptotic setting $m,n \rightarrow \infty $ , $m/n \rightarrow \delta $ and obtain sharp performance bounds, where $m$ is the number of measurements and $n$ is the signal dimension. We show that for complex signals, the algorithm can perform accurate recovery with only $m = (({64}/{\pi ^{2}})-4)n \approx 2.5n$ measurements. Also, we provide a sharp analysis on the sensitivity of the algorithm to noise. We highlight the following facts about our message passing algorithm: 1) adding $\ell _{2}$ regularization to the non-convex loss function can be beneficial and 2) spectral initialization has a marginal impact on the performance of the algorithm. The sharp analyses, in this paper, not only enable us to compare the performance of our method with other phase recovery schemes but also shed light on designing better iterative algorithms for other non-convex optimization problems. [ABSTRACT FROM AUTHOR]

This paper proposes a new reentry trajectory generation method, which mainly comprises two parts: reentry profile design and trajectory optimization. Different from conventional methods that design angle-of-attack (AOA) and bank-angle profiles, a height-range profile is proposed in this paper. Using this profile, the AOA can be directly derived and the quasi-equilibrium glide condition is easily satisfied. In addition, the bank angle is analytically derived with the heading error, with only one reversal. Finally, the original problem is transformed into a parameter optimization problem and solved by an improved particle swarm optimization (PSO) method. In PSO, a comparison principle is proposed to tackle constraints and three modifications are applied to the swarm evolution to enhance the searching capacity. To conquer disturbances, an online profile updating strategy is developed based on the nominal profile, so complicated work of designing a trajectory tracker is avoided. Simulation validates the effectiveness of the proposed method and demonstrates that the improved PSO is comparable to the pseudospectral method and is better than the basic PSO. [ABSTRACT FROM AUTHOR]

JPEG compression based on the discrete cosine transform is a key building block in low-power multimedia applications. Approximate computation techniques are used to exploit the error tolerance of JPEG. An image-dependent framework is proposed in this paper to design optimized approximate hardware with variable approximate bit-widths for a user-specified error budget. The proposed method can dynamically adjust the extent of approximation in the system depending on the pixel values of the input image, thus leveraging the inherent sparsity of certain images. This novel technique not only improves the power-delay product by $3.4{\times }$ over the base case, i.e., where the JPEG hardware is accurate but also significantly outperforms the image-independent approximation case, which is solely based on the error tolerance of the JPEG algorithm. [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]

This paper presents nonlinear optimization-based position and speed estimation scheme for IPMSM drives with arbitrary signal injection generated by inherent switching ripples associated with finite control set model predictive control (FCSMPC). The existing standard sensorless techniques are not suitable for FCSMPC which applies voltage vectors directly to an electrical machine without a modulator. The proposed method optimizes the nonlinear cost function derived from the standard IPMSM model with respect to position and speed at every sampling interval. This method can be applied to any type of signal injection and, hence, an ideal candidate for sensorless FCSMPC. In this method, the signal injection is needed only to generate persistent excitation to maintain the observability at low speeds. A strong persistent excitation is always present with FCSMPC except at standstill where the control applies null vector when the reference currents are zero. This situation is overcome in this paper by introducing a small negative $d$ -axis current at standstill. Thus, the proposed method can estimate the position and speed over a wide speed range starting from standstill to the rated speed without a changeover or additional signal injection. This paper also presents detailed convergence analysis and proposes a compensator for standstill operation that prevents converging to saddle and symmetrical solutions, and therefore, also eliminates the well-known ambiguity of $\pi$ rad in position estimation. The performance of the proposed sensorless scheme is experimentally verified for a wide range of operating conditions. [ABSTRACT FROM AUTHOR]

Car sharing (CS) services are promising solutions complementary to the classic public transport forms. In order to make CS effectively competitive, suitable planning and management strategies are required. This paper presents a decision support system (DSS) for handling the user-based vehicle relocation problem by applying economic incentives ruled by a threshold policy. Unlike the existing approaches, a methodology is proposed for determining the optimal threshold, which considers explicitly the stochastic reactions of the customers to the incentives. To this aim, the CS system is described in detail by unified modeling language diagrams and is modeled in a discrete event system framework. Moreover, a closed-loop control strategy is introduced to implement the vehicle relocation policy on the basis of the system state and the best threshold values, evaluated by discrete event simulation and particle swarm optimization. A case study simulation analysis shows that the proposed DSS management strategy can significantly improve the system performance. [ABSTRACT FROM AUTHOR]

Social and communication networks interact with each other in multifaceted ways, yet these interactions are often considered to be secondary in throughput, privacy and security analysis for communication networks. In this paper, full-duplex (FD) and half-duplex (HD) multi-antenna cooperative communication systems are studied by taking both physical links and social connections into account. An optimal beamformer for maximizing communication rate in the proposed socio-technological setting aims to balance between the direct link and the cooperating link as well as respecting the trust degree between the users. The resulting optimization problems are nontrivial to solve, even numerically, as they are not convex. The complexity of the problems is significantly reduced by showing that a linear combination of the direct and cooperating links’ channel vectors maximizes the achievable rate. Then, a computationally efficient numerical solution is used to maximize the rates both in the FD and HD modes. Numerical results demonstrate that significant gains in communication rates can be obtained with the proposed optimal beamforming design. [ABSTRACT FROM AUTHOR]

Dynamic network architectures (DNAs) have been developed under the assumption that some terminals can be converted into temporary access points (APs) anytime when connected to the Internet. In this paper, we consider the problem of assigning a group of users to a set of potential APs with the aim to maximize the downlink system throughput of DNA networks, subject to total transmit power and users’ quality of service (QoS) constraints. In our first method, we relax the integer optimization variables to be continuous. The resulting non-convex continuous optimization problem is solved using successive convex approximation framework to arrive at a sequence of second-order cone programs (SOCPs). In the next method, the selection process is viewed as finding a sparsity constrained solution to our problem of sum rate maximization. It is demonstrated in numerical results that while the first approach has better data rates for dense networks, the sparsity oriented method has a superior speed of convergence. Moreover, for the scenarios considered, in addition to comprehensively outperforming some well-known approaches, our algorithms yield data rates close to those obtained by branch and bound method. [ABSTRACT FROM AUTHOR]

This paper presents an optimization approach for the placement of geomagnetically induced current (GIC) blocking devices (BDs) on power system transformers to mitigate the adverse effects of a geomagnetic disturbance (GMD). Solar storms lead to GMDs which, in turn, drive GICs along transmission lines and through transformer windings. GICs cause half-cycle saturation in power transformers, increase their shunt reactive power loss, lead to a significant lack of power system reactive power support, and, as a result, create voltage instability and, potentially, large-scale voltage collapse. To mitigate these detrimental effects, a long-term remedy is to install GIC BDs at the neutral point of transformers. Since these devices are fairly costly, their placement should be performed in an optimal manner. The optimization problem proposed in this paper minimizes the cost of BD placement while satisfying power system voltage and generator maximum reactive power limits. The numerical results demonstrate the effectiveness of the proposed method in maintaining an acceptable voltage profile for the power system in case of GMDs with any degree of severity. [ABSTRACT FROM AUTHOR]

Linear antenna arrays consisting of dipole antennas find wide applications in wireless communication systems. Typically, arrangements with uniform spacing between the array elements are applied to gain highly directive radiation patterns while controlling the radiation intensity in the side lobes. To describe such arrangements, the so-called pattern multiplication (PM) technique is frequently applied, which inherently neglects the inter-element coupling. In this paper, an antenna array arrangement with non-uniformly spacing between the array elements is synthesized in the multi-objective sense. Therefore, the PM technique is deficient. Hence, numerical techniques have to be applied to compute the electromagnetic field during the optimization process. Due to its simplicity and the consequently reduced computational costs, the partial element equivalent circuit method is applied within the field computation process. The optimization relies on a stochastic particle swarm optimization strategy, namely the firefly algorithm. In this paper, an extended version of the general algorithm with additional hierarchical clustering is applied. Special attention is drawn to the development of a suitable objective function. [ABSTRACT FROM AUTHOR]

Scale-invariant feature transform (SIFT) includes complex computations that require hardware implementation for real-time operations. Previous works on SIFT hardware acceleration used a large amount of internal memory, which limited a wider use of SIFT. This paper proposes a new SIFT hardware architecture that significantly reduces the amount of required internal memory by storing temporary data into external memory. The use of external memory demands an excessive bandwidth (BW) for the external memory. In order to reduce the external memory BW, this paper proposes three schemes: 1) local-patch reuse; 2) local-patch subsampling; and 3) fraction-bit truncation. As a result, the proposed hardware processes High Definition (HD)-sized ( $1280\times 720$ ) video at 36.85 frames/s with an external memory BW of 2.37 B/cycle and an internal memory of 396.03 kbits, which are acceptable for practical use with various applications. This is achieved because the external memory access is reduced to only 4.75% of that without the proposed schemes and also because the size of the internal memory is reduced to 10.93% compared with the size required in the previous work. [ABSTRACT FROM AUTHOR]

This paper investigates the problem of designing an efficient spectrum-allocation mechanism in heterogeneous multicell coordinated cognitive radio networks (CRNs) under time-varying channel availabilities and traffic demands across the different cells. The problem is modeled as a utility proportional fair maximization problem subject to traffic demand, spectrum heterogeneity, and exclusive spectrum sharing constraints. Specifically, the optimization problem is formulated as a binary linear programming (BLP) problem. Due to its integrality properties, the BLP is anticipated to be NP-hard. However, this paper proves that the optimal solution of the formulated BLP can be found in polynomial time using linear programming (LP) because of its total unimodular constraint matrix. The proposed solution is a spectrum-aware allocation design that ensures a fair spectrum sharing among cells based on their current traffic loads while considering the unique characteristics of their radio-frequency (RF) environment. Simulation results reveal that the proposed spectrum-aware proportional weighted fair allocation leads to improved system performance while effectively dealing with spectrum heterogeneity and time-varying traffic demands. The results also indicate that the proposed spectrum-allocation design is quite robust to traffic estimation and spectrum sensing errors. [ABSTRACT FROM AUTHOR]

Multiple solutions are often needed because of different kinds of uncertain failures in a plan execution process and scenarios for which precise mathematical models and constraints are difficult to obtain. This paper proposes an optimization strategy for multirobot task allocation (MRTA) problems and makes efforts on offering multiple solutions with same or similar quality for switching and selection. Since the mentioned problem can be regarded as a multimodal optimization one, this paper presents a niching immune-based optimization algorithm based on Softmax regression (sNIOA) to handle it. A prejudgment of population is done before entering an evaluation process to reduce the evaluation time and to avoid unnecessary computation. Furthermore, a guiding mutation (GM) operator inspired by the base pair in theory of gene mutation is introduced into sNIOA to strengthen its search ability. When a certain gene mutates, the others in the same gene group are more likely to mutate with a higher probability. Experimental results show the improvement of sNIOA on the aspect of accelerating computation speed with comparison to other heuristic algorithms. They also show the effectiveness of the proposed GM operator by comparing sNIOA with and without it. Two MRTA application cases are tested finally. [ABSTRACT FROM AUTHOR]

This paper focuses on optimal time-of-arrival (TOA) sensor placement for multiple target localization simultaneously. In previous work, different solutions only using non-shared sensors to localize multiple targets have been developed. Those methods localize different targets one-by-one or use a large number of mobile sensors with many limitations, such as low effectiveness and high network complexity. In this paper, firstly, a novel optimization model for multi-target localization incorporating shared sensors is formulated. Secondly, the systematic theoretical results of the optimal sensor placement are derived and concluded using the A-optimality criterion, i.e., minimizing the trace of the inverse Fisher information matrix (FIM), based on rigorous geometrical derivations. The reachable optimal trace of Cramér-Rao lower bound (CRLB) is also derived. It can provide optimal conditions for many cases and even closed form solutions for some special cases. Thirdly, a novel numerical optimization algorithm to quickly find and calculate the (sub-)optimal placement and achievable lower bound is explored, when the model becomes complicated with more practical constraints. Then, a hybrid method for solving the most general situation, integrating both the analytical and numerical solutions, is proposed. Finally, the correctness and effectiveness of the proposed theoretical and mathematical methods are demonstrated by several simulation examples. [ABSTRACT FROM AUTHOR]

In this paper, novel neutral reactor structures are proposed to mitigate the secondary arc current (SAC) in non-conventional Multi-circuit Multi-voltage Transmission lines (MCMVTLs). The parameters of the reactors in the structure are optimized using the Non-dominated Sorting Genetic Algorithm II (NSGA-II). The optimization algorithm, coded in Python, regulates the multiple runs of an Electromagnetic Transients (EMT) simulation program to minimize the secondary arc current. The optimization trials are run in parallel on a 64 core computer to minimize the solution time. A detailed arc model was tested on the EMT program (PSCAD). Using this model and optimized parameters in the proposed neutral reactor schemes, the SAC is indeed extinguished in acceptable times. The SAC and TRV for neutral reactors with optimized parameters are up-to 68 and 77%, respectively, lower than the ones with parameters calculated by the conventional approach which ignores inter-circuit coupling. Meanwhile, the extinction times are up-to 46% faster. As a result, single-phase auto-reclosing in MCMVTLs is viable. [ABSTRACT FROM AUTHOR]

In this paper, we study the optimal resource allocation algorithm design for large intelligent reflecting surface (IRS)-assisted simultaneous wireless information and power transfer (SWIPT) systems. To facilitate efficient system design for large IRSs, instead of jointly optimizing all the IRS elements, we partition the IRS into several tiles and employ a scalable optimization framework comprising an offline design stage and an online optimization stage. In the offline stage, the IRS elements of each tile are jointly designed to support a set of different phase shift configurations, referred to as transmission modes, while the best transmission mode is selected from the set for each tile in the online stage. Given a transmission mode set, we aim to minimize the total base station (BS) transmit power by jointly optimizing the beamforming and the transmission mode selection policy taking into account the quality-of-service requirements of information decoding and non-linear energy harvesting receivers, respectively. Although the resource allocation algorithm design is formulated as a non-convex combinatorial optimization problem, we solve it optimally by applying the branch-and-bound (BnB) approach which entails a high computational complexity. To strike a balance between optimality and computational complexity, we also develop an efficient suboptimal algorithm capitalizing on the penalty method and successive convex approximation. Our simulation results show that the proposed designs enable considerable power savings compared to several baseline schemes. Moreover, our results reveal that by properly adjusting the numbers of tiles and transmission modes, the proposed scalable optimization framework indeed facilitates online design for large IRSs. Besides, our results confirm that the advocated physics-based model and scalable optimization framework enable a flexible trade-off between performance and complexity, which is vital for realizing the performance gains promised by large IRS-assisted communication systems in practice. [ABSTRACT FROM AUTHOR]

We all have encountered unsatisfactory video viewing experience with mobile devices in hot spot areas where a crowd of people are demanding video streaming simultaneously. One possible solution to relieve the problem is to use the unmanned aerial vehicle (UAV) as a relay to improve the quality-of-experience (QoE). In this paper, we focus on the allocation of bandwidth and transmission power for multiuser video streaming in UAV relay networks. Our goal is to maximize the total long-term QoE of users, which are determined by the freezing time and the bit rate of video. We employ the Lyapunov optimization theory to transform the original problem with long-term average form into the drift-plus-penalty problem, and propose a decentralized allocation scheme using alternative ascending clock auction to derive the optimal solution. Simulations are conducted to demonstrate the superiority of the proposed method. [ABSTRACT FROM AUTHOR]

This paper presents a new intelligent data-driven adaptive method (IDAM) of performing automatic online searches in real time. An online implementation of the proposed IDAM achieved rapid real-time optimization of system integration scaling factors for an automatic touch panel lamination machine. The proposed IDAM combines three-level orthogonal arrays (OAs), signal-to-noise ratios (SNRs), the best combined strategy, and a stepwise ratio. Three-level OA experiments with factor values are used to perform positional experiments, and SNRs are calculated for each experimental value. After the best combination of factor values (in terms of factor effect) is determined, new three-level factor values are derived by applying a stepwise ratio and used in further three-level OA experiments. These steps are repeated until the stopping criterion is met. Compared to conventional methods, the use of the IDAM in practical industrial applications, i.e., online real-time precision positioning for automatic touch panel lamination machines, reduces the number of experiments needed to obtain the system integration scaling factors that minimize the iteration count. For example, the IDAM required less than 40 online real-time experiments with a specific stepwise ratio for system integration scaling factors that met the minimum requirement of two iterations. In 50 independent experimental runs using the robust scaling factors obtained by the method, an average of 2.15 iterations was needed to achieve a positional accuracy within 5 ${\mu }\text{m}$. The main advantage of the proposed IDAM over conventional methods is its effectiveness for automatically finding robust parameters for online alignment systems in real time and with fewer experiments. [ABSTRACT FROM AUTHOR]

The spiral optimization (SPO) algorithm proposed by Tamura and Yasuda is a relatively novel and simple search concept inspired by natural spiral phenomena. This algorithm searches continuous space using no gradient and only spiral trajectories composed of spiral vectors generated by deterministic spiral models. The primary purpose of this paper is to propose conditions and settings that mathematically ensure the convergence of the SPO algorithm to a stationary point. The conditions relating to the sizes and directions of the spiral vectors and the initial search points are based on direct search theory and recent SPO algorithm theories. The presented convergence was numerically verified using test functions with different properties. [ABSTRACT FROM AUTHOR]

Compared with the conventional two-level dual-active-bridge (DAB) dc–dc converter, the three-level DAB converter could operate with lower voltage rated switching devices and provide more control degrees of freedom, which enhances the control flexibility. This paper proposes a modulation strategy with five control degrees of freedom. In the previous work with multiple control degrees, the optimization strategies for efficiency or inductor current minimization are investigated; however, these strategies all need detailed mode analysis and complex mathematical optimization tools to obtain the optimal duty cycles. In this paper, an optimization strategy for the root-mean-square value of the inductor current is proposed. This method extracts the fundamental and third-harmonic components from the high-frequency voltages on both sides and adjusts the amplitude of the bridge voltages by the vector diagram to obtain the optimal duty cycles. The inductor current can be reduced significantly at light loads with the proposed strategy, so the efficiency of the converter can be improved. Moreover, the optimization process does not need the detailed operation analysis of the converter, nor does it require the complex mathematical optimization tools. Finally, the performance of the three-level DAB and the optimization strategy are verified by the experimental results. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of matching common node correspondences among multiple graphs referring to an identical or related structure. This multi-graph matching problem involves two correlated components: i) the local pairwise matching affinity across pairs of graphs; ii) the global matching consistency that measures the uniqueness of the pairwise matchings by different composition orders. Previous studies typically either enforce the matching consistency constraints in the beginning of an iterative optimization, which may propagate matching error both over iterations and across graph pairs; or separate affinity optimization and consistency enforcement into two steps. This paper is motivated by the observation that matching consistency can serve as a regularizer in the affinity objective function especially when the function is biased due to noises or inappropriate modeling. We propose composition-based multi-graph matching methods to incorporate the two aspects by optimizing the affinity score, meanwhile gradually infusing the consistency. We also propose two mechanisms to elicit the common inliers against outliers. Compelling results on synthetic and real images show the competency of our algorithms. [ABSTRACT FROM PUBLISHER]

This paper proposes a robust frequency-domain method to tune the d–q decoupled control system used in Modular Multilevel Converter-type Voltage Source Converter (MMC-VSC) systems. A linearized state-space model of the MMC-VSC system is developed and used to calculate the stability-related frequency-domain attributes. The controller design problem is formulated as an optimization problem. In this paper, the simulated annealing optimization technique is applied to find the proportional-integral (PI) controller parameters that give desired damping for the oscillatory modes and desired values for decaying exponential modes. The efficacy of this method is tested on the electromagnetic transient model of a two-terminal MMC-VSC system on the real-time digital simulators, and the results are provided in this paper. Finally, tuned controller parameters for different ac system strengths are discussed and it is shown that this mathematical model is suitable to tune the PI-controller parameters for MMC-VSC systems connected to strong as well as weak ac networks. [ABSTRACT FROM AUTHOR]

In this paper, we study an uplink network configuration in a two-tier macro–femto heterogeneous system with hybrid access control. We consider a system where one macro base station (MBS) and a cluster of adjacent femto base stations (FBSs) together serve a number of mobile users. In this system, base stations and users make decisions in various network configuration processes with different optimization objectives. Such decision-making processesz are usually correlated, and an efficient mechanism is needed to coordinate the decision makers. In this paper, we propose a five-stage network configuration mechanism where access control, resource allocation, and power management are sequentially performed at the base stations and users, respectively. We show that this mechanism provides incentive for the FBSs to operate at the hybrid access mode. We model the configuration mechanism as a multistage decision-making process and formulate a multilevel optimization problem. We analyze the problem in a bottom-up manner and propose efficient algorithms to solve the optimization problem in each level sequentially. Simulation results show that the proposed network configuration mechanism achieves a higher system utility than configuration mechanisms with topology-based hybrid access or closed access. [ABSTRACT FROM AUTHOR]

This paper presents a two-timescale multi-objective coordinated volt/var optimization system for active distribution networks with renewable energy resources (RESs). In the hourly timescale, power loss and the number of control actions of on-load tap changers and (switchable) shunt capacitors for 24 h are minimized by coordinating on-load tap changers, (switchable) shunt capacitors, and reactive power outputs of RESs. A three-step method consisting of global search, user preference, and local search is adopted to solve the corresponding multi-objective mixed-integer nonlinear optimization problem. A rolling volt/var optimization is executed every 6 h, considering the day-ahead RES forecast errors. In the 15-min timescale, the RES reactive powers are optimized with RES uncertainties explicitly taken into consideration to minimize the pilot-bus voltage deviation under all representative scenarios. The pilot buses are those buses whose voltage magnitudes capture the network voltage profile. In this paper, a linear method is applied to quickly identify a set of pilot buses, and the impact of the identified pilot bus on the entire network voltage profile is evaluated. The IEEE 33-bus distribution network is used to evaluate the proposed two-timescale volt/var optimization formulations and methods with promising results. [ABSTRACT FROM AUTHOR]

This paper presents a safe learning framework that employs an adaptive model learning algorithm together with barrier certificates for systems with possibly nonstationary agent dynamics. To extract the dynamic structure of the model, we use a sparse optimization technique. We use the learned model in combination with control barrier certificates that constrain policies (feedback controllers) in order to maintain safety, which refers to avoiding particular undesirable regions of the state space. Under certain conditions, recovery of safety in the sense of Lyapunov stability after violations of safety due to the nonstationarity is guaranteed. In addition, we reformulate an action-value function approximation to make any kernel-based nonlinear function estimation method applicable to our adaptive learning framework. Lastly, solutions to the barrier-certified policy optimization are guaranteed to be globally optimal, ensuring the greedy policy improvement under mild conditions. The resulting framework is validated via simulations of a quadrotor, which has previously been used under stationarity assumptions in the safe learnings literature, and is then tested on a real robot, the brushbot, whose dynamics is unknown, highly complex, and nonstationary. [ABSTRACT FROM AUTHOR]

Importance measure can be used to identify the most vulnerable components with respect to system functionality or failure. Traditional importance measures may not be effective to evaluate the contribution of an individual component if its reliability value does not fall in the full range between 0 and 1. Based on the cost–reliability relation, this paper proposes a generalized Birnbaum importance measure (GBIM) to quantify the contribution of individual components to system reliability improvement by considering reliability range, manufacturing complexity, and technology feasibility. Since GBIM possesses several unique features in terms of guiding system reliability optimization, in this paper, we further develop a GBIM-based genetic algorithm to solve a type of optimal reliability allocation problem. The numerical studies show that both the computational efficiency and the near global optimality based on GBIM outperforms the methods using the traditional importance measures. [ABSTRACT FROM AUTHOR]

Proton precession magnetometer (PPM) is a potential device to measure the low-frequency geomagnetic field in the time domain. Nevertheless, the uncontrollable noise such as power frequency noise, random noise, etc., severely affects the detection results. In this paper, aimed to boost the performance of the PPM, a novel real-time processing algorithm for the optimization of PPM output strategy based on the low-rank constraint (LRC) is proposed, and a new efficient framework, dubbed LRC-based geomagnetic data readout optimizer (LRC-GDRO), is implemented. This method aims to extract the dominant principal components of the pure magnetic signal and identify the singular values of noise. Thereby, the relative ideal signal without external noise, which still contains the ambient field information is yielded. Moreover, we develop a prototype device and compare the test results before and after using the proposed method. Consequently, compared with traditional PPM, the performance of the PPM using the proposed method has been significantly improved with a measurement accuracy of ± 0.2 nT. Furthermore, the experimental results reveal that the LRC-optimized PPM is comparable to a very high-accuracy Overhauser magnetometer in terms of 12 h geomagnetic field observation. [ABSTRACT FROM AUTHOR]

In cache-aided networks, the server populates the cache memories at the users during low-traffic periods in order to reduce the delivery load during peak-traffic hours. In turn, there exists a fundamental tradeoff between the delivery load on the server and the cache sizes at the users. In this paper, we study this tradeoff in a multicast network, where the server is connected to users with unequal cache sizes and the number of users is less than or equal to the number of library files. We propose centralized uncoded placement and linear delivery schemes which are optimized by solving a linear program. Additionally, we derive a lower bound on the delivery memory tradeoff with uncoded placement that accounts for the heterogeneity in cache sizes. We explicitly characterize this tradeoff for the case of three end-users, as well as an arbitrary number of end-users when the total memory size at the users is small, and when it is large. Next, we consider a system where the server is connected to the users via rate-limited links of different capacities and the server assigns the users’ cache sizes subject to a total cache budget. We characterize the optimal cache sizes that minimize the delivery completion time with uncoded placement and linear delivery. In particular, the optimal memory allocation balances between assigning larger cache sizes to users with low capacity links and uniform memory allocation. [ABSTRACT FROM AUTHOR]

This paper proposes an extended set of variables for numerical optimizations of tooth-coil permanent magnet synchronous machines (TC-PMSMs). The design variables for the extended set are chosen based on the magnetic asymmetries introduced by the saturated core under the loading conditions. The extended set allows to reach considerably higher values of torque density and significant reduction of torque ripple in comparison with a conventional set of optimization variables. The conventional and extended sets are compared on an example of an finite element method simulation of a double-layer winding surface permanent magnet-rotor TC-PMSM. A considerably better optimal machine is obtained when the extended set of variables is utilized. The paper showcases the design and the optimization of electrical machines using only free and open-source software. [ABSTRACT FROM PUBLISHER]