期刊：
Journal of Mathematical Analysis and Applications,2020年488(2):124083 ISSN：0022-247X
通讯作者：
Kovalev, Leonid, V
作者机构：
[Li, Liulan] Hengyang Normal Univ, Coll Math & Stat, Hengyang 421002, Hunan, Peoples R China.;[Kovalev, Leonid, V] Syracuse Univ, Dept Math, 215 Carnegie, Syracuse, NY 13244 USA.
通讯机构：
[Kovalev, Leonid, V] S;Syracuse Univ, Dept Math, 215 Carnegie, Syracuse, NY 13244 USA.
关键词：
Circle embeddings;Circle homeomorphisms;Blaschke products;Rational functions
摘要：
This paper continues the investigation of the relation between the geometry of a circle embedding and the values of its Fourier coefficients. First, we answer a question of Kovalev and Yang concerning the support of the Fourier transform of a starlike embedding. An important special case of circle embeddings are homeomorphisms of the circle onto itself. Under a one-sided bound on the Fourier support, such homeomorphisms are rational functions related to Blaschke products. We study the structure of rational circle homeomorphisms and show that they form a connected set in the uniform topology. (C) 2020 Elsevier Inc. All rights reserved.
期刊：
International Journal of Performability Engineering,2019年15(5):1436-1444 ISSN：0973-1318
通讯作者：
Jiao, G.
作者机构：
College of Computer Science and Technology, Hengyang Normal University, Hengyang, 421002, China;Hunan Provincial Key Laboratory of Intelligent Information Processing and Application, Hengyang, 421002, China;School of Environment Protection and Safety Engineering, University of South China, Hengyang, 421002, China
通讯机构：
College of Computer Science and Technology, Hengyang Normal University, Hengyang, China
期刊：
JOURNAL OF EXPERIMENTAL BOTANY,2019年70(15):3969-3979 ISSN：0022-0957
通讯作者：
Tang, Kexuan;Chen, Wansheng;Zhang, Lei
作者机构：
[Ma, Yanan; Li, Ling; Fu, Xueqing; Shen, Qian; Zhang, Fangyuan; Hao, Xiaolong; Zhang, Lida; Lv, Zongyou; Shi, Pu; Chen, Minghui; Tang, Kexuan; Yan, Tingxiang] Shanghai Jiao Tong Univ, Joint Int Res Lab Metab & Dev Sci, Key Lab Urban Agr South, Minist Agr,Plant Biotechnol Res Ctr,Fudan SJTU No, Shanghai 200240, Peoples R China.;[Chen, Wansheng; Lv, Zongyou] Second Mil Med Univ, Changzheng Hosp, Dept Pharm, Shanghai 200003, Peoples R China.;[Chen, Wansheng; Lv, Zongyou] Shanghai Univ Tradit Chinese Med, Res & Dev Ctr Chinese Med Resources & Biotechnol, Shanghai 201203, Peoples R China.;[Zhang, Lei; Guo, Zhiying] Second Mil Med Univ, Sch Pharm, Dept Pharmaceut Bot, Shanghai 200433, Peoples R China.;[Jiang, Weimin] Hengyang Normal Univ, Coll Life Sci & Environm, Hengyang 421008, Hunan, Peoples R China.
通讯机构：
[Tang, Kexuan; Chen, Wansheng; Zhang, Lei] S;[Zhang, Lei] Z;Shanghai Jiao Tong Univ, Joint Int Res Lab Metab & Dev Sci, Key Lab Urban Agr South, Minist Agr,Plant Biotechnol Res Ctr,Fudan SJTU No, Shanghai 200240, Peoples R China.;Second Mil Med Univ, Changzheng Hosp, Dept Pharm, Shanghai 200003, Peoples R China.;Shanghai Univ Tradit Chinese Med, Res & Dev Ctr Chinese Med Resources & Biotechnol, Shanghai 201203, Peoples R China.
摘要：
Artemisinin is a sesquiterpene lactone produced by the Chinese traditional herb Artemisia annua and is used for the treatment of malaria. It is known that salicylic acid (SA) can enhance artemisinin content but the mechanism by which it does so is not known. In this study, we systematically investigated a basic leucine zipper family transcription factor, AaTGA6, involved in SA signaling to regulate artemisinin biosynthesis. We found specific in vivo and in vitro binding of the AaTGA6 protein to a 'TGACG' element in the AaERF1 promoter. Moreover, we demonstrated that AaNPR1 can interact with AaTGA6 and enhance its DNA-binding activity to its cognate promoter element 'TGACG' in the promoter of AaERF1, thus enhancing artemisinin biosynthesis. The artemisinin contents in AaTGA6-overexpressing and RNAi transgenic plants were increased by 90-120% and decreased by 20-60%, respectively, indicating that AaTGA6 plays a positive role in artemisinin biosynthesis. Importantly, heterodimerization with AaTGA3 significantly inhibits the DNA-binding activity of AaTGA6 and plays a negative role in target gene activation. In conclusion, we demonstrate that binding of AaTGA6 to the promoter of the artemisinin-regulatory gene AaERF1 is enhanced by AaNPR1 and inhibited by AaTGA3. Based on these findings, AaTGA6 has potential value in the genetic engineering of artemisinin production.
期刊：
International Journal of Performability Engineering,2019年15(6):1692-1701 ISSN：0973-1318
通讯作者：
Jiao, G.
作者机构：
College of Computer Science and Technology, Hengyang Normal University, Hengyang, 421002, China;Hunan Provincial Key Laboratory of Intelligent Information Processing and Application, Hengyang, 421002, China
通讯机构：
College of Computer Science and Technology, Hengyang Normal University, Hengyang, China
摘要：
In order to broaden the study of the most popular and general Takagi-Sugeno (TS) system, we propose a complex-valued neuro-fuzzy inference system which realises the zero-order TS system in the complex-valued network architecture and develop it. In the complex domain, boundedness and analyticity cannot be achieved together. The splitting strategy is given by computing the gradients of the real-valued error function with respect to the real and the imaginary parts of the weight parameters independently. Specifically, this system has four layers: in the Gaussian layer, the L-dimensional complex-valued input features are mapped to a Q-dimensional real-valued space, and in the output layer, complex-valued weights are employed to project it back to the complex domain. Hence, split-complex valued gradients of the real-valued error function are obtained, forming the split-complex valued neuro-fuzzy (split-CVNF) learning algorithm based on gradient descent. Another contribution of this paper is that the deterministic convergence of the split-CVNF algorithm is analysed. It is proved that the error function is monotone during the training iteration process, and the sum of gradient norms tends to zero. By adding a moderate condition, the weight sequence itself is also proved to be convergent.
摘要：
While the existence of conformal mappings between doubly connected domains is characterized by their conformal moduli, no such characterization is available for harmonic dilfeomorphisms. Intuitively, one expects their existence if the domain is not too thick compared to the codomain. We make this intuition precise by showing that for a Dini-smooth doubly connected domain Omega* there exists a epsilon> 0 such that for every doubly connected domain Omega with Mod Omega* < Mod Omega < Mod Omega* + epsilon there exists a harmonic dilfeomorphism from Omega onto Omega*.
作者机构：
[Tan, Xiao; Li, Lin; Li, Xiao Song; Liu, Wei; Du, Jian Ping; Zheng, Jun; Yao, Ru Cheng] Institute of Hepatopancreatobilary Surgery, China Three Gorges University, Yichang 443003, P.R. China;[Tan, Xiao; Li, Lin; Liu, Wei; Du, Jian Ping; Zhang, Ding; Zheng, Jun] The First College of Clinical Medical Science, China Three Gorges University, Yichang, 443003, P.R. China;[Tan, Xiao; Du, Jian Ping; Liu, Sen; Zheng, Wei Hong] Hubei Key Laboratory of Tumor Microenvironment and Immunotherapy, Medical School of China Three Gorges University, Yichang 443002, P.R. China;[Du, Jian Ping] Department of Vascular surgery, Xianning Central Hospital, The First Affiliated Hospital of Hubei University of Science and Technology, Xianning, 437100, P.R. China;[Wang, Fangyu] College of Life Science and Environment, Hengyang Normal University, Hengyang, 421008, P.R. China
通讯机构：
Institute of Hepatopancreatobilary Surgery, China Three Gorges University, Yichang, China
摘要：
This paper investigates the split complex gradient descent based neuro-fuzzy algorithm with self-adaptive momentum and L-2 regularizer for training TSK (Takagi-Sugeno-Kang) fuzzy inference models. The major threat for disposing complex data with fuzzy system is contradiction of boundedness and analyticity in the complex domain, as expressed by Liouville's theorem. The proposed algorithm operates a couple of real-valued functions and splits the complex variables into real part and imaginary part. Dynamical momentum is included in the learning mechanism to promote learning speed. L-2 regularizer is also added to control the magnitude of the weight parameters. Furthermore, a detailed convergence analysis of the proposed algorithm is fully studied. The monotonic decreasing property of the error function and convergence of the weight sequence are guaranteed. Plus a mild condition, strong convergence of the weight sequence is deduced. Finally, the simulation results are also demonstrated to verify the theoretical analysis results. (C) 2018 Elsevier B.V. All rights reserved.
期刊：
Journal of Ambient Intelligence and Humanized Computing,2018年:1-7 ISSN：1868-5137
通讯作者：
Hong-wei Deng
作者机构：
[Hong-wei Deng] College of Information Engineering, Hengyang Normal University, Hengyang, China;[Lang Li; Xiao-Man Liang] College of Computer Science and Technology, Hengyang Normal University, Hengyang, China
通讯机构：
[Hong-wei Deng] C;College of Information Engineering, Hengyang Normal University, Hengyang, China
关键词：
Hybrid query tree algorithm;Highest bit of collision;Lowest bit of collision;Anti-collision algorithm
摘要：
During past few years, some lightweight block ciphers have been proposed. These lightweight block ciphers take single encryption method that either uses Substitution-Permutation (SP) network structure or Feistel network structure to encrypt. In this paper, we have designed a different encryption method that takes both SP network structure and Feistel network structure to encrypt. Current SP network has a limitation that the encryption and decryption processes are dissimilar. To solve this problem, we have employed involution related properties of the nonlinear and linear components to modify SP network structure. The modified one enables the encryption and decryption program or circuit to work as the Feistel network structure. Additionally, we have implemented a MixRows in SP network structure. Then we instantiate these three novel ideas into the lightweight block cipher called SFN. We have carried out the security evaluation and the hardware and software experiments to it. The result shows that compared to other lightweight block ciphers, SFN has more advantages in terms of being immune to attacks. Also, SFN is not only compact in hardware environment but also efficient in software platforms.
期刊：
Proceedings of Science,2017年2017-December:43-52 ISSN：1824-8039
作者机构：
[Hongwei Deng; Lang Li; Hui Wang] School of Computer Science and Technology,Hengyang Normal University;[Hongwei Deng; Lang Li; Hui Wang] School of Information Science and Engineering,Central South University;[Hongwei Deng; Lang Li; Hui Wang] Hunan Provincial Key Laboratory of Intelligent Information Processing and Application;[Hongwei Deng; Lang Li; Hui Wang] School of Computer Science and Technology Hengyang Normal University
会议名称：
ISCC 2017-the 5th International Conference on Information Science and Cloud Computing
期刊：
Proceedings of Science,2017年2017-July:9-15 ISSN：1824-8039
作者机构：
[Ge Jiao; Lang Li; Yi Zou] College of Computer Science and Technology,Hengyang Normal University,Hunan Provincial Engineering Laboratory for Technology of Traditional Settlements Digitalization,Hunan Provincial Key Laboratory of Intelligent Information Processing and Application
会议名称：
CENet 2017-the 7th International Conference on Computer Engineering and Networks
作者机构：
[Chen, Yuan; Li, Long] Hengyang Normal Univ, Coll Math & Stat, Hengyang 421008, Peoples R China.;[Qiao, Zhijun] Univ Texas Rio Grande Valley, Sch Math & Stat Sci, Edinburg, TX 78539 USA.;[Liu, Yan] Dalian Polytech Univ, Dept Appl Math, Dalian 116034, Peoples R China.
通讯机构：
[Li, Long] H;Hengyang Normal Univ, Coll Math & Stat, Hengyang 421008, Peoples R China.
摘要：
In this paper, a smooth function is constructed to approximate the nonsmooth output of max-min fuzzy neural networks (FNNs) and its approximation is also presented. In place of the output of max-min FNNs by its smoothing approximation function, the error function, defining the discrepancy between the actual outputs and desired outputs of max-min FNNs, becomes a continuously differentiable function. Then, a smoothing gradient decent-based algorithm with Armijo-Goldstein step size rule is formulated to train max-min FNNs. Based on the existing convergent result, the convergence of our proposed algorithm can easily be obtained. Furthermore, the proposed algorithm also provides a feasible procedure to solve fuzzy relational equations with max-min composition. Finally, some numerical examples are implemented to support our results and demonstrate that the proposed smoothing algorithm has better learning performance than other two gradient decent-based algorithms. (C) 2017 Elsevier B.V. All rights reserved.
期刊：
Proceedings of Science,2017年2017-December:64-70 ISSN：1824-8039
作者机构：
[Yi Zou; Lang Li] College of Computer Science and Technology, Hengyang Normal University Hunan Provincial Key Laboratory of Intelligent Information Processing and Application
会议名称：
ISCC 2017-the 5th International Conference on Information Science and Cloud Computing
作者机构：
[Li, L.] Hengyang Normal Univ, Coll Math & Stat, Hengyang 421002, Hunan, Peoples R China.;[Ponnusamy, S.] Indian Stat Inst, Chennai Ctr, Soc Elect Transact & Secur, MGR Knowledge City, CIT Campus, Madras 600113, Tamil Nadu, India.;[Qiao, J.] Hebei Univ, Dept Math, Baoding 071002, Hebei, Peoples R China.
关键词：
univalent;starlike;convex and close-to-convex function;extreme point;closed convex hull and subordination;Zalcman conjecture
摘要：
Let
$${\mathcal S}$$
denote the class of all functions of the form
$${f(z)=z+a_2z^2+a_3z^3+\cdots}$$
which are analytic and univalent in the open unit disk
$${{\mathbb{D}} }$$
and, for
$${\lambda > 0}$$
, let
$${\Phi_\lambda (n,f)=\lambda a_n^2-a_{2n-1}}$$
denote the generalized Zalcman coefficient functional. Zalcman conjectured that if
$${f\in \mathcal S}$$
, then
$${|\Phi_1 (n,f)|\leq (n-1)^2}$$
for
$${{n\ge 3}}$$
. The functional of the form
$${\Phi_\lambda (n,f)}$$
is indeed related to Fekete–Szegő functional of the
$${n}$$
-th root transform of the corresponding function in
$${\mathcal S}$$
. This conjecture has been verified for a certain special geometric subclasses of
$${\mathcal S}$$
but it remains open for
$${f\in {\mathcal S}}$$
and for
$${n > 6}$$
. In the present paper, we prove sharp bounds on
$${|\Phi_\lambda (n,f)|}$$
for
$${f\in \mathcal{F}(\alpha )}$$
and for all
$${n\geq 3}$$
, in the case that
$${\lambda}$$
is a positive real parameter, where
$${ \mathcal{F}(\alpha )}$$
denotes the family of all functions
$${f\in {\mathcal S}}$$
satisfying the condition
$${\rm{Re}} \Big( 1+\frac{zf''(z)}{f'(z)}
\Big) > \alpha \quad \mbox{for } z\in {\mathbb{D}} ,$$
where
$${-1/2\leq \alpha < 1}$$
. Thus, the present article proves the generalized Zalcman conjecture for convex functions of order
$${\alpha}$$
,
$${\alpha \in [-1/2,1)}$$
.
摘要：
We propose a new ultra-lightweight block cipher, QTL. The 64 bits block cipher QTL supports 64 and 128 bits keys. To solve the slow diffusion of the traditional Feistel-type structures we have used a new variant of generalized Feistel network structure in design of the QTL. Traditional Feistel-type structures change only half of block messages in an iterative round, but our structure overcomes this disadvantage and changes all block messages. Thus, our structure has the fast diffusion of the Substitution Permutation Networks (SPNs) structures, which improves the security of lightweight block cipher in Feistel-type structures. Moreover, QTL algorithm has the same encryption and decryption processes, so it will occupy less area in resource-constrained applications. Furthermore, to reduce the cost of energy consumption in hardware implementation of the cipher while maintaining security, we decide not to use a key schedule. We show that QTL offers an adequate security level against classic analyses. Our hardware implementation for the 64 and the 128 bits keys modes only require 1025.52 and 1206.52 gate equivalents, respectively. QTL achieves high security and compact implementation in hardware. QTL is one of the most competitive ultra-lightweight block ciphers, which is suitable for extremely constrained devices. (C) 2016 Elsevier B.V. All rights reserved.
