Showing 221 - 240 results of 404 for search 'algorithmically random sequence', query time: 0.08s Refine Results
  1. 221

    A Fast Image Encryption Scheme Based on a Four-Dimensional Variable-Parameter Hyperchaotic Map and Cyclic Shift Strategy by Guidong Zhang, Yanhao Zhao, Yanpei Zheng, Yulin Shen, Jun Huang

    Published 2025-04-01
    “…Building upon this system, we design a fast image encryption algorithm that employs a cyclic shift strategy to continuously expand a small-scale random sequence, thereby generating the random numbers required for secure encryption. …”
    Get full text
    Article
  2. 222

    Enhanced security for medical images using a new 5D hyper chaotic map and deep learning based segmentation by S. Subathra, V. Thanikaiselvan

    Published 2025-07-01
    “…The randomness of the New 5D hyperchaotic system is verified using the NIST SP800-22 statistical test, calculating the Lyapunov exponent and plotting the attractor diagram of the chaotic sequence. …”
    Get full text
    Article
  3. 223

    Temporal Backtracking and Multistep Delay of Traffic Speed Series Prediction by Licheng Qu, Minghao Zhang, Zhaolu Li, Wei Li

    Published 2020-01-01
    “…With a real traffic data set, the coordinate descent algorithm was employed to search and determine the optimal backtracking length of traffic sequence, and multistep delay predictions were performed to demonstrate the relationship between delay steps and prediction accuracies. …”
    Get full text
    Article
  4. 224

    Subsynchronous Oscillation Time-varying Amplitude Frequency On-Line Monitoring Method Based on Sliding Window FFT by Jing YANG, Tong WANG, Junci TANG

    Published 2020-11-01
    “…The method can effectively identify the random time-varying oscillation modes and achieve on-line monitoring and analysis of sub-synchronous oscillations.…”
    Get full text
    Article
  5. 225

    Interpreting neural decoding models using grouped model reliance. by Simon Valentin, Maximilian Harkotte, Tzvetan Popov

    Published 2020-01-01
    “…Participants were asked to memorize a sequence of digits (0-9), varying randomly in length between one, four and seven digits, where EEG recordings for working memory load estimation were taken from a 3-second retention interval. …”
    Get full text
    Article
  6. 226

    An abnormal traffic detection method for chain information management system network based on convolutional neural network by Chao Liu, Chunxiang Liu, Changrong Liu

    Published 2025-04-01
    “…Finally, the conditional random field (CRF) determines the optimal label sequence based on the conditional probability distribution and applies the Viterbi algorithm to complete the sequence labeling of network traffic in chain information management system. …”
    Get full text
    Article
  7. 227

    Channel Estimation for Relay-Based M2M Two-Way Communications Using Expectation-Maximization by Xiaoyan Xu, Jianjun Wu, Chen Chen, Wenyang Guan, Haige Xiang

    Published 2013-12-01
    “…The Bayesian Cramér-Rao lower bounds are derived under random parameters for the channel estimation, and the simulation demonstrates the validity of the proposed studies.…”
    Get full text
    Article
  8. 228

    Design of multi-key encryption method by Yuqing ZHONG, Hao WANG, Zebing LIN, Min WANG, Liye CHEN

    Published 2020-11-01
    “…In order to improve the security in the process of information transmission,the current encryption methods were studied,and the research status was reported which increased the security of encryption by processing the key.According to the principle of segmenting and grouping data in the process of sending and encrypting,a method of multi-key encryption was designed:the segmenting key group and grouping key group were generated by the source key and random number,and the corresponding key was selected for each segmented and grouped data by its sequence number according to the matching algorithm.This method realized the encryption of multi-key in the process of information transmission.Finally,on the one hand,MATLAB was used to test and verify the encryption efficiency of this method.On the other hand,the security of this method was analyzed from the theoretical and mathematical perspective,comparing with the traditional method.It is concluded that this method can increase the security of the traditional method without too much cost much cost.…”
    Get full text
    Article
  9. 229

    A Mixed Chaotic Image Encryption Method Based on Parallel Rotation Scrambling in Rubik’s Cube Space by Lu Xu, Yun Chen, Yanlin Qin, Zhichao Yang

    Published 2025-05-01
    “…First, a seven-dimensional hyperchaotic system is introduced to generate chaotic pseudo-random integer sequences. Then, a proven lemma is applied to preprocess the red (R), green (G), and blue (B) channels of the plain image to realize the first diffusion. …”
    Get full text
    Article
  10. 230

    Combining multi-parametric MRI radiomics features with tumor abnormal protein to construct a machine learning-based predictive model for prostate cancer by Chi Zhang, Zewen Wang, Peicheng Shang, Yibin Zhou, Jin Zhu, Lijun Xu, Zeyu Chen, Mengqi Yu, Yachen Zang

    Published 2025-07-01
    “…Notably, combining mpMRI radiomic features with TAP and clinical characteristics, or integrating dADC (b = 100/2000 s/mm²) sequence with TAP and clinical characteristics to construct random forest models, improved the AUCs to 0.91 and 0.92, respectively. …”
    Get full text
    Article
  11. 231

    Adaptive Template Attacks on the Kyber Binomial Sampler by Eric Chun-Yu Peng, Markus G. Kuhn

    Published 2025-06-01
    “…Here we introduce a new technique for adapting templates generated from profiling devices in order to attack another device where we are also able to record many traces, but without knowledge of the random value held by the targeted variable. We interpret the model from the profiling devices as a Gaussian mixture and use the Expectation–Maximization (EM) algorithm to adapt its means and covariances to better match the unlabelled leakage distribution observed from the attacked setting. …”
    Get full text
    Article
  12. 232

    Reliability of plastid and mitochondrial localisation prediction declines rapidly with the evolutionary distance to the training set increasing. by Sven B Gould, Jonas Magiera, Carolina García García, Parth K Raval

    Published 2024-11-01
    “…Hence, hundreds of studies make use of algorithms that predict a localisation based on a protein's sequence. …”
    Get full text
    Article
  13. 233

    A multi-scale rotated ship targets detection network for remote sensing images in complex scenarios by Siyu Li, Fei Yan, Yunqing Liu, Yuzhuo Shen, Lan Liu, Ke Wang

    Published 2025-01-01
    “…This network combines ARC adaptive rotating convolution with a multi-scale feature fusion mechanism to enhance the model’s perceptual capability, addressing the issues of limited target feature information and random orientation angles. The proposed algorithm is validated on two public remote sensing image datasets, HRSC2016 and DOTA. …”
    Get full text
    Article
  14. 234

    Leveraging AlphaFold2 structural space exploration for generating drug target structures in structure-based virtual screening by Keisuke Uchikawa, Kairi Furui, Masahito Ohue

    Published 2025-09-01
    “…The exploration process is guided by iterative ligand docking simulations, with mutation strategies optimized either by a genetic algorithm or via random search. Our evaluation shows that when sufficient active compounds are available, the genetic algorithm significantly enhances VS accuracy. …”
    Get full text
    Article
  15. 235

    Lightweight opportunistic routing forwarding strategy based on Markov chain by Feng LI, Ya-li SI, Zhen CHEN, Li-min SHEN

    Published 2017-05-01
    “…A lightweight opportunistic routing forwarding strategy (MOR) was proposed based on Markov chain.In the scheme,the execute process of network was divided into a plurality of equal time period,and the random encounter state of node in each time period was represented by activity degree.The state sequence of a plurality of continuous time period constitutes a discrete Markov chain.The activity degree of encounter node was estimated by Markov model to predict its state of future time period,which can enhance the accuracy of activity degree estimation.Then,the method of comprehensive evaluating forwarding utility was designed based on the activity degree of node and the average encounter interval.MOR used the utility of node for making a routing forwarding decision.Each node only maintained a state of last time period and a state transition probability matrix,and a vector recording the average encounter interval of nodes.So,the routing forwarding decision algorithm was simple and efficient,low time and space complexity.Furthermore,the method was proposed to set optimal number of the message copy based on multiple factors,which can effectively balance the utilization of network resources.Results show that compared with existing algorithms,MOR algorithm can effectively increase the delivery ratio and reduce the delivery delay,and lower routing overhead ratio.…”
    Get full text
    Article
  16. 236

    Lightweight opportunistic routing forwarding strategy based on Markov chain by Feng LI, Ya-li SI, Zhen CHEN, Li-min SHEN

    Published 2017-05-01
    “…A lightweight opportunistic routing forwarding strategy (MOR) was proposed based on Markov chain.In the scheme,the execute process of network was divided into a plurality of equal time period,and the random encounter state of node in each time period was represented by activity degree.The state sequence of a plurality of continuous time period constitutes a discrete Markov chain.The activity degree of encounter node was estimated by Markov model to predict its state of future time period,which can enhance the accuracy of activity degree estimation.Then,the method of comprehensive evaluating forwarding utility was designed based on the activity degree of node and the average encounter interval.MOR used the utility of node for making a routing forwarding decision.Each node only maintained a state of last time period and a state transition probability matrix,and a vector recording the average encounter interval of nodes.So,the routing forwarding decision algorithm was simple and efficient,low time and space complexity.Furthermore,the method was proposed to set optimal number of the message copy based on multiple factors,which can effectively balance the utilization of network resources.Results show that compared with existing algorithms,MOR algorithm can effectively increase the delivery ratio and reduce the delivery delay,and lower routing overhead ratio.…”
    Get full text
    Article
  17. 237
  18. 238

    A Novel Compressive Optical Encryption via Single-Pixel Imaging by Chenggong Zhang, Bennian Han, Wenqi He, Xiang Peng, Chen Xu

    Published 2019-01-01
    “…A novel compressive optical cryptosystem based on single-pixel imaging is proposed. By using random sparse sampling in the encryption process, the plaintext is encrypted and compressed into a noise-like intensity sequence. …”
    Get full text
    Article
  19. 239

    First Report of Ganoderma ryvardenii causing Basal Stem Rot (BSR) disease on oil palm (Elaeis guineensis Jacq.) in Ghana [version 1; peer review: 1 approved, 2 approved with reserv... by Frank K. Ackah, Grace C van der Puije, Emmanuellah Lekete-Lawson, Enoch A. Osekre

    Published 2025-04-01
    “…Molecular assays were performed on each sample using nucleic acid as a template. ITS and GanET sequence analysis were performed along with the formation of a phylogenetic tree using the FASTA algorithm with the Fungus database from EBI and NCBI GenBank. …”
    Get full text
    Article
  20. 240

    Stair Scheduling for Data Collection in Wireless Sensor Networks by Jinbiao Chen, Yongcai Wang, Yuexuan Wang, Changjian Hu

    Published 2013-04-01
    “…The results show that the performances of stair scheduling are much better than that of random scheduling algorithms.…”
    Get full text
    Article