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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A Negation Handling Technique for Sentiment analysis

A Negation Handling Technique for Sentiment Analysis

引用

International Symposium on Collaborative Technologies and Systems

作者： Claudia Diamantini Alex Mircoli Domenico Potena Department of Information Engineering Università Politecnica delle Marche Ancona Italy

Traditional lexicon-based approaches for sentiment analysis are usually not able to model negation, as they do not provide proper techniques to identify the right negation window. In this work we address the problem of the automatic determination of the scope of negation and we present a negation handling algorithm based on dependency-based parse trees. The proposal is based on the use of grammatical relations among words to model a sentence, and hence to determine words that are affected by negation. The proposed algorithm has been coupled with a semantic disambiguation technique to identify the sentiment of a sentence. Experiments on different datasets have proven that our proposal improves the accuracy of the sentiment analysis. The proposed algorithm has been implemented as part of a Social Information Discovery system, which allows for an integrated near-real-time analysis of discussions from multiple social networks.

关键词： Sentiment analysis Analytical models algorithm design and analysis Training data Twitter User-generated content

来源：评论

学校读者我要写书评

暂无评论

Convergence analysis of brain storm optimization algorithm

Convergence analysis of brain storm optimization algorithm

引用

Congress on Evolutionary Computation

作者： Ziwei Zhou Haibin Duan Yuhui Shi School of Automation Science and Electrical Engineering Beihang University Beijing China Xi'an Jiaotong-Liverpool University Suzhou China

ISBN: (纸本)9781509006243

Brain storm optimization (BSO) algorithm is a new kind of swarm intelligence algorithm, which is inspired by collective behavior of human beings. In this paper, a Markov model for brain storm optimization algorithm is derived. The model gives the theoretical probability of the occurrence of each possible population as the number of generation count goes to infinity. Using the Markov model, the convergence of the brain storm optimization is analyzed.

关键词： Markov processes Optimization Sociology Statistics Convergence Storms algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Parallel Adaptive Artificial Fish Swarm algorithm Based on Differential Evolution

Parallel Adaptive Artificial Fish Swarm Algorithm Based on D...

引用

International Symposium on Computational Intelligence and design, ISCID

作者： Guangqiang Li Yawei Yang Fengqiang Zhao Ying Hu Chen Guo Guofeng Wang School of Information Science and Technology Dalian Maritime University Dalian China College of Mechanical and Electronic Engineering Dalian Nationalities University Dalian China

ISBN: (纸本)9781509035595

Artificial fish swarm algorithm (AFSA) is a newly proposed swarm intelligent optimization algorithm. It is proved to be a promising approach to complex engineering problems, yet still there exist some defects of this algorithm. To solve the problem that AFSA has a low rate of convenience, low optimization precision, premature convergence and poor ability of balancing exploitation and exploration, an improved artificial fish swarm algorithm (PAAFSA-DE) is proposed. This algorithm divides the population into two sub groups with the same size, and different adaptive strategies are applied to the two groups respectively to make one group focus on global search and the other on local search. The two sub populations evolve independently and individual migration are conducted regularly to achieve information communication, increase the population diversity and improve convergence rate of algorithm. When the information on the bulletin board does not change for a certain times, the differential evolution strategy will be introduced to make the algorithm escape from local extreme. The comparing simulation results on the benchmark function optimization problems demonstrate that the improved algorithm is feasible and effective. It performs better than basic AFSA, the balance ability of exploitation and exploration is enhanced, and convergence efficiency and optimization precision are improved greatly as well as the stability is strengthened.

关键词： Sociology Statistics Fish Convergence Optimization algorithm design and analysis Visualization

来源：评论

学校读者我要写书评

暂无评论

Further results on lower bounds for coded caching

Further results on lower bounds for coded caching

引用

IEEE International Symposium on Information Theory

作者： Hooshang Ghasemi Aditya Ramamoorthy Dept. of Electrical & Computer Eng. Iowa State University Ames IA

ISBN: (纸本)9781509018079

Coded caching is a technique that promises huge rate savings in certain canonical content distribution scenarios over the Internet. In the coded caching setting, previous contributions have demonstrated a constant multiplicative gap between the achievable rate and corresponding lower bound on the rate, independent of the problem parameters. Our prior work demonstrated that good lower bounds on the coded caching rate can be obtained by equivalently considering a combinatorial problem on a directed tree. In this work, we study certain structural properties of our algorithm that allow us to analytically quantify improvements on the rate lower bound. This analysis allows us to obtain a multiplicative gap of at most four between the achievable rate and our lower bound. To our best knowledge, this is the best known multiplicative gap known for this problem.

关键词： Servers Labeling Information theory Internet algorithm design and analysis Computers Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Extending Standard MapReduce algorithms

Extending Standard MapReduce Algorithms

引用

IEEE International Conference on Multimedia Big Data (BigMM)

作者： Hadi Hashem Daniel Ranc LOR Software-Networks department Télécom SudParis Institut Mines-Télécom France

ISBN: (纸本)9781509021802

The information rate nowadays is expanding very quickly and contains complex and heterogeneous data types (text, images, videos, GPS data, purchase transactions) that require powerful computing engines, able to easily store and process such complex structures. Gartner's definition of the 3Vs (volume, velocity, variety) describing this expansion of data will then lead to extract the unnamed forth V (value) from BigData. This added value addresses the need for valuation of enterprise data. In this paper, we discuss the existing MapReduce implementation techniques and the need of a different approach based on the pre-processing of the data. The goal is to show interesting results in terms of data processing costs, performance and green computing.

关键词： Data processing Standards algorithm design and analysis Sorting Engines Computational modeling Data models

来源：评论

学校读者我要写书评

暂无评论

A high-performance circuit design algorithm using data dependent approximation

A high-performance circuit design algorithm using data depen...

引用

International SoC design Conference, ISOCC

作者： Kazushi Kawamura Masao Yanagisawa Nozomu Togawa Dept. of Computer Science and Engineering Waseda University Dept. of Electronic and Physical Systems Waseda University

ISBN: (纸本)9781509032204

This paper proposes a high-performance circuit design algorithm using input data dependent approximation. In our algorithm, STEPCs (Suspicious Timing Error Prediction Circuits) are utilized for identifying the paths to be optimized inside a circuit efficiently. Experimental results targeting a set of basic adders show that our algorithm can achieve performance increase by up to 11.1% within the error rate of 2.1% compared to a conventional design technique.

关键词： Adders Clocks algorithm design and analysis Approximation algorithms Prediction algorithms Timing Error analysis

来源：评论

学校读者我要写书评

暂无评论

Emergency navigation systems and algorithms in confined spaces

Emergency navigation systems and algorithms in confined spac...

引用

International Conference on Information and Communication Technologies for Disaster Management (ICT-DM)

作者： Huibo Bi Intelligent Systems and Networks Group Imperial College London UK

ISBN: (纸本)9781509052356

With the increasing concentration of human populations in modern urbanised societies, emergency navigation systems and related algorithms, which aim to guide evacuees out of the hazardous areas when a disaster occurs, have drawn considerable attention due to the potential serious injuries and fatalities caused by natural or manmade disasters. This paper surveys the existing research in the field of indoor emergency navigation, from various emergency response systems to the associated navigation algorithms.

关键词： Navigation Wireless sensor networks Biological system modeling algorithm design and analysis Sensors Prediction algorithms Mobile handsets

来源：评论

学校读者我要写书评

暂无评论

Optimization of Block Sparse Matrix-Vector Multiplication on Shared-Memory Parallel Architectures

Optimization of Block Sparse Matrix-Vector Multiplication on...

引用

IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Ryan Eberhardt Mark Hoemmen William Rainey Harper College IL Sandia National Laboratories Albuquerque NM

ISBN: (纸本)9781509036837

We examine the implementation of block compressed row storage (BCSR) sparse matrix-vector multiplication (SpMV) for sparse matrices with dense block substructure, optimized for blocks with sizes from 2x2 to 32x32, on CPU, Intel many-integrated-core, and GPU architectures. Previous research on SpMV for matrices with dense block substructure has largely focused on the design of novel data structures to optimize performance for specific architectures or to store variable-sized, variably-aligned blocks, but depending on alternate storage formats breaks compatibility with existing preconditioners and solvers or imposes significant runtime costs when converting between matrix formats. This paper instead focuses on the optimization of SpMV using the standard block compressed row storage (BCSR) format. We give a set of algorithms that performs SpMV up to 4x faster than the NVIDIA cuSPARSE cusparseDbsrmv routine, up to 147x faster than the Intel Math Kernel Library (MKL) mkl dbsrmv routine (a single-threaded BCSR SpMV kernel), and up to 3x faster than the MKL mkl dcsrmv routine (a multi-threaded CSR SpMV kernel).

关键词： Instruction sets Sparse matrices Graphics processing units Computer architecture algorithm design and analysis Kernel Optimization

来源：评论

学校读者我要写书评

暂无评论

A comparative study of different frequent pattern mining algorithm for uncertain data: A survey

A comparative study of different frequent pattern mining alg...

引用

International Conference on Computing, Communication & Automation (ICCCA)

作者： Neha Goyal S K Jain Department of Computer Engineering National Institute of Technology Kurukshetra Haryana India

ISBN: (纸本)9781509016679

Most of the data mining algorithms were designed to mine the frequent pattern from precise data. However, uncertainty exists in many real life situations such as sensor network and privacy preserving applications. To extract meaningful information from uncertain data a number of frequent pattern mining algorithms have been proposed. While dealing with uncertain data U-Apriori, UF-growth, UFP-growth, UH-mine, PUF-growth, TPC-growth algorithm are examples of existing frequent pattern mining algorithms, which utilize different approaches to mine frequent pattern. One important observation is that algorithms behave completely different in the uncertain database as compared to the precise database due of the inclusion of probability value. In this survey paper, a number of algorithms have been analyzed for finding the frequent pattern from uncertain database. The analysis is represented in the form of comparative study of following algorithm: U-Apriori, UF-growth, UFP-growth, UH-mine, and PUF-growth, TPC-growth algorithm on the basis on various parameters such as database scan, running time, memory utilization and storage structure. The survey paper also focuses on the advantage and limitation of each algorithm.

关键词： Data mining algorithm design and analysis Probabilistic logic Itemsets Heuristic algorithms Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Computationally efficient Toeplitz-constrained blind equalization based on independence

Computationally efficient Toeplitz-constrained blind equaliz...

引用

Annual Conference on Information Sciences and Systems (CISS)

作者： Zhengwei Wu Saleem A. Kassam Department of Electrical and System Engineering University of Pennsylvania Philadelphia PA USA

Bussgang algorithms for blind equalization (BE) are well-known techniques that use known constellation properties of the source symbols. BE has also been based on independent component analysis (ICA) methods, where independence of the symbols is exploited. When channel outputs are processed in blocks, as in the ICA algorithms, extra computational cost is incurred for matrix operations. In this paper we propose a computationally efficient Toeplitz-constrained BE algorithm based on independence. We show how the FFT can be applied for computation efficiency, and also how blockwise sample cross-correlation computations can be efficiently approximated. For sources with independent I/Q components this constraint can be imposed for phase recovery. Our proposed algorithms yield relatively fast convergence without high computational cost.

关键词： algorithm design and analysis Computational efficiency Blind equalizers Information science Approximation algorithms Convolution

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 467 468 469 470 471 472 473 474 475 476 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：