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

Changing the diameter of the locally twisted cube

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2013年第3期90卷 497-510页

作者： Han, Yuejuan Fan, Jianxi Zhang, Shukui Soochow Univ Prov Key Lab Comp Informat Proc Technol Suzhou 215006 Peoples R China Soochow Univ Sch Comp Sci & Technol Suzhou 215006 Peoples R China

The hypercube network Q(n) has been proved to be one of the most popular interconnection networks. The n-dimensional locally twisted cube LTQ(n) is an important variant of Q(n). One of the critical performance factors of an interconnection network is the diameter which determines the maximum communication time between any pair of processors. In this paper, we investigate the diameter variability problems arising from the addition and deletion of edges in LTQ(n). We obtain three results in this paper: (1) for any integer n2, we find the least number of edges (denoted by ch(LTQ(n))), whose deletion from LTQ(n) causes the diameter to increase, (2) for any integer n2, when ch(LTQ(n)) edges are deleted, the diameter will increase by 1 and (3) for any integer n4, the least number of edges whose addition to LTQ(n) will decrease the diameter is at most 2(n1).

关键词： diameter locally twisted cube interconnection network parallel computing system 68M07 68R10 05C85

来源：评论

学校读者我要写书评

暂无评论

Accelerated Mini-Batch Stochastic Dual Coordinate Ascent 13

Accelerated Mini-Batch Stochastic Dual Coordinate Ascent

引用

Annual Conference on Neural Information Processing systems

作者： Shai Shalev-Shwartz Tong Zhang School of Computer Science and Engineering Hebrew University Jerusalem Israel Department of Statistics Rutgers University NJ USA

ISBN: (纸本)9781632660244

Stochastic dual coordinate ascent (SDCA) is an effective technique for solving regularized loss minimization problems in machine learning. This paper considers an extension of SDCA under the mini-batch setting that is often used in practice. Our main contribution is to introduce an accelerated mini-batch version of SDCA and prove a fast convergence rate for this method. We discuss an implementation of our method over a parallel computing system, and compare the results to both the vanilla stochastic dual coordinate ascent and to the accelerated deterministic gradient descent method of Nesterov [2007].

关键词： parallel computing system ascent Coordinates Stochastic Dual descent method

来源：评论

学校读者我要写书评

暂无评论

SUBBAND PREDICTION OF ENERGY COMMODITY PRICES

SUBBAND PREDICTION OF ENERGY COMMODITY PRICES

引用

13th IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

作者： Panella, M. Barcellona, F. D'Ecclesia, R. L. Univ Roma La Sapienza DIET I-00184 Rome Italy

ISBN: (纸本)9781467309714

The dynamics of commodity prices has become a major field of analysis in the last 20 years. Standard econometric procedures to describe the behavior of prices have not been able to provide accurate description of the real dynamics. In this paper we apply filter banks to predict prices of specific energy commodities: crude oil, natural gas and electricity, which play a crucial role in the international economic and financial context. Given the high volatility of energy commodity prices, an accurate short term prediction allows to set adequate risk management strategies for producers, retailers and consumers. Filter banks for subband decompositions of the sequences to be predicted are proposed in the paper, allowing the implementation of a parallel computing system to get faster and more accurate implementation. The prediction system is based on a neural model trained on each subband according to specific training and prediction techniques.

关键词： Prices subband parallel computing system Filter banks dynamics Risk Management Electricity

来源：评论

学校读者我要写书评

暂无评论

A methodology for multivariate simulation with massively parallel computing systems for NPP safety assessment: VARIA code

引用

JOURNAL OF ENGINEERING THERMOPHYSICS 2011年第3期20卷 249-259页

作者： Moiseenko, E. V. Filippov, A. S. Russian Acad Sci Nucl Safety Inst Moscow 115191 Russia

The paper is focused on the practical application of parallel computing techniques in uncertainty assessment in simulation of heat transfer, mechanical and some other problems related to deterministic analysis of NPP safety. A methodology is developed and implemented in VARIA computer code that performs simultaneous run of multiple simulations on a parallel computing system with further statistical analysis of the array of their results. The current version of the code allows automated preparation and execution of multivariate simulations of thermal and mechanical behavior of pressurized water reactor structures by best-estimate (BE) codes in the scope of NPP safety assessment under severe accident conditions. The number of simultaneously launched tasks is limited only by the computer cluster capacity. The VARIA code is verified on multivariate simulation with HEFEST code of thermal behavior of a core melt in the VVER-440 reactor vessel during a severe accident. The influence of the variation of input parameters (decay heat value and coefficients of the applied convective heat transfer model) on the simulation results is studied. It is concluded that the potential field of applying the program is beyond the scope of analyzing severe accidents at NPP and includes also software product quality assurance and analysis of uncertainties of obtained simulation results.

关键词： Uncertainty Codes simulating Meltdown severe accident Simulation results parallel computing system Nuclear powerplants potential field input parameter POMC Gene parallel PROCESSING (COMPUTERS) Safety assessment

来源：评论

学校读者我要写书评

暂无评论

A Distributed Learning and Teaching Environment across Institutions based on Advanced Grid Portal Technology

引用

Procedia - Social and Behavioral Sciences 2012年 56卷 774-782页

作者： Dayang Hajah Tiawa Awang Hj. Hamid Md. Rajibul Islam Norma Alias Department of Multimedia Education Faculty of Education Universiti Teknologi Malaysia UTM Skudai 81310 Johor Malaysia Faculty of Information Science and Technology Multimedia University Malaysia Ibnu Sina Institute Universiti Teknologi Malaysia UTM Skudai 81310 Johor Malaysia

This study presents web-based networked information and collaborative authoring architecture as Information and Knowledge Grids. This architecture is made possible by advanced open source grid portal software in combination with distributed parallel computing system. The distributed learning and teaching grid environment are use for improving the quality of higher education as an initial stage. This Grid architecture provides reasonable and effective online assisted learning environment at the institution for any courses. The paper describes in some detail the architecture of an advanced grid portal based on parallel computing system, learning and teaching interactions and the processes of courses management over it.

关键词： grid portal collaborative authoring parallel computing system web-based learning

来源：评论

学校读者我要写书评

暂无评论

Concurrent Algorithm for Learning of Neural Networks

Concurrent Algorithm for Learning of Neural Networks

引用

IEEE International Conference Intelligent systems

作者： Anton Antonov Stefan Hadjitodorov Bioinformatics and Mathematical Modeling IBPhBME - Bulgarian Academy of Sciences Sofia Bulgaria

the purpose of the paper is to present an algorithm for concurrent processing on multi-layer neural networks and its advantages in the context of development of parallel computing systems and clouds.

ISBN: (纸本)9781467322768

the purpose of the paper is to present an algorithm for concurrent processing on multi-layer neural networks and its advantages in the context of development of parallel computing systems and clouds.

关键词： neural networks concurrent algorithm generalized nets Neural network parallel PROCESSING (COMPUTERS) parallel algorithms Clouds Multilayer neural networks Learning parallel computing system

来源：评论

学校读者我要写书评

暂无评论

Embedding meshes into twisted-cubes

引用

INFORMATION SCIENCES 2011年第14期181卷 3085-3099页

作者： Wang, Xi Fan, Jianxi Jia, Xiaohua Zhang, Shukui Yu, Jia Soochow Univ Sch Comp Sci & Technol Suzhou 215006 Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China Qingdao Univ Coll Informat Engn Qingdao 266071 Peoples R China

The n-dimensional twisted-cube, TNn, is a variation of the hypercube. In this paper, we study embedding of meshes into TNn. We prove three major results in this paper: (1) For any integer n >= 1, a 2 x 2(n-1) mesh can be embedded into TNn with dilation 1 and expansion 1. (2) For any integer n >= 4, an m x k(m >= 3, k >= 3) mesh cannot be embedded into TNn with dilation 1. (3) For any integer n >= 4, two node-disjoint 4 x 2(n-3) meshes can be embedded into TNn with dilation 2 and expansion 1. (C) 2011 Elsevier Inc. All rights reserved.

关键词： Twisted-cube Mesh Embedding Dilation Expansion parallel computing system

来源：评论

学校读者我要写书评

暂无评论

Embedding meshes into locally twisted cubes

引用

INFORMATION SCIENCES 2010年第19期180卷 3794-3805页

作者： Han, Yuejuan Fan, Jianxi Zhang, Shukui Yang, Jiwen Qian, Peide Soochow Univ Sch Comp Sci & Technol Suzhou Peoples R China Soochow Univ Network Ctr Suzhou 215006 Peoples R China

As a newly introduced interconnection network for parallel computing, the locally twisted cube possesses many desirable properties. In this paper, mesh embeddings in locally twisted cubes are studied. Let LTQ(n)(V,E) denote the n-dimensional locally twisted cube. We present three major results in this paper: (1) For any integer n >= 1, a 2 x 2(n-1) mesh can be embedded in LTQ(n) with dilation 1 and expansion 1. (2) For any integer n >= 4, two node-disjoint 4 x 2(n-3) meshes can be embedded in LTQ(n) with dilation 1 and expansion 2. (3) For any integer n >= 3, a 4 x (2(n-2) - 1) mesh can be embedded in LTQ(n) with dilation 2. The first two results are optimal in the sense that the dilations of all embeddings are 1. The embedding of the 2 x 2(n-1) mesh is also optimal in terms of expansion. We also present the analysis of 2p x 2q mesh embedding in locally twisted cubes. (C) 2010 Elsevier Inc. All rights reserved.

关键词： Locally twisted cube Mesh Embedding Dilation Expansion parallel computing system

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithms to Embed Hamiltonian Paths and Cycles in Faulty Crossed Cubes

Efficient Algorithms to Embed Hamiltonian Paths and Cycles i...

引用

4th International Conference on Computer Science and Education

作者： Fan, Jianxi Zhou, Wujun Han, Yuejuan Zhang, Guangquan Soochow Univ Sch Comp Sci & Technol Suzhou 215006 Peoples R China

ISBN: (纸本)9781424435197

The crossed cube is an important variation of the hypercube. It possesses many desirable properties for interconnection networks. Hamiltonicity is a critical property in interconnection networks. In this paper, we study fault-tolerant embedding algorithms of Hamiltonian paths and cycles in crossed cubes. We provide two algorithms HamiltonianPath and HamiltonianCycle. For any integer n >= 3, letting CQ(n) (V, E) denote the n-dimensional crossed cubes and F subset of V(CQ(n))boolean OR E(CQ(n)) denote a faulty set in CQ(n), (1) if vertical bar F vertical bar <= n - 3, HamiltonianPath can construct a Hamiltonian path between any two distinct nodes in CQ(n) - F in O(NlogN) time;and (2) if vertical bar F vertical bar <= n - 2, Hamiltoniancycle can construct a Hamiltonian cycle in CQ(n) - F in O(NlogN) time, where N is the node number of CQ(n) - F.

关键词： Crossed cube fault-tolerant path embedding dilation parallel computing system

来源：评论

学校读者我要写书评

暂无评论

Path Embedding in Faulty Locally Twisted Cubes

Path Embedding in Faulty Locally Twisted Cubes

引用

2nd IEEE International Conference on Computer Science and Information Technology

作者： Han, Yuejuan Fan, Jianxi Yang, Jiwen Qian, Peide Soochow Univ Sch Comp Sci & Technol Suzhou Peoples R China

ISBN: (纸本)9781424445189

As a newly introduced interconnection network for parallel computing, the locally twisted cube possesses many desirable properties. In this paper, fault-tolerant embedding of paths in locally twisted cubes is studied. Let LTQ(n)(V,E) denotes the n-dimensional locally twisted cube. We find that, for any faulty set F subset of V(LTQ(n)) boolean OR E(LTQ(n)) with vertical bar F vertical bar <= n - 3 and l with 2(n-1) - 1 <= l <= vertical bar V(LTQ(n) - F)vertical bar - 1 for any integer n >= 3, a path of length e can be embedded between any two distinct nodes with dilation 1 in LTQ(n) - F. And, the result does not hold if l <= 2(n-1)-2 or vertical bar F vertical bar >= n - 2, that is, the two bounds are tight. Moreover, this result extends the known result on (n - 3)-Hamiltonian connectivity of LTQ(n) in the literature.

关键词： locally twisted cube fault-tolerant path embedding dilation parallel computing system

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：