Search

Heterogeneous networks (HetNets) give users the opportunity to access different access points(APs), which will simultaneously affect user performance and system performance, so user association in HetNets plays a critical role in enhancing the load balancing and the system sum-throughput of networks. Meanwhile, the incremental sum-throughput currently fails to meet the escalating data demands. Besides, ensuring fairness amongst users constitutes another urgent issue in the radio resource management (RRM) of HetNets. What is more, few works consider the maximum service user number constraint in femtocell access points (FAPs). To solve the aforementioned problem, this paper associates users to APs by considering system sum-throughput and fairness at the same time in HetNets under a maximum service user number constraint of FAPs; accordingly, the user association problem is formulated. By releasing constraint, the optimal user association algorithm is obtained by Lagrangian function, and based on this optimal solution, a low complexity suboptimal user association algorithm is proposed. At last, this paper investigates the relationship between system sum-throughput and maximum service user number of FAPs. Numerical simulation results show that the proposed algorithm can improve sum-throughput and fairness at the same time at a specific maximum service user number of FAPs. [ABSTRACT FROM AUTHOR]

In the traditional satellite networks, network resources are mainly allocated among all the satellites based on the same allocation algorithm. This kind of symmetry model limits the increase of throughput. In this paper, we study an asymmetry resource allocation method in a satellite–terrestrial network and propose a Lotka–Volterra based predator–prey model to achieve optimal resource allocation among different satellites. In the proposed satellite–terrestrial network, we divide all the satellites into two groups, and we try to achieve load stability between these two satellites groups. Using the predator–prey model, one group is the prey–satellites, which can obtain service requirements from mobile users. The other group is considered as predator–satellites, which can only obtain the loads from the group of the prey–satellites. Once the satellites are divided into two groups using the Lotka–Volterra model, the resource allocation problem among these satellites in two groups would be asymmetry resource. We prove the existence of solutions to the proposed model. Numerical simulation results are given to show the correctness and effectiveness of the proposed model. [ABSTRACT FROM AUTHOR]

As a symmetric encryption algorithm, multiple-parameter fractional Fourier transform (MPFRFT) is proposed and applied to image encryption. The MPFRFT with two vector parameters has better security, which becomes the main technical means to protect information security. However, our study found that many keys of the MPFRFT are invalid, which greatly reduces its security. In this paper, we propose a new reformulation of MPFRFT and analyze it using eigen-decomposition-type fractional Fourier transform (FRFT) and weighted-type FRFT as basis functions, respectively. The results show that the effective keys are extremely limited. Furthermore, we analyze the extended encryption methods based on MPFRFT, which also have the security risk of key invalidation. Theoretical analysis and numerical simulation verify our point of view. Our discovery has important reference value for a class of generalized FRFT image encryption methods. [ABSTRACT FROM AUTHOR]

This paper introduces a new three-step algorithm to solve the split feasibility problem. The main advantage is that one of the projective operators interferes only in the final step, resulting in less computations at each iteration. An example is provided to support the theoretical approach. The numerical simulation reveals that the newly introduced procedure has increased performance compared to other existing methods, including the classic CQ algorithm. An interesting outcome of the numerical modeling is an approximate visual image of the solution set. [ABSTRACT FROM AUTHOR]

Since data stream anomaly detection algorithms based on sliding windows are sensitive to the abnormal deviation of individual interference data, this paper presents a sliding nest window chart anomaly detection based on the data stream (SNWCAD-DS) by employing the concept of the sliding window and control chart. By nesting a small sliding window in a large sliding window and analyzing the deviation distance between the small window and the large sliding window, the algorithm increases the out-of-bounds detection ratio and classifies the conceptual drift data stream online. The designed algorithm is simulated on the industrial data stream of drilling engineering. The proposed algorithm SNWCAD is compared with Automatic Outlier Detection for Data Streams (A-ODDS) and Distance-Based Outline Detection for Data Stream (DBOD-DS). The experimental results show that the new algorithm can obtain higher detection accuracy than the compared algorithms. Furthermore, it can shield the influence of individual interference data and satisfy actual engineering needs. [ABSTRACT FROM AUTHOR]

This paper presents a new algorithm for the resolution of over-constrained lumped process systems, where partial differential equations of a continuous time and space model of the system are reduced into ordinary differential equations with a finite number of parameters and where the model equations outnumber the unknown model variables. Our proposal is aimed at the study and improvement of the algorithm proposed by Hangos-Szerkenyi-Tuza. This new algorithm improves the computational cost and solves some of the internal problems of the aforementioned algorithm in its original formulation. The proposed algorithm is based on parameter relaxation that can be modified easily. It retains the necessary information of the lumped process system to reduce the time cost after introducing changes during the system formulation. It also allows adjustment of the system formulations that change its differential index between simulations. [ABSTRACT FROM AUTHOR]