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

Fast calculation of computer-generated Fresnel hologram utilizing distributed parallel processing and array operation

引用

OPTICAL REVIEW 2005年第4期12卷 287-292页

作者： Nishi, S Shiba, K Mori, K Nakayama, S Murashima, S Osaka Electrocommun Univ Fac Informat & Commun Engn Osaka 5728530 Japan Kagoshima Univ Comp & Comm Ctr Kagoshima 8900065 Japan Kagoshima Univ Grad Sch Sci & Engn Kagoshima 8900065 Japan

Fresnel CGH for a three-dimensional (3-D) object is generated by calculating the Fresnel diffraction, but it requires a huge amount of calculation. This is one reason for the difficulty in realizing real-time holography. We propose fast calculation method of computer-generated Fresnel hologram (Fresnel CGH) utilizing distributed parallel processing and array operation. In our method, a projected image with depth information of the 3-D object is prepared to calculate the Fresnel diffraction. The Fresnel diffraction of the projected image is then calculated with depth information by array operation and distributed parallel processing. parallel processing is realized using JavaSpaces and many standard computers. In our array operation, calculation error in phase distribution on a hologram occurs more than the strict Fresnel diffraction. However, it was confirmed by experiments that the influence of an error can be controlled and ignored. In this paper, our proposed method and some experimental results are shown. (c) 2005 The Optical Society of Japan.

关键词： Fresnel CGH fast calculation projected image array operation distributed parallel processing

来源：评论

学校读者我要写书评

暂无评论

Fast calculation of computer-generated Fresnel hologram utilizing distributed parallel processing and array operation

Fast calculation of computer-generated Fresnel hologram util...

引用

19th Congress of the International-Commission-for-Optics

作者： Nishi, S Yuizono, T Mori, K Nakayama, S Kagoshima Univ Fac Engn Kagoshima 8900065 Japan

Computer-generated Fresnel hologram (Fresnel CGH) for 3-D object can be made by calculation of Fresnel diffraction., However, since-diffraction computing is complicated, it is-required huge calculation time. In this p... 详细信息

ISBN: (纸本)0819445967

关键词： holography computer-generated hologram Fresnel diffraction projected image fast calculation array operation distributed parallel processing Javaspaces

来源：评论

学校读者我要写书评

暂无评论

An entropy-based algorithm for data elimination in time-driven software instrumentation

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2009年第5期82卷 907-913页

作者： Ozmen, Ahmet Dumlupinar Univ Dept Elect & Elect Engn TR-43100 Kutahya Turkey

While monitoring, instrumented long running parallel applications generate huge amount of instrumentation data. processing and storing this data incurs overhead, and perturbs the execution. A technique that eliminates unnecessary instrumentation data and lowers the intrusion without loosing any performance information is valuable for tool developers. This paper presents a new algorithm for software instrumentation to measure the amount of information content of instrumentation data to be collected. The algorithm is based on entropy concept introduced in information theory, and it makes selective data collection for a time-driven software monitoring system possible. (C) 2008 Elsevier Inc. All rights reserved.

关键词： Entropy Software instrumentation parallel performance distributed parallel processing

来源：评论

学校读者我要写书评

暂无评论

distributed graph cube generation using Spark framework

引用

JOURNAL OF SUPERCOMPUTING 2020年第10期76卷 8118-8139页

作者： Kang, Seok Lee, Suan Kim, Jinho Kangwon Natl Univ Dept Comp Sci Chunchon Kangwon South Korea

Graph OLAP is a technology that generates aggregates or summaries of a large-scale graph based on the properties (or dimensions) associated with its nodes and edges, and in turn enables interactive analyses of the statistical information contained in the graph. To efficiently support these OLAP functions, a graph cube is widely used, which maintains aggregate graphs for all dimensions of the source graph. However, computing the graph cube for a large graph requires an enormous amount of time. While previous approaches have used the MapReduce framework to cut down on this computation time, the recently developed Spark environment offers superior computational performance. To leverage the advantages of Spark, we propose the GraphNaive and GraphTDC algorithms. GraphNaive sequentially computes graph cuboids for all dimensions in a graph, while GraphTDC computes them after first creating an execution plan. We also propose the Generate Multi-Dimension Table method to efficiently create a multidimensional graph table to express the graph. Evaluation experiments demonstrated that the GraphTDC algorithm significantly outperformed Spark SQL's built-in library DataFrame, as the size of graphs increased.

关键词： distributed parallel processing Spark framework Resilient distributed dataset Graph cube Data cube Online analytical processing

来源：评论

学校读者我要写书评

暂无评论

A compact neural network for partial-response maximum-likelihood detectors: Algorithmic study

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 1998年第7期45卷 848-856页

作者： Chou, EY Sheu, BJ Wang, MY Univ So Calif Dept Elect Engn Los Angeles CA 90089 USA Univ So Calif Integrated Media Syst Ctr Los Angeles CA 90089 USA

A compact neural network algorithm for partial-response maximum-likelihood (PRML) sequence detection is presented. Compact neural networks are a class of locally connected neural networks suitable for very large scale integration (VLSI) implementation. The hardware complexity for VLSI implementation of the proposed algorithm grows linearly with the level of the deliberately designed symbol interference effects of the partial-response (PR) signaling scheme. Large dedicated memory for storage of likelihood matrices in digital Viterbi-algorithm-based detectors is not needed for the proposed detector. Detailed analysis on network stability for network topology and time constant of an analog neuron is described. This detector algorithm has competitive bit-error rate performance when compared with the digital Viterbi algorithm under the noise condition for many real-world applications. The proposed algorithm is suitable for analog VLSI implementation because of its low time complexity and linear area complexity for the detection of PRML signaling schemes.

关键词： communication distributed parallel processing maximum-likelihood sequence estimation neural networks partial response

来源：评论

学校读者我要写书评

暂无评论

A path planning algorithm for mobile robot based on edge-cloud collaborative computing

引用

INTERNATIONAL JOURNAL OF SYSTEM ASSURANCE ENGINEERING AND MANAGEMENT 2022年第SUPPL 1期13卷 594-604页

作者： Lv, Taizhi Zhang, Jun Zhang, Juan Chen, Yong Jiangsu Maritime Inst Sch Informat Technol Nanjing 211170 Peoples R China Nanjing Longyuan Microelect Co Ltd Dept Res & Dev Nanjing 211106 Peoples R China

Path planning is a key problem to be solved for mobile robot to realize autonomous navigation. It is a typical computing intensive task, and high computing capacity is needed. The computing power carried by the mobile robot is difficult to support the calculation of path planning, and the traditional cloud computing model cannot meet the real-time requirement of path planning. In order to solve the problem of insufficient computing power and improve the execution efficiency and real-time performance, a real-time computing framework based on edge-cloud collaborative computing is constructed for path planning. In each control decision cycle, the mobile robot as the edge acquires the sensing data and transmits it to the cloud. By stream computing, the cloud plans the path in real-time. The edge integrates the planned path from the cloud and the partial obstacle avoidance result from the edge as a path sequence. The final path sequence is sent to the motion control layout, and drives the mobile robot to the target. By the edge-cloud collaborative computing, the computing capability of the edge is extended. By taking use of high real-time performance of stream computing, the proposed algorithm improves the efficiency of path planning. By taking use of the storage capacity of the cloud, environmental memory is realized and the problem of local traps is solved. Simulation experiment results in different environments show that the planned path by the proposed algorithm gets a higher path quality and shorter execution time comparing the other several traditional path planning algorithms. Experiments in real environment verify the feasibility and effectiveness of the algorithm.

关键词： Path planning Edge-cloud collaborative computing Stream computing Apache Flink Visibility graph distributed parallel processing

来源：评论

学校读者我要写书评

暂无评论

Performance improvement of network file system using third-party transfer

引用

NEC RESEARCH & DEVELOPMENT 1998年第4期39卷 402-406页

作者： Endoh, N NEC Corp Ltd Comp Software Div 1 Tokyo Japan

This paper introduces the Global File System. (GFS) which has beem developed for a highperformance client-server type net;work file system. It is implemented in the NEC SUPER-UX operating system. GFS realizes a speed of about 50 MB/s for a 1 NIB file and a speed of about 85 MB/s for a 32 MB file when using the NEC N7764 disk, unit as a file server and using the HIPPI (High Performance parallel Interface) channel as underlying network. Files in GFS can be accessed from any UNIX double dagger system using NFS dagger (Network File System). Thus, transparency with NFS is retained.

关键词： Global File System (GFS) client-server high-speed data transfer third-party transfer NFS (Network File System) HPC (High Performance Computing) distributed parallel processing IPI-3 (intelligent parallel interface part 3) HIPPI (High Performance parallel Interface)

来源：评论

学校读者我要写书评

暂无评论

Efficiency of Web based SAX XML distributed processing

Efficiency of Web based SAX XML distributed processing

引用

International Conference on Internet Computing

作者： Eggen, R Basic, A Univ N Florida Dept Comp & Informat Sci Jacksonville FL 32224 USA

ISBN: (纸本)9781932415698

Given the interest and need for Web processing and programming of distributed systems, researchers are exploring methods and techniques for facilitating programming of such systems. In this paper we explore the performance characteristics of XML processing using SAX for scripting languages PERL and PHP as compared to C (CGI) and Java (Servlets). We use SAX to process XML files via a Web based interface in each of the four environments.

关键词： PERL PHP Java Servlets CCGI distributed parallel processing

来源：评论

学校读者我要写书评

暂无评论

A High-performance Universal Miniature Radar System

A High-performance Universal Miniature Radar System

引用

CIE International Conference on Radar (RADAR)

作者： Jin, Ting Wang, Hong-Xian Liu, Hong-Wei XiDian Univ Natl Lab Radar Signal Proc Xian Peoples R China

ISBN: (纸本)9781509048281

This paper proposes the design and realization of a high-performance universal miniature radar system. It presents a well solution to the main challenges of the radar system including extremely huge data flow and calculating burden, the traditional custom-built pattern of radar system, and the strict limitations for the size, weight and power consumption of the airborne or space-borne real-time Synthetic Aperture Radar(SAR) signal processing systems. The system has showed the virtues of standardization, modularization, stability, reconstruction, good adaptability due to the combined application of the distributed parallel architecture, latest interconnection standard and processor. By the successful application cases of airborne SAR/GMTI and space-borne imaging, its high-performance universality and miniature property could be adequately proved.

关键词： High-performance miniature universal radar system distributed parallel processing

来源：评论

学校读者我要写书评

暂无评论

distributed parallel computing architecture design philosophy for TTC evaluation with transient stability constraints

引用

3rd International Conference on Electric Utility Deregulation, Restructuring and Power Technologies

作者： Guo, Z. J. Shi, L. B. Yao, Z. X. Tsinghua Univ Grad Sch Natl Key Lab Power Syst Shenzhen Dept Elect Engn Shenzhen 518055 Peoples R China

ISBN: (纸本)9787564112493

This paper presents a novel calculation framework for TTC evaluation with transient stability (TS) constraints with respect to an usual or a critical contingency set. The basic solution strategy for TTC evaluation is introduced, and the whole system architecture and computing flow are given in this paper. In order to implement the security margin of large-scale interconnected power system efficiently and rapidly, especially for on-fine application, a novel distributed parallel computing architecture design philosophy, called as optimal workstation cluster computing model is proposed. Furthermore, some key module design philosophies are issued as well. The proposed distributed parallel computing platform can be easily and conveniently embedded into the existing dynamic security assessment (DSA) system or such systems related to power market to implement the on-line security assessment. On the other hand, the distributed parallel computing platform can make intensive off-line simulation related to the specified case studies.

关键词： TTC evaluation transient stability distributed parallel processing optimal workstation cluster load-generation increasing pattern

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：