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

International Conference on data engineering

作者： Kangzheng Liu Feng Zhao Guandong Xu Xianzhi Wang 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 Data Science and Machine Intelligence Lab University of Technology Sydney Sydney Australia

Temporal knowledge graph (TKG) extrapolation aims to predict future unknown events (facts) based on historical information, and has attracted considerable attention due to its great practical significance. Accurate representations (embeddings) of entities and relations form the basis of TKG extrapolation. Recent work has been devoted to improving the rationality of entity representations. However, on the one hand, ignoring relation modeling results in incomplete relation representations; therefore, some approaches aggregate only immediately adjacent entities of relations, but this can lead to the "message islands" problem of relation modeling. On the other hand, ignoring the association constraints between relations and entities can make the embeddings of both relations and entities prone to overfitting. To address the abovementioned challenges, we propose an advanced method, namely, RETIA. For the former issue, we generate twin hyperrelation subgraphs for each historical subgraph and then aggregate both the adjacent entities and relations in the hyperrelation subgraphs through a graph convolutional network (GCN). About the latter concern, we propose a twin-interact module (TIM), which provides communication channels for relation aggregation and entity aggregation during the evolution of the historical sequence. Experiments conducted on five public datasets show that RETIA has made great improvements across several evaluation metrics. Our released code is available at https://***/CGCL-codes/RETIA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An auto code generator for stencil on SW26010 21

An auto code generator for stencil on SW26010

引用

21st IEEE International Conference on High Performance computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on data Science and systems, HPCC/SmartCity/DSS 2019

作者： Zhu, Xiaomin Zeng, Yunhui Wei, Yanjie Feng, Shengzhong Liu, Weiguo Balaji, Pavan Joint Engineering Research Center Health Big Data Intelligent Analysis Technology Center for High Performance Computing Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen China Shandong Computer Science Center National SuperComputer Center in Jinan Jinan China Sclool of Software Shandong University Jinan China Argonne National Laboratory United States

ISBN: (纸本)9781728120584

Stencil is a basic building block widely used in many HPC areas and applications. It generally dominates the time cost and is critical to the overall performance. Given that heterogeneous many-core is frequently adopted to build super computers, porting and optimizing stencil codes on modern accelerator-based architectures is important. Porting is non-trivial, and optimization is more difficult as it requires better understanding of the underlying architecture. As a result, auto tuning targeting on accelerators such as GPU becomes a hot research topic. In this paper, we focus on tuning stencil automatically on SW26010, which is a heterogeneous many-core CPU equipped in Sunway TaihuLight SuperComputer, and mainly work on 2D stencil variants code in ROMS (Regional Ocean Modeling system). The code generator can generate codes running on slave cores for 50+ different FORTRAN stencil-alike loops in ROMS in seconds, and optimization methods are integrated into the generator as well. The performance is better than the directive based method (OpenACC) and the hand-drafted code by a junior programmer, and it is comparable compared with the code written by a senior programmer with several years of programming experience. © 2019 IEEE.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Sharing Economy in Local Energy Markets

引用

Journal of Modern Power systems and Clean Energy 2023年第3期11卷 714-726页

作者： Zhaoyuan Wu Jianxiao Wang Haiwang Zhong Feng Gao Tianjiao Pu Chin-Woo Tan Xiupeng Chen Gengyin Li Huiru Zhao Ming Zhou Qing Xia School of Economics and Management North China Electric Power UniversityBeijing 102206China State Key Laboratory of Alternate Electrical Power System with Renewable Energy Sources North China Electric Power UniversityBeijing 102206China National Engineering Laboratory for Big Data Analysis and Applications Peking UniversityBeijing 100871China State Key Lab of Power Systems Department of Electrical EngineeringTsinghua UniversityBeijing 100084China Department of Industrial Engineering and Management College of EngineeringPeking UniversityBeijing 100871China China Electric Power Research Institute Beijing 100192China Department of Civil and Environmental Engineering Stanford UniversityPalo AltoCA 94305USA Engineering and Technology Institute Groningen University of Groningen9742 AG Groningenthe Netherlands

With an increase in the electrification of end-use sectors,various resources on the demand side provide great flexibility potential for system operation,which also leads to problems such as the strong randomness of power consumption behavior,the low utilization rate of flexible resources,and difficulties in cost *** the core idea of“access over ownership”,the concept of the sharing economy has gained substantial popularity in the local energy market in recent ***,we provide an overview of the potential market design for the sharing economy in local energy markets(LEMs)and conduct a detailed review of research related to local energy sharing,enabling technologies,and potential *** paper can provide a useful reference and insights for the activation of demand-side flexibility ***,this paper can also provide novel insights into the development and further integration of the sharing economy in LEMs.

关键词： Energy sharing flexibility potential local energy market information and communication technology sharing economy

来源：评论

学校读者我要写书评

暂无评论

A Locality-Aware Energy-Efficient Accelerator for Graph Mining Applications

A Locality-Aware Energy-Efficient Accelerator for Graph Mini...

引用

IEEE/ACM International Symposium on Microarchitecture (MICRO)

作者： Pengcheng Yao Long Zheng Zhen Zeng Yu Huang Chuangyi Gui Xiaofei Liao Hai Jin Jingling Xue 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 School of Computer Science and Engineering UNSW Sydney Australia

ISBN: (数字)9781728173832

ISBN: (纸本)9781728173849

Graph mining is becoming increasingly important due to the ever-increasing demands on analyzing complex structures in graphs. Existing graph accelerators typically hold most of the randomly-accessed data in an on-chip memory to avoid off-chip communications. However, graph mining exhibits substantial random accesses from not only vertex dimension but also edge dimension (with the latter being excessively more complex than the former), leading to significant degradations in terms of both performance and energy *** observe that the most random memory requests arising in graph mining come from accessing a small fraction of valuable (vertex and edge) data when handling real-world graphs. To exploit this extension locality with maximum parallelism, we architect GRAMER, the first graph mining accelerator. GRAMER contains a specialized memory hierarchy, where the valuable data (precisely identified through a cost-efficient heuristic) is permanently resident in a high-priority memory while others are maintained in a cache-like memory under a lightweight replacement policy. The specific pipelined processing units are carefully designed to maximize computational parallelism. GRAMER is also equipped with a work-stealing mechanism to reduce load imbalance. We have implemented GRAMER on a Xilinx Alveo U250 accelerator card. Compared with two state-of-the-art CPU-based graph mining systems, Fractal and RStream, running on a 14-core Intel E5-2680 v4 processor, GRAMER achieves not only considerable speedups (1.11 × ~ 129.95 ) but also significant energy savings (5.79 × ~ 678.34×)

关键词： Memory management Parallel processing Feature extraction Energy efficiency Fractals system-on-chip data mining

来源：评论

学校读者我要写书评

暂无评论

UniTSFace: unified threshold integrated sample-to-sample loss for face recognition 23

UniTSFace: unified threshold integrated sample-to-sample los...

引用

Proceedings of the 37th International Conference on Neural Information Processing systems

作者： Qiufu Li Xi Jia Jiancan Zhou Linlin Shen Jinming Duan National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China and Computer Vision Institute Shenzhen University China and SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China and Computer Vision Institute Shenzhen University China and School of Computer Science University of Birmingham UK National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China and Computer Vision Institute Shenzhen University China and Aqara Lumi United Technology Co. Ltd China School of Computer Science University of Birmingham UK and Alan Turing Institute UK

Sample-to-class-based face recognition models can not fully explore the cross-sample relationship among large amounts of facial images, while sample-to-sample-based models require sophisticated pairing processes for training. Furthermore, neither method satisfies the requirements of real-world face verification applications, which expect a unified threshold separating positive from negative facial pairs. In this paper, we propose a unified threshold integrated sample-to-sample based loss (USS loss), which features an explicit unified threshold for distinguishing positive from negative pairs. Inspired by our USS loss, we also derive the sample-to-sample based softmax and BCE losses, and discuss their relationship. Extensive evaluation on multiple benchmark datasets, including MFR, IJB-C, LFW, CFP-FP, AgeDB, and MegaFace, demonstrates that the proposed USS loss is highly efficient and can work seamlessly with sample-to-class-based losses. The embedded loss (USS and sample-to-class Softmax loss) overcomes the pitfalls of previous approaches and the trained facial model UniTSFace exhibits exceptional performance, outperforming state-of-the-art methods, such as CosFace, ArcFace, VPL, AnchorFace, and UNPG. Our code is available at https://***/CVI-SZU/UniTSFace.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Temporal Knowledge Graph Reasoning via Time-Distributed Representation Learning

Temporal Knowledge Graph Reasoning via Time-Distributed Repr...

引用

IEEE International Conference on data Mining (ICDM)

Temporal knowledge graph (TKG) reasoning has attracted significant attention. Recent approaches for modeling historical information have led to great advances. However, the problems of time variability and unseen entities have become two major obstacles preventing further development. The time variability problem means that different historical timestamps play different roles in the inference process. Furthermore, in the context of time variability, the unseen entity problem means that a query cannot obtain a predicted entity that is unseen in the scale-varying history rather than in a fixed set, thus turning from static to dynamic. In this paper, we propose a novel method named DHU-NET for addressing the time variability challenge and the dynamic unseen entity challenge derived from it. With regard to the former concern, we propose a time-distributed representation learning method based on a graph convolutional network(GCN) and a self-attention mechanism, which learns the distributed representations of facts at different historical timestamps and comprehensively pays different levels of attention to the different timestamps. With regard to the latter issue, we extract the unseen entities from a global static KG based on a copy mechanism and bring them into consideration during the final prediction step. Experiments on six benchmark datasets demonstrate the substantial improvements achieved by DHUNET in terms of multiple evaluation metrics. Our released codes are available at https://***/CGCL-codes/DHUNET.

关键词： Representation learning Measurement Knowledge engineering Predictive models Turning Cognition data models

来源：评论

学校读者我要写书评

暂无评论

Shattered chain of trust: understanding security risks in cross-cloud IoT access delegation 20

Shattered chain of trust: understanding security risks in cr...

引用

Proceedings of the 29th USENIX Conference on Security Symposium

作者： Bin Yuan Yan Jia Luyi Xing Dongfang Zhao XiaoFeng Wang Deqing Zou Hai Jin Yuqing Zhang School of Cyber Science and Engineering Huazhong Univ. of Sci. & Tech. China and National Engineering Research Center for Big Data Technology and System Cluster and Grid Computing Lab Services Computing Technology and System Lab and Big Data Security Engineering Research Center and Indiana University Bloomington and Shenzhen Huazhong University of Science and Technology Research Institute China School of Cyber Engineering Xidian University China and National Computer Network Intrusion Protection Center University of Chinese Academy of Sciences China and Indiana University Bloomington Indiana University Bloomington School of Cyber Science and Engineering Huazhong Univ. of Sci. & Tech. China and National Engineering Research Center for Big Data Technology and System Cluster and Grid Computing Lab Services Computing Technology and System Lab and Big Data Security Engineering Research Center School of Computer Science and Technology Huazhong Univ. of Sci. & Tech. China and National Engineering Research Center for Big Data Technology and System Cluster and Grid Computing Lab Services Computing Technology and System Lab and Big Data Security Engineering Research Center Huazhong Univ. of Sci. & Tech. China National Computer Network Intrusion Protection Center University of Chinese Academy of Sciences China and School of Cyber Engineering Xidian University China

ISBN: (纸本)9781939133175

IoT clouds facilitate the communication between IoT devices and users, and authorize users' access to their devices. In this paradigm, an IoT device is usually managed under a particular IoT cloud designated by the device vendor, e.g., Philips bulbs are managed under Philips Hue cloud. Today's mainstream IoT clouds also support device access delegation across different vendors (e.g., Philips Hue, LIFX, etc.) and cloud providers (e.g., Google, IFTTT, etc.): for example, Philips Hue and SmartThings clouds support to delegate device access to another cloud such as Google Home, so a user can manage multiple devices from different vendors all through Google Home. Serving this purpose are the IoT delegation mechanisms developed and utilized by IoT clouds, which we found are heterogeneous and ad-hoc in the wild, in the absence of a standardized delegation protocol suited for IoT environments. In this paper, we report the first systematic study on real-world IoT access delegation, based upon a semi-automatic verification tool we developed. Our study brought to light the pervasiveness of security risks in these delegation mechanisms, allowing the adversary (e.g., Airbnb tenants, former employees) to gain unauthorized access to the victim's devices (e.g., smart locks) or impersonate the devices to trigger other devices. We confirmed the presence of critical security flaws in these mechanisms through end-to-end exploits on them, and further conducted a measurement study. Our research demonstrates the serious consequences of these exploits and the security implications of the practice today for building these mechanisms. We reported our findings to related parties, which acknowledged the problems. We further propose principles for developing more secure cross-cloud IoT delegation services, before a standardized solution can be widely deployed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Spatio-Temporal AU Relational Graph Representation Learning For Facial Action Units Detection

arXiv

引用

arXiv 2023年

作者： Wang, Zihan Song, Siyang Luo, Cheng Zhou, Yuzhi Wu, Shiling Xie, Weicheng Shen, Linlin Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China School of Computing and Mathematical Sciences University of Leicester United Kingdom

This paper presents our Facial Action Units (AUs) detection submission to the fifth Affective Behavior Analysis in-the-wild Competition (ABAW). Our approach consists of three main modules: (i) a pre-trained facial representation encoder which produce a strong facial representation from each input face image in the input sequence;(ii) an AU-specific feature generator that specifically learns a set of AU features from each facial representation;and (iii) a spatio-temporal graph learning module that constructs a spatio-temporal graph representation. This graph representation describes AUs contained in all frames and predicts the occurrence of each AU based on both the modeled spatial information within the corresponding face and the learned temporal dynamics among frames. The experimental results show that our approach outperformed the baseline and the spatio-temporal graph representation learning allows our model to generate the best results among all ablated systems. Our model ranks at the 4th place in the AU recognition track at the 5th ABAW Competition. Our code is publicly available at https://***/wzh125/ABAW-5 .MSC Codes 68T40 Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Modeling Distributed Stream Processing systems Under Heavy Workload

Modeling Distributed Stream Processing Systems Under Heavy W...

引用

International Conference on Cyberworlds

作者： Muhammad Mudassar Qureshi Hanhua Chen Hai Jin Huazhong University of Science and Technology Wuhan China National Engineering Research Center for Big Data Technology and System Cluster and Grid Computing Lab Services Computing Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

big data applications play a significant role in diverse fields. Distributed Stream Processing Engines (DSPEs) are widely used to support real time applications efficiently. Partitioning algorithms are used to partition data streams into multiple nodes to process in parallel to gain efficient performance. Aggregation cost is an important factor when process stateful streaming applications using such partitioning algorithms because it plays an important role on performance when final result is being produced in stateful streaming applications. However, impact of aggregation cost in stream processing is not discussed comprehensively in existing literature. We use performance modeling to identify the importance of aggregation cost when workload is high. We implement performance model on a multi-node cluster to predict the same behavior as on single resource performance model. We demonstrate that stateful streaming applications need more resources as compare to stateless applications when workload is high and both stateful and stateless applications are running in the same DSPE. Experiments results show that a stateful streaming application needs more resources compared to a stateless streaming application when both applications are running on the same DSPE when the workload is high. Further experiment results show that the performance modeling may be helpful to predict maximum workload that can be process on a DSPE and increase in parallelism level is not guaranteed to increase the performance of streaming applications.

关键词： Partitioning algorithms data models Predictive models Heuristic algorithms big data applications Throughput

来源：评论

学校读者我要写书评

暂无评论

FusionANNS: An Efficient CPU/GPU Cooperative Processing Architecture for Billion-scale Approximate Nearest Neighbor Search

arXiv

引用

arXiv 2024年

作者： Tian, Bing Liu, Haikun Tang, Yuhang Xiao, Shihai Duan, Zhuohui Liao, Xiaofei Zhang, Xuecang Zhu, Junhua Zhang, Yu National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Huawei Technologies Co. Ltd China

Approximate nearest neighbor search (ANNS) has emerged as a crucial component of database and AI infrastructure Ever-increasing vector datasets pose significant challenges in terms of performance, cost, and accuracy for ANNS services None of modern ANNS systems can address these issues simultaneously. We present FusionANNS, a high-throughput, low-latency cost-efficient, and high-accuracy ANNS system for billion scale datasets using SSDs and only one entry-level GPU The key idea of FusionANNS lies in CPU/GPU collabo rative filtering and re-ranking mechanisms, which signifi cantly reduce I/O operations across CPUs, GPU, and SSDs to break through the I/O performance bottleneck. Specifically we propose three novel designs: (1) multi-tiered indexing to avoid data swapping between CPUs and GPU, (2) heuristic re-ranking to eliminate unnecessary I/Os and computations while guaranteeing high accuracy, and (3) redundant-aware I/O deduplication to further improve I/O efficiency. We imple ment FusionANNS and compare it with the state-of-the-art SSD-based ANNS system–SPANN and GPU-accelerated in memory ANNS system–RUMMY. Experimental results show that FusionANNS achieves 1) 9.4-13.1× higher query per second (QPS) and 5.7-8.8× higher cost efficiency compared with SPANN;2) and 2-4.9× higher QPS and 2.3-6.8× higher cost efficiency compared with RUMMY, while guaranteeing low latency and high accuracy. Copyright © 2024, The Authors. All rights reserved.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：