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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

139 篇 期刊文献
67 篇 会议
3 篇 学位论文
1 册 图书

馆藏范围

210 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

172 篇 工学
- 143 篇 计算机科学与技术...
- 35 篇 电气工程
- 34 篇 软件工程
- 22 篇 信息与通信工程
- 17 篇 控制科学与工程
- 7 篇 材料科学与工程（可...
- 5 篇 电子科学与技术（可...
- 4 篇 机械工程
- 4 篇 仪器科学与技术
- 3 篇 光学工程
- 3 篇 石油与天然气工程
- 3 篇 网络空间安全
- 2 篇 纺织科学与工程
- 1 篇 力学（可授工学、理...
- 1 篇 动力工程及工程热...
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 测绘科学与技术
70 篇 理学
- 60 篇 数学
- 7 篇 化学
- 4 篇 物理学
- 4 篇 统计学（可授理学、...
- 3 篇 生物学
- 1 篇 地球物理学
- 1 篇 系统科学
23 篇 管理学
- 22 篇 管理科学与工程(可...
4 篇 教育学
- 4 篇 教育学
- 1 篇 心理学(可授教育学...
2 篇 经济学
- 1 篇 应用经济学
1 篇 法学
- 1 篇 法学
1 篇 医学

主题

210 篇 algorithm analys...
11 篇 computational co...
8 篇 algorithms
7 篇 parallel algorit...
7 篇 attenuated total...
7 篇 optimization
7 篇 fourier transfor...
6 篇 approximation al...
5 篇 visualisation
5 篇 mathematical sof...
5 篇 cryptography
4 篇 complex networks
4 篇 majority problem
4 篇 adaptive time-st...
4 篇 computational st...
4 篇 search trajector...
4 篇 combinatorial op...
4 篇 np-completeness
3 篇 multi-objective ...
3 篇 plurality proble...

机构

5 篇 lund univ ctr ma...
5 篇 univ stirling st...
3 篇 artificial intel...
3 篇 iit dept comp sc...
2 篇 univ nancy 1 lor...
2 篇 ucl england
2 篇 univ oklahoma sc...
2 篇 aberystwyth univ...
2 篇 inria lorraine f...
2 篇 univ illinois de...
2 篇 univ tsukuba tsu...
2 篇 univ stirling st...
2 篇 australian natl ...
2 篇 chinese acad sci...
2 篇 karlsruhe inst t...
2 篇 tech univ munich...
2 篇 university of st...
1 篇 natl def univ ch...
1 篇 prince sultan un...
1 篇 department of ma...

作者

10 篇 ochoa gabriela
7 篇 liu yongliang
5 篇 he jun
5 篇 söderlind g
5 篇 kim hee-jin
4 篇 wang l
4 篇 aranha claus
4 篇 lavinas yuri
4 篇 blum christian
3 篇 delhom christoph...
3 篇 dunke fabian
3 篇 alonso laurent
3 篇 liang weifa
3 篇 reingold edward ...
3 篇 xu zichuan
3 篇 haslbeck maximil...
3 篇 collins george e...
3 篇 nickel stefan
2 篇 lammich peter
2 篇 raywardsmith vj

语言

197 篇 英文
12 篇 其他
1 篇 中文

检索条件"主题词=algorithm analysis"

共 210 条记录，以下是161-170 订阅

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

详细简洁

排序：

Commonsense Computing (episode 5): algorithm Efficiency and Balloon Testing 09

Commonsense Computing (episode 5): Algorithm Efficiency and ...

引用

5th International Computing Education Research Workshop (ICER 2009)

作者： McCartney, Robert Bouvier, Dennis J. Chen, Tzu-Yi Lewandowski, Gary Sanders, Kate Simon, Beth VanDeGrift, Tammy Univ Connecticut Dept Comp Sci & Engn Storrs CT 06269 USA

ISBN: (纸本)9781605586151

This paper investigates what students understand about algorithm efficiency before receiving any formal instruction on the topic. We gave students a challenging search problem and two solutions, then asked them to identify the more efficient solution and to justify their choice. Many students did not use the standard worst-case analysis of algorithms;rather they chose other metrics, including average-case, better for more cases, better in all cases, one algorithm being more correct, and better for real-world scenarios. Students were much more likely to choose the correct algorithm when they were asked to trace the algorithms on specific examples;this was true even if they traced the algorithms incorrectly.

关键词： commonsense preconceptions constructivism water balloons algorithm analysis

来源：评论

学校读者我要写书评

暂无评论

Solving Recurring Student Problems with Recurrences

Solving Recurring Student Problems with Recurrences

引用

12th Annual Conference on Innovation and Technology in Computer Science Education

作者： Byrd, Jonathan Carter, Monty Cook, David Kirkham, Philip Kosa, Martha J. Tennessee Technol Univ Dept Comp Sci Cookeville TN 38505 USA

We describe a prototype of RRTS (Recurrence Relation Tutorial System), a tool for Students to use to practice solving homogeneous and non-homogeneous recurrence relations, both linear and divide-and-conquer, that aris... 详细信息

ISBN: (纸本)9781595936103

关键词： Recurrence relations algorithm analysis

来源：评论

学校读者我要写书评

暂无评论

A Green Software-Defined Communication Processor for Dynamic Spectrum Access

A Green Software-Defined Communication Processor for Dynamic...

引用

21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Liang, Ching-Kai Chen, Kwang-Cheng Natl Taiwan Univ Grad Inst Commun Engn Taipei 106 Taiwan

ISBN: (纸本)9781424480166

Dynamic spectrum access (DSA) supporting opportunistic transmission without extra spectrum bandwidth is attractive for future wireless communication. To facilitate such DSA system, a power-efficient (green) communication processor is needed to support extremely high speed operation on a power-limited mobile device. Traditional general-purpose and digital signal processors are unable to simultaneously satisfy the processing speed and power efficiency for DSA systems. By exploiting critical parallelism and data exchange patterns based on communication algorithms inside a green processor, we successfully develop green SDR based communications processor for DSA that can be reconfigured to multiple system operation. We verify this novel architecture in TSMC 0.13 mu m CMOS process and demonstrate advantages simultaneously in performance and power efficiency.

关键词： Software Defined Radio Dynamic Spectrum Access Communication processor algorithm analysis Reconfigurable architecture

来源：评论

学校读者我要写书评

暂无评论

PARALLEL MEAN SHIFT ACCURACY AND PERFORMANCE TRADE-OFFS 25

PARALLEL MEAN SHIFT ACCURACY AND PERFORMANCE TRADE-OFFS

引用

25th IEEE International Conference on Image Processing (ICIP)

作者： Duncan, Kirsty R. Stewart, Robert Michaelson, Greg Heriot Watt Univ Sch Math & Comp Sci Edinburgh Midlothian Scotland

ISBN: (纸本)9781479970612

This paper decomposes the algorithmic parameters that affect the accuracy and parallel run times of mean shift segmentation. Following Comaniciu and Meer [1], rather than perform calculations in the feature space of the image, the joint spatial-range domain is represented by the image space, with feature space information associated with each point. We report parallel speedup and segmentation accuracy using a standardised segmentation dataset and the Probabilistic Rand index (PRI) accuracy measure. Changes to the algorithmic parameters are analysed and a sweet spot between PRI and run time is found. Using a range window radius of 20, spatial window radius of 10 and threshold of 50, the PRI is improved by 0.17, an increase of 34% which is comparable to state of the art. Mean shift clustering run time is reduced by 97% with parallelism, a speedup of 32 on a 64-core CPU.

关键词： Image segmentation mean shift algorithm analysis parallel processing

来源：评论

学校读者我要写书评

暂无评论

Chessboard Cryptalgorithm 2

Chessboard Cryptalgorithm

引用

2nd International Conference on Advances in Electronics, Computers and Communications (ICAECC)

作者： Prajit, T. R. Ramaiah Inst Technol Dept Elect & Commun Bengaluru 54 India

ISBN: (纸本)9781538637852

Chessboard cryptalgorithm is an algorithm to encrypt N bit binary data using a key of size N. It provides unique mappings for each key and scrambles the sequence using an approach similar to the movement of the Queen on the chessboard. An important property is that the function for encryption and decryption is the same and not inverse as in typical cryptalgorithms. The number of combinations that can be generated is large and therefore to an extent, it protects against the brute force approach.

关键词： algorithm analysis cryptography network security encryption decryption

来源：评论

学校读者我要写书评

暂无评论

Indexing techniques for file sharing in scalable peer-to-peer networks

Indexing techniques for file sharing in scalable peer-to-pee...

引用

11th International Conference on Computer Communications and Networks

作者： Annexstein, FS Berman, KA Jovanovic, MA Ponnavaikko, K Univ Cincinnati Dept ECECS Cincinnati OH 45221 USA

ISBN: (纸本)078037553X

File sharing is a very popular service provided by peer-to-peer (P2P) networks. In a P2P file-sharing network, users share files and issue queries to the network to find the locations of the riles residing at other peer nodes. Due to factors such as large user base and use of query broadcast protocols, each node in the network receives many search queries every second. Recently network developers have incorporated proxy-enabled peers, or supernodes, which are designed to enhance scalability by providing indexing services to nodes on slower network connections. Typically, supernodes build a vector or multi-index of all the filenames of the shared files stored on other (slower) peers nodes connected to them. In this paper we consider a new model whereby the index tables of the individual nodes are merged into a single data structure stored by the supermode. We analyze this new model in relation to the standard vectorized data structure. We compare the performance of these supernode indexing algorithms and provide a theoretical analysis that is asymptotic and probabilistic in nature. However, there are several significant constant factors that the theory does not account for, and which in practice are important for designing an optimal system solution. We report herein on a series of simulation experiments which provide 1) verification of the asymptotic analysis of the formal framework, and 2) tools to determine the magnitude of the constant factors involved in the performance analysis. Our general conclusion is that when the query rate exceeds the rate of data updates, the new merged model is preferable to the vector model. However, the details of our analysis allow us to consider combinations of several parameters, and thereby enable the design of optimal indexing schemes via the incorporation of measurements of the parameters of particular applications.

关键词： peer-to-peer computing text indexing file sharing algorithm analysis

来源：评论

学校读者我要写书评

暂无评论

Hoare Logics for Time Bounds A Study in Meta Theory 24th

Hoare Logics for Time Bounds A Study in Meta Theory

引用

24th International Conference on Tools and algorithms for the Construction and analysis of Systems (TACAS) Held as Part of the 21st European Joint Conferences on Theory and Practice of Software (ETAPS)

作者： Haslbeck, Maximilian P. L. Nipkow, Tobias Tech Univ Munich Munich Germany

ISBN: (纸本)9783319899602;9783319899596

We study three different Hoare logics for reasoning about time bounds of imperative programs and formalize them in Isabelle/HOL: a classical Hoare like logic due to Nielson, a logic with potentials due to Carbonneaux et al. and a separation logic following work by Atkey, Chaguerand and Pottier. These logics are formally shown to be sound and complete. Verification condition generators are developed and are shown sound and complete too. We also consider variants of the systems where we abstract from multiplicative constants in the running time bounds, thus supporting a big-O style of reasoning. Finally we compare the expressive power of the three systems.

关键词： Hoare logic algorithm analysis Program verification

来源：评论

学校读者我要写书评

暂无评论

Parallel program design in visual environment

Parallel program design in visual environment

引用

4th International Conference on High-Performance Computing (HiPC 97)

作者： Trichina, E Oinonen, J Univ of South Australia The Levels

ISBN: (纸本)0818680679

The great challenge in parallel computing is to make a task of programming parallel machines easy while not sacrificing the efficiency of target code. One of the successful methodologies is to start from a high-level specification of the functional behaviour of a program by applying a sequence of optimizing transformations tuned for a particular architecture to generate a specification of the operational behaviour of a parallel program. We believe that visualization is an excellent way to bring this methodology to a wider programming community. In this paper we describe an interactive visual system which integrates 3D graphics, animation, and direct manipulation techniques into parallel programming environment.

关键词： parallel program development algorithm analysis data dependency graph domain morphisms visualisation

来源：评论

学校读者我要写书评

暂无评论

Optimized Selection Sort algorithm for Two Dimensional Array 12

Optimized Selection Sort Algorithm for Two Dimensional Array

引用

12th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Ullah, Sultan Khan, Muhammad A. Khan, Mudasser A. Akbar, H. Hassan, Syed S. Univ Haripur Dept Informat Technol Haripur Pakistan Univ Haripur Comp & Commun Res Lab Haripur Pakistan

ISBN: (纸本)9781467376822

The main idea of Optimized Selection Sort algorithm (OSSA) is based on the already existing selection sort algorithm, with a difference that old selection sort;sorts one element either smallest or largest in a single iteration while optimized selection sort, sorts both the elements at the same time i.e smallest and largest in a single iteration. In this study we have developed a variation of OSSA for two-dimensional array and called it Optimized Selection Sort algorithms for Two-Dimensional arrays OSSA2D. The hypothetical and experimental analysis revealed that the implementation of the proposed algorithm is easy. The comparison shows that the performance of OSSA2D is better than OSSA by four times and when compared with old Selection Sort algorithm the performance is improved by eight times (i.e if OSSA can sort an array in 100 seconds, OSSA2D can sort it in 24.55 Seconds, and similarly if Selection Sort takes 100 Seconds then OSSA2D take only 12.22 Seconds). This performance is remarkable when the array size is very large. The experiential results also demonstrate that the proposed algorithm has much lower computational complexity than the one dimensional sorting algorithm when the array size is very large.

关键词： algorithm analysis Sorting algorithms Two Dimensional Arrays Computational Complexity

来源：评论

学校读者我要写书评

暂无评论

Decision/Objective Space Trajectory Networks for Multi-objective Combinatorial Optimisation 1

引用

23rd European Conference on Evolutionary Computation in Combinatorial Optimisation (EvoCOP) Held as Part of EvoStar Conference

作者： Ochoa, Gabriela Liefooghe, Arnaud Lavinas, Yuri Aranha, Claus Univ Stirling Stirling FK9 4LA Scotland Univ Lille CNRS UMR CRIStAL 9189 InriaCent Lille F-59000 Lille France Univ Tsukuba 1-1-1 Tennodai Tsukuba Ibaraki 3058577 Japan

ISBN: (数字)9783031300356

ISBN: (纸本)9783031300349;9783031300356

This paper adapts a graph-based analysis and visualisation tool, search trajectory networks (STNs) to multi-objective combinatorial optimisation. We formally define multi-objective STNs and apply them to study the dynamics of two state-of-the-art multi-objective evolutionary algorithms: MOEA/D and NSGA2. In terms of benchmark, we consider two- and ***-landscapes for constructing multi-objective multi-modal landscapes with objective correlation. We find that STN metrics and visualisation offer valuable insights into both problem structure and algorithm performance. Most previous visual tools in multi-objective optimisation consider the objective space only. Instead, our newly proposed tool asses algorithm behaviour in the decision and objective spaces simultaneously.

关键词： algorithm analysis search trajectory networks STNs combinatorial optimisation visualisation multi-objective optimisation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共21页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：