Notes

Environmentally friendly Metropolitan Drainage Technique (SUDS) modeling promoting decision-making: A systematic quantitative evaluate.
Computer simulation results are presented to confirm the theoretical development.Several evolution strategies for in vivo computation are proposed with the aim of realizing tumor sensitization and targeting (TST) by externally manipulable nanoswimmers. In such targeting systems, nanoswimmers assembled by magnetic nanoparticles are externally manipulated to search for the tumor in the high-risk tissue by a rotating magnetic field produced by a coil system. This process can be interpreted as in vivo computation, where the tumor in the high-risk tissue corresponds to the global maximum or minimum of the in vivo optimization problem, the nanoswimmers are seen as the computational agents, the tumor-triggered biological gradient field (BGF) is used for fitness evaluation of the agents, and the high-risk tissue is the search space. Considering that the state-of-the-art magnetic nanoswimmer control method can only actuate all the nanoswimmers heading in the same direction simultaneously, we introduce the orthokinetic movement strategies into the agent location updating in the existing swarm intelligence algorithms. Especially, the gravitational search algorithm (GSA) is revisited and the corresponding in vivo optimization algorithm called orthokinetic GSA (OGSA) is proposed to carry out the TST. Furthermore, to determine the direction of the orthokinetic agent movement in every iteration of the operation, we propose several strategies according to the fitness ranking of the nanoswimmers in the BGF. To verify the superiority of the OGSA and choose the optimal evolution strategy, some numerical experiments are presented and compared with that of the brute-force search, which represents the traditional method for TST. It is found that the TST performance can be improved by the weak priority evolution strategy (WP-ES) in most of the scenarios.Cooperative co-evolutionary algorithms have addressed many large-scale problems successfully, but the nonseparable large-scale problems with overlapping subcomponents are still a serious difficulty that has not been conquered yet. First, the existence of shared variables makes the problem hard to be decomposed. Second, existing cooperative co-evolutionary frameworks usually cannot maintain the two crucial factors high cooperation frequency and effective computing resource allocation, simultaneously when optimizing the overlapping subcomponents. Aiming at these two issues, this article proposes a new contribution-based cooperative co-evolutionary algorithm to decompose and optimize nonseparable large-scale problems with overlapping subcomponents effectively and efficiently 1) a contribution-based decomposition method is proposed to assign the shared variables. Among all the subcomponents containing a shared variable, the one that contributes the most to the entire problem will include the shared variable and 2) to achieve the two crucial factors at the same time, a new contribution-based optimization framework is designed to award the important subcomponents based on the round-robin structure. Experimental studies show that the proposed algorithm performs significantly better than the state-of-the-art algorithms due to the effective grouping structure generated by the proposed decomposition method and the fast optimizing speed provided by the new optimization framework.This article studies the reachable set of cyber-physical systems subject to stealthy attacks with the Kullback-Leibler divergence adopted to describe the stealthiness. The reachable set is defined as the set in which both the system state and the estimation error of the Kalman filter reside with a certain probability. The necessary and sufficient conditions of the reachable set being unbounded are given for the finite and infinite time cases, respectively. When Akti-1/2 mouse is bounded, an ellipsoidal outer approximation is obtained by solving a convex optimization problem. An application of this approximation to the safety evaluation is also given. A numerical simulation of an unmanned ground vehicle is presented to demonstrate the effectiveness of the proposed approach.In this article, a neural-network-based adaptive fixed-time control scheme is proposed for the attitude tracking of uncertain rigid spacecrafts. A novel singularity-free fixed-time switching function is presented with the directly nonsingular property, and by introducing an auxiliary function to complete the switching function in the controller design process, the potential singularity problem caused by the inverse of the error-related matrix could be avoided. Then, an adaptive neural controller is developed to guarantee that the attitude tracking error and angular velocity error can both converge into the neighborhood of the equilibrium within a fixed time. With the proposed control scheme, no piecewise continuous functions are required any more in the controller design to avoid the singularity, and the fixed-time stability of the entire closed-loop system in the reaching phase and sliding phase is analyzed with a rigorous theoretical proof. Comparative simulations are given to show the effectiveness and superiority of the proposed scheme.This article introduces a distributed estimator design problem for the stochastic Hamiltonian systems under fading wireless channels. The phenomenon that the channel outputs are related to the target state and the estimation of the adjacent state is considered to facilitate the implementation of distributed state estimation. Furthermore, the fixed undirected graph simplifies the analysis of the system. By resorting to fading channels and the graph theory, the main goal of the addressed problem is to design estimators to estimate the target state of the Hamiltonian system and guarantee the exponential stability in the mean-square sense of the estimation system. Based on the stochastic analysis method and the structural properties of the Hamiltonian system, sufficient conditions are obtained for the existence of the designed estimator gain for each sensor. Two examples are given to indicate the effectiveness of the theoretical claim.Information granulation and degranulation play a fundamental role in granular computing (GrC). Given a collection of information granules (referred to as reference information granules), the essence of the granulation process (encoding) is to represent each data (either numeric or granular) in terms of these reference information granules. The degranulation process (decoding) that realizes the reconstruction of original data is associated with a certain level of reconstruction error. #link# An important issue is how to reduce the reconstruction error such that the data could be reconstructed more accurately. In this study, the granulation process is realized by involving fuzzy clustering. A novel neural network is leveraged in the consecutive degranulation process, which could help significantly reduce the reconstruction error. We show that the proposed degranulation architecture exhibits improved capabilities in reconstructing original data in comparison with other methods. A series of experiments with the use of synthetic data and publicly available datasets coming from the machine-learning repository demonstrates the superiority of the proposed method over some existing alternatives.
Read More: https://www.selleckchem.com/products/akti-1-2.html