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

Joint Double Auction-Based Channel Selection in Wireless Monitoring Networks

IEEE Transactions on Network and Service Management 2025年第3期22卷 2412-2426页

作者： Xia, Na Chen, Lei Li, Meng Yin, Yutao Zhang, Ke Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data China State Grid Electric Power Research Institute Co. Ltd Hefei230088 China

In wireless networks, utilizing sniffers for fault analysis, traffic traceback, and resource optimization is a crucial task. However, existing centralized algorithms cannot be applied to high-density wireless networks. Therefore, distributed optimization of channel selection to maximize the monitoring rate of sensors in Wireless Monitoring Networks (WMNs) is a challenge. This paper proposes a joint double auction-based distributed channel selection algorithm (J2A-CS) to maximize overall quality of monitoring (QoM). First, sniffers are redundantly deployed in WMNs, and an initial channel allocation strategy is formulated. Subsequently, sniffers collectively act as buyers and sellers at different stages. Finally, buyers bid asynchronously, and sellers settle synchronously to maximize the seller's marginal revenue and update the channel selection scheme. As a distributed channel selection algorithm, J2A-CS addresses the highest overall QoM issue in WMNs, demonstrating high scalability and fault tolerance. Simulation results show that J2A-CS significantly improves QoM compared to existing distributed algorithms and outperforms centralized algorithms in high-density scenarios. © 2004-2012 IEEE.

关键词： Sales

来源：评论

学校读者我要写书评

暂无评论

An Innovative K-Anonymity Privacy-Preserving Algorithm to Improve data Availability in the Context of big data

引用

computers, Materials & Continua 2024年第4期79卷 1561-1579页

作者： Linlin Yuan Tiantian Zhang Yuling Chen Yuxiang Yang Huang Li State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang550025China College of Information Engineering Guizhou Open UniversityGuiyang550025China Guizhou Academy of Tobacco Science Guiyang550025China

The development of technologies such as big data and blockchain has brought convenience to life,but at the same time,privacy and security issues are becoming more and more *** K-anonymity algorithm is an effective and low computational complexity privacy-preserving algorithm that can safeguard users’privacy by anonymizing big ***,the algorithm currently suffers from the problem of focusing only on improving user privacy while ignoring data *** addition,ignoring the impact of quasi-identified attributes on sensitive attributes causes the usability of the processed data on statistical analysis to be *** on this,we propose a new K-anonymity algorithm to solve the privacy security problem in the context of big data,while guaranteeing improved data ***,we construct a new information loss function based on the information quantity *** that different quasi-identification attributes have different impacts on sensitive attributes,we set weights for each quasi-identification attribute when designing the information loss *** addition,to reduce information loss,we improve K-anonymity in two ***,we make the loss of information smaller than in the original table while guaranteeing privacy based on common artificial intelligence algorithms,i.e.,greedy algorithm and 2-means clustering *** addition,we improve the 2-means clustering algorithm by designing a mean-center method to select the initial center of ***,we design the K-anonymity algorithm of this scheme based on the constructed information loss function,the improved 2-means clustering algorithm,and the greedy algorithm,which reduces the information ***,we experimentally demonstrate the effectiveness of the algorithm in improving the effect of 2-means clustering and reducing information loss.

关键词： Blockchain big data K-anonymity 2-means clustering greedy algorithm mean-center method

来源：评论

学校读者我要写书评

暂无评论

data Aggregation Point Placement and Subnetwork Optimization for Smart Grids

引用

computers, Materials & Continua 2025年第4期83卷 407-434页

作者： Tien-Wen Sung Wei Li Chao-Yang Lee Yuzhen Chen Qingjun Fang Fujian Provincial Key Laboratory of Big Data Mining and Applications College of Computer Science and MathematicsFujian University of TechnologyFuzhou350118China Department of Computer Science and Information Engineering National Yunlin University of Science and TechnologyYunlin640301TaiwanChina

To transmit customer power data collected by smart meters(SMs)to utility companies,data must first be transmitted to the corresponding data aggregation point(DAP)of the *** number of DAPs installed and the installation location greatly impact the whole *** the traditional DAP placement algorithm,the number of DAPs must be set in advance,but determining the best number of DAPs is difficult,which undoubtedly reduces the overall performance of the ***,the excessive gap between the loads of different DAPs is also an important factor affecting the quality of the *** address the above problems,this paper proposes a DAP placement algorithm,APSSA,based on the improved affinity propagation(AP)algorithm and sparrow search(SSA)algorithm,which can select the appropriate number of DAPs to be installed and the corresponding installation locations according to the number of SMs and their distribution locations in different *** algorithm adds an allocation mechanism to optimize the subnetwork in the *** is evaluated under three different areas and compared with other DAP placement *** experimental results validated that the method in this paper can reduce the network cost,shorten the average transmission distance,and reduce the load gap.

关键词： Smart grid data aggregation point placement network cost average transmission distance load gap

来源：评论

学校读者我要写书评

暂无评论

Foundation models in bioinformatics

引用

National science Review 2025年第4期12卷 400-418页

作者： Fei Guo Renchu Guan Yaohang Li Qi Liu Xiaowo Wang Can Yang Jianxin Wang Hunan Provincial Key Lab on Bioinformatics School of Computer Science and Engineering Central South University Xiangjiang Laboratory Key Laboratory for Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Department of Computer Science Old Dominion University School of Life Sciences and Technology Tongji University Department of Automation Tsinghua University Department of Mathematics State Key Laboratory of Molecular Neuroscience and Big Data Bio-Intelligence Lab The Hong Kong University of Science and Technology

With the adoption of foundation models(FMs),artificial intelligence(AI) has become increasingly significant in bioinformatics and has successfully addressed many historical challenges,such as pre-training frameworks,model evaluation and *** demonstrate notable proficiency in managing large-scale,unlabeled datasets,because experimental procedures are costly and labor *** various downstream tasks,FMs have consistently achieved noteworthy results,demonstrating high levels of accuracy in representing biological entities.A new era in computational biology has been ushered in by the application of FMs,focusing on both general and specific biological *** this review,we introduce recent advancements in bioinformatics FMs employed in a variety of downstream tasks,including genomics,transcriptomics,proteomics,drug discovery and single-cell *** aim is to assist scientists in selecting appropriate FMs in bioinformatics,according to four model types:language FMs,vision FMs,graph FMs and multimodal *** addition to understanding molecular landscapes,AI technology can establish the theoretical and practical foundation for continued innovation in molecular biology.

关键词： foundation model bioinformatics genomics transcriptomics proteomics drug discovery single-cell analysis

来源：评论

学校读者我要写书评

暂无评论

SG-NeRF:Sparse-Input Generalized Neural Radiance Fields for Novel View Synthesis

引用

Journal of computer science & Technology 2024年第4期39卷 785-797页

作者： Kuo Xu Jie Li Zhen-Qiang Li Yang-Jie Cao School of Cyber Science and Engineering Zhengzhou UniversityZhengzhou 450002China Intelligent Big Data System(iBDSys)Lab Shanghai Jiao Tong UniversityShanghai 200240China School of Computer and Artificial Intelligence Zhengzhou UniversityZhengzhou 450001China

Traditional neural radiance fields for rendering novel views require intensive input images and pre-scene optimization,which limits their practical *** propose a generalization method to infer scenes from input images and perform high-quality rendering without pre-scene optimization named SG-NeRF(Sparse-Input Generalized Neural Radiance Fields).Firstly,we construct an improved multi-view stereo structure based on the convolutional attention and multi-level fusion mechanism to obtain the geometric features and appearance features of the scene from the sparse input images,and then these features are aggregated by multi-head attention as the input of the neural radiance *** strategy of utilizing neural radiance fields to decode scene features instead of mapping positions and orientations enables our method to perform cross-scene training as well as inference,thus enabling neural radiance fields to generalize for novel view synthesis on unseen *** tested the generalization ability on DTU dataset,and our PSNR(peak signal-to-noise ratio)improved by 3.14 compared with the baseline method under the same input *** addition,if the scene has dense input views available,the average PSNR can be improved by 1.04 through further refinement training in a short time,and a higher quality rendering effect can be obtained.

关键词： Neural Radiance Fields(NeRF) multi-view stereo(MVS) new view synthesis(NVS)

来源：评论

学校读者我要写书评

暂无评论

Adaptive Successive POI Recommendation via Trajectory Sequences Processing and Long Short-Term Preference Learning

引用

computers, Materials & Continua 2024年第10期81卷 685-706页

作者： Yali Si Feng Li Shan Zhong Chenghang Huo Jing Chen Jinglian Liu School of Computer Science and Engineering Changshu Institute of TechnologyChangshu215500China Suzhou Industrial Intelligence and Big Data Laboratory Suzhou215000China School of Information Science and Engineering Yanshan UniversityQinhuangdao066004China College of Electronic and Information Engineering Guangdong Ocean UniversityZhanjiang524088China

Point-of-interest(POI)recommendations in location-based social networks(LBSNs)have developed rapidly by incorporating feature information and deep learning ***,most studies have failed to accurately reflect different users’preferences,in particular,the short-term preferences of inactive *** better learn user preferences,in this study,we propose a long-short-term-preference-based adaptive successive POI recommendation(LSTP-ASR)method by combining trajectory sequence processing,long short-term preference learning,and spatiotemporal ***,the check-in trajectory sequences are adaptively divided into recent and historical sequences according to a dynamic time ***,an adaptive filling strategy is used to expand the recent check-in sequences of users with inactive check-in behavior using those of similar active *** further propose an adaptive learning model to accurately extract long short-term preferences of users to establish an efficient successive POI recommendation system.A spatiotemporal-context-based recurrent neural network and temporal-context-based long short-term memory network are used to model the users’recent and historical checkin trajectory sequences,*** experiments on the Foursquare and Gowalla datasets reveal that the proposed method outperforms several other baseline methods in terms of three evaluation *** specifically,LSTP-ASR outperforms the previously best baseline method(RTPM)with a 17.15%and 20.62%average improvement on the Foursquare and Gowalla datasets in terms of the Fβmetric,respectively.

关键词： Location-based social networks adaptive successive point-of-interest recommendation long short-term preference trajectory sequences

来源：评论

学校读者我要写书评

暂无评论

Reveal training performance mystery between Tensor Flow and PyTorch in the single GPU environment

引用

science China(Information sciences) 2022年第1期65卷 147-163页

作者： Hulin DAI Xuan PENG Xuanhua SHI Ligang HE Qian XIONG Hai JIN National Engineering Research Center for Big Data Technology and System Service Computing Technology and System LabSchool of Computer Science and Technology Huazhong University of Science and Technology Department of Computer Science University of Warwick

Deep learning has gained tremendous success in various fields while training deep neural networks(DNNs) is very compute-intensive, which results in numerous deep learning frameworks that aim to offer better usability and higher performance to deep learning practitioners. Tensor Flow and Py Torch are the two most popular frameworks. Tensor Flow is more promising within the industry context, while Py Torch is more appealing in academia. However, these two frameworks differ much owing to the opposite design philosophy:static vs dynamic computation graph. Tensor Flow is regarded as being more performance-friendly as it has more opportunities to perform optimizations with the full view of the computation graph. However, there are also claims that Py Torch is faster than Tensor Flow sometimes, which confuses the end-users on the choice between them. In this paper, we carry out the analytical and experimental analysis to unravel the mystery of comparison in training speed on single-GPU between Tensor Flow and Py Torch. To ensure that our investigation is as comprehensive as possible, we carefully select seven popular neural networks, which cover computer vision, speech recognition, and natural language processing(NLP). The contributions of this work are two-fold. First, we conduct the detailed benchmarking experiments on Tensor Flow and Py Torch and analyze the reasons for their performance difference. This work provides the guidance for the end-users to choose between these two frameworks. Second, we identify some key factors that affect the performance,which can direct the end-users to write their models more efficiently.

关键词： deep learning performance comparison TensorFlow PyTorch

来源：评论

学校读者我要写书评

暂无评论

An Analysis Model of Learners’ Online Learning Status Based on Deep Neural Network and Multi-Dimensional Information Fusion

引用

computer Modeling in engineering & sciences 2023年第6期135卷 2349-2371页

作者： Mingyong Li Lirong Tang Longfei Ma Honggang Zhao Jinyu Hu Yan Wei College of Computer and Information Science Chongqing Normal UniversityChongqing401331China Chongqing Engineering Research Center of Educational Big Data Intelligent Perception and Application Chongqing401331China

The learning status of learners directly affects the quality of *** with offline teachers,it is difficult for online teachers to capture the learning status of students in the whole class,and it is even more difficult to continue to pay attention to studentswhile ***,this paper proposes an online learning state analysis model based on a convolutional neural network and multi-dimensional information ***,a facial expression recognition model and an eye state recognition model are constructed to detect students’emotions and fatigue,*** integrating the detected data with the homework test score data after online learning,an analysis model of students’online learning status is *** to the PAD model,the learning state is expressed as three dimensions of students’understanding,engagement and interest,and then analyzed from multiple ***,the proposed model is applied to actual teaching,and procedural analysis of 5 different types of online classroom learners is carried out,and the validity of the model is verified by comparing with the results of the manual analysis.

关键词： Deep learning fatigue detection facial expression recognition sentiment analysis information fusion

来源：评论

学校读者我要写书评

暂无评论

Applying Competition-Based Learning to Stimulate Students' Practical and Competitive AI Ability in a Machine Learning Curriculum

引用

IEEE Transactions on Education 2024年第2期67卷 256-265页

作者： Chang, Hui-Tzu Lin, Chia-Yu National Yang Ming Chiao Tung University Center for Institutional Research and Data Analytics Hsinchu30010 Taiwan National Central University Department of Computer Science and Information Engineering Taoyuan City320317 Taiwan

Contribution: This study incorporates competition-based learning (CBL) into machine learning courses. By engaging students in innovative problem-solving challenges within information competitions, revealing that students' participation in online problem-solving competitions can improve their information technology, and showcase competitions can enhance their competition ability. Background: The CBL model seamlessly integrates project-based learning and competition, placing a strong emphasis on both collective learning and outcomes. This approach cultivates motivation among team members, driving them to enhance their learning and translate knowledge into practical experience. Research Questions: The objective is to examine the disparities in the development of theoretical knowledge, information technology, AI practical ability, and competition ability among students participating in online problem-solving competitions and showcase competitions, and discusses the potential moderating effect of competition type on the relationships between variables in the hypothetical model. Methodology: The study involved 74 students enrolled in machine learning course at a university. The students were given theoretical knowledge and information technology pretests and posttests in the 2nd and 17th weeks, respectively. In the 18th week, the students presented their projects using slideshows and were graded by judges while also submitting their final competition proposal and slides. Findings: Students in online problem-solving competitions can enhance their information technology, while those participating in showcase competitions can improve their competitive ability. Moreover, the competition type was found to moderate the relationships among theoretical knowledge, information technology, and AI model accuracy. The findings suggest that incorporating CBL into machine learning courses effectively cultivates students' AI practical and competitive abilities. © 1963-2012 IEEE.

关键词： Competition

来源：评论

学校读者我要写书评

暂无评论

LearnSC: An Efficient and Unified Learning-Based Framework for Subgraph Counting Problem 40

LearnSC: An Efficient and Unified Learning-Based Framework f...

引用

40th IEEE International Conference on data engineering, ICDE 2024

作者： Hou, Wenzhe Zhao, Xiang Tang, Bo National University of Defense Technology Laboratory for Big Data and Decision China Southern University of Science and Technology Department of Computer Science and Engineering China

ISBN: (纸本)9798350317152

Graphs are valuable data structures used to represent complex relationships between entities in a wide range of applications, such as social networks and chemical reactions. Subgraph counting problem is a well-known hard problem, as its core subroutine, the subgraph matching, is NP-complete. In this work, we propose an efficient and unified deep learning-based solution framework LearnSC, which solves the subgraph counting problem approximately. This framework offers two key advantages: (i) it is a generic solution that is orthogonal to the existing techniques of learning-based solutions;and (ii) it is equipped with a suite of optimizations to significantly improve the accuracy of the estimated results. Our experimental results on 7 datasets demonstrate that our proposal is highly accurate, robust, and scalable, making it an excellent solution for subgraph counting problem among all statistics-based and learning-based competitors. © 2024 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：