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

arXiv 2021年

作者： Huang, Hong Song, Yu Wu, Yao Shi, Jia Xie, Xia Jin, Hai National Engineering Research Center for Big Data Technology Service Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Link prediction and node classification are two important downstream tasks of network representation learning. Existing methods have achieved acceptable results but they perform these two tasks separately, which requires a lot of duplication of work and ignores the correlations between tasks. Besides, conventional models suffer from the identical treatment of information of multiple views, thus they fail to learn robust representation for downstream tasks. To this end, we tackle link prediction and node classification problems simultaneously via multi-task multi-view learning in this paper. We first explain the feasibility and advantages of multi-task multi-view learning for these two tasks. Then we propose a novel model named as MT-MVGCN to perform link prediction and node classification tasks simultaneously. More specifically, we design a multi-view graph convolutional network to extract abundant information of multiple views in a network, which is shared by different tasks. We further apply two attention mechanisms: view attention mechanism and task attention mechanism to make views and tasks adjust the view fusion process. Moreover, view reconstruction can be introduced as an auxiliary task to boost the performance of the proposed model. Experiments on real-world network datasets demonstrate that our model is efficient yet effective, and outperforms advanced baselines in these two tasks. © 2021, CC BY.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

Grace: An Efficient Parallel SPARQL Query System over Large-Scale RDF data

Grace: An Efficient Parallel SPARQL Query System over Large-...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Xiang Kang Yuying Zhao Pingpeng Yuan Hai Jin 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 Huazhong University of Science and Technology Wuhan China

As a markup language for describing web resources, RDF is often used to represent graph data. SPARQL is a standard query language for RDF data, which is convenient in querying RDF. As RDF data grows rapidly, how to deal with complex queries over large-scale data in a reasonable time still remains many challenges. The existing RDF query systems often fail to respond within a reasonable time when dealing with complex SPARQL queries. Therefore, we propose an efficient parallel SPARQL query system and novel in three aspects. First, the proposed design provides a dynamic selectivity estimation strategy and generates an optimal query plan for parallel query processing. Second, the new design proposes a parallel processing model to maximize the parallelism of the system. Finally, chunk-based task distribution strategy is implemented to assist the parallel processing model. Based on the proposed design, we implement an efficient parallel query system (Grace). Extensive experiments on LUBM and BTC benchmarks show that Grace outperforms RDF-3X, Virtuoso, TripleBit and achieves a good performance of scalability on the number of threads.

关键词： Distribution strategy Scalability Query processing Markup languages Instruction sets Estimation Parallel processing

来源：评论

学校读者我要写书评

暂无评论

Targeted Attack against Deep Neural Networks via Flipping Limited Weight Bits

arXiv

引用

arXiv 2021年

作者： Bai, Jiawang Wu, Baoyuan Zhang, Yong Li, Yiming Li, Zhifeng Xia, Shu-Tao Tsinghua Shenzhen International Graduate School Tsinghua University China PCL Research Center of Networks and Communications Peng Cheng Laboratory China School of Data Science The Chinese University of Hong Kong Shenzhen China Secure Computing Lab of Big Data Shenzhen Research Institute of Big Data China Tencent AI Lab United States

To explore the vulnerability of deep neural networks (DNNs), many attack paradigms have been well studied, such as the poisoning-based backdoor attack in the training stage and the adversarial attack in the inference stage. In this paper, we study a novel attack paradigm, which modifies model parameters in the deployment stage for malicious purposes. Specifically, our goal is to misclassify a specific sample into a target class without any sample modification, while not significantly reduce the prediction accuracy of other samples to ensure the stealthiness. To this end, we formulate this problem as a binary integer programming (BIP), since the parameters are stored as binary bits (i.e., 0 and 1) in the memory. By utilizing the latest technique in integer programming, we equivalently reformulate this BIP problem as a continuous optimization problem, which can be effectively and efficiently solved using the alternating direction method of multipliers (ADMM) method. Consequently, the flipped critical bits can be easily determined through optimization, rather than using a heuristic strategy. Extensive experiments demonstrate the superiority of our method in attacking DNNs. The code is available at: https://***/jiawangbai/TA-LBF. Copyright © 2021, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Decentralized and Lightweight Cross-Chain Transaction Scheme Based on Proxy Re-signature

Decentralized and Lightweight Cross-Chain Transaction Scheme...

引用

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Huiying Zou Jia Duan Xi Liu Wei Ren Tao Li Xianghan Zheng Kim-Kwang Raymond Choo School of Computer Science China University of Geosciences Wuhan China The Third Surveying and Mapping Institute of Hunan Province Hunan Engineering Research Center of Geographic Information Security and Application Hunan China Key Laboratory of Data Protection and Intelligent Management Sichuan University Ministry of Education China State Key Laboratory of Geo-Information Engineering and Key Laboratory of Surveying and Mapping Science and Geospatial Information Technology of MNR CASM Beijing China College of Computer and Big Data Fuzhou University School of Information and Intelligent Engineering Sanya College China Department of Information Systems and Cyber Security University of Texas at San Antonio San Antonio USA

ISBN: (数字)9798331506209

ISBN: (纸本)9798331506216

With the widespread application of digital assets and the rapid development of blockchain technology, achieving secure and efficient transactions between different blockchain networks has become an urgent challenge. Existing cross-chain methods impose limitations, e.g., hash lock technology exhibits low scalability, side-chain technology is overly complex, and notary schemes pose centralization risks. In order to address these issues, we propose a cross-chain transaction solution based on proxy re-signature technology. To tackle the centralization concerns, we employ proxy re-signature technology to decentralize the authority of notaries among transaction participants, minimizing the potential for centralization at a low cost. We further present an extended scheme that can guarantee more requirements such as higher transaction amount and shorter transaction time. Furthermore, we analyze and compare the signature technologies used in the proposed solution and provide a systematic proof of our approach’s security.

关键词： Privacy Systematics Costs Scalability Blockchains Security

来源：评论

学校读者我要写书评

暂无评论

Text-augmented long-term relation dependency learning for knowledge graph representation

引用

High-Confidence computing 2025年

作者： Quntao Zhu Mengfan Li Yuanjun Gao Yao Wan Xuanhua Shi Hai Jin 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 Huazhong University of Science and Technology Wuhan 430074 China

Knowledge graph (KG) representation learning aims to map entities and relations into a low-dimensional representation space, showing significant potential in many tasks. Existing approaches follow two categories: (1) Graph-based approaches encode KG elements into vectors using structural score functions. (2) Text-based approaches embed text descriptions of entities and relations via pre-trained language models (PLMs), further fine-tuned with triples. We argue that graph-based approaches struggle with sparse data, while text-based approaches face challenges with complex relations. To address these limitations, we propose a unified Text-Augmented Attention-based Recurrent Network, bridging the gap between graph and natural language. Specifically, we employ a graph attention network based on local influence weights to model local structural information and utilize a PLM based prompt learning to learn textual information, enhanced by a mask-reconstruction strategy based on global influence weights and textual contrastive learning for improved robustness and generalizability. Besides, to effectively model multi-hop relations, we propose a novel semantic-depth guided path extraction algorithm and integrate cross-attention layers into recurrent neural networks to facilitate learning the long-term relation dependency and offer an adaptive attention mechanism for varied-length information. Extensive experiments demonstrate that our model exhibits superiority over existing models across KG completion and question-answering tasks.

关键词： Knowledge graph representation Graph attention network Pre-trained language model Attention-based recurrent network Masked autoencoder Contrastive learning

来源：评论

学校读者我要写书评

暂无评论

Auction Theory and Game Theory Based Pricing of Edge computing Resources: A Survey

引用

IEEE Internet of Things Journal 2025年

作者： Yu, Jiguo Liu, Shun Zou, Yifei Wang, Guijuan Hu, Chunqiang University of Electronic Science and Technology of China School of Information and Software Engineering Chengdu610054 China Qilu University of Technology Big Data Institute Jinan250353 China Qufu Normal University School of Computer Science Shandong Rizhao China Shandong University School of Computer Science and Technology Shandong Qingdao266237 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan250353 China Chongqing University School of Big Data and Software Engineering Chongqing400044 China

The proliferation of Internet of Things (IoT) devices and edge computing applications has heightened the demand for efficient resource allocation and pricing mechanisms. Effective pricing strategies play a crucial role in optimizing resource utilization, reducing latency, and ensuring fair resource distribution among users. Both auction theory and game theory have emerged as fundamental economic frameworks for designing pricing mechanisms in edge computing. This paper presents a comprehensive survey of pricing strategies that leverage both auction and game theory, systematically categorizing existing research based on auction mechanisms and game-theoretic models. Unlike previous surveys that focus solely on auction-based pricing, this work integrates game-theoretic perspectives, providing a holistic analysis of strategic interactions in edge computing resource allocation. Furthermore, we discuss key challenges, emerging trends, and future research directions aimed at enhancing efficiency, fairness, and privacy protection in cloud-edge collaborative computing environments. © 2014 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

Effects of winter weather on traffic operations and optimization of signalized intersections

引用

Journal of Traffic and Transportation Engineering(English Edition) 2019年第2期6卷 196-208页

作者： Zhengyang Lu Tae J.Kwon Liping Fu Big Data Research Center Jianghan University Department of Civil and Environmental Engineering University of Alberta Department of Civil and Environmental Engineering University of Waterloo Intelligent Transportation Systems Research Center Wuhan University of Technology

Adverse winter weather has always been a cause of traffic congestion and road *** mitigate the negative impacts of winter weather, transportation agencies are under increasing pressure to introduce weather responsive traffic management ***, most traffic signal control systems are designed for normal weather conditions and are therefore suboptimal regarding efficiency and safety for controlling traffic during winter snow events due to changes in traffic patterns and driver behaviors. The main objective of this research is to explore how to modify pre-timed traffic signal control parameters under adverse weather conditions to increase traffic efficiency and road *** research consists of two main components. First, we examine the impacts of winter weather on three key traffic parameters, i.e., saturation flow rate, start-up lost time, and free flow speed. Secondly, we investigate the potential benefits of implementing weatherspecific signal control plans for uncoordinated intersections as well as coordinated corridors. Two case studies are conducted, each with varying levels of traffic demand and winter event severity, to compare the performance of different signal plans. Evaluation results from both Synchro and VISSIM show that implementing such signal plans is most beneficial for intersection with a medium level of traffic demand. It is also found that the benefit of implementing weather-responsive plans was more compelling at a coordinatedcorridor level than at an uncoordinated-intersection level.

关键词： Signal optimization Inclement weather Traffic simulation Signal coordination

来源：评论

学校读者我要写书评

暂无评论

Optimal Quantum State Tomography via Weak Value

arXiv

引用

arXiv 2024年

作者： Zhu, Xuanmin Zhang, Dezheng Gao, Runping Wei, Qun Liu, Lixia Luo, Zijiang Center for Quantum Information School of Information Guizhou University of Finance and Economics Guizhou Guiyang550025 China International Joint Research Center for Data Science and High-Performance Computing School of Information Guizhou University of Finance and Economics Guizhou Guiyang550025 China School of Physics and Optoelectronic Engineering Xidian University Xi’an710071 China School of Mathematics and Statistics Xidian University Xi’an710071 China Institute of Intelligent Manufacturing Shunde Polytechnic Guangdong Shunde 528300 China

To improve the efficiency of the state tomography strategy via weak value, we have searched the optimal coupling strength between the system and measuring device. For an arbitrary d-dimensional quantum system, the optimal strengths being used in measuring the real and imaginary parts of the density matrix are obtained. The optimal efficiency of the state tomography has also been studied by using mean square error. The minimal mean square errors in the reconstructed density matrices have been derived. The state tomography strategy studied in this article may be useful in the measurement of the unknown quantum states. Copyright © 2024, The Authors. All rights reserved.

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

PD-SDF: Dynamic Surface Reconstruction Based on Plane Decomposition for Single View RGB-D Videos

PD-SDF: Dynamic Surface Reconstruction Based on Plane Decomp...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Jinwen Li Weixing Xie Junfeng Yao Shaoqi Wu Youhong Peng Mengyuan Ge Xiao Dong Center for Digital Media Computing School of Film School of Informatics Xiamen University National Institute for Data Science in Health and Medicine Xiamen University Key Laboratory of Digital Protection and Intelligent Processing of Intangible Cultural Heritage of Fujian and Taiwan Ministry of Culture and Tourism Jiujiang Research Institute of Xiamen University Jiujiang China Guangdong Provincial/Zhuhai Key Laboratory of IRADS BNU-HKBU United International College Zhuhai China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Surface reconstruction of dynamic scenes from single view videos is a challenging task due to the highly ill-posed and under-constrained nature. Existing single view reconstruction methods suffer from severe quality issues, such as surface distortion and mesh adherison. In this paper, we propose an efficient dynamic representation network, PD-SDF, which consists of a 4D motion field and a 3D geometry field. The explicit disentanglement of motion and geometry based on planar factorization guarantees the mesh consistency across frames. Specifically, to address the mesh adhesion problem, we design a depth-guided sampling strategy to focus on optimizing the SDF field near the object surface. Due to insufficient geometric cues, we design various regularization strategies to constrain smoothness and topological correcness of the scene geometry. Extensive experiments show that our method outperforms existing methods in both appearance and geometry reconstruction. The project page: https://***/

关键词： Geometry Training Surface reconstruction Three-dimensional displays Noise Reconstruction algorithms Stability analysis Speech processing Surface treatment Videos

来源：评论

学校读者我要写书评

暂无评论

A Multi-Stage Deep Learning Pipeline for Crack Detection and Segmentation in High-Speed Rail Brake Discs

A Multi-Stage Deep Learning Pipeline for Crack Detection and...

引用

Consumer Technology (ICCT-Pacific), International Conference on

作者： Ching-Heng Cheng Yu-Fan Lin Chia-Ming Lee Chih-Chung Hsu Yu-Lin Shih Ting Chin Department of Statistics Institute of Data Science National Cheng Kung Univ. Tainan Taiwan Department of Intelligent Technology Systems Institute of Miin Wu School of Computing National Cheng Kung Univ Tainan Taiwan Institute of Intelligent Systems College of Artificial Intelligence National Yang Ming Chiao Tung Univ. Hsinchu Taiwan Innovation Logistics System Technology Dept. Smart Logistics & Supply Chain Integration Service Division Service Systems Technology Center Industrial Technology Research Institute Hsinchu Taiwan

ISBN: (数字)9798331504120

ISBN: (纸本)9798331504137

The braking system of high-speed rail (HSR) is critical for passenger safety, but prolonged use of brake discs can lead to cracks, posing significant risks. Traditional manual inspection methods are time-consuming and labor-intensive. To address these challenges, we propose a multi-stage crack detection and segmentation system, a cascade mode to progressively identify cracks, leveraging deep learning techniques. The system includes automated circle detection, region cropping, and crack detection and segmentation to accurately identify cracks. Using a real-world dataset collected from HSR brake discs, our approach significantly improves data preprocessing efficiency and model performance. Furthermore, we evaluate the performance on un-seen data and compare our crack detection framework with other deep learning models. The experimental results demonstrate the system's effectiveness which is superior to other deep learning models, highlighting its potential for real-world deployment in HSR maintenance.

关键词： Deep learning Image segmentation Motion segmentation Computational modeling Pipelines Rail transportation data models Maintenance Safety Brakes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：