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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

COmBAT: Cross-layer Based Testbed with analysis Tool Implemented Using Software Defined Radios 35

COmBAT: Cross-layer Based Testbed with Analysis Tool Impleme...

引用

35th IEEE Military Communications Conference (MILCOM)

作者： Jagannath, Jithin Saarinen, Hanne Woods, Timothy O'Brien, Joshua Furman, Sean Drozd, Andrew Melodia, Tommaso ANDRO Computat Solut LLC ANDRO Adv Appl Technol Rome NY 13440 USA Northeastern Univ Dept Elect & Comp Engn Boston MA 02115 USA

ISBN: (纸本)9781509037810

In this paper, we discuss the implementation of a CrOss-layer Based testbed with analysis Tool (COmBAT). COmBAT is developed to enable the design and development process of next-generation cross-layer based wireless communication technologies for tactical ad-hoc networks. The COmBAT architecture comprises of two major components;(i) Adaptive cross-layer (AXL) framework implemented on each node in the testbed and (ii) NEtwork Analyzing Tool (NEAT) that provides a graphical interface for users to track and analyze network metrics as well as provide a single seat control over the network parameters on-the-fly. In this paper, we discuss the design and implementation of these components in detail and demonstrate its feasibility by implementing three cross-layer based algorithms on COmBAT using a nine node ad-hoc network. The results validate the modularity and adaptability of COmBAT and demonstrate how COmBAT can be used to develop as well as refine current and future cross-layer algorithms providing a feasibility study that lends itself to the transition of theoretical network research from testbed to relevant military hardware.

关键词： algorithm design and analysis Media Access Protocol Registers Resource management Routing Software

来源：评论

学校读者我要写书评

暂无评论

Constraint Handling in Agent-Based Optimization by Independent Sub-Swarms

Constraint Handling in Agent-Based Optimization by Independe...

引用

IEEE Congress on Evolutionary Computation (CEC)

作者： Poole, Daniel J. Allen, Christian B. Rendall, Thomas C. S. Univ Bristol Dept Aerosp Engn Bristol BS8 1TR Avon England

ISBN: (纸本)9781479914883

Agent-based optimization algorithms are an effective means of solving global optimization problems with design spaces containing multiple local minima, however, modifications have to be made to such algorithms to be able to solve constrained optimization problems. The gravitational search algorithm (GSA) is an efficient and effective agent-based method, however, the idea of global transfer of data that is key to the algorithm's success prohibits coupling of many state-of-the-art methods for handling constraints. Hence, a robust method, called separation-sub-swarm (3S) has been developed specifically for use with GSA by exploiting but also accommodating the global transfer of data that occurs in GSA, however it can also act as an entirely black-box module so is generally applicable. This newly developed 3S method has been shown to be efficient and effective at optimizing a suite of constrained analytical test functions using GSA.

关键词： algorithm design and analysis Educational institutions Heuristic algorithms Linear programming Optimization Particle swarm optimization Search problems

来源：评论

学校读者我要写书评

暂无评论

An algorithm for Source Signal Extraction from the Peripheral Nerve

An Algorithm for Source Signal Extraction from the Periphera...

引用

33rd Annual International Conference of the IEEE Engineering-in-Medicine-and-Biology-Society (EMBS)

作者： Tang, Yuang Wodlinger, Brian Durand, Dominique M. Case Western Reserve Univ Dept Biomed Engn Cleveland OH 44106 USA

ISBN: (纸本)9781424441228

Extracting physiological signals to control external devices such as prosthetics is a field of research that offers great hope for patients suffering from disabilities. In this paper, a novel source signal extraction algorithm, based on the source localization method Champagne, is presented. The algorithm constructs spatial filters that not only maximizes the signal to noise ratio ( SNR > 13dB) of the source activities but also minimizes the cross-talk interference between the sources 10log(P(source of interest)/P(interference sources) > 14dB.

关键词： algorithm design and analysis Approximation methods Filtering algorithms Interference Signal to noise ratio Spatial filters cross-talk interference external devices medical signal processing neurophysiology peripheral nerve prosthetics prosthetics signal-

来源：评论

学校读者我要写书评

暂无评论

Virtual trajectory in tracking control of mobile robots

Virtual trajectory in tracking control of mobile robots

引用

IEEE/ASME International Conference on Advanced Intelligent Mechatronics

作者： Lee, S Park, JH Hanyang Univ Dept Precis Mech Engn Seoul 133791 South Korea

ISBN: (纸本)0780377591

During trajectory tracking, it is highly likely that a mobile robot has to perform other functions such as obstacle avoidance, map correction, posture correction, and etc. If the mobile robot must track its original reference trajectory after finishing some of these functions, exact time trajectory tracking is difficult due to large distance error And plannig a new trajectory on each event is not efficient and has some drawbacks. So, in this paper, we propose a virtual trajectory whose time scale is the only parameter that is different from the original trajectory. We also show its convergence to the original trajectory and the effectiveness of the algorithm by simulating the virtual trajectory design with a backstepping controller Simulation results show that the virtual trajectory gives a stable and advanced performance for the case that the mobile robot must perform other functions during trajectory tracking. And due to the time and position convergence characteristics, the virtual trajectory is helpful to any delayed tracking problem. The proposed virtual trajectory can be adapted not only mobile robot, but also any system which track a reference trajectory.

关键词： algorithm design and analysis Backstepping Convergence Delay effects Environmental management Finishing Mechanical engineering Mobile robots Robot control Trajectory

来源：评论

学校读者我要写书评

暂无评论

Relaxing DRAM Refresh Rate through Access Pattern Scheduling: A Case Study on Stencil-based algorithms 23

Relaxing DRAM Refresh Rate through Access Pattern Scheduling...

引用

23rd IEEE International Symposium on On-Line Testing and Robust System design (IOLTS)

作者： Tovletoglou, Konstantinos Nikolopoulos, Dimitrios S. Karakonstantis, Georgios Queens Univ Belfast EEECS Belfast Antrim North Ireland

ISBN: (纸本)9781538603529

The main memory in today's systems is based on DRAMs, which may offer low cost and high density storage for large amounts of data but it comes with a main drawback;DRAM cells need to be refreshed frequently for retaining the stored data. The refresh rate in modern DRAMs is set based on the worst-case retention time without considering access statistics, thereby resulting in very frequent refresh operations. Such high refresh rate leads eventually to large power and performance overheads, which are increasing with higher DRAM densities. However, such high refresh rates may not even required due to extremely low probability of the actual occurrence of the assumed worst-case scenarios, or due to the implicit refresh operation that occur during every memory access, a feature that has not been yet been studied in depth. In this paper, we enhance the state-of-the-art by systematically exploiting the implicit refresh of memory access for relaxing the refresh rate, while minimizing the resulting memory errors. This is achieved by modifying the algorithmic parameters that influence the access patterns such that all stored data are being touched within a target time interval that is necessary for meeting a target error rate. The proposed method is applied to stencil-based algorithms which represent a wide class of algorithms used in numerical analysis, image processing and cellular automata applications. The efficacy of the proposed method is demonstrated on an off-the-shelf server running a fully fledged Linux OS and results show that it is even possible to completely disable DRAM refresh with minor quality loss.

关键词： Random access memory Memory management Capacitors algorithm design and analysis Organizations Benchmark testing Electronic mail

来源：评论

学校读者我要写书评

暂无评论

On the Performance of Broadcast Based Consensus under Non-Zero-Mean Stochastic Disturbances

On the Performance of Broadcast Based Consensus under Non-Ze...

引用

12th IEEE International Workshop on Signal Processing Advances in Wireless Communications

作者： Yang, Yang Blum, Rick S. Lehigh Univ ECE Dept Bethlehem PA 18015 USA

ISBN: (纸本)9781424493326

The broadcast-based consensus algorithm is one special type of randomized consensus algorithm, and is amenable to practical implementation in wireless networks. This paper focuses on the performance analysis of this broadcast-based consensus algorithm in the presence of non-zero-mean stochastic perturbations. It is demonstrated that as the algorithm proceeds, the deviation of the node states from their average will converge, in expectation, to a fixed value, which is determined by the Laplacian matrix of the network, the mixing parameter, and the mean of the stochastic perturbations. Asymptotic upper and lower bounds on the total mean-square deviation are derived, which describe the range of distances over which the node states deviate from consensus. These bounds can facilitate evaluation of the applicability of this algorithm in practice. In addition, performance of the broadcast-based consensus algorithm under zero-mean stochastic disturbances is also analyzed, and results regarding its convergence and mean-square deviation are given. The theoretical results presented in this work hold true regardless of the statistics of the stochastic disturbances, and are valid for arbitrary network topology as long as the topology is connected.

关键词： algorithm design and analysis Clocks Convergence Laplacian matrix Network topology Signal processing algorithms Stochastic processes Symmetric matrices broadcast-based consensus algorithm matrix algebra mean square deviation network topology nonzero-mean stochastic perturbation radio networks stochastic processes telecommunication network topology wireless networks

来源：评论

学校读者我要写书评

暂无评论

Beaver algorithm for Network Security and Optimization: Preliminary Report

Beaver Algorithm for Network Security and Optimization: Prel...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Ayesh, Aladdin De Montfort Univ Fac Technol Dept Informat Intelligent Mobile Robots & Creat Comp Res Grp Leicester LE1 9BH Leics England

ISBN: (纸本)9781424427932

This paper presents the theoretical account for designing and developing an algorithm for network security inspired by the behavior of Beavers. The algorithm uses the beaver behavioral patterns in constructing dams and water tunnels to create analogous secure tunnels and information lakes. The approach is a user-centric and the paper demonstrates the use of the algorithm in security and route optimization with the assumption that the beaver agent is deployed on a mobile device (e.g. smart mobile phone). An algorithmic approach to design the beaver agent and swarm is followed here. The set of algorithms presented is complemented by critical review outlining the further work needed.

关键词： Particle swarm optimization Information security Ad hoc networks algorithm design and analysis Animals Data security Computer security Mobile handsets Buildings Protection

来源：评论

学校读者我要写书评

暂无评论

A New Hybrid Ant Colony algorithm for Clustering Problem

A New Hybrid Ant Colony Algorithm for Clustering Problem

引用

International Workshop on Education Technology and Training/International Workshop on Geoscience and Remote Sensing (ETT and GRS 2008)

作者： Gao Shang Zhang Zaiyue Zhang Xiaoru Cao Cungen Jiangsu Univ Sci & Technol Sch Engn & Comp Sci Zhenjiang 212003 Peoples R China Chinese Acad Sci Comp Technol Inst Key Lab Intelligent Informat Proc Beijing 100080 Peoples R China

ISBN: (纸本)9780769535630

The known mathematical model for clustering problems is given in this paper. With the K-Means algorithm, the simulated annealing algorithm and a novel hybrid ant colony algorithm is integrated with the K-means algorithm to solve clustering problems. The advantages and shortages of K-Means algorithm, simulated annealing algorithm and the hybrid ant colony algorithm are then analyzed, so that effectiveness of the hybrid ant colony algorithm would be illustrated through results.

关键词： Clustering algorithms Simulated annealing Mathematical model algorithm design and analysis Iterative algorithms Feedback Distributed computing Ant colony optimization Computer science education Educational technology

来源：评论

学校读者我要写书评

暂无评论

Automatic Scan Parallelization in OpenMP 29

Automatic Scan Parallelization in OpenMP

引用

8th International Symposium on Computer Architecture and High Performance Computing (SBAC-PADW)

作者： Zegarra, Maicol Pereira, Marcio Martorell, Xavier Araujo, Guido Univ Estadual Campinas Inst Comp Campinas SP Brazil UPC Comp Architecture Dept Barcelona Spain Inst Comp Campinas SP Brazil

ISBN: (纸本)9781538648193

Prefix Scan (or simply scan) is an operator that computes all the partial sums of a vector. A scan operation results in a vector where each element is the sum of the preceding elements in the original vector up to the corresponding position. Scan is a key operation in many relevant problems like sorting, lexical analysis, string comparison, image filtering among others. Although there are libraries that provide hand-parallelized implementations of scan in CUDA and OpenCL, no automatic parallelization solution exists for this operator in OpenMP. This paper proposes a new clause for OpenMP which enables the automatic synthesis of the parallel scan. By using the proposed clause a programmer can considerably reduce the complexity of designing scan based algorithms, thus allowing he or she to focus the attention on the problem and not on learning new parallel programming models or languages. Scan was designed in AClang, an open-source LLVM/Clang compiler framework that implements the recently released OpenMP 4.X Accelerator Programming Model. Experiments running a set of typical scan based algorithms on NVIDIA, Intel, and ARM GPUs reveal that the performance of the proposed OpenMP clause is equivalent to that achieved when using OpenCL library calls, with the advantage of a simpler programming complexity.

关键词： Indexes algorithm design and analysis Kernel Complexity theory Arrays Libraries

来源：评论

学校读者我要写书评

暂无评论

Network Selection for Secondary Users in Cognitive Radio Systems

Network Selection for Secondary Users in Cognitive Radio Sys...

引用

IEEE INFOCOM Conference

作者： Wang, Chonggang Sohraby, Kazem Jana, Rittwik Ji, Lusheng Daneshmand, Mahmoud InterDigital Commun King Of Prussia PA 19406 USA NEC Labs Amer Princeton NJ 08540 USA Univ Arkansas Fayetteville AR 72701 USA AT&T Labs Res Florham Pk NJ 07932 USA

ISBN: (纸本)9781424499212

Existing studies have demonstrated that uneven and dynamic usage patterns by the primary users of license-based wireless communication systems can often lead to temporal and spatial spectrum underutilization. This provides an opportunity for the secondary users (SUs) to tap into underutilized frequency bands provided that they are capable of cognitively accessing systems without colliding or impacting the performance of the primary users (PUs). When there are multiple networks with spare spectrum, secondary users can opportunistically choose the best network to access, subject to certain constraints. In cognitive radio systems, this is referred to as the network selection problem for secondary users. This paper develops a Markov queuing model to obtain the maximum allowable arrival rate of secondary users subject to a target collision probability for the primary users. Based on this model, we design a novel Collision-Constrained Network Selection (CCNS) method that maximizes secondary users' throughput subject to a given PU collision probability. Further, we propose two approaches, referred as CCNS-Greedy and CCNS-Energy, which target to reduce collision probability and to decrease energy consumption of secondary users when the system is underloaded. This, however, has one practical drawback in that the proposed CCNS method depends on PU and SU traffic characteristics such as inter-arrival time and service time, which might not be available in real scenario. We next illustrate that a MEAsurement-based Networks Selection (MEANS) scheme can be used to perform network selection for secondary users based on online measurement of PU collision probability of each network. We evaluated the performance based on extensive simulation, which conclusively shows that the proposed schemes achieve the best performance in terms of resulting PU collision probability, SU throughput, and SU energy consumption, when compared to both Random and Greedy strategies.

关键词： algorithm design and analysis Energy measurement Irrigation Queueing analysis Switches Tin

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 491 492 493 494 495 496 497 498 499 500 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：