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

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

来源：评论

学校读者我要写书评

暂无评论

concurrent depth-first search algorithms based on Tarjan's algorithm

引用

INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER 2016年第2期18卷 129-147页

作者： Lowe, Gavin Univ Oxford Dept Comp Sci Oxford England

We present concurrent algorithms, based on depth-first search, for three problems relevant to model checking: given a state graph, to find its strongly connected components, which states are in loops, and which states are in "lassos". Each algorithm is a variant of Tarjan's algorithm. Our algorithms typically exhibit a three-or four-fold speed-up over the corresponding sequential algorithms on an eight-core machine.

关键词： Depth-first search concurrent algorithm Strongly connected components Tarjan's algorithm Model checking

来源：评论

学校读者我要写书评

暂无评论

A concurrent spectral-screening PCT algorithm for remote sensing applications

引用

Information Fusion 2000年第2期1卷 89-97页

作者： Achalakul, Tiranee Taylor, Stephen 2-106 CST building Syracuse University Syracuse NY 13244 United States

The paper presents a concurrent algorithm for remote sensing applications that provides significant performance and image quality enhancements over conventional uniprocessor principal component transform (PCT) techniques. The algorithm combines spectral angle classification, principal component transform, and human centered color mapping. It is evaluated from an image quality perspective using images collected with the hyper-spectral digital imagery collection experiment (HYDICE) sensor, an airborne imaging spectrometer. These images correspond to foliated scenes taken from an altitude of 2000-7500 m at wavelengths between 400 nm and 2.5 μm. The scenes contain mechanized vehicles sitting in open fields as well as under camouflage. The algorithm operates with close to linear speedup on shared memory multiprocessors and can be readily extended to operate on multiple, low-cost PC-style servers connected with high-performance networking. A simple analytical model is outlined that allows the impact on performance of practical, application-specific properties to be assessed. These properties include image resolution, number of spectral bands, increases in the number of processors, changes in processor technology, networking speeds and system clock rates. © 2000 Elsevier Science B.V. All rights reserved.

关键词： Color mapping scheme concurrent algorithm Image fusion Principal component transform

来源：评论

学校读者我要写书评

暂无评论

concurrent Competitive Wave Approach toHyper-Distributed Hyper-Parallel AIProcessing

引用

Journal of Computer Science & Technology 1997年第6期12卷 543-554页

作者：帅典勋 Department of Computer Science East China University of Science and Technology Shanghai State Key Laboratory of Intelligence Technology and System Tsinghua University Beijing

This paper preseflts a new approach of the synchronous homogeneous concurrent propagation of competitive waves for the purpose of hyper-distributed hyper-parallel heuristic problem-solving. The concurrent algorithm, mechanism and their properties are given. In comparison with the traditional AI algorithms, the approach is featured by the knowledge-based problem-solving in the distributed parallel environment, the feasibility for hardware implementation and the various applications.

关键词： Hyper-distributed hyper-parallel processing synchronous homogeneous competitive wave heuristic search implicit AND/OR graph concurrent algorithm

来源：评论

学校读者我要写书评

暂无评论

concurrent manipulation of binary search trees

引用

ACM Transactions on Database Systems (TODS) 1980年第3期5卷 354-382页

作者： Kung, H.T. Lehman, Philip L. Department of Computer Science Carnegie-Mellon University Pittsburgh PA 15213 United States

The concurrent manipulation of a binary search tree is considered in this paper. The systems presented can support any number of concurrent processes which perform searching, insertion, deletion, and rotation (reorganization) on the tree, but allow any process to lock only a constant number of nodes at any time. Also, in the systems, searches are essentially never blocked. The concurrency control techniques introduced in the paper include the use of special nodes and pointers to redirect searches, and the use of copies of sections of the tree to introduce many changes simultaneously and therefore avoid unpredictable interleaving. Methods developed in this paper may provide new insights into other problems in the area of concurrent database manipulation. © 1980, ACM. All rights reserved.

关键词： binary search trees concurrency controls concurrent algorithm consistency correctness data structures databases locking protocols

来源：评论

学校读者我要写书评

暂无评论

A Semi-Blind Frequency-Domain concurrent Equalizer for OFDM Systems

A Semi-Blind Frequency-Domain Concurrent Equalizer for OFDM ...

引用

5th International Conference on Wireless and Mobile Communications

作者： Lopes, Estevan M. Cardoso, Fabbryccio A. C. M. Arantes, Dalton S. Natl Inst Telecommun INATEL Dept Commun Santa Rita Do Sapucai Brazil State Univ Campinas UNICAMP Sch Elect & Comp Engn Dept Commun Campinas Brazil

ISBN: (纸本)9780769537504

This paper proposes a semi-blind algorithm for frequency-domain (post-FFT) soft-decision concurrent equalization in OFDM systems. The objective is to improve system performance by increasing data throughput or decreasing power requirements, when compared with pilot based conventional channel estimation techniques. The Constant Modulus algorithm and the Soft Decision-Directed technique were concurrently employed to adjust the coefficients of a post-FFT equalizer bank. The algorithm works in a semi-blind mode because it uses channel information, obtained from pilot subcarriers, to initialize and to supervise the equalizer bank when pilots are present, otherwise remaining blind in the equalization process. To support such a concurrent equalization, the system should provide pilot subcarriers only in the first symbol of each OFDM super-frame, allowing algorithm initialization when the receiver is turned on. In the remaining super-frame symbols, pilot subcarriers can be suppressed to increase the overall system throughput.

关键词： OFDM equalization concurrent algorithm Semi-blind equalization

来源：评论

学校读者我要写书评

暂无评论

Discrete element modelling approach to assessment of granular properties in concrete

引用

Journal of Zhejiang University-Science A(Applied Physics & Engineering) 2011年第5期12卷 335-344页

作者： Piet STROEVEN Huan HE Martijn STROEVEN Faculty of Civil Engineering and Geosciences Delfi University of Technology Stevimveg 1 2628 CN Delft the Netherlands Faculty of Applied Sciences University of Liege Chemin des Chevreuils 1 4000 Liege Belgium

This paper presents the technological relevance of a concurrent algorithm-based discrete element modelling (DEM) system, HADES. This new system is the successor of SPACE that is limited to spherical grains only. It can realistically simulate the packing of arbitrary-shaped particles up to the fully compacted state. Generation of families of such particles, i.e., generally representing aggregate of fluvial origin and crushed rock, respectively, and the forming way of particulate structure are described. Similarly shaped particles are proposed for simulation of cement paste because of conformity with experimental results obtained by the X-ray tomography method. Technologically relevant territories inside and outside concrete technology are presently explored in this efficient, reliable, and economic way. Some results obtained by this DEM approach are presented.

关键词： Cementitious materials Granular properties concurrent algorithm Discrete element modelling (DEM) Shape Particles

来源：评论

学校读者我要写书评

暂无评论

A Behavioural Theory of Recursive algorithms

引用

FUNDAMENTA INFORMATICAE 2020年第1期177卷 1-37页

作者： Borger, Egon Schewe, Klaus-Dieter Univ Pisa Dipartimento Informat Pisa Italy Zhejiang Univ UIUC Inst Haining Peoples R China

"What is an algorithm?" is a fundamental question of computer science. Gurevich's behavioural theory of sequential algorithms (aka the sequential ASM thesis) gives a partial answer by defining (non-deterministic) sequential algorithms axiomatically, without referring to a particular machine model or programming language, and showing that they are captured by (nondeterministic) sequential Abstract State Machines (nd-seq ASMs). However, recursive algorithms such as mergesort are not covered by this theory, as has been pointed out by Moschovakis, who had independently developed a different framework to mathematically characterize the concept of (in particular recursive) algorithm. In this article we propose an axiomatic definition of the notion of sequential recursive algorithm which extends Gurevich's axioms for sequential algorithms by a Recursion Postulate and allows us to prove that sequential recursive algorithms are captured by recursive Abstract State Machines, an extension of nd-seq ASMs by a CALL rule. Applying this recursive ASM thesis yields a characterization of sequential recursive algorithms as finitely composed concurrent algorithms all of whose concurrent runs are partial-order runs.

关键词： recursive algorithm behavioural theory abstract state machine concurrent algorithm partial-order run

来源：评论

学校读者我要写书评

暂无评论

Mutual exclusion by four shared bits with not more than quadratic complexity

引用

SCIENCE OF COMPUTER PROGRAMMING 2015年 102卷 57-75页

作者： Hesselink, Wim H. Univ Groningen Dept Comp Sci NL-9700 AK Groningen Netherlands

For years, the mutual exclusion algorithm of Lycklama and Hadzilacos (1991) [21] was the optimal mutual exclusion algorithm with the first-come-first-served property, with a minimal number of (non-atomic) communication variables (5 bits per thread). Recently, Aravind published an improvement of it, which uses 4 bits per thread and has simplified waiting conditions. This algorithm is extended here with fault tolerance, and it is verified by assertional methods, using the proof assistant PVS. Progress is proved by means of UNITY logic. The paper proposes a new measure of concurrent time complexity, and proves that the concurrent complexity for throughput of the present algorithm is not more than quadratic in the number of threads. (C) 2015 Elsevier B.V. All rights reserved.

关键词： concurrent algorithm Mutual exclusion Fault tolerance Time complexity Verification

来源：评论

学校读者我要写书评

暂无评论

Recoverable mutual exclusion with abortability

引用

COMPUTING 2022年第10期104卷 2225-2252页

作者： Jayanti, Prasad Joshi, Anup Dartmouth Coll Hanover NH 03755 USA

Recent advances in non-volatile main memory (NVM) technology have spurred research on algorithms that are resilient to intermittent failures that cause processes to crash and subsequently restart. In this paper we present a Recoverable Mutual Exclusion (RME) algorithm that supports abortability. Our algorithm guarantees FCFS and a strong liveness property: processes do not starve even in runs consisting of infinitely many crashes, provided that a process crashes at most a finite number of times in each of its attempts. On DSM and Relaxed-CC multiprocessors, a process incurs O (min(k, log n)) RMRs in a passage and O(f + min (k, log n)) RMRs in an attempt, where n is the number of processes that the algorithm is designed for, k is the point contention of the passage or the attempt, and f is the number of times that p crashes during the attempt. On a Strict CC multiprocessor, the passage and attempt complexities are O(n) and 0(f + n), respectively. Our algorithm uses only the read, write, and CAS operations, which are commonly supported by multiprocessors. Attiya, Hendler, and Woelfel proved that, with any mutual exclusion algorithm, a process incurs at least 52 (log n) RMRs in a passage, if the algorithm uses only the read, write, and CAS operations (in: Proc. of the Fortieth ACM Symposium on Theory of Computing, New York, NY, USA, 2008). This lower bound implies that the worst-case RMR complexity of our algorithm is optimal for the DSM and Relaxed CC multiprocessors. This paper is an expanded version of our conference paper as reported by Jayanti and Joshi (in: Atig and Schwarzmann (eds) Networked Systems. Springer International Publishing, Cham, 2019), which presented the first Recoverable Mutual Exclusion (RME) algorithm that supports abortability. This algorithm from our conference paper (in: Atig and Schwarzmann (eds) Networked Systems. Springer International Publishing, Cham, 2019) admits starvation when there are infinitely many aborts in a run. In this paper,

关键词： concurrent algorithm Synchronization Mutual exclusion Recoverable algorithm Fault tolerance Non-volatile main memory Shared memory Multi-core algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：