To maintain the company's talent pool, recruiters need to continuously search for resumes from third-party websites (e.g., LinkedIn, Indeed). However, fetched resumes are often incomplete and inaccurate. To improve the quality of third-party resumes and enrich the company's talent pool, it is essential to conduct duplication detection between the fetched resumes and those already in the company's talent pool. Such duplication detection is challenging due to the semantic complexity, structural heterogeneity, and information incompleteness of resume texts. To this end, we propose MHSNet, an multi-level identity verification framework that fine-tunes BGE-M3 using contrastive learning. With the fine-tuned BGE-M3, MHSNet generates multi-level sparse and dense representations for resumes, enabling the computation of corresponding multi-level semantic similarities. Moreover, the state-aware Mixture-of-Experts (MoE) is employed in MHSNet to handle diverse incomplete resumes. Experimental results verify the effectiveness of MHSNet.

Abstract Software maintenance and evolution play an important role in the software engineering field, especially when current software becomes more and more complex and powerful. As an entity to implement business processes and gain revenue, valuable software is composed of business logic and corresponding organization role interaction interfaces. With the enterprise development, the organization architecture also evolves, like expanding, cross department cooperation, and so on. However, existing software process adaptive approaches mainly focus on handling the change of the business (program) logic instead of organization structure. Therefore, we propose an adaptive software business process approach that supports organization architecture evolution and automatically migrates the run‐time process instances to the latest version. First, a business process adaptation model is designed, which includes the organization layer, business process layer and event layer that connects the two. Based on the model, the organization changing impact and business process model modification are formalized. Besides, the business process adaptation approach is designed. According to the dependence between the organization architecture and the business process activities, the affected domain detection algorithms for three basic business process structures and the business process instance migration algorithm are developed. Finally, the feasibility and stability of the proposed system are comprehensively evaluated with the synthetic data sets.

Recently around half of the world’s current population resides in urban areas and benefit from rich services in the smart city. The majority of smart city services are recommendation-related services, and with the development of Internet, most recommendation services in smart economy are online recommendations. Online travel platforms (OTPs) (like Booking, Airbnb, Ctrip, and Fliggy) provide people sufficient resources and convenient approaches to plan and enjoy their trips in smart city. Hotel recommendation is essential for the success of OTPs. However, it is more challenging compared to item recommendation in typical E-commerce scenarios (e.g., Taobao, Jd, and YouTube). The in-nature characteristics of low-frequency and high unit-price lead to more severe sparse and long-tail data distributions. Moreover, for enhancing user experience and business returns, the recommender system seeks to improve both click-through rate (CTR) and conversion rate (CVR) where the seesaw phenomenon may occur. In order to address the aforementioned shortages in hotel recommendation, a multitask learning (MTL) method with a novel flexible multilevel extraction network [denoted as flexible MTL (FMTL)] is proposed. Particularly, FMTL takes MTL into consideration in a unified representation learning framework and is divided into feature encoding and task prediction. In the feature encoding phase, we introduce a novel multirepresentation extractor with temperature-adjusted gating mechanism (T-MRE) for each task, producing more flexible representations for sparse and long-tail data. Moreover, we fuse different representations for each task with three strategies during the prediction phase and empirically demonstrate that the simple concatenation strategy is superior than other relatively complex gating approaches. Offline and live experiments with regard to both overall metrics and user group analysis based on the scarcity of user behaviors illustrate that without significantly increasing model parameters, our FMTL model outperforms substantially over several state-of-the-art models.

Online travel platforms (OTPs), e.g., bookings.com and Ctrip.com, deliver travel experiences to online users by providing travel-related products. Although much progress has been made, the state-of-the-arts for cold-start problems are largely sub-optimal for user representation, since they do not take into account the unique characteristics exhibited from user travel behaviors. In this work, we propose a State-aware Multi-aspect Interests representation Network (SMINet) for cold-start users recommendation at OTPs, which consists of a multi-aspect interests extractor, a co-attention layer, and a state-aware gating layer. The key component of the model is the multi-aspect interests extractor, which is able to extract representations for the user's multi-aspect interests. Furthermore, to learn the interactions between the user behaviors in the current session and the above multi-aspect interests, we carefully design a co-attention layer which allows the cross attentions between the two modules. Additionally, we propose a travel state-aware gating layer to attentively select the multi-aspect interests. The final user representation is obtained by fusing the three components. Comprehensive experiments conducted both offline and online demonstrate the superior performance of the proposed model at user representation, especially for cold-start users, compared with state-of-the-art methods.

Abstract Software testing is an indispensable part of the software engineering industry, which guarantees product reliability and safety. Traditional testing approaches face the testing Oracle problem, they are difficult to construct the expected outputs with the increasing of program complexity. As a result, metamorphic testing, which tests the program by examining the relationship between the execution results, is proposed. However, existing manual metamorphic relation construction requires huge effects of domain experts, and automatic methods are unstable and inefficient due to the insufficient software feature mining. Hence, we proposed a multi‐dimensional program structure‐based metamorphic relation prediction approach, which is composed of feature extraction and prediction model building. In the feature extraction stage, the testing program is converted to multiple intermediate structures (such as control flow graphs and abstract syntax trees) to explore its features. In the prediction model building stage, the extracted feature set is used as the training set, and a novel semi‐supervised support vector machine‐bagging‐K‐nearest neighbors algorithm is designed to train the prediction model. Besides, a two‐phase hybrid granularity search algorithm is proposed to improve the prediction performance by selecting the optimal number of weak classifiers. Compared with existing approaches, our proposed model can improve the accuracy by around 14%.

Online travel platforms (OTPs), for example, booking.com, Ctrip.com, and Fliggy, deliver travel experiences to online users by providing travel-related products. Hotel recommendation is significantly important for OTPs since hotel bookings account for almost half of the travel expenses and hotel products generate more than half of OTP’s revenues. More than 58% Fliggy users may choose to use query-less hotel searches to find candidate hotels, where no additional keywords are given except the expected check-in date and travel destination city. Thus, how to recommend hotels to traveler users is important and challenging. In this article, we explore the unique characteristics of query-less hotel users and propose a novel multiscenario query-less search network (MSQS). According to their searching date, expected check-in date, current city, and expected hotel city, MSQS groups users’ behaviors (e.g., click, purchase, search) into four scenario groups, namely today-local, today-nonlocal, future-local, and future-nonlocal. The key components of MSQS are the global expert, the scenario expert, and the feedback expert. The global expert learns common features among different scenarios and extracts the feature interactions between context, users, and hotels. The scenario expert utilizes multilayer perception to learn the differentiating features between scenarios. The feedback expert learns users’ preferences for hotels in different scenarios through their historical behaviors, and a scenario interest extractor is carefully designed to enhance attention across scenarios and behaviors. An offline experiment on the Fliggy production dataset with over 8 million users and 0.49 million travel items and an online A/B test both show that MSQS effectively predicts users’ hotel booking intentions.

Vehicular ad hoc networks (VANETs) provide self-organized wireless multihop transmission, where nodes cooperate with each other to support data communication. However, malicious nodes may intercept or discard data packets, which might interfere with the transmission process and cause privacy leakage. We consider historical interaction data of nodes as an important factor of trust. Thus, this paper focuses on the trust node management of VANETs, which aims to quantify node credibility as an assessment method and avoid assigning malicious nodes. First, the integrated trust of each node is proposed, which consists of the direct trust and the recommended trust. The former is dynamically computed by historical interaction records and Bayesian inference considering penalty factors. The latter defines trust by third-party nodes and their reputation. Second, the process of trust calculation and data communication calls for timeliness. Therefore, we introduce a time sliding window and time decay function to ensure that the latest interaction information has a higher weight. We can sensitively identify malicious nodes and make quick responses. Finally, the experimental results demonstrate that our proposed method outperforms bassline methods, especially with respect to the packet delivery ratio and security.

Nowadays, artificial neural networks are widely used for users’ online travel planning. Personalized travel planning has many real applications and is affected by various factors, such as transportation type, intention destination estimation, budget limit and crowdness prediction. Among those factors, users’ intention destination prediction is an essential task in online travel platforms. The reason is that, the user may be interested in the travel plan only when the plan matches his real intention destination. Therefore, in this paper, we focus on predicting users’ intention destinations in online travel platforms. In detail, we act as online travel platforms (such as Fliggy and Airbnb) to recommend travel plans for users, and the plan consists of various vacation items including hotel package, scenic packages and so on. Predicting the actual intention destination in travel planning is challenging. Firstly, users’ intention destination is highly related to their travel status (e.g., planning for a trip or finishing a trip). Secondly, users’ actions (e.g. clicking, searching) over different product types (e.g. train tickets, visa application) have different indications in destination prediction. Thirdly, users may mostly visit the travel platforms just before public holidays, and thus user behaviors in online travel platforms are more sparse, low-frequency and long-period. Therefore, we propose a Deep Multi-Sequences fused neural Networks (DMSN) to predict intention destinations from fused multi-behavior sequences. Real datasets are used to evaluate the performance of our proposed DMSN models. Experimental results indicate that the proposed DMSN models can achieve high intention destination prediction accuracy.

Emerging spatial/mobile crowdsourcing service platforms enable workers (i.e., crowd) to complete spatial crowdsourcing tasks (e.g., taking photos, verifying data on-site, delivery) that are tagged with rewards, time and location features. In this paper, we develop online route recommendation service for a mobile crowdsourcing worker, such that he can (i) reach his destination on time and (ii) receive the maximum reward from spatial crowdsourcing tasks along the route. We show that no online algorithm can compute the optimal route. Then, we propose effective heuristics to compute routes with high reward, and present efficient techniques to accelerate their computation. Experimental results on real datasets show that our proposed heuristics incur low response time and produce high-reward routes (yielding 80 percent of the optimal reward for on-site tasks and 70 percent of the optimal reward for delivery tasks).

In the era of smartphones, massive data are generated with geo-related info. A large portion of them come from UGC applications (e.g., Twitter, Instagram), where the content provider are users themselves. Such applications are highly attractive for targeted marketing and recommendation, which have been well studied in recommendation system. In this paper, we consider this from a brand new spatial aspect using UGC contents only. To do this we first representing each message as a point with its geo info as its location and then grouping all the points by their keywords to form multiple point groups. We form a similarity search problem that given a query keyword, our problem aims to find k keywords with the most similar distribution of locations. Our case study shows that with similar distribution, the keywords are highly likely to have semantic connections. However, the performance of existing solutions degrades when different point groups have significant overlapping, which frequently happens in UGC contents. We propose efficient techniques to process similarity search on this kind of point groups. Experimental results on Twitter data demonstrate that our solution is faster than the state-of-the-art by up to 6 times.

Location-based social media (e.g., Twitter, Foursquare) have been generating massive amount of geo-textual data. In this paper, we represent the spatial distribution of a keyword by the group of locations tagged with such keyword. Given a query keyword, our problem is to find k keywords with the most similar distribution of locations. Such query finds applications in targeted marketing and recommendation. The performance of existing solutions degrade when different point groups have significant overlapping, which happens rather frequently in real data. We propose efficient techniques to process similarity search on point groups. Experimental results on Twitter data demonstrate that our solution is faster than the state-of-the-art by up to 6 times.

Data market is an emerging type of cloud service that enables a data owner to sell their data sets in a public cloud. Buyers who are interested in a certain dataset can access the data in the mar-ket via a RESTful API. Accessing data in the data market may not be free. For example, it costs USD 12 per month to obtain 100 “transactions ” from the WorldWide Historical Weather dataset in Windows Azure Data Marketplace, where a transaction is a unit of result size (e.g., a query result of 4400 records would consume 44 transactions as Windows Azure Data Marketplace confines one transaction to 100 records). Therefore, in this paper, we present PayLess, a system that helps data buyers to optimize their queries so that they can obtain the query results by paying less to the data sellers. Experiments over synthetic data and real data sets in Win-dows Azure Marketplace show that PayLess can cost-effectively handle SQL query processing over data markets. 1.

Location-based services (LBS) enable mobile users to query points-of-interest (e.g., restaurants, cafes) on various features (e.g., price, quality, variety). In addition, users require accurate query results with up-to-date travel times. Lacking the monitoring infrastructure for road traffic, the LBS may obtain live travel times of routes from online route APIs in order to offer accurate results. Our goal is to reduce the number of requests issued by the LBS significantly while preserving accurate query results. First, we propose to exploit recent routes requested from route APIs to answer queries accurately. Then, we design effective lower/upper bounding techniques and ordering techniques to process queries efficiently. Also, we study parallel route requests to further reduce the query response time. Our experimental evaluation shows that our solution is three times more efficient than a competitor, and yet achieves high result accuracy (above 98 percent).

A moving kNN query continuously reports the k results (restaurants) nearest to a moving query point (tourist). In addition to the query results, a service provider often returns to a mobile client a safe region that bounds the validity of query results in order to minimize the communication cost between the service provider and that mobile client. However, when a service provider is not trustworthy, it may send inaccurate query results or incorrect safe regions to mobile clients. In this paper, we present a framework for authenticating both the query results and the safe regions of moving kNN queries. We theoretically proved that our methods for authenticating moving kNN queries minimize the data sent between the service provider and the mobile clients. Extensive experiments are carried out using both real and synthetic data sets and results show that our methods can perform moving kNN query authentication with small communication costs and overhead.