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

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Jiao, Xianhe Lv, Chenlei Zhao, Junli Yi, Ran Wen, Yu-Hui Pan, Zhenkuan Wu, Zhongke Liu, Yong-Jin College of Computer Science and Technology Qingdao University China College of Computer Science and Software Engineering Shenzhen University China Department of Computer Science and Engineering Shanghai Jiao Tong University China School of Computer Science & Technology Beijing Jiaotong University China School of Artificial Intelligence Beijing Normal University China Department of Computer Science and Technology MOE-Key Laboratory of Pervasive Computing Tsinghua University China

ISBN: (纸本)157735897X

For large-scale point cloud processing, resampling takes the important role of controlling the point number and density while keeping the geometric consistency. However, current methods cannot balance such different requirements. Particularly with large-scale point clouds, classical methods often struggle with decreased efficiency and accuracy. To address such issues, we propose a weighted Poisson-disk (WPD) resampling method to improve the usability and efficiency for the processing. We first design an initial Poisson resampling with a voxel-based estimation strategy. It is able to estimate a more accurate radius of the Poisson-disk while maintaining high efficiency. Then, we design a weighted tangent smoothing step to further optimize the Voronoi diagram for each point. At the same time, sharp features are detected and kept in the optimized results with isotropic property. Finally, we achieve a resampling copy from the original point cloud with the specified point number, uniform density, and high-quality geometric consistency. Experiments show that our method significantly improves the performance of large-scale point cloud resampling for different applications, and provides a highly practical solution. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

CylE: Cylinder Embeddings for Multi-hop Reasoning over Knowledge Graphs 17

CylE: Cylinder Embeddings for Multi-hop Reasoning over Knowl...

引用

17th Conference of the European Chapter of the Association for Computational Linguistics, EACL 2023

作者： Nguyen, Chau Duc Minh French, Tim Liu, Wei Stewart, Michael ARC Centre for Transforming Maintenance through Data Science Department of Computer Science and Software Engineering The University of Western Australia

ISBN: (纸本)9781959429449

Recent geometric-based approaches have been shown to efficiently model complex logical queries (including the intersection operation) over Knowledge Graphs based on the natural representation of Venn diagram. Existing geometric-based models (using points, boxes embeddings), however, cannot handle the logical negation operation. Further, those using cones embeddings are limited to representing queries by two-dimensional shapes, which reduced their effectiveness in capturing entities query relations for correct answers. To overcome this challenge, we propose unbounded cylinder embeddings (namely CylE), which is a novel geometric-based model based on three-dimensional shapes. Our approach can handle a complete set of basic first-order logic operations (conjunctions, disjunctions and negations). CylE considers queries as Cartesian products of unbounded sector-cylinders and consider a set of nearest boxes corresponds to the set of answer entities. Precisely, the conjunctions can be represented via the intersections of unbounded sector-cylinders. Transforming queries to Disjunctive Normal Form can handle queries with disjunctions. The negations can be represented by considering the closure of complement for an arbitrary unbounded sector-cylinder. Empirical results show that the performance of multi-hop reasoning task using CylE significantly increases over state-of-the-art geometric-based query embedding models for queries without negation. For queries with negation operations, though the performance is on a par with the best performing geometric-based model, CylE significantly outperforms a recent distribution-based model. © 2023 Association for Computational Linguistics.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Search Method for Accelerating Convolutional Neural Architecture Search 23

A Hybrid Search Method for Accelerating Convolutional Neural...

引用

15th International Conference on Machine Learning and Computing, ICMLC 2023

作者： Xun, Zhou Songbai, Liu Ka-Chun, Wong Qiuzhen, Lin Kaychen, Tan The Department of Computer Science City University of Hong Kong Hong Kong College of Computer Science and Software Engineering Shenzhen University KA-CHun Wong China College of Computer Science and Software Engineering Shenzhen University China The Department of Computing The Hong Kong Polytechnic University Hong Kong

ISBN: (纸本)9781450398411

The performance evaluation of candidate architectures is a key step in evolution-based neural architecture search (ENAS). Generally, high-fidelity evaluation is desired for finding the optimal architecture but suffers from expensive computational cost while low-fidelity evaluation can reduce search cost but may influence the search performance. In this work, a hybrid search method, HybridNAS, is proposed by synergizing these two evaluation strategies to improve the search effectiveness of ENAS. This method consists of two stages: global exploration and local exploitation. The former applies low-fidelity evaluation to explore the promising architectures efficiently. As for the latter, it exploits the most promising ones identified by the former to generate the better-performancing architectures. Those two stages are iteratively repeated toward the optimal architecture. Extensive experiments on NAS-Bench-101 and NAS-Bench-201 reflect that HybridNAS can achieve comparable accuracy compared to existing popular NAS but at the expense of only 60%-80% computational cost. © 2023 ACM.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

A Security Model of Multihospital FHIR Database Authorization Based on Secret Sharing and Blockchain

引用

IEEE Internet of Things Journal 2024年第6期11卷 10325-10335页

作者： Yang, Ching-Nung Li, Peng Cheng, Hsiang-Han Kuo, Hsin-Chuan Lu, Ming-Chan Xiong, Lizhi National Dong Hwa University Department of Computer Science and Information Engineering Hualien97401 Taiwan North China Electric Power University Department of Mathematics and Physics Hebei Key Laboratory of Physics and Energy Technology Baoding071003 China Nanjing University of Information Science and Technology School of Computer and Software Nanjing210044 China

Secret sharing (SS) is a threshold technology that shares a secret value by generating and distributing n shares in the way that a set of any k shares can recover the secret. On the other hand, blockchain is a decentralized system establishing a secure data structure for storing data in the form of a hash chain. Combining SS and blockchain is definitely a promising paradigm in the data security field. Recently, the fast healthcare interoperability resources (FHIRs) standard is defined for medical data exchange across various medical institutions. In this article, we combine SS, ElGamal's encryption/decryption, and blockchain to propose a multihospital FHIR database authorization (MFDA). To achieve a secure MFDA, the group-based SS (GSS) and the notion using GSS on exponent (referred to as EGSS) are proposed. The secrets of GSS and EGSS have the discrete logarithm problem (DLP) relation, on which the secrets can be used as ElGamal's private key and public key, respectively. Also, their shares will have DLP relation. By uploading public shares of EGSS on blockchain and using private shares of GSS in a private network, we can recover ElGamal's public key from a deployed smart contract on blockchain and recover ElGamal's private key from a qualified set. Meantime, when recovering private key, the private shares of GSS can be authenticated by public shares on blockchain to check tampering and corrupted of private shares during the communication in a private network. Theorems, examples, and experiments demonstrate that the proposed MFDA has efficient and secure database authorization. © 2014 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

TOST: School Bus Monitoring and Management System for Schools and Parents

TOST: School Bus Monitoring and Management System for School...

引用

2023 IEEE International Conference on Computing, ICOCO 2023

作者： Thakur, Fahad Aqeel Hafiz, Muhammad Alani, Maath Saadoon, Muntadher Kian Chiew, Chiew Thiam University of Malaya Faculty of Computer Science & Information Technology Kuala Lumpur Malaysia Hillool Software Engineering Department Queensland Australia Universiti Malaya Faculty of Computer Science and Information Technology Department of Software Engineering Kuala Lumpur50603 Malaysia

ISBN: (纸本)9798350302684

School bus contributes positively to reducing the number of cars on the road, thereby reducing the environmental impact of cars. It also dramatically relieves working parents, who do not have to pick up and drop off their children separately in their private vehicles. However, the irregularity of the bus arrival times often leads to an extended waiting time for students at the bus stops, potentially compromising the students' safety. The communication barrier between schools, parents and bus drivers is also a significant challenge, mainly when a delay occurs during the transit of the students. This paper presents TOST (to-school-together), a school bus monitoring and management system for schools and parents. The school administrators, parents, and bus drivers are connected in one comprehensive school bus system. The proposed system provides realtime updates on the bus status, allowing peace of mind and easing the burden of parents, school administrators, and bus drivers. The design of TOST is based on feedback from the system stakeholders collected via a survey. We draw a complete understanding of the existing issues by analyzing the feedback. Finally, we have implemented the system using state-of-the-art technologies to address the identified issues and fulfil the system requirements. © 2023 IEEE.

关键词： Buses

来源：评论

学校读者我要写书评

暂无评论

Tropical Cyclone Intensity Prediction Using Deep Learning Techniques- A Survey 4

Tropical Cyclone Intensity Prediction Using Deep Learning Te...

引用

4th IEEE International Conference on Applied Electromagnetics, Signal Processing, and Communication, AESPC 2024

作者： Ilayaraja, V. Rajamohana, S.P. Jagadeesan, S. Aishwarya, V. Rakesh, M. School of Computer Science and Engineering Vellore Institute of Technology Tamilnadu Vellore632 014 India School of Engineering & Technology Pondicherry University Department of Computer Science Puducherry Karaikal India School of Computer Science Engineering and Information Systems Vellore Institute of Technology Department of Software and Systems Engineering Tamil Nadu Vellore632 014 India

ISBN: (纸本)9798331528171

Tropical cyclones, characterized by strong winds and heavy rainfall, threaten human life in coastal regions crucial to the economy, including fisheries, agriculture, tourism, and infrastructure. Their frequent occurrence impacts communities reliant on these industries for livelihoods. Accurate estimation of tropical cyclone intensity is vital for disaster preparedness, risk assessment, and timely evacuations. Recent advancements in machine learning and deep learning have been applied to predict cyclone intensity from satellite images, providing insights into cyclone dynamics and enhancing disaster response. This paper analyzes recent research on intensity estimation using various machine learning algorithms and discusses future prospects for improving accuracy and reliability. © 2024 IEEE.

关键词： Tropical cyclone

来源：评论

学校读者我要写书评

暂无评论

Exploring the Power of Deep Learning in Anomaly Detection: A Comprehensive Review and Analysis 12th

Exploring the Power of Deep Learning in Anomaly Detection: A...

引用

12th International Conference on Soft Computing for Problem Solving, SocProS 2023

作者： Kumar, Gaurav Kumar, Ankit Pandy, Saroj Kumar Singh, Kamred Udham Singh, Teekam Kumar, Lalan Choudhury, Tanupriya Department of Computer Engineering and Applications GLA University UP Mathura India School of Computing Graphic Era Hill University Dehradun India Department of Computer Science and Engineering Graphic Era Deemed to be University Dehradun India Department of Master of Computer Application GL Bajaj Institute of Technology and Management Greater Noida India Department of Computer Science and Engineering University of Petroleum and Energy Studies Dehradun India

ISBN: (纸本)9789819732913

This paper aims to provide a comprehensive overview of existing and state-of-the-art fraud and intrusion detection strategies, specifically focusing on incorporating neural networks. We begin by discussing the fundamental concept of data mining and its significance in detecting anomalies. By leveraging advanced machine learning and neural network techniques, we can effectively uncover subtle patterns and irregularities within complex datasets. We explore how the development of anomalies has enhanced our ability to identify and mitigate various threats, such as malware attacks and unlawful practices. Traditional detection strategies have proven effective, but as deep learning progresses, we uncover new opportunities and insights that can significantly enhance the accuracy and efficiency of anomaly detection systems. Throughout this study, we delve into the most cutting-edge approaches, ranging from broad neural networks to shallower architectures, and their applicability to fraud and intrusion detection. We analyze the strengths and limitations of these strategies, shedding light on their performance characteristics, scalability, and interpretability. By addressing these key issues, we aim to provide a comprehensive summary of the latest fraud and intrusion detection advancements driven by deep learning methodologies. This research contributes to the broader understanding of data mining's potential in uncovering anomalies and bolstering security measures across diverse domains. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

Mobile-Based Classification and Detection of Diabetic Retinopathy Using TinyML 2

Mobile-Based Classification and Detection of Diabetic Retino...

引用

2nd IEEE North Karnataka Subsection Flagship International Conference, NKCon 2023

作者： Kumar, Manish Mohan Kumar, H.P. Sultana, Husna Shweta, J.S. M S Ramaiah Institute of Technology Department of Master of Computer Applications Bangalore India Pes College of Engineering Dept of Master of Computer Applications Karnataka Mandya India Government First Grade College Department of Computer Science Karnataka Tumkur India

ISBN: (纸本)9798350314045

This paper presents a comprehensive approach to diabetic retinopathy (DR) classification and detection, encompassing the evaluation of ResNet, RegNet, and WideResNet models for DR severity assessment. Leveraging the Kaggle's APTOS 2019 dataset, we implement and analyze these models using PyTorch, highlighting their efficacy in categorizing DR severity levels. Additionally, we leverage Tiny Machine Learning (TinyML) techniques to develop a mobile-based solution, enabling real-time DR severity assessment on mobile devices. This mobile application showcases the potential of TinyML for early detection and intervention in DR cases, ultimately enhancing patient outcomes. By synergizing advanced deep learning models with TinyML, this study contributes to healthcare technology, enabling timely interventions and improved patient outcomes. © 2023 IEEE.

关键词： Equalizers

来源：评论

学校读者我要写书评

暂无评论

Gliding over the Pareto Front with Uniform Designs 38

Gliding over the Pareto Front with Uniform Designs

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Zhang, Xiaoyuan Li, Genghui Lin, Xi Zhang, Yichi Chen, Yifan Zhang, Qingfu Department of Computer Science City University of Hong Kong Hong Kong College of Computer Science and Software Engineering Shenzhen University China Department of Statistics Indiana University Bloomingtom United States Department of Mathematics and Computer Science Hong Kong Baptist University Hong Kong

Multiobjective optimization (MOO) plays a critical role in various real-world domains. A major challenge therein is generating K uniform Pareto-optimal solutions to approximate the entire Pareto front. To address this issue, this paper firstly introduces fill distance to evaluate the K design points, which provides a quantitative metric for the representativeness of the design. However, directly specifying the optimal design that minimizes the fill distance is nearly intractable due to the involved nested min − max − min problem structure. To address this, we propose a surrogate "max-packing" design for the fill distance design, which is easier to optimize and leads to a rate-optimal design with a fill distance at most 4× the minimum value. Extensive experiments on synthetic and real-world benchmarks demonstrate that our proposed paradigm efficiently produces high-quality, representative solutions and outperforms baseline MOO methods. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Tidal-Tree-Mem: Toward Read-Intensive Key-Value Stores With Tidal Structure Based on LSM-Tree

Tidal-Tree-Mem: Toward Read-Intensive Key-Value Stores With ...

引用

作者： Ma, Chenlin Yang, Hao Wu, Shangyu Wang, Yi Mao, Rui Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China City University of Hong Kong Department of Computer Science Hong Kong Shenzhen University College of Computer Science and Software Engineering The Shenzhen Institute of Computing Sciences Shenzhen518060 China

The log-structured merge-tree (LSM-tree)-based key-value store has been widely adopted by many large-scale data storage applications for its excellent write performance. However, such write performance gains mainly come from scarifying read performance due to the leveled and log-structured intrinsic characteristics of the LSM-tree. Therefore, the critical challenge of the existing LSM-tree is how to improve the read efficiency by reducing read amplification. This article for the first time proposes Tidal-tree-Mem, a novel data structure where data flow inside the LSM-tree-like Tidal waves. First, a floating strategy is proposed to allow frequently accessed files at the bottom of the LSM-tree to move to higher positions, reducing read amplification. Second, a stretching strategy is proposed to vary the shape of the LSM-tree to adapt to workloads with different characteristics. To evaluate the performance of Tidal-tree-Mem, we conduct a series of experiments using standard benchmarks from YCSB. The experimental results show that Tidal-tree-Mem can effectively reduce read amplification and the overall latency by over 71.94% and 47.34%, respectively, compared with representative schemes. © 1982-2012 IEEE.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：