Cartoon Image Encryption Algorithm by a Fractional-Order Memristive Hyperchaos by Shu-ying Wang, Jian-feng Zhao, Xiao-yan Wang, Li-tao Zhang

“…Comparing with the corresponding integer-order hyperchaotic system, the fractional-order hyperchaos possesses higher complexity. …”
Get full text

Computation offloading and resource allocation strategy based on deep reinforcement learning by Feng ZENG, Zheng ZHANG, Zhigang CHEN

“…In order to expand the coverage and computing power of vehicle edge network, a computation offloading architecture was proposed for space-air-ground integrated vehicle network (SAGVN).With the consideration of the delay and energy consumption constraints of computing tasks, as well as the spectrum, computing and storage constraints in the SAGVN, the joint optimization problem of computation offloading decision and resource allocation was modeled as a mixed integer nonlinear programming problem.Based on the reinforcement learning method, the original problem was transformed into a Markov process, and a deep reinforcement learning algorithm was proposed to solve the problem.The proposed algorithm has the good convergence.The simulation results show that the proposed algorithm outperforms other algorithms in terms of task delay and success rate.…”
Get full text

A ranking hashing algorithm based on listwise supervision by Anbang YANG, Jiangbo QIAN, Yihong DONG, Huahui CHEN

“…Recently,learning to hash technology has been used for the similarity search of large-scale data.It can simultaneous increase the search speed and reduce the storage cost through transforming the data into binary codes.At present,most ranking hashing algorithms compare the consistency of data in the Euclidean space and the Hamming space to construct the loss function.However,because the Hamming distance is a discrete integer value,there may be many data points sharing the same Hamming distance result in the exact ranking cannot be performed.To address this challenging issue,the encoded data was divided into several subspaces with the same length.Each subspace was set with different weights.The Hamming distance was calculated according to different subspace weights.The experimental results show that this algorithm can effectively sort the data in the Hamming space and improve the accuracy of the query compared with other learning to hash algorithms.…”
Get full text

Newton polytope of good symmetric polynomials by Nguyen, Duc-Khanh, Nguyen Thi Ngoc, Giao, Dang Tuan, Hiep, Do Le Hai, Thuy

“…We introduce a general class of symmetric polynomials that have saturated Newton polytope and their Newton polytope has integer decomposition property. The class covers numerous previously studied symmetric polynomials.…”
Get full text

Riemann–Roch for the ring $\mathbb{Z}$ by Connes, Alain, Consani, Caterina

“…The formula equates the (integer valued) Euler characteristic of an Arakelov divisor with the sum of the degree of the divisor (using logarithms with base 2) and the number $1$, thus confirming the understanding of the ring $\mathbb{Z}$ as a ring of polynomials in one variable over the absolute base $\mathbb{S}$, namely $\mathbb{S}[X], 1+1=X+X^2$.…”
Get full text

A New Technique of Laplace Variational Iteration Method for Solving Space-Time Fractional Telegraph Equations by Fatima A. Alawad, Eltayeb A. Yousif, Arbab I. Arbab

“…As a special case, the obtained solutions reduce to the solutions of standard telegraph equations of the integer orders.…”
Get full text

On the Existence of a Normal Trimagic Square of Order 16n by Can Hu, Jiake Meng, Fengchu Pan, Maoting Su, Shuying Xiong

“…Since there exist normal trimagic squares of orders 16, 32, and 48, we prove that there exists a normal trimagic square of order 16n for every positive integer n.…”
Get full text

Stability Analysis of Distributed Order Fractional Chen System by H. Aminikhah, A. Refahi Sheikhani, H. Rezazadeh

“…We first investigate sufficient and necessary conditions of stability of nonlinear distributed order fractional system and then we generalize the integer-order Chen system into the distributed order fractional domain. …”
Get full text

A Synchronous Optimization Model for Multiship Shuttle Tanker Fleet Design and Scheduling Considering Hard Time Window Constraint by Zhenfeng Jiang, Dongxu Chen, Zhongzhen Yang

“…In this paper, the shuttle tanker fleet scheduling problem is considered as a vehicle routing problem with hard time window constraints. A mixed integer programming model aiming at minimizing total transportation cost is proposed to model this problem. …”
Get full text

Function smoothing regularization for precision factorization machine annealing in continuous variable optimization problems by Katsuhiro Endo, Kazuaki Z. Takahashi

“…Solving continuous variable optimization problems by factorization machine quantum annealing (FMQA) demonstrates the potential of Ising machines to be extended as a solver for integer and real optimization problems. However, the details of the Hamiltonian function surface obtained by the factorization machine (FM) have been overlooked. …”
Get full text

Compton scattering from superstrings by Thales Azevedo, Daniel E. A. Matamoros, Gabriel Menezes

“…Abstract We propose a candidate Compton amplitude which is valid for any (integer) quantum spin and free from any spurious poles. …”
Get full text

Robust video watermarking algorithm for H.264/AVC based on texture feature by Wei-wei ZHANG, Ru ZHANG, Jian-yi LIU, Xin-xin NIU, Yi-xian YANG

“…On the basis of analyzing some existing video watermarking al ithms and combining with the new features of the H.264/AVC video coding standard,a new robust video watermarking algorithm based on texture feature was proposed.The proposed algorithm firstly performs the 4×4 integer discrete cosine transform on the current frame in purpose of identifying whether it is the texture block.Then the watermarking is embedded by adopting the way of differential energy for selecting the appropriate coefficients adaptively.The experimental result shows that the proposed algorithm has little impact on the video quality and bit-rate,moreover,its robustness can effectively resist the common attacks such as the gauss noise,low pass filter and re-coded performed on the video watermarking.…”
Get full text

Identity-based cloud storage integrity checking from lattices by Miaomiao TIAN, Chuang GAO, Jie CHEN

“…With the rapid development of cloud storage,more and more users are storing their data in the cloud.To verify whether the users’ data stored in the cloud is corrupted,one effective method is to adopt cloud storage integrity checking schemes.An identity-based cloud storage integrity checking scheme was proposed on the small integer solution problem over ideal lattices,and it was proven to be secure against the adaptive identity attacks of clouds in the random oracle model.To validate the efficiency of the scheme,extensive experiments were conducted to make performance-comparisons between the scheme and the existing two identity-based cloud storage integrity checking schemes.The experimental results show that the online tag-generation time and the proof-verification time of the scheme are respectively reduced by 88.32%～93.74% and 98.81%～99.73%.…”
Get full text

New Bounds on 2-Frameproof Codes of Length 4 by Penying Rochanakul

“…These digital fingerprints are generally denoted as codewords in Qn, where Q is an alphabet of size q and n is a positive integer. A 2-frameproof code is a code C such that any 2 codewords in C cannot form a new codeword under a particular rule. …”
Get full text

On the Rational Recursive Sequence xn+1=(A+∑i=0kαixn−i)/(B+∑i=0kβixn−i) by E. M. E. Zayed, M. A. El-Moneam

“…,x−1,x0 are arbitrary positive real numbers, while k is a positive integer number.…”
Get full text

Abel–Goncharov Type Multiquadric Quasi-Interpolation Operators with Higher Approximation Order by Ruifeng Wu

“…Error estimates indicate that our operators could provide the desired precision by choosing the suitable shape-preserving parameter c and a nonnegative integer m. Several numerical comparisons are carried out to verify a higher degree of accuracy based on the obtained scheme. …”
Get full text

Hyers–Ulam Stability for Quantum Equations of Euler Type by Douglas R. Anderson, Masakazu Onitsuka

“…In particular, we show a direct connection between quantum equations of Euler type and h-difference equations of constant step size h with constant coefficients and an arbitrary integer order. For equation orders greater than two, the h-difference results extend first-order and second-order results found in the literature, and the Euler-type q-difference results are completely novel for any order. …”
Get full text

The Normality Criteria of Meromorphic Functions Concerning Shared Fixed-Points by Wei Chen, Qi Yang, Wen-jun Yuan, Hong-gen Tian

“…We study the normality criteria of meromorphic functions concerning shared fixed-points; we obtain the following: Let ℱ be a family of meromorphic functions defined in a domain D and k≥2 a positive integer. For every f∈ℱ, all zeros of f are of multiplicity at least k+2 and all poles of f are multiple. …”
Get full text

Graph partition based mapping algorithm on multiprocessors for streaming applications by Qi TANG, Shang-feng WU, Jun-wu SHI, Ji-bo WEI

“…To take advantage of multiprocessor platform,it is a necessity to map tasks of the application properly onto different processors to exploit the concurrency in the application and thus meet the stringent timing requirements.Parallelism graph was proposed to quantify and model the concurrency among tasks of the application.An algorithm was also proposed to construct the parallelism graph based on the self-timed schedule and transform the mapping problem to a graph partitioning problem.The graph partitioning problem as a pure 0-1 integer linear programming model was further formulated and the ILP solver to find the optimal result.A lot of randomly generated synchronous dataflow graphs and a set of practical applications were used to evaluate the performance of the proposed method.The experimental results demonstrate that the proposed method outperforms available algorithms.…”
Get full text

4-REGULAR GRAPH OF DIAMETER 2 by Đỗ Như An, Nguyễn Đình Ái

“…The diameter of G is the greatest distance between any pair of vertices. Let n4 be maximum integer number so that there exists an 4-regular graph on n4 vertices of diameter 2. …”
Get full text