Leveraging User-Generated Comments and Fused BiLSTM Models to Detect and Predict Issues with Mobile Apps

In the last decade, technical advancements and faster Internet speeds have also led to an increasing number ofmobile devices and users. Thus, all contributors to society, whether young or old members, can use these mobileapps. The use of these apps eases our daily lives, and all customers who need any type of service can accessit easily, comfortably, and efficiently through mobile apps. Particularly, Saudi Arabia greatly depends on digitalservices to assist people and visitors. Such mobile devices are used in organizing daily work schedules and services,particularly during two large occasions, Umrah and Hajj. However, pilgrims encounter mobile app issues such asslowness, conflict, unreliability, or user-unfriendliness. Pilgrims comment on these issues on mobile app platformsthrough reviews of their experiences with these digital services. Scholars have made several attempts to solve suchmobile issues by reporting bugs or non-functional requirements by utilizing user comments.However, solving suchissues is a great challenge, and the issues still exist. Therefore, this study aims to propose a hybrid deep learningmodel to classify and predict mobile app software issues encountered by millions of pilgrims during the Hajj andUmrah periods from the user perspective. Firstly, a dataset was constructed using user-generated comments fromrelevant mobile apps using natural language processing methods, including information extraction, the annotationprocess, and pre-processing steps, considering a multi-class classification problem. Then, several experimentswere conducted using common machine learning classifiers, Artificial Neural Networks (ANN), Long Short-TermMemory (LSTM), and Convolutional Neural Network Long Short-Term Memory (CNN-LSTM) architectures, toexamine the performance of the proposed model. Results show 96% in F1-score and accuracy, and the proposedmodel outperformed the mentioned models.

Deep Learning Social Network Access Control Model Based on User Preferences

A deep learning access controlmodel based on user preferences is proposed to address the issue of personal privacy leakage in social networks.Firstly,socialusers andsocialdata entities are extractedfromthe social networkandused to construct homogeneous and heterogeneous graphs.Secondly,a graph neural networkmodel is designed based on user daily social behavior and daily social data to simulate the dissemination and changes of user social preferences and user personal preferences in the social network.Then,high-order neighbor nodes,hidden neighbor nodes,displayed neighbor nodes,and social data nodes are used to update user nodes to expand the depth and breadth of user preferences.Finally,a multi-layer attention network is used to classify user nodes in the homogeneous graph into two classes:allow access and deny access.The fine-grained access control problem in social networks is transformed into a node classification problem in a graph neural network.The model is validated using a dataset and compared with other methods without losing generality.The model improved accuracy by 2.18%compared to the baseline method GraphSAGE,and improved F1 score by 1.45%compared to the baseline method,verifying the effectiveness of the model.

Resource Allocation in Multi-User Cellular Networks:A Transformer-Based Deep Reinforcement Learning Approach

To meet the communication services with diverse requirements,dynamic resource allocation has shown increasing importance.In this paper,we consider the multi-slot and multi-user resource allocation(MSMU-RA)in a downlink cellular scenario with the aim of maximizing system spectral efficiency while guaranteeing user fairness.We first model the MSMURA problem as a dual-sequence decision-making process,and then solve it by a novel Transformerbased deep reinforcement learning(TDRL)approach.Specifically,the proposed TDRL approach can be achieved based on two aspects:1)To adapt to the dynamic wireless environment,the proximal policy optimization(PPO)algorithm is used to optimize the multi-slot RA strategy.2)To avoid co-channel interference,the Transformer-based PPO algorithm is presented to obtain the optimal multi-user RA scheme by exploring the mapping between user sequence and resource sequence.Experimental results show that:i)the proposed approach outperforms both the traditional and DRL methods in spectral efficiency and user fairness,ii)the proposed algorithm is superior to DRL approaches in terms of convergence speed and generalization performance.

Joint User Association and Satellite Selection for Satellite-Terrestrial Integrated networks

In this paper, we investigate a cooperation mechanism for satellite-terrestrial integrated networks. The terrestrial relays act as the supplement of traditional small cells and cooperatively provide seamless coverage for users in the densely populated areas.To deal with the dynamic satellite backhaul links and backhaul capacity caused by the satellite mobility, severe co-channel interference in both satellite backhaul links and user links introduced by spectrum sharing,and the difference demands of users as well as heterogeneous characteristics of terrestrial backhaul and satellite backhaul, we propose a joint user association and satellite selection scheme to maximize the total sum rate. The optimization problem is formulated via jointly considering the influence of dynamic backhaul links, individual requirements and targeted interference management strategies, which is decomposed into two subproblems: user association and satellite selection. The user association is formulated as a nonconvex optimization problem, and solved through a low-complexity heuristic scheme to find the most suitable access point serving each user. Then, the satellite selection is resolved based on the cooperation among terrestrial relays to maximize the total backhaul capacity with the minimum date rate constraints. Finally,simulation results show the effectiveness of the proposed scheme in terms of total sum rate and power efficiency of TRs' backhaul.

Resource Allocation for IRS Assistedmm Wave Wireless Powered Sensor Networks with User Cooperation

In this paper,we investigate IRS-aided user cooperation(UC)scheme in millimeter wave(mmWave)wirelesspowered sensor networks(WPSN),where two single-antenna users are wireless powered in the wireless energy transfer(WET)phase first and then cooperatively transmit information to a hybrid access point(AP)in the wireless information transmission(WIT)phase,following which the IRS is deployed to enhance the system performance of theWET andWIT.We maximized the weighted sum-rate problem by jointly optimizing the transmit time slots,power allocations,and the phase shifts of the IRS.Due to the non-convexity of the original problem,a semidefinite programming relaxation-based approach is proposed to convert the formulated problem to a convex optimization framework,which can obtain the optimal global solution.Simulation results demonstrate that the weighted sum throughput of the proposed UC scheme outperforms the non-UC scheme whether equipped with IRS or not.

Identification of Influential Users in Online Social Network: A Brief Overview

Information networks where users join a network, publish their own content, and create links to other users are called Online Social Networks (OSNs). Nowadays, OSNs have become one of the major platforms to promote both new and viral applications as well as disseminate information. Social network analysis is the study of these information networks that leads to uncovering patterns of interaction among the entities. In this regard, finding influential users in OSNs is very important as they play a key role in the success above phenomena. Various approaches exist to detect influential users in OSNs, starting from simply counting the immediate neighbors to more complex machine-learning and message-passing techniques. In this paper, we review the recent existing research works that focused on identifying influential users in OSNs.

The Research on E-mail Users' Behavior of Participating in Subjects Based on Social Network Analysis

The e-mail network is a type of social network. This study analyzes user behavior in e-mail subject participation in organizations by using social network analysis. First, the Enron dataset and the position-related information of an employee are introduced, and methods for deletion of false data are presented. Next, the three-layer model(User, Subject, Keyword) is proposed for analysis of user behavior. Then, the proposed keyword selection algorithm based on a greedy approach, and the influence and propagation of an e-mail subject are defined. Finally, the e-mail user behavior is analyzed for the Enron organization. This study has considerable significance in subject recommendation and character recognition.

Analysis of cumulative handoff delay for graded secondary users in cognitive radio networks

According to the fact that the secondary users＇ delay requirements for data transmission are not unitary in cognitive radio networks, the secondary users are divided into two classes, denoted by SU1 and SU2, respectively. It is assumed that SU1 has a higher priority to occupy the primary users＇ unutilized channels than SU2. A preemptive resume priority M/G/1 queuing network is used to model the multiple spectrum handoffs processing. By using a state transition probability matrix and a cost matrix, the average cumulative delays of SU1 and SU2 are calculated, respectively. Numerical results show that the more the primary user＇s traffic load, the more rapidly the SU2＇s cumulative handoff delay grows. Compared with the networks where secondary users are unitary, the lower the SUI＇s arrival rate, the more obviously both SUI＇s and SU2＇s handoff delays decrease. The admission access regions limited by the maximum tolerable delay can also facilitate the design of admission control rules for graded secondary users.

Spectrum-Efficient User Association in Caching Enabled Dense Small Cell Network

In this paper,we reveal the fundamental limitation of network densification on the performance of caching enabled small cell network(CSCN)under two typical user association rules,namely,contentand distance-based rules.It indicates that immoderately caching content would significantly change the interference distribution in CSCN,which may degrade the network area spectral efficiency(ASE).Meanwhile,it is shown that content-based rule outperforms the distance-based rule in terms of network ASE only when small cell base stations(BSs)are sparsely deployed with low decoding thresholds.Moreover,it is proved that network ASE under distance-based user association serves as the upper bound of that under content-based rule in dense BS regime.To enable more spectrum-efficient user association in dense CSCN,we further optimize network ASE by designing a probabilistic content retrieving strategy based on distance-based rule.With the optimized retrieving probability,network ASE could be substantially enhanced and even increase with the growing BS density in dense BS regime.

Changes in the default mode network in the prefrontal lobe, posterior cingulated cortex and hippocampus of heroin users

The default mode network is associated with senior cognitive functions in humans. In this study, we performed independent component analysis of blood oxygenation signals from 14 heroin users and 13 matched normal controls in the resting state through functional MRI scans. Results showed that the default mode network was significantly activated in the prefrontal lobe, posterior cingulated cortex and hippocampus of heroin users, and an enhanced activation signal was observed in the right inferior parietal Iobule （P 〈 0.05, corrected for false discovery rate）. Experimental findings indicate that the default mode network is altered in heroin users.

Interference Alignment Based on Subspace Tracking in MIMO Cognitive Networks with Multiple Primary Users

The interference alignment （IA） algorithm based on FDPM subspace tracking （FDPM-ST IA） is proposed for MIMO cognitive network （CRN） with multiple primary users in this paper. The feasibility conditions of FDPM-ST IA is also got. Futherly, IA scheme of secondary network and IA scheme of primary network are given respectively without assuming a priori knowledge of interference covariance matrices. Moreover, the paper analyses the computational complexity of FDPM-ST IA. Simulation results and theoretical calculations show that the proposed algorithm can achieve higher sum rate with lower computational complexity.

User Preference Aware Hierarchical Edge-User Cooperative Caching Strategy

The emergence of various new services has posed a huge challenge to the existing network architecture.To improve the network delay and backhaul pressure,caching popular contents at the edge of network has been considered as a feasible scheme.However,how to efficiently utilize the limited caching resources to cache diverse contents has been confirmed as a tough problem in the past decade.In this paper,considering the time-varying user requests and the heterogeneous content sizes,a user preference aware hierarchical cooperative caching strategy in edge-user caching architecture is proposed.We divide the caching strategy into three phases,that is,the content placement,the content delivery and the content update.In the content placement phase,a cooperative content placement algorithm for local content popularity is designed to cache contents proactively.In the content delivery phase,a cooperative delivery algorithm is proposed to deliver the cached contents.In the content update phase,a content update algorithm is proposed according to the popularity of the contents.Finally,the proposed caching strategy is validated using the MovieLens dataset,and the results reveal that the proposed strategy improves the delay performance by at least 35.3%compared with the other three benchmark strategies.

Factors influencing knowledge contribution:An empirical investigation of social networking website users

Purpose: In the Web 2.0 era,leveraging the collective power of user knowledge contributions has become an important part of the study of collective intelligence. This research aims to investigate the factors which influence knowledge contribution behavior of social networking sites(SNS) users.Design/methodology/approach: The data were obtained from an online survey of 251 social networking sites users. Structural equation modeling analysis was used to validate the proposed model.Findings: Our survey shows that the individuals' motivation for knowledge contribution,their capability of contributing knowledge,interpersonal trust and their own habits positively influence their knowledge contribution behavior,but reward does not significantly influence knowledge contribution in the online virtual community.Research limitations: Respondents of our online survey are mainly undergraduate and graduate students. A limited sample group cannot represent all of the population. A larger survey involving more SNS users may be useful.Practical implications: The results have provided some theoretical basis for promoting knowledge contribution and user viscosity.Originality/value: Few studies have investigated the impact of social influence and user habits on knowledge contribution behavior of SNS users. This study can make a theoretical contribution by examining how the social influence processes and habits affect one's knowledge contribution behavior using online communities.

Mean Field Annealing Neural Network for the Optimal DS/CDMA Multiuser Detector *

In this paper, an optimal multi user detector in DS/CDMA communication systems based on the mean field annealing (MFA) neural network is proposed. It is shown that the NP complete problem of minimizing the objective function of the optimal multi user detector can be translated into minimizing an MFA network energy function. Numerical results show that the proposed detector offers significant performance gain relative to the conventional detector and decorrelating detector while it can be implemented easily in analog hardware.

Uplink Performance Analysis in Multi-Tier Heterogeneous Cellular Networks with Power Control and Biased User Association

A K-tier uplink heterogeneous cellular network is modelled and analysed by accounting for both truncated channel inversion power control and biased user association. Each user has a maximum transmit power constraint and transmits data when it has sufficient transmit power to perform channel inversion. With biased user association, each user is associated with a base station(BS) that provides the maximum received power weighted by a bias factor, but not their nearest BS. Stochastic geometry is used to evaluate the performances of the proposed system model in terms of the outage probability and ergodic rate for each tier as functions of the biased and power control parameters. Simulations validate our analytical derivations. Numerical results show that there exists a trade-off introduced by the power cut-off threshold and the maximum user transmit power constraint. When the maximum user transmit power becomes a binding constraint, the overall performance is independent of BS densities. In addition, we have shown that it is beneficial for the outage and rate performances by optimizing different network parameters such as the power cut-off threshold as well as the biased factors.

Energy-Efficient User Association in Heterogeneous Networks with M2M/H2H Coexistence under QoS Guarantees

In this paper, we propose an energy efficient user association scheme for uplink heterogeneous networks with machine-to-machine(M2M) and human-to-human(H2H) coexistence. A group based random access protocol is designed for massive number of machine-typecommunications(MTC) user equipments'(UEs) transmissions. A user association problem for UEs' energy efficiency maximization is formulated considering the HTC UEs' quality of service(QoS) guarantees and load balance among multiple BSs, simultaneously. A distributed iterative algorithm is developed to solve the optimization problem. In addition, the convergence of the proposed algorithm is proved. Simulation results show that our proposed scheme outperforms other schemes in terms of energy efficiency and QoS guarantees.

Joint User Association and Resource Allocation for Self-Backhaul Ultra-Dense Networks

In order to meet the exponentially increasing demand on mobile data traffic, self-backhaul ultra-dense networks(UDNs) combined with millimeter wave(mm Wave) communications are expected to provide high spatial multiplexing gain and wide bandwidths for multi-gigabit peak data rates. In selfbackhaul UDNs, how to make the radio access rates of small cells match their backhaul rates by user association and how to dynamically allocate bandwidth for the access links and backhaul links to balance two-hop link resources are two key problems on improving the overall throughputs. Based on this, a joint scheme of user association and resource allocation is proposed in self-backhaul ultra-dense networks. Because of the combinatorial and nonconvex features of the original optimization problem, it has been divided into two subproblems. Firstly, to make the radio access rates of small base stations match their backhaul rates and maximize sum access rates per Hz of all small cells, a proportional constraint is introduced, and immune optimization algorithm(IOA) is adopted to optimize the association indicator variables and the boresight angles of between users and base stations. Then, the optimal backhaul and access bandwidths are calculated by differentiating the general expression of overall throughput. Simulation results indicatethat the proposed scheme increases the overall throughputs significantly compared to the traditional minimum-distance based association scheme.

User growth and penetration modeling for converged heterogeneous network

To evaluate the trail potential of converged heterogeneous network （CHN） market, the logistic method for adoption modeling of CHN is used. User growth ＆ penetration have been taken as two variants to find saturation condition in market. Model is continuous in time but modifications are done for discrete recurrence equation, commonly known as logistic map. Dynamic and static phases are taken into consideration while penetration decay is not covered in this model.

Evaluation of Microblog Users’ Influence Based on PageRank and Users Behavior Analysis

This paper explores the uses’ influences on microblog. At first, according to the social network theory, we present an analysis of information transmitting network structure based on the relationship of following and followed phenomenon of microblog users. Informed by the microblog user behavior analysis, the paper also addresses a model for calculating weights of users’ influence. It proposes a U-R model, using which we can evaluate users’ influence based on PageRank algorithms and analyzes user behaviors. In the U-R model, the effect of user behaviors is explored and PageRank is applied to evaluate the importance and the influence of every user in a microblog network by repeatedly iterating their own U-R value. The users’ influences in a microblog network can be ranked by the U-R value. Finally, the validity of U-R model is proved with a real-life numerical example.

Resource Allocation and User Association for HTTP Adaptive Streaming in Heterogeneous Cellular Networks with Small Cells

Video streaming,especially hypertext transfer protocol based(HTTP) adaptive streaming(HAS) of video,has been expected to be a dominant application over mobile networks in the near future,which brings huge challenge for the mobile networks.Although some works have been done for video streaming delivery in heterogeneous cellular networks,most of them focus on the video streaming scheduling or the caching strategy design.The problem of joint user association and rate allocation to maximize the system utility while satisfying the requirement of the quality of experience of users is largely ignored.In this paper,the problem of joint user association and rate allocation for HTTP adaptive streaming in heterogeneous cellular networks is studied,we model the optimization problem as a mixed integer programming problem.And to reduce the computational complexity,an optimal rate allocation using the Lagrangian dual method under the assumption of knowing user association for BSs is first solved.Then we use the many-to-one matching model to analyze the user association problem,and the joint user association and rate allocation based on the distributed greedy matching algorithm is proposed.Finally,extensive simulation results are illustrated to demonstrate the performance of the proposed scheme.