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

IEEE Joint 19th International Symposium on Computational Intelligence and Informatics / 7th International Conference on Recent Achievements in Mechatronics, Automation, Computer Sciences and Robotics

作者： Domozi, Zsolt Takacs, Marta Molnar, Andras Obuda Univ Doctoral Sch Appl Informat & Math Budapest Hungary Obuda Univ John von Neumann Fac Informat Budapest Hungary

ISBN: (纸本)9781728156255

Nowadays, high resolution aerial or satellite photos can be taken, which can be appropriate for further analyses. Photos can be taken using a satellite, aircraft, a robot drone or even a multicopter. However, generally speaking, every solution results in similarly high-resolution images. Analyses can be conducted on the resulting aerial photos in the light of various criteria, which conditions can be determined by the customer. One such task can be the enumeration of pools built in areas with detached houses, which can constitute the basis for specific data. One of the most obvious automated procedures for the detection of objects is to use neural networks, which utilizing properly chosen teaching samples is subsequently able to decide about individual image parts whether they contain the desired object or not. In spite of a large number of teaching samples, a neural network may give a false-positive or a false-negative result in the image passed over for analysis. These mistakes can occur from the fact that the teaching samples and the photos of the areas examined were not taken in the same season, in the same time of day or that they do not show pools having the same maintenance level. Instead of the further teaching of the network, the mentioned mistakes can be eliminated using classical image analysis methods in a way that the results of individual procedures are fusioned. Such methods may be color coding analysis or Fuzzy-logic analysis based on some property in the image. Fuzzy-logic can be used to detect visual objects if there is a definite, distinctive property, like color range or color depth.

关键词： object detection neural-network HSV fuzzy system concurrent algorithms

来源：评论

学校读者我要写书评

暂无评论

Tasks in Modular Proofs of concurrent algorithms 1

引用

21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)

作者： Castaneda, Armando Hurault, Aurelie Queinnec, Philippe Roy, Matthieu Univ Nacl Autonoma Mexico Inst Matemat Mexico City DF Mexico Univ Toulouse IRIT Toulouse France UNAM Lab Solomon Lefschetz UMI LaSoL CNRSCONACYT Cuernavaca Morelos Mexico Univ Toulouse CNRS LAAS Toulouse France

ISBN: (数字)9783030349929

ISBN: (纸本)9783030349929;9783030349912

Proving correctness of distributed or concurrent algorithms is a mind-challenging and complex process. Slight errors in the reasoning are difficult to find, calling for computer-checked proof systems. In order to build computer-checked proofs with usual tools, such as Coq or TLA+, having sequential specifications of all base objects that are used as building blocks in a given algorithm is a requisite to provide a modular proof built by composition. Alas, many concurrent objects do not have a sequential specification. This article describes a systematic method to transform any task, a specification method that captures concurrent one-shot distributed problems, into a sequential specification involving two calls, set and get. This transformation allows system designers to compose proofs, thus providing a framework for modular computer-checked proofs of algorithms designed using tasks and sequential objects as building blocks. The Moir&Anderson implementation of renaming using splitters is an iconic example of such algorithms designed by composition.

关键词： Formal methods Verification concurrent algorithms Renaming

来源：评论

学校读者我要写书评

暂无评论

Tasks in modular proofs of concurrent algorithms

引用

INFORMATION AND COMPUTATION 2023年第1期292卷

作者： Castaneda, Armando Hurault, Aurelie Queinnec, Philippe Roy, Matthieu Univ Nacl Autonoma Mexico Inst Matemat Mexico City Mexico Univ Toulouse IRIT Toulouse France CNRS LAAS Toulouse France

Proving the correctness of distributed or concurrent algorithms is a complex process. Errors in the reasoning are hard to find, calling for computer-checked proof systems like Coq or TLA+. To use these tools, sequential specifications of base objects are required to build modular proofs by composition. Unfortunately, many concurrent objects lack a sequential specification. This article describes a method to transform any task, a specification of a concurrent one-shot distributed problem, into a sequential specification involving two calls, set and get. This enables designers to compose proofs, facilitating modular computer -checked proofs of algorithms built using tasks and sequential objects as building blocks. Moir & Anderson implementation of renaming using splitters, wait-free concurrent objects, is an algorithm designed by composition, but it is not modular. Using our transformation, a modular description of the algorithm is given in TLA+ and mechanically verified using the TLA+ Proof System. As far as we know, this is the first time this algorithm is mechanically verified. (c) 2023 Elsevier Inc. All rights reserved.

关键词： Formal methods Verification concurrent algorithms Renaming Splitter Linearizability Distributed tasks TLA plus

来源：评论

学校读者我要写书评

暂无评论

Pool Detection with concurrent algorithms

Pool Detection with Concurrent Algorithms

引用

International Symposium on Computational Intelligence and Informatics

作者： Zsolt Domozi Marta Takacs Andras Molnar Doctoral School of Applied Informatics and Mathematics Obuda University Budapest Hungary John von Neumann Faculty of Informatics Obuda University Budapest Hungary

ISBN: (数字)9781728156255

ISBN: (纸本)9781728156262

关键词： object detection neural-network HSV fuzzy system concurrent algorithms Object detection Fuzzy systems Neural network Simplexvirus HSV POOLS Parallel algorithms Pedagogy Teaching images bit depth detached houses Imagery (Psychotherapy)

来源：评论

学校读者我要写书评

暂无评论

Going Stateless in concurrent Evolutionary algorithms 5th

Going Stateless in Concurrent Evolutionary Algorithms

引用

5th Workshop on Engineering Applications (WEA)

作者： Merelo, Juan J. Garcia-Valdez, Jose-Mario Univ Granada CITIC Granada Spain Inst Tecnol Tijuana Calzada Tecnol S-N Tijuana Mexico

ISBN: (纸本)9783030003500;9783030003494

concurrent languages such as Perl 6 fully leverage the power of current multi-core and hyper-threaded computer architectures, and they include easy ways of automatically parallelizing code. However, to achieve more computational capability by using all threads and cores, algorithms need to be redesigned to be run in a concurrent environment;in particular, the use of a reactive, fully functional patterns need to turn the algorithm into a series of stateless steps, with simple functions that receive all the context and map it to the next stage. In this paper, we are going to analyze different versions of these stateless, reactive architectures applied to evolutionary algorithms, assessing how they interact with the characteristics of the evolutionary algorithm itself and show how they improve the scaling behavior and performance. We will use the Perl 6 language, which is a modern, concurrent language that was released recently and is still under very active development.

关键词： concurrent algorithms Distributed computing Stateless algorithms Algorithm implementation Performance evaluation Heterogeneous distributed systems

来源：评论

学校读者我要写书评

暂无评论

Exploring concurrent and Stateless Evolutionary algorithms 1

引用

22nd International Conference on Applications of Evolutionary Computation (EvoApplications) Held as Part of EvoStar Conference

作者： Merelo, Juan J. Laredo, J. L. J. Castillo, Pedro A. Garcia-Valdez, Jose-Mario Rojas-Galeano, Sergio Univ Granada CITIC Granada Spain Univ Havre Normandie RI2C LITIS Le Havre France Inst Tecnol Tijuana Calzada Tecnol S-N Tijuana Mexico Univ Dist Francisco Jose de Caldas Sch Engn Bogota Colombia

ISBN: (数字)9783030166922

ISBN: (纸本)9783030166915;9783030166922

Creating a concurrent and stateless version of an evolutionary algorithm implies changes in its algorithmic model. From the performance point of view, the main challenge is to balance computation with communication, but from the evolutionary point of view another challenge is to keep diversity high so that the algorithm is not stuck in local minima In a concurrent setting, we will have to find the right balance so that improvements in both facets do not cancel out. In this paper we address such an issue, by exploring the space of parameters of a population based concurrent evolutionary algorithm that yields to find out the best combination for a particular problem.

关键词： concurrent algorithms Distributed computing Stateless algorithms Algorithm implementation Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Correctness-preserving derivation of concurrent garbage collection algorithms

引用

ACM SIGPLAN NOTICES 2006年第6期41卷 341-353页

作者： Vechev, Martin T. Yahav, Eran Bacon, David F. Univ Cambridge Cambridge CB2 1TN England

Constructing correct concurrent garbage collection algorithms is notoriously hard. Numerous such algorithms have been proposed, implemented, and deployed - and yet the relationship among them in terms of speed and precision is poorly understood, and the validation of one algorithm does not carry over to others. As programs with low latency requirements written in garbage-collected languages become part of society's mission-critical infrastructure, it is imperative that we raise the level of confidence in the correctness of the underlying system, and that we understand the trade-offs inherent in our algorithmic choice. In this paper we present correctness-preserving transformations that can be applied to an initial abstract concurrent garbage collection algorithm which is simpler, more precise, and easier to prove correct than algorithms used in practice - but also more expensive and with less concurrency. We then show how both pre-existing and new algorithms can be synthesized from the abstract algorithm by a series of our transformations. We relate the algorithms formally using a new definition of precision, and informally with respect to overhead and concurrency. This provides many insights about the nature of concurrent collection, allows the direct synthesis of new and useful algorithms, reduces the burden of proof to a single simple algorithm, and lays the groundwork for the automated synthesis of correct concurrent collectors.

关键词： concurrent garbage collection concurrent algorithms verification synthesis

来源：评论

学校读者我要写书评

暂无评论

algorithms, concurrent processors, and computer science education: or, “think concurrently or capitulate?” 85

Algorithms, concurrent processors, and computer science educ...

引用

Proceedings of the sixteenth SIGCSE technical symposium on Computer science education

作者： Elliot I. Organick Department of Computer Science University of Utah Salt Lake City UT

来源：评论

学校读者我要写书评

暂无评论

Fast and Portable concurrent FIFO Queues With Deterministic Memory Reclamation

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2022年第3期33卷 604-616页

作者： Giersch, Oliver Nolte, Joerg Brandenburg Univ Technol BTU Cottbus Senftenberg D-03046 Cottbus Germany

In this article we present an algorithm for a high performance, unbounded, portable, multi-producer/multi-consumer, lock-free FIFO (first-in first-out) queue. Aside from its competitive performance on current hardware, it is further characterized by its integrated memory reclamation mechanism, which is able to reliably and deterministically de-allocate nodes as soon as the final operation with a reference has concluded, similar to reference counting. This differentiates our approach from most other lock-free data structures, which usually require external (generic) memory reclamation or garbage collection mechanisms such as hazard pointers. Our deterministic memory reclamation mechanism completely prevents the build up of memory awaiting reclamation and is hence very memory efficient, yet it does not introduce any substantial performance overhead. By utilizing concrete knowledge about the internal structure and access patterns of our queue, we are able to construct and constrain the reclamation mechanism in such a way that keeps the overhead for memory management almost entirely out of the common fast path. The presented algorithm is portable to all modern 64-bit processor architectures, as it only relies on the commonly available and lock-free atomic synchronization primitives compare-and-swap and fetch-and-add.

关键词： Memory management Instruction sets Hazards Indexes Runtime Arrays Synchronization concurrent algorithms lock-free non-blocking data structures memory reclamation first in-first out (FIFO) queues shared memory

来源：评论

学校读者我要写书评

暂无评论

The concurrent Learned Indexes for Multicore Data Storage

引用

ACM TRANSACTIONS ON STORAGE 2022年第1期18卷 p8:1-8:35页

作者： Wang, Zhaoguo Chen, Haibo Wang, Youyun Tang, Chuzhe Wang, Huan Shanghai Jiao Tong Univ Shanghai AI Lab Inst Parallel & Distributed Syst 800 Dongchuan Rd Shanghai Peoples R China Minist Educ Engn Res Ctr Domain Specif Operating Syst Shanghai Peoples R China

We present XIndex, which is a concurrent index library and designed for fast queries. It includes a concurrent ordered index (XIndex-R) and a concurrent hash index (XIndex-H). Similar to a recent proposal of the learned index, the indexes in XIndex use learned models to optimize index efficiency. Compared with the learned index, for the ordered index, XIndex-R is able to handle concurrent writes effectively and adapts its structure according to runtime workload characteristics. For the hash index, XIndex-H is able to avoid the resize operation blocking concurrent writes. Furthermore, the indexes in XIndex can index string keys much more efficiently than the learned index. We demonstrate the advantages of XIndex with YCSB, TPC-C (KV), which is a TPC-C-inspired benchmark for key-value stores, and micro-benchmarks. Compared with ordered indexes of Masstree and Wormhole, XIndex-R achieves up to 3.2x and 4.4x performance improvement on a 24-core machine. Compared with hash indexes of Intel TBB HashMap, XIndex-H achieves up to 3.1x speedup. The performance further improves by 91% after adding the optimizations on indexing string keys. The library is open-sourced.(1)

关键词： Learned indexes concurrent algorithms indexing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：