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

8th International Joint Conference on Computational Intelligence

作者： Raje, Shikhar Singh, Navjyoti Mohan, Shobhit Int Inst Informat Technol Ctr Exact Humanities Hyderabad Andhra Pradesh India Hyderabad Cent Univ Dept Econ Hyderabad Andhra Pradesh India

ISBN: (纸本)9789897582011

Markov Decision Processes (MDPs) and their variants are standard models in various domains of Artificial Intelligence. However, each model captures a different aspect of real-world phenomena and results in different kinds of computational complexity. Also, MDPs are recently finding use in the scenarios involving aggregation of preferences (such as recommendation systems, e-commerce platforms, etc.). In this paper, we extend one such MDP variant to explore the effect of including observations made by stochastic agents, on the complexity of computing optimal outcomes for voting results. The resulting model captures phenomena of a greater complexity than current models, while being closer to a real world setting. The utility of the theoretical model is discussed by application to the real world setting of crowdsourcing. We address a key question in the crowdsourcing domain, namely, the Exploration Vs. Exploitation problem, and demonstrate the flexibility of adaptation of MDP-based models in Dynamic Voting scenarios.

关键词： Preference Aggregation Stochastic Modelling Dynamic Voting Markov Decision Processes Computational Complexity algorithm analysis

来源：评论

学校读者我要写书评

暂无评论

The All Nearest Smaller Values Problem Revisited in Practice, Parallel and External Memory 24

The All Nearest Smaller Values Problem Revisited in Practice...

引用

36th ACM Symposium on Parallelism in algorithms and Architectures (SPAA)

作者： Sitchinava, Nodari Svenning, Rolf Univ Hawaii Manoa Honolulu HI 96822 USA Aarhus Univ Aarhus Denmark

ISBN: (纸本)9798400704161

We present a thorough investigation of the All Nearest Smaller Values (ANSV) problem from a practical perspective. The ANSV problem is defined as follows: given an array A consisting of n values, for each entry A(i) compute the largest index l < i and the smallest index r > i such that A(i) > A(l) and A(i) > A(r), i.e., the indices of the nearest smaller values to the left and to the right of A(i). The ANSV problem was solved by Berkman, Schieber, and Vishkin [J. algorithms, 1993] in the PRAM model. Their solution in the CREW PRAM model, which we will refer to as the BSV algorithm, achieves optimal O(n) work and O(log n) span. Until now, the BSV algorithm has been perceived as too complicated for practical use, and we are not aware of any publicly available implementations. Instead, the best existing practical solution to the ANSV problem is the implementation by Shun and Zhao presented at DCC'13. They implemented a simpler O(n log n)-work algorithm with an additional heuristic first proposed by Blelloch and Shun at ALENEX'11. We refer to this implementation as the BSZ algorithm. In this paper, we implement the original BSV algorithm and demonstrate its practical efficiency. Despite its perceived complexity, our results show that its performance is comparable to the BSZ algorithm. We also present the first theoretical analysis of the heuristic implemented in the BSZ algorithm and show that it provides a tunable trade-off between optimal work and optimal span. In particular, we show that it achieves O(n(1 + log n/k)) work and O(k(1 + log n/k)) span, for any integer parameter 1 <= k <= n. Thus, for k = Theta(log n), the BSZ algorithm can be made to be work-optimal, albeit at the expense of increased span compared to BSV. Our discussion includes a detailed examination of different input types, particularly highlighting that for random inputs, the low expected distance between values and their nearest smaller values renders simple algorithms efficient. Finally, we analy

关键词： algorithm analysis parallel algorithms external memory PRAM algorithm engineering all nearest smaller values problem ANSV

来源：评论

学校读者我要写书评

暂无评论

Creating Tangible VR Spaces for Exploring algorithm Complexity and Data Structures 53

Creating Tangible VR Spaces for Exploring Algorithm Complexi...

引用

53rd IEEE ASEE Frontiers in Education International Conference, FIE 2023

作者： Green, Nathan School of Technology and Innovation Marymount University ArlingtonVA United States

ISBN: (纸本)9798350336429

This research explores the use of virtual reality (VR) in Computer Science education to enhance the visualization and understanding of algorithm complexity and data structures. The proposed VR system aims to provide undergraduate students with a more tangible and interactive learning experience, allowing them to interact with algorithms and data structures in a virtual environment. Through the implementation of immersive techniques and real-time visualization, students can manipulate and observe the behavior of these abstract concepts. The VR application covers topics such as algorithm analysis, queues, stacks, tree structures, and algorithmic complexity. The use of VR in Computer Science education has the potential to transform teaching methods and provide instructors with valuable supplementary materials. Future studies will evaluate the impact of VR on student learning outcomes, and the VR application will be made available for further research and instruction in the field. © 2023 IEEE.

关键词： algorithm analysis Computer Science Data Structures Virtual Reality XR

来源：评论

学校读者我要写书评

暂无评论

On the Expressive Power of Declarative Constructs in Interactive Document Scripts 19

On the Expressive Power of Declarative Constructs in Interac...

引用

19th ACM Symposium on Document Engineering (DocEng)

作者： Boyer, John M.

ISBN: (纸本)9781450368872

It is difficult to generally compare the succinctness of declarative versus imperative programming as source code size varies. In imperative programs, basic operations have constant cost, but they tend to be more verbose than declarative programs, which increases the potential for defects. This paper presents a novel approach for a generalized comparison by transforming the problem into comparing executed code size of a benchmark imperative algorithm with a partially declarative variant of the same algorithm. This allows input size variation to substitute for source code size variation. For implementation, we use a multiparadigm language called XForms that contains both declarative XPath expressions and imperative script actions for interacting with XML data within web and office documents. A novel partially declarative variant of the quicksort is presented. Amortized analysis shows that only O(n) imperative actions are executed, so the expressive power of the declarative constructs is at least Omega(log n). In general, declarative constructs can have an order of magnitude expressive power advantage compared with only using basic imperative operations. The performance cost factor of the expressive power advantage was determined to be O(log(2) n) based on a novel dynamic projection from the generalized tree structure of XML data to a height balanced binary tree.

关键词： Interactive documents Multiparadigm languages algorithm analysis Document models and structures Document representation and standards Rich web applications

来源：评论

学校读者我要写书评

暂无评论

Enhancing Statistical-Based Remote Sensing Image Classification algorithms: An Optimization Study 8th

Enhancing Statistical-Based Remote Sensing Image Classificat...

引用

8th International Conference on Inventive Communication and Computational Technologies, ICICCT 2024

作者： Yu, Tianyi Liu, L. Faculty of Science and Technology BNU-HKBU United International College Zhuhai519087 China Centre for Evaluation Studies BNU-HKBU United International College Zhuhai519087 China Guangdong Provincial Key Laboratory of Interdisciplinary Research and Application for Data Science BNU-HKBU United International College Zhuhai519087 China

ISBN: (纸本)9789819777099

This study presents an optimization approach for statistically based remote sensing image classification algorithms. Traditional image classification methods suffer from subjectivity and inefficiency due to manual annotation. Taking advantage of advances in artificial intelligence and computer vision, this study focuses on content-based image classification methods. Specifically, the study focuses on optimizing statistically based algorithms for classifying remote sensing images, which are known for their complexity. The methodology includes efficient image feature extraction using visual saliency features based on regional covariance, followed by an optimized statistical-based classification algorithm using extended sparse coding and an empty spectrum dictionary model. Experimental evaluation conducted on remotely sensed images of Hong Kong demonstrates the superior performance of the proposed method compared to existing approaches, with an average accuracy rate of 99.41%. A comprehensive error analysis highlights the robustness and consistency of the proposed approach, confirming its effectiveness in addressing challenges of remote sensing image classification. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： algorithm analysis Image classification Optimization Remote sensing Statistical-based

来源：评论

学校读者我要写书评

暂无评论

Multiobjective Evolutionary Component Effect on algorithm Behavior

Multiobjective Evolutionary Component Effect on Algorithm Be...

引用

2024 Genetic and Evolutionary Computation Conference Companion, GECCO 2024 Companion

作者： Lavinas, Yuri Ladeira, Marcelo Ochoa, Gabriela Aranha, Claus IRIT - CNRS UMR5505 University of Toulouse Toulouse France University of Brasilia Brasilia Brazil University of Stirling Stirling United Kingdom University of Tsukuba Tsukuba Japan

ISBN: (纸本)9798400704956

There has been an increased interest in the automatic design of multiobjective algorithms from their components to simplify the development and application of new approaches. These machine designed algorithms (auto-MOEA) can outperform their human-designed counterparts, but it is still unknown which components mostly influence their performance. We propose a methodology to investigate the components' effects on the final auto-MOEA configuration. We study the components' impact using Search Trajectory Networks (STNs), diversity of the population, and anytime hyper-volume values. We found that analyzing the objective and decision spaces simultaneously provides complementary information about the algorithms *** paper for the Hot-off-the-Press track at GECCO 2024 summarizes the work Yuri Lavinas, Marcelo Ladeira, Gabriela Ochoa, and Claus Aranha. 2023. Multiobjective Evolutionary Component Effect on algorithm behavior. ACM Trans. Evol. Learn. Optim. Just Accepted (August 2023). https://***/10.1145/3612933 [3]. © 2024 Copyright held by the owner/author(s).

关键词： algorithm analysis

来源：评论

学校读者我要写书评

暂无评论

Optimal Alignment of Multiple Sequence Alignments

Optimal Alignment of Multiple Sequence Alignments

引用

作者： Starrett, Dean University of Arizona

学位级别：master

An essential tool in biology is the alignment of multiple sequences. Biologists use multiple sequence alignments for tasks such as predicting protein structure and function, reconstructing phylogenetic trees, and finding motifs. Constructing high-quality multiple alignments is computationally hard, both in theory and in practice, and is typically done using heuristic methods. The majority of state-of-the-art multiple alignment programs employ a form and polish strategy, where in the construction phase, an initial multiple alignment is formed by progressively merging smaller alignments, starting with single sequences. Then in a local-search phase, the resulting alignment is polished by repeatedly splitting it into smaller alignments and re-merging. This merging of alignments, the basic computational problem in the construction and local-search phases of the best multiple alignment heuristics, is called the Aligning Alignments Problem. Under the sum-of-pairs objective for scoring multiple alignments, this problem may seem to be a simple extension of two-sequence alignment. It is proven here, however, that with affine gap costs (which are recognized as necessary to get biologically-informative alignments) the problem is NP-complete when gaps are counted exactly. Interestingly, this form of multiple alignment is polynomial-time solvable when we relax the exact count, showing that exact gap counts themselves are inherently hard in multiple sequence alignment. Unlike general multiple alignment however, we show that Aligning Alignments with affine gap costs and exact counts is tractable in practice, by demonstrating an effective algorithm and a fast implementation. Our software AlignAlign is both time- and space-efficient on biological data. Computational experiments on biological data show instances derived from standard benchmark suites can be optimally aligned with surprising efficiency, and experiments on simulated data show the time and space both scale well

关键词： algorithms algorithm analysis Sequence analysis Combinatorial Optimization Computational Complexity Computational Biology

来源：评论

学校读者我要写书评

暂无评论

New algorithms for Computing Field of Vision over 2D Grids

New Algorithms for Computing Field of Vision over 2D Grids

引用

作者： Evan Debenham University of Western Ontario

学位级别：硕士

In many computer games checking whether one object is visible from another is very important. Field of Vision (FOV) refers to the set of locations that are visible from a specific position in a scene of a computer game. Once computed, an FOV can be used to quickly determine the visibility of multiple objects from a given position. This thesis summarizes existing algorithms for FOV computation, describes their limitations, and presents new algorithms which aim to address these limitations. We first present an algorithm which makes use of spatial data structures in a way which is new for FOV calculation. We then present a novel technique which updates a previously calculated FOV, rather than re-calculating FOV from scratch. We then compare our algorithms to existing FOV algorithms and show that they provide substantial improvements to running time and efficiency of memory access.

关键词： Field of Vision (FOV) Computer Games Visibility Determination algorithm analysis

来源：评论

学校读者我要写书评

暂无评论

Advances in Cryptology - Eurocrypt '99 [elektronische Ressource] : International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May 2-6, 1999, Proceedings

引用

2016年

作者： jacques stern

Advances in Cryptology - Eurocrypt '99 [elektronische Ressource] : International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May 2-6, 1999, Proceedings by Stern, J... 详细信息

关键词： [elektronische advances algorithm analysis application computational complexity computational mathematics computer communication networks computer science computer science_xmathematics computer software conference data encryption data encryption (computer science) discrete mathematics in computer science numerical analysis problem complexity

来源：评论

学校读者我要写书评

暂无评论

Simplified Chernoff bounds with powers-of-two probabilities

引用

INFORMATION PROCESSING LETTERS 2023年 182卷

作者： Dillencourt, Michael Goodrich, Michael T. Univ Calif Irvine Comp Sci Irvine CA 92697 USA

In this paper, we derive simplified Chernoff bounds with powers-of-two probabilities, and we show their uses in analyzing probabilistic algorithms.& COPY;2023 The Authors. Published by Elsevier B.V. This is an ope... 详细信息

关键词： algorithms analysis of algorithms algorithm analysis Chernoff bound Lambert W function

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：