
The aims of this paper to explore the dynamics of the vector-host disease with saturated treatment function. Initially, we formulate the model by considering three different classes for human and two for the vector population. The use of the treatment function in the model and their brief analysis for the case of disease-free and endemic case are briefly shown. We show that the basic reproduction number (<or >) than unity, the disease-free and endemic cases are stable locally and globally. Further, we apply the optimal control technique by choosing four control variables in order to maximize the population of susceptible and recovered human and to minimize the population of infected humans and vector. We discuss the results in details of the optimal controls model and show their existence. Furthermore, we solve the optimality system numerically in connection with the system of no control and the optimal control characterization together with adjoint system, and consider a set of different controls to simulate the models. The considerable best possible strategy that can best minimize the infection in human infected individuals is the use of all controls simultaneously. Finally, we conclude that the work with effective control strategies.
Citation: Muhammad Altaf Khan, Navid Iqbal, Yasir Khan, Ebraheem Alzahrani. A biological mathematical model of vector-host disease with saturated treatment function and optimal control strategies[J]. Mathematical Biosciences and Engineering, 2020, 17(4): 3972-3997. doi: 10.3934/mbe.2020220
[1] | Rujing Zhao, Xiulan Lai . Evolutionary analysis of replicator dynamics about anti-cancer combination therapy. Mathematical Biosciences and Engineering, 2023, 20(1): 656-682. doi: 10.3934/mbe.2023030 |
[2] | Abeer S. Alnahdi, Muhammad Idrees . Nonlinear dynamics of estrogen receptor-positive breast cancer integrating experimental data: A novel spatial modeling approach. Mathematical Biosciences and Engineering, 2023, 20(12): 21163-21185. doi: 10.3934/mbe.2023936 |
[3] | Urszula Ledzewicz, Heinz Schättler, Mostafa Reisi Gahrooi, Siamak Mahmoudian Dehkordi . On the MTD paradigm and optimal control for multi-drug cancer chemotherapy. Mathematical Biosciences and Engineering, 2013, 10(3): 803-819. doi: 10.3934/mbe.2013.10.803 |
[4] | Yi Liu, Long Cheng, Xiangyang Song, Chao Li, Jiantao Zhang, Lei Wang . A TP53-associated immune prognostic signature for the prediction of the overall survival and therapeutic responses in pancreatic cancer. Mathematical Biosciences and Engineering, 2022, 19(1): 191-208. doi: 10.3934/mbe.2022010 |
[5] | Samantha L Elliott, Emek Kose, Allison L Lewis, Anna E Steinfeld, Elizabeth A Zollinger . Modeling the stem cell hypothesis: Investigating the effects of cancer stem cells and TGF−β on tumor growth. Mathematical Biosciences and Engineering, 2019, 16(6): 7177-7194. doi: 10.3934/mbe.2019360 |
[6] | Hongli Yang, Jinzhi Lei . A mathematical model of chromosome recombination-induced drug resistance in cancer therapy. Mathematical Biosciences and Engineering, 2019, 16(6): 7098-7111. doi: 10.3934/mbe.2019356 |
[7] | Baba Issa Camara, Houda Mokrani, Evans K. Afenya . Mathematical modeling of glioma therapy using oncolytic viruses. Mathematical Biosciences and Engineering, 2013, 10(3): 565-578. doi: 10.3934/mbe.2013.10.565 |
[8] | Farinaz Forouzannia, Sivabal Sivaloganathan, Mohammad Kohandel . A mathematical study of the impact of cell plasticity on tumour control probability. Mathematical Biosciences and Engineering, 2020, 17(5): 5250-5266. doi: 10.3934/mbe.2020284 |
[9] | Cassidy K. Buhler, Rebecca S. Terry, Kathryn G. Link, Frederick R. Adler . Do mechanisms matter? Comparing cancer treatment strategies across mathematical models and outcome objectives. Mathematical Biosciences and Engineering, 2021, 18(5): 6305-6327. doi: 10.3934/mbe.2021315 |
[10] | Erin N. Bodine, K. Lars Monia . A proton therapy model using discrete difference equations with an example of treating hepatocellular carcinoma. Mathematical Biosciences and Engineering, 2017, 14(4): 881-899. doi: 10.3934/mbe.2017047 |
The aims of this paper to explore the dynamics of the vector-host disease with saturated treatment function. Initially, we formulate the model by considering three different classes for human and two for the vector population. The use of the treatment function in the model and their brief analysis for the case of disease-free and endemic case are briefly shown. We show that the basic reproduction number (<or >) than unity, the disease-free and endemic cases are stable locally and globally. Further, we apply the optimal control technique by choosing four control variables in order to maximize the population of susceptible and recovered human and to minimize the population of infected humans and vector. We discuss the results in details of the optimal controls model and show their existence. Furthermore, we solve the optimality system numerically in connection with the system of no control and the optimal control characterization together with adjoint system, and consider a set of different controls to simulate the models. The considerable best possible strategy that can best minimize the infection in human infected individuals is the use of all controls simultaneously. Finally, we conclude that the work with effective control strategies.
Information hiding, as an important research direction in the field of network security, has made great progress in recent years. Secret information is usually embedded into various multimedia carriers, such as text, images [1], audio [2] and videos [3]. Since text is the most widely used media, information hiding based on text has great value. Most traditional text steganography methods hide secret information in an existing document by exploiting its typesetting (format-based) and its lexical, syntactical, and semantical features (content-based) of the document. Format-based methods, for example, typically alter letter-spacing [4] and line-spacing [5], change the font attributes [6], and utilize invisible characters [7]. These methods, however, are sensitive to formats, and a slight change of format could cause new errors when extracting secret information. Common content-based methods, on the other hand, may change existing semantics using, e.g., synonym substitution [8,9], and adjust syntactic structures of certain sentences [10]. These traditional methods embed secret information by making some changes to the text, thus they are vulnerable to some steganalysis algorithms [11,12], which lead to poor security.
In recent years, researchers have started to investigate how to generate text, instead of modifying existing one, to hide information. For example, Yu et al. [13] proposed to use a special style of poetry called "Song Ci", originated in the Song Dynasty in ancient China, to form text steganography. This was the first text steganography algorithm to make use of a Chinese art form. However, their method only selects suitable words from an existing Song-Ci poem to recombines a new Ci-poem. It does not really generate new Ci-poems from scratch, and so may limit its usage. In addition, their method randomly chooses words during the generation process and ignores word collocations and the relationships between lines. Because of these, Ci-poems generated by their algorithms often lack a central theme, which might arouse suspicion and thus reduce security.
Recently, deep-learning technologies has achieved great success in the field of image generation [14]. Benefiting from this, more attempts of using such technologies have been made to generate a certain type of text form. For example, Zhang and Lapata [15] studied poem generations as a machine- translation problem using the standard encoder-decoder model. Their method compresses all previously generated lines for a poem to be generated into a vector to help generate the next line. Wang et al. [16,17] and Yi et al. [18] presented a method to generate a poem around a central theme using a bidirectional recurrent neural network (RNN) with attention mechanism, which allow them to focus on the most critical components and deep dependencies of lines in a poem.
Using CNN modeling, researchers have applied text generations to text steganography. For example, Luo et al. [19] presented a method based on Ci-poem generations using a Markov chain model. While their method does produce a better Ci-poem, it has a low embedding capacity for hiding information. They [20] also showed how to use a LSTM model to generate Chinese classic poems and embed secret information into a generated poem during the generation process.
We note that ancient styles of poetry, although once played an important role in the literature, often have a unique style of expressions that makes it difficult for general readers to comprehend. In particular, secret information embedded in a poem may look odd and thus arouse suspicion, leading to weaker security.
To overcome this obstacle, we devise a novel text steganography method using a RNN model to generate Chinese pop music lyrics. Compared to the poems written in a stringent style, lyrics are easier to understand and allowed to have a much longer length, yielding better security and a higher embedding capacity. However, if applying neural networks to lyrics generation directly, especially when combining text steganography, the resulting text may not look like lyrics at all. The reason is that lyrics must also follow a certain structure and properly rhyme. Moreover, lyrics should express emotions consistently. To tackle these issues, we analyze a large number of Chinese pop lyrics, summarize three common types, and use them as structure templates to guide lyric generation. We then present thirteen rhymes, similar to the oblique tones of poems, for generating lyrics with pleasant tones.
Our contributions are the following: First, we devise a RNN-based lyric generator with steganography to offer a much higher embedding capacity than previous steganography methods. Second, we present three structure templates for Chinese pop music and thirteen rhymes to mitigate the lyric-quality decrease incurred during the process of hiding information.
The rest of the paper is organized as follows: In Section 2 we describe preliminary results. In Section 3 we present a detailed description of our RNN-based lyric-generation model suitable for text steganography. In Section 4 we carry out the construction of dataset, show the generated results, evaluate the proposed method and make comparisons with previous methods. Finally, we conclude the paper in Section 5.
In this section, we describe our preliminary results on Char-RNN, lyric formats, and rhymes.
The sequence-to-sequence (S2S) model has been widely used in machine translation, automatic response, text generation, and other fields. S2S may be carried out under the framework of Encoder-Decoder and implemented as a RNN, CNN or GRU. Recurrent Neural Network (RNN) is the most widely used, which has been proved to be the most suitable network model for dealing with sequential tasks. However, a basic RNN model consists of only one hidden state, and the information at the beginning of the sequence is seldom retained in a later stage, there is a severe problem of gradient disappearance [17]. Therefore, basic RNNs are not suitable for generating the long lyrics. To solve these problems, researchers have proposed a number of variants of RNN, including LSTM and GRU.
As a special kind of RNN network, LSTM [21] adopts four processing methods that interact with each other in a special way to realize the processing of long-term dependence. The LSTM network model is shown in Figure 1. All recurrent neural networks have the form of a chain of repeating modules of neural network. In standard RNNs, this duplicate module has only one very simple structure, such as a single layer. However, LSTM avoids long-term dependency problems through special design. It usually uses a structure called a 'gate' to remove or increase the transmission of information.
In 2014, Karpathy [22] proposed a Char-RNN model, allowing machines to generate text from the dimension of characters. In other words, the model computes the probability of the next character based on the observed ones. In this paper, we devise a Char-RNN model based on LSTM to deal with long-distance dependency problems, Figure 2 shows the execution process of the model.
The Chinese pop music lyrics follow certain formats. After analyzing a large number of them, we found that most of them follow the following three structures: (1) A1 + B, A2 + B, (2) A1 + A2 + A3, (3) A1 + A2 + B1 + B2, where each letter with or without a number represents a lyric component consisting of 3 to 5 lines. Figure 3 shows an example of a classic 4-segment lyric.
A good Chinese pop lyric expresses strong emotions that are properly rhymed. To make Chinese pop lyrics rhyme, lyric writers would need to make sure that the pronunciations of the end words of each line rhyme. From the perspective of vocal music, Chinese syllables are divided into thirteen categories, which are called Thirteen-Rhymes [23]. The thirteen rhymes are classified according to the basic principles of the same or similar vowels. Table 1 shows the thirteen rhymes and the common Chinese characters for each rhyme. Figure 4 shows the content of the entire lyric "Deskmate of You", which is popular in mainland China. We can see that the rhyme of this lyric is Yi-Qi (pronunciations). In addition, a lyric may have more than one rhyme, and it is common to have three to five rhymes in a lyric.
Rhymes | Vowels | Characters | Music |
Fa-Hua | a, ia, ua | 巴、麻、花、沙 | 《绒花》 |
Suo-Bo | o, e, uo | 波、多、朵、烁 | 《我爱你中国》 |
Ye-Xie | ie, ue, üe | 街、谐、月、夜 | 《娄山关》 |
Gu-Su | u | 出、珠、福、图 | 《闪光的珍珠》 |
Yi-Qi | i, ü, er | 溪、雨、曲、句 | 《同桌的你》 |
Huai-Lai | ai, uai | 白、海、爱、来 | 《四季歌》 |
Hui-Dui | ei, ui, uei | 飞、灰、梅、泪 | 《大森林的早晨》 |
Yao-Tiao | ao, iao | 高、烧、苗、笑 | 《绣荷包》 |
You-Qiu | ou, iu, iou | 沟、球、舟、柳 | 《蝶恋花》 |
Yan-Qian | an, ian, uan, üan | 帆、天、旋、唤 | 《黄河颂》 |
Ren-Chen | en, in, un, ün | 春、纷、新、云 | 《兰花花》 |
Jiang-Yang | ang, iang, uang | 芳、霜、香、长 | 《松花江上》 |
Zhong-Dong | eng, ing, ueng, ong | 风、星 | 《故乡是北京》 |
Information hiding starts when the lyric generator produces a vector Y on the input vector X. We denote the output vector by Y=y1,y2,…,y3, where N is the length of input and output sequences. Moreover, yi(i=1,2,…,N−1) is equal to xi(i=2,3,…,N); in other words, YN is obtained from yi(i=1,2,...,N−1) with the highest probability and the model generates next y based on yi(i=2,3,...,N). Here YN could be a character or word. Thus, to hide secret information, we will filter out candidate characters or words on selected positions, code them, and select one of the most suitable candidates in accord with the secret information.
There are three steps: (1) Set parameters. (2) Generate candidates for the next character (or word). (3) Select the most suitable candidate. The whole process of information hiding is shown in Figure 5. In Step 1, we set the following four parameters:
● Structure. This was the underlying structure for the lyric to be generated, which was described in Section 2.2.
● Initialline. It preheats the generator and helps to generate the first few characters, but it is not part of the final lyrics.
● Information. This is a binary stream converted from the secret information, which is hidden, transformed and extracted.
● Size. It is the size of a candidate pool, from which we choose the most probable candidates. It is obvious that is an important factor of the embedding capacity. The larger Size is, the more secret information can be embedded.
In Step 2, the lyric generator produces YN = (p1, p2, ..., pSize) based on (y1, y2, ..., yN−1), where pi=1,2,...,Size are the probability of Size candidates.
Step 3 is the most critical part of our lyric-steganography method. For each YN, we first predict all the possibilities of the next characters based on the previous information. We then select m most likely characters as candidates, where m = Size. We encode these m characters (such as Huffman code). Finally, we choose the most suitable character to hide the secret information. In addition, it should be pointed out that if YN is space, we need to judge whether the length of the sentence has reached the minimum requirement. If it is, then the sentence is finished. Otherwise, we need to change the order of the candidates so that lines do not end too early.
In order to improve the quality of generated lyrics, we applied lyrics structures and rhythm table to experiments, which mentioned above, and propose the Word-RNN model. Then, two results are showed, which are generated by two different models respectively. Finally, we illustrate the extraction method of secret information.
As described in Section 2.2, most Chinese pop lyrics follow three common structures. Thus, we introduce three structure templates to regulate the lyric generations. Taking Structure 3 as an example, we may generate four-verse lyrics with four sentences in each verse. It is common for a line in a verse to contain about 8 to 15 characters. To standardize the structure, it is crucial to control the number of characters per line. Therefore, in the process of creating lyrics, we will make a judgment on the number of characters in each line. If the number of characters has not reached the limit, no space will be generated. If the number of words exceeds the maximum, start a new line.
In addition, as mentioned in the Section 2.3, the ending character in each line should have proper rhyme. Therefore, during the generation process, we first determine whether the character to be generated is the ending character of the line. If it is, then we need to select the m characters with the highest probability from all the results, and these m characters rhyme properly. We then use the same method in Section 3.1 to choose the most suitable character for YN. If it were not the ending character, then we will choose m highest probable characters directly from all probability as the candidates.
Directly choosing the most suitable character may incur a severe problem, that is, the chosen character may not have a reasonable meaning with adjacent characters. Thus, the quality of lyric will decrease sharply. To overcome this problem, we improve the Char-RNN model to design a Word-RNN model, which have the same structure as Char-RNN. The only difference is that the smallest unit in the training and generation stage is a word instead of a character. Figure 6 shows the principle of Word-RNN.
We present an example to show how to hide the secret information in the process of lyric generations. First, we set the parameters as follows:
● Initial Line:我们手牵手(Your hands in my hands).
● Size: 4 (the size of candidate pool).
● Structure: Classical-16 (that is, four verses with four lines in each verse).
● Information: 100111111100001101.... (converted from '信息隐藏').
At the beginning, we choose a model from Char-RNN and Word-RNN (here we use Char-RNN as example). Then, the initial line will be fed to preheat the model and converted into xi.
For the first y, we select the most probable top-4 characters as candidates. We then encode the characters using Huffman code (shown in Table 2, Col. 1). When the beginning of the information is 10, then '你' is chosen as the first character.
Bits | Char1 | Char2 | Char3 | Char4 | Char5 | Char6 | Char7 | Char8 | Char9 |
00 | 一 | 说 | 心 | space | 再 | 手 | 不 | 放 | space |
01 | 我 | 的 | 爱 | 心 | 会 | space | 我 | 再 | 留(歇) |
10 | 你 | 们 | 眼 | 我 | 在 | 开 | 的 | 要 | 地 |
11 | 这 | 要 | 手 | 不 | 放 | 不 | 让 | 停 | 的 |
To make the ending characters of lines rhyme, we note that the bits of '01' represent character '歇' (shown in Table 2). However, this character does not sound well with the You-Qiu rhyme of the existing lines. Thus, we replace it with another character that rhyme better. Also, it should be noted that the space character in Table 2 is used as the separator between two lines, which can also be used to hide information.
After a lyric embedded with secret information is generated, the sender may send the lyric to the receiver. Meanwhile, the file about candidate pool should be sent together. When the receivers obtain the lyric, they can extract the binary stream converted from secret information according to the candidate pool. In other words, it is impossible to extract secret information without the file of candidate pool. Thus, the file of candidate pool plays an important role in the process of information extraction, because only the legitimate recipients can get the file and extract the secret information.
In this section, we first illustrate the construction of dataset and how to set the value for each initial parameter. Then, we present two results, which are generated by Char-RNN and Word-RNN respectively. Finally, the performance evaluations are given.
We need a large number of high-quality lyrics to train a satisfactory model. Unfortunately, no Chinese pop lyrics data has been published by any authoritative organization. To obtain training data, we use the Scrapy crawler framework to collect a total of 15,000 Chinese pop lyrics from music websites, including 100 Chinese male singers, 100 Chinese female singers, 100 Chinese bands, and 50 popular songs of each singer. Removing all-English songs and duplicates, we finally obtained a dataset of about 13,500 Chinese pop lyrics.
In the training process, we count all the Chinese characters in the lyric data, and construct a dictionary, to be shared by both inputs and outputs. At the same time, we count the number of Chinese characters as the length of One-Hot Encoding. Finally, we train our model using tensorflow.
For the Word-RNN model, we use the same methods, parameters, and optimization algorithm as the Char-RNN model. The only difference is that we first carry out word segmentation of the lyric data, expressing each song in terms of phrases. Namely, in the One-Hot Encoding, each position now represents a word, instead of a character.
Figure 7 depicts two Chinese pop lyrics generated by the proposed method with steganography, where (a) is a lyric generated by Char-RNN and the (b) is a lyric generated by Word-RNN.
According to their literal meanings, we can consider that Lyric (a) praises the beauty of love, and Lyric (b) describes sorrow of love. Through the analysis of lyrics, we can find that the lyrics generated by Char-RNN model contain repetitive characters (in red) and broken lines, while the lyrics generated by the Word-RNN model do not have these problems.
We evaluate the proposed steganography method from two important aspects: embedding capacity and security.
Embedding capacity is a significant measure to evaluate a steganogaphy methods, which represents how much information can hide in a stego-text. Previous steganography methods based on text generations either have low embedding capacities or do not look natural. For example, the poetry-based methods not only generate a poor naturalness genre, but also have lower embedding capacity than the proposed method. The high embedding capacity of the proposed method stems from longer length of lyrics, and we can hide information at each char-position or word-position. Similarly, we can conclude that char-based methods have higher embedding capacities than word-based methods when the generated lyrics length are the same. The embedding capacity calculation formula of two methods are as follows:
EC1=(num∑i=1Ci+num−1)∗log2Size | (4.1) |
EC2=(num∑i=1Wi+num−1)∗log2Size | (4.2) |
Where EC1 represents the embedding capacity of a lyric generated by Char-RNN, num is the number of lines, Ci is the number of characters in each line, and Size is the number of candidates. Likewise, EC2 represents the embedding capacity of a lyric generated by Word-RNN method, where Wi is the number of words in each line.
Figure 8 depicts the comparison results of embedding capacities among different methods, where the value of the embedding capacity is the number of characters embedded in the text carriers. It is easy to see that the proposed methods in this paper have higher embedding capacities than Poem-based steganography method and Ci-based steganography method, and with increase of Size, the capacity will be much higher than these two methods.
Security refers to the invisibility and imperceptibility of secret information, and it is one of the important measurements to evaluate a steganography method.
In modern society, people usually communicate with vernacular. Although poetry is an important achievement in the development of ancient Chinese literature, it is not practical in daily communication in modern society. Therefore, steganography based on poetry generation maybe easily arouses suspicion in the process of text carrier dissemination. Modern popular lyrics have higher naturalness, which means that the lyric text embedded with secret information will not arouses suspicion in the transmission process, thus the security is higher than steganography method based on poetry.
As shown in the Table 3, the results are generated by previous methods, which are embedded with secret information. Obviously, compared with the two results, the lyrics generated by the proposed method are easier to understand and has higher naturalness. Moreover, the proposed method is based on lyrics generation, which does not modify the text carrier like traditional text steganography methods, so it can effectively resist the detection of traditional steganalysis algorithms. Besides, our method is not based on text format, so it could resist the format-based attacks and steganalysis.
Tang Poetry | Song Ci |
风窗烟树中, | 不知多少, 洞天谁道在, 一笑樽前. |
柔静雨光斑. | 底事今年春事早, 回首当日三贤. |
夜里吹生下, | 几度春风, 西风明月, 千里倍潸然. |
归人乱浪宽. | 断肠风月, 少年无限当年. |
We presented a novel method that uses recurrent neural networks to generate the Chinese pop lyrics, and in the process of generation, we successfully embedded the secret information into the lyrics. We first used Char-RNN to predict the probabilities of the possible next characters based on the observed data. We then selected the most suitable character according to the secret information and added the character to the observed sequence, in order to continue to predict and generate. Directly generating lyrics based on secret information, it is likely that the generated characters can not be combined into words. We improved the Char-RNN model and developed the Word-RNN model, using words as units to train the model. Through experimental comparisons, we found that the proposed method offers higher hiding capacity and can generate more natural text, compared with the previous methods. In the future, we will improve our method to generate lyrics of better quality and clearer theme, with higher embedding capacity and better security and robustness.
This work was partially supported by National Natural Science Foundation of China (No. 61872134, 61502242), Natural Science Foundation of Hunan Province (No. 2018JJ2062, 2018JJ2301), and National Key Research and Development Program (2017YFC1703306), and Hunan Provincial 2011 Collaborative Innovation Center for Development and Utilization of Finance and Economics Big Data Property (2017TP1025).
The authors declare no conflict of interest.
[1] | http://www.who.int/mediacentre/factsheets/fs387/en/ |
[2] |
N. Surapol, T. Korkiatsakul, I. M. Tang, Dynamical model for determining human susceptibility to dengue fever, Am. J. Appl. Sci., 8 (2011), 1101. doi: 10.3844/ajassp.2011.1101.1106
![]() |
[3] | M. Rafiq, M. O. Ahmad, Numerical modeling of dengue disease with incubation period of virus, Pak. J. Eng. Appl. Sci., (2016). |
[4] |
R. Rebeca, L. M. Harrison, R. A. Salas, D. Tovar, A. Nisalak, C. Ramos, et al., Origins of dengue type 2 viruses associated with increased pathogenicity in the Americas, Virology, 230 (1997), 244-251. doi: 10.1006/viro.1997.8504
![]() |
[5] | R. Ronald, The prevention of malaria, (2012). |
[6] |
W. Hui-Ming, X. Z. Li, M. Martcheva, An epidemic model of a vector-borne disease with direct transmission and time delay, J. Math. Anal. Appl., 342 (2008), 895-908. doi: 10.1016/j.jmaa.2007.12.058
![]() |
[7] | F. Zhilan, J. X. Velasco-Hernndez, Competitive exclusion in a vector-host model for the dengue fever, J. Math. Biol., 35 (1997), 523-544. |
[8] |
Q. Zhipeng, Dynamical behavior of a vector-host epidemic model with demographic structure, Comput. Math. Appl., 56 (2008), 3118-3129. doi: 10.1016/j.camwa.2008.09.002
![]() |
[9] | W. Viroj, Unusual mode of transmission of dengue, J. Inf. Devel. Coun., 4 (2009), 51-54. |
[10] | G. S. Mohammed, A. B. Gumel, M. R. Abu Bakar, Backward bifurcations in dengue transmission dynamics, Math. Biosci., 215 (2008), 11-25. |
[11] | C. Liming, X. Li, Analysis of a simple vector-host epidemic model with direct transmission, Disc. Dyna. Nat. Soc., 2010 (2010). |
[12] |
M. Derouich, A. Boutayeb, Mathematical modelling and computer simulations of Dengue fever, App. Math. Comput., 177 (2006), 528-544. doi: 10.1016/j.amc.2005.11.031
![]() |
[13] |
F. B. Agusto, M. A. Khan, Optimal control strategies for dengue transmission in Pakistan, Math. Biosci., 305 (2018), 102-121. doi: 10.1016/j.mbs.2018.09.007
![]() |
[14] | E. Lourdes, C. Vargas, A model for dengue disease with variable human population, J. Math. Bio., 38 (1999), 220-240. |
[15] | A. A. Lashari, S. Aly, K. Hattaf, G. Zaman, I. H. Jung, X. Z. Li, Presentation of malaria epidemics using multiple optimal controls, J. Appl. Math., 2012 (2012). |
[16] | A. A. Lashari, K. Hattaf, G. Zaman, A delay differential equation model of a vector borne disease with direct transmission, Int. J. Ecol. Econ. Stat., (27), (2012), 25-35. |
[17] | A. A. Lashari, K. Hattaf, G. Zaman G, X. Z. Li, Backward bifurcation and optimal control of a vector borne disease, Appl. Math. Infor. Sci., 7 (2013), 301-309. |
[18] |
L. Zhou, M. Fan, Dynamics of an SIR epidemic model with limited resources visited, Nonl. Anal. Real. World. Appl., 13 (2012), 312-324. doi: 10.1016/j.nonrwa.2011.07.036
![]() |
[19] | C. H. Li, A. M. Yousef, Bifurcation analysis of a network-based SIR epidemic model with saturated treatment function, Chaos An Interdiscipl. J Nonl. Sci., 29(2019), 10.1063/1.5079631. |
[20] | K. Hattaf, Y. Yang, Global dynamics of an age-structured viral infection model with general incidence function and absorptionm, Int. J. Biomath., 11, (2018), https://doi.org/10.1142/S1793524518500651. |
[21] |
P. Jia, C. Wang, G. Zhang, J. Ma, A rumor spreading model based on two propagation channels in social networks, Phys. A Statist. Mechan. Appl., 524 (2019), 342-353. doi: 10.1016/j.physa.2019.04.163
![]() |
[22] | J. Yang, X. Wang, Threshold dynamics of an SIR model with nonlinear incidence rate and agedependent susceptibility, Complexity, 2018 (2018). |
[23] | G. Birkhoff, G. C. Rota, Ordinary Differential Eqnarrays [M1]. Boston: Ginn (1982). |
[24] |
V. D. D. Pauline, J. Watmough, Reproduction numbers and sub-threshold endemic equilibria for compartmental models of disease transmission, Math. Biosci, 180 (2002), 29-48. doi: 10.1016/S0025-5564(02)00108-6
![]() |
[25] |
C. Castillo-Chavez, B. Song, Dynamical models of tuberculosis and their applications, Math. Biosci. Eng., 1 (2004), 361-404. doi: 10.3934/mbe.2004.1.361
![]() |
[26] | L. Salle, P. Joseph, The stability of dynamical systems, Soc. Indus. Appl. Math., 1976. |
[27] |
Y. Li. Michael, J. S. Muldowney, A geometric approach to global-stability problems, Siam. J. Math. Anal., 27 (1996), 1070-1083. doi: 10.1137/S0036141094266449
![]() |
[28] |
R. H. Martin, Logarithmic norms and projections applied to linear differential systems, J. Math. Anal. Appl., 45 (1974), 432-454. doi: 10.1016/0022-247X(74)90084-5
![]() |
[29] | K. O. Okosun, R. Smith, Optimal control analysis of malaria-schistosomiasis co-infection dynamics, Math. Biosci. Eng., 14 (2017), 377-405. |
[30] |
K. O. Okosun, O. D. Makinde, A co-infection model of malaria and cholera diseases with optimal control, Math. Biosci., 258 (2014), 19-32. doi: 10.1016/j.mbs.2014.09.008
![]() |
[31] |
S. F. Saddiq, M. A. Khan, S. Islam, G. Zaman, I. I. H. Jung, et al. Optimal control of an epidemic model of leptospirosis with nonlinear saturated incidences, Ann. Res. Rev. Bio., 4 (2014), 560. doi: 10.9734/ARRB/2014/6378
![]() |
[32] |
M. A. Khan, R. Khan, Y. Khan, S. Islam, A mathematical analysis of Pine Wilt disease with variable population size and optimal control strategies, Chaos Solit. Fract., 108 (2018), 205-217. doi: 10.1016/j.chaos.2018.02.002
![]() |
[33] | M. A. Khan, K. Ali, E. Bonyah, K. O. Okosun, S. Islam & A. Khan, Mathematical modeling and stability analysis of Pine Wilt Disease with optimal control, Sci. Rep., 7 (2017), 3115. |
[34] | F. H. Wendell, R. W. Rishel, Deterministic and stochastic optimal control, 1, Springer Science & Business Media, 2012. |
[35] | F. K. Renee, S. Lenhart, J. S. McNally, Optimizing chemotherapy in an HIV model, Elec. J. Diff. Eqn., 32, (1998), 1-12. |
[36] | L. S. Pontryagin, F. Moscow, Y. E. F. Mishchenko, et al, The mathematical theory of optimal processes, (1962). |
1. | Dengyong Zhang, Haixin Tong, Feng Li, Lingyun Xiang, Xiangling Ding, An Ultra-Short-Term Electrical Load Forecasting Method Based on Temperature-Factor-Weight and LSTM Model, 2020, 13, 1996-1073, 4875, 10.3390/en13184875 | |
2. | Lingyun Xiang, Shuanghui Yang, Yuhang Liu, Qian Li, Chengzhang Zhu, Novel Linguistic Steganography Based on Character-Level Text Generation, 2020, 8, 2227-7390, 1558, 10.3390/math8091558 | |
3. | Nan Pan, Jiaohua Qin, Yun Tan, Xuyu Xiang, Guimin Hou, A video coverless information hiding algorithm based on semantic segmentation, 2020, 2020, 1687-5281, 10.1186/s13640-020-00512-8 | |
4. | Yun Tan, Jiaohua Qin, Xuyu Xiang, Chunhu Zhang, Zhangdong Wang, Beijing Chen, Coverless Steganography Based on Motion Analysis of Video, 2021, 2021, 1939-0122, 1, 10.1155/2021/5554058 | |
5. | Peng Liu, Songbin Li, Qiandong Yan, Jingang Wang, Cheng Zhang, General Steganalysis Method of Compressed Speech Under Different Standards, 2021, 68, 1546-2226, 1565, 10.32604/cmc.2021.016635 | |
6. | Merve Varol Arısoy, LZW-CIE: a high-capacity linguistic steganography based on LZW char index encoding, 2022, 34, 0941-0643, 19117, 10.1007/s00521-022-07499-5 | |
7. | Youssef Mourdi, Mohammed Sadgal, Hasna Elalaoui Elabdallaoui, Hamada El Kabtane, Hanane Allioui, A recurrent neural networks based framework for at‐risk learners' early prediction and MOOC tutor's decision support, 2023, 31, 1061-3773, 270, 10.1002/cae.22582 | |
8. | Cuilin Wang, Yuling Liu, Yongju Tong, Jingwen Wang, GAN-GLS: Generative Lyric Steganography Based on Generative Adversarial Networks, 2021, 69, 1546-2226, 1375, 10.32604/cmc.2021.017950 | |
9. | Qiong Jia, Ying Zhu, Rui Xu, Yubin Zhang, Yihua Zhao, Making the hospital smart: using a deep long short-term memory model to predict hospital performance metrics, 2022, 122, 0263-5577, 2151, 10.1108/IMDS-12-2021-0769 | |
10. | Rui Yu, Wenpeng Lu, Huimin Lu, Shoujin Wang, Fangfang Li, Xu Zhang, Jiguo Yu, Sentence pair modeling based on semantic feature map for human interaction with IoT devices, 2021, 12, 1868-8071, 3081, 10.1007/s13042-021-01349-x | |
11. | Noura A. Mawla, Hussein K. Khafaji, Roberto Natella, Protein Motifs to Hide GA-Based Encrypted Data, 2022, 2022, 1875-919X, 1, 10.1155/2022/1846788 | |
12. | Emır Öztürk, Andaç Şahın Mesut, Özlem Aydin Fıdan, A Character Based Steganography Using Masked Language Modeling, 2024, 12, 2169-3536, 14248, 10.1109/ACCESS.2024.3354710 | |
13. | Aarthi Dhandapani, N. Ilakiyaselvan, Satyaki Mandal, Sandipta Bhadra, V. Viswanathan, 2023, Chapter 24, 978-981-99-1050-2, 371, 10.1007/978-981-99-1051-9_24 | |
14. | M. V. Namitha, G. R. Manjula, Manjula C. Belavagi, StegAbb: A Cover-Generating Text Steganographic Tool Using GPT-3 Language Modeling for Covert Communication Across SDRs, 2024, 12, 2169-3536, 82057, 10.1109/ACCESS.2024.3411288 | |
15. | Lingling Tan, Junkai Yi, Expert System for Extracting Hidden Information from Electronic Documents during Outgoing Control, 2024, 13, 2079-9292, 2924, 10.3390/electronics13152924 |
Rhymes | Vowels | Characters | Music |
Fa-Hua | a, ia, ua | 巴、麻、花、沙 | 《绒花》 |
Suo-Bo | o, e, uo | 波、多、朵、烁 | 《我爱你中国》 |
Ye-Xie | ie, ue, üe | 街、谐、月、夜 | 《娄山关》 |
Gu-Su | u | 出、珠、福、图 | 《闪光的珍珠》 |
Yi-Qi | i, ü, er | 溪、雨、曲、句 | 《同桌的你》 |
Huai-Lai | ai, uai | 白、海、爱、来 | 《四季歌》 |
Hui-Dui | ei, ui, uei | 飞、灰、梅、泪 | 《大森林的早晨》 |
Yao-Tiao | ao, iao | 高、烧、苗、笑 | 《绣荷包》 |
You-Qiu | ou, iu, iou | 沟、球、舟、柳 | 《蝶恋花》 |
Yan-Qian | an, ian, uan, üan | 帆、天、旋、唤 | 《黄河颂》 |
Ren-Chen | en, in, un, ün | 春、纷、新、云 | 《兰花花》 |
Jiang-Yang | ang, iang, uang | 芳、霜、香、长 | 《松花江上》 |
Zhong-Dong | eng, ing, ueng, ong | 风、星 | 《故乡是北京》 |
Bits | Char1 | Char2 | Char3 | Char4 | Char5 | Char6 | Char7 | Char8 | Char9 |
00 | 一 | 说 | 心 | space | 再 | 手 | 不 | 放 | space |
01 | 我 | 的 | 爱 | 心 | 会 | space | 我 | 再 | 留(歇) |
10 | 你 | 们 | 眼 | 我 | 在 | 开 | 的 | 要 | 地 |
11 | 这 | 要 | 手 | 不 | 放 | 不 | 让 | 停 | 的 |
Tang Poetry | Song Ci |
风窗烟树中, | 不知多少, 洞天谁道在, 一笑樽前. |
柔静雨光斑. | 底事今年春事早, 回首当日三贤. |
夜里吹生下, | 几度春风, 西风明月, 千里倍潸然. |
归人乱浪宽. | 断肠风月, 少年无限当年. |
Rhymes | Vowels | Characters | Music |
Fa-Hua | a, ia, ua | 巴、麻、花、沙 | 《绒花》 |
Suo-Bo | o, e, uo | 波、多、朵、烁 | 《我爱你中国》 |
Ye-Xie | ie, ue, üe | 街、谐、月、夜 | 《娄山关》 |
Gu-Su | u | 出、珠、福、图 | 《闪光的珍珠》 |
Yi-Qi | i, ü, er | 溪、雨、曲、句 | 《同桌的你》 |
Huai-Lai | ai, uai | 白、海、爱、来 | 《四季歌》 |
Hui-Dui | ei, ui, uei | 飞、灰、梅、泪 | 《大森林的早晨》 |
Yao-Tiao | ao, iao | 高、烧、苗、笑 | 《绣荷包》 |
You-Qiu | ou, iu, iou | 沟、球、舟、柳 | 《蝶恋花》 |
Yan-Qian | an, ian, uan, üan | 帆、天、旋、唤 | 《黄河颂》 |
Ren-Chen | en, in, un, ün | 春、纷、新、云 | 《兰花花》 |
Jiang-Yang | ang, iang, uang | 芳、霜、香、长 | 《松花江上》 |
Zhong-Dong | eng, ing, ueng, ong | 风、星 | 《故乡是北京》 |
Bits | Char1 | Char2 | Char3 | Char4 | Char5 | Char6 | Char7 | Char8 | Char9 |
00 | 一 | 说 | 心 | space | 再 | 手 | 不 | 放 | space |
01 | 我 | 的 | 爱 | 心 | 会 | space | 我 | 再 | 留(歇) |
10 | 你 | 们 | 眼 | 我 | 在 | 开 | 的 | 要 | 地 |
11 | 这 | 要 | 手 | 不 | 放 | 不 | 让 | 停 | 的 |
Tang Poetry | Song Ci |
风窗烟树中, | 不知多少, 洞天谁道在, 一笑樽前. |
柔静雨光斑. | 底事今年春事早, 回首当日三贤. |
夜里吹生下, | 几度春风, 西风明月, 千里倍潸然. |
归人乱浪宽. | 断肠风月, 少年无限当年. |