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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Performance Estimation Toolbox (PESTO): automated worst-case analysis of first-order optimization methods 56

Performance Estimation Toolbox (PESTO): automated worst-case...

引用

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

作者： Taylor, Adrien B. Hendrickx, Julien M. Glineur, Francois Catholic Univ Louvain ICTEAM Louvain La Neuve Belgium Catholic Univ Louvain CORE Louvain La Neuve Belgium

ISBN: (纸本)9781509028733

We present a MATLAB toolbox that automatically computes tight worst-case performance guarantees for a broad class of first-order methods for convex optimization. The class of methods includes those performing explicit, projected, proximal, conditional and inexact (sub) gradient steps. The toolbox relies on the performance estimation (PE) framework, which recently emerged through works of Drori and Teboulle and the authors. The PE approach is a very systematic manner of obtaining non-improvable worst-case guarantees for first-order numerical optimization schemes. However, using the PE methodology requires modelling efforts from the user, along with some knowledge of semidefinite programming. The goal of this work is to ease the use of the performance estimation methodology, by providing a toolbox that implicitly does the modelling job. In short, its aim is to (i) let the user write the algorithm in a natural way, as he/she would have implemented it, and (ii) let the computer perform the modelling and worst-case analysis parts automatically.

关键词： Estimation Convex functions algorithm design and analysis Minimization Gradient methods Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Application of Non-orthogonal Multiplexing to mmWave Multi-user Systems 85

Application of Non-orthogonal Multiplexing to mmWave Multi-u...

引用

IEEE 85th Vehicular Technology Conference (VTC Spring)

作者： Yuan, Wenfang Kalokidou, Vaia Armour, Simon M. D. Doufexi, Angela Beach, Mark A. Univ Bristol Commun Syst & Networks Merchants Ventures BldgWoodland Rd Bristol BS8 1TJ Avon England

ISBN: (纸本)9781509059324

Limited wireless spectrum in future networks is an issue that millimeter-Wave (mmWave) frequencies can resolve. Beamforming is a challenging operation for mmWave systems. Both analogue and hybrid solutions have been proposed. Apart from Orthogonal Multiple Access (OMA) systems, the Non-Orthogonal Multiple Access (NOMA) scheme has been recently considered as an alternative and can outperform OMA in many cases. Our contribution is the application of NOMA to a hybrid precoder design in mmWave indoor scenarios with multiple users. Introducing to our system appropriate user grouping and scheduling schemes, we show that the NOMA outperforms, in terms of spectral efficiency, OMA by providing a 17.1% improvement for high SNR values. Finally, applying NOMA with fair power allocation improves the rate of users with weak channel conditions by around 1 bps/Hz for SNR > 5dB, without degrading the overall spectral efficiency in the cell.

关键词： Array signal processing NOMA Precoding algorithm design and analysis Radio frequency Multiplexing Antennas

来源：评论

学校读者我要写书评

暂无评论

Towards a Verified Parallel Implementation of Frequent Itemset Mining 15

Towards a Verified Parallel Implementation of Frequent Items...

引用

15th International Conference on High Performance Computing & Simulation (HPCS)

作者： Whitney, Christopher D. Loulergue, Fre de Ric No Arizona Univ Sch Informat Comp & Cyber Syst Flagstaff AZ 86011 USA

ISBN: (纸本)9781538632505

Information technologies have allowed for the rapid growth of both data acquisition and data storage. With this growth comes the challenge of extracting useful information. One piece of information that is interesting to academics and industry is the relationships between items in a large data set. One approach is to find the relationships between items by calculating how frequently the items appear together in a subset. This is known as the frequent itemset mining problem. The problem goes as follows, given a database with sets of items, find the items that occur frequently together in a subset.

关键词： Data mining algorithm design and analysis Itemsets Skeleton Filtering Programming Calculus

来源：评论

学校读者我要写书评

暂无评论

Truss Decomposition on Shared-Memory Parallel Systems

Truss Decomposition on Shared-Memory Parallel Systems

引用

IEEE High Performance Extreme Computing Conference (HPEC)

作者： Smith, Shaden Liu, Xing Ahmed, Nesreen K. Tom, Ancy Sarah Petrini, Fabrizio Karypis, George Univ Minnesota Dept Comp Sci & Engn Minneapolis MN 55455 USA Intel Corp Parallel Comp Lab Santa Clara CA 95051 USA

ISBN: (纸本)9781538634721

The scale of data used in graph analytics grows at an unprecedented rate. More than ever, domain experts require efficient and parallel algorithms for tasks in graph analytics. One such task is the truss decomposition, which is a hierarchical decomposition of the edges of a graph and is closely related to the task of triangle enumeration. As evidenced by the recent GraphChallenge, existing algorithms and implementations for truss decomposition are insufficient for the scale of modern datasets. In this work, we propose a parallel algorithm for computing the truss decomposition of massive graphs on a shared-memory system. Our algorithm breaks a computation-efficient serial algorithm into several bulk-synchronous parallel steps which do not rely on atomics or other fine-grained synchronization. We evaluate our algorithm across a variety of synthetic and real-world datasets on a 56-core Intel Xeon system. Our serial implementation achieves over 1400x speedup over the provided GraphChallenge serial benchmark implementation and is up to 28x faster than the state-of-the-art shared-memory parallel algorithm.

关键词： Message systems Parallel algorithms algorithm design and analysis Synchronization Heuristic algorithms Hardware

来源：评论

学校读者我要写书评

暂无评论

Formal Verification of Robotic Behaviors in Presence of Bounded Uncertainties 1

Formal Verification of Robotic Behaviors in Presence of Boun...

引用

1st IEEE International Conference on Robotic Computing (IRC)

作者： Sandretto, Julien Alexandre dit Chapoutot, Alexandre Mullier, Olivier Univ Paris Saclay U2IS ENSTA ParisTech 828 Bd Marechaux F-91762 Palaiseau France

ISBN: (纸本)9781509067244

Robotic behaviors are mainly described by differential equations. Those mathematical models are usually not precise enough because of inaccurately known parameters or model simplifications. Nevertheless, robots are often used in critical contexts as medical or military fields. So, uncertainties in mathematical models have to be taken into account in order to produce reliable and safe analysis results. A framework based on interval analysis is proposed to safely verify and analyze robotic behaviors with bounded uncertainties. It follows an interval constraint programming approach, combined with validated numerical integration methods to deal with differential equations. A case study on robust path planning is presented to emphasize the efficiency of the complete framework.

关键词： Mathematical model Robots Differential equations Uncertainty algorithm design and analysis Programming Safety

来源：评论

学校读者我要写书评

暂无评论

Inexact iteration of averaged operators for non-strongly convex stochastic optimization 55

Inexact iteration of averaged operators for non-strongly con...

引用

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

作者： Haskell, William B. Jain, Rahul

ISBN: (纸本)9781538632666

We focus on inexact iteration of averaged operators with stochastic errors, and we give conditions for a sublinear O (1/K) convergence rate for this class of iteration. Then, we show that our general development gives convergence rate analysis for sampling-based algorithms for non-strongly convex stochastic optimization including minimization, saddle-point problems, and constrained optimization.

关键词： Convergence Optimization algorithm design and analysis Stochastic processes Minimization Random variables Convex functions

来源：评论

学校读者我要写书评

暂无评论

Research on Dynamic Routing and Wavelength Assignment algorithm for Optical Networks 2

Research on Dynamic Routing and Wavelength Assignment Algori...

引用

2017 IEEE 第2届先进信息技术,电子与自动化控制国际会议(IAEAC 2017)

作者： Gao Huimin Yang Wen Wang Liang Liu Zhengtang Luoyang Electronic Equipment Test Center

Routing and wavelength assignment(RWA) is one of the vital optical network issues of optical networks. With the tradeoff between the idle ratio and reliability of the candidate route, this paper resea

ISBN: (纸本)9781467389808

关键词： Heuristic algorithms Reliability Routing algorithm design and analysis Wavelength assignment Packet loss

来源：评论

学校读者我要写书评

暂无评论

Mermaid: Integrating Vertex-Centric with Edge-Centric for Real-World Graph Processing 17

Mermaid: Integrating Vertex-Centric with Edge-Centric for Re...

引用

17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID)

作者： Zhou, Jinhong Xu, Chongchong Chen, Xianglan Wang, Chao Zhou, Xuehai USTC Sch Comp Sci & Technol Hefei Anhui Peoples R China

ISBN: (纸本)9781509066117

There has been increasing interests in processing large-scale real-world graphs, and recently many graph systems have been proposed. Vertex-centric GAS (Gather-Apply-Scatter) and Edge-centric GAS are two graph computation models being widely adopted, and existing graph analytics systems commonly follow only one computation model, which is not the best choice for real-world graph processing. In fact, vertex degrees in real-world graphs often obey skewed power-law distributions: most vertices have relatively few neighbors while a few have many neighbors. We observe that vertex-centric GAS for high-degree vertices and edge-centric GAS for low-degree vertices is a much better choice for real-world graph processing. In this paper, we present Mermaid, a system for processing large-scale real-world graphs on a single machine. Mermaid skillfully integrates vertex-centric GAS with edge-centric GAS through a novel vertex-mapping mechanism, and supports streamlined graph processing. On a total of 6 practical natural graph processing tasks, we demonstrate that, on average, Mermaid achieves 1.83x better performance than the state-of-the-art graph system on a single machine.

关键词： Computational modeling algorithm design and analysis Analytical models Pipelines Hardware Magnetic cores Grid computing

来源：评论

学校读者我要写书评

暂无评论

On Matchmaking for Multiplayer Cloud Gaming 17

On Matchmaking for Multiplayer Cloud Gaming

引用

15th Annual Workshop on Network and Systems Support for Games (NetGames)

作者： Guan, Yitong Deng, Yunhua Tang, Xueyan Nanyang Technol Univ Sch Comp Sci & Engn Singapore Singapore

ISBN: (纸本)9781509050383

Matchmaking is the process of grouping players together to set up game sessions in multiplayer online games. In this paper, we focus on the matchmaking for multiplayer cloud gaming (MCG). We formulate the MCG matchmaking problem with the objectives of maximizing the number of game sessions formed and minimizing the cost of cloud servers rented to serve the sessions. We propose a two-step matchmaking framework and several heuristic algorithms to assign players to servers. Experimental evaluations are conducted with real Internet latency data.

关键词： Servers Rendering (computer graphics) Cloud gaming Heuristic algorithms Resource management algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

An Idea for Lyapunov Function design for Arbitrary Order Continuous Twisting algorithms 56

An Idea for Lyapunov Function Design for Arbitrary Order Con...

引用

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

作者： Mendoza-Avila, Jesus Moreno, Jaime A. Fridman, Leonid Univ Nacl Autonoma Mexico Fac Ingn Mexico City 04510 DF Mexico Univ Nacl Autonoma Mexico Inst Ingn Mexico City 04510 DF Mexico Graz Univ Technol Inst Regelungs & Automatisierungstech Kopernikusgasse 24-2 A-8010 Graz Austria

ISBN: (纸本)9781509028733

Continuous Twisting algorithm (CTA) for systems of order n allows to compensate theoretically exactly Lipschitz time perturbations, generating a continuous control signal and ensuring finite-time convergence to a sliding mode of order (n + 1). In this paper an idea of a recursive procedure for Lypaunov Function (LF) and gains design for n - th order CTA is proposed. The procedure consists in constructing a homogeneous LF for the n-th order CTA as a sum of three generalized homogeneous polynomials of the same degree: (i) a LF for the continuous state feedback controlled system of order n;(ii) a LF for CTA of order (n-1) and (iii) some extra cross terms. The two first terms can in turn be constructed in a recursive form. The proposed idea is illustrated with the design of a LF and gains for the second order CTA. Furthermore, the proposed procedure allows to select the control gains of the CTA for third order systems and to prove global finite-time stability.

关键词： State feedback Convergence Stability analysis Lyapunov methods algorithm design and analysis Urban areas

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 57 58 59 60 61 62 63 64 65 66 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：