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

distributed parallel computation for complex rotational flows of non-Newtonian fluids

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS 2003年第10-11期43卷 1301-1328页

作者： Baloch, A Webster, MF Univ Coll Swansea Dept Comp Sci Inst Non Newtonian Fluid Mech Swansea SA2 8PP W Glam Wales

Complex rotational flows of non-Newtonian fluids are simulated through finite element methods. The predictions have direct relevance to dough kneading, associated with the food industry. The context is taken as two-dimensional and one of stirring material within a cylindrical vessel. Three stirrer shapes are considered, placed in eccentric location with respect to the cylinder centre. The motion is driven by the rotation of the outer vessel wall. Variation with change in theology and change in stirrer shapes are analysed, with respect to flow kinematics, stress fields, rate-of-work and power consumed. computations are performed for Newtonian, shear-thinning and viscoelastic fluids, at various viscosity levels to gradually approximate more realistic dough-like response. For viscoelastic fluids, Phan-Thien/Tanner constitutive models are adopted. The numerical method employed is based on a finite element semi-implicit time-stepping Taylor-Galerkin/pressure-correction scheme, posed in a cylindrical polar co-ordinate system. Simulations are conducted via distributed parallel processing, performed on a networked cluster of workstations, employing message passing. Parallel performance timings are compared against those obtained working in sequential mode. Ideal linear speed-up with the number of processors is observed for viscoelastic flows under this coarse-grained implementation. Copyright (C) 2003 John Wiley Sons, Ltd.

关键词： distributed computation finite element method rotating flow non-Newtonian fluids viscoelastic dough work done

来源：评论

学校读者我要写书评

暂无评论

distributed Algorithms for computation of Centrality Measures in Complex Networks

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2017年第5期62卷 2080-2094页

作者： You, Keyou Tempo, Roberto Qiu, Li Tsinghua Univ Dept Automat Beijing 100084 Peoples R China Tsinghua Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China Politecn Torino CNR IEIIT I-10129 Turin Italy Hong Kong Univ Sci & Technol Dept Elect & Comp Engn Hong Kong Hong Kong Peoples R China

This paper is concerned with distributed computation of several commonly used centrality measures in complex networks. In particular, we propose deterministic algorithms, which converge in finite time, for the distributed computation of the degree, closeness and betweenness centrality measures in directed graphs. Regarding eigen-vector centrality, we consider the PageRank problem as its typical variant, and design distributed randomized algorithms to compute PageRank for both fixed and time-varying graphs. A key feature of the proposed algorithms is that they do not require to know the network size, which can be simultaneously estimated at every node, and that they are clock-free. To address the PageRank problem of time-varying graphs, we introduce the concept of persistent graph, which eliminates the effect of spamming nodes. Moreover, we prove that these algorithms converge almost surely and in the sense of L-p. Finally, the effectiveness of the proposed algorithms is illustrated via extensive simulations using a classical benchmark.

关键词： Centrality measures complex networks convergence properties distributed computation randomized algorithms

来源：评论

学校读者我要写书评

暂无评论

Solving Multiple Fleet Airline Disruption Problems Using a distributed-computation Approach to Integer Programming

引用

IEEE ACCESS 2017年 5卷 19116-19131页

作者： Wu, Zhengtian Li, Benchi Dang, Chuangyin Suzhou Univ Sci & Technol Sch Elect & Informat Engn Suzhou 215009 Peoples R China City Univ Hong Kong Dept Syst Engn & Engn Management Hong Kong Hong Kong Peoples R China

The execution of the airline operation is often deviated from the original schedule due to some unexpected disruptions, such as aircraft breakdowns and severe weather conditions. In this situation, a recovery plan is needed to get the irregular operation back to normal to minimize the losses of the airline. To produce recovery plans and solve the airline disruption problems, a novel modified traveling salesman problem model is proposed to generate sets of the feasible flight routes for each aircraft fleet type. Then, the feasible flight routes are reassigned to the available aircrafts in each fleet to form a recovery plan. Numerical results show that the approach proposed in this paper is efficient and promising.

关键词： Airline disruption management irregular operation integer programming distributed computation OpenMP

来源：评论

学校读者我要写书评

暂无评论

A New Multisignature Scheme Based on Discrete Logarithm Problem and its distributed computation

A New Multisignature Scheme Based on Discrete Logarithm Prob...

引用

2001 International Symposium on distributed Computing and Applications to Business, Engineering and Science

作者： Lu Langru~1 Zeng Junjie~1 Kuang Youhua~2 Cheng Shengli~3 1.Information Security Lab.,Information Engineering Uni. ZhengZhou.PRC.450002 2.Math.Section,LuoYang Foreign Language Institute. 3.The Dept.of Computer,HuaZhong Uni.of Sci.and Tec.

We show an attack for purpose on most multisignature schemes of which extend from signature Schemes based on DLP such as Meta-El Gamal multisignature scheme[1]and Schnorr multisignature scheme[2].The attackers can deny that they had taken part in process of signing some message with others.A modification is made for these schemes' key generations,which can efficiently void this *** also design a method to distributed computation of this new multisignature scheme in this paper.

关键词： Multisignature Deny Discrete Logarithm Problem distributed computation

来源：评论

学校读者我要写书评

暂无评论

distributed biological computation: from oscillators, logic gates and switches to a multicellular processor and neural computing applications

引用

NEURAL COMPUTING & APPLICATIONS 2021年第15期33卷 8923-8938页

作者： Moskon, Miha Komac, Roman Zimic, Nikolaj Mraz, Miha Univ Ljubljana Fac Comp & Informat Sci Ljubljana Slovenia

Ever since its foundational years, synthetic biology has been focused on the implementation of biological computing structures. In the beginning, engineered biological computation has mainly been based on uncoupled monoclonal cellular populations. Implementations of such computing structures were mostly inspired by digital electronic circuits and revealed many constraints that limited the advance of the field to relatively simple information processing structures. The focus has recently shifted towards the implementation of biological computing structures within coupled intercellular circuits composed of engineered cellular modules. These circuits have, however, advanced only to a certain point, namely to consist of a few engineered bacterial strains, which perform the computation. It is now time to make a transition from modules and relatively simple systems of biological processing structures to networks composing different strains each presenting a designated computing structure. In such networks, each strain is analogous to a logic chip on a breadboard circuit and is connected to other strains by means of intercellular communication mechanisms rather than copper wires. This analogy can be driven further to use a set of engineered biological modules to construct a complex computing system, such as a multicellular biological processor. We review the state of the art of distributed cellular computation, communication mechanisms, and computational analysis and design approaches for distributed biological computing. We demonstrate the potential next step in engineered biological computation by a proposal of a design of a multicellular biological processor. We demonstrate an analysis of the proposed computing network using in silico simulation and optimisation approaches. Finally, we discuss the potential applications of the reviewed distributed cellular computing structures to the field of neural computing.

关键词： Biological computing Unconventional computing distributed computation Intercellular communication Complex multicellular circuits Biological processor

来源：评论

学校读者我要写书评

暂无评论

The Study of Image Modeling in the Digital City Based on distributed computation

The Study of Image Modeling in the Digital City Based on Dis...

引用

2004 International Symposium on distributed Computing and Applications to Business, Engineering and Science

作者： Lufeng GeShun Information Technology Department,WuHan University of Technology WuHan,HuBei Province,China

After introducing the Digital City and the distributed computation,the paper advances a new thought to use distributed computation in the work on large amount of data in the Digital City,especially to generate *** giv... 详细信息

关键词： the Digital Earth the Digital City coordinates-counterchange distributed computation image modeling

来源：评论

学校读者我要写书评

暂无评论

distributed PageRank computation with Link Failures

Distributed PageRank Computation with Link Failures

引用

American Control Conference 2009

作者： Ishii, Hideaki Tempo, Roberto Tokyo Inst Technol Dept Computat Intelligence & Syst Sci Midori Ku 4259-J2-54Nagatsuta Cho Yokohama Kanagawa 2268502 Japan Politecn Torino CNR IEIIT I-10129 Turin Italy

ISBN: (纸本)9781424445233

The Google search engine employs the so-called PageRank algorithm for ranking the search results. This algorithm quantifies the importance of each web page based on the link structure of the web. In this paper, we continue our recent work on distributed randomized computation of PageRank, where the pages locally determine their values by communicating with linked pages. In particular, we propose a distributed randomized algorithm with limited information, where only part of the linked pages is required to be contacted. This is useful to enhance flexibility and robustness in computation and communication.

关键词： distributed computation Link failures Multiagent consensus PageRank algorithm Randomization Stochastic matrices

来源：评论

学校读者我要写书评

暂无评论

Frame Codes For distributed Coded computation 11

Frame Codes For Distributed Coded Computation

引用

11th International Symposium on Topics in Coding (ISTC)

作者： Yosibash, Royee Zamir, Ram Tel Aviv Univ EE Syst Dept Tel Aviv Israel

ISBN: (纸本)9781665409438

distributed computation is a framework used to break down a complex computational task into smaller tasks and distributing them among computational nodes. Erasure correction codes have recently been introduced and have become a popular workaround to the well known "straggling nodes" problem, in particular, by matching linear coding for linear computation tasks. It was observed that decoding tends to amplify the computation "noise", i.e., the numerical errors at the computation nodes. We propose taking advantage of the case that more nodes return than minimally required. We show how a clever construction of a polynomial code, inspired by recent results on robust frames, can significantly reduce the amplification of noise, and achieves graceful degradation with the number of straggler nodes.

关键词： distributed computation erasure codes polynomial codes noise amplification numerical stability DFT frames difference set equiangular tight frames Jacobi/MANOVA distribution graceful degradation

来源：评论

学校读者我要写书评

暂无评论

Communication-Efficient distributed Skyline computation 17

Communication-Efficient Distributed Skyline Computation

引用

ACM Conference on Information and Knowledge Management (CIKM)

作者： Zhang, Haoyu Zhang, Qin Indiana Univ Bloomington Bloomington IN 47408 USA

ISBN: (纸本)9781450349185

In this paper we study skyline queries in the distributed computational model, where we have s remote sites and a central coordinator;each site holds a piece of data, and the coordinator wants to compute the skyline of the union of the s datasets. The computation is in terms of rounds, and the goal is to minimize both the total communication cost and the round cost. We first give an algorithm with a small communication cost but potentially a large round cost;we show information-theoretically that the communication cost is optimal even if we allow an infinite number of communication rounds. We next give algorithms with smooth communication-round tradeoffs. We also show a strong lower bound for the communication cost if we can only use one round of communication. Finally, we demonstrate the superiority of our algorithms over existing ones by an extensive set of experiments on both synthetic and real world datasets.

关键词： skyline computation communication-efficient algorithms distributed computation

来源：评论

学校读者我要写书评

暂无评论

distributed PageRank computation with Link Failures

Distributed PageRank Computation with Link Failures

引用

2009 American Control Conference (ACC 2009)

作者： Hideaki Ishii Roberto Tempo Department of Computational Intelligence and Systems Science Tokyo Institute of Technology 4259-J2-54 Nagatsuta-cho Midori-ku Yokohama 226-8502 Japan IEIIT-CNR Politecnico di Torino Corso Duca degli Abruzzi 24 10129 Torino Italy

ISBN: (纸本)9781424445233

关键词： distributed computation Link failures Multi-agent consensus PageRank algorithm Randomization Stochastic matrices Search engines arithmetic Web pages Distribute COMMUNICATING Web search engines randomized algorithms Flexibility Communication Research

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：