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

Nonlinearity in Large-Cycle Cellular Automata

Complex Systems 2025年第1期34卷 129-160页

作者： Mukherjee, Sukanya Adak, Sumit Department of Computer Science and Engineering Institute of Engineering and Management Kolkata University of Engineering and Management West Bengal Kolkata700091 India Department of Applied Mathematics and Computer Science DTU Compute Technical University of Denmark Kgs. Lyngby2800 Denmark

The class of maximal-length cellular automata (CAs) has gained significant attention over the last few years due to the fact that it can generate cycles with the longest possible lengths. For every l of the form l = 2n-1 where n ∈ , a cycle of length l can be generated by a cellular automaton (CA) of size ⌊log2 l⌋ + 1;this maximal-length CA is in fact the optimal (minimum-sized) CA to generate a cycle of length l. However, maximal-length CAs are, in general, linear and have some drawbacks. Moreover, it is nontrivial to address this problem for any l ∈ , that is, removing the constraint that l is of the form 2n-1. In this paper we therefore employ nonlinearity in the rules and aim to generate the near-optimal CA for any given cycle length l, meaning that the generated CAs will be of size n = (⌊log2 l⌋ + 1) + d, where the displacement d is as small as possible. We use a generic operator to concatenate a collection of component CAs of sizes n1, n2, …, nk by employing an evolutionary strategy. Here, n = n1 + n2 + ⋯ + nk and l ≥ lcm(1, 2, …, k ), where i (1 ≤ i ≤ k) is the maximum cycle length of a CA of size ni . An influencing factor in the design of component CAs is to achieve the near-optimal CA for a given cycle length. Here we consider nonlinear reversible large-cycle CAs as component CAs. We also measure the effectiveness of nonlinearity in large-cycle generation. © 2025, Complex Systems Publications, Inc. All rights reserved.

关键词： CAs cellular automata evolution large-cycle CA neighborhood dependent nonlinearity reversible CAs

来源：评论

学校读者我要写书评

暂无评论

Spatial Performance Analysis and Design Principles of Random Access-Based Wireless Mutual Broadcast in Various Spectral Environments

引用

IEEE Wireless Communications Letters 2025年第5期14卷 1296-1300页

作者： Kwon, Taesoo Seoul National University of Science and Technology Department of Computer Science and Engineering Seoul01811 Korea Republic of

Proximity-aware services are expected to grow further in the B5G and 6G era, often leveraging random access based wireless mutual broadcast operations among nearby nodes. This letter establishes a tractable framework for RA-WMB performance across sub-6GHz, mmWave, and THz bands, incorporating LoS/NLoS channels, beamforming, and molecular absorption. It analytically examines the impact of beamforming on the number of successful messages and broadcast coverage, derives an explicit suboptimal transmission probability for performance maximization, and highlights the critical role of sidelobe gain through both analytical and numerical results. © 2012 IEEE.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

Optimizing Stand-Alone PV Systems:A Metaheuristic-Enhanced Fuzzy Approach for Adaptive MPPT

引用

China Communications 2025年第1期22卷 61-74页

作者： Tina Samavat Mostafa Nazari Lin Fuhong Lei Yang Department of Computer Science and Engineering University of NevadaRenoNVUSA Faculty of Mechanical Engineering Shahrood University of TechnologyShahroodIran School of Computer and Communication Engineering University of Science and Technology BeijingBeijing 100083China

This paper introduces a simple yet effective approach for developing fuzzy logic controllers(FLCs)to identify the maximum power point(MPP)and optimize the photovoltaic(PV)system to extract the maximum power in different environmental *** propose a robust FLC with low computational complexity by reducing the number of membership functions and *** optimize the performance of the FLC,metaheuristic algorithms are employed to determine the parameters of the *** evaluate the proposed FLC in various panel configurations under different environmental *** results indicate that the proposed FLC can easily adapt to various panel configurations and perform better than other benchmarks in terms of enhanced stability,responsiveness,and power transfer under various scenarios.

关键词： genetic algorithm imperialist competitive algorithm invasive weed algorithm maximum power point tracking

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Deep neural network for emojis-based sentiment classification

引用

International Journal of Information Technology (Singapore) 2025年 1-8页

作者： Balaji, Prasanalakshmi Alsid, Linda Elzubir Gasm Sagar, Kalpna Prakasam, Shanmugapriya Department of Computer Science College of Computer Science King Khalid University Abha Saudi Arabia Department of Computer Science KIET Group of Institutions Delhi-NCR Ghaziabad India Department of Computer Science and Business Systems Rajalakshmi Engineering College Thandalam India

Sentiment classification using emojis on social media has become increasingly crucial in recent years. Social media commonly uses emojis to convey feelings, emotions, and moods. Hence, in this article, a Jellyfish Algorithm based on a Deep Convolution Neural Network (JA-DCNN) is developed for the sentiment classification of the emojis. Initially, the emoji images are collected from the open-source system. The proposed sentiment classification process uses a Jellyfish Algorithm (JA) optimized Deep Convolution Neural Network (DCNN). In DCNN, the hyperparameters are selected with the help of JA to improve accuracy and efficiency. The proposed method aims to improve the training features, maintain the resolution, reduce memory consumption, and improve the system’s accuracy. The proposed method decreases the computation cost and memory consumption, which empowers the system’s performance in emojis-based sentiment classification. The proposed method is implemented in MATLAB, and performance metrics of similarity and quality measurements evaluate performances. To validate the performance of the proposed methodology, it is compared with conventional methods such as MobilenetV2, ResNet18, and ResNet50, which have been proven to obtain better performance metrics. © Bharati Vidyapeeth's Institute of computer Applications and Management 2025.

关键词： Classification Deep convolution neural network Emojis Jellyfish algorithm Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Speech based emotion recognition by using a faster region-based convolutional neural network

引用

Multimedia Tools and Applications 2025年第8期84卷 5205-5237页

作者： Suneetha, Chappidi Anitha, Raju Department of Computer Science and Engineering Koneru Lakshmaiah Education Foundation Andhra Pradesh Vaddeswaram India

Automatic emotion identification from speech is a difficult problem that significantly depends on the accuracy of the speech characteristics employed for categorization. The display of emotions seen in human speech is inherently integrated with hidden representations of several dimensions and the fundamentals of human behaviour. This illustrates the significance of using auditory data gathered from discussions between people to determine people's emotions. In order to engage with people more closely, next-generation artificial intelligence will need to be able to recognize and express emotional states. Even though recovery of emotions from verbal descriptions of human interactions has shown promising outcomes, the accuracy of auditory feature-based emotion recognition from speech is still lacking. This paper suggests a unique method for Speech-based Emotion Recognition (SER) that makes use of Improved and a Faster Region-based Convolutional Neural Network (IFR-CNN). IFR-CNN employs Improved Intersection over Unification (IIOU) in the positioning stage with better loss function for improving Regions of Interest (RoI). With the help of a Recurrent Neural Network (RNN)-based model that considers both the dialogue structure and the unique emotional states;modern categorical emotion forecasts may be created quickly. In particular, IFR-CNN was developed to learn and store affective states, as well as track and recover speech properties. The effectiveness of the proposed method is evaluated with the help of real-time prediction capabilities, empirical evaluation, and benchmark datasets. From the speech dataset, we have extracted the Mel frequency cepstral coefficients (MFCC), as well as spectral characteristics and temporal features. Emotion recognition using retrieved information is the goal of the IFR-development. Quantitative analysis on two datasets, the Berlin Database of Emotional Speech (EMODB) and the Serbian Emotional Speech Database (GEES), revealed encouraging r

关键词： Emotion Recognition

来源：评论

学校读者我要写书评

暂无评论

LARSI-TPE-XGB: Short-Term Load Forecasting by Load-Adaptive Relative Strength Index and Fusion of Tree-Structured Parzen Estimator and XGBoost

引用

IEEE Transactions on Power Delivery 2025年第3期40卷 1318-1330页

作者： Liu, Jin-Xian Leu, Jenq-Shiou National Taiwan University of Science and Technology Department of Electronic and Computer Engineering Taipei106216 Taiwan

Power load forecasting is essential for optimizing power generation and distribution efficiency. This paper proposes a novel method for daily average load forecasting, referred to as LARSI-TPE-XGB, which integrates the Load-Adaptive Relative Strength Index (LARSI) with the Tree-structured Parzen Estimator (TPE) and eXtreme Gradient Boosting (XGBoost). Our method significantly improves the accuracy and generalization ability of short-term load forecasting (STLF) by addressing limitations in feature extraction and hyperparameter optimization. The proposed LARSI enhances the forecasting model by adapting an improved Relative Strength Index (RSI) for power load prediction, while TPE optimizes the model's hyperparameters to dynamically adjust to time-series updates, thus mitigating the issue of XGBoost's sensitivity to hyperparameters in high-dimensional scenarios. Experimental results on real-world power load datasets demonstrate that LARSI-TPE-XGB reduces errors by 18.58% and 30.73% in root mean squared error (RMSE) across two different datasets compared to models without LARSI-TPE-XGB and outperforms state-of-the-art models, as confirmed by the Diebold-Mariano (DM) test. Our method consistently improves performance across various datasets, while we further investigate the influence of LARSI and other factors, such as weather conditions, on forecasting accuracy. © 1986-2012 IEEE.

关键词： Electric load forecasting

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Divergence Maximizing Linear Projection for Supervised Dimension Reduction

引用

IEEE Transactions on Information Theory 2025年第3期71卷 2104-2115页

作者： Chen, Biao Kortje, Joshua Syracuse University Department of Electrical Engineering and Computer Science SyracuseNY13244 United States

This paper proposes two linear projection methods for supervised dimension reduction using only first- and second-order statistics. The methods, each catering to a different parameter regime, are derived under the general Gaussian model by maximizing the Kullback-Leibler divergence between the two classes in the projected sample for a binary classification problem. They subsume existing linear projection approaches developed under simplifying assumptions of Gaussian distributions, such as these distributions might share an equal mean or covariance matrix. As a by-product, we establish that the multi-class linear discriminant analysis, a celebrated method for classification and supervised dimension reduction, is provably optimal for maximizing pairwise Kullback-Leibler divergence when the Gaussian populations share an identical covariance matrix. For the case when the Gaussian distributions share an equal mean, we establish conditions under which the optimal subspace remains invariant regardless of how the Kullback-Leibler divergence is defined, despite the asymmetry of the divergence measure itself. Such conditions encompass the classical case of signal plus noise, where both signal and noise have zero mean and arbitrary covariance matrices. Experiments are conducted to validate the proposed solutions, demonstrate their superior performance over existing alternatives, and illustrate the procedure for selecting the appropriate linear projection solution. © 1963-2012 IEEE.

关键词： Discriminant analysis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：