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

作者： Dugré, Mathieu Hayot-Sasson, Valérie Glatard, Tristan Department of Computer Science and Software Engineering Concordia University Montreal Canada

The general increase in data size and data sharing motivates the adoption of Big Data strategies in several scientific disciplines. However, while several options are available, no particular guidelines exist for selecting a Big Data engine. In this paper, we compare the runtime performance of two popular Big Data engines with Python APIs, Apache Spark, and Dask, in processing neuroimaging pipelines. Our experiments use three synthetic neuroimaging applications to process the 606 GB BigBrain image and an actual pipeline to process data from thousands of anatomical images. We benchmark these applications on a dedicated HPC cluster running the Lustre file system while using varying combinations of the number of nodes, file size, and task duration. Our results show that although there are slight differences between Dask and Spark, the performance of the engines is comparable for data-intensive applications. However, Spark requires more memory than Dask, which can lead to slower runtime depending on configuration and infrastructure. In general, the limiting factor was the data transfer time. While both engines are suitable for neuroimaging, more efforts need to be put to reduce the data transfer time and the memory footprint of applications. © 2023 John Wiley & Sons, Ltd.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Efficient Bit-Plane Based Medical Image Cryptosystem Using Novel and Robust Sine-Cosine Chaotic Map

引用

computers, Materials & Continua 2025年第4期83卷 917-933页

作者： Zeric Tabekoueng Njitacke Louai A.Maghrabi Musheer Ahmad Turki Althaqafi Department of Electrical and Electronic Engineering College of Technology(COT)University of BueaBueaP.O.Box 63Cameroon Department of Software Engineering College of EngineeringUniversity of Business and TechnologyJeddah22246Saudi Arabia Department of Computer Engineering Jamia Millia IslamiaNew Delhi110025India Department of Computer Science School of EngineeringComputing and DesignDar Al-Hekma UniversityJeddah22246Saudi Arabia

This paper presents a high-security medical image encryption method that leverages a novel and robust sine-cosine *** map demonstrates remarkable chaotic dynamics over a wide range of *** employ nonlinear analytical tools to thoroughly investigate the dynamics of the chaotic map,which allows us to select optimal parameter configurations for the encryption *** findings indicate that the proposed sine-cosine map is capable of generating a rich variety of chaotic attractors,an essential characteristic for effective *** encryption technique is based on bit-plane decomposition,wherein a plain image is divided into distinct bit *** planes are organized into two matrices:one containing the most significant bit planes and the other housing the least significant *** subsequent phases of chaotic confusion and diffusion utilize these matrices to enhance *** auxiliary matrix is then generated,comprising the combined bit planes that yield the final encrypted *** results demonstrate that our proposed technique achieves a commendable level of security for safeguarding sensitive patient information in medical *** a result,image quality is evaluated using the Structural Similarity Index(SSIM),yielding values close to zero for encrypted images and approaching one for decrypted ***,the entropy values of the encrypted images are near 8,with a Number of Pixel Change Rate(NPCR)and Unified Average Change Intensity(UACI)exceeding 99.50%and 33%,***,quantitative assessments of occlusion attacks,along with comparisons to leading algorithms,validate the integrity and efficacy of our medical image encryption approach.

关键词： Image cryptosystem robust chaos sine-cosine map nonlinear analysis tools medical images

来源：评论

学校读者我要写书评

暂无评论

An Efficient Algorithm for the 2-Central Path Problem

引用

International Journal of Computational Geometry and Applications 2024年第1-2期34卷 43-61页

作者： Huang, Ziyun Zhu, Yongding Xu, Jinhui Department of Computer Science and Software Engineering Penn State Erie The Behrend College Erie PA United States Department of Computer Science and Engineering State University of New York at Buffalo Buffalo NY United States

In this paper we consider the following 2-Central Path Problem (2CPP): Given a set of m polygonal curves = {P1,P2,...,Pm} in the plane, find two curves Pu and Pl, called 2-central paths, that best represent all curves in . Despite its theoretical interest and a wide range of practical applications, 2CPP has not been well studied. In this paper, we first establish criteria that Pu and Pl ought to meet in order for them to best represent . In particular, we require that there exists parametrizations fu(t) and fl(t) (t [a,b]) of Pu and Pl respectively such that the maximum distance from {fu(t),fl(t)} to curves in is minimized. Then an efficient algorithm is presented to solve 2CPP under certain realistic assumptions. Our algorithm constructs Pu and Pl in O(nmlog⁴n2^α(n)α(n)) time, where n is the total complexity of (i.e., the total number of vertices and edges), m is the number of curves in , and α(n) is the inverse Ackermann function. Our algorithm uses parametric search technique and is considerably faster than arrangement-related algorithms (i.e. ω(n²)) when m ≪ n as in most real applications.

关键词： 2-central path Minkowski sum parametric search

来源：评论

学校读者我要写书评

暂无评论

A Space-Efficient One-Pass Online SVM Algorithm

引用

International Journal of Computational Geometry and Applications 2024年第1-2期34卷 63-79页

作者： Liu, Yangwei Huang, Ziyun Xu, Jinhui Department of Computer Science and Engineering State University of New York at Buffalo Buffalo NY United States Department of Computer Science and Software Engineering Penn State Erie The Behrend College Erie PA United States

In this paper we consider the problem of training a Support Vector Machine (SVM) online using a stream of data in random order. We provide a fast online training algorithm for general SVM on very large datasets. Based on the geometric interpretation of SVM known as the polytope distance, our algorithm uses a gradient descent procedure to solve the problem. With high probability our algorithm outputs an (ϵ, δ)-approximation result in constant time and space, which is independent of the size of the dataset, where (ϵ, δ)-approximation means that the separating margin of the classifier is almost optimal (with error ≤ ϵ), and the number of misclassified training points is very small (with error ≤ δ). Experimental results show that our algorithm outperforms most of existing online algorithms, especially in the space requirement aspect, while maintaining high accuracy. © 2024 World Scientific Publishing Company.

关键词： online algorithm SVM

来源：评论

学校读者我要写书评

暂无评论

Leaching Fraction (LF) of Irrigation Water for Saline Soils Using Machine Learning

引用

Intelligent Automation & Soft Computing 2023年第5期36卷 1915-1930页

作者： Rab Nawaz Bashir Imran Sarwar Bajwa Muhammad Waseem Iqbal Muhammad Usman Ashraf Ahmed Mohammed Alghamdi Adel ABahaddad Khalid Ali Almarhabi Department of Computer Science COMSATS University IslamabadVehari CampusPakistan Department of Computer Science and IT Islamia University BahawalpurPakistan Department of Software Engineering Superior University Lahore54000Pakistan Department of Computer Science GC Women UniversitySialkot53310Pakistan Department of Software Engineering College of Computer Science and EngineeringUniversity of Jeddah21493Saudi Arabia Department of Information System Faculty of Computing and Information TechnologyKing Abdulaziz UniversityJeddah21589Saudi Arabia Department of Computer Science College of Computing in Al-QunfudahUmm Al-Qura UniversityMakkah24381Saudi Arabia

Soil salinity is a serious land degradation issue in *** is a major threat to agriculture *** irrigation water is applied to leach down the salts from the root zone of the plants in the form of a Leaching fraction(LF)of irrigation *** the leaching process to be effective,the LF of irriga-tion water needs to be adjusted according to the environmental conditions and soil salinity level in the form of Evapotranspiration(ET)*** relationship between environmental conditions and ET rate is hard to be deﬁned by a linear relationship and data-driven Machine learning(ML)based decisions are required to determine the calibrated Evapotranspiration(ETc)***-assisted ETc is pro-posed to adjust the LF according to the ETc and soil salinity level.A regression model is proposed to determine the ETc rate according to the prevailing tempera-ture,humidity,and sunshine,which would be used to determine the smart LF according to the ETc and soil salinity *** proposed model is trained and tested against the Blaney Criddle method of Reference evapotranspiration(ETo)*** validation of the model from the test dataset reveals the accu-racy of the ML model in terms of Root mean squared errors(RMSE)are 0.41,Mean absolute errors(MAE)are 0.34,and Mean squared errors(MSE)are 0.28 mm *** applications of the proposed solution in a real-time environ-ment show that the LF by the proposed solution is more effective in reducing the soil salinity as compared to the traditional process of leaching.

关键词： Leaching fraction saline soil evapotranspiration machine learning calibrated evapotranspiration artiﬁcial intelligence blaney criddle method

来源：评论

学校读者我要写书评

暂无评论

Temporal Separators with Deadlines 34

Temporal Separators with Deadlines

引用

34th International Symposium on Algorithms and Computation, ISAAC 2023

作者： Harutyunyan, Hovhannes A. Koupayi, Kamran Pankratov, Denis Department of Computer Science and Software Engineering Concordia University Montreal Canada

ISBN: (纸本)9783959772891

We study temporal analogues of the Unrestricted Vertex Separator problem from the static world. An (s, z)-temporal separator is a set of vertices whose removal disconnects vertex s from vertex z for every time step in a temporal graph. The (s, z)-Temporal Separator problem asks to find the minimum size of an (s, z)-temporal separator for the given temporal graph. The (s, z)-Temporal Separator problem is known to be NP-hard in general, although some special cases (such as bounded treewidth) admit efficient algorithms [15]. We introduce a generalization of this problem called the (s, z, t)-Temporal Separator problem, where the goal is to find a smallest subset of vertices whose removal eliminates all temporal paths from s to z which take less than t time steps. Let τ denote the number of time steps over which the temporal graph is defined (we consider discrete time steps). We characterize the set of parameters τ and t when the problem is NP-hard and when it is polynomial time solvable. Then we present a τ-approximation algorithm for the (s, z)-Temporal Separator problem and convert it to a τ2-approximation algorithm for the (s, z, t)-Temporal Separator problem. We also present an inapproximability lower bound of Ω(ln(n) + ln(τ)) for the (s, z, t)-Temporal Separator problem assuming that NP Dtime(nlog log n). Then we consider three special families of graphs: (1) graphs of branchwidth at most 2, (2) graphs G such that the removal of s and z leaves a tree, and (3) graphs of bounded pathwidth. We present polynomial-time algorithms to find a minimum (s, z, t)-temporal separator for (1) and (2). As for (3), we show a polynomial-time reduction from the Discrete Segment Covering problem with bounded-length segments to the (s, z, t)-Temporal Separator problem where the temporal graph has bounded pathwidth. © Hovhannes A. Harutyunyan, Kamran Koupayi, and Denis Pankratov;licensed under Creative Commons License CC-BY 4.0.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Entropy-based Selective Homomorphic Encryption for Smart Metering Systems 28

Entropy-based Selective Homomorphic Encryption for Smart Met...

引用

28th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2023

作者： Xu, Weiyan Zhang, Yinghao Cardell-Oliver, Rachel Mian, Ajmal Hong, Jin B. The University of Western Australia Department of Computer Science and Software Engineering Australia

ISBN: (纸本)9798350358766

Smart metering systems (SMS) are popular in industrial and residential areas but can risk privacy by revealing user behaviors. Homomorphic encryption (HE) is a technique that protects data privacy by enabling calculations on encrypted data. However, the high computational costs of HE can hinder real-time or resource-constrained applications. Our paper presents a framework to encrypt only selected SMS data for improved efficiency without compromising privacy significantly. By encrypting data blocks with higher entropy values, we can mitigate the leakage of key information to adversaries who may conduct privacy attacks, such as membership inference attacks (MIA). We evaluate our framework using two real-world datasets (i.e., electricity and water) to assess privacy and performance trade-offs. The results indicate a 47% performance increase while still providing a sufficient level of privacy when adopting an encryption ratio of 0.4. They demonstrate the effectiveness of the proposed framework, considering the trade-off between privacy and performance, where the user can determine the appropriate security level for privacy protection and enhance the performance using HE in practical SMS settings. © 2023 IEEE.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

AI-Powered Approaches to Unmasking Fake News: A Simple Comparison of ML and DL Techniques

AI-Powered Approaches to Unmasking Fake News: A Simple Compa...

引用

2024 IEEE International Conference on Computing, Applications and Systems, COMPAS 2024

作者： Bormon, Sajib Prova, Jebin Ahmed Ahmad, Md Hasan Rimon Sohag, Sohanur Rahman Shishir, Hasanur Rahman Daffodil International University Department of Computer Science and Engineering Ashulia Dhaka Bangladesh Noakhali Science and Technology University Department of Software Engineering Noakhali Bangladesh

ISBN: (纸本)9798331529765

False news spreads quickly due to the extensive distribution of incorrect or misleading information across digital channels, which is a global problem. This bias undermines the credibility of information, promotes the spread of misleading information. Utilizing machine learning and deep learning models this study examines the detection of inaccurate information. Natural Language Processing methods are used for data preprocessing on the text datasets. Five machine learning models are used in this study: Logistic Regression, Decision Tree, Random Forest, Naïve Bayes, and Passive Aggressive Classifier. After preprocessing, the accuracy values of these models are 95%, 99.7%, 99.3%, 98.9%, and 99.5%, respectively. The study demonstrates that the decision tree model has superior performance, with the LSTM algorithm following closely after. The PAC and LSTM model have also demonstrated commendable results of 99.5% accuracy. The accuracies offer valuable information regarding the constraints of each model, aiding researchers in selecting suitable ways for identifying counterfeit news. The findings assist individuals in making informed decisions on the establishment of precise and effective ways for identifying false information, which is essential to maintaining the integrity of information distribution. © 2024 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Impact of Feature Encoding on Malware Classification Explainability 15

Impact of Feature Encoding on Malware Classification Explain...

引用

15th International Conference on Electronics, computers and Artificial Intelligence, ECAI 2023

作者： Manai, Elyes Mejri, Mohamed Fattahi, Jaouhar Laval University Department of Computer Science & Software Engineering Quebec Canada

ISBN: (纸本)9798350321388

This paper investigates the impact of feature encoding techniques on the explainability of XAI (Explainable Artificial Intelligence) algorithms. Using a malware classification dataset, we trained an XGBoost model and compared the performance of two feature encoding methods: Label Encoding (LE) and One Hot Encoding (OHE). Our findings reveal a marginal performance loss when using OHE instead of LE. However, the more detailed explanations provided by OHE compensated for this loss. We observed that OHE enables deeper exploration of details in both global and local contexts, facilitating more comprehensive answers. Additionally, we observed that using OHE resulted in smaller explanation files and reduced analysis time for human analysts. These findings emphasize the significance of considering feature encoding techniques in XAI research and suggest potential for further exploration by incorporating additional encoding methods and innovative visualization approaches. © 2023 IEEE.

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

Framework for Effective Utilization of Distributed Scrum in software Projects

引用

computer Systems science & engineering 2023年第1期44卷 407-422页

作者： Basit Shahzad Wardah Naeem Awan Fazal-e-Amin Ahsanullah Abro Muhammad Shoaib Sultan Alyahya Department of Software Engineering National University of Modern LanguagesIslamabad44000Pakistan Department of Software Engineering College of Computer and Information SciencesKing Saud UniversityRiyadh11543Saudi Arabia Department of Computer Science Sukkur IBA UniversitySindh65200Pakistan Department of Information Systems College of Computer and Information SciencesKing Saud UniversityRiyadh11543Saudi Arabia

There is an emerging interest in using agile methodologies in Global software Development(GSD)to get the mutual benefits of both *** is currently admired by many development teams as an agile most known meth-odology and considered adequate for collocated *** the same time,stake-holders in GSD are dispersed by geographical,temporal,and socio-cultural *** to the controversial nature of Scrum and GSD,many significant challenges arise that might restrict the use of Scrum in *** conducted a Sys-tematic Literature Review(SLR)by following Kitchenham guidelines to identify the challenges that limit the use of Scrum in GSD and to explore the mitigation strategies adopted by practitioners to resolve the *** validate our reviewfindings,we conducted an industrial survey of 305 *** results of our study are consolidated into a research *** framework represents current best practices and recommendations to mitigate the identified distributed scrum challenges and is validated byfive experts of distributed *** of the expert review were found supportive,reflecting that the framework will help the stakeholders deliver sustainable products by effectively mitigating the identified challenges.

关键词： Global software development distributed Scrum sustainable development challenges mitigation strategies

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：