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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

14,483 篇 会议
1,344 篇 期刊文献
2 篇 资讯
1 篇 学位论文

馆藏范围

15,830 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,734 篇 工学
- 1,973 篇 计算机科学与技术...
- 1,800 篇 电气工程
- 727 篇 信息与通信工程
- 559 篇 控制科学与工程
- 553 篇 软件工程
- 286 篇 机械工程
- 233 篇 电子科学与技术（可...
- 232 篇 仪器科学与技术
- 47 篇 测绘科学与技术
- 39 篇 交通运输工程
- 30 篇 网络空间安全
- 29 篇 航空宇航科学与技...
- 16 篇 材料科学与工程（可...
- 16 篇 生物医学工程（可授...
- 15 篇 矿业工程
- 12 篇 土木工程
- 12 篇 石油与天然气工程
- 9 篇 动力工程及工程热...
372 篇 管理学
- 369 篇 管理科学与工程(可...
309 篇 理学
- 131 篇 系统科学
- 73 篇 数学
- 53 篇 物理学
- 28 篇 生物学
- 26 篇 地球物理学
- 12 篇 统计学（可授理学、...
83 篇 医学
- 76 篇 临床医学
59 篇 文学
- 59 篇 新闻传播学
21 篇 艺术学
- 21 篇 设计学（可授艺术学...
16 篇 农学
14 篇 军事学
- 14 篇 军队指挥学
11 篇 教育学
- 10 篇 教育学
2 篇 经济学
2 篇 法学

主题

15,830 篇 partitioning alg...
4,703 篇 clustering algor...
3,103 篇 algorithm design...
1,676 篇 computer science
1,287 篇 heuristic algori...
1,140 篇 data mining
910 篇 computational mo...
754 篇 hardware
741 篇 optimization
739 篇 costs
720 篇 image segmentati...
666 篇 iterative algori...
601 篇 parallel process...
575 篇 approximation al...
572 篇 testing
563 篇 routing
506 篇 computer archite...
484 篇 concurrent compu...
468 篇 very large scale...
451 篇 shape

机构

40 篇 ibm thomas j. wa...
38 篇 department of co...
31 篇 school of comput...
25 篇 department of co...
22 篇 department of co...
20 篇 department of el...
18 篇 school of comput...
18 篇 department of co...
18 篇 department of el...
18 篇 at and t bell la...
17 篇 department of co...
17 篇 school of electr...
16 篇 school of comput...
16 篇 department of el...
16 篇 institute of com...
16 篇 department of el...
15 篇 department of co...
15 篇 department of co...
15 篇 department of el...
14 篇 state key labora...

作者

25 篇 xianlong hong
19 篇 hichem frigui
14 篇 sanghamitra band...
14 篇 yici cai
13 篇 jun wang
13 篇 g. karypis
13 篇 li li
13 篇 jing wang
12 篇 sriparna saha
12 篇 tzung-pei hong
12 篇 a.k. jain
12 篇 thambipillai sri...
11 篇 suleyman s. koza...
11 篇 hau-san wong
11 篇 yu wang
11 篇 hui wang
11 篇 jian-jia chen
11 篇 p. banerjee
11 篇 sanjoy baruah
11 篇 francisco de a.t...

语言

15,677 篇 英文
121 篇 其他
32 篇 中文

检索条件"主题词=partitioning algorithms"

共 15830 条记录，以下是411-420 订阅

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

详细简洁

排序：

MAGELLAN: Multiway hardware-software partitioning and scheduling for latency minimization of hierarchical control-dataflow task graphs 01

MAGELLAN: Multiway hardware-software partitioning and schedu...

引用

9th International Symposium on Hardware/Software Codesign (CODES 2001)

作者： Chatha, KS Vemuri, R Univ Cincinnati Dept ECECS Cincinnati OH 45221 USA

ISBN: (纸本)1581133642

The paper presents MAGELLAN, a heuristic technique for mapping hierarchical control-dataflow task graph specifications on heterogeneous architecture templates. The architecture can consist of multiple hardware and software processing elements as specified by the user The objective of the technique is to minimize the worst case latency of the task graph subject to the area constraints on the architecture. The technique uses an iterative approach consisting of closely linked hardware-software partitioner and scheduler Both the partitioner and scheduler operate on the task graph in a hierarchical top down manner. The technique optimizes deterministic loop constructs by applying clustering, unrolling and pipelining. The technique considers speculative execution for conditional constructs. The number of actual hardware/software implementations of a function in the task graph are also optimized by the technique. The effectiveness of the technique is demonstrated bit a case study of on image compression algorithm.

关键词： Delay Scheduling Counting circuits Coprocessors Communication system control partitioning algorithms Timing System buses Pipeline processing Feedback

来源：评论

学校读者我要写书评

暂无评论

Energy-Aware partitioning for On-Chip Bus Architecture using a Multi-Objective Genetic Algorithm

Energy-Aware Partitioning for On-Chip Bus Architecture using...

引用

International Symposium on VLSI Design, Automation and Test (VLSI-DAT)

作者： Chiou, Lih-Yih Chen, Yi-Siou Jian, Ya-Lun Natl Cheng Kung Univ Dept Elect Engn Tainan 70101 Taiwan

ISBN: (纸本)9781424484997

Incorporating power management during partitioning at the system level contributes considerably to energy efficient architecture. Designers commonly implement systems as a mix of partitioning blocks of various sizes, connected using bus interconnection architecture. Therefore, the use of a partitioning approach that partitions a system with the greatest possible idle time on a dedicated interconnection architecture has become unpractical for power management development. This work presents a novel energy-aware hardware clustering algorithm with a performance estimator for on-chip bus based architectures during high level synthesis, to enhance the quality of solutions for implementing power management systems. Experimental results obtained in four cases reveal that the proposed strategy generates a wide range of cost-effective solutions and is highly effective for today's hardware systems.

关键词： Algorithm design and analysis Clustering algorithms Computer architecture Energy consumption Genetic algorithms partitioning algorithms Power demand energy efficient architecture energy-aware hardware clustering energy-aware partitioning genetic algorithms high level synthesis high level synthesis integrated circuit interconnections interconnection architecture multiobjective genetic algorithm on-chip bus architecture on-chip bus based architecture power management systems

来源：评论

学校读者我要写书评

暂无评论

Application of partitioning methods for the design of parallel programs for a system of digital signal processors

Application of partitioning methods for the design of parall...

引用

International Conference on Parallel Computing in Electrical Engineering (PARELEC 2000)

作者： Kortke, M Schmitt, T Merker, R Dresden Univ Technol Fac Elect Engn Inst Circuits & Syst D-01062 Dresden Germany

ISBN: (纸本)076950759X

In this paper the application of partitioning methods developed for the design of parallel processor arrays is examined for the parallel program generation. The target architecture is a system of digital signal processors (DSPs) with high bandwidth communication channels. The partitioning techniques are evaluated by means of a computationally intensive algorithm: the tomographic reconstruction method.

关键词： Bandwidth Communication channels Computer architecture Design methodology Digital signal processing Digital signal processors partitioning algorithms Process design Signal processing algorithms Tomography

来源：评论

学校读者我要写书评

暂无评论

Fast Coding Unit partitioning Algorithm for HEVC

Fast Coding Unit Partitioning Algorithm for HEVC

引用

IEEE International Conference on Consumer Electronics (ICCE)

作者： Hou, Xiaotao Xue, Yonglin Natl Engn Lab DTV Beijing Beijing 100091 Peoples R China Tsinghua Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China

ISBN: (纸本)9781479912919

The High Efficiency Video Coding (HEVC) will be the next generation video standard, which adopts several new techniques to achieve better coding efficiency compared to the current H.264. One significant progress is the way of coding architecture partitioning. HEVC employs a recursive quadtree to get the best partitioning, which means each 64x64 pixel area is analyzed in different size Coding Units (CU). Due to the large number of available partitions, this new partitioning method greatly increases the encoding time. In this paper, one fast CU partitioning algorithm based on Rate Distortion (RD) threshold to save much encoding time is proposed and the test shows that the average quality loss is less than 0.5%.

关键词： quadtrees video coding CU partitioning algorithm H.264. standard HEVC RD average quality loss coding architecture partitioning coding units encoding fast coding unit partitioning algorithm high efficiency video coding next generation video standard rate distortion recursive quadtree Algorithm design and analysis Encoding Equations Mathematical model partitioning algorithms Standards Video coding

来源：评论

学校读者我要写书评

暂无评论

Query-Adaptive Online partitioning of Associated Data for Efficient Retrieval 31

Query-Adaptive Online Partitioning of Associated Data for Ef...

引用

31st IEEE International Conference on Advanced Information Networking and Applications (IEEE AINA)

作者： Zhang, Ting Tran, Duc A. Univ Massachusetts Comp Sci Dept Boston MA 02125 USA

ISBN: (纸本)9781509060290

Data partitioning is a crucial component of any distributed storage system that wants to scale. For retrieval efficiency, data frequently requested together in the same query should be placed on the same server as much as possible. Although intuitive, this is not easy to be implemented if constrained by load balancing;computationally, it is an NP hard problem. Existing research has offered approximate solutions optimized for a given workload of queries, in which the order as to when each query is received is not considered. This paper initiates a new study on online partitioning algorithms that are sequentially optimized for a query sequence. In the new problem, the queries arrive in a stream manner, unknown, and given the option to revise the partition after each query, the objective is to minimize the total query processing cost and data migration cost. We formulate this problem formally, investigate several online heuristics, and evaluate them using simulation.

关键词： Servers Distributed databases partitioning algorithms Adaptation models Itemsets Resource description framework Data models

来源：评论

学校读者我要写书评

暂无评论

Simplified Data partitioning in a Consistent Hashing Based Sharding Implementation

Simplified Data Partitioning in a Consistent Hashing Based S...

引用

IEEE Region 10 Conference (TENCON)

作者： Venkateswaran, Narayanan Changder, Suvamoy Department of Electrical Engineering Georgia Southern University Statesboro GA USA Wireless@VT Virginia Tech Blacksburg VA USA

ISBN: (纸本)9781509011346

Sharding implementations use consistent hashing for distributing a database uniformly across the servers in the topology. Each data item in the database is identified uniquely by a sharding key. The sharding keys are hashed into a hash ring. This hash ring is split into equal sized partitions and each server is allocated an equal number of partitions. Each partition represents a portion of the database, referred to as a virtual shard. Maintaining virtual shards and presenting an unified picture of the database to the user requires complicated logic. This paper provides a mathematical analysis of the existing method of sharding and provides a more simple, efficient and flexible alternative that does not require virtual shards. The proposed method is compared to the existing method by simulating the algorithms on multiple datasets and it is shown that the expected distribution is obtained.

关键词： Servers Databases Mathematical model Topology partitioning algorithms IEEE Regions Conferences

来源：评论

学校读者我要写书评

暂无评论

Spectral partitioning for Node Criticality 20

Spectral Partitioning for Node Criticality

引用

IEEE Symposium on Computers and Communication (ISCC)

作者： Asif, Waqar Lestas, Marios Qureshi, Hassaan Khaliq Rajarajan, Muttukrishnan City Univ London Sch Engn & Math Sci London England NUST Islamabad Pakistan Frederick Univ Dept Elect Engn Nicosia Cyprus

ISBN: (纸本)9781467371940

Finding critical nodes in a network is a significant task, highly relevant to network vulnerability and security. We consider the node criticality problem as an algebraic connectivity minimization problem where the objective is to choose nodes which minimize the algebraic connectivity of the resulting network. Previous suboptimal solutions of the problem suffer from the computational complexity associated with the implementation of a maximization consensus algorithm. In this work, we use spectral partitioning concepts introduced by Fiedler, to propose a new suboptimal solution which significantly reduces the implementation complexity. Our approach, combined with recently proposed distributed Fiedler vector calculation algorithms enable each node to decide by itself whether it is a critical node. If a single node is required then the maximization algorithm is applied on a restricted set of nodes within the network. We derive a lower bound for the achievable algebraic connectivity when nodes are removed from the network and we show through simulations that our approach leads to algebraic connectivity values close to this lower bound. Similar behaviour is exhibited by other approaches at the expense, however, of a higher implementation complexity.

关键词： Complexity theory Computers Eigenvalues and eigenfunctions Electronic mail Laplace equations Measurement partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Adaptive State Space partitioning of Markov Decision Processes for Elastic Resource Management 33

Adaptive State Space Partitioning of Markov Decision Process...

引用

IEEE 33rd International Conference on Data Engineering (ICDE)

作者： Lolos, Konstantinos Konstantinou, Ioannis Kantere, Verena Koziris, Nectarios Natl Tech Univ Athens Sch Elect & Comp Engn Athens Greece

ISBN: (纸本)9781509065431

Modern large-scale computing deployments consist of complex applications running over machine clusters. An important issue there is the offering of elasticity, i.e., the dynamic allocation of resources to applications to meet fluctuating workload demands. Threshold based approaches are typically employed, yet they are difficult to configure and optimize. Approaches based on reinforcement learning have been proposed, but they require a large number of states in order to model complex application behavior. Methods that adaptively partition the state space have been proposed, but their partitioning criteria and strategies are sub-optimal. In this work we present MDP DT, a novel full-model based reinforcement learning algorithm for elastic resource management that employs adaptive state space partitioning. We propose two novel statistical criteria and three strategies and we experimentally prove that they correctly decide both where and when to partition, outperforming existing approaches. We experimentally evaluate MDP DT in a real large scale cluster over variable not-encountered workloads and we show that it takes more informed decisions compared to static and model-free approaches, while requiring a minimal amount of training data.

关键词： partitioning algorithms Heuristic algorithms Resource management Adaptation models Clustering algorithms Markov processes Learning (artificial intelligence)

来源：评论

学校读者我要写书评

暂无评论

A metaheuristic approach for application partitioning in Mobile System

A metaheuristic approach for application partitioning in Mob...

引用

Networking Systems and Security NSysS International Conference

作者： Ferdous, S. M. Rahman, M. Sohel AUST Dept CSE Dhaka 1208 Bangladesh BUET Dept CSE Dhaka 1000 Bangladesh Kings Coll London Dept Informat London WC2R 2LS England

ISBN: (纸本)9781479981267

Mobile devices such as smartphones are extremely popular now. In spite of their huge popularity, the computational ability of mobile devices is still low. Computational offloading is a way to transfer some of the heavy computational tasks to server(cloud) so that the efficiency and usability of the system increases. In this paper, we have developed a metaheuristic approach for application partitioning to maximize throughput and performance. Preliminary experiment suggest that our approach is better than the traditional all cloud and all mobile approach.

关键词： cloud computing mobile computing optimisation smart phones application partitioning computational offloading computational tasks transfer metaheuristic approach mobile devices mobile system performance maximization smartphones throughput maximization Computers Mobile communication Mobile computing Mobile handsets partitioning algorithms Servers Throughput

来源：评论

学校读者我要写书评

暂无评论

Accelerating space traversal methods for explicit model predictive control via space partitioning trees 13

Accelerating space traversal methods for explicit model pred...

引用

13th European Control Conference (ECC)

作者： Jafargholi, Mahmoud Peyrl, Helfried Zanarini, Alessandro Herceg, Martin Mariethoz, Sebastien ABB Corp Res Baden Daettwil Switzerland ETHZ Automat Control Lab Zurich Switzerland

ISBN: (纸本)9783952426913

The paper elaborates an approach for acceleration of space traversal methods for solving a point location problem involved in the evaluation of explicit model predictive control laws. The idea is to improve the initialisation of the space traversal algorithms by providing initial estimates that restrict the search over a fraction of the original space. The reduction of the search space ensures that the space traversal algorithms can find the solution significantly faster as if sought over the full space. The proposed approach comprises two algorithms. The first algorithm generates an orthogonal partition of the search space off-line which is represented by a quadtree. In the second algorithm, the quadtree is traversed on-line and a particular space traversal method is initialised. The paper provides complexity analysis of both algorithms in the runtime and storage requirements. The approach is tested numerically on multiple examples and achieves significant reduction of iterations in the space traversal methods.

关键词： Acceleration Aerospace electronics Complexity theory Indexes Legged locomotion Memory management partitioning algorithms avionics partitioning algorithms acceleration Biped locomotion Store management Complexity theory quaternary tree Model predictive control Predictive control distributed model predictive control nonlinear model predictive control

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 38 39 40 41 42 43 44 45 46 47 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：