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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Fuzzy clustering of CT images for the measurement of hydrocephalus associated with tuberculous meningitis

Fuzzy clustering of CT images for the measurement of hydroce...

引用

Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： W. Halberstadt T.S. Douglas MRC/UCT Medical Imaging Research Unit Department of Human BiologyFaculty of Health Sciences University of Cape Town South Africa

Computed tomography is used as an aid in the diagnosis of tuberculous meningitis (TBM) for the examination of a number of visual indicators of the disease. We present an algorithm that uses modified fuzzy c-means clustering to segment CT images of the brain into different tissue types. The ventricle/brain ratio is then calculated to measure hydrocephalus, a common sign of TBM in children

关键词： Computed tomography Clustering algorithms Magnetic resonance imaging Diseases Image segmentation Pediatrics Volume measurement Brain partitioning algorithms Fuzzy sets

来源：评论

学校读者我要写书评

暂无评论

A new label propagation with dams

A new label propagation with dams

引用

International Conference on Advances in Social Network Analysis and Mining, ASONAM

作者： Jean-Philippe Attal Maria Malek ETIS-ENSEA Universite de Cergy-Pontoise France EISTI: Ecole Internationale des Sciences du Traitement de l'Information Cergy France Laboratoire Quartz

ISBN: (纸本)9781509020942

Label propagation is one of the fastest methods for community detection, with a near linear time complexity. It's a local method, where each node interacts with its neighbourhood to change its own label. Unfortunately, this method has two major drawbacks. The first is a bad propagation which can lead to obtain huge communities without sense (monster communities problem). The second is the instability of the method. Each trial of a label propagation algorithm gives rarely the same result. In this paper, we propose to do a study on the label propagation by putting artificial dams on edges of some networks in order to limit the propagation and to observe if this can lead to better results. We then apply an existing method based on a co-occurrence frequency matrix in order to stabilise the algorithm.

关键词： Image edge detection Complexity theory partitioning algorithms Algorithm design and analysis Social network services Detection algorithms Standards

来源：评论

学校读者我要写书评

暂无评论

Resource Placement in Cube-Connected Cycles

Resource Placement in Cube-Connected Cycles

引用

International Symposium on Parallel Architectures, algorithms and Networks (ISPAN)

作者： Paria Moinzadeh Hamid Sarbazi-Azad Nasser Yazdani IPM School of Computer Science Sharif University of Technology Tehran Iran University of Tehran Tehran Iran

In large systems, economical and efficiency concerns restrict the allocation of each resource to every node in the network. Therefore, it is desirable to distribute copies of resource in order to share them and achieve a certain performance measure. In this paper, we consider the problem of distributing resources in Cube-Connected Cycles. Both adjacency and distant placements are considered in this paper. In adjacency placements, dominating sets and perfect dominating sets are used. The proposed algorithms for distant placements use known placements for basic hypercube graphs. Therefore, in these placements we avoid the additional costs needed for deploying the network. We prove that the presented algorithms provide an optimum result for Cube-Connected Cycles.

关键词： Hypercubes Resource management Costs Parallel architectures Computer science partitioning algorithms Hardware Routing Error correction codes

来源：评论

学校读者我要写书评

暂无评论

Auto-Tagging for Massive Online Selection Tests: Machine Learning to the Rescue

Auto-Tagging for Massive Online Selection Tests: Machine Lea...

引用

International Workshop on Technology for Education, T4E

作者： S. Krithivasan S. Gupta S. Shandilya K. Arya K. Lala Department of Computer Science & Engineering Indian Institute of Technology Bombay Mumbai India

ISBN: (纸本)9781509061167

Difficulty Level of a question is relative to that of other questions in a test and also to the test takers, hence manually assigning Difficulty Level tags may not be accurate. There is a need to infer them from historical data pertaining to the performance of students in a test. e-Yantra Robotics Competition (eYRC) is an annual competition having around 5000 teams (20,000 students) registering in the latest edition of the competition, eYRC-2015. All four team members take a test simultaneously and each individual gets questions which are different but have a similar Difficulty Level. A Question Bank containing 1800 unique questions from 3 subjects - Aptitude, Electronics, and C-Programming - is used to generate question sets each having 30 questions. It is a challenge to ensure that each set contains questions of similar Difficulty Levels tagged manually as Easy, Medium or Hard. In this paper, we discuss a learning algorithm called Weighted Clustering that can automatically tag questions by analyzing the performance of students. We used this algorithm to analyze the performance data in eYRC-2014 for 614 questions from the Question Bank, we found that Manual Tagging accuracy was 44%. We retagged questions with Suggested Tags resulting from our analysis and used them again in eYRC-2015. When we applied the algorithm to the performance data in eYRC-2015, we found that the accuracy of tagging had significantly improved to 67%.

关键词： Clustering algorithms Tagging Manuals partitioning algorithms Measurement Semantics Robots

来源：评论

学校读者我要写书评

暂无评论

Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction

Rapid Mixing of Glauber Dynamics up to Uniqueness via Contra...

引用

Annual IEEE Symposium on Foundations of Computer Science

作者： Zongchen Chen Kuikui Liu Eric Vigoda School of Computer Science Georgia Institute of Technology School of Computer Science & Engineering University of Washington

ISBN: (数字)9781728196213

ISBN: (纸本)9781728196220

For general antiferromagnetic 2-spin systems, including the hardcore model on weighted independent sets and the antiferromagnetic Ising model, there is an FPTAS for the partition function on graphs of maximum degree Δ when the infinite regular tree lies in the uniqueness region by Li et al. (2013). Moreover, in the tree non-uniqueness region, Sly (2010) showed that there is no FPRAS to estimate the partition function unless NP=RP. The algorithmic results follow from the correlation decay approach due to Weitz (2006) or the polynomial interpolation approach developed by Barvinok (2016). However the running time is only polynomial for constant Δ. For the hardcore model, recent work of Anari et al. (2020) establishes rapid mixing of the simple single-site Markov chain known as the Glauber dynamics in the tree uniqueness region. Our work simplifies their analysis of the Glauber dynamics by considering the total pairwise influence of a fixed vertex v on other vertices, as opposed to the total influence of other vertices on v, thereby extending their work to all 2-spin models and improving the mixing time. More importantly our proof ties together the three disparate algorithmic approaches: we show that contraction of the so-called tree recursions with a suitable potential function, which is the primary technique for establishing efficiency of Weitz's correlation decay approach and Barvinok's polynomial interpolation approach, also establishes rapid mixing of the Glauber dynamics. We emphasize that this connection holds for all 2-spin models (both antiferromagnetic and ferromagnetic), and existing proofs for the correlation decay or polynomial interpolation approach immediately imply rapid mixing of the Glauber dynamics. Our proof utilizes that the graph partition function is a divisor of the partition function for Weitz's self-avoiding walk tree. This fact leads to new tools for the analysis of the influence of vertices, and may be of independent interest for the study of

关键词： Vegetation Correlation Interpolation Approximation algorithms partitioning algorithms Computer science Computational modeling

来源：评论

学校读者我要写书评

暂无评论

A Hierarchical LLC Routing Algorithm for WSNs

A Hierarchical LLC Routing Algorithm for WSNs

引用

International Workshop on Robot Sensing (ROSE)

作者： Cesare Alippi Romolo Camplani Manuel Roveri Dipartimento di Elettronica e Informazione Politecnico di Milano Milan Italy

In WSNs and tiny cooperating wireless robots, unit and communication faults (permanent or transient), energy availability for the units and environmental changes may modify the communication network topology over time. Traditional hierarchical routing algorithms combine adaptability to changing environments with energy-aware aspects. In this paper we propose a k-level hierarchical extension to low-power localized clustering (LLC). For the first time, we take into account the effects introduced by finite unit bandwidth on the routing capabilities of the proposed algorithm. A second novel content of the paper is that, differently from the existing algorithms, the proposed solution guarantees a uniform distribution of alive units in the deployment area. This feature is particularly appealing since it is associated with the QoS of the network over time. The effectiveness of the suggest approach has been validated with a large experimental campaign.

关键词： Routing Wireless sensor networks Clustering algorithms Bandwidth Nominations and elections Network topology Robot sensing systems partitioning algorithms Base stations Monitoring

来源：评论

学校读者我要写书评

暂无评论

Research on the Critical Nodes Compensation Algorithm in Sparse Ad Hoc Wireless Networks

Research on the Critical Nodes Compensation Algorithm in Spa...

引用

IEEE International Symposium on Dependable, Autonomic and Secure Computing (DASC)

作者： Chun-mei Chen Hong Jiang Shi-en Yang School of Information Engineering Southwest University of Science and Technology Mianyang Sichuan China Center of Network Information Southwest University of Science and Technology Mianyang Sichuan China

Sparse Ad hoc wireless networks are an active application in recent years, though sparse environment often makes the network unconnected. However, most of the previous researches focus on connected networks where an end-to-end path exists between any two nodes in the network, therefore these technologies would not work well in sparse ad hoc networks where restricted node communication radius can result in periods of intermittent connectivity. In this work, we develop a critical nodes compensation algorithm in order to prevent network from partitioning, thereby insure network connectivity and throughput. Finally, we give simulation design and analysis of the critical nodes compensation algorithm using NS model. Simulation results show that the algorithm can effectively improve sparse ad hoc networks performance.

关键词： Wireless networks Ad hoc networks partitioning algorithms Mobile communication Vehicle safety Delay Routing protocols Algorithm design and analysis Vehicle driving Computer networks

来源：评论

学校读者我要写书评

暂无评论

A noise-resistant fuzzy c means algorithm for clustering

A noise-resistant fuzzy c means algorithm for clustering

引用

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)

作者： K.K. Chintalapudi M. Kam Data Fusion Laboratory Department of Electrical and Computer Engineering Drexel University Philadelphia PA USA

Probabilistic clustering techniques use the concept of memberships to describe the degree by which a vector belongs to a cluster. The use of memberships provides probabilistic methods with more realistic clustering than "hard" techniques. However, fuzzy schemes (like the fuzzy c means algorithm, FCM) are often sensitive to outliers. We review four existing algorithms, devised to reduce this sensitivity. These are: the noise cluster (NC) algorithm of Dave (1991), the possibilistic c means (PCM) scheme of Krishnapuram and Keller (1996), the least biased fuzzy clustering (LBFC) method of Beni and Liu (1994), and the fuzzy possibilistic c means algorithm of Pal et al. (1997). We then propose the new credibilistic fuzzy c means (CFCM) algorithm to improve on these methods. It uses a new variable, credibility of a vector, which measures the typicality of the vector to the whole data set. By taking credibility into account CFCM generates centroids which are less sensitive to outliers than other techniques, and closer to the centroids generated when the outliers are artificially removed.

关键词： Clustering algorithms partitioning algorithms Noise generators Prototypes Laboratories Art Lagrangian functions Minimization methods

来源：评论

学校读者我要写书评

暂无评论

The funnel algorithm and task level robot control

The funnel algorithm and task level robot control

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： J. Ish-Shalom IBM T.J. Watson Research Center Yorktown Heights NY

Traditionally the translation of a given task into robot actuator commands involves three translation steps: (i) Task level planning; given the task find the manipulated object's required motion. (ii) Robot motion planning; given the manipulated object's required motion find the desired robot arm trajectory. (iii) Robot controller; given the desired robot arm trajectory find the robot actuator commands. Furthermore, the robot controller is fixed and internal and is typically not modified in accordance with the expected interaction between the robot arm and the objects it is manipulating. Thus the fixed robot controller is a major handicap which limits the possible robot interactions and performance during such interactions. In this paper we suggest that the objectives of the robot controller be "elevated" from attaining robot arm level objectives to attaining task level objectives. Consistent with this view, the following new three step Funnel algorithm is suggested for the translation of a given task into robot actuator commands: (i) Partition the task into a sequence of local sub-tasks and local regions. (ii) Synthesize a feedback control law to achieve each sub-task locally. (iii) Apply the local feedback control law to obtain the required actuator commands. It is expected that using this funnel approach both the robot system performance and functionality can be improved.

关键词： Robot control Actuators Motion planning Trajectory Feedback control Robot motion Motion control partitioning algorithms Control system synthesis System performance

来源：评论

学校读者我要写书评

暂无评论

PTS-Based Radix FFT for PAPR Reduction in OFDM Systems

PTS-Based Radix FFT for PAPR Reduction in OFDM Systems

引用

IEEE Conference on Wireless Communications and Networking

作者： A. Ghassemi T. A. Gulliver Department of Electrical and Computer Engineering University of Victoria Victoria BC Canada

A radix FFT-based technique for reducing the peak-to-average power ratio (PAPR) of an orthogonal frequency division multiplexing (OFDM) signal is presented. The authors use intermediate signals in radix decimation in time (DIT) or frequency (DIF) FFT algorithm for subblock partitioning in the partial transmit sequence (PTS) technique. It is shown that DIF achieves low multiplicative complexity in generating PTSs compared to that with DIT and the same PAPR reduction. In addition, high radix FFT algorithms provide better PAPR reduction performance per stage with less multiplicative complexity compared with low radix algorithms.

关键词： Peak to average power ratio OFDM Partial transmit sequences partitioning algorithms Computational complexity Fast Fourier transforms Quadrature amplitude modulation Quadrature phase shift keying Wireless communication Signal generators

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 474 475 476 477 478 479 480 481 482 483 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：