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

21st IEEE International Symposium on Parallel and Distributed Processing with Applications, 13th IEEE International Conference on Big data and Cloud computing, 16th IEEE International Conference on Social computing and networking and 13th International Conference on Sustainable computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Zhang, Yazhi Luo, Chuanwen Wang, Guijuan Zhang, Li Lv, Mengjie Yu, Jiguo Qilu University of Technology School of Computer Science and Technology Jinan China Beijing Forestry University School of Information Science and Technology Beijing China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China Nanjing University of Posts and Telecommunications College of Computer Nanjing China Qilu University of Technology Shandong Academy of Sciences Big Data Research Institute Jinan China

ISBN: (纸本)9798350329223

With the increasing amount of computation in high-performance computing, the scale of interconnection networks is becoming larger and larger. It is inevitable that processors or links in the network become faulty. Therefore, it is very important for a processor to understand the security status of itself and neighbors, and then adaptively and reliably communicate. However, the existing security information models consider faulty processors or faulty links separately, and do not consider the situation where both processors and links fail simultaneously. The Exchanged Hypercube is an excellent interconnection network structure which achieves a balance between network functionality and hardware overhead while preserving many excellent properties of the Hypercube. In this paper, we propose an adaptive fault-tolerant routing algorithm of the Exchanged Hypercube based on an improved local security information model, which considers the faulty processors and faulty links simultaneously. This algorithm always can select suitable processors for routing based on the local security information and unsafe coefficients of processors, which greatly reduces the impact of the faulty of networks. The adaptive fault-tolerant routing algorithm of the Exchanged Hypercube network is not only suitable for regular networks but also for heterogeneous networks since the Exchanged Hypercube is a semi regular network. Sufficient experimental results show that the algorithm proposed in this paper has a lower packet loss rate, a higher success rate, and a shorter average path length. © 2023 IEEE.

关键词： Hypercube networks

来源：评论

学校读者我要写书评

暂无评论

A small-footprint accelerator for large-scale neural networks

A small-footprint accelerator for large-scale neural network...

引用

作者： Chen, Tianshi Zhang, Shijin Liu, Shaoli Du, Zidong Luo, Tao Gao, Yuan Liu, Junjie Wang, Dongsheng Wu, Chengyong Sun, Ninghui Chen, Yunji Temam, Olivier State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China TNLIST Tsinghua University Beijing100084 China Inria Saclay France CAS Center for Excellence in Brain Science China

Machine-learning tasks are becoming pervasive in a broad range of domains, and in a broad range of systems (from embedded systems to data centers). At the same time, a small set of machine-learning algorithms (especially Convolutional and Deep Neural networks, i.e., CNNs and DNNs) are proving to be state-of-theart across many applications. As architectures evolve toward heterogeneous multicores composed of a mix of cores and accelerators, a machine-learning accelerator can achieve the rare combination of efficiency (due to the small number of target algorithms) and broad application scope. Until now, most machine-learning accelerator designs have been focusing on efficiently implementing the computational part of the algorithms. However, recent state-of-the-art CNNs and DNNs are characterized by their large size. In this study, we design an accelerator for large-scale CNNs and DNNs, with a special emphasis on the impact of memory on accelerator design, performance, and energy. We show that it is possible to design an accelerator with a high throughput, capable of performing 452 GOP/s (key NN operations such as synaptic weight multiplications and neurons outputs additions) in a small footprint of 3.02mm2 and 485mW;compared to a 128-bit 2GHz SIMD processor, the accelerator is 117.87?faster, and it can reduce the total energy by 21.08×. The accelerator characteristics are obtained after layout at 65nm. Such a high throughput in a small footprint can open up the usage of state-of-the-art machine-learning algorithms in a broad set of systems and for a broad set of applications. © 2015 ACM.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Transformation driven visual reasoning

arXiv

引用

arXiv 2020年

作者： Hong, Xin Lan, Yanyan Pang, Liang Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Institute for AI Industry Research Tsinghua University Beijing China

This paper defines a new visual reasoning paradigm by introducing an important factor, i.e. transformation. The motivation comes from the fact that most existing visual reasoning tasks, such as CLEVR in VQA, are solely defined to test how well the machine understands the concepts and relations within static settings, like one image. We argue that this kind of state driven visual reasoning approach has limitations in reflecting whether the machine has the ability to infer the dynamics between different states, which has been shown as important as state-level reasoning for human cognition in Piaget’s theory. To tackle this problem, we propose a novel transformation driven visual reasoning task. Given both the initial and final states, the target is to infer the corresponding single-step or multi-step transformation, represented as a triplet (object, attribute, value) or a sequence of triplets, respectively. Following this definition, a new dataset namely TRANCE is constructed on the basis of CLEVR, including three levels of settings, i.e. Basic (single-step transformation), Event (multi-step transformation), and View (multi-step transformation with variant views). Experimental results show that the state-of-the-art visual reasoning models perform well on Basic, but are still far from human-level intelligence on Event and View. We believe the proposed new paradigm will boost the development of machine visual reasoning. More advanced methods and real data need to be investigated in this direction. The resource of TVR is available at https://***/TVR. Copyright © 2020, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

A compound fault diagnosis method based on Multi-task Learning with Multi-gate Mixture-of-Experts 14

A compound fault diagnosis method based on Multi-task Learni...

引用

14th International Conference on Measuring technology and Mechatronics Automation, ICMTMA 2022

作者： Chen, Yanping Ren, Lele Xia, Hong Wang, Zhongmin Gao, Cong Wang, Fengwei School of Computer Science and Technology Xi'an University of Posts and Telecommunications Shaanxi Xi'an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Shaanxi Xi'an710121 China Xi'an Key Laboratory of Big Data and Intelligent Computing Shaanxi Xi'an710121 China ZTE Corporation No.55 Hi-techRoadSouth Shenzhen518057 China

ISBN: (纸本)9781665499781

At present, the research object of fault diagnosis focuses on single fault diagnosis. This method of diagnosis does not consider the relationship between mechanical equipment faults, and cannot fully identify the type of fault. In the actual industrial process, mechanical equipment is mostly complex system, and compound fault diagnosis is more in line with industrial needs. In order to solve the problem of compound fault diagnosis of mechanical equipment and improve the accuracy of fault identification, this paper establishes a compound fault diagnosis model for gearbox by means of multi-task learning, uses multi-gated networks to extract features from the task sharing layer, and finally classifies the fault through the task specific *** experimental results show that, the compound fault diagnosis method based on Multi-task Learning with Multi-gate Mixture-of-Experts (ML-MMoE) can accurately identify compound fault types under different working conditions. © 2022 IEEE

关键词： Failure analysis

来源：评论

学校读者我要写书评

暂无评论

Match-ignition: Plugging PageRank into transformer for long-form text matching

arXiv

引用

arXiv 2021年

作者： Pang, Liang Lan, Yanyan Cheng, Xueqi Data Intelligence System Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing China Institute for AI Industry Research Tsinghua University Beijing China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

Neural text matching models have been widely used in community question answering, information retrieval, and dialogue. However, these models designed for short texts cannot well address the long-form text matching problem, because there are many contexts in long-form texts can not be directly aligned with each other, and it is difficult for existing models to capture the key matching signals from such noisy data. Besides, these models are computationally expensive for simply use all textual data indiscriminately. To tackle the effectiveness and efficiency problem, we propose a novel hierarchical noise filtering model, namely Match-Ignition. The main idea is to plug the well-known PageRank algorithm into the Transformer, to identify and filter both sentence and word level noisy information in the matching process. Noisy sentences are usually easy to detect because previous work has shown that their similarity can be explicitly evaluated by the word overlapping, so we directly use PageRank to filter such information based on a sentence similarity graph. Unlike sentences, words rely on their contexts to express concrete meanings, so we propose to jointly learn the filtering and matching process, to well capture the critical word-level matching signals. Specifically, a word graph is first built based on the attention scores in each self-attention block of Transformer, and key words are then selected by applying PageRank on this graph. In this way, noisy words will be filtered out layer by layer in the matching process. Experimental results show that Match-Ignition outperforms both SOTA short text matching models and recent long-form text matching models. We also conduct detailed analysis to show that Match-Ignition efficiently captures important sentences and words, to facilitate the long-form text matching process. © 2021, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Reconstruction Algorithm of Heterogeneous network data Flow in Smart Factory Based on SDN 14

Reconstruction Algorithm of Heterogeneous Network Data Flow ...

引用

14th International Conference on Measuring technology and Mechatronics Automation, ICMTMA 2022

作者： Chen, Yanping Peng, Jiajia Xia, Hong Wang, Zhongmin Gao, Cong Wang, Fengwei School of Computer Science and Technology Xi'an University of Posts and Telecommunications Shaanxi Xi'an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Shaanxi Xi'an710121 China Xi'an Key Laboratory of Big Data and Intelligent Computing Shaanxi Xi'an710121 China ZTE Corporation No.55 Hi-techRoadSouth Shenzhen518057 China

ISBN: (纸本)9781665499781

In smart factories, the wide application of a variety of intelligent manufacturing devices and advanced sensors leads to the increasing demand for data exchange between different devices. In order to realize the flexible forwarding of multi-source manufacturing data in heterogeneous networks and the optimal utilization of network resources, in this article, we combined smartphone manufacturing scenarios, referred to the data flow reconstruction algorithm in related documents, analyzed the high dynamics of the data flow and proposed a data flow reconstruction algorithm based on routing-protocol, according to the particularity of different data forwarding and processing procedures, redesigned and defined the data flow in the scene. Finally, the results of Mininet simulation experiments showed that our proposed algorithm reduces the average transmission delay. © 2022 IEEE

关键词： Heterogeneous networks

来源：评论

学校读者我要写书评

暂无评论

A Novel Configurable High-precision and Low-cost Circuit Design of Sigmoid and Tanh Activation Function

A Novel Configurable High-precision and Low-cost Circuit Des...

引用

2021 IEEE International Conference on Integrated Circuits, Technologies and Applications, ICTA 2021

作者： Liu, Feng Zhang, Bowen Chen, Gang Gong, Guoliang Lu, Huaxiang Li, Wenchang Chinese Academy of Sciences Institute of Semiconductors Beijing100083 China University of Chinese Academy of Sciences Beijing100089 China Center for Excellence in Brain Science and Intelligence Technology CAS Shanghai200031 China Semiconductor Neural Network Intelligent Perception and Computing Technology Beijing Key Lab Beijing100083 China

ISBN: (纸本)9781665417471

This paper proposes a configurable Sigmoid and Tanh activation function circuit design by second-order approximation and deviation compensation. The proposed circuit is synthesized in TSMC 180nm technology within a 7218 um2 area at 500MHz, it is also deployed on Xilinx ZC706 FPGA by 158 LUTs and 46 FFs at 333MHz. It achieves almost 4.68× better precision and 20.2% less area than previous works. The experimental results show that our method has almost no accuracy loss on LSTM Chinese speech recognition tasks and the YOLOv3 image recognition post-processing task. © 2021 IEEE.

关键词： Chemical activation

来源：评论

学校读者我要写书评

暂无评论

SetRank: Learning a permutation-invariant ranking model for information retrieval

arXiv

引用

arXiv 2019年

作者： Pang, Liang Xu, Jun Ai, Qingyao Lan, Yanyan Cheng, Xueqi Wen, Jirong CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China Renmin University of China Beijing China University of Utah United States

In learning-to-rank for information retrieval, a ranking model is automatically learned from the data and then utilized to rank the sets of retrieved documents. Therefore, an ideal ranking model would be a mapping from a document set to a permutation on the set, and should satisfy two critical requirements: (1) it should have the ability to model cross-document interactions so as to capture local context information in a query;(2) it should be permutation-invariant, which means that any permutation of the inputted documents would not change the output ranking. Previous studies on learning-to-rank either design uni-variate scoring functions that score each document separately, and thus failed to model the cross-document interactions;or construct multivariate scoring functions that score documents sequentially, which inevitably sacrifice the permutation invariance requirement. In this paper, we propose a neural learning-to-rank model called SetRank which directly learns a permutation-invariant ranking model defined on document sets of any size. SetRank employs a stack of (induced) multi-head self attention blocks as its key component for learning the embeddings for all of the retrieved documents jointly. The self-attention mechanism not only helps SetRank to capture the local context information from cross-document interactions, but also to learn permutation-equivariant representations for the inputted documents, which therefore achieving a permutation-invariant ranking model. Experimental results on three large scale benchmarks showed that the SetRank significantly outperformed the baselines include the traditional learning-to-rank models and state-of-the-art Neural IR models. Copyright © 2019, The Authors. All rights reserved.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Cake cutting on graphs: A discrete and bounded proportional protocol

arXiv

引用

arXiv 2019年

作者： Bei, Xiaohui Sun, Xiaoming Wu, Hao Zhang, Jialin Zhang, Zhijie Zi, Wei School of Physical and Mathematical Sciences Nanyang Technological University CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences

The classical cake cutting problem studies how to find fair allocations of a heterogeneous and divisible resource among multiple agents. Two of the most commonly studied fairness concepts in cake cutting are proportionality and envy-freeness. It is well known that a proportional allocation among n agents can be found efficiently via simple protocols [16]. For envy-freeness, in a recent breakthrough, Aziz and Mackenzie [5] proposed a discrete and bounded envy-free protocol for any number of players. However, the protocol suffers from high multiple-exponential query complexity and it remains open to find simpler and more efficient envy-free protocols. In this paper we consider a variation of the cake cutting problem by assuming an underlying graph over the agents whose edges describe their acquaintance relationships, and agents evaluate their shares relatively to those of their neighbors. An allocation is called locally proportional if each agent thinks she receives at least the average value over her neighbors. Local proportionality generalizes proportionality and is in an interesting middle ground between proportionality and envy-freeness: its existence is guaranteed by that of an envy-free allocation, but no simple protocol is known to produce such a locally proportional allocation for general graphs. Previous works showed locally proportional protocols for special classes of graphs, and it is listed in both [1] and [8] as an open question to design simple locally proportional protocols for more general classes of graphs. In this paper we completely resolved this open question by presenting a discrete and bounded locally proportional protocol for any given graph. Our protocol has a query complexity of only single exponential, which is significantly smaller than the six towers of n query complexity of the envy-free protocol given in [5]. Copyright © 2019, The Authors. All rights reserved.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Multi-graph Convolution network with Jump Connection for Event Detection

Multi-graph Convolution Network with Jump Connection for Eve...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Xiangbin Meng Pengfei Wang Haoran Yan Liutong Xu Jiafeng Guo Yixing Fan School of Computer Science Beijing University of Posts and Telecommunications Beijing China Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

Event detection is an important information extraction task in nature language processing. Recently, the method based on syntactic information and graph convolution network has been wildly used in event detection task and achieved good performance. For event detection, graph convolution network (GCN) based on dependency arcs can capture the sentence syntactic representations and the syntactic information, which is from candidate triggers to arguments. However, existing methods based on GCN with dependency arcs suffer from imbalance and redundant information in graph. To capture important and refined information in graph, we propose Multi-graph Convolution network with Jump Connection (MGJ-ED). The multi-graph convolution network module adds a core subgraph splitted from dependency graph which selects important one-hop neighbors' syntactic information in breadth via GCN. Also the jump connection architecture aggregate GCN layers' representation with different attention score, which learns the importance of neighbors' syntactic information of different hops away in depth. The experimental results on the widely used ACE 2005 dataset shows the superiority of the other state-of-the-art methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：