检索结果-内蒙古大学图书馆

Personalized travel sequence recommendation on multi-source big social media

IEEE Transactions on Big Data 2016年第1期2卷 43-56页

作者： Jiang, Shuhui Qian, Xueming Mei, Tao Fu, Yun Department of Electrical and Computer Engineering College of Engineering Northeastern University BostonMA02115 United States Key Laboratory for Intelligent Networks and Network Security Ministry of Education Xi'an Jiaotong University Xi'an710049 China Department of Electrical and Computer Engineering College of Computer and Information Science Northeastern University BostonMA02115 United States Microsoft Research Asia Beijing100080 China

Big data increasingly benefit both research and industrial area such as health care, finance service and commercial recommendation. This paper presents a personalized travel sequence recommendation from both travelogues and community-contributed photos and the heterogeneous metadata (e.g., tags, geo-location, and date taken) associated with these photos. Unlike most existing travel recommendation approaches, our approach is not only personalized to user's travel interest but also able to recommend a travel sequence rather than individual Points of Interest (POIs). Topical package space including representative tags, the distributions of cost, visiting time and visiting season of each topic, is mined to bridge the vocabulary gap between user travel preference and travel routes. We take advantage of the complementary of two kinds of social media: travelogue and community-contributed photos. We map both user's and routes' textual descriptions to the topical package space to get user topical package model and route topical package model (i.e., topical interest, cost, time and season). To recommend personalized POI sequence, first, famous routes are ranked according to the similarity between user package and route package. Then top ranked routes are further optimized by social similar users' travel records. Representative images with viewpoint and seasonal diversity of POIs are shown to offer a more comprehensive impression. We evaluate our recommendation system on a collection of 7 million Flickr images uploaded by 7,387 users and 24,008 travelogues covering 864 travel POIs in nine famous cities, and show its effectiveness. We also contribute a new dataset with more than 200 K photos with heterogeneous metadata in nine famous cities. © 2015 IEEE.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

On error linear complexity of new generalized cyclotomic binary sequences of period p2

arXiv

引用

arXiv 2017年

作者： Wu, Chenhuang Xu, Chunxiang Chen, Zhixiong Ke, Pinhui School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu611731 China Provincial Key Laboratory of Applied Mathematics Putian University PutianFujian351100 China Fujian Provincial Key Laboratory of Network Security and Cryptology College of Mathematics and Informatics Fujian Normal University Fuzhou Fujian350117 China

We consider the k-error linear complexity of a new binary sequence of period p2, proposed in the recent paper "New generalized cyclotomic binary sequences of period p2", by Z. Xiao et al., who calculated the linear complexity of the sequences (Designs, Codes and Cryptography, 2017, https://***/10.1007/s10623-017-0408-7). More exactly, we determine the values of k-error linear complexity over F2 for almost k 0 in terms of the theory of Fermat quotients. Results indicate that such sequences have good *** Codes 94A60, 11K45, 11L40 Copyright © 2017, The Authors. All rights reserved.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient Base Station On/Off with User Association under C/U Split

Energy Efficient Base Station On/Off with User Association u...

引用

Wireless Communications and networking Conference

作者： Haimeng Wu Xiaodong Xu Yan Sun Aini Li National Engineering Laboratory for Mobile Network Security Beijing University of Posts and Telecommunications School of Electronic Engineering and Computer Science Queen Mary University of London

ISBN: (纸本)9781509041848

The mobile traffic explosion leads to dense deployed heterogeneous networks that can support peak time traffic. However, the utilization of base stations (BSs) is very inefficient during off-peak time due to the traditional strategy, which associates users with BSs based only on the received signal power. In this paper, we investigate the problem and design the joint cell switching-on/off with user association to maximize the network EE. During modeling the optimization problem, we consider the quality-of-service requirements of users and inter-cell interferences under the control plane (CP) and user plane (UP) split. The constraints between the CP and UP are considered. Since the optimization problem belongs to inter programming problem and is NP-hard, we propose a heuristic algorithm named DSUA, to maximize the system EE step by step. The DSUA algorithm deactivates the unnecessary BSs into sleep mode and constructs the user association with the active BSs. Simulation results show that the proposed algorithm can improve the network EE, especially in the light traffic load scenario.

关键词： dense heterogeneous networks energy efficiency sleep mode user association control plane/user plane split

来源：评论

学校读者我要写书评

暂无评论

A community-powered search of machine learning strategy space to find NMR property prediction models

arXiv

引用

arXiv 2020年

作者： Bratholm, Lars A. Gerrard, Will Anderson, Brandon Bai, Shaojie Choi, Sunghwan Dang, Lam Hanchar, Pavel Howard, Addison Huard, Guillaume Kim, Sanghoon Kolter, Zico Kondor, Risi Kornbluth, Mordechai Lee, Youhan Lee, Youngsoo Mailoa, Jonathan P. Nguyen, Thanh Tu Popovic, Milos Rakocevic, Goran Reade, Walter Song, Wonho Stojanovic, Luka Thiede, Erik H. Tijanic, Nebojsa Torrubia, Andres Willmott, Devin Butts, Craig P. Glowacki, David R. Participants, Kaggle School of Chemistry University of Bristol Cantock’s Close BristolBS8 1TS United Kingdom School of Mathematics University of Bristol Fry Building Woodland Road BristolBS1 1UG United Kingdom Dept. of Computer Science University of Bristol Merchant Venturer’s Building BristolBS8 1UB United Kingdom Intangible Realities Laboratory University of Bristol Cantock’s Close BristolBS8 1TS United Kingdom Bosch Center for Artificial Intelligence PittsburghPA15222 United States Carnegie Mellon University PittsburghPA15213 United States National Institute of Supercomputing and Network Korea Institute of Science and Technology Information 245 Daehak-ro Yuseong-gu Daejeon34141 Korea Republic of BNP Paribas Cardif Fyusion Inc. Kaggle Google Inc. Mountain View United States Ebay Korea 34F Gangnam Finance Center 152 Teheran Ro Gangnam Gu Seoul Korea Republic of Department of Computer Science University of Chicago 5730 S Ellis Ave ChicagoIL60637 United States Department of Statistics University of Chicago 5747 S Ellis Ave ChicagoIL60637 United States Center for Computational Mathematics Flatiron Institute 162 5th Ave. New YorkNY10010 United States Bosch Research and Technology Center CambridgeMA02139 United States Department of Chemical and Biomolecular Engineering Korea Advanced Institute of Science and Technology 291 Daehak-ro Yuseong-gu Daejeon34141 Korea Republic of 111 Daedeok-daero 989beon-gil Yuseong-gu Daejeon Korea Republic of MINDS AND COMPANY 2621 Nambusunhwan-ro Gangnam-gu Seoul06267 Korea Republic of Totient Inc Sindjeliceva 9 Belgrade11000 Serbia KAIST Web Security & Privacy Lab 291 Daehak-ro Yuseong-guDaejeon34141 Korea Republic of *** Alicante Spain

The rise of machine learning (ML) has created an explosion in the potential strategies for using data to make scientific predictions. For physical scientists wishing to apply ML strategies to a particular domain, it can be difficult to assess in advance what strategy to adopt within a vast space of possibilities. Here we outline the results of an online community-powered effort to swarm search the space of ML strategies and develop algorithms for predicting atomic-pairwise nuclear magnetic resonance (NMR) properties in molecules. Using an open-source dataset, we worked with Kaggle to design and host a 3-month competition which received 47,800 ML model predictions from 2,700 teams in 84 countries. Within 3 weeks, the Kaggle community produced models with comparable accuracy to our best previously published ‘in-house’ efforts. A meta-ensemble model constructed as a linear combination of the top predictions has a prediction accuracy which exceeds that of any individual model, 7-19x better than our previous state-of-the-art. The results highlight the potential of transformer architectures for predicting quantum mechanical (QM) molecular properties. Copyright © 2020, The Authors. All rights reserved.

关键词： Nuclear magnetic resonance

来源：评论

学校读者我要写书评

暂无评论

A geometric image segmentation method based on a bi-convex, fuzzy, variational principle with teaching-learning optimization

A geometric image segmentation method based on a bi-convex, ...

引用

作者： Jin, Haiyan Li, Yaning Xing, Bei Wang, Lei Department of Computer Science and Engineering Xi'An University of Technology No. 5 South Jinhua Road Xi'an Shaanxi710048 China Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an China

This paper proposes an efficient, bi-convex, fuzzy, variational (BFV) method with teaching and learning based optimization (TLBO) for geometric image segmentation. Firstly, we adopt a bi-convex, object function to process a geometric image. Then, we introduce TLBO to maximally optimize the length-penalty item, which will be changed under the teaching phase and the learner phase of the TLBO. This makes the length penalty item closer to the target boundary. Therefore, the length-penalty item can be automatically adjusted according to the fitness function, namely the evaluation standards of the image quality. At last, we combine the length-penalty item with the numerical remedy mechanism to achieve better results. Compared with existing methods, simulations show that our method is more effective. © 2016 - IOS Press and the authors. All rights reserved.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Continuous-variable measurement-device-independent quantum key distribution with virtual photon subtraction

arXiv

引用

arXiv 2017年

作者： Zhao, Yijia Zhang, Yichen Xu, Bingjie Yu, Song Guo, Hong State Key Laboratory of Information Photonics and Optical Communications Beijing University of Posts and Telecommunications Beijing100876 China State Key Laboratory of Advanced Optical Communication System and Network School of Electronics Engineering and Computer Science Center for Quantum Information Technology Peking University Beijing100871 China Science and Technology on Security Communication Laboratory Institute of Southwestern Communication Chengdu610041 China

The method of improving the performance of continuous-variable quantum key distribution protocols by post-selection has been recently proposed and verified. In continuous-variable measurement-device-independent quantum key distribution (CV-MDI QKD) protocols, the measurement results are obtained from untrusted third party Charlie. There is still not an effective method of improving CV-MDI QKD by the post-selection with untrusted measurement. We propose a method to improve the performance of coherent-state CV-MDI QKD protocol by virtual photon subtraction via non-Gaussian post-selection. The non-Gaussian post-selection of transmitted data is equivalent to an ideal photon subtraction on the two-mode squeezed vacuum state, which is favorable to enhance the performance of CV-MDI QKD. In CV-MDI QKD protocol with non-Gaussian post-selection, two users select their own data independently. We demonstrate that the optimal performance of the renovated CV-MDI QKD protocol is obtained with the transmitted data only selected by Alice. By setting appropriate parameters of the virtual photon subtraction, the secret key rate and tolerable excess noise are both improved at long transmission distance. The method provides an effective optimization scheme for the application of CV-MDI QKD protocols. Copyright © 2017, The Authors. All rights reserved.

关键词： Quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

On the k-error linear complexity of generalised cyclotomic sequences

引用

International Journal of High Performance Computing and networking 2016年第5-6期9卷 394-400页

作者： Liu, Longfei Yang, Xiaoyuan Du, Xiaoni Wei, Bin Key Laboratory of Network and Information Security of APF Engineering College of APF Xi'an710086 China Key Laboratory of Computer Network and Information Security of the Ministry of Education Xidian University Xi'an710071 China

Generalised cyclotomic binary sequences are divided into Whiteman-generalised cyclotomic and Ding-generalised cyclotomic. Firstly, two classes of error generalised cyclotomic sequences with length pq over Zpq are constructed;secondly, k-error linear complexity of generalised cyclotomic sequences are considered, using the trace representation and cyclotomic theory, respectively. It is shown that k-error linear complexity of generalised cyclotomic sequences do not exceed p + q-1 which is much less than the (zero-error) linear complexity. Copyright © 2016 Inderscience Enterprises Ltd.

关键词： Binary sequences

来源：评论

学校读者我要写书评

暂无评论

A secure route optimization mechanism for expressive internet architecture (XIA) mobility

A secure route optimization mechanism for expressive interne...

引用

作者： Meng, Hongwei Chen, Zhong Meng, Ziqian Song, Chuck School of Electronics Engineering and Computer Science Key Laboratory of High Confidence Software Technologies Ministry of Education MoE Key Laboratory of Network and Software Security Assurance Peking University Beijing China Carnegie Mellon University Pittsburgh United States

Motivated by the natural features of ID/location decoupling and self-certifying in Expressive Internet Architecture (XIA), we designs a secure mechanism to protect the binding update message for route optimization in XIA mobility. The proposed mechanism protects the vulnerabilities by combining identity authentication and reachability verification. Meanwhile, in order to reduce the signaling overhead in the following movement of the mobile node, we divide the routing optimization procedure into two phases and replace the public-key cryptography with hashing operation to authenticate the subsequent binding update messages. The analysis shows that our protocol is efficient, especially for nodes that move frequently and the movement can be predicted. © Springer International Publishing Switzerland 2016.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

Performance of Resampling Algorithms Based on Particle Filter in Video Target Tracking

引用

Journal of Donghua University(English Edition) 2016年第5期33卷 745-748页

作者：韩华王裕明张玉金胡一帆 School of Electronic and Electrical Engineering Shanghai University of Engineering Science Shanghai 201620 China Shanghai Key Laboratory of Integrated Administration Technologies for Information Security Shanghai 201203 China Shandong Provincial Key Laboratory of Computer Network Jinan 250014 China Shandong Computer Science Center (National Supercomputer Center in Jinan ) Jinan 250014 China

Particle filter is a common algorithm in video target *** there are still some shortcomings,for example,particle degradation *** solving this problem,the general solution is to introduce resampling *** present,four kinds of resampling algorithms are widely used:multinomial resampling,residual resampling,stratified resampling and systematic resampling *** this paper,the performances of these four resampling algorithms were analyzed from realization principle,uniform distribution theory and computational ***,through a series of video target tracking experiments,the systematic resampling algorithm had the smallest calculation load,the shortest running time and the maximum number of effective ***,it can be concluded that in the field of video target tracking,the systematic resampling algorithm has more advantages than other three algorithms both in the running time and the number of effective particles.

关键词： Tracking running shortcomings realization overcome stratified shortest smallest steps overlapping

来源：评论

学校读者我要写书评

暂无评论

LC-KDE: A novel scheme for Wi-Fi localization

LC-KDE: A novel scheme for Wi-Fi localization

引用

International Symposium on Wireless Personal Multimedia Communications (WPMC)

作者： Hao Chen Yifan Zhang Wei Li Xiaofeng Tao Ping Zhang National Engineering Laboratory for Mobile Network Security Beijing University of Posts and Telecommunications Department of Electrical and Computer Engineering University of Victoria

ISBN: (纸本)9781509053773

Signal strength difference (SSD) is widely utilized as the feature for Wi-Fi fingerprint localization to tackle the heterogeneity between training device and target device, but the correlation between SSDs is largely ignored. In this paper, a novel scheme named LC-KDE is proposed. It utilizes local Fisher discriminant analysis (LFDA) to transform the original SSDs into weakly correlated features, with which the SSD selection process is eliminated and the complexity of model training is reduced. Moreover, a compressed version of multivariate kernel density estimation (mKDE) is adopted to avoid over-fitting when training the probability density function (PDF) of the features. To validate the practical performance of LC-KDE, an experiment system is developed using commercial devices and measurements are conducted in an indoor setting. The results indicate LC-KDE provides superior performance compared to existing methods.

关键词： Training Wireless fidelity Mathematical model Correlation Kernel Feature extraction Calibration

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：