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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

47 篇 期刊文献
29 篇 会议

馆藏范围

76 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

70 篇 工学
- 44 篇 计算机科学与技术...
- 32 篇 电气工程
- 10 篇 信息与通信工程
- 7 篇 控制科学与工程
- 4 篇 力学（可授工学、理...
- 4 篇 软件工程
- 3 篇 仪器科学与技术
- 3 篇 电子科学与技术（可...
- 2 篇 机械工程
- 2 篇 材料科学与工程（可...
- 2 篇 石油与天然气工程
- 1 篇 动力工程及工程热...
- 1 篇 生物工程
15 篇 理学
- 7 篇 数学
- 3 篇 物理学
- 2 篇 化学
- 2 篇 生物学
- 2 篇 统计学（可授理学、...
- 1 篇 系统科学
3 篇 管理学
- 3 篇 管理科学与工程(可...
1 篇 农学
- 1 篇 作物学
1 篇 医学
- 1 篇 临床医学

主题

76 篇 partitioning alg...
5 篇 load balancing
4 篇 scalability issu...
3 篇 petri net
3 篇 parallel subnet
3 篇 cyclic symmetry
3 篇 partitioning con...
3 篇 blockchain
3 篇 place invariant
2 篇 pon
2 篇 distributed virt...
2 篇 design automatio...
2 篇 communication re...
2 篇 power network
2 篇 graph theory
2 篇 byzantine fault ...
2 篇 memory hierarchy
2 篇 performance eval...
2 篇 embedded design
2 篇 network design

机构

2 篇 dalian jiaotong ...
2 篇 natl tech univ a...
2 篇 dalian univ tech...
2 篇 jiangxi univ sci...
1 篇 univ texas arlin...
1 篇 informatics tech...
1 篇 wright state uni...
1 篇 ibm china design...
1 篇 hydro quebec res...
1 篇 dept. of electr....
1 篇 hebei univ techn...
1 篇 istanbul gelisim...
1 篇 univ jeddah fac ...
1 篇 department of co...
1 篇 kyushu univ grad...
1 篇 northeastern uni...
1 篇 guangxi univ com...
1 篇 department of in...
1 篇 csic upc inst ro...
1 篇 faculty of minin...

作者

4 篇 he yiqian
4 篇 yang haitian
2 篇 xuan wang
2 篇 yu zhiwei
2 篇 deng xiaohong
2 篇 xiong weizhi
2 篇 yingzhou bi
2 篇 xiang-bo zhang
2 篇 wen-jing li
2 篇 guo xiaofeng
1 篇 david l. kleinma...
1 篇 thenius ronald
1 篇 cai chunhua
1 篇 sun ling-yu
1 篇 eva d. regnier
1 篇 leng ming
1 篇 yuan chunfeng
1 篇 sato m
1 篇 atiquzzaman moha...
1 篇 lyubetsky v. a.

语言

69 篇 英文
6 篇 其他
1 篇 中文

检索条件"主题词=partitioning algorithm"

共 76 条记录，以下是61-70 订阅

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

详细简洁

排序：

Comparison of Clustering Approaches for Gene Expression Data

Comparison of Clustering Approaches for Gene Expression Data

引用

12th Scandinavian Conference on Artificial Intelligence (SCAI)

作者： Borg, Anton Lavesson, Niklas Boeva, Veselka Blekinge Inst Technol Sch Comp SE-37179 Karlskrona Sweden Tech Univ Comp Syst & Technol Dept Sofia Bulgaria

ISBN: (纸本)9781614993308;9781614993292

Clustering algorithms have been used to divide genes into groups according to the degree of their expression similarity. Such a grouping may suggest that the respective genes are correlated and/or co-regulated, and subsequently indicates that the genes could possibly share a common biological role. In this paper, four clustering algorithms are investigated: k-means, cut-clustering, spectral and expectation-maximization. The algorithms are benchmarked against each other. The performance of the four clustering algorithms is studied on time series expression data using Dynamic Time Warping distance in order to measure similarity between gene expression profiles. Four different cluster validation measures are used to evaluate the clustering algorithms: Connectivity and Silhouette Index for estimating the quality of clusters, Jaccard Index for evaluating the stability of a cluster method and Rand Index for assessing the accuracy. The obtained results are analyzed by Friedman's test and the Nemenyi post-hoc test. K-means is demonstrated to be significantly better than the spectral clustering algorithm under the Silhouette and Rand validation indices.

关键词： gene expression data graph-based clustering algorithm minimum cut clustering partitioning algorithm dynamic time warping

来源：评论

学校读者我要写书评

暂无评论

Maximum Length Sequence algorithm for Wavefront Shaping 3

Maximum Length Sequence Algorithm for Wavefront Shaping

引用

Conference on Optical Coherence Imaging Techniques and Imaging in Scattering Media III

作者： Danko, Oleksandr Danko, Volodymyr Kovalenko, Andrey Kurashov, Vitalij Taras Shevchenko Natl Univ Kyiv 64-13 Volodymyrska St UA-01601 Kiev Ukraine

ISBN: (纸本)9781510628502

The present study is concerned with wavefront shaping algorithms and their performance in noisy environments. Simple sequential algorithms has quite low initial enhancement rate which makes it hard to overcome strong noise. As a result, more complex algorithms which use multiple spatial light modulator pixels were developed. It made it possible to overcome noise at the initial stage faster. One of such algorithms is the partitioning algorithm. The maximum length sequence algorithm considered in this paper is proposed as an improvement of the partitioning algorithm. Both algorithms have similar initial enhancement rates but the proposed one keeps higher rate also at later stages.

关键词： maximum length sequence partitioning algorithm wavefront shaping light scattering

来源：评论

学校读者我要写书评

暂无评论

Decentralized Control of Power System Zones based on Probabilistic Constrained Load Flow

Decentralized Control of Power System Zones based on Probabi...

引用

International Conference on Probabilistic Methods Applied to Power Systems (PMAPS)

作者： Trakas, D. N. Voumvoulakis, E. M. Hatziargyriou, N. D. Natl Tech Univ Athens Sch Elect & Comp Engn Athens Greece

ISBN: (纸本)9781479935611

Modern power systems are characterized by high uncertainty. The paper presents a method for a network constrained setting of control variables in independent or weakly coupled power zones based on probabilistic load flow (plf) analysis. Plf is applied in order to provide the complete spectrum of all probable values of the state and output variables, such as bus voltages. The network is divided into clusters in order to create zones with the minimum power exchange and interaction with their neighboring zones. The zone controllers are adjusted in order to act independently from other zone controllers in order to eliminate the limit violations of the constrained variables. The method is applied to the IEEE 118-bus system. The results show the performance of graph partitioning and the ability of the method to provide the appropriate control actions in order to satisfy all physical and operating constraints of the power system.

关键词： Contrsained load flow graph theory partitioning algorithm particle swarm optimization power network

来源：评论

学校读者我要写书评

暂无评论

A classification algorithm of 3D volumetric data for hierarchical visualization

A classification algorithm of 3D volumetric data for hierarc...

引用

Conference on Input/Output and Imaging Technologies

作者： Sato, M Liu, Y Takahashi, H Nakajima, M Tokyo Inst Technol Grad Sch Informat Sci & Engn Meguro Ku Tokyo 1528552 Japan

ISBN: (纸本)0819428760

This paper presents one part of our work on "hierarchical visualization." Here, we propose an efficient hierarchical structure for the visualization of 3D volumetric data, where for instance, data compression techniques are embedded into the hierarchical structure. The hierarchical structure consists of two layers. The first hierarchy roughly visualizes the whole lossy compressed data so that we can quickly understand and interpret the outline of the whole 3D volumetric dataset. This step allows users to choose the desired parts of the 3D volumetric data. The second hierarchy is used for scrutinizing the detail of the chosen parts using lossless compressed data. To implement the hierarchical structure we propose a partitioning algorithm for 3D volumetric data based on principal component analysis. With principal component analysis, the original 3D volumetric space can be divided into a number of 3D volumetric blocks such that each block contains similar data. Analyzing these specific blocks and taking advantage of an octree hierarchy, from the whole 3D volumetric dataset we can easily access only the parts which are required for display. The proposed partitioning algorithm should be very useful in reducing the amount of rendering, which means that we will need only to precisely render the blocks required for display, and not the whole 3D volumetric dataset.

关键词： 3D medical volume visualization hierarchical visualization partitioning algorithm octree

来源：评论

学校读者我要写书评

暂无评论

Reliability Evaluation Using a Clustering Technique Based on Tie-set Method 43

Reliability Evaluation Using a Clustering Technique Based on...

引用

43rd International Conference on Telecommunications and Signal Processing (TSP)

作者： Mahmood, Musaria K. Myderrizi, Indrit Istanbul Gelisim Univ Elect & Elect Engn Dept Istanbul Turkey

ISBN: (纸本)9781728163765

In this paper, an efficient technique to be used for reliability evaluation of complex networks with a large number of links and/or nodes is presented. By mapping network topology into many partitions through a hierarchical clustering process, the network's nodes are distributed in distinct groups at the top level. Then each group where the tie-set algorithm is independently applicable is represented only by contact nodes. The reliability evaluation is performed for the network simplified in this way. The proposed method is validated in terms of calculation speed and computational complexity through simulation of a randomly selected network.

关键词： clustering technique complex network partitioning algorithm reliability evaluation tie-set method

来源：评论

学校读者我要写书评

暂无评论

A Novel Delay-Aware Packing algorithm for FPGA Architecture Using RFET 67

A Novel Delay-Aware Packing Algorithm for FPGA Architecture ...

引用

67th IEEE International Midwest Symposium on Circuits and Systems (MWSCAS)

作者： Lu, Sheng Shang, Liuting Jung, Sungyong Zhang, Yichen Pan, Chenyun Univ Texas Arlington Dept Elect Engn Arlington TX 76019 USA

ISBN: (纸本)9798350387186;9798350387179

Reconfigurable devices are gaining increasing attention as a viable alternative and supplementary solution to traditional CMOS technology. In this paper, we develop a more efficient 2-input look-up table (LUT) based on the reconfigurable field-effect transistors (RFETs), leading to a smaller transistor usage and a smaller critical path delay. The cells are organized into regular matrices, known as MClusters, with a fixed interconnection pattern to replace LUTs in field-programmable gate arrays (FPGAs). To improve the efficiency of utilizing this structure, we design a SAT-based delay-aware packing algorithm to better utilize logical gates for the MCluster structure. Finally, we combine this algorithm with FPGA simulation tools to form a comprehensive benchmarking flow. A series of benchmark tests show that under the optimal design, up to 35% and 30% reduction can be achieved in delay and energy-delay product (EDP), respectively, compared to the traditional CMOS FPGAs.

关键词： Reconfigurable FET field-programmable gate arrays look-up table partitioning algorithm packing algorithm technology mapping performance benchmarking

来源：评论

学校读者我要写书评

暂无评论

A Blockchain-based Profiling System for Exploring Human Factors in Cloud-Edge-End Orchestration 42

A Blockchain-based Profiling System for Exploring Human Fact...

引用

42nd IEEE International Conference on Distributed Computing Systems (ICDCS)

作者： Li, Minghao Cai, Wei Chinese Univ Hong Kong Sch Sci & Engn Shenzhen Peoples R China

ISBN: (数字)9781665488792

ISBN: (纸本)9781665488792

In mobile edge computing (MEC), application partitioning is one of the mast effective measures to leverage computing resources. Due to the user's unpredictable behavior pattern, which is an indispensable factor affecting the performance of an offloading system, traditional partitioning algorithms, considering only purely technical QoS, are no longer enough to meet the increasing concern for the user experience of mobile applications. In this paper, in order to explore human factors in modeling partitioning algorithms for cloud-edge-end orchestration under a safe and trusted environment, we present a blockchain-based profiling system to collect behavioral data from several invited subjects. For discovering user-driven relations of method-level components, we propose a clustering algorithm framework to process each subject's data. Based on the disparate results, we illustrate a case study to prove the usefulness of the system and the data for the orchestration by analyzing the variance of user behavior and the feasibility of applying human factors to the partitioning algorithm.

关键词： Mobile Edge Computing Blockchain partitioning algorithm Orchestration Reverse Engineering

来源：评论

学校读者我要写书评

暂无评论

An efficient distributed MMOG server using 2Layer-Cell method

引用

2nd International Conference on Technologies for E-Learning and Digital Entertainment (Edutainment 2007)

作者： Jang, Su-Min Yoo, Jae-Soo Chungbuk Natl Univ Dept Comp & Commun Engn 48 Gaesin Dong Cheongju South Korea

ISBN: (纸本)9783540730101

In recent years, thousands or even hundreds of thousands players interact with each other in the MMOG (Massively Multi-player Online Game). Therefore MMOG servers have the problem with scalability. To overcome this problem, we propose a new method for MMOG distributed server, denoted as 2Layer-Cell method. 2Layer-Cell method constructed with Upper-Layer and Down-Layer. The Upper-Layer includes important aggregated information of game objects such as virtual space, users, monster, etc. And the Down-layer includes real data of game objects. This paper makes the following contributions. First, it captures these problems of high storage cost and slow processing time for previous methods. Second, it proposes parallel processing strategies that aim to reduce process time. Third, it proposes an efficient partitioning algorithm for distributed servers. Our experiment results show that our method is better scalable than existing methods.

关键词： MMOG game server partitioning algorithm scalability issue parallel & distributed processing communication system traffic

来源：评论

学校读者我要写书评

暂无评论

An allocation management algorithm for DVE system

An allocation management algorithm for DVE system

引用

International Conference on Computer Engineering and Systems

作者： Ali, Asmaa E. E. El-desoky, Ali I. Salah, Mostafa

ISBN: (纸本)9781424458424

Distributed Virtual Environment (DVE) systems model and simulate the activities of thousands of entities interacting in a virtual world over a wide area network. These systems are composed of many servers each of which is responsible to manage multiple clients who want to participate in the virtual world each server delivers the information updated from different clients, to other client in virtual world .Lui & Chan proposed a three step algorithm for balancing the workload among the servers of the DVE, However they didn't take into consideration objects affecting the calculation. This paper presents an object driven partitioning algorithm to improve the performance of Distributed Virtual Environment.

关键词： Distributed virtual environment scalability issue partitioning algorithm load balancing communication reduction linear optimization

来源：评论

学校读者我要写书评

暂无评论

MaxD K-Means: A Clustering algorithm for Auto-generation of Centroids and Distance of Data Points in Clusters

MaxD K-Means: A Clustering Algorithm for Auto-generation of ...

引用

6th International Symposium on Intelligence Computation and Applications (ISICA 2012)

作者： Mohd, Wan Maseri Wan Beg, Abul Hashem Herawan, Tutut Rabbi, Khandakar Fazley Univ Malaysia Pahang Fac Comp Syst & Software Engn Kuantan 26300 Pahang Malaysia

ISBN: (纸本)9783642342882

K-Means is one of the unsupervised learning and partitioning clustering algorithms. It is very popular and widely used for its simplicity and fastness. The main drawback of this algorithm is that user should specify the number of cluster in advance. As an iterative clustering strategy, K-Means algorithm is very sensitive to the initial starting conditions. In this paper, we propose a clustering technique called MaxD K-Means clustering algorithm. MaxD K-Means algorithm auto generates initial k (the desired number of cluster) without asking for input from the user. MaxD K-means also used a novel strategy of setting the initial centroids. The experiment of the Max-D means has been conducted using synthetic data, which is taken from the Llyod's K-Means experiments. The results from the new algorithm show that the number of iteration improves tremendously, and the number of iterations is reduced by confirming an improvement rate is up to 78%.

关键词： K-means algorithm partitioning algorithm Clustering MaxD K-means Data Mining

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共8页 << < 1 2 3 4 5 6 7 8 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：