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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

15,723 篇 partitioning alg...
4,681 篇 clustering algor...
3,075 篇 algorithm design...
1,672 篇 computer science
1,281 篇 heuristic algori...
1,133 篇 data mining
889 篇 computational mo...
744 篇 hardware
735 篇 costs
734 篇 optimization
722 篇 image segmentati...
657 篇 iterative algori...
591 篇 parallel process...
575 篇 approximation al...
573 篇 testing
559 篇 routing
504 篇 computer archite...
474 篇 concurrent compu...
459 篇 very large scale...
440 篇 application soft...

机构

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,585 篇 英文
106 篇 其他
32 篇 中文

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

共 15723 条记录，以下是361-370 订阅

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

详细简洁

排序：

Recursive bi-partitioning of netlists for large number of partitions

Recursive bi-partitioning of netlists for large number of pa...

引用

Joint Meeting of the 28th EUROMICRO Conference/EUROMICRO Symposium on Digital System Design

作者： Drechsler, R Günther, W Eschbach, T Linhard, L Angst, G Univ Bremen Inst Comp Sci D-28359 Bremen Germany

ISBN: (纸本)0769517900;0769517919

In many application in VLSI CAD, a given netlist has to be partitioned into smaller sub-designs which can be handled much better. In this paper we present a new recursive bi-partitioning algorithm that is especially applicable, if a large number of final partitions, e.g. more than 1000, has to be computed. The algorithm consists of two steps. Based on recursive splits the problem is divided into several sub-problems, but with increasing recursion depth more run time is invested. By this an initial solution is determined very fast. The core of the method is a second step, where a very powerful greedy algorithm is applied to refine the partitions. Experimental results are given that compare the new approach to state-of-the-art tools. The experiments show that the new approach outperforms the standard techniques with respect to run time and quality. Furthermore, the memory usage is very low and is reduced in comparison to other methods by more than a factor of four.

关键词： Algorithm design and analysis Application software Computer science Design automation Design optimization Field programmable gate arrays Greedy algorithms partitioning algorithms Routing Very large scale integration

来源：评论

学校读者我要写书评

暂无评论

PAW: Data partitioning Meets Workload Variance 38

PAW: Data Partitioning Meets Workload Variance

引用

38th IEEE International Conference on Data Engineering (ICDE)

作者： Li, Zhe Yiu, Man Lung Chan, Tsz Nam Hong Kong Polytech Univ Dept Comp Hong Kong Peoples R China Hong Kong Baptist Univ Dept Comp Sci Hong Kong Peoples R China

ISBN: (数字)9781665408837

ISBN: (纸本)9781665408837

In distributed storage systems (e.g., HDFS, Amazon S3, Databricks), partitioning is applied on a dataset in order to enhance performance and availability. Recently, partitioning methods have been designed to optimize the query performance of partitions with respect to the historical query workload. Nevertheless, in practice, future query workloads may deviate from the historical query workload, thus deteriorating the performance of existing partitioning methods. To fill this research gap, we model the variance of future query workloads from the historical query workload, then exploit this characteristic to produce partitions that perform well for future query workloads. In addition, we explore the space of irregular shaped partition regions to further optimize the query performance. Experimental results on TPC-H and real datasets show that our proposal is up to 70x more efficient than the state-of-the-art method.

关键词： Costs Shape Conferences Data engineering Data models Space exploration partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

PMU Placement with Power Grid partitioning for Line Outage Detection 4

PMU Placement with Power Grid Partitioning for Line Outage D...

引用

4th International Conference on Smart and Sustainable Technologies (SpliTech)

作者： Alhalaseh, Rana Tokel, Halil Alper Chakraborty, Subhodeep Alirezaei, Gholamreza Mathar, Rudolf Rhein Westfal TH Aachen Inst Theoret Informat Technol D-52056 Aachen Germany

ISBN: (纸本)9789532900910

The detection of fault locations is an important functionality in power distribution systems. In our previous work [1], we have proposed a data-driven approach to identify the locations of a minimum number of phasor measurement units (PMUs) in a power system, such that a desired fault detection accuracy is achieved. The locations of the PMUs have been determined with a feature selection method based on mutual information (MI), whereas a decision tree (DTs) has been used as a classifier. The contribution in the present work is a partitioning method which enables the application of this data-driven sensor placement approach to larger power systems. We show how a power system graph can be virtually partitioned into several child grids to create sub-zones, and optimally place a PMU in each sub-zone. The originality lies in the partitioning of a power system graph without reconfiguring the grid topology or removing any lines. Therefore, the proposed method enables the exploitation of all potentially available data sources which carry useful information for fault detection, and leads to a reduction in the number of required PMUs.

关键词： Phasor measurement units Fault detection partitioning algorithms Fault location Feature extraction Power grids

来源：评论

学校读者我要写书评

暂无评论

Linewidth-tolerant Feed-forward Dual-stage CPE Algorithm Based on 64-QAM Constellation partitioning

Linewidth-tolerant Feed-forward Dual-stage CPE Algorithm Bas...

引用

European Conference on Optical Communication (ECOC)

作者： Bilal, S. M. Bosco, G. Lau, Alan Pak Tao Lu, C. Politecn Torino DET Corso Duca Abruzzi 24 Turin Italy Hong Kong Polytech Univ Photon Res Ctr Hong Kong Hong Kong Peoples R China

A detailed analysis of a novel low-complexity two-stage digital feed-forward carrier recovery algorithm for 64-QAM, based on the rotation of constellation points to remove phase modulation is presented. Its performanc... 详细信息

ISBN: (纸本)9781479930661

关键词： feedforward phase modulation quadrature amplitude modulation 64-QAM constellation partitioning linewidth-tolerant feed-forward dual-stage CPE algorithm novel low-complexity two-stage digital feed-forward carrier recovery algorithm Algorithm design and analysis Complexity theory Laser noise partitioning algorithms Phase estimation Phase modulation Phase noise

来源：评论

学校读者我要写书评

暂无评论

ZooFence: Principled Service partitioning and Application to the ZooKeeper Coordination Service 33

ZooFence: Principled Service Partitioning and Application to...

引用

IEEE 33rd International Symposium on Reliable Distributed Systems

作者： Halalai, Raluca Sutra, Pierre Riviere, Etienne Felber, Pascal Univ Neuchatel CH-2000 Neuchatel Switzerland

ISBN: (纸本)9781479955848

Cloud computing infrastructures leverage fault-tolerant and geographically distributed services in order to meet the requirements of modern applications. Each service deals with a large number of clients that compete for the resources it offers. When the load increases, the service needs to scale. In this paper, we investigate a scalability solution which consists in partitioning the service state. We formulate specific conditions under which a service is partitionable. Then, we present a general algorithm to build a dependable and consistent partitioned service. To assess the practicability of our approach, we implement and evaluate the ZooFence coordination service. ZooFence orchestrates several instances of ZooKeeper and presents the exact same API and semantics to its clients. It automatically splits the coordination service state among ZooKeeper instances while being transparent to the application. By reducing the convoy effect on operations and leveraging the workload locality, our approach allows proposing a coordination service with a greater scalability than with a single ZooKeeper instance. The evaluation of ZooFence assesses this claim for two benchmarks, a synthetic service of concurrent queues and the BookKeeper distributed logging engine.

关键词： Banking History Nominations and elections Parallel processing partitioning algorithms Semantics Synchronization coordination service state partitioning zookeeper partitioning algorithms Semantics Superelevation banking PARALLEL PROCESSING (COMPUTERS) semiotics customers Legal Services

来源：评论

学校读者我要写书评

暂无评论

On Grid partitioning in AC Optimal Power Flow 10

On Grid Partitioning in AC Optimal Power Flow

引用

10th IEEE PES Innovative Smart Grid Technologies Europe (ISGT-Europe) - Smart Grids - Key Enablers of a Green Power System

作者： Murray, Alexander Kyesswa, Michael Schmurr, Philipp Cakmak, Hueseyin Hagenmeyer, Veit Karlsruhe Inst Technol Karlsruhe Germany

ISBN: (纸本)9781728171005

The AC optimal power flow problem is known to be highly non-convex and scale very poorly with respect to the number of lines and buses. One possible solution is to subdivide and parallelize the problem through distributed optimization. However, the question of how to optimally partition a power grid for use in distributed optimization remains open in the literature. To this end, we compare the graph partitioners KaFFPa and METIS as well as two spectral clustering methods to the standard IEEE 9, 14, 30, 39, 57, 118, 300 bus models. The distributed algorithm ALADIN is used to solve the partitioned OPF problems. For larger grids, KaFFPa yields the best results on average.

关键词： Distributed algorithms partitioning algorithms Power grids Mathematical programming

来源：评论

学校读者我要写书评

暂无评论

A Novel Approach to Quantum Circuit partitioning

A Novel Approach to Quantum Circuit Partitioning

引用

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

作者： Clark, Joseph Thapliyal, Himanshu Humble, Travis S. Univ Tennessee Knoxville TN 37996 USA Oak Ridge Natl Lab Oak Ridge TN USA

ISBN: (数字)9781665466059

ISBN: (纸本)9781665466059

Quantum synthesis presents an effective method of circuit optimization, but scales exponentially with the number of qubits in the circuit. This problem can be addressed by partitioning the circuit into blocks with a limited number of qubits. Existing partitioning algorithms make large trade-offs to achieve either high speed or quality. We propose a method of circuit partitioning which is competitive with existing algorithms for both metrics. The proposed method is compared with two existing methods across common circuit architectures, matching an exhaustive solution in performance and a fast solution on time.

关键词： Measurement Circuit optimization Qubit Computer architecture Very large scale integration partitioning algorithms Quantum circuit

来源：评论

学校读者我要写书评

暂无评论

Relational Data partitioning using Evolutionary Game Theory 5

Relational Data Partitioning using Evolutionary Game Theory

引用

IEEE Symposium on Computational Intelligence and Data Mining (CIDM)

作者： Hall, Lawrence O. Chakeri, Alireza Univ S Florida Dept Comp Sci & Engn Tampa FL 33620 USA

ISBN: (纸本)9781479945184

This paper presents a new approach for relational data partitioning using the notion of dominant sets. A dominant set is a subset of data points satisfying the constraints of internal homogeneity and external in-homogeneity, i.e. a cluster. However, since any subset of a dominant set cannot be a dominant set itself, dominant sets tend to be compact sets. Hence, in this paper, we present a novel approach to enumerate well distributed clusters where the number of clusters need not be known. When the number of clusters is known, in order to search the solution space appropriately, after finding each dominant set, data points are partitioned into two disjoint subsets of data points using spectral graph image segmentation methods to enumerate the other well distributed dominant sets. For the latter case, we introduce a new hierarchical approach for relational data partitioning using a new class of evolutionary game theory dynamics called InImDynamics which is very fast and linear, in computational time, with the number of data points. In this regard, at each level of the proposed hierarchy, Dunn's index is used to find the appropriate number of clusters. Then the objects are partitioned based on the projected number of clusters using game theoretic relations. The same method is applied to each partition to extract its underlying structure. Although the resulting clusters exist in their equivalent partitions, they may not be clusters of the entire data. Hence, they are checked for being an actual cluster and if they are not, they are extended to an existing cluster of the data. The approach can also be used to assign unseen data to existing clusters, as well.

关键词： evolutionary computation game theory graph theory image segmentation pattern clustering set theory Dunn's index InImDynamics data cluster data point partitioning dominant sets evolutionary game theory dynamics external in-homogeneity hierarchical approach internal homogeneity object partitioning relational data partitioning spectral graph image segmentation methods Clustering algorithms Games Indexes Nash equilibrium partitioning algorithms Vectors Game theory partitioning algorithms Set Theory Clustering algorithms image segmentation evolutionary algorithm Data partitioning Nash equilibrium Graph theory Cluster Analysis Clusters

来源：评论

学校读者我要写书评

暂无评论

Optimal Online Balanced Graph partitioning 40

Optimal Online Balanced Graph Partitioning

引用

40th IEEE Conference on Computer Communications (IEEE INFOCOM)

作者： Pacut, Maciej Parham, Mahmoud Schmid, Stefan Univ Vienna Fac Comp Sci Vienna Austria

ISBN: (纸本)9780738112817

Distributed applications generate a significant amount of network traffic. By collocating frequently communicating nodes (e.g., virtual machines) on the same clusters (e.g., server or rack), we can reduce the network load and improve application performance. However, the communication pattern of different applications is often unknown a priori and may change over time, hence it needs to be learned in an online manner. This paper revisits the online balanced partitioning problem that asks for an algorithm that strikes an optimal tradeoff between the benefits of collocation (i.e., lower network load) and its costs (i.e., migrations). Our first contribution is a significantly improved deterministic lower bound of Omega(k . l) on the competitive ratio, where l is the number of clusters and k is the cluster size, even for a scenario in which the communication pattern is static and can be perfectly partitioned;we also provide an asymptotically tight upper bound of O (k . l) for this scenario. For k = 3, we contribute an asymptotically tight upper bound of Theta(l) for the general model in which the communication pattern can change arbitrarily over time. We improve the result for k = 2 by providing a strictly 6-competitive upper bound for the general model.

关键词： Upper bound Computational modeling Conferences Clustering algorithms Telecommunication traffic Virtual machining partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Improving the static analysis of loops by dynamic partitioning techniques 3

Improving the static analysis of loops by dynamic partitioni...

引用

3rd IEEE International Workshop on Source Code Analysis and Manipulation

作者： Martel, M CEA LIST DTSI SLA F-91191 Gif Sur Yvette France

ISBN: (纸本)0769520057

Many static analyses aim at assigning to each control point of a program an invariant property that characterizes any state of a trace corresponding to this point. The choice of the set of control points determines the states of an execution trace for which a common property must be found. In this article, we focus on sufficient conditions to substitute one control flow graph for another during an analysis. Next, we introduce a dynamic partitioning algorithm that improves the precision of the calculated invariants by deciding dynamically how to map the states of the traces to the control points, depending on the properties resulting from the first steps of the analysis. In particular this algorithm enables the loops to be unfolded only if this improves the precision of the final invariants. Its correctness stems from the fact that it uses legal graph substitutions.

关键词： Algorithm design and analysis Assembly Conferences Flow graphs Heuristic algorithms Law Legal factors Merging partitioning algorithms Sufficient conditions

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 33 34 35 36 37 38 39 40 41 42 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：