We present a novel decision procedure for a fragment of separation logic (SL) with arbitrary nesting of separating conjunctions with boolean conjunctions, disjunctions, and guarded negations together with a support fo...
详细信息
ISBN:
(纸本)9783031572456;9783031572463
We present a novel decision procedure for a fragment of separation logic (SL) with arbitrary nesting of separating conjunctions with boolean conjunctions, disjunctions, and guarded negations together with a support for the most common variants of linked lists. Our method is based on a model-based translation to SMT for which we introduce several optimisations the most important of them is based on bounding the size of predicate instantiations within models of larger formulae, which leads to a much more efficient translation of SL formulae to SMT. Through a series of experiments, we show that, on the frequently used symbolic heap fragment, our decision procedure is competitive with other existing approaches, and it can outperform them outside the symbolic heap fragment. Moreover, our decision procedure can also handle some formulae for which no decision procedure has been implemented so far.
As advanced driver-assistant systems move towards higher automation levels, the industry now frequently employs data-driven techniques like Reinforcement Learning over rule-based systems. While the current literature ...
详细信息
In geometry education, traditional methods like chalkboard instruction or geometry software often fail to fully engage students due to their two-dimensional and static nature. Interactive methods commonly used in virt...
详细信息
ISBN:
(纸本)9789819756087;9789819756094
In geometry education, traditional methods like chalkboard instruction or geometry software often fail to fully engage students due to their two-dimensional and static nature. Interactive methods commonly used in virtual experiments, such as voice and gesture commands, do not adequately support precise selection required in geometry teaching. Our paper introduces an innovative intelligent pen and a virtual experiment platform specifically designed for geometry education. We have developed a multimodal fusion-based algorithm that interprets user intentions for selecting geometric planes in virtual space, utilizing historical interaction data. Additionally, we propose a dynamic weight updating algorithm that leverages past error information to enhance decision-making, thereby improving accuracy and reducing cognitive load. Our approach has demonstrated a high accuracy rate of 96.00% in experiments and has received positive feedback from users, indicating significant potential for enhancing interactive geometry education.
The large-screen and multi-screen design of the HMI (Human-machine interface) is one of the essential manifestations of today’s intelligent cabins. However, this trend poses a risk of distracting drivers and affectin...
详细信息
The dispersion of researchers across diverse universities and research institutions, coupled with the multifaceted nature of research domains, poses significant challenges in efficiently organizing collaborative ...
详细信息
The data augmentation method has been demonstrated as a ploy for enhancing model accuracy and adversarial robustness. However, it is well known that the traditional data augmentation methods have limited ability to de...
详细信息
Alcohol is a progressive central nervous system depressant. Increased alcohol consumption leads to alterations in cognitive processes and also affects speech production. In this study we present a corpus of n=35 patie...
详细信息
ISBN:
(纸本)9783031780134;9783031780141
Alcohol is a progressive central nervous system depressant. Increased alcohol consumption leads to alterations in cognitive processes and also affects speech production. In this study we present a corpus of n=35 patients diagnosed with Alcohol Dependency Syndrome (ADS) and n=35 matched healthy controls, and attempt to automatically distinguish the two speaker groups based on their spontaneous speech. By using wav2vec 2.0 embeddings as features, we were able to identify the two speaker categories with quite high accuracy (EER scores between 9% and 20%, and AUC scores above 0.885). We also sought to find the difference between the two speech tasks (a general spontaneous task and an alcohol-related one) performed by the subjects. Lastly, we analyzed the amount of pauses present in the speech of the subjects. Based on our results, even three simple pause-related attributes are sufficient for the automatic identification of the ADS subjects with an acceptable performance for both speech tasks.
High distortion and complex marine environment pose severe challenges to underwater tracking. In this paper, we propose a simple, template-free Adaptive Euclidean Tracking (AET) approach for underwater fish tracking b...
详细信息
Minimizing the round complexity of byzantine broadcast is a fundamental question in distributed computing and cryptography. In this work, we present the first early stopping byzantine broadcast protocol that tolerates...
详细信息
ISBN:
(纸本)9783031587337;9783031587344
Minimizing the round complexity of byzantine broadcast is a fundamental question in distributed computing and cryptography. In this work, we present the first early stopping byzantine broadcast protocol that tolerates up to t = n - 1 malicious corruptions and terminates in O(min{f(2), t+1}) rounds for any execution with f <= t actual corruptions. Our protocol is deterministic, adaptively secure, and works assuming a plain public key infrastructure. Prior early-stopping protocols all either require honest majority or tolerate only up to t = (1- epsilon)n malicious corruptions while requiring either trusted setup or strong number theoretic hardness assumptions. As our key contribution, we show a novel tool called a polariser that allows us to transfer certificate-based strategies from the honest majority setting to settings with a dishonest majority.
Approximate nearest neighbor (ANN) search in high dimensional Euclidean space is a fundamental problem of big data processing. Locality-Sensitive Hashing (LSH) is a popular scheme to solve the ANN search problem. In t...
详细信息
暂无评论