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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
24 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

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

主题

219 篇 string searching...
1 篇 multicore proces...
1 篇 memory congestio...
1 篇 cell broadband e...
1 篇 deep packet insp...

机构

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 篇 villa oreste
4 篇 peltola hannu
4 篇 takeda masayuki
4 篇 inenaga shunsuke
4 篇 iliopoulos costa...
4 篇 navarro gonzalo
4 篇 nakashima yuto
4 篇 grossi roberto
4 篇 grabowski szymon

语言

215 篇 英文
2 篇 其他
2 篇 中文

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

共 219 条记录，以下是151-160 订阅

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

详细简洁

排序：

Pattern Search Algorithm in FPGA Implementation View 44

Pattern Search Algorithm in FPGA Implementation View

引用

44th International Convention on Information, Communication and Electronic Technology, MIPRO 2021

作者： Ivosevic, D. Zagreb University of Applied Sciences Zagreb Croatia

ISBN: (纸本)9789532331011

In many fields of research pattern search problems can be viewed as a string-matching problem for which many solutions were developed over the years with varying ease of implementation and characteristics of the pattern and the input . In this work, the design of several string-matching algorithms for logic synthesis implementation is presented. Based on the abstraction of the algorithmic state machine (ASM), the design is converted to VHDL finite state machine and synthesized for FPGA logic. The final implementations are evaluated in performance and resource utilization metrics, and against pure software implementation for the same algorithms using higher-level language. © 2021 Croatian Society MIPRO.

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

The Analysis of KMP Algorithm and its Optimization 2

The Analysis of KMP Algorithm and its Optimization

引用

2nd International Conference on Computer Information Science and Application Technology, CISAT 2019

作者： Lu, Xiangyu Department of Computer Science Harbin Institute of Technology at Weihai Weihai Shandong264200 China

Knuth-Morris-Pratt (KMP) algorithm is an essential manifestation of matching algorithms. This paper presents and discusses the KMP algorithm and some of its optimization. Calculating and searching in a letter numbered table and a new data structure called last-identical array propose a new string searching algorithm L-I-KMP based on the KMP algorithm. This new method is faster than KMP in practice of specific situations. © Published under licence by IOP Publishing Ltd.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Real-word spelling correction using google web 1T n-gram data set

Real-word spelling correction using google web 1T n-gram dat...

引用

ACM 18th International Conference on Information and Knowledge Management, CIKM 2009

作者： Islam, Aminul Inkpen, Diana Department of Computer Science SITE University of Ottawa Ottawa ON Canada

ISBN: (纸本)9781605585123

We present a method for correcting real-word spelling errors using the Google Web 1T n-gram data set and a normalized and modified version of the Longest Common Subsequence (LCS) string matching algorithm. Our method is focused mainly on how to improve the correction recall (the fraction of errors corrected) while keeping the correction precision (the fraction of suggestions that are correct) as high as possible. Evaluation results on a standard data set show that our method performs very well. Copyright 2009 ACM.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

searching texts for signs of aphasia 21

Searching texts for signs of aphasia

引用

21st Conference Information Technologies - Applications and Theory, ITAT 2021

作者： Jajcayová, Tatiana Kubik, Jozef Markošová, Mária Senkovičová, Soňa Dept. of Applied Informatics Faculty of Mathematics Physics and Informatics Comenius University Bratislava Slovakia

Aphasia is a brain disorder that impairs ability to speak or understand spoken language caused by damage of the brain. It is supposed, that it might also influence the vocabulary and complexity of the written texts of the affected people. In this paper, we analyzed two texts (one written before and the second after the onset of aphasia) for signs of aphasia using two different approaches. The first group of text analyzing methods are string matching algorithms able to find all occurrences of a pattern string in another text string. The second group of methods is from the complex networks theory. In scale free word webs, statistical measures are calculated, such as various types of averages and distributions. More modern approach is to analyze the graphlet structure of the word web. Both studies are applied to the same text data in searching for signs of aphasia. Copyright © 2021 for this paper by its authors.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Tuning the EBOM algorithm with suffix jump

Tuning the EBOM algorithm with suffix jump

引用

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

作者： Fan, Hongbo Yao, Nianmin Department of Computer Science and Technology Harbin Engineering University Harbin China

ISBN: (纸本)9783642345210

EBOM is one of the fastest exact single pattern string matching algorithms for short patterns and large alphabet. In this article, a suffix jump method based on the automaton of EBOM (Factor Oracle) is presented. After the suffix jump method applied, an additional jump which the distance is similar with 2-grams bad-char rule is gained and the additional jump distance can be calculated together with the factor method based on Factor Oracle. We combined the suffix jump method with the factor method of EBOM and presented an improved algorithm of EBOM called SufOM2. Experimental results indicated that SufOM2 is very fast for large alphabet and short patterns on our platform. © 2013 Springer-Verlag.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Numeric Representation of strings: An Optimized Approach to Lexical-Comparisons 7

Numeric Representation of Strings: An Optimized Approach to ...

引用

7th International Conference on algorithms, Computing and Artificial Intelligence, ACAI 2024

作者： Warraich, Vikram Singh Broadcom Inc. San JoseCA United States

ISBN: (纸本)9798331529314

Absurd as it may seem, but strings can be treated as numbers for computation purposes. Most computer programs make extensive use of string operations like string-matching or sub-string lookups. Computer systems represent each character of a string with a numeric code. I take this concept further by applying it to arbitrary strings and explore the performance advantages of representing strings numerically. This paper presents a considerably faster approach for arbitrary string Lexicographic Comparisons and substring lookups. It introduces the concept of string-Numbers, which are arbitrary strings represented by unsigned numbers. I validate my theory by running performance tests, which prove that string-Number based operations outperform contemporary string operations for a variety of string based algorithms. Test Results confirm the speed improvements delivered by string-Numbers in the areas of searching, Sorting, Substring-Lookups and string-Matching. © 2024 IEEE.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

A type generator model for adaptive lossy compression

A type generator model for adaptive lossy compression

引用

1997 IEEE International Symposium on Information Theory, ISIT 1997

作者： Zamir, Ram Rose, Kenneth Dept. of EE - Systems Tel Aviv University Tel Aviv 69978 Israel Dept. of ECE University of California Santa Barbara CA 93106 United States

ISBN: (纸本)0780339568

We propose a random coding model which gives insight into the underlying mechanism of lossy string-matching algorithms. This idealised model is based on manipulating types rather than codewords. We model the adaptive codebook as a mixed type random code, whose type distribution evolves with time as its dimension increases. The model behavior exhibits a mechanism of natural type selection which reinforces «good types». © 1997 IEEE.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Name-ethnicity classification and ethnicity-sensitive name matching

Name-ethnicity classification and ethnicity-sensitive name m...

引用

26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference, AAAI-12 / IAAI-12

作者： Treeratpituk, Pucktada Giles, C. Lee Information Sciences and Technology Pennsylvania State University University Park PA 16802 United States Information Sciences and Technology Computer Science and Engineering Pennsylvania State University University Park PA 16802 United States

ISBN: (纸本)9781577355687

Personal names are important and common information in many data sources, ranging from social networks and news articles to patient records and scientific documents. They are often used as queries for retrieving records and also as key information for linking documents from multiple sources. Matching personal names can be challenging due to variations in spelling and various formatting of names. While many approximated name matching techniques have been proposed, most are generic string-matching algorithms. Unlike other types of proper names, personal names are highly cultural. Many ethnicities have their own unique naming systems and identifiable characteristics. In this paper we explore such relationships between ethnicities and personal names to improve the name matching performance. First, we propose a name-ethnicity classifier based on the multinomial logistic regression. Our model can effectively identify name-ethnicity from personal names in Wikipedia, which we use to define name-ethnicity, to within 85% accuracy. Next, we propose a novel alignment-based name matching algorithm, based on Smith-Waterman algorithm and logistic regression. Different name matching models are then trained for different name-ethnicity groups. Our preliminary experimental result on DBLP's disambiguated author dataset yields a performance of 99% precision and 89% recall. Surprisingly, textual features carry more weight than phonetic ones in name-ethnicity classification. Copyright © 2012, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共22页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：