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

Text steganography: enhanced character-level embedding algorithm using font attribute with increased resilience to statistical attacks

引用

Multimedia Tools and Applications 2025年第11期84卷 9367-9392页

作者： KL, Shreya Narasimhan R, Bala Krishnan Department of Computer Science and Engineering National Institute of Technology Tiruchirappalli Tamil Nadu Tiruchirappalli India

Text steganography, the science of hiding secret messages in innocent-looking text documents ensures the secrecy of the embedded secret. Cryptography, on the other hand, encrypts and converts the secret message into an unintelligible form ensuring confidentiality, integrity, and authentication of the message. It is to be noted that both steganography and cryptography are expected to work together hand-in-hand in order to attain a better security. Hence, a methodology that combines techniques from both steganography and cryptography is an unavoidable one for the complete protection of sensitive data. This paper aims to achieve one such methodology. The best existing method which works in similar direction is observed to use character spacing feature of text documents to embed the secrets. The method is reported to attain an average embedding capacity of ≈2 bits/cover-character and 8-bits/distortion with high imperceptibility and considerable cryptographic security. However, during experimentation, it is noticed that the methodology has the potential vulnerability of leaving clues for attackers with a probability of 0.51% which paves way for possible statistical attacks namely frequency analysis. This vulnerability occurred because of the constant left circular shift operation that is performed after embedding each secret character. This paper aims to address this vulnerability by proposing a novel modification that facilitates the methodology to perform both left and right circular shifts in an unbiased manner, based on the embedded secret, without affecting the notable achievements of the existing methodology. The proposed modification is successfully implemented, and further analysis indicated that the performed modification has in fact embedded the secret characters uniformly thereby reducing the standard deviation by 24%. This increased the resilience of the extended method to potential attacks that rely on statistical techniques. © The Author(s), under exclusive

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Improving agility in projects using machine learning algorithm

引用

Multimedia Tools and Applications 2024年第38期83卷 85987-86005页

作者： Varun, Janani Karthika, R.A. Department of Computer Science and Engineering Vels Institute of Science Technology and Advanced Studies Chennai India Department of Computer Science and Engineering Saveetha School of Engineering SIMATS Chennai India

All the software products developed will need testing to ensure the quality and accuracy of the product. It makes the life of testers much easier when they can optimize on the effort spent and predict defects for the upcoming modules in the Agile era. The functionality being discussed in this paper is to predict the defects using Random Forest Algorithm. Predictive analytics draws on information from the past to create forecasts about the outcomes of future events. Product team always have the difficulty in delivering the product as per schedule. As we are in the agile era, the requirement keeps changing and team is unsure on upcoming releases. Prediction helps the team to focus on the complex and error prone modules in upcoming releases. The Predictive analytics model designed, can predict defects with an accuracy rate of 88% with the help of historical data. By predicting, testers can focus on the module where there are a greater number of defects predicted by the model and left shift the delivery. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Predictive analytics

来源：评论

学校读者我要写书评

暂无评论

Efficient multiverse electro search optimization for multi-cloud task scheduling and resource allocation

引用

Multimedia Tools and Applications 2024年 1-26页

作者： Ravi, Rupesh Pillai, Manu J. Department of Computer Science and Engineering TKM Institute of Technology Karuvelil Kerala Kollam691505 India Department of Computer Science and Engineering TKM College of Engineering Karicode Kollam India

Effective task scheduling and resource allocation have become major problems as a result of the fast development of cloud computing as well as the rise of multi-cloud systems. To successfully handle these issues, we provide a novel strategy in this study termed Efficient Multiverse Electro Search Optimization (EMESO). This study presents an Efficient Multiverse Electro Search optimization to improve work scheduling behaviour, with significance on electron transport near the nucleus and cosmological principles. The method uses exploration, exploitation, and local search to discover the optimal solution from a huge amount of potential alternatives. EMESO examines a broad search space to uncover optimal solutions for work scheduling and resource allocation by exploiting the concept of a multiverse, which represents a collection of parallel universes. While related to modern work, the proposed approach performs much better in big and extra-big workflow jobs than in smaller and midrange workflow jobs. It may decrease costs by 6%, shorten project timelines by 8%, and increase resource efficiency by 55% while still enabling all activities to be completed by the deadlines. The proposed approach significantly improves efficiency, resource utilization, and overall performance, making it one of the best options for managing complex cloud systems. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Complex preference analysis: a score-based evaluation strategy for ranking and comparison of the evolutionary algorithms

引用

Soft Computing 2025年第4期29卷 1967-1980页

作者： Sarkar, Debojyoti Biswas, Anupam Department of Computer Science and Engineering National Institute of Technology Silchar Assam Silchar788010 India

In this paper, an evaluation strategy is proposed for evaluation of optimization algorithms, called the Complex Preference Analysis, that assesses the efficiency of different evolutionary algorithms by considering multiple performance metrics concurrently across diverse dimensions and generating a single score for ranking. The proposed strategy allows for a thorough evaluation by assigning distinct priorities in the form of weights, to various performance parameters. The algorithm’s performances on each performance parameter are captured and the best and worst performances in each performance category are identified. The deviation of each algorithm from the best and worst performances in the respective performance category is formulated to generate a single score for each of the algorithms for comparison. The flexibility to adjust weights provides a valuable tool for customizing evaluations according to individual needs and preferences. The proposed evaluation strategy is studied by running evaluations on nine evolutionary algorithms based on their performance over five performance indicators on six datasets of the Travelling Salesman Problem. Conducting Complex Preference Analysis on the different evolutionary algorithms reveals distinctive patterns in their performance, with some algorithms such as Simulated Annealing, Tabu Search, Bat Algorithm, Genetic Algorithm, etc. consistently demonstrating superior results across multiple Travelling Salesman Problem instances, while other algorithms such as Ant Colony Optimization, Teaching Learning Based Optimization, etc. rank lower. The algorithms’ performances on individual performance parameters, when reflected on the final rank of the algorithms, generated based on the collective impact of all the parameters, elucidate the efficiency of the proposed evaluation strategy. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

A brief review on Quantum Key Distribution Protocols

引用

Multimedia Tools and Applications 2025年 1-40页

作者： Kumar, Mandeep Mondal, Bhaskar Department of Computer Science & Engineering National Institute of Technology Patna Bihar Patna800005 India

Development in Quantum computing paves the path to Quantum key distribution (QKD) by using the principles of quantum physics. QKD enables two remote parties to produce and share secure keys while removing all computing constraints on an adversary. The basic physics laws are used to identify any outside parties eavesdropping on the key exchange. In recent years many revolutionary developments in the field of QKD have been developed to overcome security and networking constraints. This survey provides an overview of the QKD protocol’s evolution and quantum network architecture. The paper also demonstrates QKD deployment techniques and elements of the QKD network. It also highlights ongoing design challenges by considering security and error estimation and correction, in contrast to studies concentrating on optical channels and equipment. Finally, this paper examines the possible directions for future research and offers design principles to guide the development of QKD and its related area. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

Feedback-based trust module for IoT networks using machine learning

引用

International Journal of Wireless and Mobile Computing 2024年第1期27卷 78-91页

作者： Iqbal, Sania Qureshi, Shaima Department of Computer Science and Engineering National Institute of Technology Jammu & Kashmir Srinagar India

The increasing emergence of IoT in healthcare, industrial automation, manufacturing, infrastructure, business and the home undoubtedly provides more conveniences in different aspects of human life. Any IoT security and trust solution must consider the heterogeneity and mobility of IoT devices, and the features of other devices connected to the network. Traditional security measures face computation, storage and communication challenges in securing IoT, and the increasing reliance on IoT services and applications has exacerbated this issue. It is crucial to identify a security management model to handle these constraints. Trust as a security regime in the IoT has far-reaching implications. This paper proposes a novel trust-based security mechanism by combining machine learning and traditional summations to determine a node’s trustworthiness in an IoT environment in milliseconds. Based on this, a computational trust management model is designed by aggregating direct and feedback-based trust information. The model parameters like the trust breach window and trust re-initiation point are selected based on extensive experimentation to dynamically calculate each node’s trust value to reach the proposed model’s peak performance. The model’s effectiveness is verified through simulation. In 500 iterations, the proposed model achieved 97% accuracy with a run time of 0.37 seconds. Copyright © 2024 Inderscience Enterprises Ltd.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Model-to-Circuit Cross-Approximation for Printed Machine Learning Classifiers

引用

IEEE Transactions on computer-Aided Design of Integrated Circuits and Systems 2023年第11期42卷 3532-3544页

作者： Armeniakos, Giorgos Zervakis, Georgios Soudris, Dimitrios Tahoori, Mehdi B. Henkel, Jorg Karlsruhe Institute of Technology Karlsruhe76131 Germany National Technical University of Athens School of Electrical and Computer Engineering Athens15780 Greece University of Patras Computer Engineering and Informatics Department Patras26504 Greece Karlsruhe Institute of Technology Department of Computer Science Karlsruhe76131 Germany

Printed electronics (PEs) promises on-demand fabrication, low nonrecurring engineering costs, and subcent fabrication costs. It also allows for high customization that would be infeasible in silicon, and bespoke architectures prevail to improve the efficiency of emerging PE machine learning (ML) applications. Nevertheless, large feature sizes in PE prohibit the realization of complex ML models in PE, even with bespoke architectures. In this work, we present an automated, cross-layer approximation framework tailored to bespoke architectures that enable complex ML models, such as multilayer perceptrons (MLPs) and support vector machines (SVMs), in PE. Our framework adopts cooperatively a hardware-driven coefficient approximation of the ML model at algorithmic level, a netlist pruning at logic level, and a voltage overscaling at the circuit level. Extensive experimental evaluation on 12 MLPs and 12 SVMs and more than 6000 approximate and exact designs demonstrates that our model-to-circuit cross-approximation delivers power and area optimal designs that, compared to the state-of-the-art exact designs, feature on average 51% and 66% area and power reduction, respectively, for less than 5% accuracy loss. Finally, we demonstrate that our framework enables 80% of the examined classifiers to be battery-powered with almost identical accuracy with the exact designs, paving thus the way toward smart complex printed applications. © 1982-2012 IEEE.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

Exploring ensemble optimized voting and stacking classifiers through Cross-validation for early detection of suicidal ideation

引用

Journal of Intelligent and Fuzzy Systems 2024年第5-6期47卷 335-349页

作者： Shukla, Shiv Shankar Prasad Singh, Maheshwari Prasad Department of Computer Science Engineering National Institute of Technology Patna Bihar Patna India

Detecting behavioral changes associated with suicidal ideation on social media is essential yet complex. While machine learning and deep learning hold promise in this regard, current studies often lack generalizability due to single dataset reliance. Traditional embedding techniques struggle with semantic analysis,leading to challenges in achieving high accuracy models and conventional validation methods have data drift limitations. To address these challenges, this study proposes a novel evaluation approach using natural language processing across diverse platforms like Twitter and Reddit. By integrating BERT embedding, adept at handling semantic nuances, with an optimized Stacked Classifier combining different base classifiers and XGBoost as the meta-classifier, the model excels in swiftly detecting signs of suicidal ideation compared to the Voting Classifier, i.e., the combination of Decision Tree, Random Forest, Gradient Boost and XGBoost and several machine learning models. Additionally, the study explores advanced embedding techniques like MUSE and LLM, and deep learning models including Bi-LSTM, Bi-GRU, and Text-CNN for *** ensemble approach aims to create a model that is not only interpretable but also robust, reducing computational complexity and enhancing resilience against noisy data - common challenges faced in text classification tasks. Through K-fold validation, which involves partitioning the dataset into k equal-sized subsets or "folds"and training the model k times, using k-1 folds for training and one-fold for testing each time, the proposed model achieves impressive accuracy rates of 97% on Reddit and 96% on Twitter datasets, underscoring its effectiveness in identifying suicidal ideation across social media platforms. © 2024 - IOS Press. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Improved security with novel M-Log chaos steganography algorithm for huffman compressed english text

引用

Multimedia Tools and Applications 2025年第2期84卷 665-688页

作者： Raghuvanshi, Devvrat Joshi, Kamaldeep Nandal, Rainu Sehrawat, Harkesh Singh, Surender Singh, Srishti Department of Computer Science and Engineering University Institute of Engineering and Technology Maharshi Dayanand University Rohtak Haryana India

This paper addresses the underexplored landscape of chaotic functions in steganography, existing literature when examined under PRISMA-ScR framework it was realized that most of the studies predominantly focuses on utilizing chaotic functions for either concealing or diffusing messages within cover images. This study explored a different direction of using chaotic function as guards for concealed data by proposing the M-Log chaos algorithm which employs logarithmic chaotic function to drive a unique bomb generator equation, strategically placing bomb bits in the image. These bombs act as sentinels, safeguarding the concealed message. Successful retrieval involves diffusing the bombs before extracting data from the rest of the image. Failure to defuse these bombs prior to access results in irreversible damage to concealed information, thwarting unauthorized access. Our proposed method demonstrates notable advancements across quantitative performance metrics, including a 40% increase in payload capacity, a mean PSNR of 45.8981, and a mean SSIM of 0.9931. Future avenues include exploring multi-dimensional chaotic functions and employing nature-based searching algorithms such as genetic algorithms or particle swarm optimization for optimal chaos bomb placement. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

Joint V2V Group Association and Transmission Power Control in Federated Vehicular Networks

引用

IEEE Internet of Things Journal 2025年第11期12卷 18167-18182页

作者： Liu, Su Guan, Peiyuan Li, Yushuai Li, Tianyi Zolfagharian, Zolaikha Yu, Jiong Huang, Tingwen Xinjiang University School of Computer Science and Technology Urumqi830046 China University of Oslo Department of Informatics Oslo0316 Norway Aalborg University Department of Computer Science Aalborg9220 Denmark University of Tehran School of Electrical and Computer Engineering Iran Shenzhen University of Advanced Technology Faculty of Computer Science and Control Engineering Shenzhen518055 China

With growing awareness of privacy protection, Federated Learning (FL) in vehicular network scenarios effectively addresses privacy concerns, leading to the development of Federated Vehicular Networks (FVN). In FVN, vehicles maintain a global model by transmitting local models and iterative processing, resulting in significant communication overhead. In the Internet of Vehicles (IoV), as the majority of the spectrum resources are allocated to Vehicle-to-Vehicle (V2V) communication, vehicles engaged in FL encounter uplink interference when these resources are reused. This compromises the efficacy of FL vehicle communication. To address this issue, we propose FedCDC, a new Federated learning framework with adaptive weight Clustering with knowledge Distillation and Channel sharing-based resource allocation. First, we implement a communication compression strategy based on clustering and distillation to alleviate transmission load. Then, we develop a resource allocation strategy to maximize the Signal-to-Interference-plus-Noise Ratio (SINR) for both FL vehicles and V2V groups, which investigates two critical components: channel pairing and power coordination. We formulate the optimization issue as a multi-objective optimization problem that is solved offline using the MIDACO solver. Due to the dynamic characteristics of FVN, we employ a Multi-Agent Deep Deterministic Policy Gradient (MADDPG) to enhance efficiency. Finally, extensive experiments demonstrate that our approach significantly reduces data transmission and offers an efficient resource coordination plan, thus improving FL communication efficiency and ensuring the Quality of Service (QoS) for both V2V groups and FL vehicles. © 2014 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：