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

3rd International Conference on Precision Instrumentation and Measurement (CPIM 2011)

作者： Zhang Zili Yuan Jiang Zhou Weihu Wang Yawei Xu Yan Chinese Acad Sci Acad Optoelect Beijing 100864 Peoples R China Beijing Univ Aeronaut & Astronaut Beijing Peoples R China Huazhong Univ Sci & Technol Huazhong Peoples R China

ISBN: (纸本)9783037852606

The laser tracking system is widely used in the large-scale measurement field in industry providing accurate spatial information of measured objects. In this paper, the frame of software system for the laser tracker is introduced, as well as the design and implementation of each module. With the help of the software, customers can attain high precision measuring results within large volume. Functions of information communication, command control, error calibration and compensation, geometric element analysis and display can also be realized. The software system is divided into six modules, including the interconnect communication and on-line control module, error calibration and compensation module, data analysis module, database management module, 3D display of geometrical elements and man-machine interface. The design and construction of each module is described in detail which can help customers realize different functions throughout the measuring process.

关键词： Laser tracking system coordinate measurement system software design and implementation

来源：评论

学校读者我要写书评

暂无评论

design and implementation of an Integrated software System for Managing Research Activities in Universities 7

Design and Implementation of an Integrated Software System f...

引用

7th RoEduNet International Conference

作者： Andreica, Alina Bianca Agachi, Paul Serban Univ Babes Bolyai R-3400 Cluj Napoca Romania

ISBN: (纸本)9789736623936

The study focuses on the design and implementation of a dedicated software system for managing university research activity as a tool for quantitative research evaluation and support in designing competitive strategies in the field. We present the software system for Research Management that has been created and implemented at Babes-Bolyai University its architecture & design principles and its significant impact in research activity management. The impact on managing research activity is important not only for the members of the academic & research staff but especially for research management levels: chairs, institutes, departments, faculties, university

关键词： distributed information system research activity management software design and implementation

来源：评论

学校读者我要写书评

暂无评论

From tuple spaces to tuple centres

引用

SCIENCE OF COMPUTER PROGRAMMING 2001年第3期41卷 277-294页

作者： Omicini, A Denti, E Univ Bologna DEIS LIA I-40136 Bologna Italy

A tuple centre is a tuple space whose behaviour can be defined by means of reactions to communication events. In this paper, we motivate and define the notion of tuple centre, both conceptually and formally. Then, we show how adopting a tuple centre for the coordination of a multiagent system can benefit both the system design and the overall system performance. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： coordination multiagent systems software engineering software design and implementation distributed computing

来源：评论

学校读者我要写书评

暂无评论

Speeding up CRC32C computations with Intel CRC32 instruction

引用

INFORMATION PROCESSING LETTERS 2012年第5期112卷 179-185页

作者： Gueron, Shay Univ Haifa Dept Math IL-31999 Haifa Israel Intel Corp Israel Dev Ctr Haifa Israel

Intel has recently introduced a new instruction, namely CRC32, to address a computational bottleneck in protocols such as ISCSI and RDMA that use CRC32C for data integrity checks. This instruction is designed to accumulate the CRC32C value of a buffer of arbitrary length, by a sequence of invocations that consume consecutive chunks of 8 bytes of the buffer per invocation. This instruction has latency of 3 cycles, and therefore using it serially allows software to process data at the rate of similar to 2.67 bytes per cycle. We introduce here an alternative algorithm for computing the CRC32C value of a buffer, using the same instruction. This algorithm converts the latency bounded computations to throughput oriented ones, and maximizes the utilization of the pipelined hardware that underlies the instruction, achieving speedup of a factor of almost 3. (C) 2011 Elsevier BM. All rights reserved.

关键词： Algorithms software design and implementation CRC ISCSI

来源：评论

学校读者我要写书评

暂无评论

Spiking neural nets with symbolic internal state

引用

INFORMATION PROCESSING LETTERS 2005年第6期95卷 529-536页

作者： O'Dwyer, C Richardson, D Univ Bath Bath BA2 7AY Avon England

A type of spiking neural net in which the internal state functions of the neurons are represented symbolically rather than numerically is described. This makes possible subtle forms of short term memory, but also raises both computational and mathematical problems. It is shown how interval arithmetic can be used for event driven simulation. Computational times are given for some tests of an implementation resulting from these ideas., Applications are briefly discussed. (c) 2005 Elsevier B.V. All rights reserved.

关键词： computational complexity software design and implementation spiking neural nets event driven simulation

来源：评论

学校读者我要写书评

暂无评论

A compact execution history for dynamic slicing

引用

INFORMATION PROCESSING LETTERS 2003年第3期85卷 145-152页

作者： Dhamdhere, DM Gururaja, K Ganu, PG Indian Inst Technol Dept Comp Sci & Engn Bombay Maharashtra India

A compact execution history for dynamic slicing of programs using the notion of critical statements in a program was developed. The slicing algorithm considered data and control dependences of all execution occurrences of a statement. Results showed that execution histories were at least an order of magnitude smaller than complete execution histories in most cases.

关键词： software design and implementation dynamic slicing execution history data dependence control dependence

来源：评论

学校读者我要写书评

暂无评论

Efficient implementation of algorithms for approximate exponentiation

引用

INFORMATION PROCESSING LETTERS 2008年第4期105卷 131-137页

作者： Kooshesh, A. Ravikumar, B. Sonoma State Univ Dept Comp Sci Rohnert Pk CA 94128 USA

We present efficient implementations of algorithms for the following fundamental problem: Given as input three positive integers x, y and j, compute the leading j digits of x(y). A special case of this problem (k = 2 and j = 1) was recently studied by Hirvensalo and Karhumaki [***, ***, Computing partial information out of uncomputable one-The first digit of 2 '' to base 3 as an example, in: Mathematical Foundations of Computer Science, in: Lecture Notes in Computer Science, Springer-Verlag, Inc., 2002] for which they presented a polynomial time algorithm. Specifically an algorithm of bit complexity O(n(2) log(3) n log log n) where n =: vertical bar y vertical bar is the number of digits in y. But their algorithm is not efficient in practice. For example, finding the leading digit of 2(y) where y is a 500 digit positive integer takes several hours. Hirvensalo and Karhumaki's algorithm is based on computing a rational approximation to In 2 (and a few other constants) to a high-degree of precision. Our approach is fundamentally different from theirs: we use a modified addition chain algorithm in which the multiplication is truncated to varying number of digits at various steps, followed by a self-tester that validates the truncation. Our algorithm runs several orders of magnitude faster. For example, on an input in which x and y have a few thousand digits, our program computes the leading 1000 digits in under 3 minutes. Since the approximate exponentiation has many application [***, A Las Vegas randomized approximation algorithm for approximate exponentiation and its applications, in preparation] we hope that our algorithm will stimulate further research on this problem. (c) 2007 Elsevier B.V. All rights reserved.

关键词： algorithms software design and implementation

来源：评论

学校读者我要写书评

暂无评论

software implementation strategies for power-conscious systems

引用

MOBILE NETWORKS & APPLICATIONS 2001年第3期6卷 291-305页

作者： Naik, K Wei, DSL Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada Fordham Univ Dept Comp & Informat Sci Bronx NY 10458 USA

A variety of systems with possibly embedded computing power, such as small portable robots, hand-held computers, and automated vehicles, have power supply constraints. Their batteries generally last only for a few hours before being replaced or recharged. It is important that all design efforts are made to conserve power in those systems. Energy consumption in a system can be reduced using a number of techniques, such as low-power electronics, architecture-level power reduction, compiler techniques, to name just a few. However, energy conservation at the application software-level. has not yet been explored. In this paper, we show the impact of various software implementation techniques on energy saving. Based on the observation that different instructions of a processor cost different amount of energy, we propose three energy saving strategies, namely (i) assigning live variables to registers, (ii) avoiding repetitive address computations, and (iii) minimizing memory accesses. We also study how a variety of algorithm design and implementation techniques affect energy consumption. In particular, we focus on the following aspects: (i) recursive versus iterative (with stacks and without stacks), (ii) different representations of the same algorithm, (iii) different algorithms - with identical asymptotic complexity - for the same problem, and (iv) different input representations. We demonstrate the energy saving capabilities of these approaches by studying a variety of applications related to power-conscious systems, such as sorting, pattern matching, matrix operations, depth-first search, and dynamic programming. From our experimental results, we conclude that by suitably choosing an algorithm for a problem and applying the energy saving techniques, energy savings in excess of 60% can be achieved.

关键词： low power system energy saving software design and implementation

来源：评论

学校读者我要写书评

暂无评论

Simultaneous image fusion and demosaicing via compressive sensing

引用

INFORMATION PROCESSING LETTERS 2016年第7期116卷 447-454页

作者： Yang, Bin Luo, Jie Guo, Ling Cheng, Fang South China Univ Coll Elect & Engn Hengyang 421001 Peoples R China

In this paper, a compressive sensing based simultaneous fusion and demosaicing method for raw data of single-chip imaging camera is introduced. In order to meet the incoherence constraints of compressive sensing theory, the popular Bayer CFA is replaced with a random panchromatic color filter array. Then, the demosaicing problem is cast as an ill-posed inverse problem inherently and the compressive sensing technology is employed to solve the inverse problem. The restored sparse coefficients of different images are further fused with l(1)-norm of the coefficients being served as activity measurements. The final fused image is reconstructed from the fused sparse coefficients. The extended joint sparse model is further used to exploit the inter-channel correlation of different color components. The simulation results illustrated in Experimental Section demonstrate that the proposed method gives both superior quantitative and qualitative performances. (C) 2016 Elsevier B.V. All rights reserved.

关键词： software design and implementation Image fusion Demosaicing

来源：评论

学校读者我要写书评

暂无评论

Two design patterns for data-parallel computation based on master-slave model

引用

INFORMATION PROCESSING LETTERS 1999年第4期70卷 197-204页

作者： Huang, KC Wang, FJ Tsai, JH Natl Chiao Tung Univ Dept Comp Sci & Informat Engn Hsinchu 30050 Taiwan Natl Ctr High Performance Comp Hsinchu Taiwan

This paper presents two design patterns useful for parallel computations of master-slave model. These patterns are concerned with task management and parallel and distributed data structures. They can be used to help addressing the issues of data partition and mapping, dynamic task allocation and management in parallel programming with the benefit of less programming efforts and better program structures. The patterns are described in object-oriented notation, accompanied with illustrative examples in C++. We also provide our experience in applying these patterns to two scientific simulation programs simulating Ising model and plasma physics respectively. Since master-slave model is a widely used parallel programming paradigm, the design patterns presented in this paper have large potential application in parallel computations. (C) 1999 Elsevier Science B.V. All rights reserved.

关键词： software design and implementation parallel processing design pattern

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：