Search

In paper production, a jumbo reel is cut into multiple intermediate rolls, and each intermediate roll is then sheeted as finished goods. This problem is called a cutting stock problem and is proven to be NP-hard. The objective is to minimize material waste or trim loss from all the cuttings. In the case that any intermediate roll is not entirely used for its associated order, the intermediate roll itself could turn to be a dead stock. We use the concept of universal sizes of intermediate rolls to eliminate the dead stock. A pre-defined number of universal sizes of intermediate rolls is to be used to serve all the orders. The problem is solved using Reinforcement Artificial Bee Colony algorithm with Integer Linear Programming subroutine. This proposed approach is then tested with a set of 1,055 orders and 127 different sizes of sheet papers from a paper manufacturer. The results reveal that our method outperforms other algorithms. Our method offers the total trim loss of 3.51%, compared to the trim loss reported by the industry of at least 5%. This approach not only reduces the number of partially cut rolls, but also decreases the number of the jumbo reels needed to serve all the orders. Therefore, both the inventory cost and material cost can be saved.

This paper studies the secure transmission in a multiuser broadcast channel where only the statistical channel state information of the eavesdropper is available. We propose to apply secret dirty-paper coding (S-DPC) in this scenario to support the secure transmission of one user and the normal (unclassified) transmission of the other users. By adopting the S-DPC and encoding the secret message in the first place, all the information-bearing signals of the normal transmission are treated as noise by potential eavesdroppers and thus provide secrecy for the secure transmission. In this way, the proposed approach exploits the intrinsic secrecy of multiuser broadcasting and can serve as an energy-efficient alternative to the traditional artificial noise (AN) scheme. To evaluate the secrecy performance of this approach and compare it with the AN scheme, we propose two S-DPC-based secure transmission schemes for maximizing the secrecy rate under constraints on the secrecy outage probability (SOP) and the normal transmission rates. The first scheme directly optimizes the covariance matrices of the transmit signals, and a novel approximation of the intractable SOP constraint is derived to facilitate the optimization. The second scheme combines zero-forcing dirty-paper coding and AN, and the optimization involves only power allocation. We establish efficient numerical algorithms to solve the optimization problems for both schemes. Theoretical and simulation results confirm that, in addition to supporting the normal transmission, the achievable secrecy rates of the proposed schemes can be close to that of the traditional AN scheme, which supports only the secure transmission of one user. [ABSTRACT FROM PUBLISHER]

With the introduction of automated driving, new requirements for the design and control of a vehicle powernet and powertrain arise, since the increasing level of driving automation shifts the responsibility for passengers’ safety from a driver towards automation system. Therefore, the functionality of the subsystems required for the automated transition to a standstill in case of a failure must be guaranteed. The work presented in this paper proposes a novel and generic system architecture for the energy management of a fail-operational powernet and powertrain in fault-free and failure case operation. The underlying control strategy is based on a concept enabling safety based range extension with the main goal to complete a driving mission at the safest possible location for the passengers. The proposed Energy Management System (EMS) approximates a driving trajectory to the destination based on route preview, which is then used for the dynamic optimization of the torque split in a powertrain with multiple motors. In this way, the total energy required for propulsion, which is also used as an input for the energy distribution, can be accurately predicted. The optimal distribution of the energy for the supply of safety-critical subsystems and powernet auxiliaries is then estimated by solving a mixed-integer optimization problem. If the desired driving mission cannot be completed, a three-level-degradation concept adapting the driving mission is applied. The individual modules of the EMS are presented in this paper and a system architecture enabling model predictive and adaptive energy distribution in a vehicle powertrain and powernet with automated fault reactions is proposed and exemplified with simulation results. [ABSTRACT FROM AUTHOR]

As one of the most important unit in the papermaking industry, the high consistency (HC) refining system is confronted with challenges such as improving pulp quality, energy saving, and emissions reduction in its operation processes. In this correspondence, an optimal operation of HC refining system is presented using nonlinear multiobjective model predictive control strategies that aim at set-point tracking objective of pulp quality, economic objective, and specific energy (SE) consumption objective, respectively. First, a set of input and output data at different times are employed to construct the subprocess model of the state process model for the HC refining system, and then the Wiener-type model can be obtained through combining the mechanism model of Canadian Standard Freeness and the state process model that determines their structures based on Akaike information criterion. Second, the multiobjective optimization strategy that optimizes both the set-point tracking objective of pulp quality and SE consumption is proposed simultaneously, which uses NSGA-II approach to obtain the Pareto optimal set. Furthermore, targeting at the set-point tracking objective of pulp quality, economic objective, and SE consumption objective, the sequential quadratic programming method is utilized to produce the optimal predictive controllers. Finally, the simulation results demonstrate that the proposed methods can make the HC refining system provide a better performance of set-point tracking of pulp quality when these predictive controllers are employed. In addition, while the optimal predictive controllers orienting with comprehensive economic objective and SE consumption objective, it has been shown that they have significantly reduced the energy consumption. [ABSTRACT FROM AUTHOR]

The work presented in this paper concerns a switching-based control formulation for multi-intersection and multiphase traffic light systems. A macroscopic traffic flow modeling approach is first presented, which is instrumental to the development of a model-based and switching-based optimization method for traffic signal operation, in the framework of adaptive dynamic programming (ADP). The main advantage of the switching-based formulation is its capability to determine both “when”’ to switch and “which” mode to switch on without the need to use the cycle-based average flow approximation typical of state-of-the-art formulations. In addition, the framework can handle different cycle times across intersections without the need for synchronization constraints and, moreover, minimum dwell-time constraints can be directly enforced to comply with minimum green/red times in each phase. The simulation experiments on a multi-intersection and multiphase traffic light systems are presented to show the effectiveness of the method. [ABSTRACT FROM AUTHOR]

Radio Frequency IDentification (RFID) is intended to supplant legacy (optical) bar code scanning technology found in many logistic and retail applications. RFID is distinguished by inexpensive, low power and compact form factor tags, whose longevity and efficacy are predicated on using passive communication techniques and on-tag power harvesting. Such tags employ backscatter modulation, which does not require any active RF components. As a result, backscatter has become an attractive design choice for short-range communications in power constrained wireless sensor networking scenarios. The purpose of this work is two-fold. First, it aims to expose backscatter communication as an emerging topic to a communication systems-theoretic audience. Since backscatter modulation and on-tag power harvesting efficiency are coupled, it is necessary to re-examine notions of power and spectral efficiency from an energy-constraint perspective; this leads to novel coded modulation schemes for future RFID systems. Further, we investigate RFID MIMO systems where the channel fading encountered has different statistics than the classical Rayleigh fading model. In turn,the trade off between diversity order and spatial multiplexing gains are distinct from wide-area MIMO. [ABSTRACT FROM PUBLISHER]

Parallel test paper generation is a biobjective distributed resource optimization problem, which aims to generate multiple similarly optimal test papers automatically according to multiple user-specified assessment criteria. Generating high-quality parallel test papers is challenging due to its NP-hardness in both of the collective objective functions. In this paper, we propose a submodular memetic approximation algorithm for solving this problem. The proposed algorithm is an adaptive memetic algorithm (MA), which exploits the submodular property of the collective objective functions to design greedy-based approximation algorithms for enhancing steps of the multiobjective MA. Synergizing the intensification of submodular local search mechanism with the diversification of the population-based submodular crossover operator, our algorithm can jointly optimize the total quality maximization objective and the fairness quality maximization objective. Our MA can achieve provable near-optimal solutions in a huge search space of large datasets in efficient polynomial runtime. Performance results on various datasets have shown that our algorithm has drastically outperformed the current techniques in terms of paper quality and runtime efficiency. [ABSTRACT FROM PUBLISHER]

Time-of-use (TOU) is an effective price-based demand response strategy. A reasonable design of TOU strategy can effectively reduce the peak-valley difference, and then produce a lot of benefits (such as delaying power grid investment, reducing interruption cost, and improving reliability). However, changing peak-valley period has a great influence on the peak-valley difference and power supply reliability of power system. Therefore, this paper aims to investigate the optimal modification of peak-valley period considering reliability loss under multiple TOU schemes. Firstly, this paper presents a clustering model and algorithm of optimal load curve based on a minimum error iteration method. Secondly, an optimal modification of peak-valley period based on a dynamic load point method is proposed, and the traditional peak-valley difference is replaced by the global peak-valley difference to calculate the objective function. Thirdly, this paper establishes a load–reliability relation fitting model based on the back propagation neural network. Finally, the effectiveness and correctness of the proposed method are investigated by the Roy Billinton test system and reliability test system. [ABSTRACT FROM AUTHOR]

Ladder network synthesis is very significant for winding fault diagnosis within transformer. To synthesize the network reversely based on the measurable frequency response analysis (FRA) data is the only applicable way. To date the iron core and non-tested winding, which result in the frequency-dependent network components and multiple ladders in some frequency ranges, are usually not considered in the reverse process and thus the synthesis precision is largely limited. This paper proposes to synthesize multiple ladder networks in different frequency regions to handle this problem. Firstly, the sensitivities and frequency-dependent features of network components are analyzed, based on which the topology and components of the networks in diverse frequency ranges are determined afterwards. Further, the network synthesis strategies in different frequency ranges are elaborately designed. Finally, the synthesis method is applied on a distribution transformer successfully, with the fact that the extracted network parameters meet all the constraints and its FRA curve matches well with the measured one. An intact method of multiple-network synthesis for transformer winding in wide frequency range, considering the iron core and non-tested winding, is offered in this paper. [ABSTRACT FROM AUTHOR]

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]

This paper focuses on minimum-time path tracking, a subproblem in motion planning of robotic systems. We generate a time-optimal velocity profile for robotic manipulators taking into account kinematic and dynamic constraints. Based on the special structure of the constraints (called peaked constraints), profile generation is formulated as a linear programming (LP) problem. The LP-based control problem is solved by a sequential optimization method. The presented algorithm has reduced computational time compared to a general LP solver. [ABSTRACT FROM AUTHOR]

An accurate discrimination on moisture status of oil-impregnated paper (OIP) bushings is crucial for the maintenance and replacement schedule of bushings. Based on frequency-domain spectroscopy (FDS) measurement and Dissado–Hill (DH) relaxation model, this article proposes a hybrid approach of hidden Markov model and gray wolf optimization (GWO-HMM) for MS estimation of bushings subjected to the ununiform moisture distribution and dynamic time-series modeling. First, simulation models of moisture diffusion and FDS of the OIP bushing were constructed using finite element modeling approach. Then, the GWO algorithm was employed to explore dielectric parameters influenced by moisture in the DH model. Then, the GWO-HMMs was adopted as a classification tool to discriminate the MS of the simulation and experimental data of the bushings. Classification results confirm that the average identification accuracies of the proposed method are 97.17% and 96.81% over these two datasets, which demonstrates the effectiveness of the proposed moisture estimate method for OIP bushings. [ABSTRACT FROM AUTHOR]

Fighting against the pandemic diseases with unique characters requires new sophisticated approaches like the artificial intelligence. This paper develops an artificial intelligence algorithm to produce multi-dimensional policies for controlling and minimizing the pandemic casualties under the limited pharmacological resources. In this respect, a comprehensive parametric model with a priority and age-specific vaccination policy and a variety of non-pharmacological policies are introduced. This parametric model is utilized for constructing an artificial intelligence algorithm by following the exact analogy of the model-based solution. Also, this parametric model is manipulated by the artificial intelligence algorithm to seek for the best multi-dimensional non-pharmacological policies that minimize the future pandemic casualties as desired. The role of the pharmacological and non-pharmacological policies on the uncertain future casualties are extensively addressed on the real data. It is shown that the developed artificial intelligence algorithm is able to produce efficient policies which satisfy the particular optimization targets such as focusing on minimization of the death casualties more than the infected casualties or considering the curfews on the people age over 65 rather than the other non-pharmacological policies. The paper finally analyses a variety of the mutant virus cases and the corresponding non-pharmacological policies aiming to reduce the morbidity and mortality rates. [ABSTRACT FROM AUTHOR]

This paper considers the downlink of a cognitive radio (CR) network formed by multiple primary and secondary transmitters, where each multiantenna transmitter serves a preknown set of single-antenna users. This paper assumes that the secondary and primary transmitters can simultaneously transmit their data over the same frequency bands to achieve high system spectrum efficiency. This paper considers the downlink balancing problem of maximizing the minimum signal-to-interference-plus-noise ratio (SINR) of the secondary transmitters subject to both the total power constraint of the secondary transmitters and the maximum interference constraint at each primary user due to secondary transmissions. This paper proposes solving the problem using the alternating direction method of multipliers, which leads to a distributed implementation through limited information exchange across the coupled secondary transmitters. This paper additionally proposes a solution that guarantees feasibility at each iteration. Simulation results demonstrate that the proposed solution converges to the centralized solution in a reasonable number of iterations. [ABSTRACT FROM AUTHOR]

In interconnected power systems, operated by several system operators, the participating areas are strongly dependent on their neighbors. In order to identify the economically efficient generation dispatch in each area, a distributed multi-area optimal power flow (OPF) must be solved. Additionally, installation of an increasing number of HVDC lines to deal with increased power flows from renewable generation is expected to change the power system operation paradigm. The controllability introduced by the HVDC lines should be considered and incorporated in the OPF algorithm. In this paper we introduce a formulation for the distributed solution of the OPF problem in multi-area systems consisting of both HVAC and HVDC lines. We show the applicability of this formulation on two different operating schemes for HVDC grids and we compare their performance with a central solution for the mixed HVAC/HVDC grid. The proposed formulations are based on a linearized solution of the OPF problem. The only data to be exchanged between the areas pertains to the border nodes. [ABSTRACT FROM AUTHOR]

This paper is concerned with a fuzzy analysis of power-flow (PF) involving uncertainties of load demands and network parameters. The crux of this paper is to propose an advanced fuzzy arithmetic. Fuzzy transformation method merges with backward–forward sweep in order to evaluate the contribution and propagation of uncertainty in IEEE 33-bus and 69-bus distribution systems. Results are validated by true intervals and random ranges. To determine true intervals, Global Optimization Problems (GOPs) are defined and solved through derivative-based and free techniques. To estimate random ranges, Monte-Carlo Simulations (MCSs) are employed. Our findings confirm that the sharpness of fuzzy intervals, tractability of computations, and applicability of possibility distributions. Following scenario-based evaluations, this paper discusses new implications of power losses, voltage profiles, optimal re-configuration, feeder extension, and reactive power compensation so that results would be beneficial to system planners and operators. Altogether, this paper provides a blueprint for a new way to handle uncertainties in a wide variety of power system problems without global optimization, linearization, and randomized simulations. [ABSTRACT FROM AUTHOR]

This paper presents secrecy analyses of a full-duplex MIMOME network which consists of two full-duplex multi-antenna users (Alice and Bob) and an arbitrarily located multi-antenna eavesdropper (Eve). The paper assumes that Eve's channel state information (CSI) is completely unknown to Alice and Bob except for a small radius of secured zone. The first part of this paper aims to optimize the powers of jamming noises from both users. To handle Eve's CSI being unknown to users, the focus is placed on Eve at the most harmful location, and the large matrix theory is applied to yield a hardened secrecy rate to work on. The performance gain of the power optimization in terms of maximum tolerable number of antennas on Eve is shown to be significant. The second part of this paper shows two analyses of anti-eavesdropping channel estimation (ANECE) that can better handle Eve with any number of antennas. One analysis assumes that Eve has a prior statistical knowledge of its CSI, which yields lower and upper bounds on secure degrees of freedom of the system as functions of the number (N) of antennas on Eve and the size (K) of information packet. The second analysis assumes that Eve does not have any prior knowledge of its CSI but performs blind detection of information, which yields an approximate secrecy rate for the case of K being larger than N. [ABSTRACT FROM AUTHOR]

This paper extends prior work on magnetic and inertial sensor frame calibration with an optimization study for the calibration of tilt-compensated electronic compasses. The novelty of this paper consists in formally demonstrating the optimal calibration orientations that maximize the observability of the various calibration coefficients. The optimal orientations are determined by analyzing the partial derivatives of the cost functions with respect to the calibration coefficients, and finding those orientations that produce their maximum slopes. This approach leads to the preservation of the information needed to determine the calibration coefficients by avoiding geometric dilution. Calibration schemes including optimal orientations for the accelerometers and magnetometers are determined not only for the alignment of the magnetometers and accelerometers sensor reference frames but also for the prerequisite calibrations in the sensor reference frames and partial body frames, respectively. This paper also shows that the optimal accelerometer orientations are different from the optimal magnetometer orientations, however, leaves the analysis of a possible compromise to future work. While confirming some intuitions about possible optimal orientations, this paper also offers an insight into those cases not supported by empirical wisdom, such as the misalignments, eliminating therefore the guesswork from the selection of the calibration profiles. [ABSTRACT FROM AUTHOR]

In this paper, we propose a design process for a plasmonic grating structure to induce the resonance at a target wavelength. In a specific condition, surface gratings may induce the surface plasmon propagation due to the diffraction and the resonance wavelength of the surface plasmon propagation is dependent on the grating shape. The grating configuration was designed by the topology optimization scheme based on the reaction-diffusion equation. To shift the resonance wavelength to the target wavelength, this paper maps the frequency response function to a probability distribution function (PDF). The mean value from the PDF becomes a part of the objective function and the design objective is set to minimize the distance between the present resonance wavelength and the target wavelength while keeping the energy intensity. The process of simulation and optimization was performed using the commercial package COMSOL combined with MATLAB programming. [ABSTRACT FROM AUTHOR]

Following Part I of this paper that reveals two distinct interpretations of demand curves and the corresponding different forms of the market clearing formulation, Part II of this paper analyzes the sequential and the iterative market clearing algorithms currently implemented in some markets. It is shown that these algorithms lead to socially sub-optimal solutions. The root cause of the problem is the lack of a clear representation of the demand benefit. The social surplus optimization based on the proper interpretation of demand curves is then proposed. A small numerical example is used to demonstrate the significant optimality gap between the socially optimal solution and the sequential/iterative solution. The potentially large impacts of the gap on the societal benefit and the individual resource revenues entail a close examination of these algorithms. [ABSTRACT FROM AUTHOR]

This paper aims to resolve a clear and unrealistic limitation found in recent works that have proposed solutions to the massive demand for the autonomous electric mobility-on-demand (AEMoD) services. Namely, this paper will focus on the matched charge-to-trip only service by enabling sub-class service; i.e., allowing vehicles to serve customer classes with trips needing less charge. The paper proposes a multi-class management system with a new queuing model for one city zone, and then derives the stability conditions of the system. Proportions of vehicles from each class that will immediately serve customers with sub-class service or full/partial charge are modeled, and the maximum expected response time of the system is then minimized by optimizing these vehicle service decisions. The advantages of the new model are then compared with previously proposed schemes and non-optimized models through simulations. [ABSTRACT FROM AUTHOR]

Intellectual property (IP) cores used in consumer electronics devices mandate protection against reverse engineering (RE) attacks. Functional obfuscation protects the design functionality by enhancing the complexity of RE attacks. This paper proposes a novel low cost (based on power-delay tradeoff) functional obfuscation methodology through employment of robust IP locking technique. In the proposed obfuscation methodology, several strong multipairwise secure IP locking block designs are presented that can only be actuated through application of valid serial key bits. As demonstration, this paper also shows a practical example of a functional obfuscated netlist structure of FIR filter. Proposed obfuscation on comparison with a recent approach for several DSP cores yielded a power reduction of ~10%, design cost reduction ~ 6.5% and security enhancement (strength of obfuscation) of $>\,\,4.29\,\,{e+9}$ times. [ABSTRACT FROM AUTHOR]

Bi-Level Optimization (BLO) is originated from the area of economic game theory and then introduced into the optimization community. BLO is able to handle problems with a hierarchical structure, involving two levels of optimization tasks, where one task is nested inside the other. In machine learning and computer vision fields, despite the different motivations and mechanisms, a lot of complex problems, such as hyper-parameter optimization, multi-task and meta learning, neural architecture search, adversarial learning and deep reinforcement learning, actually all contain a series of closely related subproblms. In this paper, we first uniformly express these complex learning and vision problems from the perspective of BLO. Then we construct a best-response-based single-level reformulation and establish a unified algorithmic framework to understand and formulate mainstream gradient-based BLO methodologies, covering aspects ranging from fundamental automatic differentiation schemes to various accelerations, simplifications, extensions and their convergence and complexity properties. Last but not least, we discuss the potentials of our unified BLO framework for designing new algorithms and point out some promising directions for future research. A list of important papers discussed in this survey, corresponding codes, and additional resources on BLOs are publicly available at: https://github.com/vis-opt-group/BLO. [ABSTRACT FROM AUTHOR]

Multi-relational learning on knowledge graphs infers high-order relations among the entities across the graphs. This learning task can be solved by label propagation on the tensor product of the knowledge graphs to learn the high-order relations as a tensor. In this paper, we generalize a widely used label propagation model to the normalized tensor product graph, and propose an optimization formulation and the scalable Low-rank Tensor-based Label Propagation algorithm (LowrankTLP) to infer multi-relations for two learning tasks, hyperlink prediction and multiple graph alignment. The optimization formulation minimizes the upper bound of the noisy-tensor estimating error for multiple graph alignment, by learning with a subset of the eigen-pairs in the spectrum of the normalized tensor product graph. We also provide a data-dependent transductive Rademacher bound for binary hyperlink prediction. We accelerate LowrankTLP with parallel tensor computation which enables label propagation on a tensor product of 100 graphs each of size 1000 in less than half hour in the simulation. LowrankTLP was also applied to predicting the author-paper-venue hyperlinks in publication records, alignment of segmented regions across up to 26 CT-scan images and alignment of protein-protein interaction networks across multiple species. The experiments demonstrate that LowrankTLP indeed well approximates the original label propagation with better scalability and accuracy. [ABSTRACT FROM AUTHOR]

The paper proposed a novel intelligent transmission surface (ITS) aided transmitter in an intelligent reflection surface (IRS) assisted multiuser multiple-input multiple-output (MIMO) network. The ITS deployed in the transmitter architecture can reduce the power consumption in signal beamforming at the base station (BS), and the IRS can help the information transfer from the ITS-aided transmitter to the users. We first maximize the weighted sum rate (WSR) of the users by jointly designing the beamforming vector at the BS and the phase shifts of ITS and IRS. To solve this non-convex optimization problem, we propose an effective algorithm in which the Lagrangian dual transform, the alternative optimization (AO) algorithm and the quadratic transform (QT) method are adopted to simplify the objective function. Then, the bisection search and the alternating direction method of multipliers (ADMM) algorithm are considered to design the optimal beamforming vector and phase shifts of ITS and IRS, respectively. Furthermore, the paper explores the energy efficiency (EE) maximization problem to emphasize the value of the ITS-assisted transmitter in terms of power savings. Finally, we compare the simulation results to various state-of-the-art techniques to see how much better the proposed algorithm is in terms of WSR and EE. [ABSTRACT FROM AUTHOR]

The paper studies a reconfigurable intelligent surface (RIS)-assisted multi-user uplink massive multiple-input multiple-output (MIMO) system with imperfect hardware. At the RIS, the paper considers phase noise, while at the base station, the paper takes into consideration the radio frequency impairments and low-resolution analog-to-digital converters. The paper derives approximate expressions for the ergodic achievable rate in closed forms under Rician fading channels. For the cases of infinite numbers of antennas and infinite numbers of reflecting elements, asymptotic data rates are derived to provide new design insights. The derived power scaling laws indicate that while guaranteeing a required system performance, the transmit power of the users can be scaled down at most by the factor $\frac{1}{M}$ when $M$ goes infinite, or by the factor $\frac{1}{MN}$ when $M$ and $N$ go infinite, where $M$ is the number of antennas and $N$ is the number of the reflecting units. Furthermore, an optimization algorithm is proposed based on the genetic algorithm to solve the phase shift optimization problem with the aim of maximizing the sum rate of the system. Additionally, the optimization problem with discrete phase shifts is considered. Finally, numerical results are provided to validate the correctness of the analytical results. [ABSTRACT FROM AUTHOR]

Objective: Resting-state functional magnetic resonance imaging (rs-fMRI)-derived functional connectivity (FC) patterns have been extensively used to delineate global functional organization of the human brain in healthy development and neuropsychiatric disorders. In this paper, we investigate how FC in males and females differs in an age prediction framework. Methods: We first estimate FC between regions-of-interest (ROIs) using distance correlation instead of Pearson’s correlation. Distance correlation, as a multivariate statistical method, explores spatial relations of voxel-wise time courses within individual ROIs and measures both linear and nonlinear dependence, capturing more complex between-ROI interactions. Then, we propose a novel non-convex multi-task learning (NC-MTL) model to study age-related gender differences in FC, where age prediction for each gender group is viewed as one task, and a composite regularizer with a combination of the non-convex $\ell _{2,1-2}$ and $\ell _{1-2}$ terms is introduced for selecting both common and task-specific features. Results and Conclusion: We validate the effectiveness of our NC-MTL model with distance correlation-based FC derived from rs-fMRI for predicting ages of both genders. The experimental results on the Philadelphia Neurodevelopmental Cohort demonstrate that our NC-MTL model outperforms several other competing MTL models in age prediction. We also compare the age prediction performance of our NC-MTL model using FC estimated by Pearson’s correlation and distance correlation, which shows that distance correlation-based FC is more discriminative for age prediction than Pearson’s correlation-based FC. Significance: This paper presents a novel framework for functional connectome developmental studies, characterizing developmental gender differences in FC patterns. [ABSTRACT FROM AUTHOR]

This paper proposes a novel scalable reinforcement learning approach for simultaneous routing and spectrum access in wireless ad-hoc networks. In most previous works on reinforcement learning for network optimization, the network topology is assumed to be fixed, and a different agent is trained for each transmission node—this limits scalability and generalizability. Further, routing and spectrum access are typically treated as separate tasks. Moreover, the optimization objective is usually a cumulative metric along the route, e.g., number of hops or delay. In this paper, we account for the physical-layer signal-to-interference-plus-noise ratio (SINR) in a wireless network and further show that bottleneck objective such as the minimum SINR along the route can also be optimized effectively using reinforcement learning. Specifically, we propose a scalable approach in which a single agent is associated with each flow and makes routing and spectrum access decisions as it moves along the frontier nodes. The agent is trained according to the physical-layer characteristics of the environment using a novel rewarding scheme based on the Monte Carlo estimation of the future bottleneck SINR. It learns to avoid interference by intelligently making joint routing and spectrum allocation decisions based on the geographical location information of the neighbouring nodes. [ABSTRACT FROM AUTHOR]

Due to the lack of distinctiveness to the background, robust monocular 6DOF pose tracking of less-distinct objects remains an important open problem. In this paper, we firstly analyze the object distinctiveness in the tracking process. Then, we propose a novel contour-part model based robust monocular pose tracking method for less-distinct objects. This paper uses the traditional contour feature for pose tracking in a novel strategy called contour part model. First, the contour part model is built by segmenting the projected contour rendered from the 3D model into contour segments of a certain length adaptively according to the Shi-Tomasi cornerness scores. Then, the correspondence is detected in the input image for each contour part by gradient orientation based template matching. Finally, pose tracking is achieved by solving the PnP problem. Experiment results on semi-synthetic and real images show that the proposed method performs better than the existing methods when pose tracking less-distinct objects and shows great robustness toward interference. Additionally, we combine the edge feature and the regional feature in a simple strategy. The overall performance of the fused method is boosted according to the experimental results on the RBOT dataset. The fact shows that the fusion of the edge and regional features has great potential for improving tracking performance. [ABSTRACT FROM AUTHOR]

Role assignment is an important and complex task in collaboration and management. Group role assignment (GRA) pursues the optimal team performance by assigning pertinent roles to agents in a team from the team’s viewpoint. There are many factors that should be considered when conducting role assignment. Budgets are such a factor. This paper presents a challenging role assignment problem in collaboration, called GRA with budget constraints (GRABC). This paper contributes a thorough investigation of the GRABC problem including: 1) the first formalization of the proposed problem; 2) a set of practical solutions to different forms of this problem by using the IBM ILOG CPLEX optimization package (CPLEX); 3) a set of necessary conditions for these problems to possess feasible solutions to improve the CPLEX solutions; and 4) a synthesized process to deal with GRABC problems. Contribution 2) actually clarifies a list of requirements in solving the GRABC problem. Simulations, experiments and a case study are used to verify the practicability and efficiency of the proposed solutions. [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]

This paper proposes an intelligent modeling and optimization method to set up the smart energy hub model for the multiple energy system and optimize the operation of its associated energy hub model automatically. The core idea of the proposed method is to divide the complex energy hub model into several simple energy hub models. In this paper, the proposed computerized algorithm, which is applied to the smart energy hub model division, includes an energy loop intelligent searching method, a real nodes arrangement method, and a virtual nodes insertion method. One case study for the multiple energy system of a residential district in Guangzhou city is performed to validate the effectiveness of the proposed method. Compared with the traditional calculation method, the proposed method guarantees global optimal operation decision for the whole multiple energy system and the computational burden is significantly reduced. [ABSTRACT FROM AUTHOR]

This paper describes a method of finding a constrained optimum excitation of a generic transmitting antenna subarray. Constraint of a maximum power coupled from the transmitting to the receiving subarray is discussed. Optimum realized gain, optimum gain, and optimum directivity goals are covered. The proposed method can operate on any generic multi-port antenna, with no assumptions taken on the geometry, the constituent elements construction, or the interelement coupling. This paper in particular investigates dense linear arrays and analyses the applicability of several typical transmitter/receiver partitionings to the proposed method. Achieving a below −30 dB TX-to-RX total coupling with less than 1 dB realized gain penalty over a 135° scanning angle is demonstrated for below-half-wavelength spaced 73 GHz $E$ -band PCB-based linear arrays. [ABSTRACT FROM AUTHOR]

In group decision making, it is inevitable that the individual decision maker’s subjectivity is involved, which causes difficulty in reaching a group decision. One of the difficulties is to aggregate a small set of expert opinions with the individual subjectivity or uncertainty modeled with probability theory. This difficult problem is called probability distribution function aggregation (DFA). This paper presents a simple and efficient approach to the DFA problem. The main idea of the proposed approach is that the DFA problem is modeled as a nonlinear function of a set of probability distribution functions, and then a linear feedback iteration scheme is proposed to solve the nonlinear function, leading to a group judgment or decision. Illustration of this new approach is given by a well-known DFA example which was solved with the Delphi method. The DFA problem is a part of the group decision problem. Therefore, the proposed algorithm is also useful to the decision making problem in general. Another contribution of the this paper is the proposed notation of systematically representing the imprecise group decision problem with the classification of imprecise information into three classes, namely incomplete information, vague information, and uncertain information. The particular DFA problem dealt with in this paper is then characterized with this general notation. [ABSTRACT FROM AUTHOR]

This paper compares three modern and two classical multiobjective optimizers (MOOs) as applied to real-world problems in electromagnetics. The behavior of sophisticated optimizers on simple test functions has been studied exhaustively. In contrast, the algorithms here are tested on practical applications, where the function evaluations are computationally expensive, making the convergence rate a crucial factor. The examples considered include the optimization of a narrowband slot antenna, a mushroom-type electromagnetic bandgap structure, and an ultrawideband Vivaldi antenna. Another popular topic in the literature is in comparing classical MOOs on electromagnetics problems. The modern optimizers chosen in this paper are state of the art and each has a distinct design philosophy. This paper introduces two unique MOOs to the electromagnetics community: BORG, an auto-adaptive genetic algorithm and the Multi-Objective Covariance Matrix Adaptation Evolutionary Strategy (MO-CMA-ES), an extension of the popular single-objective CMA-ES. These algorithms are compared to the Multi-objective Evolutionary Algorithm based on Decomposition (MOEA/D), a Chebysheff scalarization algorithm, and two classical MOOs. This paper will study the behavior of these algorithms on problems in electromagnetics with a limited number of function evaluations using five distinct metrics and will provide useful guidelines and recommended optimizer settings. [ABSTRACT FROM AUTHOR]

This paper proposes on-driving experience sharing algorithms at junctions in infrastructure-assisted vehicles-to-everything networks. For the purpose, a millimeter-wave (mmWave) technology is used because it provides multi-Gbps data rates which is helpful for handling users’ short stay times at junctions and spatial reuse due to high beam directionality which is helpful for interference-avoidance among densely deployed vehicles at junctions. To realize on-driving experience sharing, the proposed algorithms focus on joint resource allocation and scheduling for 3GPP-compliant multiple unicast vehicle-to-vehicle (V2V) communications where the vehicles are group leaders (GLs) in 3GPP Mode 4(d). The resource allocation stands for the roadside unit (RSU) allocation to scheduled V2V GL links where RSU is essentially required for overcoming blockage by establishing two-hop relaying. Because vehicles stay for short times at junctions, this paper designs two algorithms without or with delay considerations. Without delay considerations, the joint optimization of RSU allocation and scheduling was originally formulated as mixed 0-1 non-convex optimization. However our proposed algorithm reformulates the problem into mixed 0-1 convex optimization, which is computationally easier to solve. With delay considerations, our proposed algorithm dynamically controls video contents frame rates for time-average on-driving video sharing quality maximization subject to delay constraints, inspired by Lyapunov optimization. Extensive simulation results demonstrate that our algorithms can significantly outperform in a variety of scenarios. Furthermore, we conduct the cost analysis for the proposed algorithms in terms of capital expenditure (CAPEX) and operating expenditure (OPEX). [ABSTRACT FROM AUTHOR]

One objective of this paper is to propose a novel class of sequence pairs, called “quasi-orthogonal Z-complementary pairs (QOZCPs)”, each depicting Z-complementary property for their aperiodic auto-correlation sums and also having a low correlation zone when their aperiodic cross-correlation is considered. Construction of QOZCPs based on Successively Distributed Algorithms under Majorization Minimization (SDAMM) is presented. Another objective of this paper is to apply the proposed QOZCPs in fully polarimetric radar systems and analyse the corresponding ambiguity functions. It turns out that QOZCP waveforms are much more Doppler resilient than the known Golay complementary waveforms. [ABSTRACT FROM AUTHOR]

With the abundance of data, machine learning applications engaged increased attention in the last decade. An attractive approach to robustify the statistical analysis is to preprocess the data through clustering. This paper develops a low-complexity Riemannian optimization framework for solving optimization problems on the set of positive semidefinite stochastic matrices. The low-complexity feature of the proposed algorithms stems from the factorization of the optimization variable $\mathbf {X}=\mathbf {Y}\mathbf {Y}^{\mathrm{T}}$ X = Y Y T and deriving conditions on the number of columns of $\mathbf {Y}$ Y under which the factorization yields a satisfactory solution. The paper further investigates the embedded and quotient geometries of the resulting Riemannian manifolds. In particular, the paper explicitly derives the tangent space, Riemannian gradients and Hessians, and a retraction operator allowing the design of efficient first and second-order optimization methods for the graph-based clustering applications of interest. The numerical results reveal that the resulting algorithms present a clear complexity advantage as compared with state-of-the-art euclidean and Riemannian approaches for graph clustering applications. [ABSTRACT FROM AUTHOR]

Energy management strategy (EMS) is the key to the performance of fuel cell / battery hybrid system. At present, reinforcement learning (RL) has been introduced into this field and has gradually become the focus of research. However, traditional EMSs only take the energy consumption into consideration when optimizing the operation economy, and ignore the cost caused by power source degradations. It would cause the problem of poor operation economy regarding Total Cost of Ownership (TCO). On the other hand, most studied RL algorithms have the disadvantages of overestimation and improper way of restricting battery SOC, which would lead to relatively poor control performance as well. To solve these problems, this paper establishes a TCO model including energy consumption, equivalent energy consumption and degradation of power sources at first, then adopt the Double Q-learning RL algorithm with state constraint and variable action space to determine the optimal EMS. Finally, using hardware-in-the-loop platform, the feasibility, superiority and generalization of proposed EMS is proved by comparing with the optimal dynamic programming and traditional RL EMS and equivalent consumption minimum strategy (ECMS) under both training and unknown operating conditions. Results prove that the proposed strategy has high global optimality and excellent SOC control ability regardless of training or unknown conditions. [ABSTRACT FROM AUTHOR]

The dawn of quantum computing brings on a revolution in the way combinatorially complex power system problems such as Unit Commitment are solved. The Unit Commitment problem complexity is expected to increase in the future because of the trend toward the increase of penetration of intermittent renewables. Even though quantum computing has proven effective for solving a host of problems, its applications for power systems’ problems have been rather limited. In this paper, a quantum unit commitment is innovatively formulated and the quantum version of the decomposition and coordination alternate direction method of multipliers (ADMM) is established. The above is achieved by devising quantum algorithms and by exploiting the superposition and entanglement of quantum bits (qubits) for solving subproblems, which are then coordinated through ADMM to obtain feasible solutions. The main contributions of this paper include: 1) the innovative development of a quantum model for Unit Commitment; 2) development of decomposition and coordination-supported framework which paves the way for the utilization of limited quantum resources to potentially solve the large-scale discrete optimization problems; 3) devising the novel quantum distributed unit commitment (QDUC) to solve the problem in a larger scale than currently available quantum computers are capable of solving. The QDUC results are compared with those from its classical counterpart, which validate the efficacy of quantum computing. [ABSTRACT FROM AUTHOR]

This paper investigates the potential contribution that interconnectors can provide to efficiently support the security of interconnected power systems. The proposed modelling setup introduces a radical paradigm shift in the operation of the interconnectors and in their interactions with multiple markets. To the best of our knowledge, this is the first paper that models a simultaneous allocation of the interconnector capacity for the exchange of energy and of inertia-dependent primary frequency response. The benefits and impact of this new methodology are evaluated with typical market indicators (e.g., social welfare and interconnector revenues) under two different paradigms: a centralized approach where the interconnectors are operated to minimize the system operational cost and a market-based framework where the interconnectors are privately-owned assets with self-interested objectives. By modelling the interconnectors as “price-maker”, the proposed work quantifies the potential inefficiencies of market solutions while considering key elements such as capacity withdrawing. A case study of the GB-France systems assesses the value of interconnectors on system efficiency and security under the considered paradigms. [ABSTRACT FROM AUTHOR]

This paper proposes an optimization approach for day-ahead reactive power planning to improve voltage security in transmission networks. The problem is formulated as a voltage-secure multi-period optimal reactive power dispatch (MP-ORPD) problem. The optimization approach searches for optimal set-points of dynamic and static reactive power (var) resources. Specifically, the output includes set-points for switching shunts, transformer taps, and voltage magnitudes at the regulated buses. The primary goal is to maximize the dynamic reactive power reserve of the system, by minimizing the reactive power supplied by synchronous generators. As the size of the MP-ORPD problem increases significantly with increasing number of contingencies and time periods, efficiency is crucial for practical applications. In this paper, a decomposition technique based on consensus and alternating optimization, where integer variable targets are obtained via MILP, is used to partition the MP-ORPD problem into a set of subproblems, which can be solved in parallel to reduce the computation time. The proposed MP-ORPD problem and its solution algorithm are integrated into the EPRI-VCA software. The results of various power networks of large electric utilities in the Eastern interconnection demonstrate the effectiveness of the proposed algorithm in providing preventive control schedules. [ABSTRACT FROM AUTHOR]

In this paper, we consider an energy efficient resource allocation technique for a hybrid time division multiple access (TDMA) - non-orthogonal multiple access (NOMA) system. In such a hybrid system, the available time for transmission is divided into several sub-time slots, and a sub-time slot is allocated to serve a group of users (i.e., cluster). Furthermore, signals for the users in each cluster are transmitted based on the NOMA approach. With NOMA, multiple users can be served simultaneously through utilizing power domain multiplexing at transmitter and successive interference cancellation (SIC) at receiver. In this paper, to maximize the energy efficiency (EE), we jointly allocate both the available time slots and the available transmit power in the hybrid TDMA-NOMA system. In particular, we formulate an EE maximization (EE-Max) problem aiming to maximize the overall EE of the system with a per-user minimum rate and transmit power constraints. However, this joint optimization problem is non-convex in nature, and thus, cannot be solved directly. Therefore, we develop an iterative algorithm by approximating the original problem into a convex one with sequential convex approximation (SCA) and a novel second-order cone (SOC) approach. Simulation results demonstrate that the performance of the proposed hybrid TDMA-NOMA system with joint resource allocation outperforms the system with equal time allocation in terms of the overall EE. Simulation results further confirm that the proposed iterative approaches with SCA and SOC techniques converge within a few number of iterations while yielding the solution to the original non-convex problem. [ABSTRACT FROM AUTHOR]

Recently, electric power consumption has increased rapidly owing to the development of electric devices, and thus environmental problems such as global warming have come to the fore. Therefore, developed and developing countries are preparing various measures to prevent global warming. Minimum energy performance standards (MEPS) are one of the representative measures. MEPS is an efficiency regulation for induction motors that limits the minimum efficiency with regard to the power of the induction motors, in order to save energy. Studies have been conducted on induction motors to improve the efficiency and to satisfy MEPS. However, It is very difficult to satisfy the efficiency of induction motor for MEPS. Therefore, synchronous reluctance motors (SynRMs) are actively being studied to replace induction motors. In this paper, a SynRM is designed using a Kw-map. Moreover, to improve the output characteristics, the rib thickness of the SynRM is optimized using the response surface method. Finally, the validity of the design method, proposed in this paper is verified with a real test using the prototype. [ABSTRACT FROM AUTHOR]

The collective intelligent behaviors of insects or animal groups in nature have maintained the survival of the species for thousands of years. In this paper, a novel swarm intelligence algorithm called the social group entropy optimization (SGEO) algorithm is proposed for solving optimization tasks. The proposed algorithm is based on the social group model, the status optimization model, and the entropy model, which are the main contributions of this paper. First, the social group model and the feedback mechanism between Leaders and Followers are developed to reduce the probability of local optimum. Second, the status optimization model is described to reveal the changing rule about the population behavior states, to support the conversion between different social behaviors during evolution, to promote the algorithm to optimize quickly, and to avoid local optimization. Third, the entropy model is introduced to analyze the entropy of social groups, the change rule of difference entropy, and to set the information entropy as behavior’s criterion of state optimization. In addition, the mathematical model of the SGEO is deduced from the group theory, matter dynamics, and the information entropy theory. The convergence and parallelism of it have been analyzed and verified theoretically. Moreover, to test the effectiveness of the SGEO, it is used to solve benchmark functions’ problems that are commonly considered within the literature of evolutionary algorithms. Experimental results are compared with those of three other state-of-the-art algorithms. The superior performance of the SGEO validates its effectiveness and efficiency for the optimization problems, especially for the high-dimension problems. [ABSTRACT FROM PUBLISHER]

Volt-VAR optimization (VVO) has been investigated extensively in power systems. However, under the era of integrated energy systems (IES), the growing interdependencies between different energy systems complicate traditional VVO. This is further hardened by incurred gas quality problems due to the hydrogen injection in IES, produced by widely applied power-to-gas (P2G) facilitates that couple between power and gas systems. This paper develops a two-stage volt-VAR-pressure optimization (VVPO) model for PV-penetrated IES to manage the variation of system voltages while managing gas quality indices. In addition to the traditional voltage regulating devices, P2G facilities, which can mitigate fluctuating PV output via converting the surplus generation into hydrogen, are also used for voltage management. A two-stage distributionally robust optimization (DRO) based on moment information is utilized to model PV uncertainty. A semidefinite programming model is formulated and finally solved by the constraint generation algorithm. A 33-bus-20-node IES is used to verify the effectiveness of the proposed VVPO on voltage management, ensured gas quality with high economic efficiency. The proposed VVPO is applicable to injecting other green gases into gas systems while ensuring power quality and enable system operators to provide low-cost but high-quality multi-energy to customers. [ABSTRACT FROM AUTHOR]

Role assignment is a critical element in the role-based collaboration process. There are many different requirements to be considered when undertaking this task. This correspondence paper formalizes the group multirole assignment (GMRA) problem; proves the necessary and sufficient condition for the problem to have a feasible solution, provides an improved IBM ILOG CPLEX optimization package solution, and verifies the proposed solution with experiments. The contributions of this paper include: 1) the formalization of an important engineering problem, i.e., the GMRA problem; 2) a theoretical proof of the necessary and sufficient condition for GMRA to have a feasible solution; and 3) an improved ILOG solution to such a problem. [ABSTRACT FROM AUTHOR]

As an algorithmic framework, message passing is extremely powerful and has wide applications in the context of different disciplines including communications, coding theory, statistics, signal processing, artificial intelligence and combinatorial optimization. In this paper, we investigate the performance of a message-passing algorithm called min-sum belief propagation (BP) for the vertex-disjoint shortest $k$ -path problem ($k$ -VDSP) on weighted directed graphs, and derive the iterative message-passing update rules. As the main result of this paper, we prove that for a weighted directed graph $G$ of order $n$ , BP algorithm converges to the unique optimal solution of $k$ -VDSP on $G$ within $O(n^{2}w_{max})$ iterations, provided that the weight $w_{e}$ is nonnegative integral for each arc $e\in E(G)$ , where $w_{max}=\max \{w_{e}: e\in E(G)\}$. To the best of our knowledge, this is the first instance where BP algorithm is proved correct for NP-hard problems. Additionally, we establish the extensions of $k$ -VDSP to the case of multiple sources or sinks. [ABSTRACT FROM AUTHOR]

In concurrent spectrum sharing scenarios between radars and wireless communication systems, one strict approach to protect the radar from undesired interference is locating the base stations outside a guard (or exclusion) zone of the radar. As a result, users inside that zone experience bad communication coverage. This paper uses Reconfigurable Intelligent Surfaces (RISs) to improve the base station coverage of users in the radar exclusion zone. The paper shows, through analysis and simulation, that joint optimization of base station and RIS locations improves the probability of coverage in the exclusion zone over the shared spectrum without disturbing the radar operation. [ABSTRACT FROM AUTHOR]