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

1st International Conference: Mechatronic Systems and Materials, MSM 2005

作者： Novickij, J. Stankevič, V. Balevičius, S. Žurauskiene, N. Cimmperman, P. Kačianauskas, R. Stupak, E. Kačeniauskas, A. Löffler, M.J. Magnetic Field Laboratory Vilnius Gediminas Technical University Naugarduko 41 Vilnius Lithuania High Power Pulse Laboratory Semiconductor Physics Institute A. Goštauto 11 Vilnius Lithuania Dep. of Physics Vilnius Gediminas Technical University Sauletekio 11 Vilnius Lithuania Dep. of Strength of Materials Vilnius Gediminas Technical University Sauletekio 11 Vilnius Lithuania Parallel Computing Lab. Vilnius Gediminas Technical University Sauletekio 11 Vilnius Lithuania University of Applied Sciences Gelsenkirchen Energy Institute Gelsenkirchen Neidenburger Strasse 10 D-45897 Germany

ISBN: (纸本)3908451213

Magnetic field sensors based on polycrystalline La0.83Sr 0.17MnO3 films were used to measure the magnetic field distribution and disturbances during the operation of an electromagnetic launcher. Hollow cylinders made from dural aluminum and iron were used as propelled objects inside the solenoidal coil. The obtained results revealed the ability of manganite sensors to rapidly measure changing high magnetic fields of arbitrary waveforms.

关键词： Actuators

来源：评论

学校读者我要写书评

暂无评论

An accelerated block-parallel Newton method via overlapped partitioning

引用

Lecture Notes in Computational Science and Engineering 2005年 40卷 547-554页

作者： Chen, Yurong Lab. of Parallel Computing Institute of Software CAS China

ISBN: (纸本)3540225234

This paper presents an overlapped block-parallel Newton method for solving large nonlinear systems. The graph partitioning algorithms are first used to partition the Jacobian into weakly coupled overlapping blocks. Then the simplified Newton iteration is directly performed, with the diagonal blocks and the overlapping solutions assembled in a weighted average way at each iteration. In the algorithmic implementation, an accelerated technique has been proposed to reduce the number of iterations. The conditions under which the algorithm is locally and semi-locally convergent are studied. Numerical results from solving power flow equations are presented to support our study.

关键词： Newton-Raphson method

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of allgather algorithms on terascale Linux cluster with Fast Ethernet

Performance evaluation of allgather algorithms on terascale ...

引用

8th International Conference on High-Performance computing in Asia-Pacific Region

作者： Chen, Jing Zhang, Linbo Zhang, Yunquan Yuan, Wei Department of Computer Science University of Science and Technology of China China Lab. of Parallel Computing Institute of Software CAS China State Key Laboratory of Computer Science China Academy of Mathematics and Systems Sciences CAS China

ISBN: (纸本)0769524869

We report our work on evaluating performance of several MPI Allgather algorithms on Fast Ethernet. These algorithms are ring, recursive doubling, Bruck, and neighbor exchange. The first three algorithms are widely used today. The neighbor exchange algorithm which was recently proposed by the authors incorporates pair-wise exchange, and is expected to perform better with certain configurations, mainly when using TCP/IP over Ethernet. We tested the four algorithms on terascale Linux clusters DeepComp 6800 and DAWNING 4000A using TCP/IP over Fast Ethernet. Results show that our neighbor exchange algorithm performs the best for long messages, the ring algorithm performs the best for medium-size messages and the recursive doubling algorithm performs the best for short messages.

关键词： Computer networks

来源：评论

学校读者我要写书评

暂无评论

Three dimensional and thermal transient analysis of sedimentary rocks

Three dimensional and thermal transient analysis of sediment...

引用

Eighth International Conference on Advanced Computational Methods in Heat Transfer, HEAT TRANSFER VIII

作者： King, V.P.S. Landau, L. Alves, J.L.D. Martins, M.A.D. Lab. for Compl. Methods in Eng. COPPE Fed. University of Rio de Janeiro Brazil Centre for Parallel Computing COPPE Federal University of Rio de Janeiro Brazil

This work presents the implementation of a finite element code for the thermal transient analysis of sedimentary rocks. This analysis provides a means to assess the thermal history in sedimentary rocks, assisting the studies of hydrocarbon generation and migration processes. The unstructured 3D mesh of tetrahedral elements provides the discrete model. An iterative driver using an edge-by-edge data structure solves the resulting system of equations at each time step. This strategy provides considerable improvements in terms of CPU time and memory demand. This combination enables the study of complex 3D problems, a key issue to basin analysis.

关键词： Sedimentary rocks

来源：评论

学校读者我要写书评

暂无评论

A location information-based route discovery protocol for mobile ad hoc networks

A location information-based route discovery protocol for mo...

引用

IEEE International Conference on Performance, computing and Communications (IPCCC)

作者： H. Ammari H. El-Rewini Mobile Computing and Parallel Processing Lab Computer Science and Engineering Department School of Engineering Southern Methodist University Dallas TX USA

A mobile ad hoc network (MANET) is a set of mobile nodes that agreed upon forming a temporary, spontaneous network in spite of the lack of any infrastructure or centralized administration. MANET topology changes frequently and arbitrarily due to node mobility. Therefore, an efficient routing protocol is required to cope with the dynamic change of MANET topology, which requires discovering and maintaining new routes, in this paper we propose a route discovery protocol based on location information, which could be provided to MANET nodes by a Global Positioning System (GPS). Our route discovery protocol utilizes the essential features of Voronoi diagrams in order to reduce the search space of routes by allowing only a small subset of MANET nodes, called authorized forwarders, to forward a route request. This results in a restrictive, selective route discovery protocol, which significantly reduces the routing overhead compared to other location-based routing protocol, such as LAR.

关键词： Mobile ad hoc networks Routing protocols Mobile computing Global Positioning System Concurrent computing parallel processing Computer science Network topology Costs Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Integration of mobile ad hoc networks and the Internet using mobile gateways

Integration of mobile ad hoc networks and the Internet using...

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： H. Ammari H. El-Rewini Mobile Computing and Parallel Processing Laboratory Computer Science and Engineering Department School of Engineering Southern Methodist University Dallas TX USA Mobile Computing and Parallel Processing Lab Computer Science and Engineering Department School of Engineering Southern Methodist University Dallas TX USA

Summary form only given. Mobile ad hoc networks (MANET) and the Internet exhibit differences in their network architecture. These differences concern the various sorts of assumptions imposed not only on the structure and topology of the underlying networks, but also on communication patterns of mobile nodes in both networks. Integrating MANET and the Internet into a hybrid network is a challenging problem due to these differences. We propose a three-layer approach that uses both mobile IP and dynamic destination-sequenced distance vector (DSDV) to integrate these two types of networks into a hybrid environment, in order to provide MANET nodes with Internet connectivity and access to the Internet resources. Our approach is based on the use of mobile gateways as an interface between MANET and the Internet. These mobile gateways can use mobile IP when they communicate with the Internet and DSDV when they interact with MANET. We also show the results of several simulation experiments that were conducted to study the integrated environment.

关键词： Mobile ad hoc networks IP networks Internet Mobile computing Computer networks Mobile communication Routing protocols Concurrent computing parallel processing Computer science

来源：评论

学校读者我要写书评

暂无评论

Journal of Information Science and Engineering: Editorial notice

引用

Journal of Information Science and Engineering 2005年第5期21卷 i-ii页

作者： Lee, Der-Tsai Amato, Nancy M. Chang, Shih-Fu Chen, Homer H. Chen, Tsuhan Hsu, Tsan-Sheng Hwang, Jenq-Neng Kuo, Sy-Yen Kuo, Tei-Wei Li, Chung-Sheng Tokuyama, Takeshi Wing, Jeannette Wu, Tzong-Chen Yen, John Computer Science at Texas A and M University United States Parasol Laboratory United States IEEE Transactions on Parallel and Distributed Systems Computing Research Association's Committee on the Status of Women in Computing Research CRA-W's Distributed Mentor Program United States Department of Electrical Engineering Columbia University United States Lab. United States College of Electrical Engineering and Computer Science National Taiwan University Taiwan IEEE Transactions on Circuits and Systems for Video Technology IEEE Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh PA United States ACM ACM SIGACT IEEE Computer Society IICM Austria Research and Development of the Department Multimedia Signal Processing Technical Committee IEEE Signal Processing Society United States IEEE Transactions on Circuits and systems for Video Technology College of Electrical Engineering and Computer Science National Taiwan Ocean University Keelung Taiwan Department of Electrical Engineering National Taiwan University Taiwan Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan IEEE Technical Committee on Real-Time Systems Computer Science Division IBM T.J. Watson Research Center United States IBM Research Division Graduate School of Information Sciences Tohoku University Japan ACM IPSJ Mathematical Society of Japan Japan Department of Computer Science Computer Science Department Carnegie Mellon University United States National Academies of Science's Computer Science and Telecommunications Board United States Microsoft's Trustworthy Academic Advisory Board Intel Research Pittsburgh's Advisory Board United States Dartmouth's Institute for Security Technology Studies Advisory Committee Canada Sloan Research Fellowships Program Committee United States ACM Taiwan China Information Sciences and Technology Pennsylvania State University United States Laboratory for Intelligent Agents Penn State's School of Info

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

大规模科学计算性能评估的FFT标准

大规模科学计算性能评估的FFT标准

引用

第8届全国并行计算大会

作者：侯晓吻唐渊 Department of Computer Science and Engineering Beijing University of Posts and TelecommunicationsBe Lab.of Parallel Computing Institute of Software Chinese Academy of Sciences Beijing 100080China

在大规模科学计算中，对整个系统性能评估的正确与否已经越来越成为成功掏建系统不可小视的一环，现代超级计算机(千亿次，万亿次)的性能测试与评估最常用的一个测试基准程序就是所谓的LINPACK。当今超级计算界的TOP500排名也主要是基于... 详细信息

在大规模科学计算中，对整个系统性能评估的正确与否已经越来越成为成功掏建系统不可小视的一环，现代超级计算机(千亿次，万亿次)的性能测试与评估最常用的一个测试基准程序就是所谓的LINPACK。当今超级计算界的TOP500排名也主要是基于LINPACK峰值的，但我们在实际应用中发现，LINPACK峰值高并不等于超级计算机/并行机的利用率/并行效率一定也高。本文指出了LINPACK测试程序包自身的局限性，进而提出一个大规模科学计算性能测试与评估的FFT标准,并对影响并行FFT算法性能的一些主要因素进行分析，结合一套完善的软件包“FFTH”以满足此类需求。

关键词：科学计算并行计算基准程序程序测试

来源：评论

学校读者我要写书评

暂无评论

Direct execution simulation of mobile agent algorithms 03

Direct execution simulation of mobile agent algorithms

引用

Proceedings of the 2003 international conference on parallel and distributed processing and applications

作者： Jiannong Cao Xuhui Li Sou King Yanxiang He Internet and Mobile Computing Lab Department of Computing Hong Kong Polytechnic University Hung Hom Kowloon Hong Kong Internet and Mobile Computing Lab Department of Computing Hong Kong Polytechnic University Hung Hom Kowloon Hong Kong and Parallel and Distributed Computing Lab Computer School Wuhan University Wuhan Hubei China Parallel and Distributed Computing Lab Computer School Wuhan University Wuhan Hubei China

ISBN: (纸本)9783540405238

Mobile agent has been applied to develop the solutions for various kinds of parallel and distributed computing problems. However, performance evaluation of mobile agent algorithms remains a difficult task, mainly due to the characteristics of mobile agents such as distributed and asynchronous execution, autonomy and mobility. This paper proposes a general approach based on direct execution simulation for evaluating the performance of mobile agent algorithms by collecting and analyzing the information about the agents during their execution. We describe the proposed generic simulation model, named MADES, the architecture of a software environment based on MADES, and a prototype implementation. A mobile agent-based distributed load balancing algorithm is used for experiments with the prototype.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Exploiting flexibly assignable work to improve load balance 02

Exploiting flexibly assignable work to improve load balance

引用

Fourteenth Annual ACM Symposium on parallel Algorithms and Architectures

作者： Pinar, Ali Hendrickson, Bruce NERSC Lawrence Berkeley National Lab. Berkeley CA 94720 United States Parallel Computing Sciences Dept. Sandia National Laboratories Albuquerque NM 87185-1110 United States

ISBN: (纸本)9781581135299

In many applications of parallel computing, distribution of the data unambiguously implies distribution of work among processors. But there are exceptions where some tasks can be assigned to one of several processors without altering the total volume of communication. In this paper, we study the problem of exploiting this flexibility in assignment of tasks to improve load balance. We first model the problem in terms of network flow and use combinatorial techniques for its solution. Our parametric search algorithms use maximum flow algorithms for probing on a candidate optimal solution value. We describe two algorithms to solve the assignment problem with log WT and |P| probe calls, where WT and |P|, respectively, denote the total workload and number of processors. We also define augmenting paths and cuts for this problem, and show that any algorithm based on augmenting paths can be used to find an optimal solution for the task assignment problem. We then consider a continuous version of the problem, and formulate it as a linearly constrained optimization problem, i.e., min Ax∞, s.t. Bx = d. To avoid solving an intractable ∞-norm optimization problem, we show that in this case minimizing the 2-norm is sufficient to minimize the ∞-norm, which reduces the problem to the well-studied linearly-constrained least squares problem. The continuous version of the problem has the advantage of being easily amenable to parallelization.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：