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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A construction method for bounded-delay encodable modulation codes

A construction method for bounded-delay encodable modulation...

引用

IEEE International Symposium on Information Theory

作者： H.D.L. Hollmann Philips Research Laboratories Eindhoven Netherlands

We present a technique to construct sliding-block modulation codes with a small decoding window. Our method involves state-splitting and look-ahead coding techniques, and crucially depends on a new, entirely "loc... 详细信息

关键词： Modular construction Modulation coding Decoding Encoding partitioning algorithms Laboratories Binary sequences Optical modulation Hardware Delay

来源：评论

学校读者我要写书评

暂无评论

An Energy Exchanging Mechanism for Data Clustering

An Energy Exchanging Mechanism for Data Clustering

引用

Brazilian Symposium on Neural Networks

作者： Roberto Alves Gueleri Liang Zhao Institute of Mathematics and Computer Science University of São Paulo Sao Carlos Sao Paulo Brazil

In this paper, a dynamic process for data clustering is presented. It is based on the collective behavior among the objects of the input dataset. Each object is assigned an energy state, so they interact with each other by exchanging their energy, causing similar objects to take similar states. Finally, a classical algorithm such as k-means is applied on the energy vectors to actually cluster the data. Experiments show that the energy exchanging process is able to transform complex arrangements of objects into arrangements much easier to cluster. Moreover, the energy exchanging process is resilient to the mixture of clusters to some extent.

关键词： Energy states Clustering algorithms Indexes Vectors Particle swarm optimization partitioning algorithms Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Planar graphs, negative weight edges, shortest paths, and near linear time

Planar graphs, negative weight edges, shortest paths, and ne...

引用

IEEE International Conference on Cluster Computing

作者： J. Fakcharoenphol S. Rao Computer Science Division University of California Berkeley CA USA

The authors present an O(n log/sup 3/ n) time algorithm for finding shortest paths in a planar graph with real weights. This can be compared to the best previous strongly polynomial time algorithm developed by R. Lipton et al., (1978 )which ran in O(n/sup 3/2/) time, and the best polynomial algorithm developed by M. Henzinger et al. (1994) which ran in O/spl tilde/(n/sup 4/3/) time. We also present significantly improved algorithms for query and dynamic versions of the shortest path problems.

关键词： Shortest path problem partitioning algorithms Polynomials Particle separators Tree graphs Radio access networks Computer science Scholarships Image segmentation Bipartite graph

来源：评论

学校读者我要写书评

暂无评论

A low complexity adaptive algorithm for tracking of eigenspace-based two-dimensional directions of arrival

A low complexity adaptive algorithm for tracking of eigenspa...

引用

IEEE/ACES International Conference on Wireless Communications and Applied Computational Electromagnetics

作者： Kuo-Hsiung Wu Wen-Hsien Fang Hsin-Jung Chen Jiunn-Tsair Chen Department of Electronic Engineering De-Lin Institute of Technology Taipei Taiwan Department of Electronic Engineering National Taiwan University of Science and Technology Taipei Taiwan Institute of Communications Engineering National Tsing Hua University Hsinchu Taiwan

ISBN: (纸本)0780390687

This paper presents a low complexity adaptive algorithm for two-dimensional (2-D) directions of arrival (DOA) tracking using a uniform rectangular array. The new algorithm employs three one-dimensional (1-D) subspace tracking algorithms to determine the two DOA components iteratively in a coarse-fine manner based on a single row or column of data. Also, to enhance the estimation accuracy, two orthogonal beamforming processes are invoked between the 1-D subspace tracking algorithms to partition the incoming signals into appropriate groups so that the DOAs can be well resolved even if they are very close. As such, the overall computational complexity called for is substantially less than the existing 2-D subspace tracking algorithms, which requires an update of higher-dimensional vectors. Furthermore, the estimated 2-D DOA components are automatically paired. Furnished simulations show that the new algorithm provides satisfactory tracking performance in various scenarios.

关键词： Adaptive algorithm Direction of arrival estimation partitioning algorithms Iterative algorithms Two dimensional displays Adaptive arrays Array signal processing Signal processing Signal resolution Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Parallel 3D shrinking algorithms using subfields notions

Parallel 3D shrinking algorithms using subfields notions

引用

International Conference on Pattern Recognition

作者： R.W. Hall S. Kucuk Department of Electrical Engineering University of Pittsburgh Pittsburgh PA USA

The parallel shrinking of 3D binary images to single point residues is addressed using two subfields notions (A subfield is a partition of the image space into two disjoint subsets). Sufficient conditions for connectivity preservation are developed and convergence issues are discussed. An example two subfields algorithm is illustrated and evaluated.< >

关键词： partitioning algorithms Algorithm design and analysis Image processing Parallel algorithms Concurrent computing Convergence Computer architecture Very large scale integration Labeling

来源：评论

学校读者我要写书评

暂无评论

An Agent Simulation Heuristics for Snowplowing Problems

An Agent Simulation Heuristics for Snowplowing Problems

引用

IEEE International Conference on Systems Engineering

作者： Satoshi Takahashi Tokuro Matsuo Graduate School of Systems and Information Engineering University of Tsukuba Tsukuba Japan Graduate School of Science and Engineering Yamagata University Yonezawa Japan

This paper proposes a heuristics method for huge task allocation problem over snowblower tasks. It is difficult to solve the huge task allocation problem. A snowblower problem includes a task allocation problem and agents scheduling problem. Given a directed graph as city map, we should consider some arc-disjoint partitions of the graph as allocation. A graph partition problem is a fundamental problem of combinatorics, there are some effective algorithms for the problem. However, in the case that we consider the task allocation and scheduling, the graph partition problem is too difficult. Because of this fact, we employ an agent simulation for solving the snowblower problem.

关键词： Resource management partitioning algorithms Heuristic algorithms Roads Modeling Complexity theory Snow

来源：评论

学校读者我要写书评

暂无评论

Bipartitioning for hybrid FPGA-software simulation

Bipartitioning for hybrid FPGA-software simulation

引用

International Conference on VLSI Design

作者： A. Singla T.M. Conte North Carolina State University Raleigh NC USA

Simulation is an important step in the design cycle of VLSI systems. The increasing size and complexity of modern systems require simulation techniques optimized for time. Researchers are resorting to parallel simulation to reduce simulation time. Logic partitioning plays an important role in parallel simulation. Two factors, concurrency amongst the partitions and communication between them, determine the effectiveness of partitioning. The concurrency achieved and the communication overhead resulting from the intersecting signals can directly affect the speed-up achieved in the simulation. Hybrid FPGA-software simulation offers an alternative for increasing the speed of simulation. In addition to above factors, size and cost of FPGA also determine the partitioning technique for FPGA based emulation. This paper addresses the issues involved in hybrid FPGA-software simulation and presents a new partitioning scheme. With our approach, communication between partitions reduces to at least 50% of that observed in the best of the other algorithms. Also for most of the benchmarks, only 25% of the circuit elements are in the FPGA partition. Presimulation is employed as an effective tool to achieve this aim.

关键词： Field programmable gate arrays Circuit simulation Very large scale integration Computational modeling Concurrent computing Costs Emulation partitioning algorithms Load management Logic

来源：评论

学校读者我要写书评

暂无评论

Gaussian kernel particle swarm optimization clustering algorithm

Gaussian kernel particle swarm optimization clustering algor...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Shengyu Pei Lang Tong Fangchenggang College Guangxi University of Finance and Economics Fangchenggang China

As the K-means algorithm is dependent on the initial clustering center, and the particle swarm optimization (PSO) converges prematurely and is easily trapped in local minima, a Gaussian kernel particle swarm optimization clustering algorithm is proposed in this paper. The algorithm adopts the theory of good point set to initialize population, which makes the initial clustering center more rational. Particle swarm iteration formula was optimized by using Gaussian kernel method, which makes particle swarm algorithm converge rapidly to the global optimal. By testing 23 UCI data sets, the experimental results show that the clustering effect of the proposed algorithm is better than that of the K-means and the traditional particle swarm optimization clustering algorithm.

关键词： Clustering algorithms Kernel Particle swarm optimization Sociology Statistics Algorithm design and analysis partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

An extended multidelay filter: fast low-delay algorithms for very high-order adaptive systems

An extended multidelay filter: fast low-delay algorithms for...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： H. Buchner W. Kellermann J. Benesty Telecommunications Laboratory University of Erlangen-Nuremberg Erlangen Germany Bell Laboratories Lucent Technologies Murray Hill NJ USA

We propose a novel class of efficient adaptive algorithms in the frequency domain that is tailored to very long adaptive filters and highly autocorrelated input signals as they arise, e.g., in high-quality full-duplex audio applications. The approach exhibits good tracking capabilities of the signal statistics and very low delay. Moreover, it is shown that the low order of computational complexity of the conventional frequency-domain adaptive algorithms can be maintained thanks to efficient realizations. The algorithm allows a tradeoff between the well-known multidelay filter (MDF) and the recursive least-squares (RLS) algorithm. It is also well suited for an efficient generalization to the multichannel case.

关键词： Adaptive filters Adaptive systems Finite impulse response filter Signal processing algorithms partitioning algorithms Adaptive algorithm Delay Frequency domain analysis Statistics Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Fast algorithm for computing spectral transforms of Boolean and multiple-valued functions on circuit representation

Fast algorithm for computing spectral transforms of Boolean ...

引用

International Symposium on Multiple-Valued Logic

作者： R. Krenz E. Dubrova A. Kuehlmann Royal Institute of Technology IMIT/KTH Kista Sweden Cadence Berkeley Laboratories Berkeley CA USA

In this paper we present a fast algorithm for computing the value of a spectral transform of Boolean or multiple-valued functions for a given assignment of input variables. Our current implementation is for arithmetic transform, because our work is primarily aimed at optimizing the performance of probabilistic verification methods. However, the presented technique is equally applicable for other discrete transforms, e.g. Walsh or Reed-Muller transforms. Previous methods for computing spectral transforms used truth tables, sum-of-product expressions, or various derivatives of decision diagrams. They were fundamentally limited by the excessive memory requirements of these data structures. We present a new algorithm that partitions the computation of the spectral transform based on the dominator relations of the circuit graph representing the function to be transformed. As a result, the presented algorithm can handle larger functions than previously possible.

关键词： Discrete transforms Arithmetic Input variables partitioning algorithms Logic testing Optimization methods Data structures Circuit synthesis Circuit testing Logic functions

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 481 482 483 484 485 486 487 488 489 490 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：