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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Big-Data-Driven Network partitioning for Ultra-Dense Radio Access Networks

Big-Data-Driven Network Partitioning for Ultra-Dense Radio A...

引用

IEEE International Conference on Communications (ICC) / Wireless Communications Symposium / 3rd Workshop on Optical Wireless Communications (OWC)

作者： Huang, Siqi Han, Tao Ansari, Nirwan Univ North Carolina Charlotte Dept Elect & Comp Engn Charlotte NC 28223 USA New Jersey Inst Technol Dept Elect & Comp Engn Newark NJ 07102 USA

ISBN: (纸本)9781467389990

The increased density of base stations (BSs) may significantly add complexity to network management mechanisms and hamper them from efficiently managing the network. In this paper, we propose a big-data-driven network partitioning and optimization framework to reduce the complexity of the networking mechanisms. The proposed framework divides the entire radio access network (RAN) into multiple sub-RANs and each sub-RAN can be managed independently. Therefore, the complexity of the network management can be reduced. Quantifying the relationships among BSs is challenging in the network partitioning. We propose to extract three networking features from mobile traffic data to discover the relationships. Based on these features, we engineer the network partitioning solution in three steps. First, we design a hierarchical clustering analysis (HCA) algorithm to divide the entire RAN into sub-RANs. Second, we implement a traffic load balancing algorithm to characterize the performance of the network partitioning. Third, we adapt the weights of networking features in the HCA algorithm to optimize the network partitioning. We validate the proposed solution through simulations designed based on real mobile network traffic data. The simulation results reveal the impacts of the RAN partitioning on the networking performance and the computational complexity of the networking mechanism.

关键词： Mobile communication Mobile computing Feature extraction Market research partitioning algorithms Load management 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

来源：评论

学校读者我要写书评

暂无评论

Efficient Coefficient partitioning for Decomposed DA-based Inner-Product Computation

Efficient Coefficient Partitioning for Decomposed DA-based I...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Pan, Yu Meher, Pramod Kumar Inst Infocomm Res Singapore 138632 Singapore

ISBN: (纸本)9781424494743

The Look-Up-Table (LUT) size grows exponentially with increasing number of coefficients in a straight forward implementation of memory based Distributed Arithmetic (DA) computation. To avoid exponential blow-up, the common practice breaks the entire set of coefficients into multiple groups, each represented by a much smaller LUT, and forms the result by summing up the outputs from these LUTs. A detailed inspection shows that the overall word-size of the LUTs could be minimized by proper reordering and grouping of the coefficients, thus reduces the total memory usage of the LUTs. A fast heuristic partitioning algorithm for this purpose is devised and analyzed in this paper, showing up to 16% resource reduction compared to in-order grouping. The proposed technique can be applied orthogonally to offset binary coded (OBC) LUTs for resource efficient DA implementation as well.

关键词： Field programmable gate arrays Finite impulse response filter Heuristic algorithms partitioning algorithms Random access memory Read only memory Table lookup

来源：评论

学校读者我要写书评

暂无评论

Efficient Intra Transform Unit partitioning for High Efficiency Video Coding 4

Efficient Intra Transform Unit Partitioning for High Efficie...

引用

IEEE International Conference on Consumer Electronics - Taiwan (ICCE-TW)

作者： Chen, Zong-Yi Jiang, Hui-Yu Chang, Pao-Chi National Central University Taiwan

ISBN: (纸本)9781509040179

This paper proposes an efficient method for accelerating Transform Unit (TU) depth decisions based on the rough mode cost (RMC), which is the simplified rate-distortion (RD) cost during the rough mode decision (RMD), in HEVC intra coding. The TU partition of the mode with the minimal RMC is used to determine the TU partitions of remaining intra modes. The proposed TU partitioning method improves RD performance as well as reduces the encoding time;it demonstrates greater performance than the default method in reference software.

关键词： Encoding High efficiency video coding partitioning algorithms Software Testing Transforms Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

partitioning ocean flow field for underwater vehicle path planning

Partitioning ocean flow field for underwater vehicle path pl...

引用

OCEANS - Marseille Conference

作者： Hou, Mengxue Zhai, Haoyan Zhou, Homin Zhang, Fumin Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA Georgia Inst Technol Sch Math Atlanta GA 30332 USA

ISBN: (纸本)9781728114507

In this paper, we present a flow field partition method that extracts the key features, which are the spatial and temporal variation of the flow field. The partition method is developed based on K-means algorithm. In the case where the temporal pattern of the flow field contains only a periodic tidal component, we propose an algorithm that partitions the flow field into static clusters of piece-wise constant flow, by performing K-means clustering over the time-averaged flow field. Then the method is extended to partitioning the flow field into clusters of uniform time-varying flow, by fitting the spatially averaged flow in each static partitioned region to a parametric flow model. Simulation results of partitioning both a simulated jet flow field, as well as the ocean surface flow data into time-invariant and time-varying uniform flow are presented to demonstrate that the proposed method can represent the true flow field with significantly less amount of data. Result of using Method of Evolving Junctions to plan the time-optimal path in the partitioned flow field is also presented to demonstrate that the proposed flow partitioning method can be applied to facilitate path planning, and can reduce the path planning computational cost.

关键词： Path planning Junctions Oceans Aerodynamics Clustering algorithms partitioning algorithms Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Breaking the walls: Scene partitioning and portal creation 11

Breaking the walls: Scene partitioning and portal creation

引用

11th Pacific Conference on Computer Graphics and Applications

作者： Lerner, A Chrysanthou, Y Cohen-Or, D Tel Aviv Univ IL-69978 Tel Aviv Israel

ISBN: (纸本)0769520286

In this paper we revisit the cells-and-portals visibility methods, originally developed for the special case of architectural interiors. We define an effectiveness measure for a cells-and-portals partition, and introduce a two-pass algorithm that computes a cells-and-portals partition. The algorithm uses a simple heuristic that creates short portals as a mean for generating an effective partition. The input to the algorithm is a set of half edges in 2D, that can be extracted from a complex polygonal model. The first pass of the algorithm creates an initial partition, which is then refined by the second pass. We show that our method creates a partition that is more effective than the common BSP partition, even when the latter is further refined with the application of our second pass. Our cells-and-portals algorithm is designed to deal with arbitrarily oriented walls. The algorithm also supports outdoor scenes, where the vertical walls of the buildings serve as occluders and portals are extended above the buildings. We show that the extended portals allow an output-sensitive rendering of large urban scenes. Finally, since our two-pass method is fully, automatic and local, it supports incremental changes of the model by locally recomputing and updating the partition. We call our method "Breaking the Walls" (BW) since it breaks out of indoor scenes to outdoor scenes, and allows walls to be broken interactively, with an instant updating of the partition.

关键词： Algorithm design and analysis Buildings Design methodology Geometry Layout partitioning algorithms Portals Solid modeling Testing Toy industry

来源：评论

学校读者我要写书评

暂无评论

partitioning attacks: Or how to rapidly clone some GSM cards

Partitioning attacks: Or how to rapidly clone some GSM cards

引用

2002 IEEE Symposium on Security and Privacy

作者： Rao, JR Rohatgi, P Scherzer, H Tinguely, S IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA

ISBN: (纸本)0769515436

In this paper, we introduce a new class of side-channel attacks called partitioning attacks. We have successfully launched a version of the attack on several implementations of COMP128, the popular GSM authentication algorithm that has been deployed by different service providers in several types of SIM cards, to retrieve the 128 bit key using as few as 8 chosen plaintexts. We show how partitioning attacks can be used effectively to attack implementations that have been equipped with ad hoc and inadequate countermeasures against side-channel attacks. Such ad hoc countermeasures are systemic in implementations of cryptographic algorithms, such as COMP128, which require the use of large tables since there has been a mistaken belief that sound countermeasures require more resources than are available. To address this problem, we describe a new resource-efficient countermeasure for protecting table lookups in cryptographic implementations and justify its correctness rigorously.

关键词： Authentication Cloning Cryptographic protocols Cryptography GSM partitioning algorithms Protection Resists Security Table lookup

来源：评论

学校读者我要写书评

暂无评论

A parallel evolutionary algorithm for circuit partitioning 11

A parallel evolutionary algorithm for circuit partitioning

引用

11th Euromicro Conference on Parallel, Distributed and Network-Based Processing

作者： Baños, R Gil, C Montoya, MG Ortega, J Univ Almeria Dept Arquitectura Computadores & Elect Almeria Spain

ISBN: (纸本)0769518753

,As general-purpose parallel computers are increasingly being used to speed up different VLSI applications, the development of parallel algorithm for circuit testing, logic minimization and simulation, HDL-based synthesis, etc. is currently a field of increasing research activity. In some of these applications the circuit partitioning problem occurs. That implies dividing a circuit into non-overlapping subcircuits while minimizing the number of cuts after the division and balancing the load associated to each one. Very effective heuristic algorithms have been developed in order to solve this problem, but it is unknown how good the partitions are since the problem is NP-complete. In these cases the use of parallel processing can be very useful. This paper describes a parallel evolutionary algorithm for circuit partitioning, where parallelism improves the solutions found by the corresponding sequential algorithm, which indeed is quite effective compared with other previously proposed procedures.

关键词： Application software Circuit testing Concurrent computing Evolutionary computation Logic circuits Logic testing Parallel algorithms Parallel processing partitioning algorithms Very large scale integration

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：