Background: In this Innovative Practice Work in Progress, we present our initial efforts to integrate formal methods, with a focus on model-checking specifications written in Temporal Logic of Actions (TLA+), into com...
详细信息
Background: In this Innovative Practice Work in Progress, we present our initial efforts to integrate formal methods, with a focus on model-checking specifications written in Temporal Logic of Actions (TLA+), into computerscience education, targeting undergraduate juniors/seniors and graduate students. Many safety-critical systems and services crucially depend on correct and reliable behavior. Formal methods can play a key role in ensuring correct and safe system behavior, yet remain underutilized in educational and industry contexts. Aims: We aim to (1) qualitatively assess the state of formal methods in computerscience programs, (2) construct level-appropriate examples that could be included midway into one’s undergraduate studies, (3) demonstrate how to address successive "failures" through progressively stringent safety and liveness requirements, and (4) establish an ongoing framework for assessing interest and relevance among students. Methods: We detail our pedagogical strategy for embedding TLA+ into an intermediate course on formal methods at our institution. After starting with a refresher on mathematical logic, students specify the rules of simple puzzles in TLA+ and use its included model checker (known as TLC) to find a solution. We gradually escalate to more complex, dynamic, event-driven systems, such as the control logic of a microwave oven, where students will study safety and liveness requirements. We subsequently discuss explicit concurrency, along with thread safety and deadlock avoidance, by modeling bounded counters and buffers. Results: Our initial findings suggest that through careful curricular design and choice of examples and tools, it is possible to inspire and cultivate a new generation of software engineers proficient in formal methods. Conclusions: Our initial efforts suggest that 84% of our students had a positive experience in our formal methods course. Our future plans include a longitudinal analysis within our own institution and
Background and purpose Early haematoma expansion is determinative in predicting outcome of intracerebral haemorrhage(ICH)*** aims of this study are to develop a novel prediction model for haematoma expansion by applyi...
详细信息
Background and purpose Early haematoma expansion is determinative in predicting outcome of intracerebral haemorrhage(ICH)*** aims of this study are to develop a novel prediction model for haematoma expansion by applying deep learning model and validate its prediction *** Data of this study were obtained from a prospectively enrolled cohort of patients with primary supratentorial ICH from our *** developed a deep learning model to predict haematoma expansion and compared its performance with conventional non-contrast CT(NCCT)*** evaluate the predictability of this model,it was also compared with a logistic regression model based on haematoma volume or the BAT *** A total of 266 patients were finally included for analysis,and 74(27.8%)of them experienced early haematoma *** deep learning model exhibited highest C statistic as 0.80,compared with 0.64,0.65,0.51,0.58 and 0.55 for hypodensities,black hole sign,blend sign,fluid level and irregular shape,*** the C statistics for swirl sign(0.70;p=0.211)and heterogenous density(0.70;p=0.141)were not significantly higher than that of the deep learning ***,the predictive value for the deep learning model was significantly superior to that of the logistic model of haematoma volume(0.62;p=0.042)and the BAT score(0.65;p=0.042).Conclusions Compared with the conventional NCCT markers and BAT predictive model,the deep learning algorithm showed superiority for predicting early haematoma expansion in ICH patients.
Kullback-Leibler (KL) divergence is one of the most important measures to calculate the difference between probability distributions. In this paper, we theoretically study several properties of KL divergence between m...
Kullback-Leibler (KL) divergence is one of the most important measures to calculate the difference between probability distributions. In this paper, we theoretically study several properties of KL divergence between multivariate Gaussian distributions. Firstly, for any two n-dimensional Gaussian distributions Ɲ1 and Ɲ2, we prove that when KL(Ɲ2‖Ɲ1) ≤ ε (ε > 0) the supremum of KL (Ɲ1‖Ɲ2) is (1/2) ((-W0 (-e-(1+2ε)))-1 + log(-W0 (-e-(1+2ε))) - 1), where W0 is the principal branch of Lambert W function. For small ε, the supremum is ε + 2ε1.5 + O (ε2). This quantifies the approximate symmetry of small KL divergence between Gaussian distributions. We further derive the infimum of KL(Ɲ1‖Ɲ2) when KL(Ɲ2‖Ɲ1) ≥ M (M > 0). We give the conditions when the supremum and infimum can be attained. Secondly, for any three n-dimensional Gaussian distributions Ɲ1, Ɲ2, and Ɲ3, we theoretically show that an upper bound of KL (Ɲ1‖Ɲ3) is 3ε1 + 3ε2 + 2√ε1ε2 + o(ε1)+ o(ε2) when KL (Ɲ1‖Ɲ2) ≤ ε1 and KL(Ɲ2‖Ɲ3) ≤ ε2 (ε1, ε2 ≥ 0). This reveals that KL divergence between Gaussian distributions follows a relaxed triangle inequality. Note that, all these bounds in the theorems presented in this work are independent of the dimension n. Finally, we discuss several applications of our theories in deep learning, reinforcement learning, and sample complexity research.
Graph Neural Networks (GNNs) rely on graph convolutions to exploit meaningful patterns in networked data. Based on matrix multiplications, convolutions incur in high computational costs leading to scalability limitati...
详细信息
Graph Neural Networks (GNNs) rely on graph convolutions to exploit meaningful patterns in networked data. Based on matrix multiplications, convolutions incur in high computational costs leading to scalability limitations in practice. To overcome these limitations, proposed methods rely on training GNNs in smaller number of nodes, and then transferring the GNN to larger graphs. Even though these methods are able to bound the difference between the output of the GNN with different number of nodes, they do not provide guarantees against the optimal GNN on the very large graph. In this paper, we propose to learn GNNs on very large graphs by leveraging the limit object of a sequence of growing graphs, the graphon. We propose to grow the size of the graph as we train, and we show that our proposed methodology – learning by transference – converges to a neighborhood of a first order stationary point on the graphon data. A numerical experiment validates our proposed approach.
Particle gradient descent, which uses particles to represent a probability measure and performs gradient descent on particles in parallel, is widely used to optimize functions of probability measures. This paper consi...
详细信息
This paper presents a review of the field of reinforcement learning (RL), with a focus on providing a comprehensive overview of the key concepts, techniques, and algorithms for beginners. RL has a unique setting, jarg...
详细信息
The risk of data exfiltration remains a concern, even when the connectivity of the victim system is limited or the domain is physically isolated. This paper delves into the unique challenges associated with data exfil...
详细信息
Integrating RGB frames with alternative modality inputs is gaining increasing traction in many vision-based reinforcement learning (RL) applications. Existing multi-modal vision-based RL methods usually follow a Globa...
Integrating RGB frames with alternative modality inputs is gaining increasing traction in many vision-based reinforcement learning (RL) applications. Existing multi-modal vision-based RL methods usually follow a Global Value Estimation (GVE) pipeline, which uses a fused modality feature to obtain a unified global environmental description. However, such a feature-level fusion paradigm with a single critic may fall short in policy learning as it tends to overlook the distinct values of each modality. To remedy this, this paper proposes a Local modality-customized Value Estimation (LVE) paradigm, which dynamically estimates the contribution and adjusts the importance weight of each modality from a value-level perspective. Furthermore, a task-contextual re-fusion process is developed to achieve a task-level re-balance of estimations from both feature and value levels. To this end, a Hierarchical Adaptive Value Estimation (HAVE) framework is formed, which adaptively coordinates the contributions of individual modalities as well as their collective efficacy. Agents trained by HAVE are able to exploit the unique characteristics of various modalities while capturing their intricate interactions, achieving substantially improved performance. We specifically highlight the potency of our approach within the challenging landscape of autonomous driving, utilizing the CARLA benchmark with neuromorphic event and depth data to demonstrate HAVE's capability and the effectiveness of its distinct components. The code of our paper can be found at https://***/Yara-HYR/HAVE.
In the contemporary era, harnessing millimeter-wave frequencies emerges as a compelling strategy to fulfill the swift data transfer requirements for 5G communications. Consequently, this study involves designing a met...
详细信息
Halide perovskites exhibit high performance in all sorts of optoelectronic and photonic areas, suggesting their huge potential in integrated photonic devices. However, until now, all optical logic gates based on perov...
详细信息
Halide perovskites exhibit high performance in all sorts of optoelectronic and photonic areas, suggesting their huge potential in integrated photonic devices. However, until now, all optical logic gates based on perovskites are still rarely explored, hindering the development of all-optical networks and computing. Herein, a new concept of all-optical logic gates is proposed based on the modulation of photoluminescence(PL) from perovskite nanocrystals(PNCs). A hierarchical photonic crystal(Hie PhC) is developed by self-assembling polystyrene(PS) and SiO2nanoparticles, which exhibit a higher PL enhancement than that of a monolayer PhC. Moreover, the light-controlled PL is realized by taking advantage of the high thermal response of the PL from PNCs/Hie PhC on polyethylene(PE) substrate, assisted by a graphene layer for light-heat conversion. Consequently, optical diode and triode are achieved based on the modulated PL, which exhibit contrast ratios(CR) of 24.7 and 74.0 dB, ***-optical logic gates, including “AND”, “OR” and “NOT”, are realized based on the optical diode and triode.
暂无评论