检索结果-内蒙古大学图书馆

Computationally Efficient Early Prognosis of the Outcome of Comatose Cardiac Arrest Survivors Using Slow-Wave Activity Features in EEG

学校读者我要写书评

暂无评论

Computationally Efficient Early Prognosis of the Outcome of ...

Computers in Cardiology (CinC)

作者： Miikka Salminen Juha Partala Eero Väyrynen Jukka Kortelainen Cerenion Oy Oulu Finland Oulu University Secure Programming Group Biomimetics and Intelligent Systems Group University of Oulu Oulu Finland Physiological Signal Analysis Team Center for Machine Vision and Signal Analysis MRC Oulu University of Oulu Oulu Finland

This study, part of ‘Predicting Neurological Recovery from Coma After Cardiac Arrest: The George B. Moody PhysioNet Challenge 2023’, evaluated a computationally efficient method in predicting cardiac arrest (CA) survivors' prognoses using electroencephalography (EEG) recordings of a dataset provided for participants. Authors' team Cerenion developed a random forest based machine learning algorithm. A feature set of channel-by-channel root mean square power of a well-described neurophysiological EEG phenomenon called slow-wave activity (SWA), with time elapsed since CA, was used. Five-fold cross-validation, using 80 % of the provided training set of EEG recordings from 607 out of 1020 patients, was used for evaluation. The held-out 20 % of data were used for testing and evaluating a final model trained on the full 80 % of the training data. Cross-validated results, evaluated at 72 hours after CA, for predicting the outcome were: AUROC 70 %, AUPRC 78 %, accuracy 68 %, F-measure 64 %. Evaluating the challenge metric on the training data at times of 12, 24, 48, and 72 hours after CA provided scores of: 0.32, 0.40, 0.64, and 0.58, respectively. The hidden validation and test sets were not used, earning no rank. The results show promise in using SWA power features in predicting the outcomes of comatose CA patients.

关键词：

Test Case Reduction: A Framework, Benchmark, and Comparative Study

学校读者我要写书评

暂无评论

Test Case Reduction: A Framework, Benchmark, and Comparative...

International Conference on Software Maintenance (ICSM)

作者： Patrick Kreutzer Tom Kunze Michael Philippsen Programming Systems Group Friedrich-Alexander University Erlangen-Nürnberg (FAU) Germany

Given a program that triggers a bug in a compiler (or other kind of language processor), the goal of test case reduction is to cut away all code that is irrelevant for the bug, i.e., to generate a smaller program that still induces the bug. Research has proposed several language-agnostic reduction techniques that automatically reduce bug-inducing programs in arbitrary programming languages, but there is no large-scale, conclusive evaluation of these algorithms yet. Furthermore, the development of new algorithms is hampered by the unavailability of comparable implementations of previous techniques and of diverse test programs that trigger different bugs in real compilers. To close these gaps and to foster future research in this area, this paper makes three contributions: (1) A framework that includes efficient, fine-tuned implementations of 6 state-of-the-art reducers, (2) a diverse benchmark that comprises 321 fuzzer-generated programs in two programming languages that trigger 110 different bugs in real compilers, and (3) a comparative study that builds upon our framework and benchmark and compares the reduction techniques w.r.t. their effectiveness and efficiency. Our results show that there is no reduction technique yet that performs best across all test cases and languages. Our framework and benchmark are available online and we provide the necessary scripts and tools to replicate our study.

关键词：

Optimistic concurrency control for real-world go programs (extended version with appendix)

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Zhang, Zhizhou Chabbi, Milind Welc, Adam Sherwood, Timothy University of California Santa Barbara United States Programming Systems Group Uber Technologies

We present a source-to-source transformation framework, GOCC, that consumes lock-based pessimistic concurrency programs in the Go language and transforms them into optimistic concurrency programs that use Hardware Transactional Memory (HTM). The choice of the Go language is motivated by the fact that concurrency is a first-class citizen in Go, and it is widely used in Go programs. GOCC performs rich interprocedural program analysis to detect and filter lock-protected regions and performs AST-level code transformation of the surrounding locks when profitable. Profitability is driven by both static analyses of critical sections and dynamic analysis via execution profiles. A custom HTM library, using perceptron, learns concurrency behavior and dynamically decides whether to use HTM in the rewritten lock/unlock points. Given the rich history of transactional memory research but its lack of adoption in any industrial setting, we believe this workflow, which ultimately produces source-code patches, is more apt for industry-scale adoption. Results on widely adopted Go libraries and applications demonstrate significant (up to 10×) and scalable performance gains resulting from our automated transformation while avoiding major performance regressions. © 2021, CC BY.

关键词： Profitability

MutantDistiller: Using Symbolic Execution for Automatic Detection of Equivalent Mutants and Generation of Mutant Killing Tests

学校读者我要写书评

暂无评论

MutantDistiller: Using Symbolic Execution for Automatic Dete...

IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW

作者： Michael Baer Norbert Oster Michael Philippsen Programming Systems Group Friedrich-Alexander University Erlangen-Nürnberg (FAU) Germany

ISBN: (数字)9781728110752

ISBN: (纸本)9781728110769

Mutation testing can be used to measure the quality of a given test suite. But two flaws prevent wide acceptance. First, there are equivalent mutants - mutants that are semantically equivalent to the unmodified version and therefore unkillable. Manually identifying those mutants is time-consuming and error-prone. Second, initially there are often too few test cases. Mutation testing detects missing cases. But it is too time-consuming to manually write all the required test cases. This paper shows how to use symbolic execution to tackle both problems, i.e., to detect equivalent mutants and exclude them from further analysis, and to automatically generate test cases that kill the remaining mutants. Our evaluation uses a set of 252 publicly available mutants for which it is known that they are hard to classify. Despite the fact that detecting equivalent mutants is an undecidable problem in general, our fully automatic tool MutantDistiller correctly classifies all of them (13 equivalent, 239 non-equivalent). MutantDistiller also generates test cases that kill the nonequivalent mutants.

关键词： Testing Tools Java Conferences Manuals Task analysis Software

Generalized group designs: overcoming the 4-design-barrier and constructing novel unitary 2-designs in arbitrary dimensions

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Kaposi, Ágoston Kolarovszki, Zoltán Solymos, Adrián Zimborás, Zoltán Quantum Computing and Quantum Information Research Group HUN-REN Wigner Research Centre for Physics Konkoly–Thege Miklós út 29-33 BudapestH-1525 Hungary Department of Programming Languages and Compilers Eötvös Loránd University Pázmány Péter sétány 1/C BudapestH-1117 Hungary Department of Physics of Complex Systems Eötvös Loránd University Pázmány Péter sétány 1/A BudapestH-1117 Hungary Algorithmiq Ltd Kanavakatu 3C Helsinki00160 Finland

Unitary designs are essential tools in several quantum information protocols. Similarly to other design concepts, unitary designs are mainly used to facilitate averaging over a relevant space, in this case, the unitary group U(d). While it is known that exact unitary t-designs exist for any degree t and dimension d, the most appealing type of designs, group designs (in which the elements of the design form a group), can provide at most 3-designs. Moreover, even group 2-designs can only exist in limited dimensions. In this paper, we present novel construction methods for creating exact generalized group designs based on the representation theory of the unitary group and its finite subgroups that overcome the 4-design-barrier of unitary group designs. Furthermore, a construction is presented for creating generalized group 2-designs in arbitrary dimensions. Copyright © 2024, The Authors. All rights reserved.

关键词： group theory

Extendibility of Brauer states

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Solymos, Adrian Jakab, Dávid Zimborás, Zoltán Quantum Computing and Quantum Information Research Group HUN-REN Wigner Research Centre for Physics Konkoly–Thege Miklós út 29-33 Budapest1525 Hungary Department of Physics of Complex Systems Eötvös Loránd University Pázmány Péter sétány 1/A Budapest1117 Hungary Pratt School of Engineering Duke University 305 Teer Engineering Building Box 90271 DurhamNC27708 United States Department of Programming Languages and Compilers Eötvös Loránd University Pázmány Péter sétány 1/C Budapest1117 Hungary Algorithmiq Ltd Kanavakatu 3C Helsinki00160 Finland

We investigate the extendibility problem for Brauer states, focusing on the symmetric two-sided extendibility and the de Finetti extendibility. By employing the representation theory of the unitary and orthogonal groups, we provide a general recipe for finding the (n, m)-extendible and n-de Finetti-extendible Brauer states. In the two-sided case we describe the special symmetry that only appears for (n, n)-extendible symmetric states. From the concrete form of the commutant to the diagonal action of the orthogonal group, we explicitly determine the set of parameters for which the Brauer states are (1, 2)-, (1, 3)- and (2, 2)-extendible in any dimension d. Using the branching rules from SU(d) to SO(d), we obtain the set of n-de Finetti-extendible Brauer states in low dimensions, and analytically describe the n → ∞ limiting shape for d = 3. Finally, we derive some general properties pertaining to the extendibility of Werner, isotropic and Brauer states. Copyright © 2024, The Authors. All rights reserved.

关键词： Quantum entanglement

Polynomial speedup in Torontonian calculation by a scalable recursive algorithm

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Kaposi, Ágoston Kolarovszki, Zoltán Kozsik, Tamás Zimborás, Zoltán Rakyta, Péter Department of Programming Languages and Compilers Eötvös Loránd University Budapest Hungary Wigner Research Centre for Physics The Hungarian Academy of Sciences Budapest Hungary BME-MTA Lendület Quantum Information Theory Research Group Budapest Hungary Department of Physics of Complex Systems Eötvös Loránd University Budapest Hungary

Evaluating the Torontonian function is a central computational challenge in the simulation of Gaussian Boson Sampling (GBS) with threshold detection. In this work, we propose a recursive algorithm providing a polynomial speedup in the exact calculation of the Torontonian compared to state-of-the-art algorithms. According to our numerical analysis the complexity of the algorithm is proportional to N1.06912N/2 with N being the size of the problem. We also show that the recursive algorithm can be scaled up to HPC use cases making feasible the simulation of threshold GBS up to 35 − 40 photon clicks without the needs of large-scale computational capacities. © 2021, CC BY-SA.

关键词： Computational complexity

Real-Time Gait Reconstruction For Virtual Reality Using a Single Sensor

学校读者我要写书评

暂无评论

Real-Time Gait Reconstruction For Virtual Reality Using a Si...

IEEE International Symposium on Mixed and Augmented Reality Workshops (ISMARW)

作者： Tobias Feigl Lisa Gruner Christopher Mutschler Daniel Roth Fraunhofer Institute of Integrated Circuits (IIS) Nürnberg Programming Systems Group Friedrich-Alexander University (FAU) Erlangen-Nürnberg Ludwig-MaximiliansUniversity (LMU) Technical University Munich (TUM) Munich Chair for Computer Aided Medical Procedures and Augmented Reality Technical University Munich (TUM)

ISBN: (数字)9781728176758

ISBN: (纸本)9781728176765

Embodying users through avatars based on motion tracking and reconstruction is an ongoing challenge for VR application developers. High quality VR systems use full-body tracking or inverse kinematics to reconstruct the motion of the lower extremities and control the avatar animation. Mobile systems are limited to the motion sensing of head-mounted displays (HMDs) and typically cannot offer *** propose an approach to reconstruct gait motions from a single head-mounted accelerometer. We train our models to map head motions to corresponding ground truth gait phases. To reconstruct leg motion, the models predict gait phases to trigger equivalent synthetic animations. We designed four models: a threshold-based, a correlation-based, a Support Vector Machine (SVM) -based and a bidirectional long-term short-term memory (BLSTM) -based model. Our experiments show that, while the BLSTM approach is the most accurate, only the correlation approach runs on a mobile VR system in real time with sufficient accuracy. Our user study with 21 test subjects examined the effects of our approach on simulator sickness and showed significantly less negative effects on disorientation.

关键词： Support vector machines Solid modeling Tracking Avatars Animation Real-time systems Delays

ViPR: Visual-odometry-aided pose regression for 6DoF camera localization

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Ott, Felix Feigl, Tobias Löffler, Christoffer Mutschler, Christopher Nürnberg Germany Programming Systems Group FAU Erlangen-Nürnberg Germany Machine Learning and Data Analytics Lab FAU Erlangen-Nürnberg Germany

Visual Odometry (VO) accumulates a positional drift in long-term robot navigation tasks. Although Convolutional Neural Networks (CNNs) improve VO in various aspects, VO still suffers from moving obstacles, discontinuous observation of features, and poor textures or visual information. While recent approaches estimate a 6DoF pose either directly from (a series of) images or by merging depth maps with the optical flow (OF), research that combines absolute pose regression with OF is limited. We propose ViPR, a novel architecture for long-term 6DoF VO that leverages synergies between absolute pose estimates (from PoseNet-like architectures) and relative pose estimates (from FlowNet-based architectures) by combining both through recurrent layers. Experiments with known publicly available datasets and with our own Industry dataset show that our novel design outperforms existing techniques in long-term navigation tasks. Copyright © 2019, The Authors. All rights reserved.

关键词： Computer vision