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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

A simultaneous placement and global routing algorithm with path length constraints for transport-processing FPGAs

A simultaneous placement and global routing algorithm with p...

引用

Asia and South Pacific Design Automation Conference

作者： N. Togawa M. Sato T. Ohtsuki Department of Electronics and Communication Engineering Waseda University Shinjuku Tokyo Japan

In the layout design of transport-processing FPGAs, it is not only required that routing congestion be kept small but also that circuits implemented on them should operate with higher operation frequency. This paper extends the proposed simultaneous placement and global routing algorithm for transport-processing FPGAs, whose objective is to minimize the routing congestion, and proposes a new algorithm, in which the length of each critical signal path (path length) is limited within a specified upper bound imposed on it (path length constraint). The algorithm is based on the hierarchical bipartitioning of the layout regions and LUT (lookup table) sets that are to be placed. Each bipartitioning procedure consists of three phases: (1) estimation of path lengths, (2) bipartitioning of a set of terminals, and (3) bipartitioning of a set of LUTs. After searching the paths with tighter path length constraints by estimating the path lengths in (1), phases (2) and (3) are executed so that their path lengths are reduced with higher priority, and thus path length constraints are not violated. The algorithm has been implemented and applied to transport-processing circuits and compared with conventional approaches. The results demonstrate that the algorithm resolves path length constraints for 11 out of 13 circuits, though it increases the routing congestion by an average of 20%. After detailed routing, it achieves 100% routing for all the circuits and reduces the circuit delay by an average of 23%.

关键词： Routing Field programmable gate arrays Circuits Table lookup Delay estimation Upper bound partitioning algorithms Design engineering Frequency Phase estimation

来源：评论

学校读者我要写书评

暂无评论

An Investigation on Multi-token List Based Proximity Search in Multi-dimensional Massive Database

An Investigation on Multi-token List Based Proximity Search ...

引用

International Conference on Convergence Information Technology

作者： Haiying Shen Ze Li Ting Li Department of Computer Science and Engineering University of Arkansas Fayetteville AR USA

A proximity search looks for similar complex documents such as images, sounds, DNA sequences that share two or more separately matching terms within a specified distance from within a large collection. Retrieving those similar complex documents are of great importance to many applications. To achieve an efficiency query process, many different access methods have been proposed. Token list based proximity search has been proved to be a good alternative method to the LSH for a large massive database proximity search. However, single-token based method leads to a high overhead in the results refinements process to achieve a required similarity. In this paper, we investigate how the multi-token list affects the performance of database proximity search. Numerous experiments have been conducted and the results show that two-token adjacent token list can achieve the best query performance in multi-token list based proximity search.

关键词： Sequences Image databases DNA Speech processing partitioning algorithms Information technology Multidimensional systems Computer science Acoustical engineering Data engineering

来源：评论

学校读者我要写书评

暂无评论

Preserving Privacy of Paging Procedure in 5thG Using Identity-Division Multiplexing

Preserving Privacy of Paging Procedure in 5thG Using Identit...

引用

First International Conference of Intelligent Computing and Engineering (ICOICE)

作者： Mamoon M. Saeed Rashid A. Saeed Elsadig Saeid Faculty of Engineering Alzaiem Alazahri University Sana'a Yemen School of Electronics Engineering Sudan University of Science and Technology (SUST) Taif University Faculty of Engineering Alzaiem Alazahri University Khartoum Sudan

ISBN: (数字)9781728144870

ISBN: (纸本)9781728144887

Although the efforts have been made by Third Generation Partnership Project (3GPP) toward enhancing privacy preserving competences, but it does not remove the probability of user privacy attacks and it is still susceptible to user privacy attacks by following the paging identifiers and correlating with permanent identity. The aim of this paper is preserving privacy of paging procedure in 5 th Generation and previous generations by proposing solution based on Identity-Division Multiplexing (IDM) with frequently varying unrelated Temporary Mobile Subscriber Identifiers (TMSI) used for user identification in paging producer, which enhancements the user privacy and defends the attacks of hacker. The scheme is formally verified using proVerif and proved to provide an adequate assurance of user privacy protection.

关键词： Privacy Multiplexing 3GPP partitioning algorithms Security Resource management 5G mobile communication

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Rule-Based Constraint Elicitation For Active Constraint-Incremental Clustering

Rule-Based Constraint Elicitation For Active Constraint-Incr...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Aymeric Beauchamp Thi-Bich-Hanh Dao Samir Loudni Christel Vrain LIFO EA 4022 University of Orléans INSA Centre-Val-de-Loire Orléans France TASC (LS2N-CNRS) / GREYC IMT Atlantique / University of Caen Normandy Nantes France

ISBN: (数字)9798331527235

ISBN: (纸本)9798331527242

Constrained clustering algorithms integrate user knowledge as constraints in the clustering process to guide it towards a desired outcome. When interacting with users, it is essential to quickly ask simple questions to identify informative constraints that will efficiently enhance an initial partition. We propose a new active query strategy for incremental clustering that translates user feedback into interpretable decision rules and identifies relevant points for queries using rule-based heuristics Experiments on benchmark datasets highlight the benefits of our new approach, making it suitable for real-world applications.

关键词： Clustering algorithms Benchmark testing partitioning algorithms Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Search-based semi-supervised clustering algorithms for change detection in remotely sensed images

Search-based semi-supervised clustering algorithms for chang...

引用

IEEE India Conference (INDICON)

作者： Moumita Roy Susmita Ghosh Ashish Ghosh Department of Computer Science and Engineering Jadavpur University Kolkata India Center for Soft Computing Research Indian Statistical Institute Kolkata India

In real life change detection for remotely sensed images suffers due to the problem of inadequate labeled patterns. When a few labeled patterns can be collected by experts, semi-supervised (learning) clustering can be opted for change detection instead of the unsupervised approach to make full utilization of both labeled and unlabeled patterns. In the present work, a study has been carried out by applying some of the semi-supervised clustering techniques for changed detection. A comparative analysis between K-Means, COP-KMeans, Seeded-KMeans and Constrained-KMeans algorithms is being performed based on the results obtained using two multi-temporal remotely sensed images. It can be concluded from the experiments that the Constrained-KMeans is well suited for changed detection of remotely sensed images under semi-supervised framework.

关键词： Clustering algorithms Remote sensing Change detection algorithms partitioning algorithms Standards Training Satellites

来源：评论

学校读者我要写书评

暂无评论

A heuristic decomposition methodology for channel assignment problems in mobile communication systems

A heuristic decomposition methodology for channel assignment...

引用

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： S.Z. Ali Department of Electrical & Electronic Engineering Imperial College of Science Technology and Medicine University of London London UK

The paper puts forward an efficient 'first decompose, then solve' solution strategy for channel assignment problems (CAP) in cellular communications systems. The underlying objective of the decomposition technique is that the interference graph (IG) developed for an intractable CAP be broken down into sub-graphs (channel assignment sub-problems, CASPs) of lower complexity and dimensionality by identifying the mutual interference patterns among base stations (BSs). The IG decomposition problem itself is NP-complete. A heuristic decomposition methodology is presented. The motivation for developing the heuristic technique is to bi-partition the IG using minimal computational resources. However, no guarantee of the global optimality of the partitioning solution obtained using the proposed decomposition technique is provided. The small-scale CASP associated with each subgraph developed is then solved using a conventional method (see Ali, S.Z. and Turner, L.F., Proc. IEEE 54th VTC, vol.l, p.389-93, 2001). The collection of solutions to the subproblems is the solution to the large-scale original CAP. The application of the proposed decomposition technique to a number of CAPs demonstrates the computational advantage associated with using the proposed methodology.

关键词： Mobile communication Base stations NP-complete problem Large-scale systems Interchannel interference Bandwidth Educational institutions Paper technology Tree graphs partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Deterministic /spl delta/-connected overlay for peer-to-peer networks

Deterministic /spl delta/-connected overlay for peer-to-peer...

引用

International Symposium on Object-Oriented Real-Time Distributed Computing

作者： A.K. Datta M. Gradinariu A. Virgillito School of Computer Science University of Nevada Las Vegas USA IRISA INRIA Rennes France Università di Roma La Sapienza Italy

The network connectivity is a basic requirement while implementing fundamental communication and storage abstractions in P2P networks, featuring scalability and fault-tolerance. The quality of services of abstractions like for example multicast, publish/subscribe, group membership or persistent storage is strongly related to the connectivity degree of the underlying overlay. Intuitively, a higher overlay connectivity ensures a reinforced reliability and consequently, the deployment of distributed applications with real-time constraints on top of these overlays becomes feasible even in environments characterized by a high dynamicity, i.e., nodes arriving and departing at a high rate. Our paper proposes a novel delta-connected DHT-free P2P overlay. Our overlay offers strong connectivity guarantees despite the system dynamicity. The construction and the maintenance of our overlay is completely decentralized and handled strictly locally, through deterministic algorithms whose correctness is rigorously proved

关键词： Peer to peer computing partitioning algorithms Real time systems Algorithm design and analysis Computer science Scalability Quality of service Telecommunication network reliability Multicast algorithms Degradation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：