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

MiTAR:a study on human activity recognition based on NLP with microscopic perspective

Frontiers of computer science 2021年第5期15卷 93-110页

作者： Huichao MEN Botao WANG Gang WU School of Computer Science and Engineering Northeastern UniversityShenyang 110000China State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210000China

Nowadays,human activity recognition is becoming a more and more significant topic,and there is also a wide range of applications for it in real world *** data is an important data source in engineering and *** present,some studies have been carried out in the field of human activity recognition based on sensor data in a macroscopic ***,many studies in this perspective face some *** pivotal limitation is uncontrollable data segment length of different kinds of *** feature and data form are also influencing *** paper carries out the study creatively on a microscopic perspective with an emphasis on the logic and relevance between data segments,attempting to apply the idea of natural language processing and the method of data symbolization to the study of human activity recognition and try to solve the problem *** this paper,several activity-element definitions and three algorithms are proposed,including the algorithm of dictionary building,the algorithm of corpus building,and activity recognition algorithm improved from a natural language analysis method,*** experiments on different aspects of this model are *** experiments are carried out on six complex and representative single-level sensor datasets,namely UCI Sports and Daily dataset,Skoda dataset,WISDM Phoneacc dataset,WISDM Watchacc dataset,Healthy Older People dataset and HAPT dataset,which prove that this model can be applied to different datasets and achieve a satisfactory recognition result.

关键词： human activity recognition NLP time series data analysis data symbolization

来源：评论

学校读者我要写书评

暂无评论

Emergency Transportation and Structural Prediction and Optimization of Goods Based on ARIMA and Multi-objective E-commerce Logistics Network Model 1

Emergency Transportation and Structural Prediction and Optim...

引用

1st IEEE International Conference on Applied Intelligence and Sustainable Computing, ICAISC 2023

作者： Nie, Yiyang Chen, Xiang Wu, Xuanli Deng, Zihao Hunan University of Science and Technology School of Computer Science and Engineering Xiangtan China Hunan Key Laboratory for Service Computing and Novel Software Technology Xiangtan China Hunan University of Science and Technology Shcool of Mathematics and Computational Science Xiangtan China

ISBN: (纸本)9798350323795

With the development of the internet, online shopping has gradually become a popular way of shopping among the general public, which in turn poses a greater challenge to the e-commerce logistics network. Predicting the volume of goods for each logistics site and route, and establishing a model for quickly adjusting the network in response to sudden situations can save logistics network costs and improve its efficiency. Therefore, this article has done the following work: first, it establishes an effective logistics network volume prediction model;second, for the two scenarios of network structure that cannot be modified and can be modified, it provides a model that can effectively guide the adjustment of the volume of goods on each route when a logistics site is closed;finally, it establishes a logistics network evaluation model to evaluate the importance of logistics sites and routes. © 2023 IEEE.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

MA-MFIF: When misaligned multi-focus Image fusion meets deep homography estimation

引用

Multimedia Tools and Applications 2025年第12期84卷 10877-10898页

作者： Zhao, Baojun Luo, Fei Fuentes, Joel Ding, Weichao Gu, Chunhua School of Information Science and Engineering East China University of Science and Technology Shanghai200237 China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai China Department of Computer Science and Information Technologies Universidad del Bio-Bio Chillán3780000 Chile

Multi-focus image fusion is a technique that combines multiple out-of-focus images to enhance the overall image quality. It has gained significant attention in recent years, thanks to the advancements in deep learning. However, one of the persistent challenges in this field is the processing of misaligned data, which can negatively impact the fusion results. To overcome this problem, a novel fusion framework with pre-registration is proposed for the fusion of misaligned multi-focus images. For pre-registration, content-aware deep homography estimation is used, which performs transfer learning on a real multi-focus image dataset to adapt to registration under defocused conditions. For fusion, a fusion module with dual-branch feature interaction is utilized to avoid invalid feature fusion and trained on real light field dataset to achieve better fusion performance. Qualitative and quantitative experimental results show that the proposed method has a 2-3 percentage point improvement in multiple evaluation metrics compared to existing advanced registration and fusion methods, and a maximum improvement of 4.83 percentage points in fusion performance when tested independently on the Lytro dataset. Additionally, We find that the value of the Qcv metric is greatly influenced by the alignment status of the input images, leading to its inability to reflect the fusion quality of aligned images. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Semantic Framework based Query Generation for Temporal Question Answering over Knowledge Graphs

Semantic Framework based Query Generation for Temporal Quest...

引用

2022 Conference on Empirical Methods in Natural Language Processing, EMNLP 2022

作者： Ding, Wentao Chen, Hao Li, Huayu Qu, Yuzhong State Key Laboratory for Novel Software Technology Nanjing University China

Answering factual questions with temporal intent over knowledge graphs (temporal KGQA) attracts rising attention in recent years. In the generation of temporal queries, existing KGQA methods ignore the fact that some intrinsic connections between events can make them temporally related, which may limit their capability. We systematically analyze the possible interpretation of temporal constraints and conclude the interpretation structures as the Semantic Framework of Temporal Constraints, SF-TCons. Based on the semantic framework, we propose a temporal question answering method, SF-TQA, which generates query graphs by exploring the relevant facts of mentioned entities, where the exploring process is restricted by SF-TCons. Our evaluations show that SF-TQA significantly outperforms existing methods on two benchmarks over different knowledge graphs. © 2022 Association for Computational Linguistics.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

A survey on model-based reinforcement learning

引用

science China(Information sciences) 2024年第2期67卷 59-84页

作者： Fan-Ming LUO Tian XU Hang LAI Xiong-Hui CHEN Weinan ZHANG Yang YU National Key Laboratory for Novel Software Technology Nanjing University Polixir. ai Department of Computer Science and Engineering Shanghai Jiao Tong University

Reinforcement learning(RL) interacts with the environment to solve sequential decision-making problems via a trial-and-error approach. Errors are always undesirable in real-world applications, even though RL excels at playing complex video games that permit several trial-and-error attempts. To improve sample efficiency and thus reduce errors, model-based reinforcement learning(MBRL) is believed to be a promising direction, as it constructs environment models in which trial-and-errors can occur without incurring actual costs. In this survey, we investigate MBRL with a particular focus on the recent advancements in deep RL. There is a generalization error between the learned model of a non-tabular environment and the actual environment. Consequently, it is crucial to analyze the disparity between policy training in the environment model and that in the actual environment, guiding algorithm design for improved model learning, model utilization, and policy training. In addition, we discuss the recent developments of model-based techniques in other forms of RL, such as offline RL, goal-conditioned RL, multi-agent RL, and meta-RL. Furthermore,we discuss the applicability and benefits of MBRL for real-world tasks. Finally, this survey concludes with a discussion of the promising future development prospects for MBRL. We believe that MBRL has great unrealized potential and benefits in real-world applications, and we hope this survey will encourage additional research on MBRL.

关键词： reinforcement learning model-based reinforcement learning planning model learning model learning with reduced error model usage

来源：评论

学校读者我要写书评

暂无评论

RAT: A Refactoring-Aware Tool for Tracking Code History 24

RAT: A Refactoring-Aware Tool for Tracking Code History

引用

46th International Conference on software Engineering: Companion, ICSE-Companion 2024

作者： Niu, Feifei Shao, Junqian Xu, Chaofan Mayr-Dorn, Christoph Assunção, Wesley K. G. Huang, Liguo Li, Chuanyi Ge, Jidong Luo, Bin Egyed, Alexander State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Institute for Software Systems Engineering Johannes Kepler University Linz Austria Department of Computer Science North Carolina State University North Carolina United States Department of Computer Science and Engineering Southern Methodist University DallasTX United States

ISBN: (纸本)9798400705021

History of code elements is essential for software maintenance tasks. However, code refactoring is one of the main causes that makes obtaining a consistent view on code evolution difficult as renaming or moving source code elements break such history. To this end, this paper presents RAT, a refactoring-aware tool for keeping track of code elements evolution across time, not just in terms of revisions but also in terms of refactoring. This is the first tool that enables fine-grained code element traceability of the whole repository. Empirical evaluation of leveraging our tool in three bug localization techniques relying on code history shows significant improvement in localization accuracy. Based on our findings, we believe that many of the state-of-the-art approaches using past source code data would benefit from our tool. Demo Tool: https://***/feifeiniu-se/RAT-Demo. Demo Video: https://***/VI-xwUaIPp4. © 2024 IEEE computer Society. All rights reserved.

关键词： Rats

来源：评论

学校读者我要写书评

暂无评论

Quantum-Resistant Multi-Feature Attribute-Based Proxy Re-Encryption Scheme for Cloud Services

引用

computer Modeling in Engineering & sciences 2024年第1期138卷 917-938页

作者： Jinqiu Hou Changgen Peng Weijie Tan Hongfa Ding State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang550025China Key Laboratory of Advanced Manufacturing Technology Ministry of EducationGuizhou UniversityGuiyang550025China College of Information Guizhou University of Finance and EconomicsGuiyang550025China

Cloud-based services have powerful storage functions and can provide accurate ***,the question of how to guarantee cloud-based services access control and achieve data sharing security has always been a research *** the attribute-based proxy re-encryption(ABPRE)schemes based on number theory can solve this problem,it is still difficult to resist quantum attacks and have limited expression *** address these issues,we present a novel linear secret sharing schemes(LSSS)matrix-based ABPRE scheme with the fine-grained policy on the lattice in the ***,to detect the activities of illegal proxies,homomorphic signature(HS)technology is introduced to realize the verifiability of ***,the non-interactivity,unidirectionality,proxy transparency,multi-use,and anti-quantum attack characteristics of our system are all ***,it can efficiently prevent the loss of processing power brought on by repetitive authorisation and can enable precise and safe data sharing in the ***,under the standard model,the proposed learning with errors(LWE)-based scheme was proven to be IND-sCPA secure.

关键词： Lattice learning with errors attribute-based proxy re-encryption linear secret sharing schemes

来源：评论

学校读者我要写书评

暂无评论

MIRROR: Model Inversion for Deep Learning Network with High Fidelity 29

MIRROR: Model Inversion for Deep Learning Network with High ...

引用

29th Annual Network and Distributed System Security Symposium, NDSS 2022

作者： An, Shengwei Tao, Guanhong Xu, Qiuling Liu, Yingqi Shen, Guangyu Yao, Yuan Xu, Jingwei Zhang, Xiangyu Department of Computer Science Purdue University United States State Key Laboratory for Novel Software Technology Nanjing University China

ISBN: (纸本)1891562746

Model inversion reverse-engineers input samples from a given model, and hence poses serious threats to information confidentiality. We propose a novel inversion technique based on StyleGAN, whose generator has a special architecture that forces the decomposition of an input to styles of various granularities such that the model can learn them separately in training. During sample generation, the generator transforms a latent value to parameters controlling these styles to compose a sample. In our inversion, given a target label of some subject model to invert (e.g., a private face based identity recognition model), our technique leverages a StyleGAN trained on public data from the same domain (e.g., a public human face dataset), uses the gradient descent or genetic search algorithm, together with distribution based clipping, to find a proper parameterization of the styles such that the generated sample is correctly classified to the target label (by the subject model) and recognized by humans. The results show that our inverted samples have high fidelity, substantially better than those by existing state-of-the-art techniques. © 2022 29th Annual Network and Distributed System Security Symposium, NDSS 2022. All Rights Reserved.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Disentangled Hypergraph Collaborative Filtering for Social Recommendation

Disentangled Hypergraph Collaborative Filtering for Social R...

引用

2023 IEEE International Conference on Web Services, ICWS 2023

作者： Liu, Xiao Meng, Shunmei Li, Qianmu Xu, Xiaolong Qi, Lianyong Dou, Wanchun Zhang, Jing Zhang, Xuyun Nanjing University of Science and Technology China Nanjing University State Key Lab. for Novel Software Technology China Nanjing University of Information Science and Technology School of Computer and Software China College of Computer Science and Technology China Southeast University School of Cyber Science and Engineering China Macquarie University School of Computing Australia

ISBN: (纸本)9798350304855

In the current era of information overload, service recommendations have emerged as a valuable tool for enhancing the user experience. Among them, social recommendation models have shown promising results by incorporating social relationships to improve representation learning. However, most of these models lack fine-grained modeling of social user behavior, leading to a unified representation of users and a loss of expressiveness in user representations. To address this issue, we propose DisenHGCF, a new social recommendation approach based on disentangled hypergraph collaborative filtering, to disentangle the representations of users and items at the granularity of social users' intents. This approach aims to provide a more nuanced understanding of the user, leading to more accurate and personalized recommendations. To be specific, DisenHGCF leverages hypergraphs to represent the complex relationships among users, friends, and items. By using the hypergraph disentangling module based on attention, it is able to disentangle the user's intents and generate users representations in cooperating their intents for recommendation tasks. Additionally, a contrastive learning task based on intent-weight perturbation is designed to enhance representational learning. The experimental results obtained from the BeiBei and Beidian datasets demonstrate the superiority of our proposed approach in comparison to previous baseline methods, as evidenced by higher Recall and NDCG scores. © 2023 IEEE.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Distributed Truss Computation in Dynamic Graphs

引用

Tsinghua science and technology 2023年第5期28卷 873-887页

作者： Ziwei Mo Qi Luo Dongxiao Yu Hao Sheng Jiguo Yu Xiuzhen Cheng School of Computer Science and Technology Shandong UniversityQingdao 266200China State Key Laboratory of Software Development Environment School of Computer Science and Engineering and the Beijing Advanced Innovation Center for Big Data and Brain ComputingBeihang UniversityBeijing 100191China Big Data Institute Qilu University of Technology(Shandong Academy of Sciences)Jinan 250353China

Large-scale graphs usually exhibit global sparsity with local cohesiveness,and mining the representative cohesive subgraphs is a fundamental problem in graph *** k-truss is one of the most commonly studied cohesive subgraphs,in which each edge is formed in at least k 2 triangles.A critical issue in mining a k-truss lies in the computation of the trussness of each edge,which is the maximum value of k that an edge can be in a *** works mostly focus on truss computation in static graphs by sequential ***,the graphs are constantly changing dynamically in the real *** study distributed truss computation in dynamic graphs in this *** particular,we compute the trussness of edges based on the local nature of the k-truss in a synchronized node-centric distributed *** decomposing the trussness of edges by relying only on local topological information is possible with the proposed distributed decomposition ***,the distributed maintenance algorithm only needs to update a small amount of dynamic information to complete the *** experiments have been conducted to show the scalability and efficiency of the proposed algorithm.

关键词： distributed algorithm dynamic graph graph mining cohesive subgraph k-truss

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：