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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

195 篇 会议
22 篇 期刊文献

馆藏范围

217 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

213 篇 工学
- 212 篇 计算机科学与技术...
- 175 篇 软件工程
- 17 篇 生物工程
- 10 篇 电气工程
- 8 篇 电子科学与技术（可...
- 8 篇 信息与通信工程
- 7 篇 生物医学工程（可授...
- 6 篇 控制科学与工程
- 3 篇 机械工程
- 2 篇 农业工程
- 1 篇 光学工程
- 1 篇 仪器科学与技术
- 1 篇 材料科学与工程（可...
- 1 篇 动力工程及工程热...
- 1 篇 化学工程与技术
- 1 篇 林业工程
174 篇 理学
- 172 篇 数学
- 21 篇 生物学
- 6 篇 统计学（可授理学、...
- 4 篇 物理学
- 2 篇 化学
24 篇 管理学
- 19 篇 图书情报与档案管...
- 6 篇 管理科学与工程(可...
4 篇 医学
- 4 篇 临床医学
- 1 篇 基础医学(可授医学...
- 1 篇 药学(可授医学、理...
3 篇 法学
- 3 篇 社会学
2 篇 农学
- 2 篇 作物学
1 篇 教育学
- 1 篇 教育学
1 篇 文学
- 1 篇 新闻传播学

主题

217 篇 string searching...

机构

6 篇 department of bi...
5 篇 department of co...
4 篇 computer technol...
3 篇 presto japan sci...
3 篇 department of in...
3 篇 univ chile dept ...
2 篇 institute for co...
2 篇 school of inform...
2 篇 information scie...
2 篇 department of in...
2 篇 georgia inst tec...
2 篇 information scie...
2 篇 department of co...
2 篇 dipartimento di ...
2 篇 univ rouen norma...
2 篇 department of in...
2 篇 department of co...
2 篇 univ liverpool d...
2 篇 courant institut...
2 篇 department of co...

作者

11 篇 fan hongbo
7 篇 breslauer dany
7 篇 faro simone
6 篇 liu lijun
6 篇 crochemore maxim...
6 篇 huang qingsong
5 篇 tarhio jorma
5 篇 agarwal suneeta
5 篇 prasad rajesh
5 篇 lecroq thierry
4 篇 yao nianmin
4 篇 peltola hannu
4 篇 takeda masayuki
4 篇 inenaga shunsuke
4 篇 iliopoulos costa...
4 篇 navarro gonzalo
4 篇 nakashima yuto
4 篇 grossi roberto
4 篇 grabowski szymon
3 篇 manea florin

语言

211 篇 英文
4 篇 其他
2 篇 中文

检索条件"主题词=String Searching Algorithms"

共 217 条记录，以下是101-110 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Detecting items in text using large-scale knowledge base

Detecting items in text using large-scale knowledge base

引用

2012 International Conference on Information Technology and Software Engineering, ITSE 2012

作者： Hou, Dianhui Huang, Jiuming Xu, Yunyi Jiang, Siyu Zhou, Bin PLA Unit 73111 Xiamen China Xiamen Tongrong Software Technology Co. Ltd. Xiamen China College of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9783642345210

Varieties of text mining applications utilize knowledge bases to understand the semantic of documents. Current knowledge bases are open and very large. Detecting what items in the knowledge base exist in the documents is the first step of the utilization. Existing multiple string matching algorithms cannot be applied to the item detection because of the long lengthes of knowledge items and the large scales of knowledge bases. This paper proposes a novel approach SW-Tree by improving the classical AC-Trie algorithm to achieve higher performance. The approach takes advantage of the specific goal of knowledge item detection and the data features of knowledge bases. Experiments on real data set show that the proposed approach is significantly faster than the baseline approach. © 2013 Springer-Verlag.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Improving the resilience of an IDS against performance throttling attacks

Improving the resilience of an IDS against performance throt...

引用

8th International ICST Conference on Security and Privacy in Communication Networks, SecureComm 2012

作者： Shenoy, Govind Sreekar Tubella, Jordi González, Antonio Department of Computer Architecture Universitat Politècnica de Catalunya Barcelona Spain Intel Barcelona Research Center Barcelona Spain

ISBN: (纸本)9783642368820

Intrusion Detection Systems (IDS) have emerged as one of the most promising ways to secure systems in the network. To be effective against evasion attempts, the IDS must provide tight bounds on performance. Otherwise an adversary can bypass the IDS by carefully crafting and sending packets that throttle it. This can render the IDS ineffective, thus resulting in the network becoming vulnerable. We present a performance throttling attack mounted against the computationally intensive string matching algorithm. This algorithm performs string matching by traversing a finite-state-machine (FSM). We observe that there are some input bytes that sequentially traverse a chain of 30 pointers. This chain of traversal drastically degrades performance, and we observe a 22X performance drop in comparison to the average case performance. We investigate hardware and software mechanisms to counter this performance degradation. The software mechanism is targeted for commodity general purpose CPUs. While the hardware-based mechanism uses a parallel traversal suitable for network processor architectures. Our results show that our proposed mechanisms significantly improves (by over 3X magnitude) string matching algorithm's worst performing cases. © 2013 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Dwmh: An improved algorithm based on WM for large-scale pattern set

引用

2013 International Conference on Advances in Materials Science and Manufacturing Technology, AMSMT 2013

作者： Xu, Xiao Ning Li, Ai Ping Zhu, Jun Xing Computer College National University of Defense Technology Changsha China

ISBN: (纸本)9783037857984

string matching algorithm is one of the key technologies in numerous network security applications and systems. Nowadays, the increasing network bandwidth and pattern set size both call for high speed string matching algorithm for large-scale pattern set. An improved algorithm based on WM algorithm for large-scale pattern set is proposed in this paper. The presented multiple pattern string matching algorithm, DWMH, which we call in brief, combines the idea of Horspool algorithm with WM algorithm and applies the method of double hash to revise WM's HASH table to achieve better performance. Our extensive experiments demonstrated that DWMH algorithm is more efficient than WM algorithm, particularly when the size of pattern set becomes large-scale. © (2013) Trans Tech Publications, Switzerland.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Fast Multiple string Matching Using Streaming SIMD Extensions Technology

Fast Multiple String Matching Using Streaming SIMD Extension...

引用

19th International Symposium on string Processing and Information Retrieval (SPIRE) / 8th Latin American Web Congress (LA-WEB)

作者： Faro, Simone Kulekci, M. Oguzhan Univ Catania Dipartimento Matemat & Informat I-95124 Catania Italy TUBITAK Natl Res Inst Elect Cryptol TR-41470 Gebze Turkey

ISBN: (纸本)9783642341083;9783642341090

searching for all occurrences of a given set of patterns in a text is a fundamental problem in computer science with applications in many fields, like computational biology and intrusion detection systems. In the last two decades a general trend has appeared trying to exploit the power of the word RAM model to speed-up the performances of classical string matching algorithms. This study introduces a filter based exact multiple string matching algorithm, which benefits from Intel's SSE (streaming SIMD extensions) technology for searching long strings. Our experimental results on various conditions show that the proposed algorithm outperforms other solutions, which are known to be among the fastest in practice.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Improved bit-parallel string matching algorithm overcoming computer word size limitation

Improved bit-parallel string matching algorithm overcoming c...

引用

2012 1st International Conference on Recent Advances in Information Technology, RAIT-2012

作者： Sharma, Kumar Singh, Alok Agarwal, Suneeta Pandey, Kusum Lata Prasad, Rajesh Dept. of CSE MNNIT Allahabad India Department of Physics Ewing Christian College Allahabad-211003 India Department of Computer Science and Engineering Ajay Kumar Garg Engineering College Ghaziabad-201009 India

ISBN: (纸本)9781457706974

algorithms that uses bit-wise operations are known as bit-parallel algorithms. Technique of bit-parallelism has been very useful in string matching area since the introduction of the Shift-Or algorithm. In this algorithm, the input pattern length (m) is required to be less than the computer word size (W) to benefit from the full power of bit-parallelism. In the past, BLIM (Bit-parallel length independent matching) has been used to solve this word length problem efficiently. In this study, we propose a method that improves the efficiency of the BLIM algorithm further. This algorithm uses multiple characters to compute the value by which each text window is to be shifted during matching. Experimental results indicate that the proposed algorithm is faster than BLIM algorithm while retaining its main advantage. © 2012 IEEE.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Constant-time word-size string matching

Constant-time word-size string matching

引用

23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012

作者： Breslauer, Dany GĄsieniec, Leszek Grossi, Roberto Caesarea Rothschild Institute University of Haifa Haifa Israel University of Liverpool Liverpool United Kingdom Dipartimento di Informatica Università di Pisa Pisa Italy

ISBN: (纸本)9783642312649

We present a novel string-matching algorithm that requires constant time for text scanning in an unusual model where (a) the input pattern and text are each packed into a single word, (b) the output is a one word bit-mask identifying the pattern occurrences in the text, and (c) there are constant-time arithmetic, bitwise, and shift instructions that operate on words whose size is proportional to the arbitrarily long input length. Our bit-parallelism techniques build upon and also greatly simplify existing parallel random access machine algorithms by using two "simple structure" rather than "small size" deterministic samples, i.e., one deterministic sample is very small (size two), while the other is a potentially very long prefix of the pattern. Pattern preprocessing takes time proportional to the word size. Our results also establish, by recent reductions, new bounds for the packed string matching problem. © 2012 Springer-Verlag.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

A fast exact string matching algorithms based on greedy jump and QF

A fast exact string matching algorithms based on greedy jump...

引用

IET International Conference on Information Science and Control Engineering 2012, ICISCE 2012

作者： Chen, Zhiteng Liu, Lijun Fan, Hongbo Huang, Qingsong Yin, Qi Department of Computer Science Kunming University of Science and Technology 650500 China Computer Technology Application Key Laboratory of Yunnan Province 650500 China Department of Biomedical Engineering Kunming University of Science and Technology 650500 China

ISBN: (纸本)9781849196413

string matching is a basic problem of computer science and it has been widely used in many important application fields. To date, QF is one of the fastest exact single pattern string matching algorithms for long patterns. In this paper, we improved the QF algorithm by introducing the greedy jump method and gained a serial of exact single pattern string matching algorithms named Greedy QF. Experimental results indicated that Greedy QF is faster than QF in most of case and Greedy QF is faster than other known algorithms in many cases for long patterns on our platform.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Comparison of two-dimensional string matching algorithms

Comparison of two-dimensional string matching algorithms

引用

2012 International Conference on Computer Science and Electronics Engineering, ICCSEE 2012

作者： Chang, Chengguo Wang, Hui Department of Information Engineering North China University of Water Resources and Electric Power Zhengzhou China

ISBN: (纸本)9780769546476

string matching is a special kind of pattern recognition problem, which finds all occurrences of a given pattern string in a given text string. The technology of two-dimensional string matching is applied broadly in many information processing domains. A good two-dimensional string matching algorithm can effectively enhance the searching speed. In this paper, the KMP algorithm, Rabin-Karp algorithm and their combinatorial are presented and compared, by a number of tests at diverse data scales, to validate the efficiency of these three algorithms. © 2012 IEEE.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Fast string matching algorithms for very short patterns

Fast string matching algorithms for very short patterns

引用

IET International Conference on Information Science and Control Engineering 2012, ICISCE 2012

作者： Zhou, Yao Fan, Hongbo Liu, Lijun Huang, Qingsong Department of Computer Science Kunming University of Science and Technology 650500 China Computer Technology Application Key Laboratory of Yunnan Province 650500 China Department of Biomedical Engineering Kunming University of Science and Technology 650500 China

ISBN: (纸本)9781849196413

Exact single pattern string matching is a fundamental problem in computer science. To date, the performance of existing string matching algorithms for very short patterns is poor. In this article, based on the most basic exact single pattern string matching algorithm-BF, we presented a serial improved algorithms named HBF by introducing the q-grams method, the loop unrolling method, and modifying the smallest processing unit from byte to integer. Experimental results indicated that HBF is obviously faster than known algorithms for very short patterns on our platform. Meanwhile, the pre-processing phase of HBF just need constant time and space, the worst and the best time complexity are linear and 0(n/w), separately, which w is the number of characters involved in an integer.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Fast single pattern string matching algorithms based on multi-windows and integer comparison

Fast single pattern string matching algorithms based on mult...

引用

IET International Conference on Information Science and Control Engineering 2012, ICISCE 2012

作者： Lv, Zhenhong Fan, Hongbo Liu, Lijun Huang, Qingsong Yin, Qi Department of Computer Science Kunming University of Science and Technology 650500 China Computer Technology Application Key Laboratory of Yunnan Province Kunming 650500 China Department of Biomedical Engineering Kunming University of Science and Technology 650500 China

ISBN: (纸本)9781849196413

string matching is a fundamental problem in computer science. It has been widely used in many important fields. In this article, we presented an integer comparison method to improve the branch performance, and we improved an exact single pattern string matching algorithm-TSW by introducing the multi-window method and the integer comparison method. Therefore, we presented a new serial of algorithms named kSWXC (k Sliding Windows with X Comparison, X is the data type for comparison). Experiment results indicated that kSWXC is faster than other known algorithms for short patterns on our platform.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共22页 << < 7 8 9 10 11 12 13 14 15 16 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：