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

arXiv 2024年

作者： Chatterjee, Soumick Mattern, Hendrik Dörner, Marc Sciarra, Alessandro Dubost, Florian Schnurre, Hannes Khatun, Rupali Yu, Chun-Chih Hsieh, Tsung-Lin Tsai, Yi-Shan Fang, Yi-Zeng Yang, Yung-Ching Huang, Juinn-Dar Xu, Marshall Liu, Siyu Ribeiro, Fernanda L. Bollmann, Saskia Chintalapati, Karthikesh Varma Radhakrishna, Chethan Mysuru Ram Kumar, Sri Chandana Hudukula Sutrave, Raviteja Qayyum, Abdul Mazher, Moona Razzak, Imran Rodero, Cristobal Niederer, Steven Lin, Fengming Xia, Yan Wang, Jiacheng Qiu, Riyu Wang, Liansheng Panah, Arya Yazdan Jurdi, Rosana El Fu, Guanghui Arslan, Janan Vaillant, Ghislain Valabregue, Romain Dormont, Didier Stankoff, Bruno Colliot, Olivier Vargas, Luisa Chacón, Isai Daniel Pitsiorlas, Ioannis Arbeláez, Pablo Zuluaga, Maria A. Schreiber, Stefanie Speck, Oliver Nürnberger, Andreas Faculty of Computer Science Otto von Guericke University Magdeburg Magdeburg Germany Data and Knowledge Engineering Group Otto von Guericke University Magdeburg Magdeburg Germany Genomics Research Centre Human Technopole Milan Italy Biomedical Magnetic Resonance Otto von Guericke University Magdeburg Magdeburg Germany Department of Neurology Medical Faculty University Hospital of Magdeburg Magdeburg Germany German Centre for Neurodegenerative Diseases Magdeburg Germany Centre for Behavioural Brain Sciences Magdeburg Germany University Hospital Zurich University of Zurich Zurich Switzerland Google Inc. United States Translational Radiobiology Department of Radiation Oncology Universitätsklinikum Erlangen Friedrich-Alexnder-Universität Erlangen-Nürnberg Erlangen Germany National Yang Ming Chiao Tung University Hsinchu Taiwan School of Electrical Engineering and Computer Science University of Queensland Brisbane Australia Australian eHealth Research Centre Chile National Heart and Lung Institute Faculty of Medicine Imperial College London London United Kingdom Centre for Medical Image Computing Department of Computer Science University College London London United Kingdom School of Computer Science and Engineering University of New South Wales Sydney Australia Mohamed bin Zayed University of Artificial Intelligence Abu Dhabi United Arab Emirates The Alan Turing Institute London United Kingdom School of Computing University of Leeds Leeds United Kingdom Department of Computer Science School of Informatics Xiamen University Xiamen China Manteia Technologies Co. Ltd Xiamen China Leicester International Institute Dalian University of Technology Dalian China Sorbonne Université Institut du Cerveau - Paris Brain Institute ICM CNRS Inria Inserm AP-HP Hôpital de la Pitié Salpêtrière ParisF-75013 France Centre of Formation and Research in Artificial Intelligence Universidad de Los Andes Colombia Data Science Department EURECOM Sophia Antipolis Franc

The human brain receives nutrients and oxygen through an intricate network of blood vessels. Pathology affecting small vessels, at the mesoscopic scale, represents a critical vulnerability within the cerebral blood supply and can lead to severe conditions, such as Cerebral Small Vessel Diseases. The advent of 7 Tesla MRI systems has enabled the acquisition of higher spatial resolution images, making it possible to visualise such vessels in the brain. However, the lack of publicly available annotated datasets has impeded the development of robust, machine learning-driven segmentation algorithms. To address the complexities of mesoscopic vessel segmentation and to highlight the need for advanced techniques to manage the high noise levels and poor vessel-to-background contrast inherent in"ultra-high-resolution" data, the SMILE-UHURA challenge was organised. This challenge, held in conjunction with the ISBI 2023, in Cartagena de Indias, Colombia, aimed to provide a platform for researchers working on related topics. The SMILE-UHURA challenge addresses the gap in publicly available annotated datasets by providing an annotated dataset of Time-of-Flight angiography acquired with 7T MRI. This dataset was created through a combination of automated pre-segmentation and extensive manual refinement. In this manuscript, sixteen submitted methods and two baseline methods are compared both quantitatively and qualitatively on two different datasets: held-out test MRAs from the same dataset as the training data (with labels kept secret) and a separate 7T ToF MRA dataset where both input volumes and labels are kept secret. The results demonstrate that most of the submitted deep learning methods, trained on the provided training dataset, achieved reliable segmentation performance. Dice scores reached up to 0.838 ± 0.066 and 0.716 ± 0.125 on the respective datasets, with an average performance of up to 0.804 ± 0.15. Copyright © 2024, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Senzi: A sentiment analysis lexicon for the latinised Arabic (Arabizi) 12

Senzi: A sentiment analysis lexicon for the latinised Arabic...

引用

12th International Conference on Recent Advances in Natural Language Processing, RANLP 2019

作者： Tobaili, Taha Fernandez, Miriam Alani, Harith Sharafeddine, Sanaa Hajj, Hazem Glavaš, Goran Knowledge Media Institute Open University United Kingdom Department of Computer Science and Mathematics Lebanese American University Lebanon Department of Electrical and Computer Engineering American University of Beirut Lebanon Data and Web Science Group Universität Mannheim Germany

ISBN: (纸本)9789544520557

Arabizi is an informal written form of dialectal Arabic transcribed in Latin alphanumeric characters. It has a proven popularity on chat platforms and social media, yet it suffers from a severe lack of natural language processing (NLP) resources. As such, texts written in Arabizi are often disregarded in sentiment analysis tasks for Arabic. In this paper we describe the creation of a sentiment lexicon for Arabizi that was enriched with word embeddings. The result is a new Arabizi lexicon consisting of 11.3K positive and 13.3K negative words. We evaluated this lexicon by classifying the sentiment of Arabizi tweets achieving an F1-score of 0.72. We provide a detailed error analysis to present the challenges that impact the sentiment analysis of Arabizi. © 2019 Association for Computational Linguistics (ACL). All rights reserved.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

VAE-GAN Based Zero-shot Outlier Detection 2020

VAE-GAN Based Zero-shot Outlier Detection

引用

Proceedings of the 2020 4th International Symposium on Computer science and Intelligent Control

作者： Bekkouch Imad Ibrahim Dragoş Constantin Nicolae Adil Khan Syed Imran Ali Asad Khattak Machine Learning and Knowledge Representation Lab Institute of Data Science & AI Innopolis Tatarstan Russia Institutul de cercetări pentru Inteligenta Artificiala 'Mihai Draganescu' România Department of Computer Engineering Kyung Hee University Yongin-si South Korea College of Technological Innovations Zayed University Abu Dhabi United Arab Emirates

ISBN: (纸本)9781450388894

Outlier detection is one of the main fields in machine learning and it has been growing rapidly due to its wide range of applications. In the last few years, deep learning-based methods have outperformed machine learning and handcrafted outlier detection techniques, and our method is no different. We present a new twist to generative models which leverages variational autoencoders as a source for uniform distributions which can be used to separate the inliers from the outliers. Both the generative and adversarial parts of the model are used to obtain three main losses (Reconstruction loss, KL-divergence, Discriminative loss) which in return are wrapped with a one-class SVM which is used to make the predictions. We evaluated our method against several datasets both for images and tabular data and it has shown great results for the zero-shot outlier detection problem and was able to easily generalize it for supervised outlier detection tasks on which the performance has increased. For comparison, we evaluated our method against several of the common outlier detection techniques such as DBSCAN-based outlier detection, GMM, K-means and one class SVM directly, and we have outperformed all of them on all datasets.

关键词： Deep Learning Generative Models Machine Learning Outlier Detection

来源：评论

学校读者我要写书评

暂无评论

On multi-objective minimum spanning tree under the framework of uncertainty theory

引用

AIP Conference Proceedings 2023年第1期2851卷

作者： Swapna Halder Saibal Majumder Arindam Biswas Bijoy Kumar Mandal Sheng-Lung Peng Department of Computer Science and Engineering St. Thomas College of Engineering & Technology Kolkata West Bengal India Centre for IOT and AI Integration with Education -Industry-Agriculture Kazi Nazrul University Asansol West Bengal India Department of Computer Science and Engineering (Data Science) Dr. B. C. Roy Engineering College Durgapur West Bengal India School of Mines and Metallurgy Kazi Nazrul University Asansol West Bengal India Department of Computer Science and Engineering NSHM Knowledge Campus Durgapur West Bengal India Department of Creative Technologies and Product Design National Taipei University of Business Taoyuan Taiwan

Aminimum spanning tree with multiple objectives is one type of NP hard problem, and it has a wide application area in ourdaily life. Modelling real world problems, requires many associated parameters which are not well-defined and are indeterminate in nature. Thus, it is rational to consider these indeterminate parameters while modelling real life problems. This article, investigates onthe study of minimum spanning tree with multiple objectives which are uncertain in nature. The proposed multiple objectives minimum spanning tree has two uncertain parameters associated with it, they are time and cost. Both of these parameters are indeterminate in nature and characterizedas uncertain variables. The expected value model (EVM) of multiple objectives minimum spanning tree is formulatedin this study and convex combination method is used to solve this problem. Finally to achieve the nondominated solutions of this problem, we have solved the EVM by varying the related weights of its objectives.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Detecting anomalous events over time using RDF triple extraction and a dynamic implementation of oddball 30

Detecting anomalous events over time using RDF triple extrac...

引用

30th Benelux Conference on Artificial Intelligence, BNAIC 2018

作者： Heinrichs, Benedikt Scholtes, Jan C. Department of Data Science and Knowledge Engineering Maastricht University Netherlands

This paper shows a new approach for anomaly detection by combining the extraction of so-called triples consisting of a subject, predicate, and object using dynamic anomaly-detection. First, the methods used to extract triples and general principles of anomaly detection and event detection are discussed. Next, a novel approach is presented where extracted triples are converted into time-lapsed networks of triples on which anomaly and event detection methods from social network analysis are applied. Subsequently, the results of the experiments are presented together with the evaluation method used. Considering the results of the tested methods, the dynamic variation of the OddBall algorithm, which measures network changes over time, displays the connection between the predictions of our model and real-life events accurately. © 2018 University of Groningen. All rights reserved.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Molecular Dynamics Simulation of Thermal Behavior of Ammonia Refrigerant in the Presence of Copper Nanoparticles

International Journal of Thermofluids

引用

International Journal of Thermofluids 2025年

作者： Hawzhen Fateh M. Ameen Ali B.M. Ali Ahmed Shawqi Sadeq Narinderjit Singh Sawaran Singh Soheil Salahshour Sh. Baghaei Fuel and Energy Techniques Engineering College of Oil and Gas Techniques Engineering Kirkuk Northern Technical University Iraq Department of Petroleum Engineering Knowledge University Erbil Iraq Air Conditioning Engineering Department College of Engineering University of Warith Al-Anbiyaa Karbala Iraq Chemical Engineering Department University of Basrah Basrah Iraq Faculty of Data Science and Information Technology INTI International University Persiaran Perdana BBN Putra Nilai Nilai 71800 Malaysia Faculty of Engineering and Natural Sciences Istanbul Okan University Istanbul Turkey Faculty of Engineering and Natural Sciences Bahcesehir University Istanbul Turkey Research Center of Applied Mathematics Khazar University Baku Azerbaijan Department of Engineering Islamic Azad University Khomeinishahr Iran

Nanofluids, which are composed of a base fluid and nanoparticles, have the potential to be used in sophisticated heat transfer applications. However, they are confronted with obstacles, such as particle aggregation and inconsistent performance. Molecular dynamics simulations offer a reliable alternative for the analysis of nanofluid behavior under controlled conditions, despite the limitations of experimental methodologies at the nanoscale. The thermal and atomic behavior of ammonia-based nanofluids with copper nanoparticles in aluminum nanochannels was investigated in this study using molecular dynamics simulations. We assessed critical parameters, such as maximal velocity, temperature, heat flux, and nanoparticle aggregation time, by altering the initial temperature (300–350 K) and pressure (1–5 bar). The thermophysical properties of nanofluids were significantly influenced by the initial temperature and pressure. By refining these conditions, thermal systems can improve their energy efficiency and sustainability. The kinetic and potential energies converged to 80.69 eV and -8399.15 eV after 5 ns, thereby verifying the stability of the structures. The results show that the maximum velocity increased from 0.00086 to 0.00099 Å/ps and the maximum temperature from 240 to 258 K as the initial temperature was increased. Additionally, the heat flux decreased from 1411 to 1397 W/m² and the aggregation time from 3.96 to 3.93 ns. In contrast, the maximum velocity reduced to 0.00078 Å/ps and the maximum temperature to 234 K as the initial pressure increased. In addition, the heat flux increased to 1436 W/m², and the aggregation time extended to 4.07 ns. These findings offered a perspective on the optimization of nanofluids for energy-efficient thermal control by customizing operating conditions, which had implications for sustainable engineering applications.

关键词： Initial Temperature Initial Pressure Heat Flux Nanofluids Thermal properties Aggregation Time Maximum Velocity

来源：评论

学校读者我要写书评

暂无评论

Higgs Boson Discovery using Machine Learning Methods with Pyspark

引用

Procedia Computer science 2020年 170卷 1141-1146页

作者： Mourad Azhari Abdallah Abarda Badia Ettaki Jamal Zerouaoui Mohamed Dakkon Laboratory of Engineering Sciences and Modeling Faculty of Sciences- Ibn Tofail University Campus Universitaire BP 133 Kenitra Morocco Laboratoire de Modélisation Mathématiques et de Calculs Economiques FSJES Université Hassan 1er Settat Morocco Laboratory of Research in Computer Science Data Sciences and Knowledge Engineering Department of Data Content and knowledge Engineering School of Information Sciences Rabat Morocco Département de Statistique et Informatique de Gestion Université Abdelmalek Essaadi Tetouan Morocco

Higgs Boson is an elementary particle that gives the mass to everything in the natural world. The discovery of the Higgs Boson is a major challenge for particle physics. This paper proposes to solve the Higgs Boson Classification Problem with four Machine Learning (ML) Methods, using the Pyspark environment: Logistic Regression (LR), Decision Tree (DT), Random Forest (RF) and Gradient Boosted Tree (GBT). We compare the accuracy and AUC metrics of those ML Methods. We use a large dataset as Higgs Boson, collected from public site UCI and Higgs dataset downloaded from Kaggle site, in the experimentation stage.

关键词： Boson Higgs Spark Pyspark Machine Learning (ML) Logistic Regression (LR) Decision Tree (DT) Random Forest (RF) Gradient Boosted Tree (GBT) AUC Accuracy

来源：评论

学校读者我要写书评

暂无评论

Social emotion mining techniques for facebook posts reaction prediction 10

Social emotion mining techniques for facebook posts reaction...

引用

10th International Conference on Agents and Artificial Intelligence, ICAART 2018

作者： Krebs, Florian Lubascher, Bruno Moers, Tobias Schaap, Pieter Spanakis, Gerasimos Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands

ISBN: (纸本)9789897582752

As of February 2016 Facebook allows users to express their experienced emotions about a post by using five so-called ‘reactions’. This research paper proposes and evaluates alternative methods for predicting these reactions to user posts on public pages of firms/companies (like supermarket chains). For this purpose, we collected posts (and their reactions) from Facebook pages of large supermarket chains and constructed a dataset which is available for other researches. In order to predict the distribution of reactions of a new post, neural network architectures (convolutional and recurrent neural networks) were tested using pretrained word embeddings. Results of the neural networks were improved by introducing a bootstrapping approach for sentiment and emotion mining on the comments for each post. The final model (a combination of neural network and a baseline emotion miner) is able to predict the reaction distribution on Facebook posts with a mean squared error (or misclassification rate) of 0.135. Copyright © 2018 by SCITEPRESS – science and Technology Publications, Lda. All rights reserved.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

Machine Memory Intelligence: Inspired by Human Memory Mechanisms

引用

engineering 2025年

作者： Qinghua Zheng Huan Liu Xiaoqing Zhang Caixia Yan Xiangyong Cao Tieliang Gong Yong-Jin Liu Bin Shi Zhen Peng Xiaocen Fan Ying Cai Jun Liu School of Computer Science and Technology Xi’an Jiaotong University Xi’an 710049 China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Xi’an 710049 China Translational Research Institute of Brain and Brain-Like Intelligence Shanghai Fourth People’s Hospital Shanghai 200434 China School of Medicine Tongji University Shanghai 200092 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Department of Computer Science Iowa State University Ames IA 50011 USA

Large models, exemplified by ChatGPT, have reached the pinnacle of contemporary artificial intelligence (AI). However, they are plagued by three inherent drawbacks: excessive training data and computing power consumption, susceptibility to catastrophic forgetting, and a deficiency in logical reasoning capabilities within black-box models. To address these challenges, we draw insights from human memory mechanisms to introduce “machine memory,” which we define as a storage structure formed by encoding external information into a machine-representable and computable format. Centered on machine memory, we propose the brand-new machine memory intelligence (M 2 I) framework, which encompasses representation, learning, and reasoning modules and loops. We explore the key issues and recent advances in the four core aspects of M 2 I, including neural mechanisms, associative representation, continual learning, and collaborative reasoning within machine memory. M 2 I aims to liberate machine intelligence from the confines of data-centric neural networks and fundamentally break through the limitations of existing large models, driving a qualitative leap from weak to strong AI.

关键词： Machine memory intelligence Neural mechanism Associative representation Continual learning Collaborative reasoning

来源：评论

学校读者我要写书评

暂无评论

A Continuous Information Gain Measure to Find the Most Discriminatory Problems for AI Benchmarking

A Continuous Information Gain Measure to Find the Most Discr...

引用

Congress on Evolutionary Computation

作者： Matthew Stephenson Damien Anderson Ahmed Khalifa John Levine Jochen Renz Julian Togelius Christoph Salge Department of Data Science and Knowledge Engineering Maastricht University Maastricht the Netherlands Computer and Information Sciences Department University of Strathclyde Glasgow UK Game Innovation Lab Tandon School of Engineering New York University New York USA Research School of Computer Science Australian National University Canberra Australia

ISBN: (数字)9781728169293

ISBN: (纸本)9781728169309

This paper introduces an information-theoretic method for selecting a subset of problems which gives the most information about a group of problem-solving algorithms. This method was tested on the games in the General Video Game AI (GVGAI) framework, allowing us to identify a smaller set of games that still gives a large amount of information about the abilities of different game-playing agents. This approach can be used to make agent testing more efficient. We can achieve almost as good discriminatory accuracy when testing on only a handful of games as when testing on more than a hundred games, something which is often computationally infeasible. Furthermore, this method can be extended to study the dimensions of the effective variance in game design between these games, allowing us to identify which games differentiate between agents in the most complementary ways.

关键词： Games Correlation Artificial intelligence Testing Task analysis Noise measurement Technological innovation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：