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

Binary Error-Correcting Codes With Minimal Noiseless Feedback

IEEE Transactions on Information Theory 2025年第5期71卷 3424-3446页

作者： Gupta, Meghal Guruswami, Venkatesan Yun Zhang, Rachel Department of Electrical and Computer Engineering BerkeleyCA94720 United States Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science CambridgeMA02139 United States

In the setting of error-correcting codes with feedback, Alice wishes to communicate a k-bit message x to Bob by sending a sequence of bits over a channel while noiselessly receiving feedback from Bob. It has been long known (Berlekamp, 1964) that in this model, Bob can still correctly determine x even if ≈ 1/3 of Alice’s bits are flipped adversarially. This improves upon the classical setting without feedback, where recovery is not possible for error fractions exceeding 1/4 . In the corresponding setting of erasures rather than bit flips, feedback improves the error resilience from 1/2 -Ε to 1 - Ε for any Ε > 0 . The original feedback setting assumes that after transmitting each bit, Alice knows (via feedback) what bit Bob received. In this work, our focus in on the limited feedback model, where Bob is only allowed to send a few bits at a small number of pre-designated points in the protocol. For any desired Ε > 0 , we construct a coding scheme that tolerates a 1/3 -Ε fraction of bit flips (respectively a 1 −Ε fraction of erasures) relying only on OΕ (log k) bits of feedback from Bob sent in a fixed OΕ (1) number of rounds. We complement this with a matching lower bound showing that Ω (log k) bits of feedback are necessary to recover from an error fraction exceeding 1/4 (respectively 1/2 for erasures), and for schemes resilient to a 1/3 -Ε fraction of bit flips (respectively a 1 −Ε fraction of erasures), the number of rounds must grow as Ε → 0 © 1963-2012 IEEE.

关键词： Binary codes

来源：评论

学校读者我要写书评

暂无评论

Extreme learning machine to foretell the deflection in plain cement, steel-reinforced, and bamboo-reinforced concrete beams

引用

Emerging Materials Research 2025年第1期14卷 12-27页

作者： Dubey, Saurabh Gupta, Deepak Mallik, Mainak Department of Civil Engineering National Institute of Technology Arunachal Pradesh India Department of Computer Science and Engineering Motilal Nehru National Institute of Technology Allahabad India

In mountainous regions, bamboo has gained popularity as a local reinforcement material for concrete due to its availability and cost-effectiveness. However, the lack of standardized design guidelines complicates the assessment of deflection behavior under varying loads. Challenges such as bond failure, shrinkage, corrosion, and material strength uncertainties further limit its structural application. To address these issues, this study employs an extreme learning machine to predict deflection in plain cement concrete beams, steel-reinforced cement concrete beams, and bamboo-reinforced concrete beams. The performance of extreme learning machine is compared with support vector regression and artificial neural networks. A total of 122 specimens were analyzed using input features such as cement content, water-cement ratio, fine aggregate, coarse aggregate, tensile strength, concrete compressive strength, percentage of reinforcement, applied load, cross-sectional area, and clear cover. The extreme learning machine method demonstrated satisfactory performance with a coefficient of deformation of 0.9975, Mean Square Error of 0.0003, Mean Absolute Error of 0.0052, Mean Absolute Percentage Error of 0.0998, and Root Mean Square Error of 0.01694. These results suggest that extreme learning machine is an efficient machine learning algorithm for predicting the deflection behavior of different reinforced concrete beams, providing a reliable alternative to traditional methods. © 2025 Emerald Publishing Limited: All rights reserved.

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

A lightweight identity based mutual authenticated key agreement scheme for telecare medical information system

引用

Multimedia Tools and Applications 2025年 1-25页

作者： Banerjee, Ananya Sahana, Subhas Chandra Department of Computer Science & Engineering National Institute of Technology West Bengal Durgapur713209 India

The Telecare Medical Information System (TMIS) faces challenges in securely exchanging sensitive health information between TMIS nodes. A Mutual Authenticated Key Agreement (MAKA) scheme is used to eliminate security flaws, ensure users’ authenticity and establish a shared session key between two communicating nodes. A Public Key Infrastructure (PKI) based traditional authenticated key agreement scheme in TMIS driven by resource-constrained devices requires extra processing power and storage space to perform different certificate management activities. This overhead can be eliminated adopting Identity-Based Cryptography. We propose a mutual authenticated key agreement scheme based on Identity-Based Cryptography (IBC) incorporating elliptic curves which make the scheme not only computation cost efficient but also communication cost efficient. The proposed scheme is secure against all attacks related to a key agreement protocol. Comparative analysis with existing authentication schemes and formal security simulation using the AVISPA toolset demonstrate that the proposed scheme outperforms similar types of existing established schemes in the TMIS literature. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

HViTML: Hybrid vision transformer with machine learning-based classification model for glaucomatous eye

引用

Multimedia Tools and Applications 2025年 1-24页

作者： Singh, Piyush Bhushan Singh, Pawan Dev, Harsh Batra, Devanshu Chaurasia, Brijesh Kumar Department of Information Technology Pranveer Singh Institute of Technology Uttar Pradesh Kanpur India Department of Computer Science and Engineering Amity School of Engineering and Technology Amity University Uttar Pradesh Lucknow India Department of Computer Science and Engineering Babu Banarasi Das University Uttar Pradesh Lucknow India Department of Computer Science and Engineering Pranveer Singh Institute of Technology Uttar Pradesh Kanpur India

Glaucoma is currently one of the most significant causes of permanent blindness. Fundus imaging is the most popular glaucoma screening method because of the compromises it has to make in terms of portability, size, and cost. In recent years, convolution neural networks (CNNs) have revolutionized computer vision. Convolution is a "local" CNN technique that is only applicable to a small region surrounding an image. Vision Transformers (ViT) use self-attention, which is a "global" activity since it collects information from the entire image. As a result, the ViT can successfully gather distant semantic relevance from an image. This study examined several optimizers, including Adamax, SGD, RMSprop, Adadelta, Adafactor, Nadam, and Adagrad. With 1750 Healthy and Glaucoma images in the IEEE fundus image dataset and 4800 healthy and glaucoma images in the LAG fundus image dataset, we trained and tested the ViT model on these datasets. Additionally, the datasets underwent image scaling, auto-rotation, and auto-contrast adjustment via adaptive equalization during preprocessing. The results demonstrated that preparing the provided dataset with various optimizers improved accuracy and other performance metrics. Additionally, according to the results, the Nadam Optimizer improved accuracy in the adaptive equalized preprocessing of the IEEE dataset by up to 97.8% and in the adaptive equalized preprocessing of the LAG dataset by up to 92%, both of which were followed by auto rotation and image resizing processes. In addition to integrating our vision transformer model with the shift tokenization model, we also combined ViT with a hybrid model that consisted of six different models, including SVM, Gaussian NB, Bernoulli NB, Decision Tree, KNN, and Random Forest, based on which optimizer was the most successful for each dataset. Empirical results show that the SVM Model worked well and improved accuracy by up to 93% with precision of up to 94% in the adaptive equalization preprocess

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

MOHSQO: Multi objective harmony search algorithm based QoS optimization in delay tolerant networks

引用

Multimedia Tools and Applications 2025年 1-26页

作者： Sonkar, Nidhi Pandey, Sudhakar Kumar, Sanjay Department of Computer Science and Engineering National Institute of Technology Warangal Hanamkonda India Department of Information Technology National Institute of Technology Raipur Raipur India

Delay Tolerant Networks (DTNs) have the ability to make communication possible without end-to-end connectivity using store-carry-forward technique. Efficient data dissemination in DTNs is very challenging problem due to compromising in Quality-of-Service (QoS) metrics such as delivery ratio, end-to-end delay and overhead ratio. That means, if an algorithm is design to find highest delivery ratio, then the algorithm does not bother about delay and overhead ratio. Researchers tried to improve the performance of network but, none of them had given satisfactory results to make a balance between all QoS metrics. In this paper, we have proposed a novel approach to optimize the performance of the network using Multi objective harmony search algorithm by creating a balance between all QoS metrics. Harmony search algorithm considers number of QoS parameters simultaneously. We have used characteristics of the node (Speed, residual energy, buffer capacity and encounters) to select the optimum forwarder node so that we can balance the performance metrics for network optimization. We have used ONE (Opportunistic Network Environment) simulator to simulate the proposed method and compared with exiting techniques. By analyzing the results, we can say that proposed method has the optimum performance. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Delay tolerant networks

来源：评论

学校读者我要写书评

暂无评论

Universal Polarization for Processes with Memory

引用

IEEE Transactions on Information Theory 2025年第3期71卷 1705-1757页

作者： Shuval, Boaz Tal, Ido Technion - Israel Institute of Technology Viterbi Department of Electrical and Computer Engineering Haifa320003 Israel

A transform that is universally polarizing over a set of channels with memory is presented. Memory may be present in both the input to the channel and the channel itself. Both the encoder and the decoder are aware of the input distribution, which is fixed. However, only the decoder is aware of the actual channel being used. The transform can be used to design a universal code for this scenario. The code is to have vanishing error probability when used over any channel in the set, and achieve the infimal information rate over the set. The setting considered is, in fact, more general: we consider a set of processes with memory. Universal polarization is established for the case where each process in the set: 1) has memory in the form of an underlying hidden Markov state sequence that is aperiodic and irreducible;and 2) satisfies a 'forgetfulness' property. Forgetfulness, which we believe to be of independent interest, occurs when two hidden Markov states become approximately independent of each other given a sufficiently long sequence of observations between them. We show that aperiodicity and irreducibility of the underlying Markov chain is not sufficient for forgetfulness, and develop a sufficient condition for a hidden Markov process to be forgetful. © 1963-2012 IEEE.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

Comprehensive analysis of various imputation and forecasting models for predicting PM2.5 pollutant in Delhi

引用

Neural Computing and Applications 2025年 1-18页

作者： Karnati, Hemanth Soma, Anuraag Alam, Adnan Kalaavathi, B. School of Computer Science and Engineering Vellore Institute of Technology Tamil Nadu Vellore632014 India Department of IoT School of Computer Science and Engineering Vellore Institute of Technology Tamil Nadu Vellore632014 India

Understanding and predicting air quality is pivotal for public health and environmental management, especially in urban areas like Delhi. This study utilizes a comprehensive dataset from the Central Pollution Control Board, detailing air pollutant concentrations at the ITO (Income Tax Office), Delhi station, from 2017 to 2023. Our focus on pollutants such as PM2.5, PM10, NO2, NH3, SO2, ozone, and CO highlights the challenges posed by missing data in environmental studies. Through the application of several imputation models, including KNN, linear regression, forward fill + backward fill, Fourier + KNN, linear interpolation, and statistical methods, we identified combination of forward fill and backward fill as the most effective method for addressing data gaps, specifically for ozone measurements. Building on this imputed dataset, we employ various forecasting models to predict PM2.5 levels, a critical pollutant. Our exploration includes time series and deep learning approaches, such as LSTM, Bi-LSTM, CNN-LSTM, GRU, Deep AR, WaveNet, TCN, ARIMA, SARIMA, and Prophet. The performance of these models is evaluated using daily data, with Bi-LSTM and LSTM with attention emerging as the top performers due to their accuracy in predicting PM2.5 concentrations. The implications of our findings extend beyond academic interest, offering practical insights for environmental policy and health advisories in Delhi. By demonstrating the efficacy of specific imputation and forecasting techniques, our research contributes to the broader effort of improving air quality monitoring and prediction. The success of Bi-LSTM and LSTM with attention models, in particular, suggests a promising avenue for future studies aiming to enhance the precision of environmental forecasts. © The Author(s) 2025.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：