Lammfraser0492

This article aims to stabilize an n-dimensional linear time-invariant (LTI) system, whose feedback packets are transmitted through a digital communication network. The digital network suffers from network delay and independent and identically distributed (i.i.d.) feedback dropouts, which may destabilize the system. The coupling among multiple state variables may further harm the stability of the system. In order to deal with these issues and save the occupied bandwidth of the feedback network, we propose a periodic event-triggering strategy. Brigatinib In our strategy, the state is measured periodically, but only quantized and transmitted when a certain condition is triggered. By well balancing the state coupling and making full use of both the information inside transmitted feedback packets and the one carried by sampling time instants, our strategy can maintain the desired mean square stability at a lower bit rate than conventional periodic sampling policies. The obtained stabilizing bit rate conditions are determined by the processing and network delays, the dropout rate, and the unstable eigenvalues of the system matrix, but independent of the process noise. Moreover, the lack of the direct state access does not incur any additional stabilizing bit rate. Simulations are done to confirm the effectiveness of the obtained stabilizing bit rate conditions.Indoor place category recognition for a cleaning robot is a problem in which a cleaning robot predicts the category of the indoor place using images captured by it. This is similar to scene recognition in computer vision as well as semantic mapping in robotics. Compared with scene recognition, the indoor place category recognition considered in this article differs as follows 1) the indoor places include typical home objects; 2) a sequence of images instead of an isolated image is provided because the images are captured successively by a cleaning robot; and 3) the camera of the cleaning robot has a different view compared with those of cameras typically used by human beings. Compared with semantic mapping, indoor place category recognition can be considered as a component in semantic SLAM. In this article, a new method based on the combination of a probabilistic approach and deep learning is proposed to address indoor place category recognition for a cleaning robot. Concerning the probabilistic approach, a new place-object fusion method is proposed based on Bayesian inference. For deep learning, the proposed place-object fusion method is trained using a convolutional neural network in an end-to-end framework. Furthermore, a new recurrent neural network, called the Bayesian filtering network (BFN), is proposed to conduct time-domain fusion. Finally, the proposed method is applied to a benchmark dataset and a new dataset developed in this article, and its validity is demonstrated experimentally.The present study concerns the dissipativity-based synchronization problem for the discrete-time switched neural networks with time-varying delay. Different from some existing research depending on the arbitrary and time-dependent switching mechanisms, all subsystems of the investigated delayed neural networks are permitted to be nondissipative. For reducing the switching frequency, the combined switching paradigm constituted by the time-dependent and state-dependent switching strategies is then constructed. In light of the proposed dwell-time-dependent storage functional, sufficient conditions with less conservativeness are formulated, under which the resultant synchronization error system is strictly (X,Y,Z)-θ-dissipative on the basis of the combined switching mechanism or the joint action of the switching mechanism and time-varying control input. Finally, the applicability and superiority of the theoretical results are adequately substantiated with the synchronization issue of two discrete-time switched Hopfield neural networks with time-varying delay, and the relationship among the performance index, time delay, and minimum dwell time is also revealed.This article studies the H∞ exponential synchronization problem for complex networks with quantized control input. An aperiodic sampled-data-based event-triggered scheme is introduced to reduce the network workload. Based on the discrete-time Lyapunov theorem, a new method is adopted to solve the sampled-data problem. In view of the aforementioned method, several sufficient conditions to ensure the H∞ exponential synchronization are acquired. Numerical simulations show that the proposed control schemes can significantly reduce the amount of transmitted signals while preserving the desired system performance.We present an adaptive force guidance system for laparoscopic surgery skills training. This system consists of self-adjusting fuzzy sliding-mode controllers and switching mode controllers to provide proper force feedback. Using virtual fixtures, the proposed system restricts motions or guides a trainee to navigate a surgical instrument in a 3-D space in a manner that mimics a human instructor who would teach the trainees by holding their hands. The self-adjusting controllers incorporate human factors, such as different force sensitivity and proficiency levels. The proposed system was implemented and evaluated using the computer-assisted surgical trainer (CAST). The effects of the force guidance system are presented based on the experimental test results.Evidential reasoning (ER) rule has been widely used in dealing with uncertainty. As an important parameter to measure the inherent property of evidence, the evidence reliability makes the ER rule constitute a generalized reasoning framework. In current research of the ER rule, the evidence reliability tends to be expressed in the form of quantitative value by certain methods or expert knowledge. The single quantitative value lacks the ability to describe the statistical property of reliability, which leads to unreasonable results. link2 In this article, a new ER rule with continuous probability distribution of reliability denoted by ERr-CR is proposed. The combination of two pieces of evidence is discussed in detail, where the reliability is profiled as random variables with specific probability distribution. To characterize the output of ERr-CR, a novel concept of expectation of the expected utility is proposed. In addition, the ERr-CR is expanded to multiple pieces of evidence to show its universality. Further, the basic performances of the ERr-CR are explored to illustrate the rationality. Moreover, a case study of safety assessment of natural gas storage tanks (NGSTs) is conducted to show the potential applications of ERr-CR, which makes the proposed method more practical.In this article, we present a novel matrix-factorization-based model, labeled here as Vicinal vertex allocated matrix factorization (VVAMo), for uncovering clusters in network data. Different from the past related efforts of network clustering, which consider the edge structure, vertex features, or both in their design, the proposed model includes the additional detail on vertex inclinations with respect to topology and features into the learning. In particular, by taking the latent preferences between vicinal vertices into consideration, VVAMo is then able to uncover network clusters composed of proximal vertices that share analogous inclinations, and correspondingly high structural and feature correlations. To ensure such clusters are effectively uncovered, we propose a unified likelihood function for VVAMo and derive an alternating algorithm for optimizing the proposed function. Subsequently, we provide the theoretical analysis of VVAMo, including the convergence proof and computational complexity analysis. To investigate the effectiveness of the proposed model, a comprehensive empirical study of VVAMo is conducted using extensive commonly used realistic network datasets. The results obtained show that VVAMo attained superior performances over existing classical and state-of-the-art approaches.Lithology identification plays an essential role in formation characterization and reservoir exploration. As an emerging technology, intelligent logging lithology identification has received great attention recently, which aims to infer the lithology type through the well-logging curves using machine-learning methods. However, the model trained on the interpreted logging data is not effective in predicting new exploration well due to the data distribution discrepancy. In this article, we aim to train a lithology identification model for the target well using a large amount of source-labeled logging data and a small amount of target-labeled data. The challenges of this task lie in three aspects 1) the distribution misalignment; 2) the data divergence; and 3) the cost limitation. To solve these challenges, we propose a novel active adaptation for logging lithology identification (AALLI) framework that combines active learning (AL) and domain adaptation (DA). The contributions of this article are three-fold 1) the domain-discrepancy problem in intelligent logging lithology identification is first investigated in this article, and a novel framework that incorporates AL and DA into lithology identification is proposed to handle the problem; 2) we design a discrepancy-based AL and pseudolabeling (PL) module and an instance importance weighting module to query the most uncertain target information and retain the most confident source information, which solves the challenges of cost limitation and distribution misalignment; and 3) we develop a reliability detecting module to improve the reliability of target pseudolabels, which, together with the discrepancy-based AL and PL module, solves the challenge of data divergence. Extensive experiments on three real-world well-logging datasets demonstrate the effectiveness of the proposed method compared to the baselines.To quantify user-item preferences, a recommender system (RS) commonly adopts a high-dimensional and sparse (HiDS) matrix. Such a matrix can be represented by a non-negative latent factor analysis model relying on a single latent factor (LF)-dependent, non-negative, and multiplicative update algorithm. However, existing models' representative abilities are limited due to their specialized learning objective. To address this issue, this study proposes an α-β-divergence-generalized model that enjoys fast convergence. Its ideas are three-fold 1) generalizing its learning objective with α -β -divergence to achieve highly accurate representation of HiDS data; 2) incorporating a generalized momentum method into parameter learning for fast convergence; and 3) implementing self-adaptation of controllable hyperparameters for excellent practicability. Empirical studies on six HiDS matrices from real RSs demonstrate that compared with state-of-the-art LF models, the proposed one achieves significant accuracy and efficiency gain to estimate huge missing data in an HiDS matrix.Measurement of total-plaque-area (TPA) is important for determining long term risk for stroke and monitoring carotid plaque progression. link3 Since delineation of carotid plaques is required, a deep learning method can provide automatic plaque segmentations and TPA measurements; however, it requires large datasets and manual annotations for training with unknown performance on new datasets. A UNet++ ensemble algorithm was proposed to segment plaques from 2D carotid ultrasound images, trained on three small datasets (n = 33, 33, 34 subjects) and tested on 44 subjects from the SPARC dataset (n = 144, London, Canada). The ensemble was also trained on the entire SPARC dataset and tested with a different dataset (n = 497, Zhongnan Hospital, China). Algorithm and manual segmentations were compared using Dice-similarity-coefficient (DSC), and TPAs were compared using the difference ( ∆TPA), Pearson correlation coefficient (r) and Bland-Altman analyses. Segmentation variability was determined using the intra-class correlation coefficient (ICC) and coefficient-of-variation (CoV).