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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Detecting Knowledge Innovation through Automatic Topic Labeling on Scholar Data

Detecting Knowledge Innovation through Automatic Topic Label...

引用

Annual Hawaii International Conference on System Sciences (HICSS)

作者： Diogo Nolasco Jonice Oliveira Federal University of Rio de Janeiro Brazil

ISBN: (纸本)9781509019816

Knowledge innovation can be detected by scientific and technology production. A challenge on knowledge innovation analysis is the identification of knowledge areas in text documents - called topic modeling - and presenting the related concepts in an understandable way. The most used and reliable approaches are based on manual labeling, which is impracticable when we analyze a huge period of time, a large number of documents or different domains. We propose a method of automatic labeling. Evaluation results pointed that the proposed method can effectively generate labels for topics with a similar efficiency of human generated labels.

关键词： Labeling Technological innovation Computational modeling algorithm design and analysis Reliability Proposals Text mining

来源：评论

学校读者我要写书评

暂无评论

Parallelization of Bin Packing on Multicore Systems

Parallelization of Bin Packing on Multicore Systems

引用

International Conference on High Performance Computing

作者： Sayan Ghosh Assefaw H. Gebremedhin School of Electrical Engineering and Computer Science Washington State University Pullman WA USA

ISBN: (纸本)9781509054121

We study effective parallelization of approximation algorithms for the one-dimensional bin packing problem on a multicore platform. Bin packing is a classic combinatorial optimization problem that aims to pack a given sequence of items into a minimum number of equal-sized bins. The problem potentially serves as a model for a wide variety of applications. Examples include: packing data into chunks in a memory hierarchy in a given system to increase application performance, loading vehicles subject to weight limitations, and packing TV commercials into station breaks. Bin packing has long served as a proving ground for the analysis of approximation algorithms and played a crucial role in the development of much of the theory of approximation algorithms. Its parallelization, however, has received comparatively much less attention. In this work, we develop multiple parallel versions of an effective approximation algorithm (First Fit Decreasing) for the problem and investigate the trade-off between solution quality and execution time. We use OpenMP and Cilk Plus as mechanisms for achieving the parallelization. The new parallel algorithms obtain a speedup of more than 10× (on 32 cores) for moderate to large input sequences without sacrificing much on the quality of solution produced by the sequential algorithm - in particular, we see only about 3 to 30% increase in the number of bins compared to the sequential version. In turn, the solution obtained by the sequential First Fit Decreasing algorithm is provably almost optimal (the approximation ratio is less than 1.3).

关键词： Approximation algorithms algorithm design and analysis Parallel algorithms Dynamic scheduling Heuristic algorithms Multicore processing Upper bound

来源：评论

学校读者我要写书评

暂无评论

Avoiding trapping sets in SC-LDPC codes under windowed decoding

Avoiding trapping sets in SC-LDPC codes under windowed decod...

引用

International Symposium on Information Theory and Its Applications, ISITA

作者： Allison Beemer Christine A. Kelley Department of Mathematics University of Nebraska-Lincoln Lincoln Nebraska

Spatially coupled low-density parity-check (SC-LDPC) codes are sparse graph codes that have recently become of interest due to their capacity-approaching performance on memoryless binary input channels. Moreover, protograph SC-LDPC codes have been shown to be asymptotically good under certain conditions. SC-LDPC codes are amenable to a windowed decoder that allows decoding of blocks of bits to be done serially, making them good candidates for applications such as streaming. Depending on how they are constructed, however, the codes may still be prone to error floors. One key element in protograph SC-LDPC code design is the edge-spreading method used to couple copies of the base protograph in the construction of the SC-protograph. In this paper, we present an edge-spreading algorithm that is designed to remove trapping sets from the resulting SC-protograph that are harmful with respect to the windowed decoder, and we examine how to determine which trapping sets should be removed in the construction.

关键词： Charge carrier processes Decoding Couplings Parity check codes algorithm design and analysis Standards

来源：评论

学校读者我要写书评

暂无评论

On the use of immune clone optimization for unconstrained multi-objective resource allocation in the cognitive OFDMA networks

On the use of immune clone optimization for unconstrained mu...

引用

Congress on Evolutionary Computation

作者： Ronghua Shang Weitong Zhang Ailing Wen Kun Zhang Licheng Jiao Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education Xidian University Xi'an China

Cognitive radio is a new network technology developed in recent years, which focuses on the low utility of spectrum in the wireless communication system. This paper proposes a new algorithm based on the immune clone optimization for unconstrained multi-objective resource allocation in the downlink OFDMA network. We first convert the constraint of data transmission rate proportionality of each user to a proportional objective function, which avoids dealing with the proportion constraint. And an effective coding method is adopted to deal with constraints in subcarrier allocation. Compared with the traditional method, this method can get less code length, which narrows the solution space significantly. Moreover, we use variable multiples clone operation and heuristic mutation operation based on some priori information. Finally, the population is updated in two steps: first, remove some antibodies with high value of proportional objective function; second, choose Pareto dominant solution from the remaining individuals to update the population. Simulation results show that the proposed algorithm can get better performance compared to the previous works.

关键词： Resource management Mathematical model Data communication Sociology Statistics Linear programming algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A review on energy aware VM placement and consolidation techniques

A review on energy aware VM placement and consolidation tech...

引用

International Conference on Inventive Computation Technologies (ICICT)

作者： Sukhandeep Kaur Seema Bawa Computer Science and Engineering Department Thapar University Patiala India

ISBN: (纸本)9781509012862

Due to rapid growth in the area of high performance computing, resource allocation and multiplexing is done through virtualization technology. In virtualization process each VM has limited resources for software running on it and abstractions that are provided by it. Theses resources are managed through VM placement and consolidation. This technology is facing certain deficiencies, due to heterogeneity and scalability of workloads, migration cost and time. To reap its full benefits better techniques are needed in VM placement and consolidation techniques. In this paper we present exhaustive survey on the available placement and consolidation techniques and conclude that major issues to be solved in these techniques are workload consolidation, QOS, minimizing number of migrations and active physical hosts.

关键词： Resource management Servers Cloud computing Virtualization Power demand algorithm design and analysis Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

On local analysis of distributed optimization

On local analysis of distributed optimization

引用

American Control Conference

作者： Tatiana Tatarenko Behrouz Touri Department of Control Theory and Robotics TU Darmstadt Germany Department of Electrical Computer and Energy Engineering University of Colorado Boulder USA

ISBN: (纸本)9781467386838

We study distributed non-convex optimization on a time-varying multiagent network. Each node has access to its own smooth local cost function, and the collective goal is to minimize the sum of these functions. The perturbed push-sum algorithm used for convex distributed optimization in [17] is considered and further studied in [8]. We generalize the result obtained in [8] to the case of non-convex functions. Under some additional assumptions on the gradients we prove the convergence of the distributed push-sum algorithm to the set of critical points of the objective function. Moreover, by utilizing perturbations on the update process, we show the almost sure convergence of the perturbed dynamics to a local minimum of the global objective function.

关键词： Optimization Convergence Linear programming Approximation algorithms algorithm design and analysis Signal processing algorithms Markov processes

来源：评论

学校读者我要写书评

暂无评论

Mining of Learning Interaction Patterns in MOOCs Forums

Mining of Learning Interaction Patterns in MOOCs Forums

引用

IEEE International Conference on Information Reuse and Integration (IRI)

作者： K.-C. Chu C.-S. Wang J.-H. Kuo Department of Information Management National Taipei College of Nursing Taipei Taiwan Department of Information Management Jinwen University of Science and Technology Taipei Taiwan

ISBN: (纸本)9781509032082

Massive Open Online Courses (MOOCs) are growing substantially in numbers, and also in interest from the educational community. MOOCs are online courses aimed at large-scale interactive participation and open access via the Web that made them possible for anyone with an internet connection to enroll in free, university level courses. In this paper, we propose a novel method to discover various types of new knowledge on forums discussions. We investigate data mining techniques to detect and analyze frequent learning discussion patterns in MOOCs forums. We investigate and characterize discussion interaction patterns in MOOCs forums. A learning interaction discussion is constructed as a tree structured pattern and an efficient LIP-Miner algorithm is designed to find all frequent learning interaction patterns. In addition, studies are performed on mining discussion interaction patterns in MOOCs forums. We demonstrate via experiments that the propose algorithm can find interesting learning interaction patterns in MOOCs forums.

关键词： Data mining Itemsets algorithm design and analysis Indexes Internet Education

来源：评论

学校读者我要写书评

暂无评论

Iterative approach for clustering based on linkage strategies applied to gene expression analysis

Iterative approach for clustering based on linkage strategie...

引用

International Conference on Computer Engineering and Systems

作者： Mohamed A. Mahfouz Department of Computer and System Engineering Alexandria University Egypt Computer Engineering Department Elbehira Higher Institute of Engineering and Technology

ISBN: (纸本)9781509032686

In gene expression analysis, grouping co-regulated genes is a major step in discovering genes which are likely to have related biological functions. This critical step can be done using clustering. This paper formally presents three models for iterative clustering based on average, single and complete linkage strategies. Variation of relational clustering algorithms can be built based on these models. The number of clusters needs not to be known in advance. Unlike centroid and medoid-based algorithms the proposed approach avoids minimizing least squares type objective function instead it maximizes the average similarity between objects of the same cluster using a subset of the similarity matrix. Top k nearest, farthest or near average entries in each row of the similarity matrix need to be identified depending on the required linkage strategy. In order to reduce the computational complexity of this step randomized search or genetic technique can be used to approximate these elements; however, in our experimental studies, the exact k elements are computed. The performance of the proposed algorithms is evaluated and compared to existing techniques on two standard gene expression datasets.

关键词： Clustering algorithms Couplings algorithm design and analysis Gene expression Buildings Correlation coefficient Linear programming

来源：评论

学校读者我要写书评

暂无评论

Estimating the Number of Clusters Based on Sequential Clustering algorithms

Estimating the Number of Clusters Based on Sequential Cluste...

引用

Brazilian Conference on Intelligent Systems (BRACIS)

作者： Eduardo Machado Real Universidade Estadual de Mato Grosso do Sul - UEMS Nova Andradina MS Brazil

ISBN: (纸本)9781509035670

The main goal of clustering algorithms is to organize a given set of data patterns into groups (clusters) and their main strategy is to group patterns based on their similarity. However, some clustering algorithms also require as an input parameter, the number of clusters the induced clustering should have, or then, a threshold value used for limiting for the number of induced clusters. Both, the number of cluster as well a threshold value are often unknown, however it is well-known that results of clustering tasks can be very sensitive to them. This work presents a method for empirically estimating both values. The method is based on multiple runs of sequential clustering algorithms, by using increasing threshold values. Results from experiments conducted using several data domains from two repositories, the UCI and the Keel, as well as a few artificially created data, are presented and a comparative analysis is carried out, as evidence of the good estimates on both values given by the method.

关键词： Clustering algorithms algorithm design and analysis Indexes Iris Radiation detectors Intelligent systems Limiting

来源：评论

学校读者我要写书评

暂无评论

RepEx: A Flexible Framework for Scalable Replica Exchange Molecular Dynamics Simulations

RepEx: A Flexible Framework for Scalable Replica Exchange Mo...

引用

International Conference on Parallel Processing (ICPP)

作者： Antons Treikalis Andre Merzky Haoyuan Chen Tai-Sung Lee Darrin M. York Shantenu Jha Department of Electrical and Computer Engineering Rutgers University Piscataway New Jersey Department of Chemistry and Chemical Biology Rutgers University Piscataway New Jersey

ISBN: (纸本)9781509028245

Replica Exchange (RE) simulations have emerged as an important algorithmic tool for the molecular sciences. Typically RE functionality is integrated into the molecular simulation software package. A primary motivation of the tight integration of RE functionality with simulation codes has been performance. This is limiting at multiple levels. First, advances in the RE methodology are tied to the molecular simulation code for which they were developed. Second, it is difficult to extend or experiment with novel RE algorithms, since expertise in the molecular simulation code is required. The tight integration results in difficulty to gracefully handle failures, and other runtime fragilities. We propose the RepEx framework which is addressing aforementioned shortcomings, while striking the balance between flexibility (any RE scheme) and scalability (several thousand replicas) over a diverse range of HPC platforms. The primary contributions of the RepEx framework are: (i) its ability to support different Replica Exchange schemes independent of molecular simulation codes, (ii) provide the ability to execute different exchange schemes and replica counts independent of the specific availability of resources, (iii) provide a runtime system that has first-class support for task-level parallelism, and (iv) provide a required scalability along multiple dimensions.

关键词： Engines Biological system modeling Runtime algorithm design and analysis Computational modeling Scalability Software algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 465 466 467 468 469 470 471 472 473 474 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：