This letter proposes a satellite handover strategy for the huge low earth orbit (LEO) satellite constellation. As the increasing of the constellation scale and the number of user terminals (UTs), the satellite handover becomes more complicated. Thus, we formulate the network-flows model of the satellite handover, and the handover UTs can access the satellites according to the flow matrix. In the proposed network-flows model, the weighted edges are determined by the requests of UTs and the quality of satellite services. The multiple matching between the satellites and UTs can be determined by calculating the minimum cost and maximum flow of the network-flows. Besides, we propose a modified handover strategy based on network-flows (HSNF) algorithm to enhance the algorithm performance by preventing infinite loop. Finally, the simulations show the effectiveness and superiority of the proposed strategy.
Current research on smartphone addiction has mainly focused on addiction at the device level. This motivated us to explore more specifically on app addiction. We investigate smartphone usage for college students using surveys, logged data, and interviews. Specifically, we adapted existing smartphone addiction assessment instruments to measure app addiction. The analysis of our data shows that social and communication apps are the top 2 most addictive categories among participants. Female and male participants show no significant difference in terms of smartphone addiction. However, female participants tend to report that they are addicted to more apps. The psychological factors associated with app addiction are different between app categories. For example, compared to communication apps, participants report that it is easier to withdraw from social apps, but more difficult to control time spent on them. Correlation analysis between app usage features and app addictiveness scores reveals that compulsive open times, usage duration, and regularity of usage are good indicators of app addiction, though response time to notifications has limited predictive power.
massive MIMO technology is critical in the 5G mobile communication system, which can greatly improve the frequency efficiency and communication capacity of terrestrial mobile communication systems, and also provides a new thinking for LEO satellite communication systems to fully reuse frequency between beams. In the paper, according to the massive MIMO-LEO satellite communications theory, we focus on the scenario of demands distributing unevenly spatially, and study the resource allocation problem of LEO satellite communications with full frequency reuse from the spatial perspective. Under the LEO satellite coverage-zoning model, we propose a rasterizing-coverage model for LEO satellites based on the characteristics of massive MIMO, establish a spatial resource allocation model with full frequency reuse, which models the spatial resource allocation problem with the objective of maximizing throughput as an integer programming problem, and put forward a greedy-based spatial resource allocation method. The simulation results show that when the service demand is 100% and the number of spatial resource groups is 16, compared with the fixed-beam method and the hopping-beam allocation method, the resource utilization can be improved respectively by 19% and 26%, and the satisfaction can be improved respectively by 16% and 17.5%, whose improvement are enhanced with the size of the on-board MIMO antenna increasing.
We consider penalized regression models under a unified framework where the particular method is determined by the form of the penalty term. We propose a fully Bayesian approach that incorporates both sparse and dense settings and show how to use a type of model averaging approach to eliminate the nuisance penalty parameters and perform inference through the marginal posterior distribution of the regression coefficients. We establish tail robustness of the resulting estimator as well as conditional and marginal posterior consistency. We develop an efficient component-wise Markov chain Monte Carlo algorithm for sampling. Numerical results show that the method tends to select the optimal penalty and performs well in both variable selection and prediction and is comparable to, and often better than alternative methods. Both simulated and real data examples are provided.