Proxy re-signature scheme based on isomorphisms of polynomial by Hui-xian LI, Lu SHAO, Liao-jun PANG

“…Most of the existing proxy resignature schemes were based on the hardness of big integer factoring,discrete logarithm,elliptic curve.However,none of them can resist the attack by a quantum computer.Motivated by these concerns,a new proxy resignature scheme was proposed.By employing secret affine transformations and homogeneous polynomials,the proposed scheme could implement the signature transformation with high-efficiency,and meanwhile it was secure against the attack by a quantum computer.The results of analysis showed that the proposed scheme was correct and consistent,and had the unforgeability in the random oracle model.Compared with the existing schemes,the proposed scheme not only inherits the resistance to quantum attack and high efficiency from the multivariate public key cryptosystems,but also has the properties of multi-use,transparent and private proxy.…”
Get full text

Asymptotic Behavior of Solutions of Delayed Difference Equations by J. Diblík, I. Hlavičková

“…This contribution is devoted to the investigation of the asymptotic behavior of delayed difference equations with an integer delay. We prove that under appropriate conditions there exists at least one solution with its graph staying in a prescribed domain. …”
Get full text

A new proof of the GGR conjecture by Ash, J. Marshall, Catoiu, Stefan, Fejzić, Hajrudin

“…For each positive integer $n$, function $f$, and point $x$, the 1998 conjecture by Ginchev, Guerragio, and Rocca states that the existence of the $n$th Peano derivative $f_{(n)}(x)$ is equivalent to the existence of all $n(n+1)/2$ generalized Riemann derivatives, \[ D_{k,-j}f(x)=\lim _{h\rightarrow 0}\frac{1}{h^{n}}\sum _{i=0}^k(-1)^i\binom{k}{i}f(x+(k-i-j)h), \] for $j,k$ with $0\le j…”
Get full text

Numerical Solution via Operational Matrix for Solving Prabhakar Fractional Differential Equations by Farah Suraya Md Nasrudin, Chang Phang

“…We achieve this by first deriving the analytical expression for Prabhakar derivative of xp where p is positive integer, via integration. Hence, for the first time, the operational matrix method for Prabhakar derivative is derived by using the properties of shifted Legendre polynomials. …”
Get full text

QGA-based network service extension algorithm in NFV by Hang QIU, Hongbo TANG, Wei YOU, Yu ZHAO, Yi BAI

“…To meet the client’s new business requirements or add additional security protection functions, the already hosted network service extension problem in the cloud network based on network function virtualization was researched.The network service extension in the cloud network was modeled as an integer linear programming, considering the impact on initial service, extended graph deployment, resource capacity and virtual network function affinity constraints, and so on.To deal with the computational complexity and dynamism of future large-scale cloud networks, a QGA-based network service extension algorithm was proposed to improve solution efficiency and solution quality through quantum parallel computing.Simulation results prove that the efficient performance of the proposed algorithm in terms of extension successful ratio and average resource costs, and the proposed algorithm has low time complexity.…”
Get full text

Configuration of health pathway networks for patients with chronic diseases by Laaziz El Hassan

“…Utility (utility matrix) is defined in our article as a matrix valuing each type of care pathway by its utility for a specific category of patient or for their stage of illness. The model is an integer linear program.…”
Get full text

Parent Berry Curvature and the Ideal Anomalous Hall Crystal by Tixuan Tan, Trithep Devakul

“…Our theory offers a unified perspective for understanding several aspects of the recently observed integer and fractional quantum anomalous Hall effects in rhombohedral multilayer graphene and provides a recipe for engineering new topological states.…”
Get full text

Control Allocation Design of Reaction Control System for Reusable Launch Vehicle by Rongjun Mu, Xin Zhang

“…In this paper, an indexed control method was proposed for RCS preallocation, a 0-1 integer programming algorithm was designed for RCS allocation controller, and then this RCS scheme’s effect was analyzed. …”
Get full text

A New Fractional-Order Hyperchaotic System and Its Adaptive Tracking Control by Yinlan Chen, Haodong Zhang, Xu Kong

“…We construct for the first time a fractional-order hyperchaotic system via the original integer-order system. The dynamical behavior of this fractional-order hyperchaotic system is investigated in detail using first approximation method and Lyapunov exponents. …”
Get full text

Square-free numbers in the intersection of Lehmer set and Piatetski-Shapiro sequence by Zhao Xiaoqing, Yi Yuan

“…Let $ q $ be a sufficiently large odd integer, and let $ c \in\left(1, \frac{4}{3}\right) $. …”
Get full text

Joint optimization algorithm for task offloading resource allocation based on edge-end collaboration by Liuqing WU, Xiaorong ZHU

“…In order to solve the problem of limited mobile terminal resources and improve task processing efficiency,a task offloading resource allocation algorithm based on edge-end collaboration was proposed.With the goal of maximizing the total benefit of tasks,the optimal task offloading resource allocation problem based on Lyapunov theory was formed by the constraint of service QoS guarantee and resource limitation.Since the problem is NP-hard,it was decoupled into a channel resource allocation problem solved by KKT condition and a 0-1 integer programming problem about task assignment.Compared with the traditional algorithm,the complexity of the proposed algorithm was O(mn),the efficiency was improved by about 20%,and the delay was reduced more than 15%.…”
Get full text

Some special cases on Stolarsky’s means by Cesare Palmisani

“…We link SM having the integer power of a prime number as a parameter to classical means (i.e., harmonic mean, geometric mean, arithmetic mean, power mean). …”
Get full text

Some Density Results on Sets of Primes for Hecke Eigenvalues by Aiyue Zou, Huixue Lao, Shu Luo

“…Firstly, we study the behavior of the signs of the sequences λfpλfpj for any even positive integer j. Moreover, we obtain the analytic density for the set of primes where the product λfpiλfpj is strictly less than λgpiλgpj. …”
Get full text

Rings with a finite set of nonnilpotents by Mohan S. Putcha, Adil Yaqub

“…Let n be a nonnegative integer. The ring R is called a θn-ring if the number of elements in R which are not in N is at most n. …”
Get full text

AN IMPROVED ALGORITHM FOR TIME DOMAIN AVERAGING BASED ON FRACTIONAL DELAY FILTERING by ZOU JinChun, QU Lei, DAI GuangHao, WANG XiuFeng, SHEN YuDi

“…For reducing the influence of truncation error on the accuracy of time domain averaging（ TDA） induced by noninteger-period sampling,an improved algorithm of TDA based on fractional delay filtering（ FDF） is presented.On the basis of analyzing the disadvantages of current methods of TDA and the characteristics of FDF,a presently improved method of signal truncation was used in the method to avoid the accumulation of truncation error and obtain a delay factor on each of the truncated signals,the reconstruction and resample for the truncated signals were implemented with FDF,and finally the arithmetic mean were computed after all of the truncated signals were added.The theoretical analysis and experimental results demonstrate that the method which fully makes using of the advantages of FDF on the change of delay factor,apparently reduces the truncation error of signals with non-integer-period sampling,and could obviously improve the accuracy of TDA without key-phase signal.…”
Get full text

On the class of square Petrie matrices induced by cyclic permutations by Bau-Sen Du

“…Let n≥2 be an integer and let P={1,2,…,n,n+1}. Let Zp denote the finite field {0,1,2,…,p−1}, where p≥2 is a prime. …”
Get full text

The 2-adic complexity and the 1-error 2-adic complexity of single cycle T-functions by Wei YOU, Wen-feng QI

“…The 2-adic complexities of the coordinate sequences derived from single cycle T-functions over F ₂n were investigated.Let j be an integer such that 0≤ j≤n−1.It is shown that the 2-adic complexity of the j th coordinate sequence is upper bounded by lb(2^2j+1).The distribution of the corresponding 2-adic number associated with the j th coordinate sequence of all single cycle T-functions was also discussed,which implies that the upper bound is attainable.Moreover,1-error 2-adic complexity was also studied.It was proved that the 1-error 2-adic complexity of the j th coordinate sequence is equal to its 2-adic complexity except for j=0.…”
Get full text

Modelling and Metaheuristic for Gantry Crane Scheduling and Storage Space Allocation Problem in Railway Container Terminals by Ming Zeng, Wenming Cheng, Peng Guo

“…The gantry crane scheduling and storage space allocation problem in the main containers yard of railway container terminal is studied. A mixed integer programming model which comprehensively considers the handling procedures, noncrossing constraints, the safety margin and traveling time of gantry cranes, and the storage modes in the main area is formulated. …”
Get full text

A Fast Implicit Finite Difference Method for Fractional Advection-Dispersion Equations with Fractional Derivative Boundary Conditions by Taohua Liu, Muzhou Hou

“…Fractional advection-dispersion equations, as generalizations of classical integer-order advection-dispersion equations, are used to model the transport of passive tracers carried by fluid flow in a porous medium. …”
Get full text

An optimization model for network design in disaster relief planning by Kevin Palomino, Carmen Berdugo-Correa, David García-Barrios

“…This model, which was developed using a mixed-integer linear program - MILP, considers the availability of resources and the cost of different locations, as well as constraints that must be met to ensure timely aid delivery. …”
Get full text