Notes![what is notes.io? What is notes.io?](/theme/images/whatisnotesio.png)
![]() ![]() Notes - notes.io |
This strategy significantly improves the quality of solutions at the initial stage and reduces the computational cost required in existing methods. Different benchmark problems are used to validate the proposed algorithm and the simulation results are compared with state-of-the-art dynamic multiobjective optimization algorithms (DMOAs). The results show that our approach is capable of improving the computational speed by two orders of magnitude while achieving a better quality of solutions than existing methods.This article investigates the impact of data integrity attacks (DIAs) on cooperative economic dispatch of distributed generators (DGs) in an ac microgrid. To establish resiliency against such attacks and ensure optimal operation, a localized event-driven attack-resilient scheme is proposed. Most of the existing works examine neighboring information to infer the presence of DIAs, where the detection is limited to events such as multiple link failures. Two kinds of DIAs are considered in this article--namely, fault and random attacks, which are segregated based on the final values of consensus updates. selleck chemical First, to improve the robustness of the detection theory, a localized resilient control update is designed by modeling each DG with a reference incremental cost. Second, event-driven control signal is generated for the local incremental cost and held upon the detection of attacks, to prevent malicious data from propagating to the neighboring nodes. The proposed strategy acts immediately upon the detection of DIA to ensure maximization in the economic profit. Furthermore, the proposed detection approach is theoretically verified and validated using simulation conditions.Transfer learning has received much attention recently and has been proven to be effective in a wide range of applications, whereas studies on regression problems are still scarce. In this article, we focus on the transfer learning problem for regression under the situations of conditional shift where the source and target domains share the same marginal distribution while having different conditional probability distributions. We propose a new framework called transfer learning based on fuzzy residual (ResTL) which learns the target model by preserving the distribution properties of the source data in a model-agnostic way. First, we formulate the target model by adding fuzzy residual to a model-agnostic source model and reuse the antecedent parameters of the source fuzzy system. Then two methods for bias computation are provided for different considerations, which refer to two ResTL methods called ResTLLS and ResTLRD. Finally, we conduct a series of experiments both on a toy example and several real-world datasets to verify the effectiveness of the proposed method.The critical step of learning the robust regression model from high-dimensional visual data is how to characterize the error term. The existing methods mainly employ the nuclear norm to describe the error term, which are robust against structure noises (e.g., illumination changes and occlusions). Although the nuclear norm can describe the structure property of the error term, global distribution information is ignored in most of these methods. It is known that optimal transport (OT) is a robust distribution metric scheme due to that it can handle correspondences between different elements in the two distributions. Leveraging this property, this article presents a novel robust regression scheme by integrating OT with convex regularization. The OT-based regression with L₂ norm regularization (OTR) is first proposed to perform image classification. The alternating direction method of multipliers is developed to handle the model. To further address the occlusion problem in image classification, the extended OTR (EOTR) model is then presented by integrating the nuclear norm error term with an OTR model. In addition, we apply the alternating direction method of multipliers with Gaussian back substitution to solve EOTR and also provide the complexity and convergence analysis of our algorithms. Experiments were conducted on five benchmark datasets, including illumination changes and various occlusions. The experimental results demonstrate the performance of our robust regression model on biometric image classification against several state-of-the-art regression-based classification methods.This article aims to accommodate networked games in which the players' dynamics are subjected to unmodeled and disturbance terms. The unmodeled and disturbance terms are regarded as extended states for which observers are designed to estimate them. Compensating the players' dynamics with the observed values, the control laws are designed to achieve the robust seeking of the Nash equilibrium for networked games. First, we consider the case in which the players' dynamics are subject to time-varying disturbances only. In this case, the seeking strategy is developed by employing a smooth observer based on the proportional-integral (PI) control. By utilizing the designed strategy, we show that the players' actions would converge to a small neighborhood of the Nash equilibrium. Moreover, the ultimate bound can be adjusted to be arbitrarily small by tuning the control gains. Then, we further consider the case in which both an unmodeled term and a disturbance term coexist in the players' dynamics. In this case, we adapt the idea from the robust integral of the sign of the error (RISE) method in the strategy design to achieve the asymptotic seeking of the Nash equilibrium. Both strategies are analytically investigated via the Lyapunov stability analysis. The applications of the proposed methods for a network of velocity-actuated vehicles are discussed. Finally, the effectiveness of the proposed methods is verified via conducting numerical simulations.In the information age of big data, and increasingly large and complex networks, there is a growing challenge of understanding how best to restrain the spread of harmful information, for example, a computer virus. Establishing models of propagation and node immunity are important parts of this problem. In this article, a dynamic node immune model, based on the community structure and threshold (NICT), is proposed. First, a network model is established, which regards nodes carrying harmful information as new nodes in the network. The method of establishing the edge between the new node and the original node can be changed according to the needs of different networks. The propagation probability between nodes is determined by using community structure information and a similarity function between nodes. Second, an improved immune gain, based on the propagation probability of the community structure and node similarity, is proposed. The improved immune gain value is calculated for neighbors of the infected node at each time step, and the node is immunized according to the hand-coded parameter immune threshold.
Homepage: https://www.selleckchem.com/products/golvatinib-e7050.html
![]() |
Notes is a web-based application for online taking notes. You can take your notes and share with others people. If you like taking long notes, notes.io is designed for you. To date, over 8,000,000,000+ notes created and continuing...
With notes.io;
- * You can take a note from anywhere and any device with internet connection.
- * You can share the notes in social platforms (YouTube, Facebook, Twitter, instagram etc.).
- * You can quickly share your contents without website, blog and e-mail.
- * You don't need to create any Account to share a note. As you wish you can use quick, easy and best shortened notes with sms, websites, e-mail, or messaging services (WhatsApp, iMessage, Telegram, Signal).
- * Notes.io has fabulous infrastructure design for a short link and allows you to share the note as an easy and understandable link.
Fast: Notes.io is built for speed and performance. You can take a notes quickly and browse your archive.
Easy: Notes.io doesn’t require installation. Just write and share note!
Short: Notes.io’s url just 8 character. You’ll get shorten link of your note when you want to share. (Ex: notes.io/q )
Free: Notes.io works for 14 years and has been free since the day it was started.
You immediately create your first note and start sharing with the ones you wish. If you want to contact us, you can use the following communication channels;
Email: [email protected]
Twitter: http://twitter.com/notesio
Instagram: http://instagram.com/notes.io
Facebook: http://facebook.com/notesio
Regards;
Notes.io Team