Search

This paper evaluates the benefit of integrating vehicle-based mobile crowd-sensing tasks into the ride-hailing system through the collaboration between the data user and the ride-hailing platform. In such a system, the ride-hailing platform commissions high-valued sensing tasks to idle drivers who can undertake either ride-hailing or sensing requests. Considering the different service requirements and time windows between sensing and ride-hailing requests, we design a staggered operation strategy for ride-hailing order matching and the sensing task assignment. The auction-based mechanisms are employed to minimize costs while incentivizing driver participation in mobile sensing. To address the budget deficit problem of the primal VCG-based task assignment mechanism, we refine the driver selection approach and tailor the payment rule by imposing additional budget constraints. We demonstrate the benefits of our proposed mechanism through a series of numerical experiments using the NYC Taxi data. Experimental results reveal the potential of the mechanism for achieving high completion rates of sensing tasks at low social costs without degrading ride-hailing services. Furthermore, drivers who participate in both mobile sensing tasks and ride-hailing requests may gain higher income, but this advantage may diminish with an increasing number of such drivers and higher demand for ride-hailing services., Comment: 30 pages, 9 figures

This paper explores the concept of fairness and equitable matching in an on-line vehicle-cargo matching setting, addressing the varying degrees of satisfaction experienced by shippers and carriers. Relevant indicators for shippers and carriers in the on-line matching process are categorized as attributes, expectations, and reliability, which are subsequent quantified to form satisfaction indicators. Employing the intuitionistic fuzzy set theory, we devise a transformed vehicle-cargo matching optimization model by combining the fuzzy set's membership, non-membership, and uncertainty information. Through an adaptive interactive algorithm, the matching scheme with fairness concerns is solved using CPLEX. The effectiveness of the proposed matching mechanism in securing high levels of satisfaction is established by comparison with three benchmark methods. To further investigate the impact of considering fairness in vehicle-cargo matching, a shipper-carrier-platform tripartite evolutionary game framework is developed under the waiting response time cost (WRTC) sharing mechanism. Simulation results show that with fairness concerns in vehicle-cargo matching, all stakeholders are better off: The platform achieves positive revenue growth, and shippers and carriers receive positive subsidy. This study offers both theoretical insights and practical guidance for the long-term and stable operation of the on-line freight stowage industry., Comment: 36 pages, 15 figures

This paper presents a macroscopic fundamental diagram model with volume-delay relationship (MFD-VD) for road traffic networks, by exploring two new data sources: license plate cameras (LPCs) and road congestion indices (RCIs). We derive a first-order, nonlinear and implicit ordinary differential equation involving the network accumulation (the {\it volume}) and average congestion index (the {\it delay}), and use empirical data from a 266 km$^2$ urban network to fit an accumulation-based MFD with $R^2>0.9$. The issue of incomplete traffic volume observed by the LPCs is addressed with a theoretical derivation of the observability-invariant property: The ratio of traffic volume to the critical value (corresponding to the peak of the MFD) is independent of the (unknown) proportion of those detected vehicles. Conditions for such a property to hold are discussed in theory and verified empirically. This offers a practical way to estimate the ratio-to-critical-value, which is an important indicator of network saturation and efficiency, by simply working with a finite set of LPCs. The significance of our work is the introduction of two new data sources widely available to study empirical MFDs, as well as the removal of the assumptions of full observability, known detection rates, and spatially uniform sensors, which are typically required in conventional approaches based on loop detector and floating car data., Comment: 38 pages, 17 figures

Vehicle-based mobile sensing is an emerging data collection paradigm that leverages vehicle mobilities to scan a city at low costs. Certain urban sensing scenarios require dedicated vehicles for highly targeted monitoring, such as volatile organic compounds (VOCs, a type of air pollutant) sensing, road surface monitoring, and accident site investigation. A hallmark of these scenarios is that the points of interest (POIs) need to be repeatedly visited by a set of agents, whose routes should provide sufficient sensing coverage with coordinated overlap at certain important POIs. For these applications, this paper presents the open team orienteering problem with repeatable visits (OTOP-RV). The adaptive large neighborhood search (ALNS) algorithm is tailored to solve the OTOP-RV considering specific features of the problem. Test results on randomly generated datasets show that: (1) For small cases, the ALNS matches Gurobi in terms of optimality but with shorter computational times; (2) For large cases, the ALNS significantly outperforms the greedy algorithm (by 9.7% to 25.4%), and a heuristic based on sequential orienteering problems (by 6%). Finally, a real-world case study of VOCs sensing is presented, which highlights the unique applicability of the OTOP-RV to such specific sensing tasks, as well as the effectiveness of the proposed algorithms in optimizing the sensing utilities., Comment: 24 pages, 5 figures, 4 tables

We propose a unified framework for low resource automatic speech recognition tasks named meta audio concatenation (MAC). It is easy to implement and can be carried out in extremely low resource environments. Mathematically, we give a clear description of MAC framework from the perspective of bayesian sampling. In this framework, we leverage a novel concatenative synthesis text-to-speech system to boost the low resource ASR task. By the concatenative synthesis text-to-speech system, we can integrate language pronunciation rules and adjust the TTS process. Furthermore, we propose a broad notion of meta audio set to meet the modeling needs of different languages and different scenes when using the system. Extensive experiments have demonstrated the great effectiveness of MAC on low resource ASR tasks. For CTC greedy search, CTC prefix, attention, and attention rescoring decode mode in Cantonese ASR task, Taiwanese ASR task, and Japanese ASR task the MAC method can reduce the CER by more than 15\%. Furthermore, in the ASR task, MAC beats wav2vec2 (with fine-tuning) on common voice datasets of Cantonese and gets really competitive results on common voice datasets of Taiwanese and Japanese. Among them, it is worth mentioning that we achieve a \textbf{10.9\%} character error rate (CER) on the common voice Cantonese ASR task, bringing about \textbf{30\%} relative improvement compared to the wav2vec2 (with fine-tuning).

Recently, pseudo label based semi-supervised learning has achieved great success in many fields. The core idea of the pseudo label based semi-supervised learning algorithm is to use the model trained on the labeled data to generate pseudo labels on the unlabeled data, and then train a model to fit the previously generated pseudo labels. We give a theory analysis for why pseudo label based semi-supervised learning is effective in this paper. We mainly compare the generalization error of the model trained under two settings: (1) There are N labeled data. (2) There are N unlabeled data and a suitable initial model. Our analysis shows that, firstly, when the amount of unlabeled data tends to infinity, the pseudo label based semi-supervised learning algorithm can obtain model which have the same generalization error upper bound as model obtained by normally training in the condition of the amount of labeled data tends to infinity. More importantly, we prove that when the amount of unlabeled data is large enough, the generalization error upper bound of the model obtained by pseudo label based semi-supervised learning algorithm can converge to the optimal upper bound with linear convergence rate. We also give the lower bound on sampling complexity to achieve linear convergence rate. Our analysis contributes to understanding the empirical successes of pseudo label-based semi-supervised learning.

In this paper, we propose a novel Siamese Adversarial Network (SAN) architecture for automatic speech recognition, which aims at solving the difficulty of fuzzy audio recognition. Specifically, SAN constructs two sub-networks to differentiate the audio feature input and then introduces a loss to unify the output distribution of these sub-networks. Adversarial learning enables the network to capture more essential acoustic features and helps the models achieve better performance when encountering fuzzy audio input. We conduct numerical experiments with the SAN model on several datasets for the automatic speech recognition task. All experimental results show that the siamese adversarial nets significantly reduce the character error rate (CER). Specifically, we achieve a new state of art 4.37 CER without language model on the AISHELL-1 dataset, which leads to around 5% relative CER reduction. To reveal the generality of the siamese adversarial net, we also conduct experiments on the phoneme recognition task, which also shows the superiority of the siamese adversarial network.

We propose a novel procedure to generate pseudo mandarin speech data named as CAMP (character audio mix up), which aims at generating audio from a character scale. We also raise a method for building a mandarin character scale audio database adaptive to CAMP named as META-AUDIO, which makes full use of audio data and can greatly increase the data diversity of the database. Experiments show that our CAMP method is simple and quite effective. For example, we train models with 10 hours of audio data in AISHELL-1 and pseudo audio data generated by CAMP, and achieve a competitive 11.07 character error rate (CER). Besides, we also perform training with only 10 hours of audio data in AIDATATANG dataset and pseudo audio data generated by CAMP, which again achieves a competitive 8.26 CER.

With the rise of the Internet of Things, strategies for effectively processing big data are essential for discovering meaningul insights. The time series datasets produced by groups of interconnected devices contain valuable underlying patterns. Recent works have extracted patterns from spatio-temporal datasets to aid in road network generation, activity recognition, and others. The speed and accuracy of the underlying geometry reconstruction are important in these applications. Existing methods such as kernel density estimation (KDE) have been used but are often computationally expensive. We propose modifying edge quadtrees to utilize their effective heirarchical structure. Our modification estimates density using a novel trajectory count function which provides mathematical guarantees on the stability of the count by enforcing an invariance to local perturbations. We evaluate our method's effectiveness at extracting the underlying geometry and representative subsample points. For verification, we compare against a KDE variant at extracting the underlying shape of noisy synthetic trajectories travelling alonng the shape. We compare map extraction from GPS traces against current methods. Our method significantly improves runtime while extracting the geometry better or at least comparably. We also compare against maxmin subsampling on an activity recognition data set and find a significant runtime improvement with comparable performance., Comment: 15 pages, 13 Figures

Timing channels enable data leakage that threatens the security of computer systems, from cloud platforms to smartphones and browsers executing untrusted third-party code. Preventing unauthorised information flow is a core duty of the operating system, however, present OSes are unable to prevent timing channels. We argue that OSes must provide time protection in addition to the established memory protection. We examine the requirements of time protection, present a design and its implementation in the seL4 microkernel, and evaluate its efficacy as well as performance overhead on Arm and x86 processors.

Timing channels are information flows, encoded in the relative timing of events, that bypass the system's protection mechanisms. Any microarchitectural state that depends on execution history and affects the rate of progress of later executions potentially establishes a timing channel, unless explicit steps are taken to close it. Such state includes CPU caches, TLBs, branch predictors and prefetchers; removing the channels requires that the OS can partition such state or flush it on a switch of security domains. We measure the capacities of channels based on these microarchitectural features on several generations of processors across the two mainstream ISAs, x86 and ARM, and investigate the effectiveness of the flushing mechanisms provided by the respective ISA.We find that in all processors we studied, at least one significant channel remains. This implies that closing all timing channels seems impossible on contemporary mainstream processors.