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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Sparsification-a technique for speeding up dynamic graph algorithms

Sparsification-a technique for speeding up dynamic graph alg...

引用

Annual IEEE Symposium on Foundations of Computer Science

作者： D. Eppstein Dept. of Inf. & Comput. Sci. California Univ. Irvine CA USA

The authors provide data structures that maintain a graph as edges are inserted and deleted, and keep track of the following properties: minimum spanning forests, best swap, graph connectivity, and graph 2-edge-connectivity, in time O(n/sup 1/2/log(m/n)) per change; 3-edge-connectivity, in time O(n/sup 2/3/) per change; 4-edge-connectivity, in time O(n alpha (n)) per change; k-edge-connectivity, in time O(n log n) per change; bipartiteness, 2-vertex-connectivity, and 3-vertex-connectivity, in time O(n log(m/n)) per change; and 4-vertex-connectivity, in time O(n log(m/n)+n alpha (n)) per change. Further results speed up the insertion times to match the bounds of known partially dynamic algorithms. The algorithms are based on a technique that transforms algorithms for sparse graphs into ones that work on any graph, which they call sparsification.< >

关键词： Heuristic algorithms Data structures Computer science Tree graphs Algorithm design and analysis partitioning algorithms Binary trees

来源：评论

学校读者我要写书评

暂无评论

Improved K-Means Clustering Algorithm

Improved K-Means Clustering Algorithm

引用

Congress on Image and Signal Processing, CISP

作者： Zhe Zhang Junxi Zhang Huifeng Xue College of Automation Northwestern Polytechnical University Xi'an China

K-means algorithm is widely used in spatial clustering. It takes the mean value of each cluster centroid as the Heuristic information, so it has some disadvantages: sensitive to the initial centroid and instability. The improved clustering algorithm referred to the best clustering centriod which is searched during the optimization of clustering centroid. That increased the searching probability around the best centroid and improved the stability of the algorithm. The experiment on two groups of representative dataset proved that the improved K-means algorithm performs better in global searching and is less sensitive to the initial centroid.

关键词： Clustering algorithms Signal processing algorithms partitioning algorithms Stability Data mining Gradient methods Multidimensional signal processing Educational institutions Automation Neural networks

来源：评论

学校读者我要写书评

暂无评论

An efficient scheduling algorithm for grid computing with periodical resource reallocation

An efficient scheduling algorithm for grid computing with pe...

引用

International Conference on Computer and Information Technology (CIT)

作者： Cho-Chin Lin Chun-Wei Shih Department of Electronic Engineering National I-Lan University Yilan Taiwan

Grid computing provides a platform for users to access worldwide distributed resources. To meet the timing constrains and quality requirements imposed by the tasks running on a grid, the resources assigned to the tasks may need to be periodically reallocated. Thus, an effective strategy for reinforcing resources to or reclaiming resources from the tasks is needed. In this paper, a novel scheduling algorithm is proposed for grid computing with periodical resource reallocation. It migrates the ongoing tasks from a set of computing nodes to another set so as to fully employ the newly available computing power. To achieve high performance computing, the algorithm also balances the workload of the grid in the meanwhile of task migration. In this paper, the simulation results show the usefulness and effectiveness of our scheduling algorithm.

关键词： Computational modeling Scheduling algorithm Processor scheduling Grid computing partitioning algorithms Heuristic algorithms Joining processes

来源：评论

学校读者我要写书评

暂无评论

Context-sensitive automatic categorization of web database query results

Context-sensitive automatic categorization of web database q...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Xiangfu Meng Jinguang Sun Chunxiao Liu School of Electronic and Information Engineering Liaoning Technical University Huludao China College of Electronics and Information Engineering Liaoning University of Technology Jinzhou China

To deal with the problem of too many answers returned from a Web database in response to a user query, this paper proposes a novel categorization approach which takes advantages of the user contextual preferences to construct a navigational tree in order to reduce the information overload. Based on the user original query, we first speculate how much the user cares about each attribute in the specified context and assign a corresponding weight to it. Then, the categorizing attribute in each level of the tree can be determined according to the weight of the attribute. The categorizing attribute for the first level of the tree is the attribute with the maximum weight. Next, we use the histogram construction algorithm to partition the values of each categories of the tree, the category with the larger exploring probability will be provided earlier to the user. Finally, the navigational tree is generated automatically and presented to the user, such that the user can easily select the relevant tuples matching his needs. Results of a preliminary user study demonstrate that our categorization method can capture the user's preferences effectively.

关键词： Navigation Databases Histograms Clustering algorithms Context Construction industry partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Motion planning and control from temporal logic specifications with probabilistic satisfaction guarantees

Motion planning and control from temporal logic specificatio...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： M. Lahijanian J. Wasniewski S. B. Andersson C. Belta Department of Mechanical Engineering Boston University MA USA

We present a computational framework for automatic deployment of a robot from a temporal logic specification over a set of properties of interest satisfied at the regions of a partitioned environment. We assume that, during the motion of the robot in the environment, the current region can be precisely determined, while due to sensor and actuation noise, the outcome of a control action can only be predicted probabilistically. Under these assumptions, the deployment problem translates to generating a control strategy for a Markov Decision Process (MDP) from a temporal logic *** propose an algorithm inspired from probabilistic Computation Tree Logic (PCTL) model checking to find a control strategy that maximizes the probability of satisfying the specification. We illustrate our method with simulation and experimental results.

关键词： Motion control Probabilistic logic Robot sensing systems Robotics and automation Working environment noise Robot motion Automatic control Automatic logic units Specification languages partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

An iterative approach to local-PCA

An iterative approach to local-PCA

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Samuel John Heiko Wersing Helge Ritter Cognition and Robotics-Lab (CoR-Laboratory) Bielefeld University Bielefeld Germany Honda Research Institute Europe GmbH Offenbach Germany Robotics Laboratory (CoR-Lab) Faculty of Technology Bielefeld University Bielefeld Germany

We introduce a greedy algorithm that works from coarse to fine by iteratively applying localized principal component analysis (PCA). The decision where and when to split or add new components is based on two antagonistic criteria. Firstly, the well known quadratic reconstruction error and secondly a measure for the homogeneity of the distribution. For the latter criterion, which we call “generation error”, we compared two different possible methods to assess if the data samples are distributed homogeneously. The proposed algorithm does not involve a costly multi-objective optimization to find a partition of the inputs. Further, the final number of local PCA units, as well as their individual dimensionality need not to be predefined. We demonstrate that the method can flexibly react to different intrinsic dimensionalities of the data.

关键词： Principal component analysis Manifolds Histograms Image reconstruction Equations Measurement uncertainty partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

A new algorithm for construction specific field terms using co-occurrence words information

A new algorithm for construction specific field terms using ...

引用

Midwest Symposium on Circuits and Systems (MWSCAS)

作者： E.-S. Atlam E. Ghada M. Fuketa J. Aoe Department of Information Science and Intelligent Systems University of Tokushima Tokushima Tokushima Japan

Readers can know the subject of many document fields by reading only some specific words called field association (FA) terms. It is very important to construct these FA terms to decide correctly the document fields from few words information in part of file. The field can be decided efficiency if the number of these FA terms is many and the frequency rate is high. If the number of level I (words that direct connect to terminal fields) FA word is limited, old methods can not determine the documents tiled easily and fast, special when there is a small number of corpus documents. This paper proposes a new method for deciding FA terms using the weight of co-occurrence words and declinable words which related to a narrow association category with eliminating FA terms ambiguity. Moreover, efficient FA terms are difficult to be extracted only by the information of the frequency of them. This paper proposed a new efficient method using new cooccurrence words weight which makes precision and recall are higher than the case of degree of frequency.

关键词： Thesauri Frequency Data mining Information science Intelligent systems Costs Natural language processing Clustering algorithms partitioning algorithms Data compression

来源：评论

学校读者我要写书评

暂无评论

Distributed submodular maximization: trading performance for privacy

Distributed submodular maximization: trading performance for...

引用

IEEE Conference on Decision and Control

作者： Navid Rezazadeh Solmaz S. Kia Mechanical and Aerospace Eng. Dept. University of California Irvine Irvine USA

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

This paper considers a multi-agent submodular set function maximization problem subject to partition matroid in which the utility is shared, but the agents’ policy choices are constrained locally. The paper’s main contribution is a distributed algorithm that enables each agent to find a suboptimal policy locally with a guaranteed level of privacy. The submodular set function maximization problems are NP-hard. For agents communicating over a connected graph, this paper proposes a polynomial-time distributed algorithm to obtain a guaranteed near optimal solution. The proposed algorithm is based on a distributed randomized gradient ascent scheme on the multilinear extension of the submodular set function in the continuous domain. Our next contribution is the design of a distributed rounding algorithm that does not need any inter-agent communication. We base our algorithm’s privacy preservation characteristic on our proposed stochastic rounding method and tie the level of privacy to the variable γ ∈ [0, 1]. That is, the policy choice of an agent can be determined with the probability of at most γ. We show that our distributed algorithm results in a strategy set that when the team’s objective function is evaluated in the worst case, the objective function value is in 1 − (1/e) h(γ) − O(1/T ) of the optimal solution, highlighting the interplay between level of optimality gap and guaranteed level of privacy where T is the number of communication rounds between the agents.

关键词： Privacy Linear programming partitioning algorithms Distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Improving the efficiency of circuit-to-BDD conversion by gate and input ordering

Improving the efficiency of circuit-to-BDD conversion by gat...

引用

IEEE International Conference on Computer Design: VLSI in Computers and Processors, (ICCD)

作者： F.A. Aloul I.L. Markov K.A. Sakallah Department of Electrical Engineering and Computer Science University of Michigan USA

Boolean functions are fundamental to synthesis and verification of digital logic, and compact representations of Boolean functions have great practical significance. Popular representations, such as CNF, DNF, circuits and ROBDDs [4], offer different advantages and are preferred for different tasks. Conversion between those representations is common, especially when one is used to represent the input and another speeds up relevant algorithms. Our work addresses the construction of ROBDDs that represent outputs of a given Boolean circuit. It is used in synthesis and verification. Earlier works (Fujita, Fujisawa, and Kawato, 1988. Malik et al., 1988.) proposed ordering circuit inputs and gates by graph traversals. We contribute orderings based on circuit partitioning and placement, leveraging the progress in recursive bisection and multi-level min-cut partitioning achieved in late 1990s. Our empirical results show that the proposed orderings based on circuit partitioning and placement are more successful than straightforward DFS and BFS, as well as related heuristics.

关键词： Circuits Binary decision diagrams Boolean functions Joining processes partitioning algorithms Very large scale integration Data structures Testing Runtime

来源：评论

学校读者我要写书评

暂无评论

Disjoint-support boolean decomposition combining functional and structural methods

Disjoint-support boolean decomposition combining functional ...

引用

Asia and South Pacific Design Automation Conference

作者： A. Martinelli R. Krenz E. Dubrova Royal Institute of Technology Stockholm Sweden

This paper presents an algorithm for disjointsupport decomposition of Boolean functions which combines functional and structural approaches. First, a set of proper cut points is identified in the circuit by using dominator relations (structural method). Then, the circuit is partitioned along these cut points and a BDD-based decomposition is applied to the resulting smaller functions (functional method). Previous work on Boolean decomposition used only single methods and did not integrate a combined strategy. The experimental results show that the presented technique is more robust than a pure BDD-based approach and produces better-quality decompositions.

关键词： Boolean functions Circuits Data structures partitioning algorithms Logic testing Robustness Network synthesis Formal verification H infinity control Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 491 492 493 494 495 496 497 498 499 500 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：