Search

Due to the continuous development of few-shot learning, there have been notable advancements in methods for few-shot object detection in recent years. However, most existing methods in this domain primarily focus on natural images, neglecting the challenges posed by variations in object scales, which are usually encountered in remote sensing images. This article proposes a new few-shot object detection model designed to handle the issue of object scale variation in remote sensing images. Our developed model has two essential parts: a feature aggregation module (FAM) and a scale-aware attention module (SAM). Considering the few-shot features of remote sensing images, we designed the FAM to improve the support and query features through channel multiplication operations utilizing a feature pyramid network and a transformer encoder. The created FAM better extracts the global features of remote sensing images and enhances the significant feature representation of few-shot remote sensing objects. In addition, we design the SAM to address the scale variation problems that frequently occur in remote sensing images. By employing multiscale convolutions, the SAM enables the acquisition of contextual features while adapting to objects of varying scales. Extensive experiments were conducted on benchmark datasets, including NWPU VHR-10 and DIOR datasets, and the results show that our model indeed addresses the challenges posed by object scale variation and improves the applicability of few-shot object detection in the remote sensing domain.

Abstract Malware detection is an important task for the ecosystem of mobile applications (APPs), especially for the Android ecosystem, and is vital to guarantee the user experience of Android APPs. There have been some exiting methods trying to solve the problem of malware detection, but the methods suffer from several defects, such as high time complexity and mediocre accuracy, which seriously decrease the practicability of existing methods. To solve these problems, in this study, we propose a novel Android malware detection framework, where we contribute an efficient Application Programming Interface (API) call sequences extraction algorithm and an investigation of different types of classifiers. In API call sequences extraction, we propose an algorithm for transforming the function call graph from a multigraph into a directed simple graph, which successfully avoids the unnecessary repetitive path searching. We also propose a pruning search, which further reduces the number of paths to be searched. Our algorithm greatly reduces the time complexity. We generate the transition matrix as classification features and investigate three types of machine learning classifiers to complete the malware detection task. The experiments are performed on real‐world Android Packages (APKs), and the results demonstrate that our method significantly reduces the running time and produces high detection accuracy.

A large number of Web APIs have been released as services in mobile communications, but the service provided by a single Web API is usually limited. To enrich the services in mobile communications, developers have combined Web APIs and developed a new service, which is known as a mashup. The emergence of mashups greatly increases the number of services in mobile communications, especially in mobile networks and the Internet-of-Things (IoT), and has encouraged companies and individuals to develop even more mashups, which has led to the dramatic increase in the number of mashups. Such a trend brings with it big data, such as the massive text data from the mashups themselves and continually-generated usage data. Thus, the question of how to determine the most suitable mashups from big data has become a challenging problem. In this paper, we propose a mashup recommendation framework from big data in mobile networks and the IoT. The proposed framework is driven by machine learning techniques, including neural embedding, clustering, and matrix factorization. We employ neural embedding to learn the distributed representation of mashups and propose to use cluster analysis to learn the relationship among the mashups. We also develop a novel Joint Matrix Factorization (JMF) model to complete the mashup recommendation task, where we design a new objective function and an optimization algorithm. We then crawl through a real-world large mashup dataset and perform experiments. The experimental results demonstrate that our framework achieves high accuracy in mashup recommendation and performs better than all compared baselines.

Mobile bike-sharing services have been prevalently used in many cities as an important urban commuting service and a promising way to build smart cities, especially in the new era of 5G and Internet-of-Things (IoT) environments. A mobile bike-sharing service makes commuting convenient for people and imparts new vitality to urban transportation systems. In the real world, the problems of no docks or no bikes at bike-sharing stations often arise because of several inevitable reasons such as the uncertainty of bike usage. In addition to pure manual rebalancing, in several works, attempts were made to predict the demand for bikes. In this paper, we devised a bike-sharing service with highly accurate demand prediction using collaborative computing and information fusion. We combined the information of bike demands at different time periods and the locations between stations and proposed a dynamical clustering algorithm for station clustering. We carefully analyzed and discovered the group of features that impact the demand of bikes, from historical bike-sharing records and 5G IoT environment data. We combined the discovered information and proposed an XGBoost-based regression model to predict the rental and return demand. We performed sufficient experiments on two real-world datasets. The results confirm that compared to some existing methods, our method produces superior prediction results and performance and improves the availability of bike-sharing service in 5G IoT environments.

In a situation where life becomes more stressful and challenging, people feel compelled to be more concerned about their mental situation. Different emotional statuses are external reactions to different mental states. Therefore, researchers always identify people's mental situation by monitoring their real-time emotions. At the same time, due to the availability of built-in sensors in a smartphone, applications that can identify real-time emotions of mobile users are constantly emerging. However, compared to most emotion recognition algorithms, computing resources and battery life in mobile phones are always limited. This makes accuracy and latency of these applications are unsatisfactory. In this paper, we propose a micro-service platform for mobile emotion recognition application developers (MSPMERAD) which can supply high performance. First, a classifier fusion emotion recognition algorithm is proposed by using a dynamic adaptive fusion strategy. Second, this new algorithm is encapsulated into a micro-service. With other affiliated micro-services such as data uploading, preprocessing, etc., developers can ignore the implementation of the emotion recognition algorithm and just focus on how to collect sensor data and interact with users. The accuracy and latency of one application based on the MSPMERAD are compared with another application that is implemented using a locale emotion recognition algorithm. Experiments based on the daily behavior data of 50 student volunteers show that the application based on our platform has higher recognition accuracy with a more reasonable time.

In the mobile edge computing environment, there are a large number of mobile edge services which are the carriers of various mobile intelligent applications. So how to recommend the most suitable candidate from such a huge number of available services is an urgent task, especially the recommendation task based on quality-of-service (QoS). In traditional service recommendation, collaborative filtering (CF) has been studied in academia and industry. However, due to the mobility of users and services, there exist several defects that limit the application of the CF-based methods, especially in an edge computing environment. The most important problem is the cold-start. In this paper, we propose an ensemble model which combines the model-based CF and neighborhood-based CF. Our approach has two phases, i.e., global features learning and local features learning. In the first phase, to alleviate the cold-start problem, we propose an improved auto-encoder which deals with sparse inputs by pre-computing an estimate of the missing QoS values and can obtain the effective hidden features by capturing the complex structure of the QoS records. In the second phase, to further improve prediction accuracy, a novel computation method is proposed based on Euclidean distance that aims to address the overestimation problem. We introduce two new concepts, common invocation factor and invocation frequency factor, in similarity computation. Then we propose three prediction models, containing two individual models and one hybrid model. The two individual models are proposed to utilize user similar neighbors and service similar neighbors, and the hybrid model is to utilize all neighbors. The experiments conducted in a real-world dataset show that our models can produce superior prediction results and are not sensitive to parameter settings.

Temporary mobile social networks has been used at hotels, concerts, theme parks, and sports arenas, where people form a mobile social group for a short time with a common interest or activity. People confined to such specific places or activities are allowed to join the temporary mobile social networks using their main social network accounts (e.g., Foursquare, Facebook). Users registered for the same business/research conference may have common connections and thus may be willing to travel together in the conference city. Traveling with temporal friends can improve the mobile users’ experiences as well as help them save money. Currently, renting cars to travel around becomes very general, and one car usually can contain at least four guests. Therefore, traveling with temporal friends can help those guests save their travel cost, such as renting cost and oil cost. To this end, in this paper, we propose a group-wise itinerary planning framework to improve the mobile users’ experiences. The experiment results over real data sets illustrate the effectiveness of our proposed framework.

Owing to the ever-growing popularity of mobile computing, a large number of services have been developed for a variety of users. Considering this, recommending useful services to users is an urgent problem that needs to be addressed. Collaborative filtering (CF) approaches have been successfully adopted for services recommendation. Nevertheless, the prediction accuracy of the existing CF approaches is likely to reduce due to many reasons, such as inability to use side information and high data sparsity, which further lead to low quality of services recommendation. In order to solve these problems, some model-based CF approaches have been proposed. In this paper, we propose a novel quality of service prediction approach based on probabilistic matrix factorization (PMF), which has the capability of incorporating network location (an important factor in mobile computing) and implicit associations among users and services. First, we propose a novel clustering method that is capable of utilizing network location to cluster users. Based on the clustering results, we further propose an enhanced PMF model. The proposed model also incorporates the implicit associations among users and services. In addition, our model incorporates the implicit relationships between the users and the services. We conducted experiments on one real-world data set, and the experimental results show that our model outperforms the compared methods.

With the development of sensors and of the Internet of Things (IoT), smart cities can provide people with a variety of information for a more convenient life. Effective on-street parking availability prediction can improve parking efficiency and, at times, alleviate city congestion. Conventional methods of parking availability prediction often do not consider the spatial–temporal features of parking duration distributions. To this end, we propose a parking space prediction scheme called the hybrid spatial–temporal graph convolution networks (HST-GCNs). We use graph convolutional networks and gated linear units (GLUs) with a 1D convolutional neural network to obtain the spatial features and the temporal features, respectively. Then, we construct a spatial–temporal convolutional block to obtain the instantaneous spatial–temporal correlations. Based on the similarity of the parking duration distributions, we propose an attention mechanism called distAtt to measure the similarity of parking duration distributions. Through the distAtt mechanism, we add the long-term spatial–temporal correlations to our spatial–temporal convolutional block, and thus, we can capture complex hybrid spatial–temporal correlations to achieve a higher accuracy of parking availability prediction. Based on real-world datasets, we compare the proposed scheme with the benchmark models. The experimental results show that the proposed scheme has the best performance in predicting the parking occupancy rate.

Cyber-physical systems (CPS) have received much attention from both academia and industry. An increasing number of functions in CPS are provided in the way of services, which gives rise to an urgent task, that is, how to recommend the suitable services in a huge number of available services in CPS. In traditional service recommendation, collaborative filtering (CF) has been studied in academia, and used in industry. However, there exist several defects that limit the application of CF-based methods in CPS. One is that under the case of high data sparsity, CF-based methods are likely to generate inaccurate prediction results. In this paper, we discover that mining the potential similarity relations among users or services in CPS is really helpful to improve the prediction accuracy. Besides, most of traditional CF-based methods are only capable of using the service invocation records, but ignore the context information, such as network location, which is a typical context in CPS. In this paper, we propose a novel service recommendation method for CPS, which utilizes network location as context information and contains three prediction models using random walking. We conduct sufficient experiments on two real-world datasets, and the results demonstrate the effectiveness of our proposed methods and verify that the network location is indeed useful in QoS prediction.

Mobile Service selection is an important but challenging problem in service and mobile computing. Quality of service (QoS) predication is a critical step in service selection in 5G network environments. The traditional methods, such as collaborative filtering (CF), suffer from a series of defects, such as failing to handle data sparsity. In mobile network environments, the abnormal QoS data are likely to result in inferior prediction accuracy. Unfortunately, these problems have not attracted enough attention, especially in a mixed mobile network environment with different network configurations, generations, or types. An ensemble learning method for predicting missing QoS in 5G network environments is proposed in this paper. There are two key principles: one is the newly proposed similarity computation method for identifying similar neighbors; the other is the extended ensemble learning model for discovering and filtering fake neighbors from the preliminary neighbors set. Moreover, three prediction models are also proposed, two individual models and one combination model. They are used for utilizing the user similar neighbors and servicing similar neighbors, respectively. Experimental results conducted in two real-world datasets show our approaches can produce superior prediction accuracy.

Process recommendation technologies have gained more and more attention in the field of intelligent business process modeling to assist the process modeling. However, most of the existing technologies only use the process structure analysis and do not take the social features of processes into account, while the process modeling is complex and comprehensive in most situations. This paper studies the feasibility of social network research technologies on process recommendation and builds a social network system of processes based on the features similarities. Then, three process matching degree measurements are presented and the system implementation is discussed subsequently. Finally, experimental evaluations and future works are introduced.