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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

3,647 篇 工学
- 1,935 篇 计算机科学与技术...
- 1,710 篇 电气工程
- 706 篇 信息与通信工程
- 556 篇 控制科学与工程
- 540 篇 软件工程
- 286 篇 机械工程
- 233 篇 仪器科学与技术
- 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,755 篇 partitioning alg...
4,692 篇 clustering algor...
3,074 篇 algorithm design...
1,672 篇 computer science
1,286 篇 heuristic algori...
1,133 篇 data mining
892 篇 computational mo...
746 篇 hardware
743 篇 optimization
740 篇 costs
722 篇 image segmentati...
657 篇 iterative algori...
591 篇 parallel process...
578 篇 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,617 篇 英文
105 篇 其他
32 篇 中文

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

共 15755 条记录，以下是571-580 订阅

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

详细简洁

排序：

LLM-shark - A Tool for Automatic Resource-boundness Analysis and Cache partitioning Setup 45

LLM-shark - A Tool for Automatic Resource-boundness Analysis...

引用

45th Annual International IEEE-Computer-Society Computers, Software, and Applications Conference (COMPSAC)

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

ISBN: (纸本)9781665424639

We present LLM-shark, a tool for automatic hardware resource-boundness detection and cache-partitioning. Our tool has three primary objectives: First, it determines the hardware resource-boundness of a given application. Secondly, it estimates the initial cache partition size to ensure that the application performance is conserved and not affected by other processes competing for cache utilization. Thirdly, it continuously monitors that the application performance is maintained over time and, if necessary, change the cache partition size. We demonstrate LLM-shark's functionality through a series of tests using six different applications, including a set of feature detection algorithms and two synthetic applications. Our tests reveal that it is possible to determine an application's resource-boundness using a Pearson-correlation scheme implemented in LLM-shark. We propose a scheme to size cache partitions based on the correlation coefficient applications depending on their resource boundness.

关键词： Correlation coefficient Feature detection Conferences Tools Hardware Software partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

WSGP: A Window-based Streaming Graph partitioning Approach 21

WSGP: A Window-based Streaming Graph Partitioning Approach

引用

21st IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing (CCGrid)

作者： Li, Yunbo Li, Chuanyou Orgerie, Anne-Cecile Parvedy, Philippe Raipin Shanghai Pudong Dev Bank Shanghai Peoples R China Southeast Univ Nanjing Peoples R China Univ Rennes IRISA CNRS INRIA Rennes France Orange Labs Lannion France

ISBN: (纸本)9781728195865

Graph partitioning, a preliminary step of distributed graph processing, has been attracting increasing attention in the last decade. A high quality graph partitioning algorithm should facilitate graph processing by minimizing the communication overhead and maintaining the load balancing among distributed computing units. Offline partitioning algorithms usually require the knowledge of a complete graph,and therefore, are not adaptive to handle massive graph-structured data. On the contrary, streaming partitioning algorithms take edges or vertices as a stream and make partitioning decisions on the fly. However, the streaming manner faces dilemmas from time to time because of a lack of knowledge. Furthermore, an unmindful partitioning decision in such a dilemma could significantly decrease the partition quality. In this paper, we propose a novel window-based streaming graph partitioning algorithm (WSGP). WSGP leverages a greedy-based heuristic to perform edge partitioning. When facing a decision dilemma, WSGP utilizes a size-bounded window to buffer the edges. When the window is fully filled, an edge is poped and assigned to a partition. The assignment is decided by knowledge obtained from both the edges already settled and the ones still cached in the buffer window. Our experiments take into account various real-world benchmark graphs. The experimental results demonstrate that WSGP consistently has a smaller replication factor than the state-of-the-art algorithms by up to 23%, at a limited cost in terms of memory and comprehensive running time.

关键词： Cloud computing Clustering algorithms Benchmark testing Load management partitioning algorithms Faces

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Submodular Optimization Approach to Stable and Minimally Disruptive Controlled Islanding in Power Systems

A Submodular Optimization Approach to Stable and Minimally D...

引用

American Control Conference (ACC)

作者： Sahabandu, Dinuka Niu, Luyao Clark, Andrew Poovendran, Radha Univ Washington Dept Elect & Comp Engn Network Secur Lab Seattle WA 98195 USA Worcester Polytech Inst Dept Elect & Comp Engn Worcester MA 01609 USA

ISBN: (数字)9781665451963

ISBN: (纸本)9781665451963

Power systems must maintain dynamical stability while meeting user demand in the presence of major disturbances including failures of multiple generators and transmission lines. One approach to mitigating disturbances is controlled islanding, in which a subset of edges is deliberately removed in order to partition the network into disjoint, internally stable and self-sufficient islands. In this paper, we present a submodular optimization approach to controlled islanding. We prove that computing optimal islands under three standard metrics, namely, generator coherence, load-generation imbalance, and power flow disruption, is equivalent to minimizing a supermodular function with a matroid basis constraint. Based on this result, we present the first polynomial-time islanding algorithms with constant-factor optimality bounds with respect to the three aforementioned metrics. We test the proposed approach on IEEE 30-bus, 57-bus, and 118-bus power systems. We demonstrate that our proposed algorithm converges and present the islanding strategies when different combinations of the metrics are considered.

关键词： Measurement Islanding Power transmission lines Coherence Power system stability Generators partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Provenance-aware Discovery of Functional Dependencies on Integrated Views 38

Provenance-aware Discovery of Functional Dependencies on Int...

引用

38th IEEE International Conference on Data Engineering (ICDE)

作者： Comignani, Ugo Berti-Equille, Laure Novelli, Noel Bonifati, Angela INRIA Grenoble INP Tyrex Team Le Chesnay Rocquencourt France IRD ESPACE DEV Montpellier France Aix Marseille Univ LIS CNRS Marseille France Lyon 1 Univ Lyon France

ISBN: (纸本)9781665408837

The automatic discovery of functional dependencies (FDs) has been widely studied as one of the hardest problems in data profiling. Existing approaches have focused on making the FD computation efficient while inspecting single relations at a time. In this paper, for the first time we address the problem of inferring FDs for multiple relations as they occur in integrated views by solely using the functional dependencies of the base relations of the view itself. To this purpose, we leverage logical inference and selective mining and show that we can discover most of the exact FDs from the base relations and avoid the full computation of the FDs for the integrated view itself, while at the same time preserving the lineage of FDs of base relations. We propose algorithms to speedup the inferred FD discovery process and mine FDs on-the-fly only from necessary data partitions. We present InFine (INferred FunctIoNal dEpendency), an end-to-end solution to discover inferred FDs on integrated views by leveraging provenance information of base relations. Our experiments on a range of real-world and synthetic datasets demonstrate the benefits of our method over existing FD discovery methods that need to rerun the discovery process on the view from scratch and cannot exploit lineage information on the FDs. We show that InFine outperforms traditional methods necessitating the full integrated view computation by one to two order of magnitude in terms of runtime. It is also the most memory efficient method while preserving FD provenance information using mainly inference from base table with negligible execution time.

关键词： Runtime Conferences Memory management Data engineering Inference algorithms partitioning algorithms Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Placing Wireless Chargers with Multiple Antennas 19

Placing Wireless Chargers with Multiple Antennas

引用

19th Annual IEEE International Conference on Sensing, Communication, and Networking (IEEE SECON)

作者： Dai, Haipeng Zhao, Yue Wang, Weijun Gu, Rong Qu, Yuben Lin, Chi Xu, Lijie Dou, Wanchun Nanjing Univ State Key Lab Novel Software Technol Nanjing 210023 Jiangsu Peoples R China Univ Gottingen Inst Informat Gottingen Germany Nanjing Univ Aeronaut & Astronaut Key Lab Dynam Cognit Syst Elect Spectrum Space Minist Ind & Informat Technol Nanjing Peoples R China Dalian Univ Technol Sch Software Technol Key Lab Ubiquitous Network & Serv Software Liaoni Dalian 116621 Peoples R China Nanjing Univ Posts & Telecommun Jiangsu Key Lab Big Data Secur & Intelligent Proc Nanjing 210023 Jiangsu Peoples R China

ISBN: (数字)9781665486439

ISBN: (纸本)9781665486439

This paper studies the problem of Wireless ChArger PlacemeNt with Multiple (Directional) Antennas (WANDA). Given a set of wireless chargers wherein each charger is equipped with multiple directional antennas and a set of wireless rechargeable sensors, determining the chargers' positions and the antennas' orientations, such that the overall charging utility is maximized To address WANDA, we first present a piecewise constant function to approximate the nonlinear relationship between charging power and charging distance. Then, we propose an area discretization technique to reduce the infinite solution space to a limited one without performance loss. Next, we present approximation algorithms for both Relative Orientation Fixed (WANDA-ROF) and Relative Orientation Unfixed (WANDA-ROU) situations. For WANDA-ROF, we propose a Maximum Coverage Set extraction method that transforms WANDA-ROF into the problem of maximizing a monotone submodular function subject to a partition matroid constraint and then present a 1/2 - epsilon approximation algorithm. For WANDA-ROU, we construct a candidate position set for each charger to limit the searching space. Then, we propose a novel two-level submodular optimization scheme to address it, which achieves an approximation ratio of 1/6 - epsilon. Simulation and experimental results show that our algorithms outperform comparison algorithms by at least 22%.

关键词： Wireless communication Wireless sensor networks Directional antennas Transforms Directive antennas Approximation algorithms partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Learning ABCs: Approximate Bijective Correspondence for isolating factors of variation with weak supervision

Learning ABCs: Approximate Bijective Correspondence for isol...

引用

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

作者： Murphy, Kieran A. Jampani, Varun Ramalingam, Srikumar Makadia, Ameesh Univ Penn Philadelphia PA 19104 USA Google Res Mountain View CA USA Google AI Residency Program Mountain View CA USA

ISBN: (数字)9781665469463

ISBN: (纸本)9781665469463

Representational learning forms the backbone of most deep learning applications, and the value of a learned representation is intimately tied to its information content regarding different factors of variation. Finding good representations depends on the nature of supervision and the learning algorithm. We propose a novel algorithm that utilizes a weak form of supervision where the data is partitioned into sets according to certain inactive (common) factors of variation which are invariant across elements of each set. Our key insight is that by seeking correspondence between elements of different sets, we learn strong representations that exclude the inactive factors of variation and isolate the active factors that vary within all sets. As a consequence of focusing on the active factors, our method can leverage a mix of set-supervised and wholly unsupervised data, which can even belong to a different domain. We tackle the challenging problem of synthetic-to-real object pose transfer, without pose annotations on anything, by isolating pose information which generalizes to the category level and across the synthetic/real domain gap. The method can also boost performance in supervised settings, by strengthening intermediate representations, as well as operate in practically attainable scenarios with set-supervised natural images, where quantity is limited and nuisance factors of variation are more plentiful. Accompanying code may be found on github.

关键词： Deep learning Computer vision Codes Annotations Focusing partitioning algorithms Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Optimal Data Allocation for Graph Processing in Processing-in-Memory Systems 22

Optimal Data Allocation for Graph Processing in Processing-i...

引用

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

作者： Li, Zerun Chen, Xiaoming Han, Yinhe Chinese Acad Sci Inst Comp Technol Ctr Intelligent Comp Syst Beijing Peoples R China Univ Chinese Acad Sci Beijing Peoples R China

ISBN: (纸本)9781665421355

Graph processing involves lots of irregular memory accesses and increases demands on high memory bandwidth, making it difficult to execute efficiently on compute-centric architectures. Dedicated graph processing accelerators based on the processing-in-memory (PIM) technique have recently been proposed. Despite they achieved higher performance and energy efficiency than conventional architectures, the data allocation problem for communication minimization in PIM systems (e.g., hybrid memory cubes (HMCs)) has still not been well solved. In this paper, we demonstrate that the conventional "graph data allocation = graph partitioning" assumption is not true, and the memory access patterns of graph algorithms should also be taken into account when partitioning graph data for communication minimization. For this purpose, we classify graph algorithms into two representative classes from a memory access pattern point of view and propose different graph data partitioning strategies for them. We then propose two algorithms to optimize the partition-to-HMC mapping to minimize the inter-HMC communication. Evaluations have proved the superiority of our data allocation framework and the data movement energy efficiency is improved by 4.2-5x on average than the state-of-the-art GraphP approach.

关键词： Design automation Memory management Asia Bandwidth Minimization Energy efficiency partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Workload-Aware Shortest Path Distance Querying in Road Networks 38

Workload-Aware Shortest Path Distance Querying in Road Netwo...

引用

38th IEEE International Conference on Data Engineering (ICDE)

作者： Zheng, Bolong Wan, Jingyi Gao, Yongyong Ma, Yong Huang, Kai Zhou, Xiaofang Jensen, Christian S. Huazhong Univ Sci & Technol Wuhan Peoples R China Hong Kong Univ Sci & Technol Hong Kong Peoples R China Aalborg Univ Aalborg Denmark

ISBN: (数字)9781665408837

ISBN: (纸本)9781665408837

Computing shortest-path distances in road networks is core functionality in a range of applications. To enable the efficient computation of such distance queries, existing proposals frequently apply 2-hop labeling that constructs a label for each vertex and enables the computation of a query by performing only a linear scan of labels. However, few proposals take into account the spatio-temporal characteristics of query workloads. We observe that real-world workloads exhibit (1) spatial skew, meaning that only a small subset of vertices are queried frequently, and (2) temporal locality, meaning that adjacent time intervals have similar query distributions. We propose a Workload-aware CoreForest label index (WCF) to exploit spatial skew in workloads. In addition, we develop a Reinforcement Learning based Time Interval partitioning (RL-TIP) algorithm that exploits temporal locality to partition workloads to achieve further performance improvements. Extensive experiments with real-world data offer insights into the performance of the proposals, showing that they achieve 62% speedup on average for query processing with less preprocessing time and space overhead when compared with the state-of-the-art proposals.

关键词： Roads Query processing Reinforcement learning Data engineering Computational efficiency partitioning algorithms Proposals

来源：评论

学校读者我要写书评

暂无评论

Decentralized Learning With Limited Communications for Multi-robot Coverage of Unknown Spatial Fields

Decentralized Learning With Limited Communications for Multi...

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

作者： Nakamura, Kensuke Santos, Maria Leonard, Naomi Ehrich Princeton Univ Dept Mech & Aerosp Engn Princeton NJ 08544 USA

ISBN: (数字)9781665479271

ISBN: (纸本)9781665479271

This paper presents an algorithm for a team of mobile robots to simultaneously learn a spatial field over a domain and spatially distribute themselves to optimally cover it. Drawing from previous approaches that estimate the spatial field through a centralized Gaussian process, this work leverages the spatial structure of the coverage problem and presents a decentralized strategy where samples are aggregated locally by establishing communications through the boundaries of a Voronoi partition. We present an algorithm whereby each robot runs a local Gaussian process calculated from its own measurements and those provided by its Voronoi neighbors, which are incorporated into the individual robot's Gaussian process only if they provide sufficiently novel information. The performance of the algorithm is evaluated in simulation and compared with centralized approaches.

关键词： Estimation error Aggregates Gaussian processes partitioning algorithms Mobile robots Robots Monitoring

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 54 55 56 57 58 59 60 61 62 63 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：