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

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Lin, Liqiang Wu, Wenpeng Fu, Chi-Wing Zhang, Hao Huang, Hui College of Computer Science and Software Engineering Shenzhen University China Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong School of Computing Science Simon Fraser University Canada

We introduce camera ray matching (CRAYM) into the joint optimization of camera poses and neural fields from multi-view images. The optimized field, referred to as a feature volume, can be "probed" by the camera rays for novel view synthesis (NVS) and 3D geometry reconstruction. One key reason for matching camera rays, instead of pixels as in prior works, is that the camera rays can be parameterized by the feature volume to carry both geometric and photometric information. Multi-view consistencies involving the camera rays and scene rendering can be naturally integrated into the joint optimization and network training, to impose physically meaningful constraints to improve the final quality of both the geometric reconstruction and photorealistic rendering. We formulate our per-ray optimization and matched ray coherence by focusing on camera rays passing through keypoints in the input images to elevate both the efficiency and accuracy of scene correspondences. Accumulated ray features along the feature volume provide a means to discount the coherence constraint amid erroneous ray matching. We demonstrate the effectiveness of CRAYM for both NVS and geometry reconstruction, over dense- or sparse-view settings, with qualitative and quantitative comparisons to state-of-the-art alternatives. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

KidSwatch: Children Development Observation System 5

KidSwatch: Children Development Observation System

引用

5th International Conference on Advancements in computing, ICAC 2023

作者： Oshadhini, P.A.L.N. Siriwardana, K.A.D.H.O. Peshala Ranmini, H.K. Sandeepa, S.R. Weerasinghe, Lokesha Kelegama, Thamali Sri Lanka Institute of Information Technology Faculty of Computing Department of Information Technology Malabe Sri Lanka Sri Lanka Institute of Information Technology Faculty of Computing Department of Software Engineering Malabe Sri Lanka

ISBN: (纸本)9798350358131

The kidSwatch is a mobile application designed specifically for grade 1 children aged six years. It serves as a comprehensive framework for observing and evaluating children's developmental progress. The application focuses on the main components of children's development: Cognitive development, Emotional development, Language development, and Learning development. By analyzing the results obtained from observing these four components, parents can gain valuable insights into their children's development within a matter of minutes. The kidSwatch employs a range of observational techniques, including direct observation, structured interviews, and standardized tests, to gather information on a child's talents, skills, and behaviors. Trained observers proficient in the kidSwatch framework carefully record and analyze the child's interactions, activities, problem-solving abilities, emotional expressions, and social interactions. Ultimately, the kidSwatch empowers parents with a quick and effective means of understanding and assessing their child's development. To satisfy the above features there are a Hand number detection algorithm, letter recognition algorithm, Emotion recognition algorithm, and voice-based answering algorithm They perform an accuracy between 75%-90% on CNN. © 2023 IEEE.

关键词： Emotion Recognition

来源：评论

学校读者我要写书评

暂无评论

MOALF-UAV-MEC: Adaptive Multi-Objective Optimization for UAV-Assisted Mobile Edge computing in Dynamic IoT Environments

引用

IEEE Internet of Things Journal 2025年第12期12卷 20736-20756页

作者： Al-Bakhrani, Ali A. Li, Mingchu Obaidat, Mohammad S. Amran, Gehad Abdullah Dalian University of Technology School of Software Dalian116024 China Albaydha University Al Bayda Yemen Jiangxi Normal University School of Computer and Information Engineering Jiangxi China School of Software Technology Dalian University of Technology Nanchang Dalian China University of Science and Technology School of Computer and Communication Engineering Beijing100083 China SRM University School of Computing Department of Computational Intelligence TN Kattankulathur603203 India The Amity University School of Engineering UP Noida201301 India Dalian University of Technology Department of Management Science and Engineering Dalian116024 China

The proliferation of Internet of Things (IoT) devices and computation-intensive applications has led to unprecedented demands on network resources and computing capabilities. This paper presents MOALF-UAV-MEC, a novel Multi-Objective Adaptive Learning Framework for UAV-Assisted Mobile Edge computing (MEC) tailored for dynamic IoT environments. The framework integrates Multi-Objective Reinforcement Learning (MORL), Model Predictive Control (MPC), Adaptive Particle Swarm Optimization (APSO), and Lyapunov Optimization to optimize UAV trajectories, dynamic resource allocation, and system stability. MOALF-UAV-MEC addresses critical challenges in UAV-assisted MEC, including multi-objective optimization, adaptive resource allocation, energy efficiency, scalability, and quality of service guarantees. Our approach employs a unique burst mode feature for UAVs, enabling temporary performance boosts in high-demand situations. Extensive simulations demonstrate the framework's efficiency in enhancing task completion rates, energy efficiency, and long-term system sustainability. Results show a task completion rate of 94.50%, significantly outperforming existing approaches, with an average of 1,890 completed tasks per UAV and a load balancing efficiency of 96%. The framework exhibits robust adaptive behavior, achieving a 38% reduction in UAV route optimization and a 55% increase in task completion during high-load periods. This research contributes to the advancement of edge computing in IoT environments, offering a scalable and adaptive solution for deploying computational resources in areas with limited infrastructure, during temporary events, or in emergency situations. © 2014 IEEE.

关键词： Model predictive control

来源：评论

学校读者我要写书评

暂无评论

Identification of software Bugs by Analyzing Natural Language-Based Requirements Using Optimized Deep Learning Features

引用

Computers, Materials & Continua 2024年第3期78卷 4379-4397页

作者： Qazi Mazhar ul Haq Fahim Arif Khursheed Aurangzeb Noor ul Ain Javed Ali Khan Saddaf Rubab Muhammad Shahid Anwar Department of Computer Science and Engineering and International Bachelor’s Program in Informatics Yuan Ze UniversityZhongliTaoyuan320315Taiwan Department of Computer Science National University of PakistanRawalpindiPunjab46000Pakistan Department of Computer Software Engineering MCSNational University of Sciences and TechnologyIslamabad44000Pakistan Department of Computer Engineering College of Computer and Information SciencesKing Saud UniversityP.O.Box 51178Riyadh11543Saudi Arabia Department of Computer Science School of PhysicsEngineering and Computer ScienceUniversity of HertfordshireHatfieldAL109ABUK Department of Computer Engineering College of Computing and InformaticsUniversity of SharjahSharjah27272United Arab Emirates Department of AI and Software Gachon UniversitySeongnam-SI13120South Korea

software project outcomes heavily depend on natural language requirements,often causing diverse interpretations and issues like ambiguities and incomplete or faulty *** are exploring machine learning to predict software bugs,but a more precise and general approach is *** bug prediction is crucial for software evolution and user training,prompting an investigation into deep and ensemble learning ***,these studies are not generalized and efficient when extended to other ***,this paper proposed a hybrid approach combining multiple techniques to explore their effectiveness on bug identification *** methods involved feature selection,which is used to reduce the dimensionality and redundancy of features and select only the relevant ones;transfer learning is used to train and test the model on different datasets to analyze how much of the learning is passed to other datasets,and ensemble method is utilized to explore the increase in performance upon combining multiple classifiers in a *** National Aeronautics and Space Administration(NASA)and four Promise datasets are used in the study,showing an increase in the model’s performance by providing better Area Under the Receiver Operating Characteristic Curve(AUC-ROC)values when different classifiers were *** reveals that using an amalgam of techniques such as those used in this study,feature selection,transfer learning,and ensemble methods prove helpful in optimizing the software bug prediction models and providing high-performing,useful end mode.

关键词： Natural language processing software bug prediction transfer learning ensemble learning feature selection

来源：评论

学校读者我要写书评

暂无评论

Exactly minimax-optimal locally differentially private sampling 24

Exactly minimax-optimal locally differentially private sampl...

引用

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

作者： Hyun-Young Park Shahab Asoodeh Si-Hyeon Lee School of Electrical Engineering KAIST Department of Computing and Software McMaster University

ISBN: (纸本)9798331314385

The sampling problem under local differential privacy has recently been studied with potential applications to generative models, but a fundamental analysis of its privacy-utility trade-off (PUT) remains incomplete. In this work, we define the fundamental PUT of private sampling in the minimax sense, using the f-divergence between original and sampling distributions as the utility measure. We characterize the exact PUT for both finite and continuous data spaces under some mild conditions on the data distributions, and propose sampling mechanisms that are universally optimal for all f-divergences. Our numerical experiments demonstrate the superiority of our mechanisms over baselines, in terms of theoretical utilities for finite data space and of empirical utilities for continuous data space.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Predicting Lung Cancer Risk Using Artificial Intelligence 2

Predicting Lung Cancer Risk Using Artificial Intelligence

引用

2nd International Conference on computing and Data Analytics, ICCDA 2024

作者： Shah, Syed Mehr Ali Jamil, Danish Khan, Muhammad Numan Ali Al-Jarwani, Fatma Mahfoodh Mohammed College of Computing & Information Sciences University of Technology and Applied Sciences Musandam Oman University of Santiago de Compostela Spain Sir Syed University of Engineering & Technology Department of Software Engineering India College of Computing & Information Sciences University of Technology and Applied Sciences shinas Oman

ISBN: (纸本)9798331542573

This research proposes a method to accurately forecast the risk of lung cancer in its initial stages by the combination of medical diagnosis and artificial intelligence. Two distinct models are employed: a symptoms-based model utilizing linear regression, and VGG19, a component of CNNs is employed for the analysis of chest x-ray images. The objective of this dual-model approach is to improve comprehensiveness and precision in the early prediction of lung cancer risk. The JSRT and Chest Xray-14 datasets were utilized to train and validate the convolutional neural network (CNN). The Regression model was trained using the Survey Lung cancer Dataset. This initiative prioritizes user-friendliness, interpretability, and ethical considerations of healthcare AI. Initial positive results show that this combined approach has a lot of potential for early detection © 2024 IEEE.

关键词： Lung cancer

来源：评论

学校读者我要写书评

暂无评论

A Secure Key Agreement Scheme for Unmanned Aerial Vehicles-Based Crowd Monitoring System

引用

Computers, Materials & Continua 2022年第3期70卷 6141-6158页

作者： Bander Alzahrani Ahmed Barnawi Azeem Irshad Areej Alhothali Reem Alotaibi Muhammad Shafiq Faculty of Computing and Information Technology King Abdulaziz UniversityJeddahSaudi Arabia Department of Computer Science and Software Engineering International Islamic University IslamabadPakistan Department of Information and Communication Engineering Yeungnam UniversityGyeongsan38541Korea

Unmanned aerial vehicles(UAVs)have recently attractedwidespread attention in civil and commercial *** example,UAVs(or drone)technology is increasingly used in crowd monitoring solutions due to its wider air footprint and the ability to capture data in real ***,due to the open atmosphere,drones can easily be lost or captured by attackers when reporting information to the crowd management *** addition,the attackers may initiate malicious detection to disrupt the crowd-sensing communication ***,security and privacy are one of the most significant challenges faced by drones or the Internet of Drones(IoD)that supports the Internet of Things(IoT).In the literature,we can find some authenticated key agreement(AKA)schemes to protect access control between entities involved in the IoD ***,the AKA scheme involves many vulnerabilities in terms of security and *** this paper,we propose an enhancedAKAsolution for crowdmonitoring applications that require secure communication between drones and controlling *** scheme supports key security features,including anti-forgery attacks,and confirms user *** security characteristics of our scheme are analyzed byNS2 simulation and verified by a random oracle *** simulation results and proofs show that the proposed scheme sufficiently guarantees the security of crowd-aware communication.

关键词： IoT unmanned aerial vehicles authentication crowd monitoring

来源：评论

学校读者我要写书评

暂无评论

Body Part Segmentation of Anime Characters

Body Part Segmentation of Anime Characters

引用

作者： Ou, Zhenhua Liu, Xueting Li, Chengze Wen, Zhenkun Li, Ping Gao, Zhijian Wu, Huisi College of Computer Science and Software Engineering Shenzhen University Shenzhen China School of Computing and Information Sciences Saint Francis University Hong Kong Department of Computing The Hong Kong Polytechnic University Hong Kong College of Electronic and Information Engineering Shenzhen University Shenzhen China

Semantic segmentation is an important approach to present the perceptual semantic understanding of an image, which is of significant usage in various applications. Especially, body part segmentation is designed for segmenting body parts of human characters to assist different editing tasks, such as style editing, pose transfer, and animation production. Since segmentation requires pixel-level precision in semantic labeling, classic heuristics-based methods generally have unstable performance. With the deployment of deep learning, a great step has been taken in segmenting body parts of human characters in natural photographs. However, the existing models are purely trained on natural photographs and generally obtain incorrect segmentation results when applied on anime character images, due to the large visual gap between training data and testing data. In this article, we present a novel approach to achieving body part segmentation of cartoon characters via a pose-based graph-cut formulation. We demonstrate the use of the acquired body part segmentation map in various image editing tasks, including conditional generation, style manipulation, pose transfer, and video-to-anime. © 2024 John Wiley & Sons Ltd.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

ResMHA-Net:Enhancing Glioma Segmentation and Survival Prediction Using a Novel Deep Learning Framework

引用

Computers, Materials & Continua 2024年第10期81卷 885-909页

作者： Novsheena Rasool Javaid Iqbal Bhat Najib Ben Aoun Abdullah Alharthi Niyaz Ahmad Wani Vikram Chopra Muhammad Shahid Anwar Department of Computer Science School of Engineering and TechnologyIslamic University of Science and TechnologyAwantipora192122India Faculty of Computing and Technology Al-Baha UniversityAlaqiq65779-7738Saudi Arabia Research Groups in Intelligent Machines National School of Engineers of SfaxUniversity of SfaxSfax3038Tunisia Department of Electrical Engineering College of EngineeringKing Khalid UniversityAbha61421Saudi Arabia Department of Computer Science and Engineering Thapar Institute of Engineering and TechnologyPatiala147004Punjab Department of Electrical and Instrumentation Engineering Thapar Institute of Engineering and TechnologyPatiala147004Punjab Department of AI and Software Gachon UniversitySeongnam-si13120Republic of Korea

Gliomas are aggressive brain tumors known for their heterogeneity,unclear borders,and diverse locations on Magnetic Resonance Imaging(MRI)*** factors present significant challenges for MRI-based segmentation,a crucial step for effective treatment planning and monitoring of glioma *** study proposes a novel deep learning framework,ResNet Multi-Head Attention U-Net(ResMHA-Net),to address these challenges and enhance glioma segmentation ***-Net leverages the strengths of both residual blocks from the ResNet architecture and multi-head attention *** powerful combination empowers the network to prioritize informative regions within the 3D MRI data and capture long-range *** doing so,ResMHANet effectively segments intricate glioma sub-regions and reduces the impact of uncertain tumor *** rigorously trained and validated ResMHA-Net on the BraTS 2018,2019,2020 and 2021 ***,ResMHA-Net achieved superior segmentation accuracy on the BraTS 2021 dataset compared to the previous years,demonstrating its remarkable adaptability and robustness across diverse ***,we collected the predicted masks obtained from three datasets to enhance survival prediction,effectively augmenting the dataset *** features were then extracted from these predicted masks and,along with clinical data,were used to train a novel ensemble learning-based machine learning model for survival *** model employs a voting mechanism aggregating predictions from multiple models,leading to significant improvements over existing *** ensemble approach capitalizes on the strengths of various models,resulting in more accurate and reliable predictions for patient ***,we achieved an impressive accuracy of 73%for overall survival(OS)prediction.

关键词： Glioma MRI segmentation multihead attention survival prediction deep learning

来源：评论

学校读者我要写书评

暂无评论

Optimal Bounds for Distinct Quartics 51

Optimal Bounds for Distinct Quartics

引用

51st International Colloquium on Automata, Languages, and Programming, ICALP 2024

作者： Charalampopoulos, Panagiotis Gawrychowski, Pawel Ghazawi, Samah School of Computing and Mathematical Sciences Birkbeck University of London United Kingdom Institute of Computer Science University of Wroclaw Poland Department of Computer Science University of Haifa Israel Department of Software Engineering Braude College of Engineering Karmiel Israel

ISBN: (纸本)9783959773225

A fundamental concept related to strings is that of repetitions. It has been extensively studied in many versions, from both purely combinatorial and algorithmic angles. One of the most basic questions is how many distinct squares, i.e., distinct strings of the form UU, a string of length n can contain as fragments. It turns out that this is always O(n), and the bound cannot be improved to sublinear in n [Fraenkel and Simpson, JCTA 1998]. Several similar questions about repetitions in strings have been considered, and by now we seem to have a good understanding of their repetitive structure. For higher-dimensional strings, the basic concept of periodicity has been successfully extended and applied to design efficient algorithms – it is inherently more complex than for regular strings. Extending the notion of repetitions and understanding the repetitive structure of higher-dimensional strings is however far from complete. Quartics were introduced by Apostolico and Brimkov [TCS 2000] as analogues of squares in two dimensions. Charalampopoulos, Radoszewski, Rytter, Waleń, and Zuba [ESA 2020] proved that the number of distinct quartics in an n × n 2D string is O(n2 log2 n) and that they can be computed in O(n2 log2 n) time. Gawrychowski, Ghazawi, and Landau [SPIRE 2021] constructed an infinite family of n × n 2D strings with Ω(n2 log n) distinct quartics. This brings the challenge of determining asymptotically tight bounds. Here, we settle both the combinatorial and the algorithmic aspects of this question: the number of distinct quartics in an n × n 2D string is O(n2 log n) and they can be computed in the worst-case optimal O(n2 log n) time. As expected, our solution heavily exploits the periodic structure implied by occurrences of quartics. However, the two-dimensional nature of the problem introduces some technical challenges. Somewhat surprisingly, we overcome the final challenge for the combinatorial bound using a result of Marcus and Tardos [JCTA 2004] for permuta

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：