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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,492 篇 会议
1,253 篇 期刊文献
2 篇 资讯
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

3,640 篇 工学
- 1,932 篇 计算机科学与技术...
- 1,703 篇 电气工程
- 704 篇 信息与通信工程
- 555 篇 控制科学与工程
- 540 篇 软件工程
- 286 篇 机械工程
- 232 篇 仪器科学与技术
- 232 篇 电子科学与技术（可...
- 46 篇 测绘科学与技术
- 38 篇 交通运输工程
- 30 篇 网络空间安全
- 19 篇 航空宇航科学与技...
- 16 篇 材料科学与工程（可...
- 16 篇 生物医学工程（可授...
- 15 篇 矿业工程
- 13 篇 土木工程
- 12 篇 石油与天然气工程
- 9 篇 动力工程及工程热...
371 篇 管理学
- 368 篇 管理科学与工程(可...
308 篇 理学
- 131 篇 系统科学
- 72 篇 数学
- 54 篇 物理学
- 28 篇 生物学
- 25 篇 地球物理学
- 12 篇 统计学（可授理学、...
82 篇 医学
- 75 篇 临床医学
59 篇 文学
- 59 篇 新闻传播学
21 篇 艺术学
- 21 篇 设计学（可授艺术学...
16 篇 农学
14 篇 军事学
- 14 篇 军队指挥学
10 篇 教育学
- 9 篇 教育学
2 篇 经济学
2 篇 法学

主题

15,748 篇 partitioning alg...
4,690 篇 clustering algor...
3,074 篇 algorithm design...
1,672 篇 computer science
1,286 篇 heuristic algori...
1,133 篇 data mining
892 篇 computational mo...
746 篇 hardware
738 篇 optimization
736 篇 costs
722 篇 image segmentati...
657 篇 iterative algori...
591 篇 parallel process...
576 篇 approximation al...
575 篇 testing
559 篇 routing
505 篇 computer archite...
473 篇 concurrent compu...
459 篇 very large scale...
440 篇 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...
17 篇 department of co...
17 篇 school of electr...
17 篇 at and t bell la...
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...
15 篇 school of electr...

作者

25 篇 xianlong hong
19 篇 hichem frigui
15 篇 yici cai
14 篇 sanghamitra band...
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,610 篇 英文
105 篇 其他
32 篇 中文

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

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

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

详细简洁

排序：

Modular construction of model partitioning processes for parallel logic simulation

Modular construction of model partitioning processes for par...

引用

30th International Conference on Parallel Processing (ICPP Workshops)

作者： Hering, K Rünger, G Trautmann, S Tech Univ Chemnitz Fak Informat Chemnitz Germany

ISBN: (纸本)0769512607

Logic simulation of a complex processor model in VLSI design is very time consuming. One possibility to increase the simulation speed is to partition the processor model and assign the resulting parts to simulator instances that cooperate over a loosely-coupled system. For corresponding model partitioning processes, we have developed a distributed framework parallelMAP implementing a hierarchical partitioning strategy. It is intended to be used as production environment in VLSI design as well as an experimental test bed for algorithm development. In this paper we describe the possibilities parallelMAP offers for the modular construction of partitioning processes starting from a set of basic sequential and parallel modules. Experimental experiences are given with respect to IBM processor models comprising from 1.5 * 10(5) to 2.5 * 10(6) elements at gate level.

关键词： Boolean functions Circuit simulation Data structures Hardware Iterative algorithms Logic design Modular construction partitioning algorithms Production Very large scale integration

来源：评论

学校读者我要写书评

暂无评论

Automatic Quality of Service Control in Multi-core Systems using Cache partitioning 26

Automatic Quality of Service Control in Multi-core Systems u...

引用

26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)

作者： Danielsson, Jakob Seceleanu, Tiberiu Jagemar, Marcus Behnam, Moris Sjodin, Mikael Malardalen Univ Vasteras Sweden Ericsson AB Stockholm Sweden

ISBN: (纸本)9781728129891

In this paper, we present a last-level cache partitioning controller for multi-core systems. Our objective is to control the Quality of Service (QoS) of applications in multi-core systems by monitoring run-time performance and continuously re-sizing cache partition sizes according to the applications' needs. We discuss two different use-cases;one that promotes application fairness and another one that prioritizes applications according to the system engineers' desired execution behavior. We display the performance drawbacks of maintaining a fair schedule for all system tasks and its performance implications for system applications. We, therefore, implement a second control algorithm that enforces cache partition assignments according to user-defined priorities rather than system fairness. Our experiments reveal that it is possible, with non-instrusive (0.3-0.7% CPU utilization) cache controlling measures, to increase performance according to setpoints and maintain the QoS for specific applications in an over-saturated system.

关键词： Schedules Conferences Quality of service Control systems partitioning algorithms Task analysis Monitoring

来源：评论

学校读者我要写书评

暂无评论

Exact and Heuristic Solutions to the Connected k-partitioning Problem 7

Exact and Heuristic Solutions to the Connected k-Partitionin...

引用

7th International Conference on Control, Decision and Information Technologies (CoDIT)

作者： Healy, Patrick Laroche, Pierre Marchetti, Franc Martin, Sebastien Roka, Zsuzsanna Univ Limerick Limerick Ireland Univ Lorraine Lab Concept Optimisat & Modelisat Syst LCOMS EA 7306 F-57000 Metz France

ISBN: (纸本)9781728159539

We study the problem of partitioning a graph into k connected components, which may also be referred to as the maximum k-cutset problem. Firstly, we present an exact algorithm and a variant, both implemented as integer linear programming (ILP) models. We then present a heuristic approach that will be seen to be extremely competitive with the exact algorithm for the ranges of graph under consideration.

关键词： Approximation algorithms Vegetation partitioning algorithms Forestry Linear programming Information technology Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

partitioning Breaks Communities

Partitioning Breaks Communities

引用

International Conference on Advances in Social Networks Analysis and Mining (ASONAM)

作者： Reid, Fergal McDaid, Aaron Hurley, Neil Univ Coll Dublin Clique Res Cluster Dublin 4 Ireland

ISBN: (纸本)9780769543758

Considering a clique as a conservative definition of community structure, we examine how graph partitioning algorithms interact with cliques. Many popular community-finding algorithms partition the entire graph into non-overlapping communities. We show that on a wide range of empirical networks, from different domains, significant numbers of cliques are split across separate partitions, as produced by such algorithms. We examine the largest connected component of the subgraph formed by retaining only edges in cliques, and apply partitioning strategies that explicitly minimise the number of cliques split. We conclude that, due to the connectedness of many networks, any community finding algorithm that produces partitions must fail to find at least some significant structures. Moreover, contrary to traditional intuition, in some empirical networks, strong ties and cliques frequently do cross community boundaries.

关键词： Algorithm design and analysis Benchmark Bridges Clique Communities Community Finding Algorithm Complex networks Facebook Graph Hypergraph Network Partition partitioning algorithms Social Network Structure clique split community finding algorithm graph partitioning algorithm graph theory network theory (graphs) nonoverlapping community subgraph component

来源：评论

学校读者我要写书评

暂无评论

A new hyper-graph partitioning for 3D-FPGA 14

A new hyper-graph partitioning for 3D-FPGA

引用

14th IEEE International Conference on Solid-State and Integrated Circuit Technology (ICSICT)

作者： Hu, Li-Ran Duan, Qing-hua Qi, Zhu-jun Wang, Jian Lai, Jin-Mei Yang, Meng Fudan Univ State Key Lab ASIC & Syst Shanghai 201203 Peoples R China Chengdu Sino Microelect Technol Co Ltd Chengdu Sichuan Peoples R China

ISBN: (纸本)9781538644416

In this paper, we present a new hyper-graph partitioning algorithm (MKHP) for 3D-FPGA circuits. Our scheme which based on multilevel paradigm has three phases. In coarsening phase, we use hyper-edge first coarsening scheme (HFC) to obtain a coarser hyper-graph;In initial partitioning phase, we use multilevel recursive bisection to obtain a high-quality k-way initial partitions;Then in uncoarsening phase, a partitioning of the coarser hyper-graph is successively projected to the next-level finer hyper-graph, and a boundary greedy refinement algorithm is used to reduce the hyper-edge cut. Our experiments show that our multilevel k-way partitioning algorithm produced partitions are 8.9% better than those produced by HMETIS which was the most famous hyper-graph partitioning algorithm.

关键词： partitioning algorithms Hybrid fiber coaxial cables Optimization Frequency modulation Clustering algorithms Heuristic algorithms Software algorithms

来源：评论

学校读者我要写书评

暂无评论

Thanos: High-Performance CPU-GPU Based Balanced Graph partitioning Using Cross-Decomposition 20

Thanos: High-Performance CPU-GPU Based Balanced Graph Partit...

引用

25th Asia and South Pacific Design Automation Conference (ASP-DAC)

作者： Kim, Dae Hee Nagi, Rakesh Chen, Deming Univ Illinois Champaign IL 61820 USA

ISBN: (数字)9781728141237

ISBN: (纸本)9781728141237

As graphs become larger and more complex, it is becoming nearly impossible to process them without graph partitioning. Graph partitioning creates many subgraphs which can be processed in parallel thus delivering high-speed computation results. However, graph partitioning is a difficult task. In this work, we introduce Thanos, a fast graph partitioning tool which uses the cross-decomposition algorithm that iteratively partitions a graph. It also produces balanced loads of partitions. The algorithm is well suited for parallel GPU programming which leads to fast and high-quality graph partitioning solutions. Experimental results show that we have achieved 30x speedup and 35% better edge cut reduction compared to the CPU version of the popular graph partitioner, METIS, on average.

关键词： Graphics processing units Tools Programming Parallel processing partitioning algorithms Task analysis Optimization

来源：评论

学校读者我要写书评

暂无评论

KIPPI: KInetic Polygonal partitioning of Images 31

KIPPI: KInetic Polygonal Partitioning of Images

引用

31st IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Bauchet, Jean-Philippe Lafarge, Florent Univ Cote Azur INRIA Nice France

ISBN: (纸本)9781538664209

Recent works showed that floating polygons can be an interesting alternative to traditional superpixels, especially for analyzing scenes with strong geometric signatures, as man-made environments. Existing algorithms produce homogeneously-sized polygons that fail to capture thin geometric structures and over-partition large uniform areas. We propose a kinetic approach that brings more flexibility on polygon shape and size. The key idea consists in progressively extending pre-detected line-segments until they meet each other. Our experiments demonstrate that output partitions both contain less polygons and better capture geometric structures than those delivered by existing methods. We also show the applicative potential of the method when used as preprocessing in object contouring.

关键词： Kinetic theory Shape partitioning algorithms Complexity theory Image segmentation Buildings Standards

来源：评论

学校读者我要写书评

暂无评论

partitioning Algorithm for a Resource-Constrained Robotic Skin Sensor Network 4

Partitioning Algorithm for a Resource-Constrained Robotic Sk...

引用

4th IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)

作者： Vilgelm, Mikhail Neamtu, Gabriel Mittendorfer, Philipp Cheng, Gordon Kellerer, Wolfgang Tech Univ Munich Chair Commun Networks Munich Germany Tech Univ Munich Inst Cognit Syst Munich Germany

ISBN: (纸本)9781509019250

Sensor applications in robotics, such as artificial robotic skin, feature the shrinking size of nodes, and increasing scale of sensor networks. Together with a requirement for low complexity hardware for individual nodes, this leads to network optimization challenges. In this paper, we introduce a heuristic-based network partitioning algorithm for routing in a wired robotic skin sensor network, which aims at minimizing end-to-end latency and decreasing packet loss. Our algorithm is partitioning the network in sub-trees while balancing load on the root node connections. We benchmark its load balancing and evaluate its end-to-end latency and packet drops via simulation. The evaluation results show the superiority of our algorithm with respect to the state-of-the-art solutions.

关键词： Robot sensing systems Delays Skin partitioning algorithms Routing

来源：评论

学校读者我要写书评

暂无评论

TSV Placement and Core Mapping for 3D Mesh Based Network-on-Chip Design Using Extended Kernighan-Lin partitioning

TSV Placement and Core Mapping for 3D Mesh Based Network-on-...

引用

IEEE-Computer-Society Annual Symposium on VLSI (ISVLSI)

作者： Manna, Kanchan Teja, Vadapalli Shanmukha Sri Chattopadhyay, Santanu Sengupta, Indranil Indian Inst Technol Sch Informat Technol Kharagpur 721302 W Bengal India Indian Inst Technol Dept Elect & Elect Commun Engn Kharagpur 721302 W Bengal India Indian Inst Technol Dept Comp Sci Kharagpur 721302 W Bengal India

ISBN: (纸本)9781479987191

Three-dimensional (3D) Network-on-Chip (NoC) based designs can utilize communication in vertical dimension to reduce distance between cores. Vertical connections are best implemented using Through-Silicon-Via (TSV). However, TSV geometry restricts the number of 3D routers in any layer of the die. This work proposes a strategy to select the TSV positions. This has been augmented by developing a core mapping procedure based on the Kernighan-Lin graph bi-partitioning algorithm, improved via an iterative improvement phase. The overall approach shows promising results compared to the existing mapping and TSV placement algorithms.

关键词： graph theory integrated circuit design iterative methods network-on-chip three-dimensional integrated circuits 3D mesh based NoC TSV placement core mapping extended Kernighan-Lin partitioning graph bi-partitioning algorithm iterative improvement phase network-on-chip design through-silicon-via vertical connections Algorithm design and analysis Benchmark testing partitioning algorithms Routing Three-dimensional displays Through-silicon vias Topology 3D-NoC Application mapping KL algorithm Network-on-Chip Through-silicon vias network-on-chip three-dimensional displays Algorithm design and analysis three-dimensional integrated circuits Benchmark testing partitioning algorithms Taura syndrome virus of marine penaeid shrimp integrated circuit design iterative methods Graph theory Network routing topology

来源：评论

学校读者我要写书评

暂无评论

Relocating Local Outliers Produced by partitioning Methods 2019

Relocating Local Outliers Produced by Partitioning Methods

引用

2nd International Conference on Computing and Big Data (ICCBD)

作者： Badiang, Rogelio O., Jr. Gerardo, Bobby D. Medina, Ruji P. Technol Inst Philippines 938 Aurora Blvd Quezon City Philippines West Visayas State Univ Luna St Iloilo Philippines

ISBN: (纸本)9781450372909

partitioning methods is one of the most known and most used data clustering methods. The cluster center, known as centroid or medoid, represents each cluster that these methods produced. When the cluster center cannot describe all the data in the group, the undescribed data are mistakenly classified to their nearest cluster. These data are considered as local outliers. With this, the study seeks to address the problem of local outliers produced by partitioning methods specifically k-means and k-medoids. The Local Outlier Rectifier (LOR) is a proposed method used to relocate local outliers to its appropriate clusters. The results of the simulation show that several outliers are successfully transferred and the accuracy of the clustering performance increases.

关键词： partitioning algorithms partitioning methods k-means k-medoids outlier detection local outlier Mahalanobis distance

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：