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

12th International Conference on Fun with Algorithms, FUN 2024

作者： Faro, Simone Marino, Francesco Pio Moschetto, Andrea Pavone, Arianna Scardace, Antonio Department of Mathematics and Computer Science University of Catania Italy Univ Rouen Normandie INSA Rouen Normandie Université Le Havre Normandie Normandie France Univ LITIS UR 4108 CNRS NormaSTIC FR 3638 IRIB RouenF-76000 France Department of Mathematics and Computer Science University of Palermo Italy

ISBN: (纸本)9783959773140

Sampled String Matching is presented as an efficient solution to the string matching problem, aiming to tackle the space constraints of indexed string matching while purportedly reducing search times for online solutions. Despite the problem’s inception dating back to 1991, practical solutions have only recently emerged. These purportedly accelerate online searches by up to 35 times compared to conventional methods, achieved through a partial index occupying a mere 5% of the text size. This paper delves into the intricacies of one of the latest and most effective text sampling techniques, character distance sampling, which revolves around sampling distances between characters of a selected alphabet within the text. Specifically, we introduce fake samples while remaining honest! In other words, the study reveals that, interestingly, strategically introducing fake samples within the sampled sequence slashes the required index space by almost half, just avoid compromising the algorithm’s correctness. Additionally, since efficiency is everything, this approach, in turn, purportedly enhances the algorithm’s efficiency under specific conditions. © Simone Faro, Francesco Pio Marino, Andrea Moschetto, Arianna Pavone, and Antonio Scardace.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Design of a Directly-Fed Pattern Reconfigurable Patch Antenna and Its Array Performance

Design of a Directly-Fed Pattern Reconfigurable Patch Antenn...

引用

2023 IEEE MTT-S International Wireless Symposium, IWS 2023

作者： Wang, Shi-Tong Zhu, Lei University of Macau Taipa Faculty of Science and Technology Department of Electrical and Computer Engineering 999078 China

ISBN: (纸本)9798350336535

A directly-fed pattern reconfigurable patch antenna without extra feeding networks is presented in this paper with a straightforward design method and the discussion on its array performance. TM01 and TM02 modes of a rectangular patch are employed to realize pattern reconfigurability. Four shorting pins underneath the patch and two high-impedance open-ended stubs loaded on the radiating edges are adopted for the frequency overlap of the two working modes. Additional center-carved slots or center-loaded stubs are proposed as a simple impedance-matching mechanism without feeding networks. The working principle is investigated by a transmission-line circuit model. Simulation results show that at 2.45 GHz, the radiation pattern of the proposed antenna can be switched between a single beam and dual beams with maximum realized gains of 9.6 dBi and 5.6 dBi, respectively. Moreover, a 1×4 array is designed using the proposed antenna to demonstrate its array performance. © 2023 IEEE.

关键词： Microstrip antennas

来源：评论

学校读者我要写书评

暂无评论

Employing Feature Engineering for River Stage Forecasting to Improve Hybrid Model Performance 32

Employing Feature Engineering for River Stage Forecasting to...

引用

32nd International Conference on Software, Telecommunications and computer Networks, SoftCOM 2024

作者： Mihel, Anna Maria Pecnik, Spela Vrbancic, Grega Lerga, Jonatan Krvavica, Nino University of Rijeka Faculty of Engineering Department of Computer Engineering Rijeka Croatia University of Maribor Intelligent Systems Laboratory Faculty of Electrical Engineering and Computer Science Maribor Slovenia University of Rijeka Faculty of Civil Engineering Department of Hydrotechnics and Geotechnics Rijeka Croatia

ISBN: (纸本)9789532901382

Establishing early warning systems and efficient management of water resources in tidal reaches is crucial for achieving adequate flood protection. In tidal reaches, the river stage interacts non-linearly with tides (downstream) and discharge (upstream), making the modeling of river processes extremely complex. Data-driven methods have proven helpful for predicting the river stage parameter. This contrasts with existing numerical approaches, which suffer from several limitations. The aim of this study was to predict the river stage of the upstream part of the tidal river, where the influence of salinity is present during the summer months. Using the CNN-LSTM model trained on historical records of the discharge (station of the variable to be predicted), the river stage of three downstream stations, and the point of interest, the prediction was carried out up to 24 hours in advance. By incorporating feature engineering, we achieved an improvement in model results for the longest horizon, confirmed by standard performance metrics, and considered it efficient and effective for risk mitigation. Introducing feature engineering into the data preprocessing resulted in a predictive performance improvement of 0.98% for the Nash-Sutcliffe Efficiency (NSE) metric, 7.0% for the root mean squared error (RMSE) metric, and 7.25% for the mean absolute error (MAE) metric over the second and third-best scenarios using a spectrogram and time-series data. © 2024 University of Split, FESB.

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

Optimizing ASD Diagnosis: Enhanced Autism Spectrum Disorder Prediction Using Machine Learning Classifiers 2

Optimizing ASD Diagnosis: Enhanced Autism Spectrum Disorder ...

引用

2nd International Conference of Intelligent Methods, Systems and Applications, IMSA 2024

作者： Al Tawil, Arar Gomaa, Ibrahim A Zeid, Magdy Abd-Elghany Marzouk, AbdulRahman S. Hamad, Adam L. Zakaria, Khaled Y. Danial, Moshir A. Nassief, Mounir N. Abdelminaam, Diaa Salama Applied Science Private University Faculty of Information Technology Amman11931 Jordan Alobour high institute for computer and informatics Computer Science Department Cairo Egypt Misr International University Faculty of Computer Science Cairo Egypt Jadara University Jadara Research Center Irbid21110 Jordan Misr International University Faculty of Computers Egypt Middle East University MEU Research Unit Amman11831 Jordan

ISBN: (纸本)9798350362633

Autism Spectrum Disorder is a multidimensional neurological developmental disorder that includes a wide plethora of mental disorders targeting one's social and behavioral abilities. Gaining a perceptive understanding of a topic like ASD is essential in one's lifespan, whether the symptoms displayed are mild or severely debilitating. Due to the populous size of clinical terms under the disorder's spectrum and the drastic gap between each symptom's severity, the diagnosis of ASD became a long and tribulating task for experts and professionals alike. The purpose of this paper is to present and compare different Machine Learning Classifiers Categorical Boosting, K-Nearest Neighbors, Support Vector Machine, Logistic Regression, Decision Tree, Random Forest, Naïve Bayes and use their Training Algorithms Train-Test Splitting, K-Folds Cross-Validation to develop a quick and accurate Labeler ASD: 'YES' ? 'NO' for afflicted individuals based on multiple Datasets Generic, Adolescent, Children, Young, Adult, ASD aiming for an early diagnosis and an overall better understanding of the disorder. For each dataset, four Performance Metrics are extracted after applying the 7 ML models and the two training algorithms Accuracy, Precision, Recall, F1-Score. The resulting metrics are then displayed and compared to conclude the most accurate trained model for each dataset and with each of the training algorithms. © 2024 IEEE.

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

Brain-computer Interface Artifact Removal

Brain-Computer Interface Artifact Removal

引用

2023 International Conference on Artificial Intelligence and Smart Communication, AISC 2023

作者： Geetha, S. Shetty, Sahana Deemed-to-be University Faculty of Engineering and Technology Jain Department of Computer Science and Engineering Bangalore India

ISBN: (纸本)9798350322309

The purpose of a brain-computer interface, also known as a BCI, is to create a communication channel that converts human intention into a control signal for an output device using a brain signal, such as an electroencephalogram (EEG). In addition, artefacts are undesired potentials that helps to process the signals (EEG), with the majority of originate outside signal of the cerebral cortex. Regrettably, they have the ability to alter the form of neurological phenomena that is used to operate a BCI device. They also carry the risk of inadvertently and it can lead to the device which is being controlled in a manner that was not intended. As a result, it is necessary to steer clear of, disregard, or get rid of artefacts in the recordings of brain signals. The origin of artefacts can be traced back to both physiological and non-physiological processes. The different signals are monitored and compared for the better conclusion. © 2023 IEEE.

关键词： Electrocardiograms

来源：评论

学校读者我要写书评

暂无评论

A note on eigenvalues of Cayley graphs

引用

Linear Algebra and Its Applications 2025年 721卷 240-249页

作者： Árnadóttir, Arnbjörg Soffía Godsil, Chris Department of Applied Mathematics and Computer Science Technical University of Denmark LyngbyDK-2800 Denmark Department of Combinatorics and Optimization University of Waterloo 200 University Avenue West WaterlooONN2L 3G1 Canada

A graph is called integral if all its eigenvalues are integers. A Cayley graph is called normal if its connection set is a union of conjugacy classes. We show that a non-empty integral normal Cayley graph for a group ... 详细信息

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

Scalable global state synchronization of discrete-time double integrator multi-agent systems with input saturation via linear protocol 41

Scalable global state synchronization of discrete-time doubl...

引用

第41届中国控制会议

作者： Zhenwei Liu Ali Saberi Anton A.Stoorvogel College of Information Science and Engineering Northeastern University School of Electrical Engineering and Computer Science Washington State University Department of Electrical Engineering Mathematics and Computer ScienceUniversity of Twente

ISBN: (数字)9789887581536

ISBN: (纸本)9781665482561

This paper studies scalable global state synchronization of discrete-time double integrator multi-agent systems in presence of input saturation based on localized information exchange.A scale-free collaborative linear dynamic protocols design methodology is developed for discrete-time multi-agent systems with both full and partialstate *** the protocol design methodology does not need any knowledge of the directed network topology and the spectrum of the associated Laplacian ***,the protocols are parametric based on a parameter set in which the designed protocols can guarantee the global synchronization ***,the proposed protocol is scalable and achieves synchronization for any arbitrary number of agents.

关键词： Discrete-time double integrator multi-agent systems Global state synchronization Scale-free linear protocol

来源：评论

学校读者我要写书评

暂无评论

Global video object segmentation with spatial constraint module

引用

Computational Visual Media 2023年第2期9卷 385-400页

作者： Yadang Chen Duolin Wang Zhiguo Chen Zhi-Xin Yang Enhua Wu Engineering Research Center of Digital Forensics Ministry of EducationSchool of Computer and SoftwareNanjing University of Information Science and TechnologyNanjing 210044China State Key Laboratory of Internet of Things for Smart City Department of Electromechanical EngineeringUniversity of MacaoMacao 999078China State Key Laboratory of Computer Science Institute of SoftwareUniversity of Chinese Academy of SciencesBeijing 100190China Faculty of Science and Technology University of MacaoMacao 999078China

We present a lightweight and efficient semisupervised video object segmentation network based on the space-time memory *** some extent,our method solves the two difficulties encountered in traditional video object segmentation:one is that the single frame calculation time is too long,and the other is that the current frame’s segmentation should use more information from past *** algorithm uses a global context(GC)module to achieve highperformance,real-time *** GC module can effectively integrate multi-frame image information without increased memory and can process each frame in real ***,the prediction mask of the previous frame is helpful for the segmentation of the current frame,so we input it into a spatial constraint module(SCM),which constrains the areas of segments in the current *** SCM effectively alleviates mismatching of similar targets yet consumes few additional *** added a refinement module to the decoder to improve boundary *** model achieves state-of-the-art results on various datasets,scoring 80.1%on YouTube-VOS 2018 and a J&F score of 78.0%on DAVIS 2017,while taking 0.05 s per frame on the DAVIS 2016 validation dataset.

关键词： video object segmentation semantic segmentation global context(GC)module spatial constraint

来源：评论

学校读者我要写书评

暂无评论

STABLE APPROXIMATION ALGORITHMS FOR DOMINATING SET AND INDEPENDENT SET

引用

SIAM Journal on Discrete mathematics 2025年第2期39卷 921-945页

作者： de Berg, Mark Sadhukhan, Arpan Spieksma, Frits Department of Mathematics and Computer Science TU Eindhoven Eindhoven5612 DP Netherlands

We study Dominating Set and Independent Set for dynamic graphs in the vertex- arrival model. We say that a dynamic algorithm for one of these problems is k-stable when it makes at most k changes to its output independent set or dominating set upon the arrival of each vertex. We study trade-offs between the stability parameter k of the algorithm and the approximation ratio it achieves. We obtain the following results: (i) We show that there is a constant \varepsilon \ast > 0 such that any dynamic (1 + \varepsilon \ast )-approximation algorithm for Dominating Set has stability parameter \Omega (n), even for bipartite graphs of maximum degree 4. (ii) We present algorithms with very small stability parameters for Dominating Set in the setting where the arrival degree of each vertex is upper bounded by d. In particular, we give a 1-stable (d + 1)2-approximation algorithm, a 3-stable (9d/2)- approximation algorithm, and an O(d)-stable O(1)-approximation algorithm. (iii) We show that there is a constant \varepsilon \ast > 0 such that any dynamic (1 + \varepsilon \ast )-approximation algorithm for Independent Set has stability parameter \Omega (n), even for bipartite graphs of maximum degree 3. (iv) Finally, we present a 2-stable O(d)-approximation algorithm for Independent Set, in the setting where the average degree of the graph is upper bounded by some constant d at all times. We extend this latter algorithm to the fully dynamic model where vertices can also be deleted, achieving a 6-stable O(d)-approximation algorithm. Copyright © by SIAM.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Iterated Conditionals, Trivalent Logics, and Conditional Random Quantities 15th

Iterated Conditionals, Trivalent Logics, and Conditional Ra...

引用

15th International Conference on Scalable Uncertainty Management, SUM 2022

作者： Castronovo, Lydia Sanfilippo, Giuseppe Department of Mathematics and Computer Science University of Palermo Palermo Italy

ISBN: (纸本)9783031188428

We consider some notions of iterated conditionals by checking the validity of some desirable basic logical and probabilistic properties, which are valid for simple conditionals. We consider de Finetti’s notion of conditional as a three-valued object and as a conditional random quantity in the betting framework. We recall the notions of conjunction and disjunction among conditionals in selected trivalent logics. Then, we analyze the two notions of iterated conditional introduced by Calabrese and de Finetti, respectively. We show that the compound probability theorem and other basic properties are not preserved by these objects, by also computing some probability propagation rules. Then, for each trivalent logic we introduce an iterated conditional as a suitable random quantity which satisfies the compound prevision theorem and some of the desirable properties. Finally, we remark that all the basic properties are satisfied by the iterated conditional mainly developed in recent papers by Gilio and Sanfilippo in the setting of conditonal random quantities. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：