Reyesrooney7561

Z Iurium Wiki

Verze z 10. 10. 2024, 11:23, kterou vytvořil Reyesrooney7561 (diskuse | příspěvky) (Založena nová stránka s textem „Technologies employed include mobile and web-based services such as Internet hospitals and Wechat, big data analyses (including digital contact tracing thr…“)
(rozdíl) ← Starší verze | zobrazit aktuální verzi (rozdíl) | Novější verze → (rozdíl)

Technologies employed include mobile and web-based services such as Internet hospitals and Wechat, big data analyses (including digital contact tracing through QR codes or epidemic prediction), cloud computing, Internet of things, Artificial Intelligence (including the use of drones, robots, and intelligent diagnoses), 5G telemedicine, and clinical information systems to facilitate clinical management for COVID-19. Conclusions Practical experience in China shows that health information technologies play a pivotal role in responding to the COVID-19 epidemic.This article is concerned with the event-triggered finite-time H∞ estimator design for a class of discrete-time switched neural networks (SNNs) with mixed time delays and packet dropouts. To further reduce the data transmission, both the measured information of system outputs and switching signal of the SNNs are only allowed to be accessible for the constructed estimator at the certain triggering time instants. Under this consideration, the simultaneous presence of the switching and triggering actions also leads to the asynchronism between the indices of the SNNs and the designed estimator. Unlike the existing event-triggered strategies for the general switched linear systems, the proposed event-triggered mechanism not only allows the occurrence of multiple switches in one triggering interval but also removes the minimum dwell-time constraint on the switched signal. In light of the piecewise Lyapunov-Krasovskii functional theory, sufficient conditions are developed for the estimation error system to be stochastically finite-time bounded with a finite-time specified H∞ performance. Finally, the effectiveness and applicability of the theoretical results are verified by a switched Hopfield neural network.Population synthesis is the foundation of the agent-based social simulation. Current approaches mostly consider basic population and households, rather than other social organizations. This article starts with a theoretical analysis of the iterative proportional updating (IPU) algorithm, a representative method in this field, and then gives an extension to consider more social organization types. The IPU method, for the first time, proves to be unable to converge to an optimal population distribution that simultaneously satisfies the constraints from individual and household levels. It is further improved to a bilevel optimization, which can solve such a problem and include more than one type of social organization. Numerical simulations, as well as population synthesis using actual Chinese nationwide census data, support our theoretical conclusions and indicate that our proposed bilevel optimization can both synthesize more social organization types and get more accurate results.This brief studies a variation of the stochastic multiarmed bandit (MAB) problems, where the agent knows the a priori knowledge named the near-optimal mean reward (NoMR). In common MAB problems, an agent tries to find the optimal arm without knowing the optimal mean reward. However, in more practical applications, the agent can usually get an estimation of the optimal mean reward defined as NoMR. For instance, in an online Web advertising system based on MAB methods, a user's near-optimal average click rate (NoMR) can be roughly estimated from his/her demographic characteristics. As a result, application of the NoMR is efficient at improving the algorithm's performance. First, we formalize the stochastic MAB problem by knowing the NoMR that is in between the suboptimal mean reward and the optimal mean reward. Second, we use the cumulative regret as the performance metric for our problem, and we get that this problem's lower bound of the cumulative regret is Ω(1/Δ), where Δ is the difference between the subopte efficient than the compared bandit solutions. After sufficient iterations, NOMR-BANDIT saved 10%-80% more cumulative regret than the state of the art.A common shortfall of supervised deep learning for medical imaging is the lack of labeled data, which is often expensive and time consuming to collect. This article presents a new semisupervised method for medical image segmentation, where the network is optimized by a weighted combination of a common supervised loss only for the labeled inputs and a regularization loss for both the labeled and unlabeled data. To utilize the unlabeled data, our method encourages consistent predictions of the network-in-training for the same input under different perturbations. With the semisupervised segmentation tasks, we introduce a transformation-consistent strategy in the self-ensembling model to enhance the regularization effect for pixel-level predictions. To further improve the regularization effects, we extend the transformation in a more generalized form including scaling and optimize the consistency loss with a teacher model, which is an averaging of the student model weights. Caspase inhibitor We extensively validated the proposed semisupervised method on three typical yet challenging medical image segmentation tasks 1) skin lesion segmentation from dermoscopy images in the International Skin Imaging Collaboration (ISIC) 2017 data set; 2) optic disk (OD) segmentation from fundus images in the Retinal Fundus Glaucoma Challenge (REFUGE) data set; and 3) liver segmentation from volumetric CT scans in the Liver Tumor Segmentation Challenge (LiTS) data set. Compared with state-of-the-art, our method shows superior performance on the challenging 2-D/3-D medical images, demonstrating the effectiveness of our semisupervised method for medical image segmentation.Vision-based autonomous driving through imitation learning mimics the behavior of human drivers by mapping driver view images to driving actions. This article shows that performance can be enhanced via the use of eye gaze. Previous research has shown that observing an expert's gaze patterns can be beneficial for novice human learners. We show here that neural networks can also benefit. We trained a conditional generative adversarial network to estimate human gaze maps accurately from driver-view images. We describe two approaches to integrating gaze information into imitation networks eye gaze as an additional input and gaze modulated dropout. Both significantly enhance generalization to unseen environments in comparison with a baseline vanilla network without gaze, but gaze-modulated dropout performs better. We evaluated performance quantitatively on both single images and in closed-loop tests, showing that gaze modulated dropout yields the lowest prediction error, the highest success rate in overtaking cars, the longest distance between infractions, lowest epistemic uncertainty, and improved data efficiency.

Autoři článku: Reyesrooney7561 (Mayo Torres)