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

Scientific Value Weights more than Being Open or Toll Access:An analysis of the OA advantage in Nature and Science

Journal of data and Information Science 2021年第4期6卷 62-75页

作者： Howell Y.Wang Shelia X.Wei Cong Cao Xianwen Wang Fred Y.Ye International Joint Informatics Laboratory&Jiangsu Key Laboratory of Data Engineering and Knowledge Service School of Information ManagementNanjing UniversityNanjing 210023China Nottingham University Business School China University of Nottingham Ningbo ChinaNingbo315100China WISE Lab. Dalian University of TechnologyDalian 116024China

Purpose:We attempt to find out whether OA or TA really affects the dissemination of scientific ***/methodology/approach:We design the indicators,hot-degree,and R-index to indicate a topic OA or TA ***,according to the OA classification of the Web of Science(WoS),we collect data from the WoS by downloading OA and TA articles,letters,and reviews published in Nature and Science during 2010–*** papers are divided into three broad disciplines,namely biomedicine,physics,and ***,taking a discipline in a journal and using the classical Latent Dirichlet Allocation(LDA)to cluster 100 topics of OA and TA papers respectively,we apply the Pearson correlation coefficient to match the topics of OA and TA,and calculate the hot-degree and R-index of every OA-TA topic ***,characteristics of the discipline can be *** qualitative comparison,we choose some high-quality papers which belong to Nature remarkable papers or Science breakthroughs,and analyze the relations between OA/TA and citation ***:The result shows that OA hot-degree in biomedicine is significantly greater than that of TA,but significantly less than that of TA in *** on the R-index,it is found that OA advantages exist in biomedicine and TA advantages do in ***,the dissemination of average scientific discoveries in all fields is not necessarily affected by OA or ***,OA promotes the spread of important scientific discoveries in high-quality *** limitations:We lost some citations by ignoring other open sources such as arXiv and *** limitation came from that Nature employs some strong measures for access-promoting subscription-based articles,on which the boundary between OA and TA became *** implications:It is useful to select hot topics in a set of publications by the hotdegree *** finding comprehensively reflects the differences of OA and TA in different disciplines,which is a u

关键词： Open access Toll access Scientific discovery Academic dissemination data analysis

来源：评论

学校读者我要写书评

暂无评论

NUITS: a novel user interface for efficient keyword search over databases 06

NUITS: a novel user interface for efficient keyword search o...

引用

Proceedings of the 32nd international conference on Very large data bases

作者： Shan Wang Zhaohui Peng Jun Zhang Lu Qin Sheng Wang Jeffrey Xu Yu Bolin Ding School of Information Renmin Univ. of China Key Laboratory of Data Engineering and Knowledge Engineering MOE of China Beijing China Department of Systems Engineering and Engineering Management The Chinese Univ. of Hong Kong Hong Kong China

The integration of database and information retrieval techniques provides users with a wide range of high quality services. We present a prototype system, called NUITS, for efficiently processing keyword queries on top of a relational database. Our NUITS allows users to issue simple keyword queries as well as advanced keyword queries with conditions. The efficiency of keyword query processing and the user-friendly result display will also be addressed in this paper.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Edit Distance Algorithm with Block Swap

An Edit Distance Algorithm with Block Swap

引用

The 9th International Conference for Young Computer Scientists(第九届国际青年计算机大会)

作者： Tian Xia Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing 100872 China School of Information Resource Management Renmin University of China. Beijing 100872 China

The edit distance between two given strings X and Y is the minimum number of edit operations that transform X into Y. In ordinary course, string editing is based on character insert, delete, and substitute operations. It has been suggested that extending this model with block edits would be useful in applications such as DNA sequence comparison and sentence similarity computation. However, the existing algorithms have generally focused on the normalized edit distance, and seldom of them consider the block swap operations at a higher level. In this paper, we introduce an extended edit distance algorithm which permits insertions, deletions, and substitutions at character level, and also permits block swap operations. Experimental results on randomly generated strings verify the algorithm's rationality and efficiency. The main contribution of this paper is that we present an algorithm to compute the lowest edit cost for string transformation with block swap in polynomial time, and propose a breaking points selection algorithm to improve the computation speed.

关键词： Edit distance edit operation block swap string matching.

来源：评论

学校读者我要写书评

暂无评论

Malicious Web Pages Detection Based on Abnormal Visibility Recognition

Malicious Web Pages Detection Based on Abnormal Visibility R...

引用

International Conference on E-Business and Information System Security, EBISS

作者： Bin Liang Jianjun Huang Fang Liu Dawei Wang Daxiang Dong Zhaohui Liang Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China Beijing China School of Information Renmin University of China Beijing China Renmin University of China Beijing CN

In recent years, Web sites have already become the attackers' main target. When attackers embed malicious code in the Web pages, they generally change the display mode of the corresponding HTML tags to make the display effect of malicious code invisible or almost invisible to the browser users. In this paper, the concept of abnormal visibility is proposed to describe the display feature setting of malicious code embedded. According to the concept, a malicious code detection method based on abnormal visibility recognition is designed and a prototype system is implemented. Compared to traditional methods and systems, the method has higher efficiency and less maintenance cost. Besides, a special-purpose JavaScript interpreter is implemented to get the execution output of browser-end scripts that are often used to generate malicious code dynamically by attackers. Experiments show that this system can detect most of the malicious Web pages efficiently and at the same time locate the malicious code in the source code accurately.

关键词： Web pages Displays Java Prototypes HTML Costs Invasive software Fingerprint recognition laboratories data engineering

来源：评论

学校读者我要写书评

暂无评论

Single attribute Join Queries within latest sampling periods in sensor networks

Single attribute Join Queries within latest sampling periods...

引用

IEEE Symposium on Computers and Communications (ISCC)

作者： Shangfeng Mo Hong Chen Yinglong Li School of Math and Computing Science Hunan University of Science and Technology Xiangtan China Key Laboratory of Data Engineering and Knowledge Engineering of MOE School of Information Renmin University of China Beijing China

Join processing in wireless sensor networks is a challenging problem. Current solutions are not involved in the join operation among tuples of the latest sampling periods. In this article, we proposed a continuous Single attribute Join Queries within latest sampling Periods (SJQP) for wireless sensor networks. The main idea of our filter-based framework is to discard non-matching tuples, and our scheme can guarantee the result is correct independent of the filters. Experiments based on real-world sensor data show that our method performs close to a theoretical optimum and consistently outperforms the centralized join algorithm.

关键词： Base stations Wireless sensor networks Probes Filtering algorithms Temperature sensors Information filters

来源：评论

学校读者我要写书评

暂无评论

EvoChart: A Benchmark and a Self-Training Approach Towards Real-World Chart Understanding

arXiv

引用

arXiv 2024年

作者： Huang, Muye Lai, Han Zhang, Xinyu Wu, Wenjun Ma, Jie Zhang, Lingling Liu, Jun School of Computer Science and Technology Xi’an Jiaotong University China MOE KLINNS Lab Xi’an Jiaotong University China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering China

Chart understanding enables automated data analysis for humans, which requires models to achieve highly accurate visual comprehension. While existing Visual Language Models (VLMs) have shown progress in chart understanding, the lack of high-quality training data and comprehensive evaluation benchmarks hinders VLM chart comprehension. In this paper, we introduce EvoChart, a novel self-training method for generating synthetic chart data to enhance VLMs’ capabilities in real-world chart comprehension. We also propose EvoChart-QA, a noval benchmark for measuring models’ chart comprehension abilities in real-world scenarios. Specifically, EvoChart is a unique self-training data synthesis approach that simultaneously produces high-quality training corpus and a high-performance chart understanding model. EvoChart-QA consists of 650 distinct real-world charts collected from 140 different websites and 1,250 expert-curated questions that focus on chart understanding. Experimental results on various open-source and proprietary VLMs tested on EvoChart-QA demonstrate that even the best proprietary model, GPT-4o, achieves only 49.8% accuracy. Moreover, the EvoChart method significantly boosts the performance of open-source VLMs on real-world chart understanding tasks, achieving 54.2% accuracy on EvoChart-QA. © 2024, CC BY.

关键词： Visual languages

来源：评论

学校读者我要写书评

暂无评论

Identifying and pruning redundant structures for deep neural networks 34

Identifying and pruning redundant structures for deep neural...

引用

34th IEEE International Conference on Visual Communications and Image Processing, VCIP 2019

作者： Gan, Wenyao Song, Li Chen, Li Xie, Rong Gu, Xiao Shanghai Jiao Tong University Institute of Image Communication and Network Engineering China Shanghai Institute for Advanced Communication and Data Science Shanghai200240 China MoE Key Lab of Artificial Intelligence AI Institute Shanghai Jiao Tong University Shanghai China

ISBN: (纸本)9781728137230

Deep convolutional neural networks have achieved considerable success in the field of computer vision. However, it is difficult to deploy state-of-The-Art models on resource-constrained platforms due to their high storage, memory bandwidth, and computational costs. In this paper, we propose a structured pruning method which employs a three-step process to reduce the resource consumption of neural networks. First, we train an initial network on the training set and evaluate it on the validation set. Next, we introduce an iterative pruning and fine-Tuning algorithm to identify and prune redundant structures, which results in a pruned network with a compact architecture. Finally, we train the pruned network from scratch on both the training set and validation set to obtain the final accuracy on the test set. In the experiments, our pruning method significantly reduces the model size (by 87.2% on CIFAR-10), saves inference time (53.3% on CIFAR-10), and achieves better performance as compared to recent state-of-The-Art methods. © 2019 IEEE.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

COCO-CN for cross-lingual image tagging, captioning and retrieval

arXiv

引用

arXiv 2018年

作者： Li, Xirong Xu, Chaoxi Wang, Xiaoxu Lan, Weiyu Jia, Zhengxiong Yang, Gang Xu, Jieping Key Lab of Data Engineering and Knowledge Engineering Renmin University of China AI & Media Computing Lab School of Information Renmin University of China Beijing100872 China

This paper contributes to cross-lingual image annotation and retrieval in terms of data and baseline methods. We propose COCO-CN, a novel dataset enriching MS-COCO with manually written Chinese sentences and tags. For more effective annotation acquisition, we develop a recommendation-assisted collective annotation system, automatically providing an annotator with several tags and sentences deemed to be relevant with respect to the pictorial content. Having 20,342 images annotated with 27,218 Chinese sentences and 70,993 tags, COCO-CN is currently the largest Chinese-English dataset that provides a unified and challenging platform for cross-lingual image tagging, captioning and retrieval. We develop conceptually simple yet effective methods per task for learning from cross-lingual resources. Extensive experiments on the three tasks justify the viability of the proposed dataset and methods. data and code are publicly available at https://***/li-xirong/coco-cn. Copyright © 2018, The Authors. All rights reserved.

关键词： Image annotation

来源：评论

学校读者我要写书评

暂无评论

Semi-autoregressive transformer for image captioning

arXiv

引用

arXiv 2021年

作者： Zhou, Yuanen Zhang, Yong Hu, Zhenzhen Wang, Meng School of Computer Science and Information Engineering Hefei University of Technology Tencent AI Lab Key Laboratory of Knowledge Engineering with Big Data Ministry of Education

Current state-of-the-art image captioning models adopt autoregressive decoders, i.e. they generate each word by conditioning on previously generated words, which leads to heavy latency during inference. To tackle this issue, non-autoregressive image captioning models have recently been proposed to significantly accelerate the speed of inference by generating all words in parallel. However, these non-autoregressive models inevitably suffer from large generation quality degradation since they remove words dependence excessively. To make a better trade-off between speed and quality, we introduce a semi-autoregressive model for image captioning (dubbed as SATIC), which keeps the autoregressive property in global but generates words parallelly in local. Based on Transformer, there are only a few modifications needed to implement SATIC. Experimental results on the MSCOCO image captioning benchmark show that SATIC can achieve a good trade-off without bells and whistles. Code is available at https://***/YuanEZhou/satic. Copyright © 2021, The Authors. All rights reserved.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

SP3: Enhancing Structured Pruning via PCA Projection

arXiv

引用

arXiv 2023年

作者： Hu, Yuxuan Zhang, Jing Zhao, Zhe Zhao, Chen Chen, Xiaodong Li, Cuiping Chen, Hong School of Information Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering MOE China Engineering Research Center of Database and Business Intelligence MOE China Tencent AI Lab Tencent Beijing China School of Computer Science and Technology Xi'an Jiaotong University Xi'An China

Structured pruning is a widely used technique for reducing the size of pre-trained language models (PLMs), but current methods often overlook the potential of compressing the hidden dimension (d) in PLMs, a dimension critical to model size and efficiency. This paper introduces a novel structured pruning approach, Structured Pruning with PCA Projection (SP3), targeting the effective reduction of d by projecting features into a space defined by principal components before masking. Extensive experiments on benchmarks (GLUE and SQuAD) show that SP3 can reduce d by 70%, compress 94% of the BERTbase model, and maintain over 96% accuracy and outperform other methods that compress d by 6% in accuracy at the same compression ratio. SP3 has also proven effective with other models, including OPT and Llama. Our data and code are available at ours repo. © 2023, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：