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

13th IEEE International Scientific and Technical Conference on Computer Sciences and Information Technologies (CSIT)

作者： Tsmots, Ivan Skorokhoda, Oleksa Antoniv, Volodymyr Rabyk, Vasyl Lviv Polytech Natl Univ Dept Automated Control Syst Lvov Ukraine Ivan Franko Natl Univ Lviv Dept Radio Phys & Comp Technol Lvov Ukraine

ISBN: (纸本)9781538664636

The vertically-parallel method for sorting one-dimensional arrays of numbers has been developed. The graph of the algorithm for vertically-parallel sorting of arrays has been built. The structure of the hardware for vertically-parallel sorting of one-dimensional arrays of large numbers has been designed. Components of the device for vertically-parallel sorting of arrays of numbers using FPGA have been implemented.

关键词： sorting algorithms vertically-parallel calculations VLSI FPGA hardware implementation

来源：评论

学校读者我要写书评

暂无评论

Cooperative Multiple Agent-Based Algorithm for Evacuation Planning for Victims with Different Urgencies

引用

JOURNAL OF AEROSPACE INFORMATION SYSTEMS 2018年第6期15卷 382-395页

作者： Oh, Byung Hoon Kim, Kwangyeon Choi, Han-Lim Hwang, Inseok Purdue Univ Sch Aeronaut & Astronaut W Lafayette IN 47907 USA Korea Adv Inst Sci & Technol Dept Aerosp Engn Daejeon 305701 South Korea

A well-organized evacuation plan is crucial to save more lives in the aftermath of natural disasters. In this paper, a mathematical model and an efficient solution approach are proposed for optimal planning of a fleet of aerial vehicles to save victims with different levels of urgency. Evacuation planning is a task assignment problem combined with scheduling of aerial vehicles with different capabilities while considering complex conditions such as multiple bases for the vehicles, victims with different urgency levels at multiple locations, and multiple safe locations (for example, hospitals and refuges). In our previous work, the problem was formulated as integer linear programming to provide optimal solution. Because the integer linear programming, however, is intractable for a large-scale disaster problem, a heuristic method called the cooperative multiagent-based algorithm is proposed to solve the large-scale problem in practical time. The proposed algorithm defines simple rules for vehicle agents and demand agents (victims), and it applies cooperative interaction between agents to efficiently find a suboptimal solution. The computational efficiency and the performance of the algorithm are demonstrated using illustrative numerical examples based on realistic data.

关键词： Numerical algorithms Mathematical Models Helicopters Particle Swarm Optimization Federal Emergency Management Agency Unmanned Aerial Vehicle Aircraft Operations Genetic Algorithm Flight Vehicle sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

Expected size of a tree in the fixed point forest

引用

DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE 2019年第2期21卷 1页

作者： Regan, Samuel Slivken, Erik Univ Calif Davis Davis CA 95616 USA Dartmouth Coll Hanover NH 03755 USA

We study the local limit of the fixed-point forest, a tree structure associated to a simple sorting algorithm on permutations. This local limit can be viewed as an infinite random tree that can be constructed from a Poisson point process configuration on [0,1](N). We generalize this random tree, and compute the expected size and expected number of leaves of a random rooted subtree in the generalized version. We also obtain bounds on the variance of the size.

关键词： sorting algorithms random trees Poisson point processes random permutations

来源：评论

学校读者我要写书评

暂无评论

Efficient computation of multivariate empirical distribution functions at the observed values

引用

COMPUTATIONAL STATISTICS 2018年第3期33卷 1413-1428页

作者： Lee, David Joe, Harry Univ British Columbia Dept Stat Vancouver BC V6T 1Z4 Canada

Consider the evaluation of model-based functions of cumulative distribution functions that are integrals. When the cumulative distribution function does not have a tractable form but simulation of the multivariate distribution is easily feasible, we can evaluate the integral via a Monte Carlo sample, replacing the model-based distribution function by the empirical distribution function. Given a simulation sample of size N, the naive method uses comparisons to compute the empirical distribution function at all N sample vectors. To obtain faster computational speed when N needs to be large to achieve a desired accuracy, we propose methods modified from the popular merge sort and quicksort algorithms that preserve their average complexity in the bivariate case. The modified merge sort algorithm can be extended to the computation of a d-dimensional empirical distribution function at the observed values with complexity. Simulation studies suggest that the proposed algorithms provide substantial time savings when N is large.

关键词： Integral evaluation Joint probabilities Monte Carlo simulation sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

Proof Techniques for Synthesis of sorting algorithms

Proof Techniques for Synthesis of Sorting Algorithms

引用

13th International Symposium on Symbolic and Numeric algorithms for Scientific Computing (SYNASC)

作者： Dramnesc, Isabela Jebelean, Tudor West Univ Dept Comp Sci Timisoara Romania Johannes Kepler Univ Linz Symbol Computat Res Inst Linz Austria

ISBN: (纸本)9780769546308

In the context of constructive synthesis of sorting algorithms, starting from the specification of the problem (input and output conditions), the proof of existence of a sorted tuple is performed inductively and we design, implement, and experiment with different proof techniques: First we use a back-chaining mechanism similar to a Prolog engine for first order logic, in which meta-variables are used for finding the existential witnesses. In order to overcome the search space explosion, we introduce various specific prove-solve methods for the theory of tuples. For instance, the equivalence relation on tuples "have same elements" can be treated using a normal form based on multisets - this leads to a very efficient inference rule for rewriting. When reasoning about sorting, we also have an ordering relation between elements. We extend this to an ordering between an element and a tuple, and even between tuples. Ordering relations create specific problems in Prolog style reasoning, because of transitivity and reflexivity. We demonstrate that ordering can be treated very efficiently by decomposing atomic statements into simpler ones (containing only symbols instead of terms), both for goals (backward reasoning) as well as for assumptions (forward reasoning). This leads to an interesting combination of backward and forward inferences which goes beyond and complements Prolog style reasoning. Finally, we develop a solving mechanism for finding sorted tuples, which performs the proof more efficiently, by combining relatively simple inference rules and small searches with goal directed solving rules. The techniques are implemented in the Theorema system and are able to produce automatically proofs and algorithms for various problems: Insertion Sort, Insertion, Merge Sort, and Merge. Besides the special proof techniques, this work also gives useful hints about finding appropriate induction principles for tuples, as well as for the construction of appropriate collections of p

关键词： sorting algorithms synthesis extraction proof techniques induction Theorema

来源：评论

学校读者我要写书评

暂无评论

HANDSON-COMPUTING: Promoting Algorithmic Thinking Through Haptic Educational Robots 11th

HANDSON-COMPUTING: Promoting Algorithmic Thinking Through Ha...

引用

11th International Conference on Haptics - Science, Technology, and Applications (EuroHaptics)

作者： Otaran, Ata Tokatli, Ozan Patoglu, Volkan Sabanci Univ Fac Engn & Nat Sci Istanbul Turkey

ISBN: (纸本)9783319933993;9783319933986

Computational thinking lies at the intellectual core of computing. Promoting computational thinking ability requires that students are provided with a clear understanding of the fundamental principles and concepts of computer science, including abstraction, logic, algorithms, and data representation. We propose to use force-feedback educational robotic devices for hands-on teaching of computational thinking. The addition of haptic feedback for teaching abstract concepts of computer science offers several advantages, as haptic feedback (i) enables an effective means of data hiding, (ii) ensures a high level of student engagement by adding another pathway for perception and enabling active physical interaction, and (iii) improves student motivation through the novelty effect. Moreover, visually impaired students may benefit from replacement of visualization with haptic feedback. We present a force-feedback application for teaching sorting algorithms and report initial student evaluations of integrating haptics to promote computational thinking.

关键词： Computational thinking sorting algorithms Series elastic actuation Educational robots Force control

来源：评论

学校读者我要写书评

暂无评论

An Efficient O(N) Comparison-Free sorting Algorithm

引用

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 2017年第6期25卷 1930-1942页

作者： Abdel-Hafeez, Saleh Gordon-Ross, Ann Jordan Univ Sci & Technol Coll Comp & Informat Technol Irbid 22110 Jordan Univ Florida Dept Elect & Comp Engn Gainesville FL 32611 USA Univ Florida Natl Sci Fdn Ctr High Performance Reconfigurable Comp Gainesville FL 32611 USA

In this paper, we propose a novel sorting algorithm that sorts input data integer elements on-the-fly without any comparison operations between the data-comparison-free sorting. We present a complete hardware structure, associated timing diagrams, and a formal mathematical proof, which show an overall sorting time, in terms of clock cycles, that is linearly proportional to the number of inputs, giving a speed complexity on the order of O(N). Our hardware-based sorting algorithm precludes the need for SRAM-based memory or complex circuitry, such as pipelining structures, but rather uses simple registers to hold the binary elements and the elements' associated number of occurrences in the input set, and uses matrix-mapping operations to perform the sorting process. Thus, the total transistor count complexity is on the order of O(N). We evaluate an application-specified integrated circuit design of our sorting algorithm for a sample sorting of N = 1024 elements of size K = 10-bit using 90-nm Taiwan Semiconductor Manufacturing Company (TSMC) technology with a 1 V power supply. Results verify that our sorting requires approximately 4-6 mu s to sort the 1024 elements with a clock cycle time of 0.5 GHz, consumes 1.6 mW of power, and has a total transistor count of less than 750 000.

关键词： 90-nm TSMC comparison free Gigahertz clock cycle one-hot weight representation sorting algorithms SRAM speed complexity O(N)

来源：评论

学校读者我要写书评

暂无评论

A New Modified sorting Algorithm: A Comparison with State of the Art 6

A New Modified Sorting Algorithm: A Comparison with State of...

引用

6th Mediterranean Conference on Embedded Computing (MECO)

作者： Idrizi, Florim Rustemi, Avni Dalipi, Fisnik Tetovo Univ Dept Informat Tetovo Macedonia Linnaeus Univ Dept Comp Sci Vaxjo Sweden

ISBN: (纸本)9781509067428

Choosing the right method to sort numbers has a huge effect on how quickly a computer can process a task The most used sorting algorithms today have been discovered years ago, and to this day, they have been the best for the job as there was no other competitive algorithm. Through this paper, we make an analysis and comparison between the state of the art algorithms in sorting and based on their analogy of functionality, we propose a new modified sorting algorithm. We then present a brief description of the new modified algorithm, conduct comparisons with the state of the art, and finally we give conclusions about the performance of the proposed algorithm versus the most popular sorting algorithms. Moreover, we highlight the benefits of using this algorithm in different fields by various business companies or software developers, in cases when they need faster and easier sorting for their data management.

关键词： sorting algorithms comparison and analyses state of the art experimental setup implementation

来源：评论

学校读者我要写书评

暂无评论

NASA Technical Reports Server (Ntrs) 19920001759: a Fast sorting Algorithm for a Hypersonic Rarefied Flow Particle Simulation on the Connection MacHine

引用

2017年

NASA Technical Reports Server (Ntrs) 19920001759: a Fast sorting Algorithm for a Hypersonic Rarefied Flow Particle Simulation on the Connection MacHine by NASA Technical Reports Server (Ntrs); published by

关键词： (ntrs) 19920001759: algorithm algorithms computerized simulation connection dagum, leonardo hypersonic hypersonic flow massively parallel processors nasa technical reports server (ntrs) ranking rarefied gas dynamics sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

Neurons Can Sort Data Efficiently 16th

Neurons Can Sort Data Efficiently

引用

16th International Conference on Artificial Intelligence and Soft Computing (ICAISC)

作者： Horzyk, Adrian AGH Univ Sci & Technol Dept Automat & Biomed Engn Mickiewicza Ave 30 PL-30059 Krakow Poland

ISBN: (纸本)9783319590639;9783319590622

This paper introduces an efficient sorting algorithm that uses new models of receptors and neurons which apply the time-conditional approach characteristic for nervous systems. These models have been successfully applied to automatically construct neural graphs that consolidate representation of all sorted objects and relations between them. The introduced parallely working algorithm sorts objects simultaneously for all attributes constructing an active associative neural graph representing all sorted objects in linear time. The sequential version works in linear or sub-linearithmic time. The paper argues that neurons can be used for efficient sorting of objects and the constructed network can be further used to explore relationships between these objects.

关键词： Brain-inspired computations Neuron models sorting algorithms ASSORT Associative representation Computational complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：