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

作者： Tang, Jianhua Quek, Tony Q. S. Chang, Tsung-Hui Shim, Byonghyo Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Normal University Changsha410081 China Institute of New Media and Communications Department of Electrical and Computer Engineering Seoul National University Seoul08826 Korea Republic of Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore Department of Electronic Engineering Kyung Hee University Yongin17104 Korea Republic of School of Science and Engineering Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen518172 China Department of Electrical and Computer Engineering Institute of New Media and Communications Seoul National University Seoul08826 Korea Republic of

Recently, cloud radio access network (C-RAN) with caching as a service (CaaS) was proposed to merge the functionalities of communication, computing, and caching (CCC) together. In this paper, we dissect the interactions of CCC in C-RAN with CaaS from two dimensions: physical resource dimension and time dimension. In the physical resource dimension, we identify how to segment the baseband unit (BBU) pool resources (i.e., computation and storage) into different types of virtual machines (VMs). In the time dimension, we address how the long-term resource segmentation in the BBU pool impacts on the short-term transmit beamforming at the remote radio heads. We formulate the problem as a stochastic mixed-integer nonlinear programming (SMINLP) to minimize the system cost, including the server cost, VM cost and wireless transmission cost. After a series of approximation, including sample average approximation, successive convex approximation, and semidefinite relaxation, the SMINLP is approximated as a global consensus problem. The alternating direction method of multipliers (ADMM) is utilized to obtain the solution in a parallel fashion. Simulation results verify the convergence of our proposed algorithm, and also confirm that the proposed scheme is more cost-saving than that without considering the integration of CCC. © 1972-2012 IEEE.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Exploring the Effect of Politeness on User Contribution in QA sites: A Case Study of Stack Overflow 22

Exploring the Effect of Politeness on User Contribution in Q...

引用

22nd IEEE International Conference on Computer Supported Cooperative Work in Design, CSCWD 2018

作者： Fangl, Yiru Lu, Tun Zhang, Peng Gu, Hansu Gu, Ning School of Computer Science Fudan University Shanghai China Shanghai Key Laboratory of Data Science Fudan University Shanghai China Seagate Technology LongmontCO United States Shanghai Institute of Intelligent Electronics and Systems China

ISBN: (纸本)9781538614822

Online question and answer (QA) sites are platforms allowing users to seek information or social support, which is sometimes socially uncomfortable. A major challenge in QA sites is how to encourage user contribution. Theory of linguistic politeness informs us that politeness is able to ease the tension resulting from face-threatening acts (FTA), and it is applicable to QA sites. However, Stack Overflow (SO), one of the most popular QA site for programmers, denies the use of linguistic politeness (e.g., greetings, salutations, and gratitude expressions), aiming at building a nonsocial platform. This paper focuses on a specific politeness strategy-expressing gratitude-in QA sites, and examines its effect on answerers' future contributions from the aspects of quality. Results indicate that gratitude expressions in comments can motivate answerers to generate higher quality content. © 2018 IEEE.

关键词： Linguistics

来源：评论

学校读者我要写书评

暂无评论

Scene Classification via Learning a Multi-Branch Convolutional Network

Scene Classification via Learning a Multi-Branch Convolution...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Xiaoyong Bian Chunfang Chen Yang Chen Xiongjun Fei Jingshan Tang Intelligent Information Processing and Real-time Industrial Systems Hubei Province Key Laboratory School of Computer Science and Technology Wuhan University of Science and Technology and Institute of Big Data Science and Engineering Wuhan University of Science and Technology Wuhan China School of Information Science and Engineering and Engineering Research Center for Metallurgical Automation and Measurement Technology of Ministry of Education Wuhan University of Science and Technology Wuhan China School of Technology Michigan Technological University Michigan USA

Efficient and accurate classification of high-resolution scene remains a challenge of within-class diversity and between-class similarity due to rich image variations in viewpoint, object pose, spatial resolution and background. To address these issues, we propose a multi-branch convolutional neural network (MB-CNN), which focuses on tackling the problem of learning the appropriate representation of a high-resolution scene that is rich enough to discriminate between different semantic classes. First, pyramid scene parsing network (PSPNet) with minor modification is introduced to gather global object information. Then, an attention net is proposed to highlight transformation invariance and key regions for attention feature extraction. Finally, above two branches are fused with original input branch to learn consistently semantic class information and generate powerful predictions. Our approach achieves better performance favorably against state-of-the-arts on two publicly available scene datasets.

关键词： Conferences Cybernetics

来源：评论

学校读者我要写书评

暂无评论

RETRACTED ARTICLE: An enhanced pairing-based authentication scheme for smart grid communications

引用

Journal of Ambient Intelligence and Humanized computing 2021年第1期15卷 165-165页

作者： Wu, Tsu-Yang Lee, Yu-Qi Chen, Chien-Ming Tian, Yuan Al-Nabhan, Najla Abdulrahman College of Computer Science and Engineering Shandong University of Science and Technology Qingdao China School of Information Science and Engineering Fujian University of Technology Fuzhou China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou China School of Computer Engineering Nanjing Institute of Technology Nanjing China Computer Science Department College of Computer and Information Sciences King Saud University Riyadh Kingdom of Saudi Arabia

来源：评论

学校读者我要写书评

暂无评论

EKT: Exercise-aware knowledge tracing for student performance prediction

arXiv

引用

arXiv 2019年

作者： Liu, Qi Huang, Zhenya Yin, Yu Chen, Enhong Xiong, Hui Su, Yu Hu, Guoping Anhui Province Key Laboratory of Big Data Analysis and Application School of Computer Science and Techonology University of Science and Technology of China Management Science and Information Systems Department Rutgers Business School State University of New Jersey Rutgers United States Iflytek Research Iflytek Co. Ltd Hefei Anhui000000 China

For offering proactive services (e.g., personalized exercise recommendation) to the students in computer supported intelligent education, one of the fundamental tasks is predicting student performance (e.g., scores) on future exercises, where it is necessary to track the change of each student's knowledge acquisition during her exercising activities. Unfortunately, to the best of our knowledge, existing approaches can only exploit the exercising records of students, and the problem of extracting rich information existed in the materials (e.g., knowledge concepts, exercise content) of exercises to achieve both more precise prediction of student performance and more interpretable analysis of knowledge acquisition remains underexplored. To this end, in this paper, we present a holistic study of student performance prediction. To directly achieve the primary goal of performance prediction, we first propose a general Exercise-Enhanced Recurrent Neural Network (EERNN) framework by exploring both student's exercising records and the text content of corresponding exercises. In EERNN, we simply summarize each student's state into an integrated vector and trace it with a recurrent neural network, where we design a bidirectional LSTM to learn the encoding of each exercise from its content. For making final predictions, we design two implementations on the basis of EERNN with different prediction strategies, i.e., EERNNM with Markov property and EERNNA with Attention mechanism. Then, to explicitly track student's knowledge acquisition on multiple knowledge concepts, we extend EERNN to an explainable Exercise-aware Knowledge Tracing (EKT) framework by incorporating the knowledge concept information, where the student's integrated state vector is now extended to a knowledge state matrix. In EKT, we further develop a memory network for quantifying how much each exercise can affect the mastery of students on multiple knowledge concepts during the exercising process. Finally, we con

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Adaptive Structure-Constrained Robust Latent Low-Rank Coding for Image Recovery

Adaptive Structure-Constrained Robust Latent Low-Rank Coding...

引用

IEEE International Conference on data Mining (ICDM)

作者： Zhao Zhang Lei Wang Sheng Li Yang Wang Zheng Zhang Zhengjun Zha Meng Wang School of Computer Science and Technology Soochow University Suzhou China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Computer Science University of Georgia Athens GA Bio-Computing Research Center Harbin Institute of Technology (Shenzhen) Shenzhen China School of Information Science and Technology University of Science and Technology of China Hefei China

In this paper, we propose a robust representation learning model called Adaptive Structure-constrained Low-Rank Coding (AS-LRC) for the latent representation of data. To recover the underlying subspaces more accurately, AS-LRC seamlessly integrates an adaptive weighting based block-diagonal structure-constrained low-rank representation and the group sparse salient feature extraction into a unified framework. Specifically, AS-LRC performs the latent decomposition of given data into a low-rank reconstruction by a block-diagonal codes matrix, a group sparse locality-adaptive salient feature part and a sparse error part. To enforce the block-diagonal structures adaptive to different real datasets for the low-rank recovery, AS-LRC clearly computes an auto-weighting matrix based on the locality-adaptive features and multiplies by the low-rank coefficients for direct minimization at the same time. This encourages the codes to be block-diagonal and can avoid the tricky issue of choosing optimal neighborhood size or kernel width for the weight assignment, suffered in most local geometrical structures-preserving low-rank coding methods. In addition, our AS-LRC selects the L2, 1-norm on the projection for extracting group sparse features rather than learning low-rank features by Nuclear-norm regularization, which can make learnt features robust to noise and outliers in samples, and can also make the feature coding process efficient. Extensive visualizations and numerical results demonstrate the effectiveness of our AS-LRC for image representation and recovery.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Sparse Model-inspired Deep Thresholding Network for Exponential Signal Reconstruction—Application in Fast Biological Spectroscopy

arXiv

引用

arXiv 2020年

作者： Wang, Zi Guo, Di Tu, Zhangren Huang, Yihui Zhou, Yirong Wang, Jian Feng, Liubin Lin, Donghai You, Yongfu Agback, Tatiana Orekhov, Vladislav Qu, Xiaobo Department of Electronic Science Biomedical Intelligent Cloud R&D Center Fujian Provincial Key Laboratory of Plasma and Magnetic Resonance National Institute for Data Science in Health and Medicine Xiamen University China School of Computer and Information Engineering Xiamen University of Technology Xiamen China College of Chemistry and Chemical Engineering Key Laboratory for Chemical Biology of Fujian Province High-field NMR Center Xiamen University Xiamen China China Mobile Group Xiamen China Biomedical Intelligent Cloud R&D Center Xiamen University Xiamen China Department of Molecular Sciences Swedish University of Agricultural Sciences Uppsala Sweden Department of Chemistry and Molecular Biology University of Gothenburg Gothenburg Sweden

The non-uniform sampling is a powerful approach to enable fast acquisition but requires sophisticated reconstruction algorithms. Faithful reconstruction from partial sampled exponentials is highly expected in general signal processing and many applications. Deep learning has shown astonishing potential in this field but many existing problems, such as lack of robustness and explainability, greatly limit its applications. In this work, by combining merits of the sparse model-based optimization method and data-driven deep learning, we propose a deep learning architecture for spectra reconstruction from undersampled data, called MoDern. It follows the iterative reconstruction in solving a sparse model to build the neural network and we elaborately design a learnable soft-thresholding to adaptively eliminate the spectrum artifacts introduced by undersampling. Extensive results on both synthetic and biological data show that MoDern enables more robust, high-fidelity, and ultra-fast reconstruction than the state-of-the-art methods. Remarkably, MoDern has a small number of network parameters and is trained on solely synthetic data while generalizing well to biological data in various scenarios. Furthermore, we extend it to an open-access and easy-to-use cloud computing platform (XCloud-MoDern), contributing a promising strategy for further development of biological applications. Copyright © 2020, The Authors. All rights reserved.

关键词： Signal reconstruction

来源：评论

学校读者我要写书评

暂无评论

Weakly supervised open-set domain adaptation by dual-domain collaboration

arXiv

引用

arXiv 2019年

作者： Tan, Shuhan Jiao, Jiening Zheng, Wei-Shi School of Data and Computer Science Sun Yat-sen University China School of Electronics and Information Technology Sun Yat-sen University China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China Accuvision Technology Co. Ltd.

In conventional domain adaptation, a critical assumption is that there exists a fully labeled domain (source) that contains the same label space as another unlabeled or scarcely labeled domain (target). However, in the real world, there often exist application scenarios in which both domains are partially labeled and not all classes are shared between these two domains. Thus, it is meaningful to let partially labeled domains learn from each other to classify all the unlabeled samples in each domain under an open-set setting. We consider this problem as weakly supervised open-set domain adaptation. To address this practical setting, we propose the Collaborative Distribution Alignment (CDA) method, which performs knowledge transfer bilaterally and works collaboratively to classify unlabeled data and identify outlier samples. Extensive experiments on the Office benchmark and an application on person reidentification show that our method achieves state-of-theart performance. Copyright © 2019, The Authors. All rights reserved.

关键词： Knowledge management

来源：评论

学校读者我要写书评

暂无评论

McDiarmid-Type inequalities for graph-dependent variables and stability bounds

arXiv

引用

arXiv 2019年

作者： Zhang, Rui Ray Liu, Xingwu Wang, Yuyi Wang, Liwei School of Mathematics Monash University Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences ETH Zurich Switzerland X-Order Lab China Key Laboratory of Machine Perception MOE School of EECS Peking University Center for Data Science

A crucial assumption in most statistical learning theory is that samples are independently and identically distributed (i.i.d.). However, for many real applications, the i.i.d. assumption does not hold. We consider learning problems in which examples are dependent and their dependency relation is characterized by a graph. To establish algorithm-dependent generalization theory for learning with non-i.i.d. data, we first prove novel McDiarmid-type concentration inequalities for Lipschitz functions of graph-dependent random variables. We show that concentration relies on the forest complexity of the graph, which characterizes the strength of the dependency. We demonstrate that for many types of dependent data, the forest complexity is small and thus implies good concentration. Based on our new inequalities we are able to build stability bounds for learning from graph-dependent data. Copyright © 2019, The Authors. All rights reserved.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Reversible data hiding in encrypted images with Two-MSB prediction 10

Reversible data hiding in encrypted images with Two-MSB pred...

引用

10th IEEE International Workshop on Information Forensics and Security, WIFS 2018

作者： Puyang, Yi Yin, Zhaoxia Qian, Zhenxing Key Laboratory of Intelligent Computing Signal Processing Ministry of Education Anhui University Hefei230601 China Department of Computer Science Purdue University West lafayette47906 United States Shanghai Institute for Advanced Communication and Data Science School of Communication and Information Engineering Shanghai University Shanghai200072 China

ISBN: (纸本)9781538665367

In recent years, reversible data hiding in encrypted images (RDHEI) that embeds additional data into the encrypted image content has received more and more attention. In previous RDHEI methods, there is no one considering the correlation between neighboring pixels. In this paper, to better explore the correlation between neighbor pixels, a novel reversible data hiding method in encrypted images with two-MSB (MSB and second MSB) prediction is proposed. After analyzing the original image content and detecting all the possible prediction errors, we encrypt the original image content using the bitwise exclusive-or (XOR) operation and highlight prediction error based on the error location binary map. Finally, all available pixels are embedded with additional data by two-MSB substitution. In our method, reversibility, separability and error-free data extraction are realized. The experimental results show that the proposed method providing a higher embedding rate and better quality of directly decrypted image compared with other start-of-the-art methods. © 2018 IEEE.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：