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

32nd International Symposium on Graph Drawing and Network Visualization, GD 2024

作者： Aloupis, Greg Biniaz, Ahmad Bose, Prosenjit De Carufel, Jean-Lou Eppstein, David Maheshwari, Anil Odak, Saeed Smid, Michiel Tóth, Csaba D. Valtr, Pavel Khoury College of Computer Sciences Northeastern University BostonMA United States School of Computer Science University of Windsor Canada School of Computer Science Carleton University Ottawa Canada School of Electrical Engineering and Computer Science University of Ottawa Canada Computer Science Department University of California IrvineCA United States Department of Mathematics California State University Northridge Los AngelesCA United States Department of Computer Science Tufts University Medford United States Department of Applied Mathematics Charles University Prague Czech Republic

ISBN: (纸本)9783959773430

Edge crossings in geometric graphs are sometimes undesirable as they could lead to unwanted situations such as collisions in motion planning and inconsistency in VLSI layout. Short geometric structures such as shortest perfect matchings, shortest spanning trees, shortest spanning paths, and shortest spanning cycles on a given point set are inherently noncrossing. However, the longest such structures need not be noncrossing. In fact, it is intuitive to expect many edge crossings in various geometric graphs that are longest. Recently, Álvarez-Rebollar, Cravioto-Lagos, Marín, Solé-Pi, and Urrutia (Graphs and Combinatorics, 2024) constructed a set of points for which the longest perfect matching is noncrossing. They raised several challenging questions in this direction. In particular, they asked whether the longest spanning path, on any finite set of points in the plane, must have a pair of crossing edges. They also conjectured that the longest spanning cycle must have a pair of crossing edges. In this paper, we give a negative answer to the question and also refute the conjecture. We present a framework for constructing arbitrarily large point sets for which the longest perfect matchings, the longest spanning paths, and the longest spanning cycles are noncrossing. © Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, and Pavel Valtr.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Retinal Blood Vessel Tracking and Diameter Estimation via Gaussian Process With Rider Optimization Algorithm

引用

IEEE Journal of Biomedical and Health Informatics 2024年第3期28卷 1173-1184页

作者： Ahmad, Nehal Lai, Kuan-Ting Tanveer, M. Indian Institute of Technology Indore Simrol Department of Mathematics Indore453552 India National Taipei University of Technology Department of International Program of Electrical Engineering and Computer Science Taipei106 Taiwan National Taipei University of Technology Department of Electronic Engineering Taipei106 Taiwan

Retinal blood vessels structure analysis is an important step in the detection of ocular diseases such as diabetic retinopathy and retinopathy of prematurity. Accurate tracking and estimation of retinal blood vessels in terms of their diameter remains a major challenge in retinal structure analysis. In this research, we develop a rider-based Gaussian approach for accurate tracking and diameter estimation of retinal blood vessels. The diameter and curvature of the blood vessel are assumed as the Gaussian processes. The features are determined for training the Gaussian process using Radon transform. The kernel hyperparameter of Gaussian processes is optimized using Rider Optimization Algorithm for evaluating the direction of the vessel. Multiple Gaussian processes are used for detecting the bifurcations and the difference in the prediction direction is quantified. The performance of the proposed Rider-based Gaussian process is evaluated with mean and standard deviation. Our method achieved high performance with the standard deviation of 0.2499 and mean average of 0.0147, which outperformed the state-of-the-art method by 6.32%. Although the proposed model outperformed the state-of-the-art method in normal blood vessels, in future research, one can include tortuous blood vessels of different retinopathy patients, which would be more challenging due to large angle variations. We used Rider-based Gaussian process for tracking blood vessels to obtain the diameter of retinal blood vessels, and the method performed well on the 'STrutred Analysis of the REtina (STARE) Database' accessed on Oct. 2020 (https://***/~ahoover/stare/). To the best of our knowledge, this experiment is one of the most recent analysis using this type of algorithm. © 2013 IEEE.

关键词： Blood vessels

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Relative Lempel-Ziv Compression 21

Hierarchical Relative Lempel-Ziv Compression

引用

21st International Symposium on Experimental Algorithms, SEA 2023

作者： Bille, Philip Gørtz, Inge Li Puglisi, Simon J. Tarnow, Simon R. Department of Computer Science and Applied Mathematics Technical University of Denmark Lyngby Denmark DTU Compute Technical University of Denmark Lyngby Denmark Finland Department of Computer Science University of Helsinki Finland

ISBN: (纸本)9783959772792

Relative Lempel-Ziv (RLZ) parsing is a dictionary compression method in which a string S is compressed relative to a second string R (called the reference) by parsing S into a sequence of substrings that occur in R. RLZ is particularly effective at compressing sets of strings that have a high degree of similarity to the reference string, such as a set of genomes of individuals from the same species. With the now cheap cost of DNA sequencing, such datasets have become extremely abundant and are rapidly growing. In this paper, instead of using a single reference string for the entire collection, we investigate the use of different reference strings for subsets of the collection, with the aim of improving compression. In particular, we propose a new compression scheme hierarchical relative Lempel-Ziv (HRLZ) which form a rooted tree (or hierarchy) on the strings and then compress each string using RLZ with parent as reference, storing only the root of the tree in plain text. To decompress, we traverse the tree in BFS order starting at the root, decompressing children with respect to their parent. We show that this approach leads to a twofold improvement in compression on bacterial genome datasets, with negligible effect on decompression time compared to the standard single reference approach. We show that an effective hierarchy for a given set of strings can be constructed by computing the optimal arborescence of a completed weighted digraph of the strings, with weights as the number of phrases in the RLZ parsing of the source and destination vertices. We further show that instead of computing the complete graph, a sparse graph derived using locality-sensitive hashing can significantly reduce the cost of computing a good hierarchy, without adversely effecting compression performance. © 2023 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.

关键词： DNA sequences

来源：评论

学校读者我要写书评

暂无评论

Consensus Learning with Deep Sets for Essential Matrix Estimation

arXiv

引用

arXiv 2024年

作者： Moran, Dror Margalit, Yuval Trostianetsky, Guy Khatib, Fadi Galun, Meirav Basri, Ronen Department of Computer Science and Applied Mathematics Weizmann Institute of Science

Robust estimation of the essential matrix, which encodes the relative position and orientation of two cameras, is a fundamental step in structure from motion pipelines. Recent deep-based methods achieved accurate estimation by using complex network architectures that involve graphs, attention layers, and hard pruning steps. Here, we propose a simpler network architecture based on Deep Sets. Given a collection of point matches extracted from two images, our method identifies outlier point matches and models the displacement noise in inlier matches. A weighted DLT module uses these predictions to regress the essential matrix. Our network achieves accurate recovery that is superior to existing networks with significantly more complex architectures. Copyright © 2024, The Authors. All rights reserved.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Protein Structure Prediction Using Dynamic Speciation Evolutionary Algorithm with Aggregated Problem Information 21

Protein Structure Prediction Using Dynamic Speciation Evolut...

引用

21st IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology, CIBCB 2024

作者： Parpinelli, Rafael Stubs Wojeicchowski, Nicholas Will, Nilcimar Neitzel State University of Santa Catarina Graduate Program in Applied Computing Joinville Brazil State University of Santa Catarina Computer Science Department Joinville Brazil

ISBN: (纸本)9798350356632

Protein structure prediction in three dimensions represents a fundamental challenge in Structural Bioinformatics. Leveraging problem-specific information such as fragment insertion, secondary structure, and contact maps can significantly enhance the exploration of the search space. In this study, an evolutionary algorithm is introduced, which incorporates such problem information for protein structure prediction. The proposed method employs a dynamic speciation technique alongside fragment insertion to foster population diversity. To ensure a rich variety of fragments, a fragment library is constructed using the Rosetta Quota protocol. Additionally, information from contact maps and secondary structure is integrated into two selection strategies to facilitate a more thorough exploration of the conformational search space. The results of an experimental evaluation involving 9 proteins are presented, demonstrating competitive performance compared to existing literature. Evaluation metrics include RMSD, GDT, and processing time. © 2024 IEEE.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

AI-Powered Code Reviews: Leveraging Large Language Models

AI-Powered Code Reviews: Leveraging Large Language Models

引用

2024 IEEE International Conference on Signal Processing and Advance Research in Computing, SPARC 2024

作者： Chowdhury, Md Shain Shahid Chowdhury, Md Naseef Ur Rahman Neha, Fariha Ferdous Haque, Ahshanul Utah State University Department of Computer Science LoganUT United States New Mexico Tech Department of Computer Science SocorroNM United States University of Dhaka Department of Applied Mathematics Dhaka Bangladesh New Mexico Tech Department of Computer Sceince SocorroNM United States

ISBN: (纸本)9798350385199

As the complexity and volume of software development continue to grow, the need for efficient and thorough code review processes becomes increasingly critical. This paper explores the integration of Large Language Models (LLMs), such as ChatGPT and Bard, into code review workflows to enhance software quality and security. By leveraging the natural language processing capabilities of LLMs, we aim to streamline the identification of code issues, detect potential security vulnerabilities, and provide developers with actionable feedback. Through a comprehensive analysis of current literature, case studies, and experimental data, this study evaluates the impact of AI-assisted code reviews on developer productivity and code quality. We also address the challenges and limitations of relying on LLMs, including context comprehension and potential biases. Our findings suggest that while LLMs offer significant advantages in automating and improving code reviews, they should complement rather than replace human expertise. This paper provides insights into best practices for integrating LLMs into development workflows, ultimately contributing to more robust and secure software systems. © 2024 IEEE.

关键词： Software quality

来源：评论

学校读者我要写书评

暂无评论

The Wisdom of a Crowd of Brains: A Universal Brain Encoder

arXiv

引用

arXiv 2024年

作者： Beliy, Roman Wasserman, Navve Zalcher, Amit Irani, Michal Department of Computer Science and Applied Mathematics The Weizmann Institute of Science

Image-to-fMRI encoding is important for both neuroscience research and practical applications. However, such "Brain-Encoders" have been typically trained per-subject and per fMRI-dataset, thus restricted to very limited training data. In this paper we propose a Universal Brain-Encoder, which can be trained jointly on data from many different subjects/datasets/machines. What makes this possible is our new voxel-centric Encoder architecture, which learns a unique "voxel-embedding" per brain-voxel. Our Encoder trains to predict the response of each brain-voxel on every image, by directly computing the cross-attention between the brain-voxel embedding and multi-level deep image features. This voxel-centric architecture allows the functional role of each brain-voxel to naturally emerge from the voxel-image cross-attention. We show the power of this approach to: (i) combine data from multiple different subjects (a "Crowd of Brains") to improve each individual brain-encoding, (ii) quick & effective Transfer-Learning across subjects, datasets, and machines (e.g., 3-Tesla, 7-Tesla), with few training examples, and (iii) we show the potential power of the learned voxel-embeddings to explore brain functionality (e.g., what is encoded where in the brain). © 2024, CC BY-NC-SA.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Identifying Student Learning Styles using Support Vector Machine in The Felder-Silverman Learning Style Model 15

Identifying Student Learning Styles using Support Vector Mac...

引用

15th International Congress on Advanced applied Informatics Winter, IIAI-AAI-Winter 2023

作者： Saputra, Jeffri Prayitno Bangkit Prabowo, Harjanto Gaol, Ford Lumban Hertono, Gatot Fatwanto Doctor of Computer Science Program Bina Nusantara University Jakarta Indonesia Indonesia University Department of Mathematics Jakarta Indonesia

ISBN: (纸本)9798350383829

This research explores the intricate relationship between questionnaire structures and the accuracy of learning style predictions among students. Focusing on the balance between core and secondary questions, the study meticulously analyzes various ratios, emphasizing their impact on the learning style classification system. Through rigorous testing and integration of the Felder-Silverman Learning Style Model (FSLSM) with the Support Vector Machine (SVM) algorithm, the research uncovers crucial insights. Results showcase that a careful balance and distribution of questions significantly enhance the accuracy of predicting student learning styles, with accuracy rates reaching up to 89%. This study not only emphasizes the importance of personalized education but also demonstrates the practical applicability of advanced machine learning techniques. The findings provide a roadmap for the future of education, emphasizing a nuanced, question-specific approach for a more accurate, tailored, and responsive learning experience. © 2023 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Teaching & Learning Analytics for Data-Based Optimization of Teaching and Learning Processes in Courses with Blended Learning 30

Teaching & Learning Analytics for Data-Based Optimization of...

引用

30th International Conference on Software, Telecommunications and computer Networks, SoftCOM 2022

作者： Mehnen, Lars Pohn, Birgit Blaickner, Matthias Mandl, Thomas Dregely, Isabel University of Applied Sciences Technikum Wien Faculty Computer Science & Applied Mathematics Austria University of Applied Sciences Technikum Wien Department of Computer Science Austria

ISBN: (数字)9789532901177

ISBN: (纸本)9789532901177

Learning Management Systems (LMS), such as Moodle, enable the rapid progress of digitisation in teaching, which is no longer only taking place in the lecture hall, but increasingly 'online' and asynchronously. New didactic concepts (blended learning, 'flipped classroom') consist of alternating self-learning and face-to-face phases, with the former taking place in the LMS, i.e. online. However, no analysis has yet been carried out as to how students act with the material in the self-learning phase, or the teachers are not provided with any information about the learning progress of the students during the self-learning phase. In this paper, concepts of learning and teaching analytics are presented to answer these questions and to integrate the measures derived from them into the teaching processes in a sustainable manner. © 2022 University of Split, FESB.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

A module lattice based construction of post quantum blockchain for secure transactions in Internet of Things

A module lattice based construction of post quantum blockcha...

引用

International Conference on Artificial Intelligence, Blockchain, Computing and Security, ICABCS 2023

作者： Chaudhary, Dharminder Durgarao, M.S.P. Gupta, Pratik Rana, Saurabh Singh, Soumyendra Department of Computer Science and Engineering Amrita School of Computing Amrita Vishwa Vidyapeetham Chennai India Department of Applied Mathematics School of Vocational Studies and Applied Sciences Gautam Buddha University Greater Noida India Department of Mathematics Bennet University Greater Noida India Department of Mathematics Amrita School of Engineering Amrita Vishwa Vidyapeetham Chennai India

ISBN: (纸本)9781032669663

The Fiat-Shamir with Aborts paradigm of Lyubashevsky introduced efficient lattice based signatures. We have used lattice based signature to design post quantum blockchain design. But the blockchain is always consisting of many nodes depending upon participants, then we require an efficient aggregate signature technique to verify nodes efficiently. We have designed a blockchain using fast post quntum secure tool called module lattices. Module lattices provide both security and efficiency based on two assumptions, (1) Module Learning With Errors, and (2) Module Short Integer Solution respectively. The proposed blockchain design ensures security of Internet of Things devices against quantum attacks. The design provides a better secure environment for Internet of Things. Blockchain technology has been used to combine fixed number of IoT nodes. This makes the communication efficient, and the aggregate signature has been used to provide the security to the given architecture. © 2024 The Author(s).

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：