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

EvauleBlock: Evaluating Answers in E-Learning Applications with Enhanced Security and Intelligence through DRL and Blockchain Integration

学校读者我要写书评

暂无评论

EvauleBlock: Evaluating Answers in E-Learning Applications w...

Electrical, Electronics, Information and Communication Technologies (ICEEICT), International Conference on

作者： Parthasarathy R Kiruthiga Devi M Karthick V Kumar P Rakesh Kumar Mahendran Department of Computer Science & Engineering Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology Chennai India Department of Information Technology Dr. MGR Educational and Research Institute Chennai India Department of Computer Science and Engineering Rajalakshmi Engineering College Chennai India

ISBN: (数字)9798350369083

ISBN: (纸本)9798350369090

Evaluating the candidate answers during online examination by a human examiner is wearisome task. Along with that, security concerns also associated in the E-Learning environment in terms of false data injection and modification attacks respectively. The state of the art work, either focus on designing intelligent and robust question answering model using Machine Learning (ML)/Deep Learning (DL) algorithm, or designing a secure framework for E-Learning environment using blockchain. To neutralize that issue, we design a secure and intelligent model for E-Learning environment using Deep Reinforcement Learning (DRL) and blockchain methodology respectively named EvauleBlock. The EvauleBlock composed of four major processes such as data assortment, data pre-processing, intelligent answer evaluation, and blockchain storage. In data assortment stage, the training of the proposed DRL algorithm named Multi Agent Deep Deterministic Policy Gradient (MADDPG) is taken place by crawling the related question answering data from the various websites. Followed by, we have performed pre-processing for the candidate written answers using adequate pre-processing steps. Once the answers are pre-processed, it is then provided to the MADDPG algorithm which employs four agents for validating the candidate answers by checking the semantic, syntactic, keyword, and context similarity scoring respectively. At last, the overall scores are securely stored in the blockchain using Proof of Work (PoW) consensus algorithm. The implementation of this work is carried out using python 3.11.0 tool and performance of the proposed model are validated and compared with adequate performance metrics. The results are promising when compared to the conventional models.

关键词： Training Electronic learning Semantics consensus algorithm Syntactics Proof of Work Deep reinforcement learning Question answering (information retrieval) Blockchains Security

An Inexact Boosted Difference of Convex algorithm for Nondifferentiable Functions

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Ferreira, Orizon P. Mordukhovich, Boris S. Santos, Wilkreffy M.S. Souza, João Carlos O. Institute of Mathematics and Statistics GO GoiâniaCEP 74001-970 Brazil Department of Mathematics Wayne State University DetroitMI48202 United States Department of Mathematics Federal University of Piauí PI Teresina Brazil Piauí Institute of Technology Department of Mathematics Federal University of Piauí PI Teresina Brazil

In this paper, we introduce an inexact approach to the Boosted Difference of Convex Functions algorithm (BDCA) for solving nonconvex and nondifferentiable problems involving the difference of two convex functions (DC functions). Specifically, when the first DC component is differentiable and the second may be nondifferentiable, BDCA utilizes the solution from the subproblem of the DC algorithm (DCA) to define a descent direction for the objective function. A monotone linesearch is then performed to find a new point that improves the objective function relative to the subproblem solution. This approach enhances the performance of DCA. However, if the first DC component is nondifferentiable, the BDCA direction may become an ascent direction, rendering the monotone linesearch ineffective. To address this, we propose an Inexact nonmonotone Boosted Difference of Convex algorithm (InmBDCA). This algorithm incorporates two main features of inexactness: First, the subproblem therein is solved approximately allowing us for a controlled relative error tolerance in defining the linesearch direction. Second, an inexact nonmonotone linesearch scheme is used to determine the step size for the next iteration. Under suitable assumptions, we demonstrate that InmBDCA is well-defined, with any accumulation point of the sequence generated by InmBDCA being a critical point of the problem. We also provide iteration-complexity bounds for the algorithm. Numerical experiments show that InmBDCA outperforms both the nonsmooth BDCA (nmBDCA) and the monotone version of DCA in practical *** Codes 49J53, 90C26, 65K05, 65K10 © 2024, CC BY.

关键词： consensus algorithm

An O(N) algorithm for Solving the Smallest Enclosing Sphere Problem in the Presence of Degeneracies

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Moriya, Netzer

Efficient algorithms for solving the Smallest Enclosing Sphere (SES) problem, such as Welzl's algorithm, often fail to handle degenerate subsets of points in 3D space. De- generacies and ill-posed configurations present significant challenges, leading to failures in convergence, inaccuracies or increased computational cost in such cases. Existing improvements to these algorithms, while addressing some of these issues, are either com- putationally expensive or only partially effective. In this paper, we propose a hybrid algorithm designed to mitigate degeneracy while maintaining an overall computational complexity of O(N). By combining robust preprocessing steps with efficient core com- putations, our approach avoids the pitfalls of degeneracy without sacrificing scalability. The proposed method is validated through theoretical analysis and experimental results, demonstrating its efficacy in addressing degenerate configurations and achieving high efficiency in *** Codes 49Mxx © 2024, CC BY.

关键词： consensus algorithm

New Results on Periodic Golay Pairs

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Lumsden, Tyler Kotsireas, Ilias Bright, Curtis School of Computer Science University of Windsor Canada CARGO Lab Wilfrid Laurier University Canada

In this paper, we provide algorithmic methods for conducting exhaustive searches for periodic Golay pairs. Our methods enumerate several lengths beyond the currently known state-of-the-art available searches: we conducted exhaustive searches for periodic Golay pairs of all lengths v ≤ 72 using our methods, while only lengths v ≤ 34 had previously been exhaustively enumerated. Our methods are applicable to periodic complementary sequences in general. We utilize sequence compression, a method of sequence generation derived in 2013 by Ðoković and Kotsireas. We also introduce and implement a new method of "multi-level" compression, where sequences are uncompressed in several steps. This method allowed us to exhaustively search all lengths v ≤ 72 using less than 10 CPU years. For cases of complementary sequences where uncompression is not possible, we introduce some new methods of sequence generation inspired by the isomorph-free exhaustive generation algorithm of orderly generation. Finally, we pose a conjecture regarding the structure of periodic Golay pairs and prove it holds in many lengths, including all lengths v MSC Codes 11B83, 05B20, 94A55, 68W30 Copyright © 2024, The Authors. All rights reserved.

关键词： consensus algorithm

Constructibility, computational complexity and P versus NP

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Hole, Arne University of Oslo P.O Box 1099 Blindern Oslo0317 Norway

If an algorithm is to be counted as a practically working solution to a decision problem, then the algorithm must must verifiable in some constructed and "trusted" theory such as PA or ZF. In this paper, a class of decision problems related to inconsistency proofs for a general class of formal theories is used to demonstrate that under this constructibility restriction, an unformalizable yet arguably convincing argument can be given for the existence of decision problems for which there exists an explicitly constructible algorithm recognizing correct solutions in polynomial time, but for which there exists no explicitly constructible solution algorithm. While these results do not solve the P versus NP problem in the classical sense of supplying a proof one way or the other in a "trusted" formal theory, arguably they resolve the natural constructive version of the *** Codes F.0, F.1.3, F.2.0, F.4.0 Copyright © 2024, The Authors. All rights reserved.

关键词： consensus algorithm

Neural Surface Detection for Unsigned Distance Fields

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Stella, Federico Talabot, Nicolas Le, Hieu Fua, Pascal Switzerland

Extracting surfaces from Signed Distance Fields (SDFs) can be accomplished using traditional algorithms, such as Marching Cubes. However, since they rely on sign flips across the surface, these algorithms cannot be used directly on Unsigned Distance Fields (UDFs). In this work, we introduce a deep-learning approach to taking a UDF and turning it locally into an SDF, so that it can be effectively triangulated using existing algorithms. We show that it achieves better accuracy in surface detection than existing methods. Furthermore it generalizes well to unseen shapes and datasets, while being parallelizable. We also demonstrate the flexibily of the method by using it in conjunction with DualMeshUDF, a state of the art dual meshing method that can operate on UDFs, improving its results and removing the need to tune its parameters. © 2024, CC BY.

关键词： consensus algorithm

Demo: Radio Spectrum Data Collection with Distributed-Proof-of-Sense Blockchain Network

学校读者我要写书评

暂无评论

Demo: Radio Spectrum Data Collection with Distributed-Proof-...

IEEE International Conference on Blockchain and Cryptocurrency (ICBC)

作者： Pramitha Fernando Madusanka Liyanage School of Computer Science University College Dublin Ireland

ISBN: (数字)9798350316742

ISBN: (纸本)9798350316759

Dynamic Spectrum Access (DSA) addresses the underutilized spectrum allocation issues associated with static spectrum allocation. Blockchain is a critical enabler for implementing a DSA system because it allows untrusted parties to conduct business, such as spectrum buying and selling, without the involvement of a trusted third party. A blockchain system is implemented using the Proof-of-Sense consensus algorithm, which is designed to facilitate DSA while also providing several additional benefits, such as spectrum data collection.

关键词： Dynamic spectrum access consensus algorithm Data collection Cryptocurrency consensus protocol Resource management Business

GRAPHC: PARAMETER-FREE HIERARCHICAL CLUSTERING OF SIGNED GRAPH NETWORKS

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Shebaro, Muhieddine Rusnak, Lucas Burtscher, Martin Tešić, Jelena

When applied to signed graphs, spectral clustering methods often struggle to capture natural groupings accurately. Recent research shows that these methods become less effective as the size of the signed network increases. To address this problem, we present a new, scalable, hierarchical graph-clustering algorithm called graphC for identifying the best clusters in signed networks of various sizes. The graphC clustering approach aims to keep the proportion of positive edges high within each cluster while maximizing the negative edges between clusters. One key feature of graphC is that it does not require the number of clusters (k) to be predefined. We validate the performance of graphC by comparing it to ten other signed-graph clustering algorithms on fourteen datasets. We show graphC to be scalable to large signed graphs from Amazon, which include tens of millions of vertices and edges. On average, graphC outperforms the second-best algorithm by 18.6% in terms of maximizing the positive edge density within clusters and the negative edge density between clusters. This comparison excludes cases where the third-party algorithms fail to complete their tasks. © 2024, CC BY-NC-ND.

关键词： consensus algorithm

Approximately covering vertices by order-5 or longer paths

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Gong, Mingyang Chen, Zhi-Zhong Lin, Guohui Wang, Lusheng Department of Computing Science University of Alberta EdmontonABT6G 2E8 Canada Division of Information System Design Tokyo Denki University Saitama350-0394 Japan Department of Computer Science City University of Hong Kong Hong Kong

This paper studies MP Cv5+, which is to cover as many vertices as possible in a given graph G = (V, E) by vertex-disjoint 5+-paths (i.e., paths each with at least five vertices). MP Cv5+ is NP-hard and admits an existing local-search-based approximation algorithm which achieves a ratio of 19/7 ≈ 2.714 and runs in O(|V |6) time. In this paper, we present a new approximation algorithm for MP Cv5+ which achieves a ratio of 2.511 and runs in O(|V |2.5|E|2) time. Unlike the previous algorithm, the new algorithm is based on maximum matching, maximum path-cycle cover, and recursion. © 2024, CC BY.

关键词： consensus algorithm