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

Adjustable random linear network coding(ARLNC): A solution for data transmission in dynamic IoT computational environments

引用

Digital Communications and Networks 2025年第2期11卷 574-586页

作者： Raffi Dilanchian Ali Bohlooli Kamal Jamshidi Faculty of Computer Engineering University of Isfahan

In mobile computing environments, most IoT devices connected to networks experience variable error rates and possess limited bandwidth. The conventional method of retransmitting lost information during transmission, commonly used in data transmission protocols, increases transmission delay and consumes excessive bandwidth. To overcome this issue, forward error correction techniques, e.g., Random Linear Network Coding(RLNC) can be used in data transmission. The primary challenge in RLNC-based methodologies is sustaining a consistent coding ratio during data transmission, leading to notable bandwidth usage and transmission delay in dynamic network conditions. Therefore, this study proposes a new block-based RLNC strategy known as Adjustable RLNC(ARLNC), which dynamically adjusts the coding ratio and transmission window during runtime based on the estimated network error rate calculated via receiver feedback. The calculations in this approach are performed using a Galois field with the order of 256. Furthermore, we assessed ARLNC's performance by subjecting it to various error models such as Gilbert Elliott, exponential, and constant rates and compared it with the standard RLNC. The results show that dynamically adjusting the coding ratio and transmission window size based on network conditions significantly enhances network throughput and reduces total transmission delay in most scenarios. In contrast to the conventional RLNC method employing a fixed coding ratio, the presented approach has demonstrated significant enhancements, resulting in a 73% decrease in transmission delay and a 4 times augmentation in throughput. However, in dynamic computational environments, ARLNC generally incurs higher computational costs than the standard RLNC but excels in high-performance networks.

关键词： Random linear network coding Adjust redundancy Galois field Internet of Things Data transfer

来源：评论

学校读者我要写书评

暂无评论

Multiplex Collaboration Network of the faculty of computer Science and engineering in Skopje 15th

Multiplex Collaboration Network of the Faculty of Compute...

引用

15th International Conference on ICT Innovations, ICT Innovations 2023

作者： Ivanoska, Ilinka Trivodaliev, Kire Ilijoski, Bojan Faculty of Computer Science and Engineering Ss Cyril and Methodiuos University Skopje Macedonia

ISBN: (纸本)9783031543203

Multiplex collaboration networks facilitate intricate connections among individuals, enabling multidimensional collaborations across various domains and fostering synergistic knowledge exchange. This study focuses on the construction and basic analysis of a multiplex collaboration network among employees at the faculty of computer Science and engineering (FCSE), Ss. Cyril and Methodius University in Skopje. The multiplex network is built with three layers based on: scientific collaborations resulting from joint project participations by FCSE employees, joint employees participations in the FCSE graduation thesis committees, and scientific FCSE employees collaborations defined by co-authorships in Google Scholar papers. The network’s structure plays a vital role in determining the information accessibility and cooperative opportunities for individuals within FCSE institution. The aim here is to investigate the FCSE multiplex collaboration network’s internal structure for discovering its latent knowledge and understand its implications. We perform identification of key individuals within the network, by computing various centrality and hubs detection network metrics. Additionally, we employ a community detection algorithm to reveal the underlying modular structure of the network. By comprehensively analyzing the acquired multiplex collaboration network model, we contribute to a better understanding of the collaboration patterns among FCSE employees. The findings can potentially inform decision-making processes and foster strategic planning aimed at enhancing collaboration and knowledge sharing within the institution. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Weighted rank aggregation based on ranker accuracies for feature selection

引用

Soft Computing 2025年第4期29卷 1981-2001页

作者： Abdolrazzagh-Nezhad, Majid Kherad, Mahdi Faculty of Engineering Department of Computer Engineering Bozorgmehr University of Qaenat Qaen Iran Department of Computer Science Faculty of Computer and Industrial Engineering Birjand University of Technology Birjand Iran Faculty of Engineering Department of Computer Engineering University of Qom Qom Iran

Rank aggregation is the combination of several ranked lists from a set of candidates to achieve a better ranking by combining information from different sources. In feature selection problem, due to the heterogeneity of methods, there are some base rankers (Filter-based methods) that are of diverse quality and usually the ground truth of ratings is not available. Existing rank aggregation methods that take the diverse quality of base rankers into account do not have any explicit approach for appropriate weighting, require prior assumptions, and suffers from high computational complexity. In this paper, to overcome these challenges, an efficient unsupervised method is introduced for estimating the base rankers’ qualities and aggregating the rankers based on the estimated weights. We first compute the ratio of disagreement between base rankers in ordering different element pairs and then estimate the accuracies in a way that to minimize the discrepancy between these computed ratios and their analytical counterparts. We use the weighted majority voting method for obtaining the aggregated results. To resolve the probable inconsistencies in the final aggregation, the result is formed as a graph, and a greedy algorithm is used to find an acyclic subgraph with the highest weigh. To demonstrate the performance of the proposed method, nine standard UCI datasets are used. The obtained results by the proposed method have higher values of classifier measures than the existing baseline Feature Selection methods and rank aggregation-based multi-filter methods in the most datasets. The experiments show that rank aggregation-based Feature Selection methods outperform individual methods. The proposed method also shows the weight of each Filter-based Feature Selection method, in which the MRMR method has a higher weight than other methods. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： Wiener filtering

来源：评论

学校读者我要写书评

暂无评论

DXDSENet-CM model: an ensemble learning model based on depthwise Squeeze-and-Excitation ConvMixer architecture for the classification of multi-class skin lesions

引用

Multimedia Tools and Applications 2025年第12期84卷 9903-9938页

作者： Fırat, Hüseyin Üzen, Hüseyin Department of Computer Engineering Faculty of Engineering Dicle University Diyarbakır Turkey Department of Computer Engineering Faculty of Engineering and Architecture Bingol University Bingol Turkey

Skin cancer is acknowledged as the most prevalent form of cancer on a global scale. Failure to detect it in its initial phases can lead to fatality, underscoring the significance of early diagnosis. While visible to the naked eye, the considerable similarities between different classes and the variations within a single class create substantial hurdles for accurate detection. Given the widespread occurrence of this ailment, numerous deep learning-driven automated systems have been created to aid dermatologists in promptly identifying skin anomalies. Within this investigation, an ensemble learning architecture based on Xception, DenseNet201 and Depthwise Squeeze-and-Excitation Network and ConvMixer (DSENet-ConvMixer) architectures is presented for skin lesion classification. Xception, a pre-trained CNN network, utilizes depthwise separable convolutions and residual connections, offering efficient feature extraction from skin lesion images. DenseNet201’s parameter efficiency, feature reuse, and multi-scale information capture make it a valuable addition. DSENet-ConvMixer integrates these components, efficiently merging low-level and high-level features to enhance training and network efficiency. ConvMixer excels at feature extraction, enhancing spatial detail capture. ISIC 2018 and 2019 datasets were employed to assess the classification performance of the proposed architecture. Individual accuracies for Xception, DenseNet201, and DSENet-ConvMixer in ISIC 2018 were 85.91%, 85.71%, 82.02%, respectively, and in ISIC 2019 were 80.93%, 80.50%, 79.08%, respectively. However, the ensemble architecture with these three architectures achieved 88.21% for ISIC 2018 and 92.34% for ISIC 2019, demonstrating superior performance. Literature reviews on both datasets also confirmed the proposed architecture’s effectiveness compared to recent studies. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Combining evolutionary and swarm algorithms in a hybrid subspace-wise search strategy for feature selection

引用

Cluster Computing 2025年第5期28卷 1-26页

作者： Mohammadi, Mahsa Ramezani, Mohsen Akhlaghian Tab, Fardin Ahmadizar, Fardin Department of Computer Engineering Faculty of Engineering University of Kurdistan Sanandaj Iran Department of Industrial Engineering Faculty of Engineering University of Kurdistan Sanandaj Iran

In recent years, hybrid feature selection methods incorporating global–local frameworks have gained significant attention due to their advantages. Leveraging the capabilities of swarm and evolutionary algorithms, we propose a modified Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) algorithm within a bi-level global–local search framework to achieve improved exploration while maintaining comparable execution time. In this method, we introduce a modified GA to perform the global search step using a subspace-wise search strategy. The primary motivation behind this approach is to reduce the search space, enabling the method to consider all parts of the space and avoid getting trapped in local optima. To enhance diversity without increasing complexity, we introduce a novel encoding scheme where each chromosome represents a subspace of solutions instead of a single solution. During each iteration, the PSO algorithm is employed to perform local search and identify high-quality solutions within each subspace. This step can be applied to subspaces in parallel to make the method faster. Notably, the PSO algorithm is applied only to specific dimensions of the individuals, resulting in significantly faster computation. Consequently, the solution selected by the PSO within each subspace serves as the basis for evaluating the fitness of the corresponding chromosome. Experiments conducted on 30 well-known datasets demonstrate that our method exhibits significantly better performance compared to state-of-the-art methods, both in low and high-dimensional data settings. Furthermore, our method demonstrates stability, making it suitable for real-world applications. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Presentation of research activities at the faculty of electrical & computer engineering

Elektrotehniski Vestnik/Electrotechnical Review

引用

Elektrotehniski Vestnik/Electrotechnical Review 1989年第2-4期56卷 97-100页

作者： Bajd, Tadej Faculty of Electrical & Computer Engineering Yugoslavia

At its beginning, the paper briefly describes some of the main research areas at the faculty of Electrical and computer engineering. The research efforts are included in programs of Research Communities of Slovenia and the Strategy of the Technological Development of Yugoslavia. An important role in the research work is given to young researchers and students. Problems of equipment are constantly present at the faculty. The researchers are authors of numerous international scientific publications and even textbooks. Individual professors of the faculty have received distinguished national awards.

关键词： engineering Education

来源：评论

学校读者我要写书评

暂无评论

Education at the faculty of electrical and computer engineering in Ljubljana

Elektrotehniski Vestnik/Electrotechnical Review

引用

Elektrotehniski Vestnik/Electrotechnical Review 1989年第2-4期56卷 94-96页

作者： Bratkovic, Franc Faculty of Electrical & Computer Engineering Yugoslavia

The faculty of Electrical and computer engineering in Ljubljana performs educational courses at all levels of University education in the fields of electrical and computer engineering. A structure of its programs is p... 详细信息

关键词： engineering Education

来源：评论

学校读者我要写书评

暂无评论

myREACH: a serious game for measuring security awareness about ransomware

引用

Multimedia Tools and Applications 2025年第11期84卷 9713-9747页

作者： Noorbehbahani, Fakhroddin Taghiyar, Anahita Faculty of Computer Engineering University of Isfahan Isfahan Iran Faculty of IT Engineering Sheikh Bahaei University Isfahan Iran

Today, raising security awareness among users is one of the most effective preventive cybersecurity strategies. Generally, the current level of security awareness in the organization is measured through standard questionnaires. However, this method suffers from poor participant engagement and low precision due to the explicit evaluation and misunderstandings of the questions. To address these issues, we present a serious video game called "myREACH" to measure the player’s security awareness about ransomware. To the best of our knowledge, this is the first attempt to develop a serious game for measuring security awareness. myREACH has been compared to the standard questionnaire for measuring security awareness about ransomware, known as RSAM. The results obtained from a sample of 172 participants indicate that, in 3 out of 9 categories, the game and questionnaire measurements yield similar results. However, in 5 out of 9 categories, the game measurement is superior. For the remaining category, it is inconclusive whether the game or questionnaire assessment is better. Furthermore, self-report measurements indicate that the temporal and mental demands of playing myREACH and completing the RSAM are the same. The overall performance during playing myREACH is 9% better than completing the RSAM, and participants are 15% more satisfied with the game compared to the questionnaire. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Human computer interaction

来源：评论

学校读者我要写书评

暂无评论

Drug–target interactions prediction based on similarity graph features extraction and deep learning

引用

Neural Computing and Applications 2025年第6期37卷 4303-4322页

作者： Torkey, Hanaa El-Behery, Heba Attia, Abdel-Fattah El-Fishawy, Nawal Computer Science and Engineering Department Faculty of Electronic Engineering Menoufia University Menouf Egypt Department of Computer Science and Engineering Faculty of Engineering Kafrelsheikh University Kafrelsheikh Egypt Department of Computer Science College of Computer Engineering and Sciences Prince Sattam Bin Abdulaziz University Al-Kharj Saudi Arabia

Identifying drug–target interactions (DTIs) is a critical step in both drug repositioning. The labor-intensive, time-consuming, and costly nature of classic DTI laboratory studies makes it imperative to create efficient computer algorithms to forecast possible DTIs. However, current computational approaches that predict potential drug–target interactions (DTIs) suffer from some limitations, like finding the best similarity measures or negative samples, and thus require substantial performance improvement. This study proposes an integrated approach based on feature representation and deep learning to predict DTIs. We extract the relevant features of drugs and proteins from heterogeneous networks using graph mining techniques. The proposed approach constructs a heterogeneous graph from the known drug–protein interactions, protein–protein, and drug–drug similarities. Then applying two feature extraction techniques to extract the features, then utilizing these features in training a deep learning model to predict the potential DTIs. Also, a novel algorithm is proposed to find the negative samples based on the drug and protein similarity matrices. Four Benchmark datasets are used to evaluate the proposed approach. Our approach achieves the highest AUC (area under the ROC curve) across all datasets (0.98) with around 2% increases over the existing methods. Experimental results demonstrate that our proposed approach outperforms the baseline methods in predicting DTI, and our negative sample-identifying algorithm could be established as a competitive solution. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Dynamic Multi-Graph Spatio-Temporal Graph Traffic Flow Prediction in Bangkok:An Application of a Continuous Convolutional Neural Network

引用

computer Modeling in engineering & Sciences 2025年第1期142卷 579-607页

作者： Pongsakon Promsawat Weerapan Sae-dan Marisa Kaewsuwan Weerawat Sudsutad Aphirak Aphithana Department of Civil Engineering Faculty of EngineeringRamkhamkaeng UniversityBangkok10240Thailand Department of Computer Engineering Faculty of EngineeringRamkhamkaeng UniversityBangkok10240Thailand Department of Statistics Faculty of ScienceRamkhamkaeng UniversityBangkok10240Thailand

The ability to accurately predict urban traffic flows is crucial for optimising city ***,various methods for forecasting urban traffic have been developed,focusing on analysing historical data to understand complex mobility *** learning techniques,such as graph neural networks(GNNs),are popular for their ability to capture spatio-temporal ***,these models often become overly complex due to the large number of hyper-parameters *** this study,we introduce Dynamic Multi-Graph Spatial-Temporal Graph Neural Ordinary Differential Equation Networks(DMST-GNODE),a framework based on ordinary differential equations(ODEs)that autonomously discovers effective spatial-temporal graph neural network(STGNN)architectures for traffic prediction *** comparative analysis of DMST-GNODE and baseline models indicates that DMST-GNODE model demonstrates superior performance across multiple datasets,consistently achieving the lowest Root Mean Square Error(RMSE)and Mean Absolute Error(MAE)values,alongside the highest *** the BKK(Bangkok)dataset,it outperformed other models with an RMSE of 3.3165 and an accuracy of 0.9367 for a 20-min interval,maintaining this trend across 40 and 60 ***,on the PeMS08 dataset,DMST-GNODE achieved the best performance with an RMSE of 19.4863 and an accuracy of 0.9377 at 20 min,demonstrating its effectiveness over longer *** Los_Loop dataset results further emphasise this model’s advantage,with an RMSE of 3.3422 and an accuracy of 0.7643 at 20 min,consistently maintaining superiority across all time *** numerical highlights indicate that DMST-GNODE not only outperforms baseline models but also achieves higher accuracy and lower errors across different time intervals and datasets.

关键词： Graph neural networks convolutional neural network deep learning dynamic multi-graph spatio-temporal

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：