Uplink scheduling scheme for cloud service based on software-defined wireless network by Su PAN, Bang XIAO, Yu-qing CHEN, Sheng-mei LIU

“…The scheme first solved the resource allocation problem by using the binary integer programming method, and then calculated the optimal transmission rate of cloud services in each time slot using the method of dynamic programming, finally adjusted the transmission rate of cloud services proportional to the current channel status using QoS control method in the framework of SDWN. …”
Get full text

A Bilevel Multiobjective Optimisation Approach for Solving the Evacuation Location Assignment Problem by Ahmed W. A. Hammad

“…Next, the problem is linearised into a mixed-integer linear programming model and solved using an off-the-shelf solver. …”
Get full text

Optimal cluster head deployment in heterogeneous wireless sensor networks by LIU Lin1, YU Hai-bin2

“…Cluster-based method has better adaptability and energy-efficiency to wireless sensor networks（WSN） used for environmental monitoring.If the cluster head is served by more powerful node,the performance of WSN will be improved greatly.In large scale WSN,high-power cluster head deployment is a kind of NP-hard problem.The optimal problem of cluster head deployment was formulated as an integer programming with the condition of restrictions of cluster head capacity and the maximal cluster radius.To satisfy the time effectiveness,a heuristic algorithm called KMSA was proposed which was a hybrid algorithm of K-mean and simulated annealing.The simulation results show that the KMSA can improve the performance of WSN on varieties of network size and cluster number.…”
Get full text

Approach to blind synchronization parameters estimation for OFDM systems by GUO Li-ting1, 2

“…Finally through analyzing this algorithm, a method was got, which can not only estimate a timing offset which is not an integer multiple of one OFDM sample duration, but also enlarge the frequency offset estimation range, thus, a frequency offset estimation over the entire bandwidth of the OFDM system is possible. …”
Get full text

A Note on the Primitive Roots and the Golomb Conjecture by Yiwei Hou, Hongyan Wang

“…Then, for any positive integer n with p1/2+ɛ≤n<p, there must exist two primitive roots α and β modulo p with 1<α,β≤n−1 such that the equation n=α+β holds, where 0<ɛ<1/2 is a fixed positive number. …”
Get full text

On the Stability of Quadratic Functional Equations by Jung Rye Lee, Jong Su An, Choonkil Park

“…Let X,Y be vector spaces and k a fixed positive integer. It is shown that a mapping f(kx+y)+f(kx-y)=2k2f(x)+2f(y) for all x,y∈X if and only if the mapping f:X→Y satisfies f(x+y)+f(x-y)=2f(x)+2f(y) for all x,y∈X. …”
Get full text

Contact Characteristic Analysis of Thrust Needle Bearing by Liu Peng, Zhang Wenhu, Zhao Gang, Li Tiefeng, Cui Wenbin, Yang Chao

“…Based on the dynamics of rolling bearing,an improved slice method is used to solve the problem of needle-race contact,and the dynamics differential equations are established and solved by Predicting-Correcting GSTIFF（ Gear Stiff） integer algorithm with variable step. The impact of working parameters and roller crowned shape on the stress distribution of needle-race and bearing life is investigated theoretically,and it shows that,working conditions of bearing and roller crowned shape both have large effect on the fatigue life of bearing. …”
Get full text

On the Diophantine equation x2+p2k+1=4yn by S. Akhtar Arif, Amal S. Al-Ali

“…It has been proved that if p is an odd prime, y>1, k≥0, n is an integer greater than or equal to 4, (n,3h)=1 where h is the class number of the field Q(−p), then the equation x2+p2k+1=4yn has exactly five families of solution in the positive integers x, y. …”
Get full text

Polynomial Reproduction of Vector Subdivision Schemes by Y. F. Shen, D. H. Yuan, S. Z. Yang

“…We discuss the polynomial reproduction of vector subdivision schemes with general integer dilation m≥2. We first present a simple algebraic condition for polynomial reproduction of such schemes with standard subdivision symbol. …”
Get full text

A note on power invariant rings by Joong Ho Kim

“…R is said to be forever-power-invariant if S is a ring and n is any positive integer such that R((n))≅S((n)) then R≅S Let IC(R) denote the set of all a∈R such that there is R- homomorphism σ:R[[X]]→R with σ(X)=a. …”
Get full text

A Numerical Study on the Regularity of d-Primes via Informational Entropy and Visibility Algorithms by B. L. Mayer, L. H. A. Monteiro

“…Let a d-prime be a positive integer number with d divisors. From this definition, the usual prime numbers correspond to the particular case d=2. …”
Get full text

Nearly Derivations on Banach Algebras by M. Eshaghi Gordji, H. Khodaei, G. H. Kim

“…Let 𝑛 be a fixed integer greater than 3 and let 𝜆 be a real number with 𝜆≠(𝑛2−𝑛+4)/2. …”
Get full text

Distributed relay assignment and power allocation for full-duplex two-way relaying in wireless sensor networks by Song Li, Shuo Li, Yanjing Sun

“…We investigated the weighted sum rate maximization problem under relay assignment constraints and total power constraints on each cooperative link, which turns out to be a mixed integer nonlinear programming problem. To tackle the challenging problem, we propose a distributed relay assignment and power allocation scheme by separating the original problem into two subproblems: relay assignment and power allocation. …”
Get full text

A Method to Attack the FHE Schemes Based on the Hardness of PACDP by Zheng Wang, Yong Ding, Xinguo Li, Yi Liu

“…For the FHE scheme designed by Tang et a1, the security of the FHE schemes based on the hardness of a partia11y approximate integer common divisor prob1em（PACDP）was discussed.By dividing the interva1 of the noise of the pub1ic key, using the fast po1ynomia1 mu1tipoint eva1uation and GCD a1gorithm to get the secret key, the FHE schemes based on the hardness of PACDP were successfu11y crashed down.…”
Get full text

More on Spectral Analysis of Signed Networks by Guihai Yu, Hui Qu

“…We determine that the integer 2 is an eigenvalue of normalized Laplacian matrix if and only if the signed network is balanced and bipartite. …”
Get full text

Global Structure of Positive Solutions of a Discrete Problem with Sign-Changing Weight by Ruyun Ma, Chenghua Gao, Xiaoling Han, Xiaoqiang Chen

“…Let T>5 be an integer, T={1,2,…,T}. We are concerned with the global structure of positive solutions set of the discrete second-order boundary value problems Δ2u(t-1)+rm(t)f(u(t))=0,  t∈T,  u(0)=u(T+1)=0, where r∈ℝ is a parameter, m:T→ℝ changes its sign and m(t)≠0 for  t∈T.…”
Get full text

An Interference Links Selection Method Based on Genetic Algorithm by Juan Meng, Li Hong, Yanan Li, Zhiming Han, Lili Guo

“…By exploiting the heterogeneous path loses, the design problem of transceiver precoding matrices was formulated into a mixed integer bi-level optimal program. Then this problem was solved based on genetic algorithm to achieve the optimal system throughput. …”
Get full text

Existence and Multiplicity of Solutions for Discrete Nonlinear Two-Point Boundary Value Problems by Jianmin Guo, Caixia Guo

“…By using Morse theory, the critical point theory, and the character of 𝐾1/2, we consider the existence and multiplicity results of solutions to the following discrete nonlinear two-point boundary value problem −Δ2𝑥(𝑘−1)=𝑓(𝑘,𝑥(𝑘)),𝑘∈ℤ(1,𝑇) subject to 𝑥(0)=0=Δ𝑥(𝑇), where 𝑇 is a positive integer, ℤ(1,𝑇)={1,2,…,𝑇},Δ is the forward difference operator defined by Δ𝑥(𝑘)=𝑥(𝑘+1)−𝑥(𝑘), and 𝑓∶ℤ(1,𝑇)×ℝ→ℝ is continuous. …”
Get full text

Indexation of Fixed-Income Portfolios to the IMA-B by Emilio Ricardo Carvalhais, Antonio Marcos Duarte Júnior

“…The resulting model is a mathematical programming problem with convex objective function, linear constraints and free and non-negative integer variables. Five numerical examples with real data are presented to illustrate the model’s practical use. …”
Get full text

Normality Criteria of Meromorphic Functions That Share a Holomorphic Function by Jie Ding, Jianming Qi, Taiying Zhu

“…,ak-1 be holomorphic functions in D, and let k be a positive integer. Suppose that, for every function f∈F, f≠0, P(f)=f(k)+ak-1f(k-1)+⋯+a1f'+a0f≠0 and, for every pair functions (f,g)∈F, P(f), P(g) share ψ, then F is normal in D.…”
Get full text