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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

194 篇 会议
22 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

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

主题

216 篇 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

语言

213 篇 英文
2 篇 中文
1 篇 其他

检索条件"主题词=String searching algorithms"

共 216 条记录，以下是11-20 订阅

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

详细简洁

排序：

DFC: Accelerating string Pattern Matching for Network Applications 13

DFC: Accelerating String Pattern Matching for Network Applic...

引用

13th USENIX Symposium on Networked Systems Design and Implementation (NSDI)

作者： Choi, Byungkwon Chae, Jongwook Jamshed, Muhammad Park, KyoungSoo Han, Dongsu Korea Adv Inst Sci & Technol Daejeon South Korea

ISBN: (纸本)9781931971294

Middlebox services that inspect packet payloads have become commonplace. Today, anyone can sign up for cloud-based Web application firewall with a single click. These services typically look for known patterns that might appear anywhere in the payload. The key challenge is that existing solutions for pattern matching have become a bottleneck because software packet processing technologies have advanced. The popularization of cloud-based services has made the problem even more critical. This paper presents an efficient multi-pattern string matching algorithm, called DFC. DFC significantly reduces the number of memory accesses and cache misses by using small and cache-friendly data structures and avoids instruction pipeline stalls by minimizing sequential data dependency. Our evaluation shows that DFC improves performance by 2.0 to 3.6 times compared to state-of-the-art on real traffic workload obtained from a commercial network. It also outperforms other algorithms even in the worst case. When applied to middlebox applications, such as network intrusion detection, anti-virus, and Web application firewalls, DFC delivers 57-160% improvement in performance.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

A LANGUAGE APPROACH TO string searching EVALUATION 3rd

引用

3RD ANNUAL SYMP ON COMBINATORIAL PATTERN MATCHING

作者： REGNIER, M INRIA Le Chesnay 78153 France

ISBN: (纸本)3540560246

We propose a general framework to derive average performance of string searching algorithms that preprocess the pattern. It relies mainly on languages and combinatorics on words, joined to some probabilistic tools. The approach is quite powerful: although we concentrate here on Morris-Pratt and Boyer-Moore-Horspool, it applies to a large class of algorithms. A fairly general character distribution is assumed, namely a Markovian one, suitable for applications such as natural languages or biological databases searching. The average searching time, expressed as the number of text-pattern comparisons, is proven to be asymptotically Kn and the linearity constant is given. © Springer-Verlag Berlin Heidelberg 1992.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

High-speed string searching against large dictionaries on the Cell/BE processor

High-speed string searching against large dictionaries on th...

引用

10th Workshop on Advances in Parallel and Distributed Computational Models/22nd IEEE International Parallel and Distributed Processing Symposium

作者： Scarpazza, Daniele Paolo Villa, Oreste Petrini, Fabrizio IBM Corp Thomas J Watson Res Ctr Cell Solut Dept Yorktown Hts NY 10598 USA Politecn Milan Dipartimento Elettron & Informazione I-20133 Milan Italy

ISBN: (纸本)9781424416936

Our digital universe is growing, creating exploding amounts of data which need to be searched, filtered and protected. string searching is at the core of the tools we use to curb this explosion, such as search engines, network intrusion detection systems, spam filters, and anti-virus programs. But as communication speed grows, our capability to perform string searching in real-time seems to fall behind. Multi-core architectures promise enough computational power to cope with the incoming challenge, but it is still unclear which algorithms and programming models to use to unleash this power. We have parallelized a popular string searching algorithm, Aho-Corasick, on the IBM Cell/B.E. processor, with the goal of performing exact string matching against large dictionaries. In this article we propose a novel approach to fully exploit the DMA-based communication mechanisms of the Cell/B.E. to provide an unprecedented level of aggregate performance with irregular access patterns. We have discovered that memory congestion plays a crucial role in determining the performance of this algorithm. We discuss three aspects of congestion: memory pressure, layout issues and hot spots, and we present a collection of algorithmic solutions to alleviate these problems and achieve quasi-optimal performance. The implementation of our algorithm provides a worst-case throughput of 2.5 Gbps, and a typical throughput between 3.3 and 4.4 Gbps, measured on realistic scenarios with a two-processor Cell/B.E. system.

关键词： 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

来源：评论

学校读者我要写书评

暂无评论

A Fast string Matching Algorithm Based on Lowlight Characters in the Pattern 7

A Fast String Matching Algorithm Based on Lowlight Character...

引用

International Conference on Advanced Computational Intelligence

作者： Cao, Zhengjun Yan, Zhenzhen Liu, Lihua Shanghai Univ Dept Math Shanghai Peoples R China Shanghai Maritime Univ Dept Math Shanghai Peoples R China

ISBN: (纸本)9781479972593

string matching is of great importance in pattern recognition. We put forth a new string matching algorithm which matches the pattern from neither the left nor the right end, instead a special position. Comparing with the Knuth-Morris-Pratt algorithm and the Boyer-Moore algorithm, the new algorithm is more flexible to pick the position for starting comparisons. The option really brings it a saving in cost. The method requires a statistical probability table for alphabets which can be set up using evolution strategies for dynamic conditions. If the chosen lowlight character in a given pattern has the probability lambda, the length of the text is n and the length of the pattern is m. then we conjecture that the complexity of the new algorithm is Theta(n/lambda m).

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

TIGHT BOUNDS ON THE COMPLEXITY OF THE BOYER-MOORE string MATCHING ALGORITHM 53

TIGHT BOUNDS ON THE COMPLEXITY OF THE BOYER-MOORE STRING MAT...

引用

2ND ANNUAL SYMP OF THE ASSOC FOR COMPUTING MACHINERY AND THE SOC FOR INDUSTRIAL AND APPLIED MATHEMATICS : DISCRETE algorithms

作者： COLE, R Courant Institute New York University United States

ISBN: (纸本)0897913760

The problem of finding all occurrences of a pattern of length m in a text of length n is considered. It is shown that the Boyer-Moore string matching algorithm performs roughly 3n comparisons and that this bound is tight up to 0(n/m);more precisely, an upper bound of 3n - n/m comparisons is shown, as is a lower bound of 3»(1 - o(1)) comparisons, as n/m → and m → ∞. While the upper bound is somewhat involved, its main elements provide a quite simple proof of a 4n upper bound for the same algorithm. © 1991 Association for Computing Machinery. All rights reserved.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Fast string Matching with Space-efficient Word Graphs

Fast String Matching with Space-efficient Word Graphs

引用

International Conference on Innovations in Information Technology

作者： Yata, Susumu Morita, Kazuhiro Fuketa, Masao Aoe, Jun-ichi Univ Tokushima Inst Sci & Technol Tokushima Japan

ISBN: (纸本)9781424433964

string matching is one of the fundamentals in various text-processing applications such as text mining and content filtering systems. This paper describes a fast string matching algorithm using a compact pattern matching machine DAWG. A directed acyclic word graph (DAWG) is traditionally implemented with a 2-dimensional linked list or matrix. However, DAWGs with these structures have drawbacks, the lookup time or the linked list based one is slow and the space requirement of the matrix based one is large. Therefore, this paper proposes a novel DAWG based on a compacted double-array, which overcomes the drawbacks of traditional ones. Experimental results show that the novel DAWG is more efficient than traditional ones.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

A Lightweight Multiple string Matching Algorithm

A Lightweight Multiple String Matching Algorithm

引用

International Conference on Computer Science and Information Technology

作者： Dai, Liuling Xia, Yuning Beijing Inst Technol Sch Comp Sci Beijing Lab Intelligent Informat Technol Beijing 100081 Peoples R China Tsinghua Univ Ctr Speech &Language Technol Beijing 100084 Peoples R China

ISBN: (纸本)9780769533087

string matching is a fundamental issue in computer science. This paper presents a lightweight string matching algorithm for short pattern matching, in which less than 20 keywords are often involved in the pattern set. The new algorithm makes use of condensed hash tables and computes the shift distance after each test by observing the character that immediately passes the test window. Experiments show that the new algorithm improves execution speed and decreases memory requirement. This algorithm is suitable for applications with small pattern set (i.e. containing up to 30 keywords), particularly for embedded equipments.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Experiences with string Matching on the Fermi Architecture

Experiences with String Matching on the Fermi Architecture

引用

24th International Conference on Architecture of Computing Systems

作者： Tumeo, Antonino Secchi, Simone Villa, Oreste Pacific NW Natl Lab Richland WA 99352 USA

ISBN: (纸本)9783642191367

string matching is a computationally intensive procedure which poses significant challenges on current software and hardware implementations. In this paper we present an efficient implementation of the Aho-Corasick string matching algorithm on Graphic Processing Units (GPUs), showing how we progressively redesigned the algorithm and the data structures to fit on the architecture. We then evaluate the implementation on single and multiple Testa C2050 (T20 "Fermi" based) boards, comparing them to the previous Tesla C1060 (T10 based) solutions and equivalent multi-core implementations on x86 CPUs. We discuss the various tradeoffs of the different architectures.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Parallel string Matching 22nd

引用

22nd International European Conference on Parallel and Distributed Computing (Euro-Par)

作者： Pfaffe, Philip Tillmann, Martin Lutteropp, Sarah Scheirle, Bernhard Zerr, Kevin Karlsruhe Inst Technol Karlsruhe Germany

ISBN: (纸本)9783319589435;9783319589428

We explore the benefits of parallelizing 7 state-of-the-art string matching algorithms. Using SIMD and multi-threading techniques we achieve a significant performance improvement of up to 43.3x over reference implementations and a speedup of up to 16.7x over the string matching program grep. We evaluate our implementations on the smart-corpora and the full human genome data set. We show scalability over number of threads and impact of pattern length.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共22页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：