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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

partitioning of Large-Scale Systems using Game-Theoretic Coalitional Methods 16

Partitioning of Large-Scale Systems using Game-Theoretic Coa...

引用

European Control Conference (ECC)

作者： Muros, F. J. Maestre, J. M. Ocampo-Martinez, C. Algaba, E. Camacho, E. F. Univ Seville Dept Syst & Automat Engn Seville Spain UPC CSIC Inst Robot & Informat Ind Automat Control Dept Barcelona Spain Univ Seville Dept Appl Math 2 Seville Spain

ISBN: (纸本)9783952426982

In this paper, tools from cooperative game theory are combined with predictive control to perform the partitioning of large-scale systems (LSS). More specifically, a partitioning algorithm based on the Shapley value to rank the links by using a cooperative cost game is proposed. To this end, coalitional model predictive control, which offers a trade-off between control performance and communication burden, is considered to assess the value of the coalitions in the game. Also, combinatorial explosion issues are relieved by means of an attribution of value to the links based on the nodes they connect. The proposed method is implemented in the Barcelona drinking water network as a real LSS case study, showing the effectiveness of the proposed approach.

关键词： Games partitioning algorithms Large-scale systems Predictive control Optimization Clustering algorithms Europe

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Routing Algorithm Based on Network partitioning for 3D Network-on-Chip 6

An Adaptive Routing Algorithm Based on Network Partitioning ...

引用

6th IEEE International Conference on Computer, Information and Telecommunication Systems (IEEE CITS)

作者： Dai, Jindun Jiang, Xin Watanabe, Takahiro Waseda Univ Grad Sch Informat Prod & Syst Tokyo Japan

ISBN: (纸本)9781509059577

This paper presents an efficient routing algorithm for 3D meshes without virtual channels. The proposed routing algorithm is extended from 2D east-first routing algorithm and based on network partitioning. It is proven that the proposed method is free from deadlock. In comparison of previous routing algorithms, the average degree of adaptiveness is higher. This feature contributes to higher communication efficiency. Experimental results show that the proposed method can achieve lower communication latency and higher throughput over other traditional methods.

关键词： Routing System recovery Three-dimensional displays partitioning algorithms Two dimensional displays Algorithm design and analysis Adaptive systems

来源：评论

学校读者我要写书评

暂无评论

Task partitioning Strategies for Multicore Real-Time Energy Harvesting Systems 17

Task Partitioning Strategies for Multicore Real-Time Energy ...

引用

17th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing (ISORC)

作者： Abdallah, Nadine Queudet, Audrey Chetto, Maryline Univ Nantes IRCCyN UMR CNRS 6597 F-44321 Nantes France

ISBN: (纸本)9781479944309

In this paper, we propose task partitioning heuristics for multicore real-time energy harvesting systems. Both timing constraints and energy requirements are considered. Our objective is to determine a partitioning that guarantees absence of both energy starvation and deadline missing under Earliest Deadline First (EDF) scheduling. First, we describe the system model and formalize the assignment problem in real-time energy harvesting systems. Then, we describe and analyze the performance of partitioning heuristics for identical processors. We explore how the task sorting criteria and the energy constraints can favor the heuristics feasibility performance. Moreover, we estimate through simulation a sufficient energy reservoir capacity that guarantees the best performance.

关键词： Energy consumption Heuristic algorithms partitioning algorithms Processor scheduling Program processors Real-time systems Reservoirs energy harvesting multiprocessor real-time systems task partitioning real-time systems energy harvesting Program processors partitioning algorithms scheduling of multiprocessor Heuristic algorithms Multiprocessor reservoirs energy consumption Multi-core processors

来源：评论

学校读者我要写书评

暂无评论

Toward scaling network emulation using topology partitioning 11

Toward scaling network emulation using topology partitioning

引用

11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems (MASCOTS 2003)

作者： Yocum, K Eade, E Degesys, J Becker, D Chase, J Vahdat, A Duke Univ Dept Comp Sci Durham NC 27706 USA

ISBN: (纸本)0769520391

Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the network topology across processors, as a technique to increase emulation capacity with increasing hardware resources. We develop methods to create partitions based on expected communication across the topology. Our evaluation methodology quantifies the communication overhead or efficiency of the resulting partitions. We implement and contrast three partitioning strategies in ModelNet, a large-scale network emulator, using different topologies and uniform communication patterns. Results show that standard graph partitioning algorithms can double the efficiency of the emulation for Internet-like topologies relative to random partitioning.

关键词： Computational modeling Emulation Hardware Large-scale systems Network servers Network topology partitioning algorithms Peer to peer computing Traffic control Web server

来源：评论

学校读者我要写书评

暂无评论

partitioning Techniques for Fine-grained Indexing

Partitioning Techniques for Fine-grained Indexing

引用

IEEE 27th International Conference on Data Engineering (ICDE 2011)

作者： Wu, Eugene Madden, Samuel MIT CSAIL Cambridge MA 02139 USA

ISBN: (纸本)9781424489589

Many data-intensive websites use databases that grow much faster than the rate that users access the data. Such growing datasets lead to ever-increasing space and performance overheads for maintaining and accessing indexes. Furthermore, there is often considerable skew with popular users and recent data accessed much more frequently. These observations led us to design Shinobi, a system which uses horizontal partitioning as a mechanism for improving query performance to cluster the physical data, and increasing insert performance by only indexing data that is frequently accessed. We present database design algorithms that optimally partition tables, drop indexes from partitions that are infrequently queried, and maintain these partitions as workloads change. We show a 60x performance improvement over traditionally indexed tables using a real-world query workload derived from a traffic monitoring application

关键词： Data models Indexing Optimization partitioning algorithms Random access memory Shinobi system data cluster data-intensive Web sites database design algorithm database indexing fine-grained indexing horizontal partitioning mechanism insert performance partition tables pattern clustering query performance query processing query workload

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

Cost-efficient Spatial Network partitioning for Distance-based Query Processing 15

Cost-efficient Spatial Network Partitioning for Distance-bas...

引用

15th IEEE International Conference on Mobile Data Management (IEEE MDM)

作者： Wang, Jiping Zheng, Kai Jeung, Hoyoung Wang, Haozhou Zheng, Bolong Zhou, Xiaofang Univ Queensland Brisbane Qld 4072 Australia

ISBN: (纸本)9781479957057

The efficiency of spatial query processing is crucial for many applications such as location-based services. In spatial networks, queries like k-NN queries are all based on network distance evaluation. Classic solutions for these queries rely on network expansion and are not efficient enough for large networks. Some approaches have improved the query efficiency but brought considerable space cost for index. To address these problems, we propose a hierarchical graph partitioning based index named Partition Tree. It organizes the vertices of a spatial network into a hierarchy through a series of graph partitioning processes. Meanwhile precomputed distances are associated with this hierarchy to facilitate efficient query processing. Inspired by the observation that queries are usually invoked around objects of interest, we propose a query-oriented optimization on top of the Partition Tree. It uses a cost model to evaluate the influence of the object distribution and partitioning topology on the query efficiency. Then a cost-efficient graph partitioning method is developed based on this cost model. Experimental results on real datasets demonstrate that our proposed index and algorithms have superior performance over the state-of-the-art approaches and are scalable to large spatial networks.

关键词： Dynamic programming Heuristic algorithms Indexes Optimization partitioning algorithms Query processing Topology network partitioning query processing spatial network query analysis partitioning algorithms Heuristic algorithms topology dynamic programming partitions Social Hierarchy

来源：评论

学校读者我要写书评

暂无评论

Progressive Binary partitioning for Performance Improvement in Multivariate Density Estimation

Progressive Binary Partitioning for Performance Improvement ...

引用

IEEE International Symposium on Circuits and Systems (IEEE ISCAS)

作者： Majdara, Aref Nooshabadi, Saeid Michigan Technol Univ Dept Elect & Comp Engn Houghton MI 49931 USA

ISBN: (纸本)9781728103976

This paper presents an algorithm for efficient multivariate density estimation, using a blockized implementation of the Bayesian sequential partitioning algorithm. We also present a method for improving the performance of the blockized density estimation, by progressively updating the partitions. With progressive partitioning algorithm, each block uses the results from the previously processed blocks, and thus, as the simulation results show, it improves the performance of the blockized algorithm, both in terms of estimation accuracy and computation time.

关键词： partitioning algorithms Bayes methods Estimation error Probability density function Simulation Density functional theory

来源：评论

学校读者我要写书评

暂无评论

A new partitioning scheme of parallel VHDL simulation

A new partitioning scheme of parallel VHDL simulation

引用

8th IEEE CPMT Conference on High Density Microsystem Design and Packaging and Component Failure Analysis (HDP 06)

作者： Wu Yue Jian Ling Yang Hong-Bin Liu Zong-Tian Shanghai Univ Sch Comp Engn & Sci Shanghai 200072 Peoples R China

ISBN: (纸本)0780392922

The static partitioning algorithm and assigning were generally researched respectively, which has largely resulted in the deficiency in the workload balance of the static partitioning. A new partitioning scheme of parallel VHDL simulation is presented in the paper. partitioning and assigning both are processed just before the simulation in the scheme, and are included in the running phase. Because of this, it strictly requests that the time complexity of partitioning algorithm is minimum. A new static partitioning algorithm, fan-out right partitioning algorithm, which has a lower time complexity and good performance, is presented in the paper. The experiment result shows that the performance of parallel VHDL simulation is improved with this scheme and partitioning algorithm.

关键词： partitioning algorithms Circuit simulation Very large scale integration Algorithm design and analysis Computational modeling Computer simulation Concurrent computing Software algorithms Digital circuits Hardware design languages

来源：评论

学校读者我要写书评

暂无评论

A robust motion-estimation algorithm for multiple-target tracking at close proximity based on hexagonal partitioning

A robust motion-estimation algorithm for multiple-target tra...

引用

IEEE Conference on Advanced Video and Signal Based Surveillance

作者： Mabey, GW Gunther, J Utah State Univ Dept Elect & Comp Engn Logan UT 84322 USA

ISBN: (纸本)0769519717

This paper develops a solution to the task of tracking the position and movement of large (relative to pixel and image size) bodies through a visible-light camera's field of view. Noise sources such as dynamic backgrounds, vibration, variation in appearance, and rapidly changing lighting environments contribute to the complexity. Given that a low number of targets may be present at any one time and some assumptions about the dynamic nature of the image and targets, a solution to this problem is herein formulated which localizes and tracks objects in the field of view. The algorithm is capable of distinguishing between multiple targets which are in close proximity to the camera and to each other A major consideration in the development is that the implemented system should be able to process the data in real time with moderate computational power The present area of application is that of automatically generating ridership statistics for transit agencies;to count persons getting on or off a bus.

关键词： Cameras Detection algorithms Humans partitioning algorithms Robustness Statistics Surveillance Target tracking Vehicle detection Vehicle dynamics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：