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

IEEE International Symposium on information (IT) in Medicine and Education, ITME

作者： Yiwei Zhang Sanhong Deng Yue Zhang Jia Kong School of Information Management Nanjing University Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing China Nanjing University Nanjing China

Research Purpose: The distributed, traceable and security of blockchain technology are applicable to the construction of new government information resource models, which could eliminate the barn effect and trust in government information sharing, as well as promoting the transformation of government affairs from management to service, it is also of great significance to the sharing of government information and construction of service-oriented e-government. Propose Methods: By analyzing the current problems of government information sharing, combined with literature research, this paper proposes the theoretical framework and advantages of blockchain technology applied to government information management and sharing, expounds the blockchain-based solution, it also constructs a government information sharing model based on blockchain, and gives implementation strategies at the technical and management levels. Results and Conclusion: The government information sharing model based on the blockchain solution and the transparency of government information can be used as a research framework for information interaction analysis between the government and users. It can also promote the construction and development of information sharing for Chinese government, as well as providing unified information sharing solution at the departmental and regional levels for e-government.

关键词： Blockchain information management Security Electronic government information services data engineering

来源：评论

学校读者我要写书评

暂无评论

Aerial Active STAR-RIS-assisted Satellite-Terrestrial Covert Communications

arXiv

引用

arXiv 2025年

作者： Zhang, Chuang Sun, Geng Li, Jiahui Wang, Jiacheng Zhang, Ruichen Niyato, Dusit Mao, Shiwen Quek, Tony Q.S. Computer Science and Technology Jilin University Changchun130012 China Singapore University of Technology and Design Singapore487372 Singapore College of Computer Science and Technology Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Department of Electrical and Computer Engineering Auburn University AuburnAL36849 United States Information System Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore

An integration of satellites and terrestrial networks is crucial for enhancing performance of next generation communication systems. However, the networks are hindered by the long-distance path loss and security risks in dense urban environments. In this work, we propose a satellite-terrestrial covert communication system assisted by the aerial active simultaneous transmitting and reflecting reconfigurable intelligent surface (AASTAR-RIS) to improve the channel capacity while ensuring the transmission covertness. Specifically, we first derive the minimal detection error probability (DEP) under the worst condition that the Warden has perfect channel state information (CSI). Then, we formulate an AASTAR-RIS-assisted satellite-terrestrial covert communication optimization problem (ASCCOP) to maximize the sum of the fair channel capacity for all ground users while meeting the strict covert constraint, by jointly optimizing the trajectory and active beamforming of the AASTAR-RIS. Due to the challenges posed by the complex and high-dimensional state-action spaces as well as the need for efficient exploration in dynamic environments, we propose a generative deterministic policy gradient (GDPG) algorithm, which is a generative deep reinforcement learning (DRL) method to solve the ASCCOP. Concretely, the generative diffusion model (GDM) is utilized as the policy representation of the algorithm to enhance the exploration process by generating diverse and high-quality samples through a series of denoising steps. Moreover, we incorporate an action gradient mechanism to accomplish the policy improvement of the algorithm, which refines the better state-action pairs through the gradient ascent. Simulation results demonstrate that the proposed approach significantly outperforms important benchmarks, and also validate the performance and practicality under different algorithm parameters and environment settings. Copyright © 2025, The Authors. All rights reserved.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Nonlinear Cross-Domain Feature Representation Learning Method Based on Dual Constraints

Nonlinear Cross-Domain Feature Representation Learning Metho...

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Han Ding Yuhong Zhang Shuai Yang Yaojin Lin Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Data Science and Intelligence Application Fujian Province University Zhangzhou China

Feature representation learning is a research focus in domain adaptation. Recently, due to the fast training speed, the marginalized Denoising Autoencoder (mDA) as a standing deep learning model has been widely utilized for feature representation learning. However, the training of mDA suffers from the lack of nonlinear relationship and does not explicitly consider the distribution discrepancy between domains. To address these problems, this paper proposes a novel method for feature representation learning, namely Nonlinear cross-domain Feature learning based Dual Constraints (NFDC), which consists of kernelization and dual constraints. Firstly, we introduce kernelization to effectively extract nonlinear relationship in feature representation learning. Secondly, we design dual constraints including Maximum Mean Discrepancy (MMD) and Manifold Regularization (MR) in order to minimize distribution discrepancy during the training process. Experimental results show that our approach is superior to several state-of-the-art methods in domain adaptation tasks.

关键词： Noise reduction Manifolds Training Adaptation models Kernel Deep learning Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Co-training Based on Semi-Supervised Ensemble Classification Approach for Multi-label data Stream

Co-training Based on Semi-Supervised Ensemble Classification...

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Zhe Chu Peipei Li Xuegang Hu Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education AnHui China School of Computer Science and Information Engineering Hefei University of Technology AnHui China

A large amount of data streams in the form of texts and images has been emerging in many real-world applications. These data streams often present the characteristics such as multi-labels, label missing and new class emerging, which makes the existing data stream classification algorithm face the challenges in precision space and time performance. This is because, on the one hand, it is known that data stream classification algorithms are mostly trained on all labeled single-class data, while there are a large amount of unlabeled data and few labeled data due to it is difficult to obtain labels in the real world. On the other hand, many of existing multi-label data stream classification algorithms mostly focused on the classification with all labeled data and without emerging new classes, and there are few semi-supervised methods. Therefore, this paper proposes a semi-supervised ensemble classification algorithm for multi-label data streams based on co-training. Firstly, the algorithm uses the sliding window mechanism to partition the data stream into data chunks. On the former w data chucks, the multi-label semi-supervised classification algorithm COINS based on co-training is used to training a base classifier on each chunk, and then an ensemble model with w COINS classifiers is generated ensemble model to adapt to the environment of data stream with a large number of unlabeled data. Meanwhile, a new class emerging detection mechanism is introduced, and the w+1 data chunk is predicted by the ensemble model to detect whether there is a new class emerging. When a new label is detected, the classifier is retrained on the current data chunk, and the ensemble model is updated. Finally, experimental results on five real data sets show that: as compared with the classical algorithms, the proposed approach can improve the classification accuracy of multi-label data streams with a large number of missing labels and new labels emerging.

关键词： data models Training Streaming media Adaptation models Partitioning algorithms Correlation knowledge engineering

来源：评论

学校读者我要写书评

暂无评论

Exploring Social Media data for MOOC Recommendation

Exploring Social Media Data for MOOC Recommendation

引用

International Conference on Systems of Collaboration (SysCo)

作者： Sara Assami Najima Daoudi Rachida Ajhoun Department of Computer Science Smart Systems Laboratory Mohammed Vth University Rabat Morocco Department of Data and Knowledge Engineering Information Sciences School (ESI) Rabat Morocco

ISBN: (数字)9781728142166

ISBN: (纸本)9781728142173

MOOCs (Massive Open Online Courses) are a key tool for open education stakeholders and high-level universities to face the problem of limited resources and make education accessible worldwide. Our study relies on the hypothesis of the influence of learning adaptation on the learners' lack of motivation in MOOCs. In this sense, a recommendation approach could stimulate the learner's interest in specific MOOCs. In previous research, we have identified the recommendation criteria to recommend MOOCs adapted to the learner's needs and motivations. Then, we modeled the ontology of the learning actors' profiles for the matching of the characteristics of learners with adapted MOOCs. Afterward, we designed the functional architecture and use cases of a semantic recommendation system to stimulate learners' interest in MOOCs. However, the recommendation process is still hindered by the learner profile on these platforms that doesn't represent the learner's interests and motivations. Yet, social media profiles extraction can be an external data source for learners' profile enrichment. So, the purpose of this research is to use social media mining for the acquisition of personal and professional data about learners. Therefore, we apply the first phases of data mining on a social media dataset to explore the potentially meaningful data for MOOC recommendation.

关键词： Social networking (online) data mining Educational courses Recommender systems Computer aided instruction

来源：评论

学校读者我要写书评

暂无评论

CitationAS： A Tool of Automatic Survey Generation Based on Citation Content

引用

Journal of data and information Science 2018年第2期3卷 20-37页

作者： jie wang chengzhi zhang mengying zhang sanhong deng School of Information Management Nanjing University Nanjing 210023 China Department of Information Management Nanjing University of Science and Technology Nanjing 210094 China Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing University Nanjing 210023 China

Purpose： This study aims to build an automatic survey generation tool, named CitationAS, based on citation content as represented by the set of citing sentences in the original ***/methodology/approach： Firstly, we apply LDA to analyse topic distribution of citation content. Secondly, in CitationAS, we use bisecting K-means, Lingo and STC to cluster retrieved citation content. Then Word2Vec, Word Net and combination of them are applied to generate cluster labels. Next, we employ TF-IDF, MMR, as well as considering sentence location information, to extract important sentences, which are used to generate surveys. Finally, we adopt manual evaluation for the generated ***： In experiments, we choose 20 high-frequency phrases as search terms. Results show that Lingo-Word2Vec, STC-Word Net and bisecting K-means-Word2Vec have better clustering effects. In 5 points evaluation system, survey quality scores obtained by designing methods are close to 3, indicating surveys are within acceptable limits. When considering sentence location information, survey quality will be improved. Combination of Lingo, Word2Vec, TF-IDF or MMR can acquire higher survey *** limitations： The manual evaluation method may have a certain subjectivity. We use a simple linear function to combine Word2Vec and Word Net that may not bring out their strengths. The generated surveys may not contain some newly created knowledge of some articles which may concentrate on sentences with no *** implications： CitationAS tool can automatically generate a comprehensive, detailed and accurate survey according to user’s search terms. It can also help researchers learn about research status in a certain ***/value： Citaiton AS tool is of practicability. It merges cluster labels from semantic level to improve clustering results. The tool also considers sentence location information when calculating sentence score by TF-IDF and MMR.

关键词： Automatic survey system Citation content Clustering algorithms Labelgeneration approaches Sentence extraction methods

来源：评论

学校读者我要写书评

暂无评论

Kernelized multiview subspace analysis by self-weighted learning

arXiv

引用

arXiv 2019年

作者： Wang, Huibing Wang, Yang Zhang, Zhao Fu, Xianping Wang, Meng College of Information and Science Technology Dalian Maritime University Dalian Liaoning116021 China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology China

—With the popularity of multimedia technology, information is always represented or transmitted from multiple views. Most of the existing algorithms are graph-based ones to learn the complex structures within multiview data but overlooked the information within data representations. Furthermore, many existing works treat multiple views discriminatively by introducing some hyperparameters, which is undesirable in practice. To this end, abundant multiview based methods have been proposed for dimension reduction. However, there are still no research to leverage the existing work into a unified framework. To address this issue, in this paper, we propose a general framework for multiview data dimension reduction, named Kernelized Multiview Subspace Analysis (KMSA). It directly handles the multi-view feature representation in the kernel space, which provides a feasible channel for direct manipulations on multiview data with different dimensions. Meanwhile, compared with those graph-based methods, KMSA can fully exploit information from multiview data with nothing to lose. Furthermore, since different views have different influences on KMSA, we propose a self-weighted strategy to treat different views discriminatively according to their contributions. A co-regularized term is proposed to promote the mutual learning from multi-views. KMSA combines self-weighted learning with the co-regularized term to learn appropriate weights for all views. We also discuss the influence of the parameters in KMSA regarding the weights of multi-views. We evaluate our proposed framework on 6 multiview datasets for classification and image retrieval. The experimental results validate the advantages of our proposed method. Copyright © 2019, The Authors. All rights reserved.

关键词： Multimedia systems

来源：评论

学校读者我要写书评

暂无评论

ALOR: Adaptive layout optimization of raft groups for heterogeneous distributed key-value stores 1

引用

15th IFIP International Conference on Network and Parallel Computing, NPC 2018

作者： Wang, Yangyang Chai, Yunpeng Wang, Xin Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing China School of Information Renmin University of China Beijing China College of Intelligence and Computing Tianjin University Tianjin China

ISBN: (数字)9783030056773

ISBN: (纸本)9783030056766

Many distributed key-value storage systems employ the simple and effective Raft protocol to ensure data consistency. They usually assume a homogeneous node hardware configuration for the underlying cluster and thus adopt even data distribution schemes. However, today’s distributed systems tend to be heterogeneous in nodes’ I/O devices due to the regular worn I/O device replacement and the emergence of expensive new storage media (e.g., non-volatile memory). In this paper, we propose a new data layout scheme called Adaptive Layout Optimization of Raft groups (ALOR), considering the hardware heterogeneity of the cluster. ALOR aims to optimize the data layout of Raft groups to achieve a better practical load balance, which leads to higher performance. ALOR consists of two components: leader migration in Raft groups and skewed data layout based on cold data migration. We conducted experiments on a practical heterogeneous cluster, and the results indicate that, on average, ALOR improves throughput by 36.89%, reduces latency and 99th percentile tail latency by 24.54% and 21.32%, respectively. © IFIP International Federation for information Processing 2018.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Residual network with delayed max pooling for very large scale plant identification 18

Residual network with delayed max pooling for very large sca...

引用

18th Working Notes of CLEF Conference and Labs of the Evaluation Forum, CLEF 2017

作者： Hang, Siang Thye Aono, Masaki Knowledge Data Engineering and Information Retrieval Laboratory Department of Computer Science and Engineering Toyohashi University of Technology Japan

In our approach, we applied a few modifications to the 50-layered Residual Network. Our preliminary experiments with the Plant-CLEF 2016 dataset showed that the modifications improved classification performance. We have trained three models based on the modified Residual Network configuration with different combinations of trusted and noisy PlantCLEF 2017 datasets. Using confidence scores extracted from the three models, we have submitted four runs and our methods showed competitive classification performance.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Dense residual network: Enhancing global dense feature flow for character recognition

arXiv

引用

arXiv 2020年

作者： Zhang, Zhao Tang, Zemin Wang, Yang Zhang, Zheng Zhan, Choujun Zha, Zhengjun Wang, Meng School of Computer Science and Information Engineering Hefei University of Technology Hefei230009 China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei230009 China School of Computer Science and Technology Soochow University Suzhou215006 China Shenzhen China School of Computer South China Normal University Guangzhou510631 China Deparmtment of Computer Science and Technology University of Science and Technology of China Hefei China

Deep Convolutional Neural Networks (CNNs), such as Dense Convolutional Network (DenseNet), have achieved great success for image representation learning by capturing deep hierarchical features. However, most existing network architectures of simply stacking the convolutional layers fail to enable them to fully discover local and global feature information between layers. In this paper, we mainly investigate how to enhance the local and global feature learning abilities of DenseNet by fully exploiting the hierarchical features from all convolutional layers. Technically, we propose an effective convolutional deep model termed Dense Residual Network (DRN) for the task of optical character recognition. To define DRN, we propose a refined residual dense block (r-RDB) to retain the ability of local feature fusion and local residual learning of original RDB, which can reduce the computing efforts of inner layers at the same time. After fully capturing local residual dense features, we utilize the sum operation and several r-RDBs to construct a new block termed global dense block (GDB) by imitating the construction of dense blocks to adaptively learn global dense residual features in a holistic way. Finally, we use two convolutional layers to design a down-sampling block to reduce the global feature size and extract more informative deeper features. Extensive results show that our DRN can deliver enhanced results, compared with other related deep models. Copyright © 2020, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：