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

7th International Conference on Digital Medicine and Image Processing, DMIP 2024

作者： Syed Masood, Jafar Ali Ibrahim Vinayagam, Jai Kumar Onteru, Ranjit Kumar Kopparapu, Umamaheswararao Parabathini, Bulah Pushpa Rani Department of IoT School of Computer Science and Engineering Vellore Institute of Technology Tamil Nadu Vellore632014 India Centre for Big Data Analytics QIS College of Engineering and Technology Andhra Pradesh Ongole India

ISBN: (纸本)9798400709586

The rapid proliferation of medical big data has opened unprecedented opportunities for enhancing patient outcomes through advanced computational analysis. This paper explores the integration of big data analytics with clinical practices to deliver personalized medicine, optimize treatment protocols, and improve patient care. Our findings demonstrate that a synergistic approach between computational insights and clinical decision-making can significantly advance healthcare outcomes. This study provides a comprehensive framework for harnessing medical big data, addressing key challenges, and proposing solutions to integrate these insights into everyday clinical practice. Copyright © 2024 held by the owner/author(s). Publication rights licensed to ACM.

关键词： Personalized medicine

来源：评论

学校读者我要写书评

暂无评论

A Survey and Experimental Review on data Distribution Strategies for Parallel Spatial Clustering Algorithms

引用

Journal of computer science & Technology 2024年第3期39卷 610-636页

作者： Jagat Sesh Challa Navneet Goyal Amogh Sharma Nikhil Sreekumar Sundar Balasubramaniam Poonam Goyal Advanced Data Analytics and Parallel Technologies Laboratory Birla Institute of Technology and Science Pilani 333031India Uber New York 11101U.S.A. Computer Science and Engineering Department University of MinnesotaMinneapolis 55455U.S.A.

The advent of big data has led to the rapid growth in the usage of parallel clustering algorithms that work over distributed computing frameworks such as MPI,MapReduce,and *** important step for any parallel clustering algorithm is the distribution of data amongst the cluster *** step governs the methodology and performance of the entire *** typically use random,or a spatial/geometric distribution strategy like kd-tree based partitioning and grid-based partitioning,as per the requirements of the ***,these strategies are generic and are not tailor-made for any specific parallel clustering *** this paper,we give a very comprehensive literature survey of MPI-based parallel clustering algorithms with special reference to the specific data distribution strategies they *** also propose three new data distribution strategies namely Parameterized Dimensional Split for parallel density-based clustering algorithms like DBSCAN and OPTICS,Cell-Based Dimensional Split for dGridSLINK,which is a grid-based hierarchical clustering algorithm that exhibits efficiency for disjoint spatial distribution,and Projection-Based Split,which is a generic distribution *** of these preserve spatial locality,achieve disjoint partitioning,and ensure good data load *** experimental analysis shows the benefits of using the proposed data distribution strategies for algorithms they are designed for,based on which we give appropriate recommendations for their usage.

关键词： parallel data mining data distribution parallel clustering spatial locality preservation

来源：评论

学校读者我要写书评

暂无评论

Electricity Carbon Quota Trading Scheme based on Certificateless Signature and Blockchain

引用

computer Modeling in engineering & sciences 2024年第2期138卷 1695-1712页

作者： Xiaodong Yang Runze Diao Tao Liu Haoqi Wen Caifen Wang College of Computer Science and Engineering Northwest Normal UniversityLanzhou730070China Institute of China TelecomWanwei China TelecomWanwei Information Technology Co.Ltd.Lanzhou730030China College of Big Data and Internet Shenzhen Technology UniversityShenzhen518118China Key Laboratory of Cryptography and Data Analytics Northwest Normal UniversityLanzhou730070China

The carbon tradingmarket can promote“carbon peaking”and“carbon neutrality”at low cost,but carbon emission quotas face attacks such as data forgery,tampering,counterfeiting,and replay in the electricity trading *** signatures are a new cryptographic technology that can address traditional cryptography’s general essential certificate requirements and avoid the problem of crucial escrowbased on identity ***,most certificateless signatures still suffer fromvarious security *** present a secure and efficient certificateless signing scheme by examining the security of existing certificateless signature *** ensure the integrity and verifiability of electricity carbon quota trading,we propose an electricity carbon quota trading scheme based on a certificateless signature and *** scheme utilizes certificateless signatures to ensure the validity and nonrepudiation of transactions and adopts blockchain technology to achieve immutability and traceability in electricity carbon quota *** addition,validating electricity carbon quota transactions does not require time-consuming bilinear pairing *** results of the analysis indicate that our scheme meets existential unforgeability under adaptive selective message attacks,offers conditional identity privacy protection,resists replay attacks,and demonstrates high computing and communication performance.

关键词： Electricity carbon trading certificateless signature blockchain forgery attack carbon quota

来源：评论

学校读者我要写书评

暂无评论

An efficient Quasi-Affine Transformation Evolutionary algorithm with fixed dimension updating and its application in UAV 3D path planning

引用

Journal of Intelligent and Fuzzy Systems 2024年第4期46卷 9755-9781页

作者： Sung, Tien-Wen Zhao, Baohua Zhang, Xin Lee, Chao-Yang Fang, Qingjun Fujian Provincial Key Laboratory of Big Data Mining and Applications College of Computer Science and Mathematics Fujian University of Technology Fuzhou China Department of Computer Science and Information Engineering National Yunlin University of Science and Technology Yunlin Taiwan

Quasi-Affine Transformation Evolutionary (QUATRE) algorithm is a kind of swarm-based collaborative optimization algorithm that solves the problem of a position deviation in a DE search by using the co-evolution matrix M instead of the cross-control parameter CR in the differential evolution algorithm (DE). However, QUATRE shares some of the same weaknesses as DE, such as premature convergence and search stagnation. Inspired by the artificial bee colony algorithm (ABC), we propose a new QUATRE algorithm to improve these problems that ranks all the individuals and evolves only the poorer half of the population. In an evolving population, individuals of different levels intersect with dimensions of different sizes to improve search efficiency and accuracy. In addition, we establish a better selection framework for the parent generation individuals and select more excellent parent individuals to complete the evolution for the individuals trapped in search stagnation. To verify the performance of the new QUATRE algorithm, we divide the comparison algorithm into three groups, including ABC variant group, DE variant group, and QUATRE variant group, and the CEC2014 test suite is used for the comparison. The experimental results show the new QUATRE algorithm performance is competitive. We also successfully apply the new QUATRE algorithm on the 3D path planning of UAV, and compared with the other famous algorithm performance it is still outstanding, which verifies the algorithm's practicability. © 2024 - IOS Press. All rights reserved.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Comparative Analysis of Spatial Human Mobility Parameters in 15 Most Populous U.S. Metropolitan Statistical Areas

引用

IAENG International Journal of Applied Mathematics 2024年第6期54卷 997-1012页

作者： Matloub, Zaid Kostanic, Ivica Senior Data Engineer at Better World Analytics MelbourneFL United States Department of Electrical Engineering and Computer Science Florida Institute of Technology MelbourneFL United States

This research paper presents the results of two studies investigating human mobility patterns in the 15 largest Metropolitan Statistical Areas (MSAs) in the United States. It studied 14 daily mobility parameters aggregated at the MSA level, derived from four primary mobility parameters: Number of Visited Locations (N_LOC), Number of Unique Visited Locations (N_ULOC), Radius of Gyration (R_GYR), and Distance Traveled (D_TRAV) over a 30-day period. The first study was conducted on data from two large MSAs, one coastal and one inland (Boston and Atlanta, respectively). The aim was to examine associations between daily values of mobility parameters aggregated at the MSA level and identify those carrying similar or identical information. Results of factor analysis showed that these could be adequately described by two independent factors, pointing to one or two of the mobility parameters as sufficient to represent the whole set in analyses based on associations. These could either be D_TRAV, as it had high loadings on both factors, or N_LOC and R_GYR due to their high loadings on the two extracted factors. The second study was conducted on daily mobility datasets from the 15 MSAs. The aim was to compare daily mobility patterns of these MSAs and group them based on their mobility pattern similarities. Factor analysis of the aggregated mean daily distances (D_TRAV) across different MSAs over the studied period classified them into two distinct groups: one predominantly composed of inland MSAs and the other primarily of coastal MSAs. Strong weekly cycle trends emerged in these groups. Specifically, individuals from the inland MSA group tended to travel the furthest on Fridays and the least on Sundays, whereas those from the coastal MSA group traveled the most on Saturdays and the least on Mondays. This weekly pattern was robust, with 7-day lag autocorrelations of mean daily parameter values ranging between 0.81 to 0.99, excluding the mean daily N_LOC. These findings offer a

关键词： big data

来源：评论

学校读者我要写书评

暂无评论

Multi-Dimensional Training Optimization for Efficient Federated Synergy Learning

引用

IEEE Transactions on Mobile Computing 2025年第7期24卷 6243-6258页

作者： Fu, Shucun Dong, Fang Chen, Runze Shen, Dian Zhang, Jinghui He, Qiang Southeast University School of Computer Science and Engineering Nanjing China Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan China

Edge learning (EL) is an end-to-edge collaborative learning paradigm enabling devices to participate in model training and data analysis, opening countless opportunities for edge intelligence. As a promising EL framework, federated synergy learning (FSyL) mitigates the computation and communication overhead on resource-constrained devices by offloading partial model layers to the edge server for synergistic training. Nevertheless, due to the system and statistical heterogeneity, naively using existing FSyL methods is significantly time-consuming and causes accuracy degradation. Motivated by this issue, this paper introduces a novel FSyL framework that integrates multi-dimensional training optimization and formulates the edge learning cost minimization (ELCM) problem. To tackle the ELCM efficiently, we design OL-MG, an OnLine Model Splitting and Resource Provisioning Game. Specifically, we first reformulate and decompose the original ELCM based on data quality evaluation. Then, given a model splitting decision, we determine the optimal resource provisioning in Sub-problem1, based on which optimal model splitting in Sub-problem2 is modeled as a potential game. Subsequently, we introduce a decentralized algorithm to find a Nash equilibrium (NE) solution. Furthermore, we further extend OL-MG to support a budget-aware multi-edge scenario. Extensive experiments demonstrate that the proposed mechanism significantly outperforms state-of-the-art methods in cost-saving and accuracy improvement. © 2025 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

CrossFi: A Cross Domain Wi-Fi Sensing Framework Based on Siamese Network

引用

IEEE Internet of Things Journal 2025年第12期12卷 20138-20155页

作者： Zhao, Zijian Chen, Tingwei Cai, Zhijie Li, Xiaoyang Li, Hang Chen, Qimei Zhu, Guangxu Shenzhen Research Institute of Big Data Shenzhen518115 China Sun Yat-sen University School of Computer Science and Engineering Guangzhou510275 China Shenzhen Research Institute of Big Data Shenzhen518115 China Wuhan University School of Electronic Information Wuhan430072 China

In recent years, Wi-Fi sensing has garnered significant attention due to its numerous benefits, such as privacy protection, low cost, and penetration ability. Extensive research has been conducted in this field, focusing on areas such as gesture recognition, people identification, and fall detection. However, many data-driven methods encounter challenges related to domain shift, where the model fails to perform well in environments different from the training data. One major factor contributing to this issue is the limited availability of Wi-Fi sensing datasets, which makes models learn excessive irrelevant information and over-fit to the training set. Unfortunately, collecting large-scale Wi-Fi sensing datasets across diverse scenarios is a challenging task. To address this problem, we propose CrossFi, a siamese network-based approach that excels in both in-domain scenario and cross-domain scenario, including few-shot, zero-shot scenarios, and even works in few-shot new-class scenario where testing set contains new categories. The core component of CrossFi is a sample-similarity calculation network called CSi-Net, which improves the structure of the siamese network by using an attention mechanism to capture similarity information, instead of simply calculating the distance or cosine similarity. Based on it, we develop an extra Weight-Net that can generate a template for each class, so that our CrossFi can work in different scenarios. Experimental results demonstrate that our CrossFi achieves state-of-the-art performance across various scenarios. In gesture recognition task, our CrossFi achieves an accuracy of 98.17% in in-domain scenario, 91.72% in one-shot cross-domain scenario, 64.81% in zero-shot cross-domain scenario, and 84.75% in one-shot new-class scenario. The code for our model is publicly available at https://***/RS2002/CrossFi. © 2014 IEEE.

关键词： Gesture recognition

来源：评论

学校读者我要写书评

暂无评论

P3DC:Reducing DRAM Cache Hit Latency by Hybrid Mappings

引用

Journal of computer science & Technology 2024年第6期39卷 1341-1360页

作者： Ye Chi Ren-Tong Guo Xiao-Fei Liao Hai-Kun Liu Jianhui Yue National Engineering Research Center for Big Data Technology and System Wuhan 430074China Services Computing Technology and System Laboratory Wuhan 430074China Cluster and Grid Computing Laboratory Wuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China School of Big Data and Internet Shenzhen Technology UniversityShenzhen 518118China Department of Computer Science Michigan Technological UniversityHoughton 49931-1295U.S.A.

Die-stacked dynamic random access memory(DRAM)caches are increasingly advocated to bridge the performance gap between the on-chip cache and the main *** fully realize their potential,it is essential to improve DRAM cache hit rate and lower its cache hit *** order to take advantage of the high hit-rate of set-association and the low hit latency of direct-mapping at the same time,we propose a partial direct-mapped die-stacked DRAM cache called *** design is motivated by a key observation,i.e.,applying a unified mapping policy to different types of blocks cannot achieve a high cache hit rate and low hit latency *** address this problem,P3DC classifies data blocks into leading blocks and following blocks,and places them at static positions and dynamic positions,respectively,in a unified set-associative *** also propose a replacement policy to balance the miss penalty and the temporal locality of different *** addition,P3DC provides a policy to mitigate cache thrashing due to block type *** results demonstrate that P3DC can reduce the cache hit latency by 20.5%while achieving a similar cache hit rate compared with typical set-associative caches.P3DC improves the instructions per cycle(IPC)by up to 66%(12%on average)compared with the state-of-the-art direct-mapped cache—BEAR,and by up to 19%(6%on average)compared with the tag-data decoupled set-associative cache—DEC-A8.

关键词： die-stacked dynamic random access memory(DRAM) cache set-associative direct-mapped hit latency

来源：评论

学校读者我要写书评

暂无评论

Distributed Truss Computation in Dynamic Graphs

引用

Tsinghua science and Technology 2023年第5期28卷 873-887页

作者： Ziwei Mo Qi Luo Dongxiao Yu Hao Sheng Jiguo Yu Xiuzhen Cheng School of Computer Science and Technology Shandong UniversityQingdao 266200China State Key Laboratory of Software Development Environment School of Computer Science and Engineering and the Beijing Advanced Innovation Center for Big Data and Brain ComputingBeihang UniversityBeijing 100191China Big Data Institute Qilu University of Technology(Shandong Academy of Sciences)Jinan 250353China

Large-scale graphs usually exhibit global sparsity with local cohesiveness,and mining the representative cohesive subgraphs is a fundamental problem in graph *** k-truss is one of the most commonly studied cohesive subgraphs,in which each edge is formed in at least k 2 triangles.A critical issue in mining a k-truss lies in the computation of the trussness of each edge,which is the maximum value of k that an edge can be in a *** works mostly focus on truss computation in static graphs by sequential ***,the graphs are constantly changing dynamically in the real *** study distributed truss computation in dynamic graphs in this *** particular,we compute the trussness of edges based on the local nature of the k-truss in a synchronized node-centric distributed *** decomposing the trussness of edges by relying only on local topological information is possible with the proposed distributed decomposition ***,the distributed maintenance algorithm only needs to update a small amount of dynamic information to complete the *** experiments have been conducted to show the scalability and efficiency of the proposed algorithm.

关键词： distributed algorithm dynamic graph graph mining cohesive subgraph k-truss

来源：评论

学校读者我要写书评

暂无评论

Analysis on DeepFake dataset, Manipulation and Detection Techniques: A Review

Analysis on DeepFake Dataset, Manipulation and Detection Tec...

引用

International Conference on Advances and Applications of Artificial Intelligence and Machine Learning, ICAAAIML 2022

作者： Rasool, Aale Katarya, Rahul Big Data Analytics and Web Intelligence Laboratory Department of Computer Science Delhi Technological University New Delhi India

ISBN: (纸本)9789819959730

The ability to spot false news is becoming increasingly important in today’s environment. Modern, rapid communication and easy access to all kinds of information were made possible by social networks and internet media. On the other hand, it opens up new avenues for malicious people to exploit vast amounts of publicly available data. Fake images and videos may now be predicted with greater accuracy because of advances in machine learning, particularly deep learning. Many studies have been conducted in recent years to better understand how deepfakes work, and several deep learning-based algorithms to detect deepfake videos or images have been developed. This study provides a comprehensive summary of the most recent manipulation techniques and datasets utilized in this subject. In addition, we reviewed the recent work of other academics on the subject and provided a roadmap for future study to aid scholars in combating the issue of deep fakes. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2023.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：