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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Fast and Adaptive Pairwise Similarities for Graph Cuts-based Image Segmentation

Fast and Adaptive Pairwise Similarities for Graph Cuts-based...

引用

IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)

作者： B. Sumengen L. Bertelli B.S. Manjunath Ojos Inc. University of California Santa Barbara Santa Barbara CA USA

We introduce the use of geodesic distances and geodesic radius for calculating pairwise similarities needed in various graph cuts based methods. By using geodesics on an edge strength function we are able to calculate similarities between pixels in a more natural way. Our technique improves the speed and reliability of calculating similarities and leads to reasonably good image segmentation results. Our algorithm takes an edge strength function as its input and its speed is independent of the feature dimension or the distance measure used.

关键词： Image segmentation partitioning algorithms Pixel Cost function Joining processes Velocity measurement Gray-scale Focusing Computer vision Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

A Hierarchical Synchronous Parallel Model for Wide-Area Graph Analytics

A Hierarchical Synchronous Parallel Model for Wide-Area Grap...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Shuhao Liu Li Chen Baochun Li Aiden Carnegie Department of Electrical and Computer Engineering University of Toronto

ISBN: (纸本)9781538641293

Graph analytics has emerged as one of the fundamental techniques to support modern Internet applications. As real-world graph data is generated and stored globally, the scale of the graph that needs to be processed keeps growing. It is critical to efficiently process graphs across multiple geographically distributed datacenters, running wide-area graph analytics. Existing graph analytics frameworks are not designed to run across multiple datacenters well, as they implement a Bulk Synchronous Parallel model that requires excessive wide-area data transfers. In this paper, we present a new Hierarchical Synchronous Parallel model designed and implemented for synchronization across datacenters with a much improved efficiency in inter-datacenter communication. Our new model requires no modifications to graph analytics applications, yet guarantees their convergence and correctness. Our prototype implementation on Apache Spark can achieve up to 32% lower WAN bandwidth usage, 49% faster convergence, and 30% less total cost for benchmark graph algorithms, with input data stored across five geographically distributed datacenters.

关键词： Synchronization Analytical models Convergence Computational modeling partitioning algorithms Bandwidth Message passing

来源：评论

学校读者我要写书评

暂无评论

Recognition of expression variant faces from one sample image per enrolled subject

Recognition of expression variant faces from one sample imag...

引用

IEEE International Conference on Image Processing

作者： Hamidreza Rashidy Kanan Yongsheng Gao Electrical and Computer Engineering Department Islamic Azad University Qazvin Iran School of Engineering Griffith University Brisbane Australia

Despite remarkable progress on face recognition, little attention has been given to robustly recognize expression variant faces from a single sample image per person. One way to deal with the recognition of faces under above conditions is by using local statistical approaches which appear to be more robust against variations in facial expression. In this paper, we propose a new weighted matching method based on our recent work of AWPPZMA to recognize expression variant faces when only one exemplar image per enrolled subject is available. The proposed weighting method gives more significance to those parts of the face with facial expression variations that change less compared to neutral face image and less significance to those parts that change more. In this contribution, we use the difference between local area in the input face and its corresponding local area in the neutral face image as a measure of observable structure changes. The encouraging experimental results demonstrate that the proposed method provides a new solution to the problem of robustly recognizing expression variant faces in single model databases.

关键词： Face recognition Image recognition Robustness Face detection Testing Image databases partitioning algorithms Area measurement Eyes Geometrical optics

来源：评论

学校读者我要写书评

暂无评论

An efficient geographic surface routing algorithm in 3D ad hoc networks

An efficient geographic surface routing algorithm in 3D ad h...

引用

International Conference on Pervasive Computing and Applications (ICPCA)

作者： Han Su Yun Wang Dingyi Fang School of Computer Science and Engineering Key Laboratory of CNII MOE South-East University Nanjing China School of Information Science and Technology Northwest University Xi'an China

For geographic routing in 2D ad hoc networks, greedy algorithm is efficient if no holes exist. However, greedy forwarding fails when a message reaches a local-minimum. Thus, face routing is used to solve the problem of local-minimums. Unfortunately, few research results can be applied to geographic routing in 3D environments. This paper proposes an algorithm GSG (Greedy Surface routing Greedy), for geographic routing in 3D environments. GSG firstly partitions whole network with 3D Restricted Delau-nay Triangulation. When a local-minimum is encountered because of a hole, a message is transferred on a surface with triangles in order to jump out of a local-minimum area. Triangles and isolated edges are defined as 3D components on Surface. By means of identifying intersecting triangles and edges, efficient routes are constructed on surfaces by bypassing local-minimums. For sparsely deployed networks, an algorithm DFS based on 3D RNG is provided. Simulation results show that GSG outperforms the algorithms such as GRG and GHG.

关键词： Three dimensional displays Routing Face Surface treatment Ad hoc networks partitioning algorithms Greedy algorithms

来源：评论

学校读者我要写书评

暂无评论

TreeFTL: Efficient RAM management for high performance of NAND flash-based storage systems 13

TreeFTL: Efficient RAM management for high performance of NA...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Chundong Wang Weng-Fai Wong School of Computing National University of Singapore Singapore

ISBN: (纸本)9781450321532

NAND flash memory is widely used for secondary storage today. The flash translation layer (FTL) is the embedded software that is responsible for managing and operating in flash storage system. One important module of the FTL performs RAM management. It is well-known to have a significant impact on flash storage system's performance. This paper proposes an efficient RAM management scheme called TreeFTL. As the name suggests, TreeFTL organizes address translation pages and data pages in RAM in a tree structure, through which it dynamically adapts to workloads by adjusting the partitions for address mapping and data buffering. TreeFTL also employs a lightweight mechanism to implement the least recently used (LRU) algorithm for RAM cache evictions. Experiments show that compared to the two latest schemes for RAM management in flash storage system, TreeFTL can reduce service time by 46.6% and 49.0% on average, respectively, with a 64MB RAM cache.

关键词： Random access memory Ash Memory management Nonvolatile memory Educational institutions partitioning algorithms Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Multi-schema matching based on clustering techniques

Multi-schema matching based on clustering techniques

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Guohui Ding Tianhe Sun Yingnan Xu School of Computer Shenyang Aerospace University China School of Electronic Information Engineering Shenyang Aerospace University China School of Graduate Shenyang Aerospace University China

ISBN: (纸本)9781467352512

Schema matching plays an important role in many database applications, such as ontology merging, data integration, data warehouse and dataspaces. The problem of schema matching is to find the semantic correspondence between attributes of schemas to be matched. In this paper, we propose multi-schema matching based on clustering techniques. Traditional matching techniques mainly address matching tasks between two attributes, namely pairwise-attribute correspondence. However, there exist lots of applications that require the semantic correspondence among multiple attributes. Thus, we will focus on matching multiple attributes, which is more difficult than pairwise-attribute correspondence. We employ the clustering techniques to solve the multi-schema matching problem. We use the well-known TFIDF weighting method to convert each attribute in schemas to a point in the vector space model. Then, these attributes can be partitioned into different clusters each of which has a specific semantics topic. Finally, the attributes partitioned into the same cluster are similar with higher confidence. We validate our approach with an experimental study, the results of which demonstrate that our approach is effective and has good performance.

关键词： Vectors Semantics Measurement Clustering algorithms partitioning algorithms Accuracy Educational institutions

来源：评论

学校读者我要写书评

暂无评论

UAV-Assisted Adaptive Relay Nodes Placement for Network Connectivity Recovery in WSNs

UAV-Assisted Adaptive Relay Nodes Placement for Network Conn...

引用

Chinese Control and Decision Conference, CCDC

作者： Zhihui Ding Yajie Ma Shuhao Chen Feng Dan School of Information Science and Engineering Wuhan University of Science and Technology Wuhan China

ISBN: (数字)9798350387780

ISBN: (纸本)9798350387797

Connectivity is a fundamental requirement for Wireless Sensor Networks (WSNs). Failures in multiple nodes can disrupt network connectivity, leading to the formation of disjointed subnetworks. To restore network connectivity, a UAV-assisted Adaptive Relay nodes Placement algorithm (UARP). is proposed in this paper. To concentrate relay nodes placement and reduce the travel distance of UAVs, a concept of UAV Areas is introduced to identify the areas between interrupted network partitions. Based on the number of network partitions within UAV Areas, two different strategies are employed to place relay nodes and reconnect the partitions for the scenarios with more and fewer partitions, respectively. With the proposed algorithm, relay nodes are strategically placed within UAV Areas, which can reduce the required number of relay nodes and shorten the UAV travel distance. Simulation results indicate that the UARP algorithm reduces relay usage by 10% to 20% and decreases UAV travel distance by 5% to 10% compared to other algorithms. The algorithm also demonstrates satisfactory performance in terms of packet delivery rate, convergence time, and transmission delay.

关键词： Wireless communication Wireless sensor networks Adaptive systems Simulation Autonomous aerial vehicles Path planning partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Rebar Counting on Production Line Based on Machine Vision

Rebar Counting on Production Line Based on Machine Vision

引用

International Conference on Robot, Vision and Signal Processing (RVSP)

作者： Zuoxian Nie Mao-Hsiung Hung Jing Huang College of Information Science and Engineering Fujian University of Technology Fuzhou City China

In this paper, we present a novel algorithm that automatically counts rebar on production line based on video analysis. Our algorithm allows that conveyor belt moves at rather higher speed and rebars roll forward or backward on conveyor belt. There are mainly two parts in our proposed algorithm. Firstly, a method is developed to divide the video frame into three partitions, and then a set of heuristic rules are deduced based on these partitions. Secondly, for cases excluded by above rules, a sequence matching algorithm is developed to identify repeated sequence of rebar between adjacent frames, and then number of newly arrived rebar in every frame can be computed. The experimental results show that our method can support high-speed and precise rebar counting.

关键词： Belts Image segmentation partitioning algorithms Signal processing algorithms Machine vision Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Texture Classification with Ants

Texture Classification with Ants

引用

IEEE International Conference on Image Processing

作者： Arshad Hussain Nasir Rajpoot Kashif Rajpoot GIK Institute of Engineering Science and Technology Pakistan Department of Computer Science University of Warwick UK

In this paper, we present a novel texture classification algorithm inspired by the self-assembling behavior of real ants when building live structures with their bodies. The proposed algorithm employs dyadic Gabor filter banks for extracting discriminant features from images containing multiple textures not known to the algorithm. The feature space is clustered using the novel ant tree clustering (ATC) algorithm based on the similarity of ants carrying the feature vectors. The results thus obtained show promise of the proposed approach.

关键词： Clustering algorithms Gabor filters Feature extraction partitioning algorithms Filter bank Band pass filters Buildings Image texture analysis Filtering Frequency

来源：评论

学校读者我要写书评

暂无评论

A Characterization of the Modular Structure of Complex Networks Based on Consensual Communities

A Characterization of the Modular Structure of Complex Netwo...

引用

International IEEE Conference on Signal-Image Technologies and Internet-Based System

作者： Ivan Keller Emmanuel Viennet L2TI Institut Galilée Universite Paris Villetaneuse France

Understanding the community structure in graphs arising from complex network is an important and difficult problem, both from theoretical and practical points of views. Although a lot of community detection algorithms have been proposed in the last decade, there is still no satisfactory way to determine if a given network possesses or not a community structure, that is, its nodes can be partitioned in well separated clusters. In this paper, we propose a new criterion based on the study of the formation of consensual communities obtained by running several times a non deterministic algorithm. By testing on synthetic benchmarks (with known structure) and on several real world networks, we show that the graphs can be categorized in several classes according to the dynamic of the consensual communities formation process. This result is promising to derive new approaches to characterize the modular structure of graphs.

关键词： Communities partitioning algorithms Benchmark testing Detection algorithms Complex networks Indexes

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 483 484 485 486 487 488 489 490 491 492 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：