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

23rd IEEE International Conference on High Performance Computing and Communications, 7th IEEE International Conference on Data Science and Systems, 19th IEEE International Conference on Smart City and 7th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

作者： Gao, Zhen Xu, Jingning Zheng, Jiang Yu Fan, Hongfei Yu, Rongjie Zong, Jiaqi Li, Xinyi School of Software Engineering Tongji University Shanghai China Indiana University-Purdue University Department of Computer Science Indianapolis United States Jiangsu China Tongji University Key Laboratory of Road and Traffic Engineering of the Ministry of Education Shanghai China College of Transportation Engineering Tongji University Shanghai China

ISBN: (纸本)9781665494571

Hazardous driving scenarios are critical for the development and testing of highly autonomous vehicles. Recent studies have proposed new approaches for extracting hazardous scenarios from driving videos, which greatly improve the detection accuracy compared with traditional approaches that extract information from structured kinematic data. However, direct processing on driving videos is costly, and the videos need to be uploaded and processed in a centralized manner. In this study, we propose a novel approach for reducing the cost of video analysis while maintaining high accuracy in hazardous scenario identification. Firstly, the videos are significantly compressed into motion profile images that contain motion trajectories of objects. Secondly, a lightweight CNN with attention mechanism has been designed to extract risky trajectory features of the conflicting traffic objects. Furthermore, data augmentation has been applied to increase the generalizability of the model. The proposed approach achieves significantly lightweight network size, and meanwhile, experimental results have demonstrated that the approach achieves high accuracy with sensitivity 0.95, specificity 0.85 and AUC 0.95, which outperforms state-of-the-art hazardous scenario identification approaches. The efficient execution of identification implies that it is suitable to be distributed and deployed at each vehicle, and consequently, videos could be processed via edge computing, which would improve the diversity of hazardous scenarios and the efficiency of scenario collection for further research work. © 2021 IEEE.

关键词： Sensitivity Image coding Smart cities Kinematics Feature extraction Trajectory Data mining

来源：评论

学校读者我要写书评

暂无评论

Investigating Efficacy of Perplexity in Detecting LLM-Generated Code

arXiv

引用

arXiv 2024年

作者： Xu, Jinwei Zhang, He Yang, Yanjin Cheng, Zeru Lyu, Jun Liu, Bohan Zhou, Xin Yang, Lanxin Bacchelli, Alberto Chiam, Yin Kia Chiew, Thiam Kian State Key Laboratory of Novel Software Technology Software Institute Nanjing University Nanjing210008 China Department of Informatics University of Zürich Zürich8006 Switzerland Department of Software Engineering Faculty of Computer Science and Information Technology University of Malaya Kuala Lumpur50603 Malaysia

Large language model-generated code (LLMgCode) has become increasingly prevalent in software development. Many studies report that LLMgCode has more quality and security issues than human-authored code (HaCode). It is common for LLMgCode to mix with HaCode in a code change, while the change is signed by only human developers, without being carefully checked. Many automated methods have been proposed to detect LLMgCode from HaCode, in which the perplexity-based method (PERPLEXITY for short) is the state-of-the-art method. However, the efficacy evaluation of PERPLEXITY has focused on the detection accuracy. In this article, we are interested in whether PERPLEXITY is good enough in a wider range of realistic evaluation settings. To this end, we devise a large-scale dataset that includes 11,664 HaCode snippets and 13,164 LLMgCode snippets, and based on that, we carry out a family of experiments to compare PERPLEXITY against feature-based and pre-training-based methods from three perspectives: (1) detection accuracy in terms of programming language, degree of difficulty, and scale of solution, (2) generalization capability, and (3) inference efficiency. The experimental results show that PERPLEXITY has the best generalization capability while it has low accuracy and efficiency in most cases. Based on the experimental results and detection mechanism of PERPLEXITY, we discuss implications into both the strengths and limitations of PERPLEXITY, e.g., PERPLEXITY is unsuitable for high-level programming languages while it has good interpretability. As the first large-scale investigation on detecting LLMgCode from HaCode, this article provides a wide range of evidence for future improvement. Copyright © 2024, The Authors. All rights reserved.

关键词： High level languages

来源：评论

学校读者我要写书评

暂无评论

PRIVACY-PRESERVING ONLINE SHARING CHARGING PILE SCHEME WITH DIFFERENT NEEDS MATCHING

arXiv

引用

arXiv 2023年

作者： Huang, Zhiyu School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China Hunan Key Laboratory for Service Computing and Novel Software Technology Xiangtan China

With the development of electric vehicles, more and more electric vehicles have difficulties in parking and charging. One of the reasons is that the number of charging piles is difficult to support the energy supply of electric vehicles, and a large number of private charging piles have a long idle time, so the energy supply problem of electric vehicles can be solved by sharing charging piles. The shared charging pile scheme uses Paillier encryption scheme and improved scheme to effectively protect user data. The scheme has homomorphism of addition and subtraction, and can process information without decryption. However, considering that different users have different needs, the matching is carried out after calculating the needs put forward by users. This scheme can effectively protect users' privacy and provide matching mechanisms with different requirements, so that users can better match the appropriate charging piles. The final result shows that its efficiency is better than the original Paillier scheme, and it can also meet the security requirements. © 2023, CC BY.

关键词： Piles

来源：评论

学校读者我要写书评

暂无评论

S2KAN-SLAM: Elastic Neural LiDAR SLAM with SDF Submaps and Kolmogorov-Arnold Networks

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Wang, Zhong Zhang, Lin Wang, Hesheng Shanghai Jiao Tong University State Key Laboratory of Avionics Integration and Aviation System-of-Systems Synthesis Department of Automation Key Laboratory of System Control and Information Processing of Ministry of Education Shanghai200240 China Tongji University School of Computer Science and Technology National Pilot Software Engineering School with Chinese Characteristics Shanghai201804 China

Traditional LiDAR SLAM approaches prioritize localization over mapping, yet high-precision dense maps are essential for numerous applications involving intelligent agents. Recent advancements have introduced methods leveraging neural fields to enhance mapping capabilities;however, these approaches still face several limitations. Firstly, concerning scene representation, they typically employ neural fields with high-dimensional features and multi-layer perceptron decoders utilizing non-continuous activation functions. This results in low learning efficiency and challenges in capturing high-frequency signals. Secondly, in terms of scene organization, these methods often treat the entire scene as a singular neural field, leading to inefficiencies, inflexibility, and difficulties in rectifying accumulated errors when mapping large-scale environments over extended periods. To tackle the first issue, we propose a lightweight continuous SDF regression approach by encoding the scene in single-valued embeddings and decoding SDF values from a Kolmogorov-Arnold Network. By minimizing discrepancies in measuring range, sampling distance, and decoded SDF values, we facilitate iterative frame-to-model tracking and bundle adjustment neural mapping. To mitigate the second challenge, we propose structuring the whole scene into multiple neural SDF submaps. By establishing node-node, node-submap, and loop closure constraints into a global pose graph, the system can create dense neural maps with global consistency across large-scale scenes. Experimental evaluations in both real-world and simulated settings indicate that our system achieves superior mapping completeness and accuracy, enhanced learning efficiency, reduced memory consumption, and greater flexibility compared to its counterparts. © 2025 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Zram Instance Pool Framework for Adaptive Memory Compression in Resource-Sensitive Embedded Operating Systems

引用

IEEE Transactions on computer-Aided Design of Integrated Circuits and Systems 2025年

作者： Deng, Yin Xie, Guoqi Xiong, Chenglai Zhao, Sirong Ren, Wei Li, Kenli Hunan University Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic Engineering Hunan Changsha410082 China Huawei Technology Co. Ltd. Central Software Institute Guangdong Shenzhen518129 China

Memory compression can reduce the size of the inactive data in the random access memory (RAM), thereby freeing up unused space and allowing more programs to run;however, current mainstream memory compression frameworks (e.g., Zram and Zswap) and algorithms (e.g., Zstd and Lz4) do not effectively solve the problem of increased CPU utilization, causing they cannot be directly applied to the resource-sensitive embedded operating system that is sensitive to both CPU utilization and memory usage. In this study, we develop a Zram instance pool framework called ZramPool for adaptive memory compression. The framework consists of the swap space with multiple Zram instances and the adaptive Zram compression module. Through introducing linear regression analysis, the number of Zram instances can be adaptively adjusted based on the size of the compressed data, allowing Zram instances to work in parallel to match the workload. In ZramPool, we achieve two different requirements of reducing CPU utilization while keeping compression speed and increasing compression speed while keeping CPU utilization. ZramPool is deployed in the embedded Linux OS with a 8GB memory size running on the ARMv8 architecture. For the first requirement, ZramPool can reduce CPU utilization by an average of 11.42% while the compression speed only decreases by an average of 2.4%. For the second requirement, ZramPool can increase compression speed by an average of 11.71% while the CPU utilization only increases by an average of 1.9%. © 1982-2012 IEEE.

关键词： Random access storage

来源：评论

学校读者我要写书评

暂无评论

RAT: A Refactoring-Aware Traceability Model for Bug Localization

RAT: A Refactoring-Aware Traceability Model for Bug Localiza...

引用

International Conference on software engineering (ICSE)

作者： Feifei Niu Wesley K. G. Assunção LiGuo Huang Christoph Mayr-Dorn Jidong Ge Bin Luo Alexander Egyed 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 and Engineering Southern Methodist University Dallas Texas USA

A large number of bug reports are created during the evolution of a software system. Locating the source code files that need to be changed in order to fix these bugs is a challenging task. Information retrieval-based bug localization techniques do so by correlating bug reports with historical information about the source code (e.g., previously resolved bug reports, commit logs). These techniques have shown to be efficient and easy to use. However, one flaw that is nearly omnipresent in all these techniques is that they ignore code refactorings. Code refactorings are common during software system evolution, but from the perspective of typical version control systems, they break the code history. For example, a class when renamed then appears as two separate classes with separate histories. Obviously, this is a problem that affects any technique that leverages code history. This paper proposes a refactoring-aware traceability model to keep track of the code evolution history. With this model, we reconstruct the code history by analyzing the impact of code refactorings to correctly stitch together what would otherwise be a fragmented history. To demonstrate that a refactoring aware history is indeed beneficial, we investigated three widely adopted bug localization techniques that make use of code history, which are important components in existing approaches. Our evaluation on 11 open source projects shows that taking code refactorings into account significantly improves the results of these bug localization techniques without significant changes to the techniques themselves. The more refactorings are used in a project, the stronger the benefit we observed. Based on our findings, we believe that much of the state of the art leveraging code history should benefit from our work.

关键词：

来源：评论

学校读者我要写书评

暂无评论

2S-UDF: A Novel Two-stage UDF Learning Method for Robust Non-watertight Model Reconstruction from Multi-view Images

arXiv

引用

arXiv 2023年

作者： Deng, Junkai Hou, Fei Chen, Xuhui Wang, Wencheng He, Ying State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China University of Chinese Academy of Sciences China School of Computer Science and Engineering Nanyang Technological University Singapore

Recently, building on the foundation of neural radiance field, various techniques have emerged to learn unsigned distance fields (UDF) to reconstruct 3D non-watertight models from multi-view images. Yet, a central challenge in UDF-based volume rendering is formulating a proper way to convert unsigned distance values into volume density, ensuring that the resulting weight function remains unbiased and sensitive to occlusions. Falling short on these requirements often results in incorrect topology or large reconstruction errors in resulting models. This paper addresses this challenge by presenting a novel two-stage algorithm, 2S-UDF, for learning a high-quality UDF from multi-view images. Initially, the method applies an easily trainable density function that, while slightly biased and transparent, aids in coarse reconstruction. The subsequent stage then refines the geometry and appearance of the object to achieve a high-quality reconstruction by directly adjusting the weight function used in volume rendering to ensure that it is unbiased and occlusion-aware. Decoupling density and weight in two stages makes our training stable and robust, distinguishing our technique from existing UDF learning approaches. Evaluations on the DeepFashion3D, DTU, and BlendedMVS datasets validate the robustness and effectiveness of our proposed approach. In both quantitative metrics and visual quality, the results indicate our superior performance over other UDF learning techniques in reconstructing 3D non-watertight models from multi-view images. Our code is available at https://***/jkdeng/2sudf/. © 2023, CC BY.

关键词： Volume rendering

来源：评论

学校读者我要写书评

暂无评论

Feature Fusion Based Hand Gesture Recognition Method for Automotive Interfaces

引用

Chinese Journal of Electronics 2020年第6期29卷 1153-1164页

作者： XU Qianyi QIN Guihe SUN Minghui YAN Jie JIANG Huiming ZHANG Zhonghan College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computing and Knowledge Engineering Ministry of Education Jilin University College of Software Jilin University

Hand gesture recognition on the depth videos is a promising approach for automotive interfaces because it is less sensitive to light variation and more accurate than other traditional ***,video gestures recognition is still a challenging task since lots of interferences are induced by the uncorrelated gesture *** that if the displays are more relevant,the results will more accurate,so ResNext,a kind of compact and efficient neural network,is firstly used as feature extractor,then an improved weighted frame unification method is adopted to obtain the key frame samples,finally the Discriminant correlation analysis(DCA) is employed to fuse features for static data and dynamic data after conducting Feature embedding branch(FEB) on static *** public dataset named Depth based gesture recognition database(DGRD) is used in this paper,but the dataset is a little small and the class distribution is largely imbalance,and we find the performance of ResNext degrades badly in the condition of imbalance problem although it achieves excellent result at sufficient training *** order to conquer the disadvantages of limited dataset,a special loss function scheme combining the soft max loss and dice loss is *** of the algorithm performances in comparison with other state-of-the-art methods indicates that the proposed method is more practical for gesture recognition and may be widely adopted by automotive interfaces.

关键词： feature extraction gesture recognition learning (artificial intelligence) neural nets Depth based gesture recognition database Feature embedding branch dynamic data static data key frame samples improved weighted frame unification method feature extractor efficient neural network compact network uncorrelated gesture factors video gestures recognition depth videos automotive interfaces Feature fusion based hand gesture recognition method Weighted frame unification Discriminant correlation analysis (DCA) Feature embedding branch (FEB) Gesture recognition Loss function

来源：评论

学校读者我要写书评

暂无评论

Audio-Visual Generalized Zero-Shot Learning Based on Variational Information Bottleneck

Audio-Visual Generalized Zero-Shot Learning Based on Variati...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Yapeng Li Yong Luo Bo Du School of Computer Science National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence and Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University Wuhan China

Audio-visual generalized zero-shot learning (GZSL) aims to train a model on seen classes for classifying data samples from both seen classes and unseen classes. Due to the absence of unseen training samples, the model tends to misclassify unseen class samples into seen classes. To mitigate this problem, in this paper, we propose a method based on variational information bottleneck for audio-visual GZSL. Specifically, we model the joint representations as a product-of-experts over marginal representations to integrate the information of audio and visual. Besides, we introduce variational information bottleneck to the learning of audio-visual joint representations and marginal representations of audio, visual, and text label modalities. This helps our model reduce the negative impact of information that cannot be generalized to unseen classes. Experimental results conducted on the UCF-GZSL, VGGSound-GZSL, and ActivityNet-GZSL benchmarks demonstrate the effectiveness and superiority of the proposed model for audio-visual GZSL.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Prune and Merge: Efficient Token Compression for Vision Transformer with Spatial Information Preserved

引用

IEEE Transactions on Multimedia 2025年

作者： Mao, Junzhu Shen, Yang Guo, Jinyang Yao, Yazhou Hua, Xiansheng Shen, Hengtao Nanjing University of Science and Technology School of Computer Science and Engineering Nanjing210094 China Beihang University State Key Laboratory of Software Development Environment Institute of Artificial Intelligence Beijing100191 China Terminus Group Beijing100027 China University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu611731 China

Token compression is essential for reducing the computational and memory requirements of transformer models, enabling their deployment in resource-constrained environments. In this work, we propose an efficient and hardware-compatible token compression method called Prune and Merge. Our approach integrates token pruning and merging operations within transformer models to achieve layer-wise token compression. By introducing trainable merge and reconstruct matrices and utilizing shortcut connections, we efficiently merge tokens while preserving important information and enabling the restoration of pruned tokens. Additionally, we introduce a novel gradient-weighted attention scoring mechanism that computes token importance scores during the training phase, eliminating the need for separate computations during inference and enhancing compression efficiency. We also leverage gradient information to capture the global impact of tokens and automatically identify optimal compression structures. Extensive experiments on the ImageNet-1k and ADE20K datasets validate the effectiveness of our approach, achieving significant speed-ups with minimal accuracy degradation compared to state-of-the-art methods. For instance, on DeiT-Small, we achieve a 1.64× speed-up with only a 0.2% drop in accuracy on ImageNet-1k. Moreover, by compressing segmenter models and comparing with existing methods, we demonstrate the superior performance of our approach in terms of efficiency and effectiveness. Code and models have been made available at https://***/NUST-Machine-Intelligence-laboratory/prune_and_merge. © 1999-2012 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：