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

Vulnerabilities Static Detection for Web Applications with False Positive Suppression

Vulnerabilities Static Detection for Web Applications with F...

2010 IEEE International Conference on Information Theory and Information Security(2010 IEEE 国际信息论与信息安全会议)

作者： Bin Liang Qianqian Wang Jianjun Huang Jiagui Zhong Jingjing Cai Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China) MOE Schoo School of Information Renmin University of China Beijing 100872 China Beijing Venustech Cybervision Co. Ltd Beijing 100094 China

Web applications become more and more important, and the corresponding security problems have been concerned about. This paper presents TASA, an ASP static analyzer, which employs a path-sensitive, inter-procedural and contextsensitive data flow analysis, mainly concerning the taint propagation and sanitization. This paper also discusses some techniques used in TASA, such as sanitization routines modeling, ASP specific features, alias analysis and path-related routines modeling, to prune false positives. Experiments on four open source applications show that TASA has a rate of false positive of 4.98% and it can avoid certain false warnings owing to the proposed approaches.

关键词： Security Detectors Computer bugs Portals Analytical models Browsers Merging

来源：评论

学校读者我要写书评

暂无评论

Generalized domain prompt learning for accessible scientific vision-language models

引用

Nexus 2025年第2期2卷

作者： Qinglong Cao Yuntian Chen Lu Lu Hao Sun Zhengzhong Zeng Xiaokang Yang Dongxiao Zhang MoE Key Lab of Artificial Intelligence AI Institute Shanghai Jiao Tong University Shanghai 200240 China Ningbo Institute of Digital Twin Eastern Institute of Technology Ningbo 315200 China Department of Statistics and Data Science Yale University New Haven CT 06511 USA Gaoling School of Artificial Intelligence Renmin University of China Beijing 100872 China School of Environmental Science and Engineering Southern University of Science and Technology Shenzhen 518055 China Institute for Advanced Study Lingnan University Tuen Mun Hong Kong 100872 China

Large-scale vision-language models have shown remarkable success in general vision tasks, inspiring the development of domain-specific models. However, creating these models requires substantial investments in annotated data, computational resources, and energy, making such endeavors largely accessible to industrial giants. This resource-intensive nature of model development inadvertently stifles academic research, particularly for smaller research groups, and limits the diversity and growth of the field. To address these challenges and promote more sustainable and equitable research, we introduce the generalized domain prompt learning framework. This framework enables the efficient transfer of robust recognition capabilities from natural vision to specialized domains without the need for large datasets or heavy computational overhead. By leveraging small-scale domain-specific foundation models and minimal prompt samples, the framework enriches the language component with domain-specific knowledge through quaternion networks, revealing cross-modal relationships between specialized vision features and natural vision-based contextual embeddings. Simultaneously, it drives the vision component toward domain-specific tasks via hierarchical propagation of vision prompts, grounded in well-matched vision-language relationships. To maximize the domain adaptation potential of these models, we also propose a novel low-rank adaptation technique. Extensive experiments across diverse domains—including remote sensing, medical imaging, geology, synthetic aperture radar, and fluid dynamics—demonstrate the effectiveness of the framework, achieving state-of-the-art domain recognition performance within a prompt learning structure. Our work presents a pathway for inclusive and sustainable research that bridges the gap between academia and industry, empowering smaller research groups and promoting broader access to cutting-edge advancements in the context of future sustainable developme

关键词： vision-language models domain adaptation generalized domain prompt learning sustainable AI research AI for science

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised Multi-label Learning with Missing labels via Correlation Information

Semi-supervised Multi-Label Learning with Missing Labels via...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Zexian Xie Peipei Li Jinling Jiang Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui China Knowledge Engineering Research Center Zhejiang Lab Hangzhou Zhejiang China

In multi-label learning, each instance is associated with a set of labels simultaneously. Most existing studies assume that the set of labels for each instance is complete. However, it is generally difficult to obtain all the relevant labels of each instance, and only a partial or even empty set of relevant labels is available, which is called semi-supervised multi-label learning with missing labels. To tackle this problem, we propose a novel framework that considers label correlations and instance correlations to recover the missing labels and utilizes a large amount of unlabeled data simultaneously to improve the classification performance. Specifically, a new supplementary label matrix is firstly obtained by learning the label correlation. Secondly, considering each class label may be decided by some specific characteristics of its own, a label-specific data representation is hence learned for each class label. Thirdly, instance correlations are utilized not only to recover the missing labels, but also to propagate the supervision information from labeled instances to unlabeled ones. In addition, a united objective function is designed to facilitate the above processing and an accelerated proximal gradient method is adopted to solve the optimization problem. Finally, extensive experimental results conducted on several benchmark datasets demonstrate the effectiveness of the proposed method compared to competing ones.

关键词：

来源：评论

学校读者我要写书评

暂无评论

RPR-Net: A Point Cloud-based Rotation-aware Large Scale Place Recognition Network

arXiv

引用

arXiv 2021年

作者： Fan, Zhaoxin Song, Zhenbo Zhang, Wenping Liu, Hongyan He, Jun Du, Xiaoyong Key Laboratory of Data Engineering and Knowledge Engineering of MOE School of Information Renmin University of China Beijing100872 China Department of Management Science and Engineering Tsinghua University Beijing100084 China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China

Point cloud-based large scale place recognition is an important but challenging task for many applications such as Simultaneous Localization and Mapping (SLAM). Taking the task as a point cloud retrieval problem, previous methods have made delightful achievements. However, how to deal with catastrophic collapse caused by rotation problems is still under-explored. In this paper, to tackle the issue, we propose a novel Point Cloud-based Rotation-aware Large Scale Place Recognition Network (RPR-Net). In particular, to solve the problem, we propose to learn rotation-invariant features in three steps. First, we design three kinds of novel Rotation-Invariant Features (RIFs), which are low-level features that can hold the rotation-invariant property. Second, using these RIFs, we design an attentive module to learn rotation-invariant kernels. Third, we apply these kernels to previous point cloud features to generate new features, which is the well-known SO(3) mapping process. By doing so, high-level scene-specific rotation-invariant features can be learned. We call the above process an Attentive Rotation-Invariant Convolution (ARIConv). To achieve the place recognition goal, we build RPR-Net, which takes ARIConv as a basic unit to construct a dense network architecture. Then, powerful global descriptors used for retrieval-based place recognition can be sufficiently extracted from RPR-Net. Experimental results on prevalent datasets show that our method achieves comparable results to existing state-of-the-art place recognition models and significantly outperforms other rotation-invariant baseline models when solving rotation problems. Copyright © 2021, The Authors. All rights reserved.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

arXiv

引用

arXiv 2017年

作者： Dong, Jianfeng Li, Xirong Xu, Duanqing College of Computer Science and Technology Zhejiang University Hangzhou310027 China Key Lab of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing100872 China

—In order to retrieve unlabeled images by textual queries, cross-media similarity computation is a key ingredient. Although novel methods are continuously introduced, little has been done to evaluate these methods together with large-scale query log analysis. Consequently, how far have these methods brought us in answering real-user queries is unclear. Given baseline methods that use relatively simple text/image matching, how much progress have advanced models made is also unclear. This paper takes a pragmatic approach to answering the two questions. Queries are automatically categorized according to the proposed query visualness measure, and later connected to the evaluation of multiple cross-media similarity models on three test sets. Such a connection reveals that the success of the state-of-the-art is mainly attributed to their good performance on visual-oriented queries, which account for only a small part of real-user queries. To quantify the current progress, we propose a simple text2image method, representing a novel query by a set of images selected from large-scale query log. Consequently, computing cross-media similarity between the query and a given image boils down to comparing the visual similarity between the given image and the selected images. Image retrieval experiments on the challenging Clickture dataset show that the proposed text2image is a strong baseline, comparing favorably to recent deep learning alternatives. Copyright © 2017, The Authors. All rights reserved.

关键词： Image retrieval

来源：评论

学校读者我要写书评

暂无评论

Idea-map: A Spatiotemporal View of Research Ideas

Idea-map: A Spatiotemporal View of Research Ideas

引用

2011 Eighth International Conference on Fuzzy System and knowledge Discovery(第八届模糊系统与知识发现国际会议 FSKD 2011)

作者： HeHu Xiaoyong Du Key Laboratory of Data Engineering and Knowledge Engineering(Renmin University of China) MOE Beijing 100872 P. R. China School of Information Renmin University of China Beijing 100872 P. R. China

in this paper, we describe idea-map, a mash-up application building on top of Linked data Cloud. It reads in user's keywords (about research ideas) and executes a SPARQL query against DBLP endpoint. Spatial and temporal information is extracted and parsed from the query results and is further transformed to SIMILE/EXHIBIT to show a spatiotemporal map for the research ideas. Idea-map shows the feasibility of combing various techniques such as YQL, SIMILE/Exhibit and SPARQL query answering to provide an insightful interface to better understand the interested research ideas.

关键词： Link data Cloud DBLP Spatiotemoral View YQL

来源：评论

学校读者我要写书评

暂无评论

SHLE: Devices Tracking and Depth Filtering for Stereo-based Height Limit Estimation

arXiv

引用

arXiv 2022年

作者： Fan, Zhaoxin Yang, Kaixing Zhang, Min Song, Zhenbo Liu, Hongyan He, Jun Key Laboratory of Data Engineering and Knowledge Engineering of MOE School of Information Renmin University of China Beijing100872 China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Department of Management Science and Engineering Tsinghua University Beijing100084 China

Recently, over-height vehicle strike frequently occurs, causing great economic cost and serious safety problems. Hence, an alert system which can accurately discover any possible height limiting devices in advance is necessary to be employed in modern large or medium sized cars, such as touring cars. Detecting and estimating the height limiting devices act as the key point of a successful height limit alert system. Though there are some works research height limit estimation, existing methods are either too computational expensive or not accurate enough. In this paper, we propose a novel stereo-based pipeline named SHLE for height limit estimation. Our SHLE pipeline consists of two stages. In stage 1, a novel devices detection and tracking scheme is introduced, which accurately locate the height limit devices in the left or right image. Then, in stage 2, the depth is temporally measured, extracted and filtered to calculate the height limit device. To benchmark the height limit estimation task, we build a large-scale dataset named "Disparity Height", where stereo images, pre-computed disparities and ground-truth height limit annotations are provided. We conducted extensive experiments on "Disparity Height" and the results show that SHLE achieves an average error below than 10cm though the car is 70m away from the devices. Our method also outperforms all compared baselines and achieves state-of-the-art performance. Code is available at https://***/Yang-Kaixing/SHLE. Copyright © 2022, The Authors. All rights reserved.

关键词： Pipelines

来源：评论

学校读者我要写书评

暂无评论

Abnormality Detection in Chest X-Ray Images Using Uncertainty Prediction Autoencoders 23rd

Abnormality Detection in Chest X-Ray Images Using Uncertaint...

引用

23rd International Conference on Medical Image Computing and Computer-Assisted Intervention, MICCAI 2020

作者： Mao, Yifan Xue, Fei-Fei Wang, Ruixuan Zhang, Jianguo Zheng, Wei-Shi Liu, Hongmei School of Data and Computer Science Sun Yat-sen University Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing MOE Guangzhou China Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China Pazhou Lab Guangzhou China Guangdong Province Key Laboratory of Information Security Technology Guangzhou China

ISBN: (纸本)9783030597245

Chest radiography is widely used in annual medical screening to check whether lungs are healthy or not. Therefore it would be desirable to develop an intelligent system to help clinicians automatically detect potential abnormalities in chest X-ray images. Here with only healthy X-ray images, we propose a new abnormality detection approach based on an autoencoder which outputs not only the reconstructed normal version of the input image but also a pixel-wise uncertainty prediction. Higher uncertainty often appears at normal region boundaries with relatively larger reconstruction errors, but not at potential abnormal regions in the lung area. Therefore the normalized reconstruction error by the uncertainty provides a natural measurement for abnormality detection in images. Experiments on two chest X-ray datasets show the state-of-the-art performance by the proposed approach. © 2020, Springer Nature Switzerland AG.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

On-Line System of Garbage Image-Orientated Intelligent Classification, Submission and Examination

On-Line System of Garbage Image-Orientated Intelligent Class...

引用

IEEE International Conference on e-Business engineering (ICEBE)

作者： Jiayin Tian Yaozhi Wang Jiaxin Liu Yan Chen School of Computer Science and Technology Xi'an Jiaotong University Xi'an Shaanxi China Shaanxi Key Lab of Big Data Knowledge Engineering Xi'an Jiaotong University Xi'an Shaanxi China Shaanxi Key Lab of Big Data Knowledge Engineering School of Computer Science and Technology Xi'an Jiaotong University Xi'an Jiaotong University Xi'an Shaanxi China

ISBN: (数字)9798350365856

ISBN: (纸本)9798350365863

In a world brimming with new products continually, novel waste types are ubiquitous. This makes current image-based garbage classification systems difficult to perform well due to the long-tailed effects of distribution of garbage types, and necessitates an urgent and efficient garbage classification with abilities of detecting new and rare wastes and class-incremental learning for environmental sustainability. Therefore, we propose a framework of Online System of Garbage Image-Oriented Intelligent Classification, Submission, and Examination, facilitating the incremental garbage classification efforts. In which, to identify novel garbage effectively, we also introduced few-shot object detection method with two key algorithms: Two-Stage Object Detection Learning Algorithm and Dynamic Query-based Incremental Few-shot Learning Algorithm. Our experiment results show that Both outperform the current existing ones in dataset, MS COCO. Then, a strategy of Class-Incremental learning based Residual Network is proposed to meet the need of new waste class-incremental learning. The experimental results support our strategy. Finally, a prototype system employed the above algorithms and the strategy is described.

关键词： Image recognition Heavily-tailed distribution Heuristic algorithms Green products Prototypes Object detection Classification algorithms Object recognition Few shot learning Residual neural networks

来源：评论

学校读者我要写书评

暂无评论

An improved elastic net with heuristic cloning strategy for traveling salesman problem

引用

ICIC Express Letters 2011年第11期5卷 3995-4000页

作者： Yang, Gang Yang, Nan Yi, Junyan Key Laboratory of Data Engineering and Knowledge Engineering MOE School of Information Renmin University of China No. 59 Zhongguancun Street Haidian District Beijing 100872 China Department of Computer Science and Technology Zhejiang University of Technology No. 18 Chaowang Road Hangzhou 310014 China

Based on analysis of relationships between solution qualities and number of initial dynamic points in elastic net algorithm, we propose an improved elastic network algorithm (IENA) introduced in a heuristic cloning strategy for traveling salesman problem (TSP). The improved elastic net consists of four evolution processes with less dynamic points and gradually reducing cities, and it accelerates the convergent process without compromising the equality of solutions. IENA is conducted on some random TSP instances to verify its performance by comparison with other algorithms. © 2011 ICIC International.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：