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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

17,615 篇 工学
- 6,923 篇 计算机科学与技术...
- 6,750 篇 电气工程
- 2,979 篇 信息与通信工程
- 2,680 篇 控制科学与工程
- 2,473 篇 软件工程
- 1,636 篇 电子科学与技术（可...
- 1,501 篇 仪器科学与技术
- 1,415 篇 机械工程
- 247 篇 航空宇航科学与技...
- 235 篇 生物医学工程（可授...
- 202 篇 网络空间安全
- 196 篇 交通运输工程
- 140 篇 测绘科学与技术
- 131 篇 生物工程
- 94 篇 材料科学与工程（可...
- 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,948 篇 algorithm design...
5,905 篇 clustering algor...
5,302 篇 heuristic algori...
5,277 篇 computer science
5,158 篇 optimization
4,677 篇 signal processin...
4,547 篇 hardware
4,068 篇 genetic algorith...
3,996 篇 computational mo...
3,979 篇 convergence
3,963 篇 performance anal...
3,642 篇 data mining
3,579 篇 mathematical mod...
3,392 篇 testing
3,250 篇 routing
2,986 篇 educational inst...
2,977 篇 robustness
2,964 篇 equations
2,956 篇 partitioning alg...
2,871 篇 delay

机构

90 篇 ibm thomas j. wa...
76 篇 department of el...
72 篇 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,750 篇 英文
854 篇 其他
337 篇 中文
5 篇 俄文
1 篇 西班牙文
1 篇 斯洛伐克文

检索条件"主题词=Algorithm design and analysis"

共 82948 条记录，以下是461-470 订阅

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

详细简洁

排序：

A Customized and Cost-Efficient Backup Scheme in Software-Defined Networks 25

A Customized and Cost-Efficient Backup Scheme in Software-De...

引用

25th IEEE International Conference on Network Protocols (ICNP)

作者： Zhu, Zhijie Li, Qing Xu, Mingwei Song, Ziyan Xia, Shutao Tsinghua Univ Dept Comp Sci & Technol Beijing Peoples R China Huawei Technol Co Ltd Network Technol Lab Hong Kong Hong Kong Peoples R China Tsinghua Univ Grad Sch Shenzhen Shenzhen Peoples R China

ISBN: (纸本)9781509065011

Among the schemes proposed for failure recovery in software-defined networks, installing backup paths in advance is considered to be an effective approach to reduce the recovery latency. However, the pre-installation poses undue storage overheads on flow tables. In this paper, we propose a customized and cost-efficient backup scheme, which achieves fast recovery from any single-link failure. We introduce an improved breadth first search algorithm to construct the customized backup paths of flows to accommodate their diverse routing demands. By analyzing the path characteristics carefully, we observe that non-conflicted backup paths can be aggregated with each other to reduce the number of backup rules. We formulate this backup path aggregation as an optimization problem. The challenge is how to aggregate the backup paths without causing routing ambiguity. To this end, we design a two-stage aggregation (2SA) algorithm. At its core, 2SA leverages conflict matrixes to guarantee the correctness of aggregation. We evaluate our scheme comprehensively with both the real-world topologies and generated topologies. Simulation results show that our scheme can pre-install the customized backup paths with much fewer, typically one order of magnitude, backup rules compared to the traditional flow-based protection without aggregation.

关键词： Routing algorithm design and analysis Aggregates Optimization Topology Network topology Delays

来源：评论

学校读者我要写书评

暂无评论

A caching miss ratio aware path selection algorithm for Information-Centric Networks 42

A caching miss ratio aware path selection algorithm for Info...

引用

IEEE 42nd Conference on Local Computer Networks (IEEE LCN)

作者： Lin, Weihong Zhang, Xinggong Guan, Yu Chen, Ken Guo, Zongming Peking Univ Inst Comp Sci & Technol Beijing Peoples R China Cooperat Medianet Innovat Ctr Shanghai Peoples R China Univ Sorbonne Paris Cite Univ Paris 13 Inst Galilee L2TI Villetaneuse France

ISBN: (纸本)9781509065226

In Information-Centric Networks (ICN), contents are cached on some intermediary routers. This creates thus a new situation which is totally different from the traditional path-selection paradigm: the source/destination paradigm no longer exists;instead, the new paradigm is how to find a path through a selected group of caches, so that the content is delivered via the shortest way. This paper addresses this issue and proposes a path-selection algorithm taking into account both the caching capability of router and the more traditional link cost between routers. We formulated the problem as a convex optimization problem (named ESP) which aims to get expected shortest path (ESP) by minimizing the transportation cost. By applying the Lagrangian dual theorem, we solved the ESP problem and obtained a criterion for request (and reversely, data) routing. Based on this path-selection criterion, we provide a fully distributed distance-based ESP algorithm that enables routers maintain routes to nearest content, without knowing a network topology and the caching miss ratio of content at other routers. Simulations confirm the efficiency of our approach versus the traditional shortest path algorithm.

关键词： Routing Transportation Nickel Convex functions Network topology Topology algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A Distributed Dual-Ring Tree algorithm for Bluetooth Networks 4

A Distributed Dual-Ring Tree Algorithm for Bluetooth Network...

引用

IEEE International Conference on Consumer Electronics - Taiwan (ICCE-TW)

作者： Yu, Chih-Min Ku, Meng-Lin Lin, En-Li Chung Hua Univ Dept Elec Engn Hsinchu Taiwan Natl Cent Univ Dept Comm Engn Taoyuan Taiwan

ISBN: (纸本)9781509040179

In this paper, a distributed Dual-Ring Tree scatternet formation is proposed to generate a reliable topology for Bluetooth networks. To mitigate the formation complexity, each root distributively connects with its downstream roots with local topology instead of global nodes information, instructs them to connect together, and generates a desired dual-ring subnet via distributed computation with three predefined parameters c, rl and r2. Each root then serves as a coordinator to construct its own spanning tree subnet, finally creating a reliable Dual-Ring Tree scatternet. Computer simulation shows that the distributed Dual-Ring Tree method outperforms the conventional BlueHRT in throughput performance for Bluetooth multi-hop networks.

关键词： Throughput Bluetooth Topology Spread spectrum communication algorithm design and analysis Network topology

来源：评论

学校读者我要写书评

暂无评论

An Exact and Sustainable analysis of Non-Preemptive Scheduling 38

An Exact and Sustainable Analysis of Non-Preemptive Scheduli...

引用

38th IEEE Real-Time Systems Symposium (RTSS)

作者： Nasri, Mitra Brandenburg, Bjoern B. Max Planck Inst Software Syst MPI SWS Saarbrucken Germany

ISBN: (纸本)9781538614143

This paper provides an exact and sustainable schedulability test for a set of non-preemptive jobs scheduled with a fixed-job-priority (FJP) policy upon a uniprocessor. Both classic work-conserving and recent non-work-conserving schedulers are supported. Jobs may exhibit both release jitter and execution time variation. Both best-and worst-case response time bounds are derived. No prior response-time analysis (RTA) for this general setting is both exact and sustainable, nor does any prior RTA support non-work-conserving schedulers. The proposed analysis works by building a schedule graph that precisely abstracts all possible execution scenarios. Key to deferring the state-space explosion problem is a novel path-merging technique that collapses similar scenarios without giving up analysis precision. In an empirical evaluation with randomly generated workloads based on an automotive benchmark, the method is shown to scale to 30+ periodic tasks with thousands of jobs (per hyperperiod).

关键词： Jitter Task analysis Schedules algorithm design and analysis Scheduling algorithms Real-time systems Runtime

来源：评论

学校读者我要写书评

暂无评论

Ensuring Quality Services on WiFi Networks for Offloaded Cellular Traffic 13

Ensuring Quality Services on WiFi Networks for Offloaded Cel...

引用

13th Annual Conference on Wireless On-Demand Network Systems and Services (WONS)

作者： Pibiri, Gianluigi Mc Goldrick, Ciaran Huggard, Meriel Trinity Coll Dublin Sch Comp Sci & Stat Dublin 2 Ireland

ISBN: (纸本)9783901882883

One of the more obvious ways to reduce the volume of data traffic on cellular networks is through the use of handover to fixed networks via WiFi and other radio channels. With the growing focus on emerging 5G concepts and technologies, there has been a corresponding focus on the functional mechanisms needed to achieve this handover in a timely fashion. Much less attention has been paid to the practicalities, in terms of ensuring that the end-user experiences little or no loss in the quality of their network services when the handover occurs. In this paper, a methodology for managing such handover traffic in a WiFi network is proposed. The approach integrates and leverages aspects of three quality control mechanisms to enable stable, higher quality delivery of enhanced WiFi network services. It combines i) information adduced from a theoretical model with ii) a low complexity Quality of Experience metric that is quick and easy to estimate and iii) a queue management scheme.

关键词： Quality of service Wireless networks algorithm design and analysis Wireless fidelity Measurement

来源：评论

学校读者我要写书评

暂无评论

Finite-Time Distributed Optimization with Quadratic Objective Functions under Uncertain Information 56

Finite-Time Distributed Optimization with Quadratic Objectiv...

引用

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

作者： Feng, Zhi Hu, Guoqiang Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore

ISBN: (纸本)9781509028733

This paper presents distributed algorithms for finite-time convex optimization problem of multi-agent systems. The uncertain information comes from the noise corruption or interference in the communication as well as computation performed by the agents. The objective is to design distributed algorithms so that a team of agents, each with its own private cost function and communicating over an undirected graph, seeks to minimize the sum of local objective functions in a finite time. Specifically, a distributed algorithm with robust consensus strategies is proposed to solve this distributed optimization problem so that the optimal solution can be estimated in a finite time. The developed algorithm is applied to the economic dispatch problem and it shows that under the proposed algorithms, the optimal solution can be achieved in a finite time, while satisfying both the global generation-demand constraints and local generation capacity constraints.

关键词： Optimization Robustness Linear programming Economics algorithm design and analysis Distributed algorithms Convergence

来源：评论

学校读者我要写书评

暂无评论

A Probabilistic Retransmission Protocol on a Relaying Network 28

A Probabilistic Retransmission Protocol on a Relaying Networ...

引用

28th Annual IEEE International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)

作者： Maliqi, Faton Bassi, Francesca Duhamel, Pierre Limani, Ilir Univ Paris Sud Cent Supelec CNRS L2S Gif Sur Yvette France ESME Sudria Ivry France Univ Prishtina Fac Elect & Comp Engn Prishtina Kosovo

ISBN: (纸本)9781538635315

Relaying protocols are usually deterministic, i.e. they commute from one action to the next one in a predefined manner, depending on the success of the transmission. This paper demonstrates the advantages that probabilistic protocols (i.e. the next action to be undertaken depends on some probability) may have in this context. The whole study is performed on a simple source-relay-destination network, the relay working in demodulate and forward mode, in order to obtain insights on the interaction between relaying and HARQ. So far, probabilistic protocols have been mainly proposed for higher layers of communication systems, but are applied here to physical and MAC layers. Since it contains only two parameters, we demonstrate that our probabilistic protocol can easily be tuned for best performance using a Finite State Markov Chain (FSMC), and that it brings improvement over deterministic protocols in the same scenario.

关键词： Protocols Probabilistic logic Relays Markov processes Optimization Decoding algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Performance of Advanced Telecommand Frame Synchronizer under Pulsed Jamming Conditions

Performance of Advanced Telecommand Frame Synchronizer under...

引用

IEEE International Conference on Communications (ICC)

作者： Noels, Nele Moeneclaey, Marc Univ Ghent TELIN Sint Pietermiewstr 41 B-9000 Ghent Belgium

ISBN: (纸本)9781467389990

This paper studies frame synchronization for use with the advanced communication link transmission unit format that was recently proposed for updating the telecommand synchronization and channel coding standard for space applications. With a view to improving the robustness against jamming, future satellite telecommand systems are planning to adopt direct-sequence spread spectrum modulation and advanced channel coding. Compared to the frame synchronization algorithm specified in the current Consultative Committee for Space Data Systems (CCSDS) recommendation, we consider a longer start sequence and relax the condition for declaring synchronization. We investigate the performance of this algorithm in the presence of jamming, and show that the frame synchronizer can be designed such that the overall system's robustness against pulsed jamming is limited by the robustness of the code rather than the synchronizer.

关键词： Jamming Synchronization Satellites Standards algorithm design and analysis Channel coding Next generation networking

来源：评论

学校读者我要写书评

暂无评论

Data-Flow Implementation of Concurrent Asynchronous Systems

Data-Flow Implementation of Concurrent Asynchronous Systems

引用

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

作者： Gebali, Fayez Alzahrani, Ali Univ Victoria Elect & Comp Engn Dept Victoria BC Canada

ISBN: (纸本)9781538607008

Embedded multi core systems are implemented as systems-on-chip (SoC) that rely on packet store-and-forward networks-on-chip (NoC) for communications. These systems do not use busses nor global clock. Instead routers are used to move data between the cores and each core uses its own local clock. This implies concurrent asynchronous computing. Implementing algorithms in such system is very much facilitated using event-driven concepts. In this work, we propose an event-driven hardware computational model that is more suitable to describe, simulate, and design concurrent asynchronous systems. The proposed model of computation has advantages such as flexible I/O timing in term of scheduling policy, processing wise execute as soon as possible, and self timed event driven system. In other words, I/O timing and correctness of algorithm evaluation are dissociated in this work. The main advantage of this proposal is ability to obfuscate algorithm evaluation to thwart side-channel attacks which has important implications for cryptographic applications.

关键词： Clocks Hardware algorithm design and analysis Bandwidth Input variables Computational modeling Timing

来源：评论

学校读者我要写书评

暂无评论

Realization of the algorithm for system of linear equations in duality quantum computing 85

Realization of the algorithm for system of linear equations ...

引用

IEEE 85th Vehicular Technology Conference (VTC Spring)

作者： Wei, Shi-jie Zhou, Zeng-rong Ruan, Dong Long, Gui-Lu Tsinghua Univ Dept Phys Key Lab Low Dimens Quantum Phys Beijing 100084 Peoples R China Tsinghua Univ Dept Phys Key Lab Low Dimens Quantum Phys Tsinghua Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China

ISBN: (纸本)9781509059324

Solving systems of linear equations is important both in classical and quantum computing. Harrow-Hassidim-Lloyd algorithm (HHL algorithm), a quantum algorithm for solving systems of linear equations, has achieved exponentially improved performance compared with corresponding classical algorithm. We will show in this article that the HHL algorithm is actually a duality quantum algorithm with non-unitary transformation from initial to the final state. We present a detailed realization of the HHL algorithm in a duality quantum computing formalism that allows the construction of non-unitary operations. The divider structure, combinor structure, and the total quantum circuit for the HHL algorithm in the duality quantum computing formalism are given explicitly.

关键词： Quantum computing Mathematical model Electronic mail algorithm design and analysis Transforms Quantum mechanics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 43 44 45 46 47 48 49 50 51 52 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：