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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A string matching algorithm based on real scaling

A string matching algorithm based on real scaling

引用

2009 11th IEEE International Conference on e-Health Networking, Applications and Services, Healthcom 2009

作者： Ying, Zhang Guiran, Chang Jie, Jia School of Information Science and Engineering Northeastern University Shenyang China

A good intrusion detection algorithm is important not only in traditional networks, but also in Ad Hoc networks. This paper proposes a novel intrusion detection algorithm based on the real scale of the string matching. Based on properties of Ad Hoc networks, we design a real indexing tree which gives a complete implementation of the algorithm based on the real scale of the string matching. The algorithm can find out all the possible text scaling, and identify all the possible strings with the text scaling. In order to evaluate efficiencies of our algorithms, we use an evaluation data set, widely used in intrusion detection, to test our algorithms. The experimental results show that our algorithm is superior over other sate of art algorithms, and Ad Hoc network security is improved. © 2012 Springer-Verlag GmbH.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Name-Ethnicity Classification and Ethnicity-Sensitive Name Matching 26

Name-Ethnicity Classification and Ethnicity-Sensitive Name M...

引用

26th AAAI Conference on Artificial Intelligence, AAAI 2012

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

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

来源：评论

学校读者我要写书评

暂无评论

Construction of individualized assessment system for traditional Chinese medicine therapeutic effects evaluation

Construction of individualized assessment system for traditi...

引用

2012 International Symposium on Information Technologies in Medicine and Education, ITME 2012

作者： Kan, Hongxing Wang, Zongdian Wang, Guoqiang Hu, Jili Anhui University of Traditional Chinese Medicine Hefei Anhui 230031 China

ISBN: (纸本)9781467321068

Deficiency and independency of the existing supporting data, intervention variability and lucking of consistence led to it difficult to assess the therapeutic effect of Traditional Chinese Medicine (TCM) individually. The study of this work mainly focuses on three aspects to help resolving the difficulty of TCM individual assessment. First, an information platform is established, which will be data-sharing and medical experts involved, by networks and database technology so as to provide data samples for individualized assessment. Second, based on massive data and string matching algorithms provided by the information platform, an indicator database with relative assessment standard is constructed. With the following accumulation and modification, indicator database can generate indicator tree dynamically to satisfy "common" and "personality" requirements for individualized assessment. Third, the dynamic and comprehensive assessment of TCM efficiency is achieved by processing the qualitative and quantitative indicator with a dimensionless representative. The efficacy of TCM individual evaluation information platform is evaluated based on individualized diagnosis, Syndrome Differentiation and Treatment. © 2012 IEEE.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Dictionary-symbolwise flexible parsing

Dictionary-symbolwise flexible parsing

引用

作者： Crochemore, Maxime Giambruno, Laura Langiu, Alessio Mignosi, Filippo Restivo, Antonio Dip. di Matematica e Informatica Università di Palermo Palermo Italy Dept. of Informatics Kings College London London WC2R 2LS United Kingdom Dip. di Informatica Università DellAquila L'Aquila Italy Université Paris-Est Marne-La-Vallée France Université Paris 13 Villetaneuse France

Linear-time optimal parsing algorithms are rare in the dictionary-based branch of the data compression theory. A recent result is the Flexible Parsing algorithm of Matias and Sahinalp (1999) that works when the dictionary is prefix closed and the encoding of dictionary pointers has a constant cost. We present the Dictionary-Symbolwise Flexible Parsing algorithm that is optimal for prefix-closed dictionaries and any symbolwise compressor under some natural hypothesis. In the case of LZ78-like algorithms with variable costs and any, linear as usual, symbolwise compressor we show how to implement our parsing algorithm in linear time. In the case of LZ77-like dictionaries and any symbolwise compressor our algorithm can be implemented in O(nlogn) time. We further present some experimental results that show the effectiveness of the dictionary-symbolwise approach. © 2011 Elsevier B.V.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Turkish document semantic categorization using web-based encyclopedia article association

Turkish document semantic categorization using web-based enc...

引用

International Symposium on INnovations in Intelligent SysTems and Applications, INISTA 2012

作者： Özkan, Savaş Electrical - Electronics Engineering Middle East Technical University Ankara Turkey

ISBN: (纸本)9781467314466

The rapid growth of text, video and image documents sharing on the internet, has created a new research fields to categorize these documents automatically. Especially text document categorization is the one of the hardest processing problem in any language. Also it becomes more difficult in Turkish text document categorization than the any other language since Turkish is an agglutinating language and it includes additional spelling rules. In this paper, we develop a Turkish document semantic categorization system which uses web-based encyclopedia article association to enlarge text words scopes to get better comparison performance over predefined keywords. In word comparisons, we defines some string matching algorithms which are used in literature like Naïve matching, Levenshtein distance, Smith-Waterman distance, Jaro-Winkler distance and Jaccard index. Also we compare the performance of these string matching algorithms on a dataset obtained from three important Turkish newspaper websites, Milliyet, Hurriyet and Ntvmsnbc, under five different semantic categories which includes politic, sport, economy, magazine and technology. © 2012 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

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Sorted range reporting

Sorted range reporting

引用

13th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2012

作者： Nekrich, Yakov Navarro, Gonzalo Department of Computer Science University of Chile Chile

ISBN: (纸本)9783642311543

We consider a variant of the orthogonal range reporting problem when all points should be reported in the sorted order of their x-coordinates. We show that reporting two-dimensional points with this additional condition can be organized (almost) as efficiently as the standard range reporting. Moreover, our results generalize and improve the previously known results for the orthogonal range successor problem and can be used to obtain better solutions for some stringology problems. © 2012 Springer-Verlag.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

An efficient coarse-to-fine indexing technique for fast text retrieval in historical documents

An efficient coarse-to-fine indexing technique for fast text...

引用

10th IAPR International Workshop on Document Analysis Systems, DAS 2012

作者： Roy, Partha Pratim Rayar, Frédéric Ramel, Jean-Yves Laboratoire d'Informatique Université François Rabelais Tours France

ISBN: (纸本)9780769546612

In this paper, we present a fast text retrieval system to index and browse degraded historical documents. The indexing and retrieval strategy is designed in a two level, coarse-to-fine approach, to increase the speed of the retrieval process. During the indexing step, the text parts in the images are encoded into sequences of primitives, obtained from two different codebooks: a coarse one corresponding to connected components and a fine one corresponding to glyph primitives. A glyph consists of a single character or a part of a character according to the shape complexity. During the querying step, the coarse and the fine signature are generated from the query image using both codebooks. Then, a bi-level approximate string matching algorithm is applied to find similar words, using coarse approach first, and then the fine approach if necessary, by exploiting predetermined hypothetical locations. An experimental evaluation on datasets of real life document images, gathered from historical books of different scripts, demonstrated the speed improvement and good accuracy in presence of degradation. © 2012 IEEE.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

A flexible affix byte-level string matching for network content filtering

A flexible affix byte-level string matching for network cont...

引用

2012 International Symposium on Instrumentation and Measurement, Sensor Network and Automation, IMSNA 2012

作者： Wang, Peifeng Li, Li School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China

ISBN: (纸本)9781467324670

string matching is a classical problem in computer science. The technique is widely used in range of applications, such as pattern recognition, spelling checking, intrusion detection, worm containment, information retrieval and so on. string matching using the Deterministic Finite Automaton will be the performance bottleneck of network content filtering. We proposed a flexible affix byte-level string matching algorithm to reduce the unnecessary state transitions problem and reduce memory requirements. This proposed algorithm is based on the Byte-level string matching algorithm and it utilizes dynamic partitioning words to accelerate the matching speed. The proposed string matching algorithm was implemented in Snort for experimental performance evaluation. Comparing with the original algorithm, experimental result shows that the newly presented algorithm has gained much improvement on memory reduction, especially in detecting multiple keywords within a reliable network system. © 2012 IEEE.

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：