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

作者： Long, Min Peng, Fei Li, Han-yun College of Computer and Communication Engineering Changsha University of Science and Technology ChangshaHunan China Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology ChangshaHunan410114 China College of Computer Science and Electronic Engineering Hunan University ChangshaHunan China

A separable reversible data hiding and encryption for high efficiency video coding (HEVC) video is proposed in this paper. In the encoding phase, one can encrypt the signs and amplitudes of motion vector differences and the signs of residual coefficients with an encryption key by using RC4, while another can hide data into nonzero AC residual coefficients with a hiding key. For the decoding phase, one can decrypt the HEVC video and obtain a HEVC video similar to the original one if he only has the encryption key;he can extract the hiding data, but he does not know the HEVC video content if he only has the hiding key;he can extract the hiding data and recover the original HEVC video if he has both the encryption key and hiding key. Experimental results and analysis show that the proposed scheme can obtain a good security performance and keep the HEVC video stream format compliant. © 2017, Springer-Verlag GmbH Germany.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

MIXGAN: Learning concepts from different domains for mixture generation

arXiv

引用

arXiv 2018年

作者： Hao, Guang-Yuan Yu, Hong-Xing Zheng, Wei-Shi School of Data and Computer Science Sun Yat-sen University China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China Collaborative Innovation Center of High Performance Computing NUDT China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China

In this work, we present an interesting attempt on mixture generation: absorbing different image concepts (e.g., content and style) from different domains and thus generating a new domain with learned concepts. In particular, we propose a mixture generative adversarial network (MIXGAN). MIXGAN learns concepts of content and style from two domains respectively, and thus can join them for mixture generation in a new domain, i.e., generating images with content from one domain and style from another. MIXGAN overcomes the limitation of current GAN-based models which either generate new images in the same domain as they observed in training stage, or require off-theshelf content templates for transferring or translation. Extensive experimental results demonstrate the effectiveness of MIXGAN as compared to related state-of-the-art GAN-based models. Copyright © 2018, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Flickr group recommendation with auxiliary information in heterogeneous information networks

Flickr group recommendation with auxiliary information in he...

引用

作者： Wang, Yueyang Xia, Yuanfang Tang, Siliang Wu, Fei Zhuang, Yueting Key Laboratory of Big Data Intelligent Computing of Zhejiang Province Innovation Joint Research Center for ICPS College of Computer Science and Technology Zhejiang University Hangzhou China

Over the past few years, the appropriate utilization of user communities or image groups in social networks (i.e., Flickr or Facebook) has drawn a great deal of attention. In this paper, we are particularly interested in recommending preferred groups to users who may favor according to auxiliary information. In real world, the images captured by mobile equipments explicitly record a lot of contextual information (e.g., locations) about users generating images. Meanwhile, several words are employed to describe the particular theme of each group (e.g., "Dogs for Fun Photos" image group in Flickr), and the words may mention particular entities as well as their belonging categories (e.g., "Animal"). In fact, the group recommendation can be conducted in heterogeneous information networks, where informative cues are in general multi-typed. Motivated by the assumption that the auxiliary information (visual features of images, mobile contextual information and entity-category information of groups in this paper) in heterogeneous information networks will boost the performance of the group recommendation, this paper proposes to combine auxiliary information with implicit user feedback for group recommendation. In general, the group recommendation in this paper is formulated as a non-negative matrix factorization (NMF) method regularized with user–user similarity via visual features and heterogeneous information networks. Experiments show that our proposed approach outperforms other counterpart recommendation approaches. © 2016, Springer-Verlag Berlin Heidelberg.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

Network Traffic Outlier Detection Based on Full Convolutional Network

Network Traffic Outlier Detection Based on Full Convolutiona...

引用

International Conference on Computational Intelligence and Security

作者： Jingrong Mo Yong Wang Miao Ye School of Computer Science and Information Security Guilin University of Electronic Technology Guilin Guangxi China Guangxi Cooperative Innovation Center of Cloud Computing and Big Data Guilin University of Electronic Technology Guilin Guangxi China Guangxi Colleges and Universities Key Laboratory of Cloud Computing and Complex Systems Guilin University of Electronic Technology Guilin Guangxi China School of Information and Communication Guilin University of Electronic Technology Guilin Guangxi China

ISBN: (数字)9781728160924

ISBN: (纸本)9781728160931

Network traffic flow can be represented as time series. Outliers of these time series is important for the computer network security. The existing methods for the time series anomaly detection mainly operate on the entire time series to detect the abnormal series, seldom find out the position of the abnormal point. To solve this defect, we propose a method to discover the location of the outliers in time series based on a full convolutional network. We first map the time series into two-dimensional grayscale images by sliding window approach, and then feed them into the full convolutional network. In the classified stage, the feature maps of the last convolution layer are restored to the same size as the input image by up-sampling. Finally, we predict the class for each pixel and calculate the loss on a pixel-by-pixel basis. We tested the model on Yahoo Webscope S5 anomaly benchmark dataset, and the results show that our proposed method can achieve a mean pixel accuracy of 99.4% and mean IOU of 97% on the test dataset.

关键词： Time series analysis Telecommunication traffic Anomaly detection Convolution Feature extraction Gray-scale Machine learning

来源：评论

学校读者我要写书评

暂无评论

MFPR: A Personalized Ranking Recommendation with Multiple Feedback

引用

ACM Transactions on Social computing 2018年第2期1卷 1–22页

作者： Shi, Chuan Liu, Jian Zhang, Yiding Hu, Binbin Liu, Shenghua Yu, Philip S. Beijing Key Lab of Intelligent Telecommunication Software and Multimedia Beijing University of Posts and Telecommunications No. 10 Xi Tu Cheng Road Beijing China Cas Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences No.6 Kexueyuan South Road Zhongguancun Beijing China Department of Computer Science University of Illinois at Chicago 851 South Morgan Street Chicago United States

Recently, recommender systems have played an important role in improving web user experiences and increasing profits. Recommender systems exploit users' behavioral history (i.e., feedback on items) to build models. The feedback usually includes explicit feedback (e.g., ratings) and implicit feedback (e.g., browsing history, click logs), which are both useful for improving recommendations. However, as far as we are concerned, no existing works have integrated both explicit and multiple implicit feedback simultaneously. Therefore, we propose a unified and flexible model, named Multiple Feedback-based Personalized Ranking (MFPR), to make full use of multiple feedback, which uses a personalized ranking framework. To train model MFPR, we design an algorithm to generate ordered item pairs as labeled data, with consideration of both rating scores and multiple implicit feedback. Extensive experiments on two real-world datasets validate the effectiveness of the MFPR model. With the integration of multiple feedback, MFPR significantly improves recommendation performance. © 2018 ACM.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

User Behavior Analysis of Location-Based Social Network

User Behavior Analysis of Location-Based Social Network

引用

IIAI International Conference on Advanced Applied Informatics (IIAIAAI)

作者： Jun Zeng Xin He Yingbo Wu Sachio Hirokawa Key Laboratory of Dependable Service Computing in Cyber Physical Society School of Big Data and Software Engineering Chongqing China School of Big Data and Software Engineering Chongqing China Research Institute for Information Technology Kyushu University Fukuoka Japan

ISBN: (纸本)9781538674482;9781538674475

User behavior changes over time under the influence of their activities. We contend that these activities are non-random behavior and have a desire to explore the underlying information behind these changes. In this paper, we analyze user behavior by using the check-in data in Location Based Social Networks (LBSNs), and examine whether they have the features of trend, periodicity and surprise or not. We explore some dynamics behaviors of people through their check-in times, and divide time into annually, monthly and even weekly analysis to find out the pattern of their behavior. Eventually, we found the check-in data do exhibit these three features by analyzing them deeply. The analytical work lays the foundation for the further recommendation research.

关键词： Market research Social networking (online) big data Software engineering Accidents Trajectory Motion pictures

来源：评论

学校读者我要写书评

暂无评论

Reversible Natural Language Watermarking Using Synonym Substitution and Arithmetic Coding

引用

Computers, Materials & Continua 2018年第6期55卷 541-559页

作者： Lingyun Xiang Yan Li Wei Hao Peng Yang Xiaobo Shen Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and TechnologyChangsha 410114HunanChina School of Computer and Communication Engineering Changsha University of Science and TechnologyChangsha 410114HunanChina School of Traffic&Transportation Engineering Changsha University of Science&TechnologyChangsha 410114HunanChina Hunan Branch of CNCERT/CC Changsha 410004HunanChina School of Computer Science and Engineering Nanyang Technological University639798Singapore

For protecting the copyright of a text and recovering its original content harmlessly,this paper proposes a novel reversible natural language watermarking method that combines arithmetic coding and synonym substitution *** analyzing relative frequencies of synonymous words,synonyms employed for carrying payload are quantized into an unbalanced and redundant binary *** quantized binary sequence is compressed by adaptive binary arithmetic coding losslessly to provide a spare for accommodating additional ***,the compressed data appended with the watermark are embedded into the cover text via synonym substitutions in an invertible *** the receiver side,the watermark and compressed data can be extracted by decoding the values of synonyms in the watermarked text,as a result of which the original context can be perfectly recovered by decompressing the extracted compressed data and substituting the replaced synonyms with their original *** results demonstrate that the proposed method can extract the watermark successfully and achieve a lossless recovery of the original ***,it achieves a high embedding capacity.

关键词： Arithmetic coding synonym substitution lossless compression reversible watermarking.

来源：评论

学校读者我要写书评

暂无评论

Privacy Preserving Scheme for Location Based Services Using Cryptographic Approach 2

Privacy Preserving Scheme for Location Based Services Using ...

引用

2nd IEEE Symposium on Privacy-Aware computing, PAC 2018

作者： Pu, Yuwen Luo, Jin Wang, Ying Hu, Chunqiang Huo, Yan Zhang, Jiong School of Big Data and Software Engineering Chongqing University Chongqing China Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education Chongqing University Chongqing China School of Electronic and Information Engineering Beijing Jiaotong University Beijing China Ningbo Branch of Agricultural Bank of China Ningbo China

ISBN: (纸本)9781538684429

Location based services pose strong security and privacy requirements but achieving privacy protection at the client side is a non-trial problem. In this paper, we propose an efficient and reliable location privacy preserving scheme using cryptographic approach. It can preserve users' privacy data by making their identity be anonymity for LBS provider and fog server. For communication, both AES with One-Time-Pad keys and IBE are employed to guarantee confidentiality and integrity of request and response data. Besides, we also provide security analysis to demonstrate that our scheme can resist internal attack, external attack and colluding attack. © 2018 IEEE.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

Improved Upper Bound on the Network Function computing Capacity

Improved Upper Bound on the Network Function Computing Capac...

引用

作者： Guang, Xuan Yeung, Raymond W. Yang, Shenghao Li, Congduan School of Mathematical Sciences and LPMC Nankai University Tianjin300071 China Institute of Network Coding Chinese University of Hong Kong Hong Kong Hong Kong Department of Information Engineering Chinese University of Hong Kong Hong Kong Hong Kong School of Science and Engineering Chinese University of Hong Kong Shenzhen518172 China Shenzhen Key Laboratory of IoT Intelligent Systems and Wireless Network Technology Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen518172 China School of Electronics and Communication Engineering Sun Yat-sen University Guangzhou510006 China

The problem of network function computation over a directed acyclic network is investigated in this paper. In such a network, a sink node desires to compute with zero error a target function, of which the inputs are generated at multiple source nodes. The edges in the network are assumed to be error-free and have limited capacity. The nodes in the network are assumed to have unbounded computing capability and be able to perform network coding. The computing rate of a network code that can compute the target function over the network is the average number of times that the target function is computed with zero error for one use of the network. In this paper, we obtain an improved upper bound on the computing capacity, which is applicable to arbitrary target functions and arbitrary network topologies. This improved upper bound not only is an enhancement of the previous upper bounds but also is the first tight upper bound on the computing capacity for computing an arithmetic sum over a certain non-tree network, which has been widely studied in the literature. We also introduce a multi-dimensional array approach that facilitates evaluation of the improved upper bound. Furthermore, we apply this bound to the problem of computing a vector-linear function over a network. With this bound, we are not only able to enhance a previous result on computing a vector-linear function over a network but also simplify the proof significantly. Finally, we prove that for computing the binary maximum function over the reverse butterfly network, our improved upper bound is not achievable. This result establishes that in general our improved upper bound is non-achievable, but whether it is asymptotically achievable or not remains open. © 1963-2012 IEEE.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Mobile laser scanning systems for GPS/GNSS-denied environment mapping

Mobile laser scanning systems for GPS/GNSS-denied environmen...

引用

2018 ISPRS Technical Commission I Midterm Symposium on Innovative Sensing - From Sensors to Methods and Applications

作者： Wen, Chenglu Xia, Yan Lian, Yuhan Dai, Yudi Tan, Jinbin Wang, Cheng Li, Jonathan Fujian Key Laboratory of Sensing and Computing for Smart City School of Information Science and Engineering Xiamen University Xiamen361005 China Fujian Collaborative Innovation Center for Big Data Applications in Governments Fuzhou350003 China Faculty of Environment University of Waterloo WaterlooONN2L 3G1 Canada

Indoor 3D mapping provides a useful three-dimensional structure via an indoor map for many applications. To acquire highly efficient and relatively accurate mapping for large-scale GPS/GNSS-denied scene, we present an upgraded backpacked laser scanning system and a car-mounted indoor mobile laser scanning system. The systems provide both 3D laser scanning point cloud and camera images. In this paper, a simultaneous extrinsic calibration approach for multiple multi-beam LIDAR and multiple cameras is also proposed using the Simultaneous Localization and Mapping (SLAM)-based algorithm. The proposed approach uses the SLAM-based algorithm to achieve a large calibration scene using mobile platforms, registers an acquired multi-beam LIDAR point cloud to the terrestrial LIDAR point cloud to acquire denser points for corner feature extraction, and finally achieves simultaneous calibration. With the proposed mapping and calibration algorithms, we can provide centimetre-lever coloured point cloud with relatively high efficiency and accuracy. © Authors 2018. CC BY 4.0 License.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：