With the rapid development of smart cities, smart buildings are generating a massive amount of building sensing data by the equipped sensors. Indeed, building sensing data provides a promising way to enrich a series o...
详细信息
With the rapid development of smart cities, smart buildings are generating a massive amount of building sensing data by the equipped sensors. Indeed, building sensing data provides a promising way to enrich a series of data-demanding and cost-expensive urban mobile applications. In this paper, as a preliminary exploration, we study how to reuse building sensing data to predict traffic volume on nearby roads. Compared with existing studies, reusing building sensing data has considerable merits of cost-efficiency and high-reliability. Nevertheless, it is non-trivial to achieve accurate prediction on such cross-domain data with two major challenges. First, relationships between building sensing data and traffic data are not unknown as prior, and the spatio-temporal complexities impose more difficulties to uncover the underlying reasons behind the above relationships. Second, it is even more daunting to accurately predict traffic volume with dynamic building-traffic correlations, which are cross-domain, non-linear, and time-varying. To address the above challenges, we design and implement BuildSenSys, a first-of-its-kind system for nearby traffic volume prediction by reusing building sensing data. Our work consists of two parts, i.e., Correlation Analysis and Cross-domain Learning. First, we conduct a comprehensive building-traffic analysis based on multi-source datasets, disclosing how and why building sensing data is correlated with nearby traffic volume. Second, we propose a novel recurrent neural network for traffic volume prediction based on cross-domain learning with two attention mechanisms. Specifically, a cross-domain attention mechanism captures the building-traffic correlations and adaptively extracts the most relevant building sensing data at each predicting step. Then, a temporal attention mechanism is employed to model the temporal dependencies of data across historical time intervals. The extensive experimental studies demonstrate that BuildSenSys outperf
A blockchain can be taken as a decentralized and distributed public database. In order to achieve data consistency of the system nodes, the execution of a consensus algorithm is necessary and required in the case of d...
详细信息
A blockchain can be taken as a decentralized and distributed public database. In order to achieve data consistency of the system nodes, the execution of a consensus algorithm is necessary and required in the case of decentralized environments. Simply speaking, the consensus is that every node agrees on some record in the blockchain. There are many kinds of consensus algorithms in blockchain environments, and each consensus algorithm has its own proper application scenario. Here we firstly analysis and compare various popular consensus algorithms in blockchain environments, and then as voting theory has systematically studied the decision-making in a group, the traditional methods of voting theory is summarized and listed, including (Position) scoring rules, Copeland, Maximin, Ranked pairs, Voting trees, Bucklin, Plurality with runoff, Single transferable vote, Baldwin rule, and Nanson rule. Finally, we introduce the voting methods from voting theory to consensus algorithms in the blockchain to improve its performance.
Music recommendation is an popular function for personalized services and smart applications since it focuses on discovering users’ leisure preference. The traditional music recommendation strategy captured users’ m...
详细信息
Dynamic networks vary over time, making it vital to capture networks temporal patterns for predicting missing links with high accuracy. A biased non-negative latent factorization of tensors (BNLFT) model is very effec...
详细信息
ISBN:
(数字)9781728168555
ISBN:
(纸本)9781728168562
Dynamic networks vary over time, making it vital to capture networks temporal patterns for predicting missing links with high accuracy. A biased non-negative latent factorization of tensors (BNLFT) model is very effective in extracting such patterns from dynamic data. However, a BNLFT model only integrates single bias, which cannot adequately represents the volatility of the dynamic data. To address this issue, this paper presents a Diverse Biases Non-negative Latent Factorization of Tensors (DBNT) model for accurate prediction of missing links in dynamic networks. Meanwhile, for further prediction accuracy improvement, the preprocessing bias is integrated into the DBNT model. Empirical studies on two dynamic networks datasets from real applications show that compared with state of the art predictors, a DBNT model achieves higher prediction accuracy.
Pedestrian detection in a crowd is a very challenging issue. This paper addresses this problem by a novel NonMaximum Suppression (NMS) algorithm to better refine the bounding boxes given by detectors. The contribution...
详细信息
State-of-the-art deep learning based stereo matching approaches treat disparity estimation as a regression problem, where loss function is directly defined on true disparities and their estimated ones. However, dispar...
详细信息
—Uplink-downlink duality refers to the fact that under a sum-power constraint, the capacity regions of a Gaussian multiple-access channel and a Gaussian broadcast channel with Hermitian transposed channel matrices ar...
详细信息
Introduction: To develop and validate a machine learning model based on dual-energy computed tomography (DECT) for predicting cervical lymph node metastases (CLNM) in patients diagnosed with nasopharyngeal carcinoma (...
详细信息
作者：
Wu, XunZheng, Wei-LongLu, Bao-LiangCenter for Brain-Like Computing and Machine Intelligence
Department of Computer Science and Engineering Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Brain Science and Technology Research Center Qing Yuan Research Institute Shanghai Jiao Tong University 800 Dong Chuan Road Shanghai200240 China Clinical Data Animation Center
Department of Neurology Massachusetts General Hospital Harvard Medical School 55 Fruit Street BostonMA United States
Compared with the rich studies on the motor brain-computer interface (BCI), the recently emerging affective BCI presents distinct challenges since the brain functional connectivity networks involving emotion are not w...
详细信息
Compared with the rich studies on the motor brain-computer interface (BCI), the recently emerging affective BCI presents distinct challenges since the brain functional connectivity networks involving emotion are not well investigated. Previous studies on emotion recognition based on electroencephalography (EEG) signals mainly rely on single-channel-based feature extraction methods. In this paper, we propose a novel emotion-relevant critical subnetwork selection algorithm and investigate three EEG functional connectivity network features: strength, clustering coefficient, and eigenvector centrality. The discrimination ability of the EEG connectivity features in emotion recognition is evaluated on three public emotion EEG datasets: SEED, SEED-V, and DEAP. The strength feature achieves the best classification performance and outperforms the state-of-the-art differential entropy feature based on single-channel analysis for the EEG signals. The experimental results reveal that distinct functional connectivity patterns are exhibited for the five emotions of disgust, fear, sadness, happiness, and neutrality. Furthermore, we construct a multimodal emotion recognition model by combining the functional connectivity features from EEG and the features from eye movements or physiological signals using deep canonical correlation analysis. The classification accuracies of multimodal emotion recognition are 95.08 ± 6.42% on the SEED dataset, 84.51 ± 5.11% on the SEED-V dataset, and 85.34 ± 2.90% and 86.61 ± 3.76% for arousal and valence on the DEAP dataset, respectively. The results demonstrate the complementary representation properties of the EEG functional connectivity network features with eye movement data. In addition, we find that the brain networks constructed with fewer channels, i.e., 18 channels, achieve comparable performance with that of the 62-channel network with respect to multimodal emotion recognition and enable easier setups for BCI systems in real scenarios. Cop
In recent years, scene parsing has captured increasing attention in computer vision. Previous works have demonstrated promising performance in this task. However, they mainly utilize holistic features, whilst neglecti...
In recent years, scene parsing has captured increasing attention in computer vision. Previous works have demonstrated promising performance in this task. However, they mainly utilize holistic features, whilst neglecting the rich semantic knowledge and inter-object relationships in the scene. In addition, these methods usually require a large number of pixel-level annotations, which is too expensive in practice. In this paper, we propose a novel Knowledge Embedded Generative Adversarial Networks, dubbed as KE-GAN, to tackle the challenging problem in a semi-supervised fashion. KE-GAN captures semantic consistencies of different categories by devising a Knowledge Graph from the large-scale text corpus. In addition to readily-available unlabeled data, we generate synthetic images to unveil rich structural information underlying the images. Moreover, a pyramid architecture is incorporated into the discriminator to acquire multi-scale contextual information for better parsing results. Extensive experimental results on four standard benchmarks demonstrate that KE-GAN is capable of improving semantic consistencies and learning better representations for scene parsing, resulting in the state-of-the-art performance.
暂无评论