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

IPRAR: A DFG-based approach to instruction clustering for multicluster VLIW DSP processor with SIMD structure

Journal of Computational Information Systems 2014年第3期10卷 1257-1269页

作者： Yang, Yangzhao Gu, Naijie Zhao, Zeng Ren, Kaixin School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Anhui Province Key Laboratory of Computing and Communication Software Hefei 230027 China USTC and Loongson Technology Associated Laboratory Institute of Advanced Technology University of Science and Technology of China Hefei 230027 China

Modern Very Long Instruction (VLIW) DSP can improve performance by using instruction-level parallelism (ILP) and obtain better parallelism through instruction clustering. The essence of clustering is resource allocation. Traditional clustering method assumes that one instruction can only be assigned to a certain cluster, which is inapplicable to the architecture with SIMD structure. To address this issue, this paper presents IPRAR, a novel instruction clustering algorithm for the features of SIMD structure based on DFG. Due to considering the features of SIMD structure, IPRAR can be implemented on BWDSP100 with satisfactory. Besides, IPRAR can make the load of cluster more balanced and minimize the intercluster communication overload. Finally, numerous experiment results show that the IPRAR has an average of 7-10% performance improvement compared to the traditional methods. © 2014 Binary Information Press.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimizing BLAS2 for a decoupled access/execute architecture processor

引用

Journal of Computational Information Systems 2014年第3期10卷 1231-1241页

作者： Zhao, Zeng Gu, Naijie Yang, Yangzhao Ren, Kaixin School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China USTC and Loongson Technology Associated Laboratory Institute of Advanced Technology University of Science and Technology of China Hefei 230027 China Anhui Province Key Laboratory of Computing and Communication Software Hefei 230027 China

Basic Linear Algebra Subroutines (BLAS) is a widely used basic mathematical library for high-performance computing. It has a great impact on the performance of supercomputers. This paper focuses on memory accessing optimization for the level-2 library of BLAS (BLAS2) based on Godson-3B chips. The key contribution of this work is proposing several methods to make full use of the Godson-3B's hardware features, as well as to improve the performance of memory access. GEMV, the kernel function of BLAS2, is selected to demonstrate the optimization methods for Godson-3B. Using Single Instruction Multiple Data (SIMD) instructions, Direct Register Access (DRA) and Direct Cache Access (DCA) of Godson-3B, two optimization algorithms for GEMV are introduced in this paper. Experiments show that the best computing performance of the optimized GEMVs on Godson-3B is more than 1.8Gops, which is far superior to that of other versions. While the test scale of GEMVs is greater than the size of L2-cache, its average performance exceeds UBLAS and OpenBlas, the two most famous optimized BLAS libraries for GODSON, by more than 60% and 20% respectively. © 2014 Binary Information Press.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

SSEM： Secure, Scalable and Efficient Multi-Owner Data Sharing in Clouds

引用

China communications 2016年第8期13卷 231-243页

作者： Shungan Zhou Ruiying Du Jing Chen Hua Deng Jian Shen Huanguo Zhang The Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education Computer School of Wuhan University Wuhan 430072 Hubei Province China State Grid Information and Communication Company of Hunan Electric Power Corp Changsha 410000 Hunan Province China

Data sharing is a main application of cloud computing. Some existing solutions are proposed to provide flexible access control for outsourced data in the cloud. However, few attentions have been paid to group-oriented data sharing when multiple data owners want to share their private data for cooperative purposes. In this paper, we put forward a new paradigm, referred to as secure, scalable and efficient multi-owner(SSEM) data sharing in clouds. The SSEM integrates identity-based encryption and asymmetric group key agreement to enable group-oriented access control for data owners in a many-to-many sharing pattern. Moreover, with SSEM, users can join in or leave from the group conveniently with the privacy of both group data and user *** proposed the key-ciphertext homomorphism technique to construct an SSEM scheme with short ciphertexts. The security analysis shows that our SSEM scheme achieves data security against unauthorized accesses and collusion attacks. Both theoretical and experimental results confirm that our proposed scheme takes users little costs to share and access outsourced data in a group manner.

关键词： data sharing cloud computing asymmetric key agreement access control

来源：评论

学校读者我要写书评

暂无评论

Implicit interpolation of time vector series

Implicit interpolation of time vector series

引用

2011 7th International Conference on Natural Computation, ICNC 2011

作者： Li, Dao-Lun Zha, Wen-Shu Lu, De-Tang Department of Modern Mechanics University of Science and Technology of China China Key Laboratory of Software in Computing and Communication of Anhui Province University of Science and Technology of China Hefei 230027 China

ISBN: (纸本)9781424499533

Time vector series abound in many fields, which are different from time series. Based on mapping and implicit function interpolation, the method of implicit interpolation over time vector series is developed and studied. Time vector series are mapped into a sequence of closed curves or surfaces, which are seen as the interpolation data set. Based on the interpolation data set, the implicit interpolation function is constructed and from which an isoline is drawn. The inverse mapping of the isoline is the prediction of vector series at the new time. Based on the well logging data an application is given to predict the unknown isotope logging data of year 2004 with the known data of year 2003 and 2005 which shows the performance of the method. © 2011 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Hubness-Enabled Clustering and Recovery for Large-Scale Incomplete Multi-View Data

引用

ACM Transactions on Knowledge Discovery from Data 2024年第1期19卷 1-23页

作者： Yu, Xiao Liu, Hui Zhang, Yan Lin, Yuxiu Zhang, Caiming School of Computer Science and Technology Shandong University of Finance and Economics Shandong Province Jinan China Shandong Key Laboratory of Lightweight Intelligent Computing Visualization for Digital Economy Shandong Province Jinan China School of Software Shandong University Shandong Province Jinan China

Incomplete multi-view clustering has gained considerable attention in recent years due to the prevalence of incomplete multi-view data in real-world applications. However, existing methods often struggle to effectively deal with large-scale datasets, particularly those with a significant number of missing instances. To address these issues, we propose a novel method called Hubness-Enabled Clustering and Recovery for Large-Scale Incomplete Multi-View Data (HENRI). HENRI utilizes the consensus hubs of all views to identify informative anchors to handle large-scale incomplete datasets. Furthermore, it incorporates a novel sample-level fusion strategy that effectively integrates information from all views, leading to remarkable outcomes in both cluster formation and missing data reconstruction. HENRI demonstrates exceptional capability in capturing the underlying structures of the data and recovering missing information, even when faced with a significant number of instances with incomplete data in partial views. To validate its effectiveness, we conducted experiments on 6 complete datasets and 31 incomplete datasets, comparing against 11 baseline methods. The results are impressive, demonstrating the superior performance of HENRI over the state-of-The-Art methods. © 2024 Copyright held by the owner/author(s).

关键词： Data assimilation

来源：评论

学校读者我要写书评

暂无评论

Precisely reconstruct porous media model based on synchrotron radiation slice images

Precisely reconstruct porous media model based on synchrotro...

引用

2009 International Conference on Computational Intelligence and software Engineering, CiSE 2009

作者： Song, Bo Dong, Lanfang Lu, Detang Anhui Province Key Lab of Software in Computing and Communication School of Computer Science and Technology USTC Hefei China Institute of Engineering and Science Software USTC Hefei China

ISBN: (纸本)9781424445073

In this paper a method for precisely reconstructing porous media three-dimensional model based on slice images is proposed. It first processes the original slice images, then uses 3D seed filling algorithm to find all pores based on the constructed spatial data, finally uses the modified marching cubes algorithm based on bounding box technology to render material skeletons and pores. Associating with the porous media flow specific application, a novel invalid pore removing method is proposed. The final reconstructed model shows that our method can precisely reconstruct the pore network and recover the pore shape. It also can identify the pores which meet spatial scale threshold conditions. Comparison of running time between the original marching cubes algorithm and the modified marching cubes algorithm is given. It shows that due to the bounding box technology the running time of modified marching cubes algorithm is shorten greatly when the pores are far away from each other. ©2009 IEEE.

关键词： Porous materials

来源：评论

学校读者我要写书评

暂无评论

Multi-layer network embedding on scc-based network with motif

引用

Digital communications and Networks 2024年第3期10卷 546-556页

作者： Lu Sun Xiaona Li Mingyue Zhang Liangtian Wan Yun Lin Xianpeng Wang Gang Xu Department of Communication Engineering Institute of Information Science TechnologyDalian Maritime UniversityDalian116026China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and TelecommunicationsChongqing400065China Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province DUT School of Software Technology&DUT-RU International School of Information Science and EngineeringDalian University of TechnologyDalian 116620China College of Information and Communication Engineering Harbin Engineering UniversityHarbin 150001China School of Information and Communication Engineering Hainan UniversityHaikou 570228China State Key Laboratory of Millimeter Waves School of Information Science and EngineeringSoutheast UniversityNanjing 210096China

Interconnection of all things challenges the traditional communication methods,and Semantic communication and computing(SCC)will become new *** is a challenging task to accurately detect,extract,and represent semantic information in the research of SCC-based *** previous research,researchers usually use convolution to extract the feature information of a graph and perform the corresponding task of node ***,the content of semantic information is quite *** graph convolutional neural networks provide an effective solution for node classification tasks,due to their limitations in representing multiple relational patterns and not recognizing and analyzing higher-order local structures,the extracted feature information is subject to varying degrees of ***,this paper extends from a single-layer topology network to a multi-layer heterogeneous topology *** Bidirectional Encoder Representations from Transformers(BERT)training word vector is introduced to extract the semantic features in the network,and the existing graph neural network is improved by combining the higher-order local feature module of the network model representation network.A multi-layer network embedding algorithm on SCC-based networks with motifs is proposed to complete the task of end-to-end node *** verify the effectiveness of the algorithm on a real multi-layer heterogeneous network.

关键词： Semantic communication and computing Multi-layer network Graph neural network Motif

来源：评论

学校读者我要写书评

暂无评论

Analysis of an M(λ1,λ2)/M/1/WV queue with controlled vacation interruption and variable arrival rate

引用

Mathematical and Computational Applications 2015年第1期20卷 39-49页

作者： Wu, Wenqing Tang, Yinghui Visual Computing and Virtual Reality Key Laboratory of Sichuan Province Sichuan Normal University ChengduSichuan China School of Mathematics and Software Science Sichuan Normal University ChengduSichuan China

This paper studies a Markovian queue with multiple working vacations and controlled vacation interruption. If there are at least N customers waiting upon completion of a service at a lower rate, the vacation is interrupted and the server returns to the system to resume the normal working level. Otherwise, the server continues the vacation until the system is non-empty after a vacation ends or there are at least N customers after a service ends. Moreover, the variable arrival rate of the customers is taken into account. Under such assumptions, by using the quasi-birth-and-death process, the matrix-geometric method and the difference equation theory, the steady-state queue length distribution along with various performance measures are derived. Additionally, under a certain cost structure, the optimal threshold N∗ that minimizes the long-run expected cost function per unit time is numerically determined. © 2015, Association for Scientific Research. All rights reserved.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

A novel approach for signal transduction networks simulation at a mesoscopic level

A novel approach for signal transduction networks simulation...

引用

7th IEEE International Conference on Bioinformatics and Bioengineering, BIBE

作者： Shao, Chenxi Deng, Hongli MOE-Microsoft Key Laboratory of Multimedia Computing and Communication University of Science and Technology of China Hefei Anhui 230027 China Department of Computer Science and Technology University of Science and Technology of China Hefei Anhui 230027 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei Anhui 230027 China

ISBN: (纸本)1424415098

Signal transduction (ST) networks simulation is important to medical research. However, owing to the complexity of the networks, most methods presented for the simulation are not desirable. Here, based on multi-agent system (MAS), we proposed a novel approach characterized by a multi-level discrete space and mesoscopic molecule-agents for describing ST networks at a mesoscopic level. The space is developed for the representation of the cellular space;it provides a relatively sufficient spatial representation with less computational cost. The mesoscopic molecule-agents model the active components within the networks, which will offer new potentials to overcome the combinatorial complexity as well as make computation feasible. To validate this method, the simulations of a composition/decomposition system and the Mitogen-Activated Protein Kinase (MAPK) signal transduction pathway are implemented. Finally, an in-silico experiment with perturbation in the MAPK pathway is made. The results obtained from the simulations demonstrate the validity of the approach. ©2007 IEEE.

关键词： Molecules

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Games on Weighted Newman-Watts Small-World Networks

引用

Chinese Physics Letters 2009年第5期26卷 255-258页

作者：杜文博曹先彬赵琳周宏 Department of Computer Science and Technology University of Science and Technology of China Hefei 230026 Anhui Province Key Laboratory of Software in Computing and Communication University of Science and Technology of China Hefei 230026 School of Life Sciences University of Science and Technology of China Hefei 230026

We investigate the evolutionary prisoner＇s dilemma game （PDG） on weighted Newman-Watts （NW） networks. In weighted NW networks, the link weight ωij is assigned to the link between the nodes i and j as： ωij = （ki · kj）^β, where ki（kj） is the degree of node i（j） and β represents the strength of the correlations. Obviously, the link weight can be tuned by only one parameter β. We focus on the cooperative behavior and wealth distribution in the system. Simulation results show that the cooperator frequency is promoted by a large range of β and there is a minimal cooperation frequency around β = -1. Moreover, we also employ the Gini coefficient to study the wealth distribution in the population. Numerical results show that the Gini coefficient reaches its minimum when β≈ -1. Our work may be helpful in understanding the emergence of cooperation and unequal wealth distribution in society.

关键词： PRISONER'S dilemma game COOPERATIVENESS INCOME distribution SIMULATION methods & models GINI coefficient NUMERICAL analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：