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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,291 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

17,627 篇 工学
- 6,927 篇 计算机科学与技术...
- 6,762 篇 电气工程
- 2,981 篇 信息与通信工程
- 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,959 篇 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,761 篇 英文
854 篇 其他
337 篇 中文
5 篇 俄文
1 篇 西班牙文
1 篇 斯洛伐克文

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

共 82959 条记录，以下是711-720 订阅

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

详细简洁

排序：

A distributed primal-dual algorithm for computation of generalized Nash equilibria via operator splitting methods 56

A distributed primal-dual algorithm for computation of gener...

引用

56th Annual IEEE Conference on Decision and Control (CDC)

作者： Yi, Peng Pavel, Lacra Univ Toronto Dept Elect & Comp Engn Toronto ON Canada

ISBN: (纸本)9781509028733

In this paper, we propose a distributed algorithm for computation of a generalized Nash equilibrium (GNE) in noncooperative games over networks. We consider games in which the feasible decision sets of all players are coupled together by a globally shared affine constraint. Adopting the variational GNE as a refined solution, we reformulate the problem as that of finding the zeros of a sum of monotone operators through a primal-dual analysis and an augmentation of variables. Then we introduce a distributed algorithm based on forward-backward operator splitting methods. Each player only needs to know its local objective function, local feasible set, and a local block of the affine constraint, and share information with its neighbours. We show convergence of the proposed algorithm for fixed step-sizes. Numerical simulations are given for networked Cournot competition with bounded market capacities.

关键词： Games Linear programming Couplings Convergence Distributed algorithms algorithm design and analysis Computational modeling

来源：评论

学校读者我要写书评

暂无评论

design of Autopilot Platform Using HILS Approach

Design of Autopilot Platform Using HILS Approach

引用

International Conference on Communication, Control, Computing and Electronics Engineering (ICCCCEE)

作者： Elsadig, Mohammed A. Elbakri, Mohamed A. Univ Alneelain Dept Postgrad Studies Khartoum Sudan Univ Khartoum Dept Elect & Elect Engn Khartoum Sudan

ISBN: (纸本)9781509018093

Each day comes, the sector of autopilot and Unmanned vehicles get bigger exponentially;the autopilot design process plays an essential role in the unmanned aerial vehicle (UAV) development process. Autopilot can be designed and developed using different approaches depending on the control theory which is adopted in this paper Proportional-integral-derivative (PID) is adopted. Testing of autopilot system during design process can be done using different methods such as wind tunnel which is the most accurate but also the most expensive, real fly tests may be used in verification of the autopilot but it's too risky, the third approach which is used in this paper is the Hardware in the loop simulation (HILS). Matlab/Simulink in association with Aerosim blockset library were used to develop the HILS, Arduino mega board was used as the autopilot hardware due to its availability, simplicity, and cost efficient features. A PID-based autopilot was designed for UAV stability and automatic pre-defined route following, the system has been tested using HILS with acceptable performance and cost efficient approach.

关键词： Atmospheric modeling Aircraft Hardware Damping Mathematical model MATLAB algorithm design and analysis Automatic pilots algorithm design and analysis Atmospheric models Computer hardware Aircraft MATLAB absorption of shock Mathematical Model hardware-in-the-loop simulation Control Theory drone honey bees Unmanned Aerial Vehicle design process

来源：评论

学校读者我要写书评

暂无评论

Efficiently Finding All Power Flow Solutions to Tree Networks 55

Efficiently Finding All Power Flow Solutions to Tree Network...

引用

55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

作者： Zachariah, Alisha Charles, Zachary Univ Wisconsin Dept Math Madison WI 53706 USA

ISBN: (纸本)9781538632666

In this paper we present an algorithm which provably finds all voltage solutions to the power flow equations on tree networks. Our algorithm uses elimination theory to reduce the equations to univariate polynomials whose roots govern the voltages of the entire tree. The algorithm utilizes the sparse structure of the tree to decrease its computational cost. We show that the runtime of the algorithm depends on the degrees of the vertices in the tree. This implies that in physically motivated distribution networks, our algorithm runs much faster than in the worst-case scenario, scaling more like the number of real solutions as opposed to the number of complex solutions. Finally, we compare our algorithm to common approaches to finding all voltage solutions, including homotopy continuation methods and Grobner basis methods. We show that our algorithm outperforms these other methods in the low-, medium-, and high-degree settings and scales better with the number of buses.

关键词： Artificial neural networks algorithm design and analysis Power system stability Topology Electronic mail Geometry

来源：评论

学校读者我要写书评

暂无评论

Distributed Triangle Counting in the Graphulo Matrix Math Library

Distributed Triangle Counting in the Graphulo Matrix Math Li...

引用

IEEE High Performance Extreme Computing Conference (HPEC)

作者： Hutchison, Dylan Univ Washington Seattle WA 98195 USA

ISBN: (纸本)9781538634721

Triangle counting is a key algorithm for large graph analysis. The Graphulo library provides a framework for implementing graph algorithms on the Apache Accumulo distributed database. In this work we adapt two algorithms for counting triangles, one that uses the adjacency matrix and another that also uses the incidence matrix, to the Graphulo library for server-side processing inside Accumulo. Cloud-based experiments show a similar performance profile for these different approaches on the family of power law Graph500 graphs, for which data skew increasingly bottlenecks. These results motivate the design of skew-aware hybrid algorithms that we propose for future work.

关键词： algorithm design and analysis Libraries Distributed databases Cloning Encoding Data models

来源：评论

学校读者我要写书评

暂无评论

Social Grammatical Evolution with Imitation Learning for Real-Valued Function Estimation

Social Grammatical Evolution with Imitation Learning for Rea...

引用

IEEE Congress on Evolutionary Computation (CEC)

作者： Le, Nam O'Neill, Michael Fagan, David Brabazon, Anthony Univ Coll Dublin Nat Comp Res & Applicat Grp Dublin Ireland

ISBN: (纸本)9781509046010

Drawing on a rich literature concerning social learning in animals, this paper presents a variation of Grammatical Evolution (GE) which incorporates one of the most powerful forms of social learning, namely imitation learning. This replaces the traditional method of 'communication' between individuals in GE - crossover - which is drawn from an evolutionary metaphor. The paper provides an introduction to social learning, describes the proposed variant of GE, and tests on a series of benchmark symbolic regression problems. The results obtained are encouraging, being very competitive when compared with canonical GE. It is noted that the literature on social learning provides a number of useful meta-frameworks which can be used in the design of new search algorithms and to allow us to better understand the strengths and weaknesses of existing algorithms. Future work is indicated in this area.

关键词： Sociology Statistics algorithm design and analysis Animals Benchmark testing Optimization

来源：评论

学校读者我要写书评

暂无评论

An Integrated-Spreading-Based Macro-Refining algorithm for Large-Scale Mixed-Size Circuit designs 17

An Integrated-Spreading-Based Macro-Refining Algorithm for L...

引用

IEEE/ACM 36th International Conference on Computer-Aided design (ICCAD)

作者： Chen, Szu-To Chang, Yao-Wen Chen, Tung-Chieh Natl Taiwan Univ Grad Inst Elect Engn Taipei 106 Taiwan Natl Taiwan Univ Dept Elect Engn Taipei 106 Taiwan Maxeda Technol Hsinchu 300 Taiwan

ISBN: (纸本)9781538630938

With the increasing use of pre-designed macros in a modern chip and its induced high design complexity, macro placement has become a challenging problem in today's design houses. Most popular macro placement algorithms adopt a three-stage approach: placement prototyping, macro placement, and standard-cell placement, where cell positions after macro placement are assumed the same as those at the prototyping stage, possibly misguiding succeeding standard-cell placement. To close the gap between macro and standard-cell placement, we propose a macro-refining algorithm that adopts an integrated spreading technique considering the spreading of both macros and cells and the dynamic information of cell positions to improve macro placement. We further propose a new force-modulation technique to refine macro placement and a congestion-aware macro shifter to preserve more space for better routability. Extensive experiments based on various macro placements show that our proposed techniques are effective and our macro-refining algorithm can find significantly better placement solutions for largescale mixed-size circuit designs.

关键词： Routing algorithm design and analysis Heuristic algorithms Mathematical model Circuit synthesis Force Modulation

来源：评论

学校读者我要写书评

暂无评论

Fast & Space-Efficient Approximations of Language Edit Distance and RNA folding: An Amnesic Dynamic Programming Approach 58

Fast & Space-Efficient Approximations of Language Edit Dista...

引用

58th IEEE Annual Symposium on Foundations of Computer Science (FOCS)

作者： Saha, Barna Univ Massachusetts Coll Informat & Comp Scid Amherst MA 01003 USA

ISBN: (纸本)9781538634646

Dynamic programming is a basic, and one of the most systematic techniques for developing polynomial time algorithms with overwhelming applications. However, it often suffers from having high running time and space complexity due to (a) maintaining a table of solutions for a large number of sub-instances, and (b) combining/comparing these solutions to successively solve larger sub-instances. In this paper, we consider a canonical cubic time and quadratic space dynamic programming, and show how improvements in both its time and space uses are possible. As a result, we obtain fast small-space approximation algorithms for the fundamental problems of context free grammar recognition (the basic computer science problem of parsing), the language edit distance (a significant generalization of string edit distance and parsing), and RNA folding (a classical problem in bioinformatics). For these problems, ours are the first algorithms that break the cubic-time barrier of any combinatorial algorithm, and quadratic-space barrier of "any" algorithm significantly improving upon their long-standing space and time complexities. Our technique applies to many other problems as well including string edit distance computation, and finding longest increasing subsequence. Our improvements come from directly grinding the dynamic programming and looking through the lens of language edit distance which generalizes both context free grammar recognition, and RNA folding. From known conditional lower bound results, neither of these problems can have an exact combinatorial algorithm (one that does not use fast matrix multiplication) running in truly subcubic time. Moreover, for language edit distance such an algorithm cannot exist even when nontrivial multiplicative approximation is allowed. We overcome this hurdle by designing an additive-approximation algorithm that for any parameter k > 0, uses 0 (nk log n) space and 0(n(2)k log n) time and provides an additive 0 (k log n) approximation. In p

关键词： Approximation algorithms Grammar Light emitting diodes RNA Heuristic algorithms Dynamic programming algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Disordered Speech Quality Estimation Using Linear Prediction

Disordered Speech Quality Estimation Using Linear Prediction

引用

IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)

作者： Ali, Yousef S. Ettomi Parsa, Vijay Doyle, Phillip Berkane, Soulaimane Univ Western Ontario Dept Elect & Comp Engn London ON Canada Univ Western Ontario Sch Commun & Speech Disorders London ON Canada

ISBN: (纸本)9781538607008

Tracheoesophageal (TE) speech is generated by patients who have undergone a total laryngectomy where the larynx (voice box) is removed and replaced by a tracheoesophageal puncture. This work presents a novel low complexity algorithm to estimate the degree of severity of disordered TE speech. The proposed algorithm uses features which are computed from 32-ms voiced frames of the speech signal. A 21-st order LPC analysis is performed on each voiced frame of the speech and high order statistics (central moments: mean, standard deviation, skewness and kurtosis) are extracted from the LPC coefficients, Cepstral coefficients and the LPC residual signal. The averages of each of these moments are computed along with the pitch average over all voiced frames yielding a total of 14 quality features. Experimental results with two sets of databases (20 and 35 TE speakers) showed that the proposed speech quality estimation approach performs well with a correlation with subjective scores in the range between 0.81 and 0.86.

关键词： Speech Estimation Correlation Databases Cepstral analysis Feature extraction algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

GEEK: Grammatical Evolution for automatically Evolving Kernel functions 16

GEEK: Grammatical Evolution for automatically Evolving Kerne...

引用

16th IEEE International Conference on Trust, Security and Privacy in Computing and Communications / The 11th IEEE International Conference on Big Data Science and Engineering / The 14th IEEE International Conference on Embedded Software and Systems

作者： Sousa, Arua de M. Lorena, Ana C. Basgalupp, Marcio P. Univ Fed Sao Paulo Inst Sci & Technol Sao Paulo Brazil

ISBN: (纸本)9781509049066

One of the key aspects in the successful use of kernel methods such as Support Vector Machines is the proper choice of the kernel function. While there are several well known kernel functions which can produce satisfactory results for various applications (e.g. RBF), they do not take into account specific characteristics of the data sets. Moreover, they have a set of parameters to be tuned. In this paper, we propose GEEK, a Grammatical Evolution approach for automatically Evolving Kernel functions. GEEK uses a grammar composed of simple mathematical operations extracted from known kernels and is also able to optimize some of their parameters. When combined through the Grammatical Evolution, these operations give rise to more complex kernel functions, adapted to each specific problem in a data-driven approach. The predictive results obtained by Support Vector Machines using the GEEK kernel functions were in general statistically similar to those of the standard RBF, Polynomial and Sigmoid kernel functions, which had their parameters optimized by a grid search method. Nonetheless, the GEEK kernels were able to handle more properly imbalanced classification problems, whilst the results of the standard kernel functions were biased towards the majority class.

关键词： Kernel Grammar Support vector machines Standards Optimization algorithm design and analysis Prediction algorithms

来源：评论

学校读者我要写书评

暂无评论

Parallel and Efficient Sensitivity analysis of Microscopy Image Segmentation Workflows in Hybrid Systems

Parallel and Efficient Sensitivity Analysis of Microscopy Im...

引用

IEEE International Conference on Cluster Computing (CLUSTER)

作者： Barreiros, Willian, Jr. Teodoro, George Kurc, Tahsin Kong, Jun Melo, Alba C. M. A. Saltz, Joel Univ Brasilia Dept Comp Sci Brasilia DF Brazil SUNY Stony Brook Dept Biomed Informat Stony Brook NY 11794 USA Oak Ridge Natl Lab Sci Data Grp Oak Ridge TN USA Emory Univ Biomed Informat Dept Atlanta GA 30322 USA

ISBN: (纸本)9781538623268

We investigate efficient sensitivity analysis (SA) of algorithms that segment and classify image features in a large dataset of high-resolution images. algorithm SA is the process of evaluating variations of methods and parameter values to quantify differences in the output. A SA can be very compute demanding because it requires re-processing the input dataset several times with different parameters to assess variations in output. In this work, we introduce strategies to efficiently speed up SA via runtime optimizations targeting distributed hybrid systems and reuse of computations from runs with different parameters. We evaluate our approach using a cancer image analysis workflow on a hybrid cluster with 256 nodes, each with an Intel Phi and a dual socket CPU. The SA attained a parallel efficiency of over 90% on 256 nodes. The cooperative execution using the CPUs and the Phi available in each node with smart task assignment strategies resulted in an additional speedup of about 2x. Finally, multi-level computation reuse lead to an additional speedup of up to 2.46x on the parallel version. The level of performance attained with the proposed optimizations will allow the use of SA in large-scale studies.

关键词： Image segmentation Sensitivity analysis Optimization algorithm design and analysis Runtime Image analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 68 69 70 71 72 73 74 75 76 77 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：