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

Women Self Defense Device

学校读者我要写书评

暂无评论

Women Self Defense Device

Bangalore Humanitarian Technology Conference (B-HTC), IEEE

作者： Jayashree Agarkhed Aishwarya Rathi Maheshwari Faqarunnisa Begum P.D.A College of Engineering Kalaburagi India Machine learning data associate-I Amazon India Pvt Ltd India

ISBN: (数字)9781728187945

ISBN: (纸本)9781728187952

According to the Indian Constitution, Women also have the right to live independent, glorious lives like men. Currently, Women all over the world are deciding their precious and self-place. On the other hand, safety for Women has become a huge problem. Women are beginning to feel insecure due to the incidents happening with them like crimes, molestations, kidnapping etc. Thus, to avoid this kind of harassments, Women need to be taught self-defense; defending against criminals to protect one-self. “Women self-defense system” is the solution for girls security to fight against crimes like molestation, rape, kidnapping, eve teasing etc. The defense devices are to be proposed in large scale productions so that no women should consider powerless while facing such crime issues. This project primarily focuses on women safety system by including sensors. The paper “WOMEN SELF DEFENSE DEVICE” (WSDD) aims at providing security by embedding touch sensor and pulse sensors in an Arduino based module. Location can be tracked with the help of longitude and latitude. Through GSM and GPS, further messages are sent to the registered contact such as Police stations, family or friends. Non-lethal shocks are provided for defending against attacker for time being.

关键词： Sensors Safety Tactile sensors Security Global Positioning System GSM Law enforcement

Improved decision making with similarity based machine learning: Applications in chemistry

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Lemm, Dominik von Rudorff, Guido Falk von Lilienfeld, O. Anatole University of Vienna Faculty of Physics Kolingasse 14-16 ViennaAT-1090 Austria University of Vienna Vienna Doctoral School in Physics Boltzmanngasse 5 ViennaAT-1090 Austria Departments of Chemistry Materials Science and Engineering and Physics University of Toronto St. George Campus TorontoON Canada Vector Institute for Artificial Intelligence TorontoONM5S 1M1 Canada Machine Learning Group Technische Universität Berlin Institute for the Foundations of Learning and Data Berlin10587 Germany

Despite the fundamental progress in autonomous molecular and materials discovery, data scarcity throughout chemical compound space still severely hampers the use of modern ready-made machine learning models as they rely heavily on the paradigm,’the bigger the data the better’. Presenting similarity based machine learning (SML), we show an approach to select data and train a model on-the-fly for specific queries, enabling decision making in data scarce scenarios in chemistry. By solely relying on query and training data proximity to choose training points, only a fraction of data is necessary to converge to competitive performance. After introducing SML for the harmonic oscillator and the Rosenbrock function, we describe applications to scarce data scenarios in chemistry which include quantum mechanics based molecular design and organic synthesis planning. Finally, we derive a relationship between the intrinsic dimensionality and volume of feature space, governing the overall model accuracy. © 2022, CC BY.

关键词： Decision making

Capsule Vision 2024 Challenge: Multi-Class Abnormality Classification for Video Capsule Endoscopy

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Handa, Palak Mahbod, Amirreza Schwarzhans, Florian Woitek, Ramona Goel, Nidhi Dhir, Manas Chhabra, Deepti Jha, Shreshtha Sharma, Pallavi Thakur, Vijay Chawla, Simarpreet Singh Gunjan, Deepak Kakarla, Jagadeesh Raman, Balasubramanian Research Center for Medical Image Analysis and Artificial Intelligence Department of Medicine Danube Private University Krems Austria Department of Electronics and Communication Engineering Indira Gandhi Delhi Technical University for Women Delhi India Department of Artificial Intelligence and Data Sciences Indira Gandhi Delhi Technical University for Women Delhi India Department of Artificial Intelligence and Machine Learning University School of Automation and Robotics Guru Gobind Singh Indraprastha University Delhi India Department of Electronics and Communication Engineering Delhi Technological University Delhi India Columbia University New YorkNY United States Department of Gastroenterology and HNU All India Institute of Medical Sciences Delhi India Chennai Kancheepuram India Department of Computer Science and Engineering Indian Institute of Technology Roorkee India

We present the Capsule Vision 2024 Challenge: Multi-Class Abnormality Classification for Video Capsule Endoscopy. It was virtually organized by the Research Center for Medical Image Analysis and Artificial Intelligence (MIAAI), Department of Medicine, Danube Private University, Krems, Austria in collaboration with the 9th International Conference on Computer Vision & Image Processing (CVIP 2024) being organized by the Indian Institute of Information Technology, Design and Manufacturing (IIITDM) Kancheepuram, Chennai, India. This document provides an overview of the challenge, including the registration process, rules, submission format, description of the datasets used, qualified team rankings, all team descriptions, and the benchmarking results reported by the organizers. © 2024, CC BY.

关键词： Endoscopy

Automated Diagnosis of Cardiovascular Diseases from Cardiac Magnetic Resonance Imaging Using Deep learning Models: A Review

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Jafari, Mahboobeh Shoeibi, Afshin Khodatars, Marjane Ghassemi, Navid Moridian, Parisa Delfan, Niloufar Alizadehsani, Roohallah Khosravi, Abbas Ling, Sai Ho Zhang, Yu-Dong Wang, Shui-Hua Gorriz, Juan M. Rokny, Hamid Alinejad Acharya, U. Rajendra Internship in BioMedical Machine Learning Lab The Graduate School of Biomedical Engineering UNSW Sydney SydneyNSW2052 Australia Data Science and Computational Intelligence Institute University of Granada Spain Department of Medical Engineering Mashhad Branch Islamic Azad University Mashhad Iran Faculty of Computer Engineering Dept. of Artificial Intelligence Engineering K. N. Toosi University of Technology Tehran Iran Deakin University VIC3217 Australia Australia School of Computing and Mathematical Sciences University of Leicester Leicester United Kingdom Department of Psychiatry University of Cambridge United Kingdom BioMedical Machine Learning Lab The Graduate School of Biomedical Engineering UNSW Sydney SydneyNSW2052 Australia UNSW Data Science Hub The University of New South Wales SydneyNSW2052 Australia Research Centre Macquarie University Sydney2109 Australia Ngee Ann Polytechnic Singapore599489 Singapore Dept. of Biomedical Informatics and Medical Engineering Asia University Taichung Taiwan Dept. of Biomedical Engineering School of Science and Technology Singapore University of Social Sciences Singapore

In recent years, cardiovascular diseases (CVDs) have become one of the leading causes of mortality globally. CVDs appear with minor symptoms and progressively get worse. The majority of people experience symptoms such as exhaustion, shortness of breath, ankle swelling, fluid retention, and other symptoms when starting CVD. Coronary artery disease (CAD), arrhythmia, cardiomyopathy, congenital heart defect (CHD), mitral regurgitation, and angina are the most common CVDs. Clinical methods such as blood tests, electrocardiography (ECG) signals, and medical imaging are the most effective methods used for the detection of CVDs. Among the diagnostic methods, cardiac magnetic resonance imaging (CMR) is increasingly used to diagnose, monitor the disease, plan treatment and predict CVDs. Coupled with all the advantages of CMR data, CVDs diagnosis is challenging for physicians due to many slices of data, low contrast, etc. To address these issues, deep learning (DL) techniques have been employed to the diagnosis of CVDs using CMR data, and much research is currently being conducted in this field. This review provides an overview of the studies performed in CVDs detection using CMR images and DL techniques. The introduction section examined CVDs types, diagnostic methods, and the most important medical imaging techniques. In the following, investigations to detect CVDs using CMR images and the most significant DL methods are presented. Another section discussed the challenges in diagnosing CVDs from CMR data. Next, the discussion section discusses the results of this review, and future work in CVDs diagnosis from CMR images and DL techniques are outlined. The most important findings of this study are presented in the conclusion section. © 2022, CC BY-NC-ND.

关键词： Electrocardiography

The Intrinsic Flattening of Extragalactic Stellar Disks

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Favaro, Jeremy Courteau, Stephane Comerón, Sébastien Stone, Connor Department of Physics Engineering Physics & Astronomy Queen’s University KingstonONK7L 3N6 Canada Departamento de Astrofísica Universidad de La Laguna Tenerife La Laguna38200 Spain Instituto de Astrofísica de Canarias Tenerife La Laguna38205 Spain Department of Physics Université de Montréal MontréalQC Canada Mila - Québec Artificial Intelligence Institute MontréalQC Canada Ciela - Montréal Institute for Astrophysical Data Analysis and Machine Learning MontréalQC Canada

Highly inclined (edge-on) disk galaxies offer the unique perspective to constrain their intrinsic flattening, c/a, where c and a are respectively the vertical and long radial axes of the disk measured at suitable stellar densities. The ratio c/a is a necessary quantity in the assessment of galaxy inclinations, three-dimensional structural reconstructions, total masses, as well as a constraint to galaxy formation models. 3.6 µm maps of 133 edge-on spiral galaxies from the Spitzer Survey of Stellar Structure in Galaxies (S4G) and its early-type galaxy extension are used to revisit the assessment of c/a free from dust extinction and away from the influence of a stellar bulge. We present a simple definition of c/a and explore trends with other galactic physical parameters: total stellar mass, concentration index, total H i mass, mass of the central mass concentration, circular velocity, model-dependent scales, as well as Hubble type. Other than a dependence on early/late Hubble types, and a related trend with light concentration, no other parameters were found to correlate with the intrinsic flattening of spiral galaxies. The latter is mostly constant with 〈c/a〉 = 0.124 ±0.001 (stat) ±0.033 (intrinsic/systematic) and greater for earlier types. © 2024, CC BY.

关键词： Galaxies

Impact of noise on inverse design: The case of NMR spectra matching

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Lemm, Dominik von Rudorff, Guido Falk von Lilienfeld, O. Anatole University of Vienna Faculty of Physics Kolingasse 14-16 ViennaAT-1090 Austria University of Vienna Vienna Doctoral School in Physics Boltzmanngasse 5 ViennaAT-1090 Austria University Kassel Department of Chemistry Heinrich-Plett-Str.40 Kassel34132 Germany Heinrich-Plett-Straße 40 Kassel34132 Germany Departments of Chemistry Materials Science and Engineering and Physics University of Toronto St. George Campus TorontoON Canada Vector Institute for Artificial Intelligence TorontoONM5S 1M1 Canada Machine Learning Group Technische Universität Berlin Institute for the Foundations of Learning and Data Berlin10587 Germany

Despite its fundamental importance and widespread use for assessing reaction success in organic chemistry, deducing chemical structures from nuclear magnetic resonance (NMR) measurements has remained largely manual and time consuming. To keep up with the accelerated pace of automated synthesis in self driving laboratory settings, robust computational algorithms are needed to rapidly perform structure elucidations. We analyse the effectiveness of solving the NMR spectra matching task encountered in this inverse structure elucidation problem by systematically constraining the chemical search space, and correspondingly reducing the ambiguity of the matching task. Numerical evidence collected for the twenty most common stoichiometries in the QM9-NMR data base indicate systematic trends of more permissible machine learning prediction errors in constrained search spaces. Results suggest that compounds with multiple heteroatoms are harder to characterize than others. Extending QM9 by ∼10 times more constitutional isomers with 3D structures generated by Surge, ETKDG and CREST, we used ML models of chemical shifts trained on the QM9-NMR data to test the spectra matching algorithms. Combining both 13C and 1H shifts in the matching process suggests twice as permissible machine learning prediction errors than for matching based on 13C shifts alone. Performance curves demonstrate that reducing ambiguity and search space can decrease machine learning training data needs by orders of magnitude. © 2023, CC BY.

关键词： Inverse problems

Computationally Efficient Approximations for Matrix-based Rényi's Entropy

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Gong, Tieliang Dong, Yuxin Yu, Shujian Dong, Bo The School of Computer Science and Technology Xi'an Jiaotong University Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an710049 China The Machine Learning Group UiT - The Arctic University of Norway Department of Computer Science Vrije University Amsterdam Amsterdam Netherlands

The recently developed matrix-based Rényi's αorder entropy enables measurement of information in data simply using the eigenspectrum of symmetric positive semi-definite (PSD) matrices in reproducing kernel Hilbert space, without estimation of the underlying data distribution. This intriguing property makes this new information measurement widely adopted in multiple statistical inference and learning tasks. However, the computation of such quantity involves the trace operator on a PSD matrix G to power α (i.e., tr(Gα)), with a normal complexity of nearly O(n3), which severely hampers its practical usage when the number of samples (i.e., n) is large. In this work, we present computationally efficient approximations to this new entropy functional that can reduce its complexity to even significantly less than O(n2). To this end, we leverage the recent progress on Randomized Numerical Linear Algebra, developing Taylor, Chebyshev and Lanczos approximations to tr(Gα) for arbitrary values of α by converting it into a matrix-vector multiplication problem. We also establish the connection between the matrix-based Rényi's entropy and PSD matrix approximation, which enables exploiting both clustering and block low-rank structure of G to further reduce the computational cost. We theoretically provide approximation accuracy guarantees and illustrate the properties for different approximations. Large-scale experimental evaluations on both synthetic and real-world data corroborate our theoretical findings, showing promising speedup with negligible loss in accuracy. Copyright © 2021, The Authors. All rights reserved.

关键词： Matrix algebra

Touchstone benchmark: are we on the right way for evaluating AI algorithms for medical segmentation? 24

学校读者我要写书评

暂无评论

Touchstone benchmark: are we on the right way for evaluating...

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Pedro R. A. S. Bassi Wenxuan Li Yucheng Tang Fabian Isensee Zifu Wang Jieneng Chen Yu-Cheng Chou Saikat Roy Yannick Kirchhoff Maximilian Rokuss Ziyan Huang Jin Ye Junjun He Tassilo Wald Constantin Ulrich Michael Baumgartner Klaus H. Maier-Hein Paul Jaeger Yiwen Ye Yutong Xie Jianpeng Zhang Ziyang Chen Yong Xia Zhaohu Xing Lei Zhu Yousef Sadegheih Afshin Bozorgpour Pratibha Kumari Reza Azad Dorit Merhof Pengcheng Shi Ting Ma Yuxin Du Fan Bai Tiejun Huang Bo Zhao Haonan Wang Xiaomeng Li Hanxue Gu Haoyu Dong Jichen Yang Maciej A. Mazurowski Saumya Gupta Linshan Wu Jiaxin Zhuang Hao Chen Holger Roth Daguang Xu Matthew B. Blaschko Sergio Decherchi Andrea Cavalli Alan L. Yuille Zongwei Zhou Department of Computer Science Johns Hopkins University and Department of Pharmacy and Biotechnology University of Bologna and Center for Biomolecular Nanotechnologies Istituto Italiano di Tecnologia Department of Computer Science Johns Hopkins University NVIDIA Division of Medical Image Computing German Cancer Research Center (DKFZ) and Helmholtz Imaging German Cancer Research Center (DKFZ) ESAT-PSI KU Leuven Division of Medical Image Computing German Cancer Research Center (DKFZ) and Faculty of Mathematics and Computer Science Heidelberg University Division of Medical Image Computing German Cancer Research Center (DKFZ) and Faculty of Mathematics and Computer Science Heidelberg University and HIDSS4Health - Helmholtz Information and Data Science School for Health Shanghai Jiao Tong University Shanghai Artificial Intelligence Laboratory Division of Medical Image Computing German Cancer Research Center (DKFZ) Division of Medical Image Computing German Cancer Research Center (DKFZ) and Pattern Analysis and Learning Group Department of Radiation Oncology Heidelberg University Hospital Helmholtz Imaging German Cancer Research Center (DKFZ) and Interactive Machine Learning Group (IML) DKFZ School of Computer Science and Engineering Northwestern Polytechnical University Australian Institute for Machine Learning The University of Adelaide College of Computer Science and Technology Zhejiang University Hong Kong University of Science and Technology (Guangzhou) Hong Kong University of Science and Technology (Guangzhou) and Hong Kong University of Science and Technology Faculty of Informatics and Data Science University of Regensburg Faculty of Electrical Engineering and Information Technology RWTH Aachen University Faculty of Informatics and Data Science University of Regensburg and Fraunhofer Institute for Digital Medicine MEVIS Electronic & Information Engineering School Harbin Institute of Technology (Shenzhen) Shanghai Jiao Tong University and Beijing Academy of Artificial Intelligence (BAAI) S

ISBN: (纸本)9798331314385

How can we test AI performance? This question seems trivial, but it isn't. Standard benchmarks often have problems such as in-distribution and small-size test sets, oversimplified metrics, unfair comparisons, and short-term outcome pressure. As a consequence, good performance on standard benchmarks does not guarantee success in real-world scenarios. To address these problems, we present Touchstone, a large-scale collaborative segmentation benchmark of 9 types of abdominal organs. This benchmark is based on 5,195 training CT scans from 76 hospitals around the world and 5,903 testing CT scans from 11 additional hospitals. This diverse test set enhances the statistical significance of benchmark results and rigorously evaluates AI algorithms across out-of-distribution scenarios. We invited 14 inventors of 19 AI algorithms to train their algorithms, while our team, as a third party, independently evaluated these algorithms. In addition, we also evaluated pre-existing AI frameworks—which, differing from algorithms, are more flexible and can support different algorithms—including MONAI from NVIDIA, nnU-Net from DKFZ, and numerous other open-source frameworks. We are committed to expanding this benchmark to encourage more innovation of AI algorithms for the medical domain.

关键词：

A scalable pipeline to create synthetic datasets from functional-structural plant models for deep learning (vol 6, diad022, 2024)

学校读者我要写书评

暂无评论

IN SILICO PLANTS 2024年第1期6卷

作者： Baker, Dirk Norbert Bauer, Felix Maximilian Giraud, Mona Schnepf, Andrea Goebbert, Jens Henrik Scharr, Hanno Hvannberg, Ebba Thora Riedel, Morris School of Engineering and Natural Sciences Sæmundargata 2 102 Reykjavík Iceland Jülich Supercomputing Centre Forschungszentrum Jülich GmbH Wilhelm-Johnen-Straße 52428 Jülich Germany Institute of Bio- and Geosciences 3 (Agrosphere) Forschungszentrum Jülich GmbH Wilhelm-Johnen-Straße 52428 Jülich Germany Institute for Advanced Simulation 8 (Data Analytics and Machine Learning) Forschungszentrum Jülich GmbH Wilhelm-Johnen-Straße 52428 Jülich Germany

In plant science, it is an established method to obtain structural parameters of crops using image analysis. In recent years, deep learning techniques have improved the underlying processes significantly. However, since data acquisition is time and resource consuming, reliable training data are currently limited. To overcome this bottleneck, synthetic data are a promising option for not only enabling a higher order of correctness by offering more training data but also for validation of results. However, the creation of synthetic data is complex and requires extensive knowledge in Computer Graphics, Visualization and High-Performance Computing. We address this by introducingSynavis, a framework that allows users to train networks on real-time generated data. We created a pipeline that integrates realistic plant structures, simulated by the functional–structural plant model framework CPlantBox, into the game engine Unreal Engine. For this purpose, we needed to extend CPlantBox by introducing a new leaf geometrization that results in realistic leafs. All parameterized geometries of the plant are directly provided by the plant model. In the Unreal Engine, it is possible to alter the environment. WebRTC enables the streaming of the final image composition, which, in turn, can then be directly used to train deep neural networks to increase parameter robustness, for further plant trait detection and validation of original parameters. We enable user-friendly ready-to-use pipelines, providing virtual plant experiment and field visualizations, a python-binding library to access synthetic data and a ready-to-run example to train models.

关键词： Computer vision deep learning FSPM HPC synthetic data visualization