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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

78,668 篇 会议
4,290 篇 期刊文献

馆藏范围

82,958 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

17,626 篇 工学
- 6,927 篇 计算机科学与技术...
- 6,761 篇 电气工程
- 2,980 篇 信息与通信工程
- 2,680 篇 控制科学与工程
- 2,477 篇 软件工程
- 1,636 篇 电子科学与技术（可...
- 1,501 篇 仪器科学与技术
- 1,416 篇 机械工程
- 247 篇 航空宇航科学与技...
- 235 篇 生物医学工程（可授...
- 202 篇 网络空间安全
- 196 篇 交通运输工程
- 140 篇 测绘科学与技术
- 131 篇 生物工程
- 95 篇 材料科学与工程（可...
- 91 篇 动力工程及工程热...
- 83 篇 核科学与技术
- 69 篇 光学工程
1,906 篇 理学
- 955 篇 系统科学
- 515 篇 物理学
- 199 篇 数学
- 153 篇 生物学
- 79 篇 地球物理学
1,750 篇 管理学
- 1,686 篇 管理科学与工程(可...
505 篇 文学
- 505 篇 新闻传播学
247 篇 医学
- 180 篇 临床医学
140 篇 农学
- 100 篇 作物学
71 篇 艺术学
- 71 篇 设计学（可授艺术学...
55 篇 教育学
- 54 篇 教育学
51 篇 军事学
- 51 篇 军队指挥学
36 篇 经济学
7 篇 法学

主题

82,958 篇 algorithm design...
5,906 篇 clustering algor...
5,302 篇 heuristic algori...
5,277 篇 computer science
5,158 篇 optimization
4,677 篇 signal processin...
4,549 篇 hardware
4,068 篇 genetic algorith...
3,996 篇 computational mo...
3,980 篇 convergence
3,964 篇 performance anal...
3,643 篇 data mining
3,580 篇 mathematical mod...
3,392 篇 testing
3,250 篇 routing
2,987 篇 educational inst...
2,977 篇 robustness
2,964 篇 equations
2,956 篇 partitioning alg...
2,871 篇 delay

机构

90 篇 ibm thomas j. wa...
76 篇 department of el...
71 篇 school of comput...
51 篇 department of el...
49 篇 state key labora...
49 篇 school of electr...
46 篇 tsinghua univers...
45 篇 institute for in...
45 篇 school of electr...
44 篇 school of comput...
42 篇 school of comput...
40 篇 school of inform...
38 篇 department of el...
38 篇 department of co...
36 篇 institute of inf...
35 篇 department of co...
35 篇 department of co...
33 篇 department of el...
33 篇 department of el...
32 篇 department of co...

作者

88 篇 lei wang
62 篇 yu wang
57 篇 jun zhang
51 篇 jun wang
43 篇 jian wang
40 篇 bin wang
39 篇 hui wang
37 篇 jing zhang
37 篇 li li
33 篇 wei wang
28 篇 qiang zhou
28 篇 slawomir koziel
27 篇 rui wang
26 篇 xi chen
25 篇 min huang
25 篇 wayne luk
23 篇 jie yang
22 篇 hisao ishibuchi
21 篇 feng liu
21 篇 ming chen

语言

81,760 篇 英文
854 篇 其他
337 篇 中文
5 篇 俄文
1 篇 西班牙文
1 篇 斯洛伐克文

检索条件"主题词=Algorithm Design And Analysis"

共 82958 条记录，以下是4531-4540 订阅

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

详细简洁

排序：

Meme extraction and tracing in crisis events

Meme extraction and tracing in crisis events

引用

IEEE International Conference on Intelligence and Security Informatics, ISI

作者： Saike He Xiaolong Zheng Jiaojiao Wang Zhijun Chang Yin Luo Daniel Zeng Chinese Academy of Sciences Institute of Automation Beijing China School of Management and Economics Beijing Institute of Technology Beijing China University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781509038664

The proliferation of social media has increased the competition among different memes, which can be free texts, trending catchphrases, or micro media. As human attention is limited, these memes compete with each other, and go in and out of popularity at a rapid pace, sometimes even faster than we can recognize. Popular memes often shape the mindsets of online communities, and also shed light on their future tendencies. Considering the huge volume of memes generated and their continuous mutations, extracting and tracing online memes automatically is rather challenging. In this paper, we propose an automatic meme extraction algorithm. The proposed algorithm extracts massive memes based on phrases independency, and clusters phrase variants of a single meme efficiently. Evaluation on measles outbreak in the USA in 2015 indicates that the proposed algorithm could extract typical memes reflecting the fierce campaign between the pro-vaccination community and the anti-vaccination community. In both communities, memes are power-law distributed, and popular ones have many variants that appear more frequently. By tracing the evolution of online memes, we uncover that popular memes converge and generate peaks at times. Though the pro-vaccination community and the anti-vaccination community may focus on similar memes, they comprehend memes from totally different perspectives and deliver opposing opinions of measles vaccination.

关键词： Clustering algorithms algorithm design and analysis Context Twitter Media Shape

来源：评论

学校读者我要写书评

暂无评论

A Survey on current key issues and status in cryptography

A Survey on current key issues and status in cryptography

引用

International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)

作者： M. Guru Vimal Kumar U.S. Ragupathy Department of EIE Kongu Engineering College Perundurai Erode

ISBN: (纸本)9781467393393

Internet applications are increased and growing at very fast. Owing towards the technological development, secured way of data transmission over the internet is becoming a questioning task. Intruders hack the data and use it for their beneficial purpose. To avoid these undesirable acts, cryptography is used to ensure security of the covert and secure message. Although encrypted data is difficult to decipher, it is relatively easy to detect. Strong encryption algorithms and proper key management techniques for the systems will helps in achieving confidentiality, authentication and integrity of data. In this research work various encryption (symmetric and asymmetric) algorithms have been studied. Literature Survey has been carried out for cryptography by incorporating key papers related to data encryption based on performance metrics (Security and Time constraints). From this, the observation and future work has been identified.

关键词： Ciphers Encryption algorithm design and analysis Throughput Conferences

来源：评论

学校读者我要写书评

暂无评论

Visualization Method for Efficient Expression of Spatial Information

Visualization Method for Efficient Expression of Spatial Inf...

引用

International Conference on IT Convergence and Security (ICITCS)

作者： Min Gyu Kim Moo Hun Lee Meteorological Convergence Service Lab Hankuk University of Foreign Studies Gyeonggi-do Korea

ISBN: (纸本)9781509037667

A visualization algorithm for efficiently expressing spatial information based on web map services is developed in this research. Spatial information has a limited ability for expressing the desired information not only because it requires considerable time to express itself through a map as it is composed of complex points such as lines and polygons, but also because it has to utilize an OpenAPI that has a limitations in web map services. Therefore, the visualization method suggested in this research opens and imports only a partial data of the desired area, and it expresses the expanded data through the event detections of client-based map movements. As a result, the time required for an expression could be reduced; thus, it is ascertained that this method will be efficient for system I/O's also, because it does not import unnecessary information.

关键词： Data visualization Roads Shape Satellite navigation systems Convergence algorithm design and analysis Event detection

来源：评论

学校读者我要写书评

暂无评论

One-pass online SVM with extremely small space complexity

One-pass online SVM with extremely small space complexity

引用

International Conference on Pattern Recognition

作者： Yangwei Liu Jinhui Xu Department of Computer Science and Engineering State University of New York at Buffalo

ISBN: (纸本)9781509048489

In this paper we consider the problem of training a Support Vector Machine (SVM) online using a stream of data in random order. We provide a fast online training algorithm for general SVM on very large datasets. Based on the geometric interpretation of SVM known as the polytope distance, our algorithm uses a gradient descent procedure to solve the problem. With high probability our algorithm outputs an (ε; δ)-approximation result in constant time and space, which is independent of the size of the dataset, where (ε; δ)-approximation means that the separating margin of the classifier is almost optimal (with error ≤ ε), and the number of misclassified training points is very small (with error ≤ δ). Experimental results show that our algorithm outperforms most of existing online algorithms, especially in the space requirement aspect, while maintaining high accuracy.

关键词： Support vector machines Approximation algorithms Training algorithm design and analysis Training data Pattern recognition Computer science

来源：评论

学校读者我要写书评

暂无评论

Experimental Evaluation of Approximation algorithms for Maximum Distance-Bounded Subgraph Problems

Experimental Evaluation of Approximation Algorithms for Maxi...

引用

International Symposium on Soft Computing and Intelligent Systems (SCIS)

作者： Yuichi Asahiro Tomohiro Kubo Eiji Miyano Department of Information Science Kyushu Sangyo University Fukuoka Japan Department of Systems Design and Informatics Kyushu Institute of Technology Fukuoka Japan

ISBN: (纸本)9781509026791

In this paper we consider two distance-based relaxed variants of the maximum clique problem (MAX CLIQUE), named MAX d-CLIQUE and MAX d-CLUB: A d-clique in a graph G is a subset S ⊆ V(G) of vertices such that for pairs of vertices u, v ε S, the distance between u and v is at most d in G. A d-club in a graph G is a subset S' ⊆ V(G) of vertices that induces a subgraph of G of diameter at most d. MAX d-CLIQUE and MAX d-CLUB ask to find a maximum d-clique and a maximum d-club in a given unweighted graph, respectively. MAX 1-CLIQUE and MAX 1-CLUB cannot be efficiently approximated within a factor of n1-ε for any ε > 0 unless P = NP since they are identical to MAX CLIQUE [1], [2]. Also, it is known [3], [4] that it is NP-hard to approximate MAX d-CLIQUE and MAX d-CLUB to within a factor of n1/2-ε for any fixed d ≥ 2 and any ε > 0. As for approximability of MAX d-CLIQUE and MAX d-CLUB, [3] proposes a polynomial-time algorithm, called ByFindStard, and proves that its approximation ratio is O(n1/2) and O(n2/3) for any even d ≥ 2 and for any odd d ≥ 3, respectively. Very recently, a polynomial-time algorithm, called ByFindStar2d, achieving an optimal approximation ratio of O(n1/2) for MAX d-CLIQUE and MAX d-CLUB is designed for any odd d ≥ 3 in [4]. In this paper we implement those approximation algorithms and evaluate their quality empirically for random graphs Gn,p, which have n vertices and each edge appears with probability p. The experimental results show that (i) ByFindStar2d of approximation ratio O(n1/2) can find larger d-clubs (d-cliques) than ByFindStard of approximation ratio O(n2/3) for odd d, (ii) the size of d-clubs (d-cliques) output by ByFindStard is the same as ones by ByFindStar2d for even d, and (iii) ByFindStard can find the same size of d-clubs (d-cliques) much faster than ByFindStar2d.

关键词： Approximation algorithms algorithm design and analysis Intelligent systems Social network services Graph theory Image edge detection Computational modeling

来源：评论

学校读者我要写书评

暂无评论

analysis and comparison of algorithms in advanced web clusters solutions

Analysis and comparison of algorithms in advanced web cluste...

引用

Proceedings of the International Convention MIPRO

作者： D. Alagić K. Arbanas NTH Media Varaždin Croatia Paying Agency for Agriculture Fisheries and Rural Development Zagreb Croatia

Today's websites (applications) represent an essential part of nearly every business system, therefore it is unacceptable for them to be unavailable due to the ever-increasing competition on the global market. Consequently, such systems are becoming more and more complex to allow for their high availability. To achieve a higher system availability, a greater scalability is used in creating the so-called Web farms or Web clusters. This system requires much more computer power than the traditional solutions. Since such systems are very expensive and complex in nature, the question is how to obtain the best possible results with the least amount of investment. To achieve that, it is necessary to take a look at the component which contains the information on the request or traffic amount, and that is the HTTP/HTTPS load balancer. The system is based on several algorithms, however, there are no comprehensive analyses that indicate which algorithm to use, depending on the Web cluster and the expected amount of traffic. For this reason, this paper provides a detailed comparison of several frequently used algorithms in several different Web cluster scenarios, i.e. loads. Also, examples are given as to when to use a certain algorithm.

关键词： Web servers Random access memory algorithm design and analysis Web sites Heuristic algorithms Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

An Efficient Approach for Mining Frequent Patterns over Uncertain Data Streams

An Efficient Approach for Mining Frequent Patterns over Unce...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Md. Badi-Uz-Zaman Shajib Md. Samiullah Chowdhury Farhan Ahmed Carson K. Leung Adam G.M. Pazdor Department of Computer Science and Engineering University of Dhaka Dhaka Bangladesh Department of Computer Science University of Manitoba Winnipeg MB Canada

ISBN: (纸本)9781509044603

Knowledge discovery in big data is one of most interesting topics in state-of-the-art research, and frequent patterns mining is a major task. With the rapid growth of modern technology, high volumes of data-which are of different veracities (i.e., may be precise or uncertain)-are flowing at a high velocity all over the world. Properties of data temporally changes with changes in the people's interests, which make the data dynamic. Due to the uncertainty and dynamic properties of data, finding appropriate and efficient approach to ensure the efficient usage of available resources has become a great challenge. In this paper, we design a new memory-efficient data structure, called Uncertain Stream (US)-tree, which stores recent meta-data. We also develop a probabilistic, sliding window based, efficient algorithm-called Uncertain Stream Frequent Pattern (USFP)-growth-for mining frequent patterns from uncertain data streams. Our comprehensive performance evaluation shows that USFP-growth is correct and efficient when compared with recent related approaches.

关键词： Data mining algorithm design and analysis Uncertainty Itemsets Upper bound Big data Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Smart compiler embedded computing systems based on cluster parallelism

Smart compiler embedded computing systems based on cluster p...

引用

Mediterranean Conference on Embedded Computing (MECO)

作者： Vladimir Ruchkin Marat Mahmudov Vitaly Romanchuk Vladimir Fulin Boris Kostrov Ekaterina Ruchkina Engineering Chair Ryazan State University Ryazan Russian Federation Ryazan State Radio Engineering University Ryazan Russian Federation

ISBN: (纸本)9781509022236

The current research looks at possibilities of creating a smart compiler based on explicit and implicit cluster parallelism, and suggests a design option. With this view, smart compilation procedures are studied, and we also analyze the algorithms of explicit parallelism, and define a production model of and expert system to monitor operations and build a route. We define an algorithm of implicit parallelism of multi-criterion fuzzy choice based on definitions of algorithms of “criteria value evaluation” and “route effectiveness evaluation”.

关键词： Parallel processing algorithm design and analysis Data processing Microprocessors Production Expert systems Fuzzy sets

来源：评论

学校读者我要写书评

暂无评论

Selective weights based median filtering approach for impulse noise removal of brain MRI images

Selective weights based median filtering approach for impuls...

引用

International Conference on Electrical, Electronics, Communication, Computer and Optimization Techniques (ICEECCOT)

作者： K. V. Sudheesh L. Basavaraj Dept. of Electronics and Communication ATME College of Engineering Mysuru India

ISBN: (纸本)9781509046980

In medical image processing, the accurate understanding and analysis of medical images is progressively challenging and demanding in providing the clear detection and diagnosis of the diseases. A very important and primary step in automatic detection of abnormalities in brain MRI images is reliable elimination of presence of the noise in the acquired images. Evaluation of the various noise removal algorithms to estimate the noise parameters is widely recognized as a typical standards for medical image processing solicitations. Validation of such brain MRI images can be done based on the evaluation through various statistical noise parameters. But the enactment of noise removal procedure profoundly depend on superiority of input brain MRI images and image processing skills employed for restoring original quality of brain MRI image by eliminating noises present in it and make the input image free from noises. This paper projects the type of noise existing in the brain MRI images and also removal of noises from the images using different types of noise elimination filters. The work proposes the design and implementation of the simple and efficient filtering technique for removal of noises in medical images specifically for brain MRI images and to upsurges the performance capabilities of the method. The experimental outcomes of suggested filtering algorithm are compared with the additional existing filtering approaches. The simulated results of filtering process executed on a standard set of assessment images shows that proposed algorithm provides good results with high SNR and low MSE values for the noise level of 95% and outperforms the conventional steps for removal of noise present in brain MRI images.

关键词： Magnetic resonance imaging Filtering algorithms Noise measurement Filtering theory algorithm design and analysis Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

Intelligent control scheme for output efficiency improvement of parallel inverters

Intelligent control scheme for output efficiency improvement...

引用

International Conference on Computer and Information Science (ACIS)

作者： Wei-Hao Huang Shu-Hung Liao Jen-Hao Teng Ting-Yen Hsieh Bo-Ren Lan Chih-Chieh Chiang Department of Electrical Engineering National Sun Yat-Sen University Kaohsiung Taiwan Green Energy and Environment Research Laboratories Industrial Technology Research Institute Hsinchu Taiwan

ISBN: (纸本)9781509008070

Parallel inverters are often used for the interconnection of Renewable Energy Generation Systems (REGSs); however, the output efficiency using the conventional current-sharing control scheme is low at light loads. Therefore, an intelligent control scheme for output efficiency enhancement of parallel inverters is proposed in this paper. The proposed control scheme is based on the output efficiency curve of a single inverter and then an artificial-intelligence-based algorithm is used to find the optimal output efficiency of parallel inverters. The integration of the proposed control scheme into a Photovoltaic Generation System (PVGS) with a rated output power of 20kW interconnected by 10 inverters with rated output power of 2kW is simulated in this paper. Simulation results demonstrate the performance of the proposed intelligent control scheme in output efficiency improvement of parallel inverters at light loads.

关键词： Inverters Power generation Intelligent control algorithm design and analysis Renewable energy sources Simulation Voltage measurement

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 450 451 452 453 454 455 456 457 458 459 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：