Based on Huang＇s accurate tri-sectional nonlin- ear kinematic equation （1997）, a dimensionless simplified mathematical model for nonlinear flow in one-dimensional semi-infinite long porous media with low permeabili...Based on Huang＇s accurate tri-sectional nonlin- ear kinematic equation （1997）, a dimensionless simplified mathematical model for nonlinear flow in one-dimensional semi-infinite long porous media with low permeability is presented for the case of a constant flow rate on the inner boundary. This model contains double moving boundaries, including an internal moving boundary and an external mov- ing boundary, which are different from the classical Stefan problem in heat conduction： The velocity of the external moving boundary is proportional to the second derivative of the unknown pressure function with respect to the distance parameter on this boundary. Through a similarity transfor- mation, the nonlinear partial differential equation （PDE） sys- tem is transformed into a linear PDE system. Then an ana- lytical solution is obtained for the dimensionless simplified mathematical model. This solution can be used for strictly checking the validity of numerical methods in solving such nonlinear mathematical models for flows in low-permeable porous media for petroleum engineering applications. Finally, through plotted comparison curves from the exact an- alytical solution, the sensitive effects of three characteristic parameters are discussed. It is concluded that with a decrease in the dimensionless critical pressure gradient, the sensi- tive effects of the dimensionless variable on the dimension- less pressure distribution and dimensionless pressure gradi- ent distribution become more serious; with an increase in the dimensionless pseudo threshold pressure gradient, the sensi- tive effects of the dimensionless variable become more serious; the dimensionless threshold pressure gradient （TPG） has a great effect on the external moving boundary but has little effect on the internal moving boundary.展开更多
In this paper, based on the verifiable pair and identity-based threshold cryptography, a novel identity-based （ID-based） threshold decryption scheme （IDTDS） is proposed, which is provably secure against adaptive c...In this paper, based on the verifiable pair and identity-based threshold cryptography, a novel identity-based （ID-based） threshold decryption scheme （IDTDS） is proposed, which is provably secure against adaptive chosen cipbertext attack under the computational bilinear Diffie-Hellman （CBDH） problem assumption in the random oracle. The pubic cheekability of ciphertext in the IDTDS is given by simply creating a signed E1Gamal encryption instead of a noninteractive zero-knowledge proof. Furthermore, we introduce a modified verifiable pairing to ensure all decryption shares are consistent. Our scheme is more efficient in verification than the schemes considered previously.展开更多
In this paper, we consider an extragradient thresholding algorithm for finding the sparse solution of mixed complementarity problems (MCPs). We establish a relaxation l1 regularized projection minimization model for t...In this paper, we consider an extragradient thresholding algorithm for finding the sparse solution of mixed complementarity problems (MCPs). We establish a relaxation l1 regularized projection minimization model for the original problem and design an extragradient thresholding algorithm (ETA) to solve the regularized model. Furthermore, we prove that any cluster point of the sequence generated by ETA is a solution of MCP. Finally, numerical experiments show that the ETA algorithm can effectively solve the l1 regularized projection minimization model and obtain the sparse solution of the mixed complementarity problem.展开更多
Many heuristic search methods exhibit a remarkable variability in the time required to solve some particular problem instances. Their cost distributions are often heavy-tailed. It has been demonstrated that, in most c...Many heuristic search methods exhibit a remarkable variability in the time required to solve some particular problem instances. Their cost distributions are often heavy-tailed. It has been demonstrated that, in most cases, rapid restart (RR) method can prominently suppress the heavy-tailed nature of the instances and improve computation efficiency. However, it is usually time-consuming to check whether an algorithm on a specific instance is heavy-tailed or not. Moreover, if the heavy-tailed distribution is confirmed and the RR method is relevant, an optimal RR threshold should be chosen to facilitate the RR mechanism. In this paper, an approximate approach is proposed to quickly check whether an algorithm on a specific instance is heavy-tailed or not. The method is realized by means of calculating the maximal Lyapunov exponent of its generic running trace. Then a statistical formula to estimate the optimal RR threshold is educed. The method is based on common nonparametric estimation, e.g., Kernel estimation. Two heuristic methods are selected to verify our method. The experimental results are consistent with the theoretical consideration perfectly.展开更多
The Thresholding Bandit(TB)problem is a popular sequential decision-making problem,which aims at identifying the systems whose means are greater than a threshold.Instead of working on the upper bound of a loss functio...The Thresholding Bandit(TB)problem is a popular sequential decision-making problem,which aims at identifying the systems whose means are greater than a threshold.Instead of working on the upper bound of a loss function,our approach stands out from conventional practices by directly minimizing the loss itself.Leveraging the large deviation theory,we firstly provide an asymptotically optimal allocation rule for the TB problem,and then propose a parameter-free Large Deviation(LD)algorithm to make the allocation rule implementable.Central limit theorem-based Large Deviation(CLD)algorithm is further proposed as a supplement to improve the computation efficiency using normal approximation.Extensive experiments are conducted to validate the superiority of our algorithms compared to existing methods,and demonstrate their broader applications to more general distributions and various kinds of loss functions.展开更多
Dear Editor,This letter investigates the optimal transmission scheduling problem in remote state estimation systems over an unknown wireless channel.We propose a partially observable Markov decision Process(POMDP)fram...Dear Editor,This letter investigates the optimal transmission scheduling problem in remote state estimation systems over an unknown wireless channel.We propose a partially observable Markov decision Process(POMDP)framework to model the sensor scheduling problem.By truncating and simplifying the POMDP problem,we have established the properties of the optimal solution under the POMDP model,through a fixed-point contraction method,and have shown that the threshold structure of the POMDP solution is not easily attainable.Subsequently,we obtained a suboptimal solution via Qlearning.Numerical simulations are used to demonstrate the efficacy of the proposed Q-learning approach.展开更多
基金supported by the National Natural Science Foundation of China(11102237)Program for Changjiang Scholars and Innovative Research Team in University(IRT1294)+1 种基金Specialized Research Fund for the Doctoral Program of Higher Education(20110133120012)China Scholarship Council(CSC)
文摘Based on Huang＇s accurate tri-sectional nonlin- ear kinematic equation （1997）, a dimensionless simplified mathematical model for nonlinear flow in one-dimensional semi-infinite long porous media with low permeability is presented for the case of a constant flow rate on the inner boundary. This model contains double moving boundaries, including an internal moving boundary and an external mov- ing boundary, which are different from the classical Stefan problem in heat conduction： The velocity of the external moving boundary is proportional to the second derivative of the unknown pressure function with respect to the distance parameter on this boundary. Through a similarity transfor- mation, the nonlinear partial differential equation （PDE） sys- tem is transformed into a linear PDE system. Then an ana- lytical solution is obtained for the dimensionless simplified mathematical model. This solution can be used for strictly checking the validity of numerical methods in solving such nonlinear mathematical models for flows in low-permeable porous media for petroleum engineering applications. Finally, through plotted comparison curves from the exact an- alytical solution, the sensitive effects of three characteristic parameters are discussed. It is concluded that with a decrease in the dimensionless critical pressure gradient, the sensi- tive effects of the dimensionless variable on the dimension- less pressure distribution and dimensionless pressure gradi- ent distribution become more serious; with an increase in the dimensionless pseudo threshold pressure gradient, the sensi- tive effects of the dimensionless variable become more serious; the dimensionless threshold pressure gradient （TPG） has a great effect on the external moving boundary but has little effect on the internal moving boundary.
基金Supported by the National Natural Science Foundation of China (60970119, 60803149)the National Basic Research Program of China (973 Program) (2007CB311201)
文摘In this paper, based on the verifiable pair and identity-based threshold cryptography, a novel identity-based （ID-based） threshold decryption scheme （IDTDS） is proposed, which is provably secure against adaptive chosen cipbertext attack under the computational bilinear Diffie-Hellman （CBDH） problem assumption in the random oracle. The pubic cheekability of ciphertext in the IDTDS is given by simply creating a signed E1Gamal encryption instead of a noninteractive zero-knowledge proof. Furthermore, we introduce a modified verifiable pairing to ensure all decryption shares are consistent. Our scheme is more efficient in verification than the schemes considered previously.
文摘In this paper, we consider an extragradient thresholding algorithm for finding the sparse solution of mixed complementarity problems (MCPs). We establish a relaxation l1 regularized projection minimization model for the original problem and design an extragradient thresholding algorithm (ETA) to solve the regularized model. Furthermore, we prove that any cluster point of the sequence generated by ETA is a solution of MCP. Finally, numerical experiments show that the ETA algorithm can effectively solve the l1 regularized projection minimization model and obtain the sparse solution of the mixed complementarity problem.
文摘Many heuristic search methods exhibit a remarkable variability in the time required to solve some particular problem instances. Their cost distributions are often heavy-tailed. It has been demonstrated that, in most cases, rapid restart (RR) method can prominently suppress the heavy-tailed nature of the instances and improve computation efficiency. However, it is usually time-consuming to check whether an algorithm on a specific instance is heavy-tailed or not. Moreover, if the heavy-tailed distribution is confirmed and the RR method is relevant, an optimal RR threshold should be chosen to facilitate the RR mechanism. In this paper, an approximate approach is proposed to quickly check whether an algorithm on a specific instance is heavy-tailed or not. The method is realized by means of calculating the maximal Lyapunov exponent of its generic running trace. Then a statistical formula to estimate the optimal RR threshold is educed. The method is based on common nonparametric estimation, e.g., Kernel estimation. Two heuristic methods are selected to verify our method. The experimental results are consistent with the theoretical consideration perfectly.
基金supported by the Natural Science Foundation of Guangdong Province(No.2023A1515011667)the Science and Technology Major Project of Shenzhen(No.KJZD20230923114809020)+3 种基金the Key Basic Research Foundation of Shenzhen(No.JCYJ20220818100205012)the Guangdong Basic and Applied Basic Research Foundation(No.2023B1515120020)the Shenzhen Science and Technology Program(No.RCBS20221008093331068)the Hetao Shenzhen-Hong Kong Science and Technology Innovation Cooperation Zone Project(No.HZQSWS-KCCYB-2024016).
文摘The Thresholding Bandit(TB)problem is a popular sequential decision-making problem,which aims at identifying the systems whose means are greater than a threshold.Instead of working on the upper bound of a loss function,our approach stands out from conventional practices by directly minimizing the loss itself.Leveraging the large deviation theory,we firstly provide an asymptotically optimal allocation rule for the TB problem,and then propose a parameter-free Large Deviation(LD)algorithm to make the allocation rule implementable.Central limit theorem-based Large Deviation(CLD)algorithm is further proposed as a supplement to improve the computation efficiency using normal approximation.Extensive experiments are conducted to validate the superiority of our algorithms compared to existing methods,and demonstrate their broader applications to more general distributions and various kinds of loss functions.
基金supported in part by the Frontier Technology R&D Plan of Jiangsu Province(BF2024065)the Shenzhen Science and Technology Program(JCYJ20230807114609019)Postgraduate Research&Practice Innovation Program of Jiangsu Province(KYCX22_0236).
文摘Dear Editor,This letter investigates the optimal transmission scheduling problem in remote state estimation systems over an unknown wireless channel.We propose a partially observable Markov decision Process(POMDP)framework to model the sensor scheduling problem.By truncating and simplifying the POMDP problem,we have established the properties of the optimal solution under the POMDP model,through a fixed-point contraction method,and have shown that the threshold structure of the POMDP solution is not easily attainable.Subsequently,we obtained a suboptimal solution via Qlearning.Numerical simulations are used to demonstrate the efficacy of the proposed Q-learning approach.
