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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是121-130 订阅

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

详细简洁

排序：

Simple Real-Time Constant-Space string Matching

Simple Real-Time Constant-Space String Matching

引用

22nd Annual Symposium on Combinatorial Pattern Matching (CPM)

作者： Breslauer, Dany Grossi, Roberto Mignosi, Filippo Univ Haifa Caesarea Rothchild Inst IL-31999 Haifa Israel Univ Pisa Dept Informat I-56100 Pisa Italy Univ Aquila Dipartimento Informat I-67100 Laquila Italy

We use a simple observation about the locations of critical factorizations to derive a real-time variation of the Crochemore-Perrin constant-space string matching algorithm. The real-time variation has a simple and ef... 详细信息

ISBN: (纸本)9783642214585

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Real-Time Streaming string-Matching

Real-Time Streaming String-Matching

引用

22nd Annual Symposium on Combinatorial Pattern Matching (CPM)

作者： Breslauer, Dany Galil, Zvi Univ Haifa Caesarea Rothchild Inst IL-31999 Haifa Israel Georgia Inst Technol Coll Comp Atlanta GA 30332 USA

This paper presents a real-time randomized streaming string matching algorithm that uses O(log m) space. The algorithm only makes one-sided small probability false-positive errors, possibly reporting phantom occurrenc... 详细信息

ISBN: (纸本)9783642214585

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

SimSem: Fast approximate string matching in relation to semantic category disambiguation 49

SimSem: Fast approximate string matching in relation to sema...

引用

2011 Workshop on Biomedical Natural Language Processing, BioNLP 2011 at the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, ACL-HLT 2011

作者： Stenetorp, Pontus Pyysalo, Sampo Tsujii, Jun'ichi Tsujii Laboratory Department of Computer Science The University of Tokyo Tokyo Japan Aizawa Laboratory Department of Computer Science The University of Tokyo Tokyo Japan Microsoft Research Asia Beijing China

ISBN: (纸本)9781932432916

In this study we investigate the merits of fast approximate string matching to address challenges relating to spelling variants and to utilise large-scale lexical resources for semantic class disambiguation. We integrate string matching results into machine learning-based disambiguation through the use of a novel set of features that represent the distance of a given textual span to the closest match in each of a collection of lexical resources. We collect lexical resources for a multitude of semantic categories from a variety of biomedical domain sources. The combined resources, containing more than twenty million lexical items, are queried using a recently proposed fast and efficient approximate string matching algorithm that allows us to query large resources without severely impacting system performance. We evaluate our results on six corpora representing a variety of disambiguation tasks. While the integration of approximate string matching features is shown to substantially improve performance on one corpus, results are modest or negative for others. We suggest possible explanations and future research directions. Our lexical resources and implementation are made freely available for research purposes at: http://***/ninjin/simsem. © 2011 Association for Computational Linguistics

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Extended approximate string matching algorithms to detect name aliases

Extended approximate string matching algorithms to detect na...

引用

IEEE International Conference on Intelligence and Security Informatics

作者： Shaikh, Muniba Memon, Nasrullah Wiil, Uffe Kock Maersk Mc-Kinney Moller Institute University of Southern Denmark Denmark

ISBN: (纸本)9781457700828

This paper focuses on the problem of alias detection based on orthographic variations of Arabic names. Alias detection is the process to identify different variants of the same name. To detect aliases based on orthographic variations, the approximate string matching (ASM) algorithms are widely used that measure the similarities between two strings (i.e., the name and alias). ASM algorithms work well to detect various type of orthographic variations but still there is a need to develop techniques to detect correct aliases of Arabic names that occur due to the translation of Arabic names into English. An extension to widely used ASM algorithms is proposed to detect the name aliases that generate as a result of transliteration. This paper aims to improve the accuracy of the basic ASM algorithms in order to detect correct aliases. The experimental evaluation shows that proposed extension increases the accuracy of the basic algorithms to a considerable level. © 2011 IEEE.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

An improved algorithm for boyer-moore string matching in chinese information processing

An improved algorithm for boyer-moore string matching in chi...

引用

2011 International Conference on Computer Science and Service System, CSSS 2011

作者： Yuan, Lingling School of Literature and Media Henan Polytechnic University Jiaozuo China

ISBN: (纸本)9781424497638

BM string matching algorithm is the most famous and efficient in the model matching. Based on it, this article made use of the continuous series of characters which are not in the model string need not be compared to change the model string comparing order. The results indicated that the improvement algorithm for BM string matching which proposed by this article can efficiently decrease the time of string matching and comparing, improve the efficiency string matching algorithm. © 2011 IEEE.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Enhancement of string matching queries on albanian names for kosovo civil registry

Enhancement of string matching queries on albanian names for...

引用

Int. Conf. on Applied, Numerical and Computational Mathematics, ICANCM'11, Int. Conf. on Computers, Digital Communications and Computing, ICDCC'11, Int. Conference on Applied Social Science, Social Economy and Digital Convergence, IC-ASSSE-DC'11

作者： Rexha, Blerim RaçA, Valon Dika, Agni Faculty of Electrical and Computer Engineering University of Prishtina Kodra e Diellit p.n. 10000 Prishtina Serbia

ISBN: (纸本)9781618040305

Civil Registry Information System serves as an essential data source for all e-government services. searching for a citizen's data in Civil Registry Database is usually done by providing unique keywords such as name. Due to the similar pronunciation of some Albanian language consonants, for example gj [j] and xh [d¯3], problems arise in finding citizens data, names of which are similarly pronounced, despite different spelling. This paper presents a novel approach for string matching algorithm based on Albanian names. For this paper Levenshtein distance, American Soundex and modified Soundex results are compared on a database of 271.000 citizens of Prishtina municipality. The modified Soundex algorithm accommodates basic rules of pronunciation in Albanian language and its accuracy and efficiency is better than Levenshtein distance and American Soundex.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

On-Line Construction of Position Heaps

On-Line Construction of Position Heaps

引用

18th International Symposium on string Processing and Information Retrieval

作者： Kucherov, Gregory Univ Paris Est Marne La Vallee France

ISBN: (纸本)9783642245824;9783642245831

We propose a simple linear-time on-line algorithm for constructing a position heap for a string [EMOW11]. Our definition of position heap differs slightly from the one proposed in [EMOW11] in that it considers the suffixes ordered in the descending order of length. Our construction is based on classic suffix pointers and resembles the Ukkonen's algorithm for suffix trees [Ukk95]. Using suffix pointers, the position heap can be extended into the augmented position heap that allows for a linear-time string matching algorithm [EMOW11].

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Automatic protocol signature generation framework for deep packet inspection

Automatic protocol signature generation framework for deep p...

引用

5th International ICST Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS 2011

作者： SzabO, Géza Turányi, Zoltán Toka, LászlO Molnár, Sándor Santos, Alysson TrafficLab Ericsson Research Hungary HSN Lab BUTE Hungary Eurecom France High Speed Networks Lab. Dept. of Telecomm. and Mediainformatics Budapest Univ. of Technology and Economics Hungary Networking and Telecomm.Research Group Universidade Federal de Pernambuco Recife Brazil

ISBN: (纸本)9781936968091

We present an automatic application protocol signature generating framework for Deep Packet Inspection (DPI) techniques with performance evaluation. We propose to utilize algorithms from the field of bioinformatics. We also present preprocessing methods to accelerate our system. Moreover, we developed several postprocessing techniques to refine the accuracy of the results. Finally, we propose a DPI system, based on approximate string matching, and find it a viable, novel alternative for the refinement of exact string matching algorithm's results. Copyright © 2011 ICST.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Tile optimization for area in FPGA based hardware acceleration of peptide identification

Tile optimization for area in FPGA based hardware accelerati...

引用

2011 6th International Conference on Industrial and Information Systems, ICIIS 2011

作者： Vidanagamachchi, S.M. Dewasurendra, S.D. Ragel, R.G. Niranjan, M. Department of Computer Engineering Faculty of Engineering University of Peradeniya Peradeniya Sri Lanka School of Electronics and Computer Science University of Southampton United Kingdom

ISBN: (纸本)9781457700354

Advances in life sciences over the last few decades have lead to the generation of a huge amount of biological data. Computing research has become a vital part in driving biological discovery where analysis and categorization of biological data are involved. string matching algorithms can be applied for protein/gene sequence matching and with the phenomenal increase in the size of string databases to be analyzed, software implementations of these algorithms seems to have hit a hard limit and hardware acceleration is increasingly being sought. Several hardware platforms such as Field Programmable Gate Arrays (FPGA), Graphics Processing Units (GPU) and Chip Multi Processors (CMP) are being explored as hardware platforms. In this paper, we give a comprehensive overview of the literature on hardware acceleration of string matching algorithms, we take an FPGA hardware exploration and expedite the design time by a design automation technique. Further, our design automation is also optimized for better hardware utilization through optimizing the number of peptides that can be represented in an FPGA tile. The results indicate significant improvements in design time and hardware utilization which are reported in this paper. © 2011 IEEE.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

A Taxonomy of Some Right-to-Left string-Matching algorithms

A Taxonomy of Some Right-to-Left String-Matching Algorithms

引用

18th International Workshop on Functional and Constraint Logic Programming

作者： Hernandez, Manuel Univ Tecnol Mixteca Huajuapan De Leon Oaxaca Mexico

ISBN: (纸本)9783642119989

This paper presents a taxonomy of some exact, right-to-left, string-matching algorithms. The taxonomy is based on results obtained by using logic program transformation over a naive and nondeterministic specification. A derivation of the search part and some notes about the preprocessing part of each algorithm is presented. The derivations show several design decisions behind each algorithm, and allow us to organize the algorithms within a taxonomic tree, giving us a better understanding of these algorithms and possible mechanical procedures to derive them.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共22页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：