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

IEEE International Conference on big data and cloud computing (Bdcloud)

作者： Feiyu Wang Jian-tao Zhou Hao Wang Xu Guo College of Computer Science Inner Mongolia University Hohhot China Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Engineering Research Center of Ecological Big Data Ministry of Education National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian China

Users worldwide widely use cloud storage because of its efficiency, convenience, and high availability. Multi-cloud storage is usually selected to ensure the high availability of data. Unfortunately, when data is migrated and replicated between multi-cloud data centers, it is not easy to guarantee data con-sistency. This paper proposes an efficient, secure, and new data consistency verification scheme using blockchain technology. In order to reduce the computation and communication overhead in the verification process, our scheme uses encrypted tags to build Merkle hash tree to generate unique and lightweight verification proofs and does not use third-party auditors. The final theoretical and experimental analysis shows that our scheme has higher security and a faster verification process in multi-cloud storage.

关键词： cloud computing data centers Costs Blockchains Behavioral sciences

来源：评论

学校读者我要写书评

暂无评论

Blockchain-Based Multi-cloud data Storage System Disaster Recovery

Blockchain-Based Multi-Cloud Data Storage System Disaster Re...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Feiyu Wang Jian-tao Zhou College of Computer Science Inner Mongolia University Hohhot Inner Mongolia China Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Engineering Research Center of Ecological Big Data Ministry of Education National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian China

cloud storage services have been used by most businesses and individual users. However, data loss, service interruptions and cyber attacks often lead to cloud storage services not being provided properly, and these incidents have caused financial losses to users. Second, traditional and single-cloud model disaster recovery services are no longer suitable for the current complex cloud storage systems. Therefore, a scheme to provide disaster recovery for cloud storage services in a multi-cloud storage environment is needed in real production. In this paper, we propose a disaster recovery scheme based on blockchain technology. The proposed scheme outlined in this study aims to address the issue of data availability within the cloud storage landscape. The proposed scheme achieves this goal by dividing data into hot and cold categories, verifying the integrity of copy data via blockchain technology, and utilizing blockchain networks to manage multi-cloud storage systems. Experimental findings demonstrate that the proposed scheme yields superior results in terms of computation and time overheads.

关键词：

来源：评论

学校读者我要写书评

暂无评论

BMDP:Blockchain-Based Multi-cloud Storage data Provenance

BMDP:Blockchain-Based Multi-Cloud Storage Data Provenance

引用

International Conference on computer Supported Cooperative Work in Design

作者： Feiyu Wang Jian-Tao Zhou Xu Guo College of Computer Science Inner Mongolia University Hohhot Inner Mongolia China Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Engineering Research Center of Ecological Big Data Ministry of Education National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Engineering Laboratory for Big Data Analysis Technology China

In a multi-cloud storage system, provenance data records all operations and ownership during its lifecycle, which is critical for data security and audibility. However, recording provenance data also poses some challenging security and storage issues. In this paper, we present a secure and efficient multi-cloud storage data source scheme, BMDP. We use blockchain technology to ensure the secure storage of provenance data and design a smart contract to utilize the provenance data to ensure the proper operation of the multi-cloud storage system. Finally, we analyze the scheme’s safety and do simulation experiments to show that the scheme has practicality.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Discrepancy and Thematic Bibliometric Analyses of the Remaining Limitations in Artificial Intelligence

Discrepancy and Thematic Bibliometric Analyses of the Remain...

引用

2024 IEEE International Conference on computing, ICOCO 2024

作者： Mansor, Mahayaudin M. Ibrahim, Nurain Radi, Noor Fadhilah Ahmad Rahim, Nadirah Abdul Yahaya, Syarul Heiry Bakar, Mohd Aftar Abu Zakaria, Roslinazairimah School of Mathematical Sciences College of Computing Informatics and Mathematics Universiti Teknologi MARA Malaysia Institute of Big Data Analytics and Artificial Intelligence Universiti Teknologi MARA Malaysia Department of Electrical and Computer Engineering Kuliyyah of Engineering International Islamic University Malaysia Department of Science Computer and Mathematics Universiti Teknologi MARA Penang Campus Malaysia Department of Mathematical Sciences Faculty of Science & Technology Universiti Kebangsaan Malaysia Centre for Mathematical Sciences Universiti Malaysia Pahang Al-Sultan Abdullah Malaysia

ISBN: (纸本)9798331530303

As artificial intelligence (AI) advances, it is essential to continuously comprehend its limitations to optimise the integration of AI into autonomous systems that empower humans. The first objective of this study is to highlight the key capabilities of both humans and AI, focusing on the differences and identifying limitations of AI from the literature. Through discrepancy analysis, this study uses a Venn diagram to visualise the remaining limitations of AI into five key domains: (i) emotional intelligence, (ii) consciousness and awareness, (iii) creative imagination, (iv) communication, and (v) ethical decision-making. Furthermore, this study employs thematic bibliometric analysis to provide a more detailed examination of each AI limitation as the second objective. This study has identified underdeveloped and emerging research themes with potential for future development, such as emotion recognition, human-computer interaction, digital health, and situational awareness, which may require further research. Additionally, this study commends the ongoing efforts to harness AI’s computational power and algorithmic innovations to enhance AI’s overall performance and applicability. ©2024 IEEE.

关键词： Emotion Recognition

来源：评论

学校读者我要写书评

暂无评论

GK: A Graphormer Architecture Based Knowledge Graph Reasoning Model for Link Prediction

GK: A Graphormer Architecture Based Knowledge Graph Reasonin...

引用

IEEE International Conference on big data and cloud computing (Bdcloud)

作者： Yueiia Wu Jian-tao Zhou Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing College of Computer Science Inner Mongolia University National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Hohhot China

Knowledge Graph has become a dominant research field in graph theory, but its incompleteness and sparsity hinder its application in various fields. Knowledge Graph Reasoning aims to alleviate these problems by deducing new knowledge or identifying false knowledge from existing knowledge. Recently, the Graph Convolution Network (GCN) based method is one of the most advanced methods to realize knowledge graph reasoning. However, it still suffers from some problems such as incomplete neighbor information aggregation and slow training speed. This paper proposes a knowledge graph reasoning model named GK for the link prediction task, which obtains better performance than existing GCN-based methods by introducing Graphormer into knowledge reasoning. The GK first proposes that nodes and their surroundings can be regarded as a hierarchical architecture that enables the model to capture more practical reasoning information to improve prediction accuracy. In addition, to accelerate the training speed of the model on the large-scale Knowledge Graph, we present a faster shortest path-finding method F-SPF in the edge coding process. Extensive experimental results show that the GK model can obtain the state-of-the-art prediction results of current GCN-based methods and can improve the training speed.

关键词： Training Knowledge engineering Knowledge graphs Predictive models Prediction algorithms Feature extraction Cognition

来源：评论

学校读者我要写书评

暂无评论

IoT data analytic algorithms on edge-cloud infrastructure:A review

引用

Digital Communications and Networks 2023年第6期9卷 1486-1515页

作者： Abel E.Edje M.S.Abd Latiff Weng Howe Chan School of Computing Faculty of EngineeringUniversiti Teknologi Malaysia81310SkudaiJohorMalaysia Department of Computer Science Delta State UniversityAbrakaP.M.B 01 AbrakaDelta StateNigeria UTM Big Data Centre Ibnu Sina Institute of Scientific and Industrial ResearchUniversiti Teknologi Malaysia81310SkudaiJohorMalaysia

The adoption of Internet of Things(IoT)sensing devices is growing rapidly due to their ability to provide realtime ***,it is constrained by limited data storage and processing *** offloads its massive data stream to edge devices and the cloud for adequate storage and *** further leads to the challenges of data outliers,data redundancies,and cloud resource load balancing that would affect the execution and outcome of data *** paper presents a review of existing analytics algorithms deployed on IoT-enabled edge cloud infrastructure that resolved the challenges of data outliers,data redundancies,and cloud resource load *** review highlights the problems solved,the results,the weaknesses of the existing algorithms,and the physical and virtual cloud storage servers for resource load *** addition,it discusses the adoption of network protocols that govern the interaction between the three-layer architecture of IoT sensing devices enabled edge cloud and its prevailing challenges.A total of 72 algorithms covering the categories of classification,regression,clustering,deep learning,and optimization have been *** classification approach has been widely adopted to solve the problem of redundant data,while clustering and optimization approaches are more used for outlier detection and cloud resource allocation.

关键词： Internet of things cloud platform Edge Analytic algorithms Processes Network communication protocols

来源：评论

学校读者我要写书评

暂无评论

Strategic priorities for transformative progress in advancing biology with proteomics and artificial intelligence

arXiv

引用

arXiv 2025年

作者： Sun, Yingying Jun, A. Liu, Zhiwei Sun, Rui Qian, Liujia Payne, Samuel H. Bittremieux, Wout Ralser, Markus Li, Chen Chen, Yi Dong, Zhen Perez-Riverol, Yasset Khan, Asif Sander, Chris Aebersold, Ruedi Vizcaíno, Juan Antonio Krieger, Jonathan R. Yao, Jianhua Wen, Han Zhang, Linfeng Zhu, Yunping Xuan, Yue Sun, Benjamin Boyang Qiao, Liang Hermjakob, Henning Tang, Haixu Gao, Huanhuan Deng, Yamin Zhong, Qing Chang, Cheng Bandeira, Nuno Li, Ming Weinan, E. Sun, Siqi Yang, Yuedong Omenn, Gilbert S. Zhang, Yue Xu, Ping Fu, Yan Liu, Xiaowen Overall, Christopher M. Wang, Yu Deutsch, Eric W. Chen, Luonan Cox, Jürgen Demichev, Vadim He, Fuchu Huang, Jiaxing Jin, Huilin Liu, Chao Li, Nan Luan, Zhongzhi Song, Jiangning Yu, Kaicheng Wan, Wanggen Wang, Tai Zhang, Kang Zhang, Le Bell, Peter A. Mann, Matthias Zhang, Bing Guo, Tiannan Affiliated Hangzhou First People’s Hospital State Key Laboratory of Medical Proteomics School of Medicine Westlake University Zhejiang Province Hangzhou China Westlake Center for Intelligent Proteomics Westlake Laboratory of Life Sciences and Biomedicine Zhejiang Province Hangzhou China Biology Department Brigham Young University ProvoUT84602 United States Department of Computer Science University of Antwerp Antwerp2020 Belgium Department of Biochemistry CharitéUniversitätsmedizin Berlin Berlin Germany Biomedicine Discovery Institute Department of Biochemistry and Molecular Biology Monash University MelbourneVICVIC 3800 Australia Wellcome Genome Campus Hinxton CambridgeCB10 1SD United Kingdom Harvard Medical School Ludwig Center at Harvard United States Harvard Medical School Broad Institute Ludwig Center at Harvard Dana-Farber Cancer Institute United States Department of Biology Institute of Molecular Systems Biology ETH Zürich Zürich Switzerland Bruker Ltd. MiltonONL9T 6P4 Canada AI for Life Sciences Lab Tencent Shenzhen518057 China State Key Laboratory of Medical Proteomics AI for Science Institute Beijing100080 China Beijing Institute of Lifeomics Beijing102206 China Thermo Fisher Scientific GmbH Hanna-Kunath Str. 11 Bremen28199 Germany Informatics and Predictive Sciences Research Bristol Myers Squibb United States Department of Chemistry Fudan University Songhu Road 2005 Shanghai200438 China Department of Computer Science Luddy School of Informatics Computing and Engineering Indiana University IN47408 United States ProCan® Children’s Medical Research Institute Faculty of Medicine and Health The University of Sydney WestmeadNSW Australia La Jolla CA United States Central China Institute of Artificial Intelligence University of Waterloo Canada AI for Science Institute Center for Machine Learning Research School of Mathematical Sciences Peking University China Research Institute of Intelligent Complex Systems Fudan U

Artificial intelligence (AI) is transforming scientific research, including proteomics. Advances in mass spectrometry (MS)-based proteomics data quality, diversity, and scale, combined with groundbreaking AI techniques, are unlocking new challenges and opportunities in biological discovery. Here, we highlight key areas where AI is driving innovation, from data analysis to new biological insights. These include developing an AI-friendly ecosystem for proteomics data generation, sharing, and analysis;improving peptide and protein identification and quantification;characterizing protein-protein interactions and protein complexes;advancing spatial and perturbation proteomics;integrating multi-omics data;and ultimately enabling AI-empowered virtual cells. © 2025, CC BY.

关键词： Biotic

来源：评论

学校读者我要写书评

暂无评论

Budgeted Persuasion on User Opinions via Varying Susceptibility

Budgeted Persuasion on User Opinions via Varying Susceptibil...

引用

IEEE International Conference on Performance, computing and Communications (IPCCC)

作者： Wenyi Tang Xinrui Xu Guangchun Luo Zaobo He Kaiming Zhan School of Computer Science and Engineering University of Electronic Science and Technology of China School of Information and Software Engineering University of Electronic Science and Technology of China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Miami University Sichuan Jiuyuan Yinhai Software Co. Ltd

ISBN: (数字)9781728198293

ISBN: (纸本)9781728198309

Nowadays, the social network becomes an indispensable part of people's daily life, meanwhile offers an unprecedentedly convenient access for purposive individuals to influence the opinions of network users. Current studies present a subtle persuasion approach that finds a number of key users meanwhile varies their susceptibility extent to impact the public opinion. Such persuasion is significantly critical for public security, as it could facilitate both the spreading and dispelling of malicious rumors. However, the major body of these studies enclose impractical assumptions, such that persuaders have an unlimited budget, or the costs of varying different users' susceptibilities are the same, thus rendering these works unsuitable for realistic scenarios. Therefore, this work originally proposes a more practical and generalized problem of persuasion, where varying the susceptibilities of different users holds different costs. The analysis of its non-convexity, non-submodularity and complexity shows that solving the proposed problem is nontrivial, thus inspiring us to provide an intuitive greedy algorithm. Furthermore, we design an accelerated algorithm based on the community property, which reduces the time consumption more than one order of magnitude. The acceleration is based on the intuition that the impact of a user within a proper community could be a good estimation of the impact in the whole network, while the computation of the former one is much more efficient. The relationship between two algorithms is fully analyzed, which shows the community-based algorithm can degenerate to the intuitive greedy algorithm under a specific setting. Finally, comprehensive evaluations on real-world datasets show the superiority of proposed algorithms on both effectiveness and efficiency.

关键词： Greedy algorithms Social networking (online) Heuristic algorithms Search problems Rendering (computer graphics) Acceleration Security

来源：评论

学校读者我要写书评

暂无评论

Relation-Guided Representation Learning

arXiv

引用

arXiv 2020年

作者： Kang, Zhao Lu, Xiao Liang, Jian Bai, Kun Xu, Zenglin School of Computer Science and Engineering University of Electronic Science and Technology of China Sichuan China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Cloud and Smart Industries Group Tencent Beijing China School of Computer Science and Technology Harbin Institute of Technology Shenzhen China Center for Artificial Intelligence Peng Cheng Lab Shenzhen China

Deep auto-encoders (DAEs) have achieved great success in learning data representations via the powerful representability of neural networks. But most DAEs only focus on the most dominant structures which are able to reconstruct the data from a latent space and neglect rich latent structural information. In this work, we propose a new representation learning method that explicitly models and leverages sample relations, which in turn is used as supervision to guide the representation learning. Different from previous work, our framework well preserves the relations between samples. Since the prediction of pairwise relations themselves is a fundamental problem, our model adaptively learns them from data. This provides much flexibility to encode real data manifold. The important role of relation and representation learning is evaluated on the clustering task. Extensive experiments on benchmark data sets demonstrate the superiority of our approach. By seeking to embed samples into subspace, we further show that our method can address the large-scale and out-of-sample problem. Our source code is publicly available at: https://***/nbShawnLu/RGRL. Copyright © 2020, The Authors. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Robust unsupervised feature selection by nonnegative sparse subspace learning

引用

Neurocomputing 2019年 334卷 156-171页

作者： Wei Zheng Hui Yan Jian Yang School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing PR China School of Computer Engineering Jinling Institute of Technology Nanjing PR China PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education and Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology Key Laboratory of Trusted Cloud Computing and Big Data Analysis Nanjing Xiaozhuang University Nanjing PR China

Sparse subspace learning has been demonstrated to be effective in data mining and machine learning. In this paper, we cast the unsupervised feature selection scenario as a matrix factorization problem from the viewpoint of sparse subspace learning. By minimizing the reconstruction residual, the learned feature weight matrix with the l 2,1 -norm and the non-negative constraints not only removes the irrelevant features, but also captures the underlying low dimensional structure of the data points. Meanwhile in order to enhance the model's robustness, l 1 -norm error function is used to resistant to outliers and sparse noise. An efficient iterative algorithm is introduced to optimize this non-convex and non-smooth objective function and the proof of its convergence is given. Although, there is a subtraction item in our multiplicative update rule, we validate its non-negativity. The superiority of our model is demonstrated by comparative experiments on various original datasets with and without malicious pollution.

关键词： Subspace learning Non-negative matrix factorization Unsupervised feature selection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：