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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,739 篇 会议
23 篇 期刊文献
7 册 图书

馆藏范围

1,769 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,208 篇 工学
- 1,099 篇 计算机科学与技术...
- 696 篇 软件工程
- 222 篇 信息与通信工程
- 164 篇 电气工程
- 122 篇 电子科学与技术（可...
- 98 篇 控制科学与工程
- 82 篇 生物工程
- 61 篇 动力工程及工程热...
- 49 篇 机械工程
- 46 篇 生物医学工程（可授...
- 32 篇 交通运输工程
- 31 篇 光学工程
- 29 篇 仪器科学与技术
- 25 篇 环境科学与工程（可...
- 24 篇 化学工程与技术
- 21 篇 网络空间安全
- 18 篇 安全科学与工程
- 17 篇 力学（可授工学、理...
498 篇 理学
- 321 篇 数学
- 96 篇 生物学
- 83 篇 系统科学
- 78 篇 物理学
- 72 篇 统计学（可授理学、...
- 34 篇 化学
270 篇 管理学
- 183 篇 管理科学与工程(可...
- 121 篇 图书情报与档案管...
- 116 篇 工商管理
62 篇 医学
- 55 篇 临床医学
36 篇 法学
- 35 篇 社会学
32 篇 经济学
- 32 篇 应用经济学
8 篇 教育学
6 篇 农学
3 篇 文学
2 篇 军事学

主题

198 篇 computer archite...
80 篇 hardware
79 篇 computational mo...
66 篇 high performance...
57 篇 cloud computing
50 篇 grid computing
41 篇 distributed comp...
41 篇 field programmab...
40 篇 bandwidth
37 篇 kernel
37 篇 graphics process...
34 篇 resource managem...
34 篇 computer network...
33 篇 performance eval...
32 篇 throughput
31 篇 computer science
31 篇 application soft...
31 篇 analytical model...
30 篇 program processo...
29 篇 supercomputers

机构

26 篇 college of compu...
19 篇 university of ch...
14 篇 school of comput...
10 篇 college of compu...
9 篇 school of comput...
9 篇 college of compu...
8 篇 school of comput...
7 篇 school of data a...
7 篇 school of comput...
7 篇 institute of com...
6 篇 computer network...
6 篇 tsinghua univers...
6 篇 school of cyber ...
6 篇 changsha univers...
5 篇 university of sc...
5 篇 skl of computer ...
5 篇 computer science...
5 篇 school of comput...
5 篇 hubei province k...
5 篇 zhongguancun lab...

作者

11 篇 duan yucong
7 篇 zhang tao
7 篇 li kenli
7 篇 xu xiaolong
6 篇 wang wei
6 篇 gao guang r.
5 篇 li peng
5 篇 yunquan zhang
5 篇 liu qin
5 篇 wang dong
5 篇 bader david a.
5 篇 liu ruicheng
5 篇 zhang rui
5 篇 wan shouhong
5 篇 wu jigang
5 篇 panda dhabaleswa...
5 篇 zhang jie
5 篇 wang xiaoliang
5 篇 chen long
5 篇 li wei

语言

1,714 篇 英文
51 篇 其他
3 篇 中文
1 篇 波兰文

检索条件"任意字段=21st International Symposium on Computer Architecture and High Performance Computing"

共 1769 条记录，以下是631-640 订阅

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

详细简洁

排序：

Building quick resource index list using wordnet and high-performance computing resource ontology towards efficient resource discovery 21

Building quick resource index list using wordnet and high-pe...

引用

21st IEEE international Conference on high performance computing and Communications, 17th IEEE international Conference on Smart City and 5th IEEE international Conference on Data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Zhou, Aolong Ren, Kaijun Li, Xiaoyong Zhang, Wen Ren, Xiaoli College of Meteorology and Oceanology National University of Defense Technology China College of Computer National University of Defense Technology China

ISBN: (纸本)9781728120584

high-performance computing (HPC) has played a significant role in scientific discovery and technological innovation, but resources distributed in cross-regional supercomputing centers are still used inefficiently and hard to be managed uniformly, due to various challenging issues like the complex resource types, the heterogeneous interfaces of the resource management software, the inefficient coordination of software and hardware, and the lack of available and standardized description specification model. In this paper, we first propose a HPC resource ontology model called HPCRO to define the concepts of hardware resources and software resources, and specifies types, attributes, logical relations, and data transfer among resources. Moreover, based on the proposed model, we further propose a method called WordNet-based Quick Resource Index List (WQRIL) to support efficient HPC resources discovery. Specifically, the method extends and optimizes the existing method with Quick Service Quick List (QSQL) by extracting synonyms of ontology concepts from WordNet. The method not only can provide a unified representation of HPC resources, but also can support semantic-based fuzzy matching. More importantly, it improves the usability and utilization of hardware and software resources effectively in cross-regional high-performance computing centers. Extensive experiments have been conducted to verify the effectiveness and efficiency of our proposals. © 2019 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Hybrid fault tolerance model for cloud dependability 21

Hybrid fault tolerance model for cloud dependability

引用

作者： Azaiez, Meriem Chainbi, Walid Ghedira, Khaled SOIE-COSMOS Laboratory National School of Computer Science University of Manouba Manouba Tunisia National Engineering School of Sousse University of Sousse Sousse Tunisia

ISBN: (纸本)9781728120584

Cloud computing is gaining an increasing popularity and the number of user's applications and interactions with Cloud resources have grown considerably making Cloud services more susceptible to failure. Therefore, fault tolerance is an important property in order to achieve reliability, availability and required quality of service. Several studies were interested in Cloud fault tolerance issues. These studies proposed solutions including checkpoint and replication that are focused on failure of a single Cloud resource, namely virtual machines, and virtualization issues. Such solutions are insufficient given Cloud complexity. Unlike previous work, we propose a solution that takes into consideration not only virtual machines but also physical machines. Our solution is a hybrid fault tolerance strategy that inherits good features and overcome the limitations of traditional fault tolerance strategies. We evaluate the efficiency of our fault tolerance strategy compared to replication and checkpoint strategies by using CloudSim and we prove that our strategy leads to better results. © 2019 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

A dynamic bypass approach to realize power efficient network-on-chip 21

A dynamic bypass approach to realize power efficient network...

引用

作者： Wang, Peng Niknam, Sobhan Ma, Sheng Wamg, Zhiying stefanov, Todor Leiden Institute of Advanced Computer Science Leiden University Netherlands State Key Laboratory of High Performance Computing National University of Defense Technology China

ISBN: (纸本)9781728120584

high power consumption becomes the major bottleneck that prevents applying Network-on-Chips (NoCs) on future many-core systems. Power gating is an effective way to reduce the power consumption of a NoC. However, conventional power gating approaches cause significant packet latency increase as well as additional power consumption overhead due to the power gating mechanism. One comprehensive way to reduce these negative impacts is to bypass the powered-off routers in a NoC to transfer packets. Therefore, in this paper, we propose a dynamic bypass (D-bypass) approach, which is based on a reservation mechanism to allow different upstream routers to forward packets through the same powered-off router at different times. With this feature, our D-bypass power gating approach overcomes the drawbacks in related power gating approaches. Compared with a conventional NoC without power gating, our D-bypass approach causes only 2.55% performance penalty, which is less than 28.67%, 19.26%, 7.24%, and 6.69% penalties in related approaches. With small hardware overhead, our approach just consumes on average 22.23% of total power consumption in a NoC, which is slightly better compared to 27.06%, 23.89%, 26.45%, and 24.70% total power consumption in related approaches. © 2019 IEEE.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

Time series join on most correlated subsequences using mapreduce 21

Time series join on most correlated subsequences using mapre...

引用

作者： Chen, Lili Rong, Chuitian Feng, Jinghua School of Computer Science and Technology Tianjin Polytechnic University Tianjin China College of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781728120584

In recent years, a large amount of time series have been generated in various industries, and time series contains important information. Time series refers to a series of ordered real numbers that were collected with equal time intervals. Time series join on subsequences means to find the most similar or most correlated subsequence pairs from two time series. Joining two time series on subsequences using Pearson correlation coefficient can provide more useful information than other similarity measures. However, finding the most correlated subsequences is a time consuming task. In order to decrease the runtime of finding the most correlated subsequence pairs, we propose an approach adopting MapReduce programming model in this paper. Our method includes four steps. First, computing the shift cross product matrix of two time series using a parallel FFT algorithm. Second, splitting the two time series into multiple subsequences. Third, partitioning the shift cross product matrix into blocks according to the time series splitting method. Finally, the join operations on subsequences are performed parallel. In experiment, we conducted extensive tests on real datasets to verify the effectiveness of our approach. © 2019 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Model checking CTLK based on knowledge-oriented petri nets 21

Model checking CTLK based on knowledge-oriented petri nets

引用

作者： He, Leifeng Liu, Guanjun Department of Computer Science Tongji University Shanghai201804 China

ISBN: (纸本)9781728120584

We define Knowledge-oriented Petri Nets (KPN) to model and analyze multi-agent systems (MAS) especially from the perspective of privacy and security. A KPN is a special Petri net in which some places are used to represent knowledges. Consequently, KPN can formally represent not only the interaction/collaboration process of multiple agents but also their epistemic evolutions. These epistemic evolutions are closely related with the privacy and security of MAS. For those requirements of privacy or security, we use Computation Tree Logic of Knowledge (CTLK) to specify them. We define the similar reachability graphs of KPN and then construct the equivalence classes of knowledges for each agent. Based on them, we design the model checking algorithms to verify CTLK formulas efficiently. Examples of privacy protocols illustrate the usefulness of our model and method. © 2019 IEEE.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Unsupervised dimension reduction using supervised orthogonal discriminant projection for clustering 21

Unsupervised dimension reduction using supervised orthogonal...

引用

作者： Yan, Leilei Zhang, Li School of Computer Science and Technology Soochow University Suzhou China

ISBN: (纸本)9781728120584

This paper proposes a novel unsupervised dimensionality reduction method for clustering by combining supervised orthogonal discriminant projection (SODP) and K-means selective clustering ensemble, called SODP-KSCE. The novel algorithm, operating in an iterative manner, adaptively optimizes the clustering results and learns a subspace with optimal separation. To enhance the stability of K-means, SODP-KSCE adopts ensemble learning. Moreover, a negentropy increment (NI) index is introduced to measure the clustering performance. The K means clustering ensemble algorithm is performed in the low-dimensional subspaces to generate pseudo class labels for unlabeled data, which are then adopted to guide the dimension reduction process of SODP in the original space. Experimental results on multiple data sets indicate the effectiveness of SODPKSCE. © 2019 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

An asynchronous ADMM algorithm for distributed optimization with dynamic scheduling strategy 21

An asynchronous ADMM algorithm for distributed optimization ...

引用

作者： Jiang, Shenghong Lei, Yongmei Wang, Shuqing Wang, Dongxia School of Computer Engineering and Science Shanghai University Shanghai China

ISBN: (纸本)9781728120584

The Alternating Direction Multiplier Method (ADMM) is an algorithm for solving large-scale machine learning optimization problems. In order to reduce the communication delay in a distributed environment, asynchronous distributed ADMM (AD-ADMM) was proposed. However, low convergence speed and the master-slave communication structure greatly reduce the performance of AD-ADMM in multi-core cluster. In this paper, we propose a new method to speed up the convergence of ADMM. The proposed method accelerates the convergence speed by automatically deciding the optimization algorithms needed for the solution of ADMM subproblem in each iteration. The dynamic scheduling strategy chooses the optimization algorithm mainly based on the primal residual and the dual residual. In addition, we also combine the hierarchical communication structure with the strategy to guarantee the efficiency. Experiments in the ZiQiang 4000 cluster experimental environment show that the dynamic scheduling strategy based on hierarchical communication structure for solving ADMM subproblem improves the convergence speed and the communication efficiency of the algorithm efficiently. © 2019 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Time-efficient task caching strategy for multi-server mobile edge cloud computing 21

Time-efficient task caching strategy for multi-server mobile...

引用

作者： Chen, Weiwei Han, Limin School of Computer and Electrical Engineering Hunan University Changsha Hunan China

ISBN: (纸本)9781728120584

Caching tasks to mobile edge cloud (MEC) servers is proven an effective solution for enabling request-duplicate applications on mobile devices (MDs). Moreover, in view of many users in the same proximity are more inclined to require the same computation tasks, reasonable task deployment strategy can reduce task response delay significantly. This promotes us to design an effective task caching policy to save the task computing time for the same computation requests. In this paper, we consider the scenario where multiple mobile devices request computing tasks from a fixed task set to multiple servers, including MEC servers, agent server and remote center cloud server. MEC servers can share the cached contents through the proxy server to serve the MDs. Only when there is no cache for a task in MEC servers, MD sends the computation request to remote center server. The goal of this paper is to propose an effective task caching strategy for the MEC servers to minimize the overall response time at the mobile terminal side. To this end, we propose the multi-user multi-server task caching scheme (MUMSC) for the mobile edge computing system. Simulation results show that compared with other caching policies, MUMSC is the the optimal in response time and task hit ratio. © 2019 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

Bottleneck-aware task scheduling based on per-stage and multi-ml profiling 21

Bottleneck-aware task scheduling based on per-stage and mult...

引用

作者： Barreto Goes Perez, Tiago Zhou, Xiaobo Liu, Liu Ding, Zhijun Department of Computer Science University of Colorado SpringsCO United States Departmentof Computer Science Tongji University Shanghai China

ISBN: (纸本)9781728120584

In distributed computing clusters, assigning tasks and jobs to nodes that could lead to bottlenecks is detrimental to performance. Recent research has made extensive use of machine learning techniques to profile workloads, in order to predict their performance and schedule tasks to mitigate bottlenecks. However, those solutions take the entire workload as a single event, profiling at a coarse grained level and resulting in losses to model accuracy that limit the power of bottleneck detection to further improve on task allocation and cluster performance. Popular data analytics frameworks such as Spark utilize directed acyclic graphs to break down jobs into several smaller components such as stages, which allows for finer granularity for profiling. In this paper, we propose and develop Gargalo, a new bottleneck aware scheduler, that leverages a fine-grained, per-stage multi-machine learning profiling. As such we can find better model fitting for each stage of the job execution, and give the scheduler more accurate information to assign tasks to nodes. We leverage the use of multiple machine learning techniques for modeling performance and through a consensus we can combine the results for increased accuracy in each step. Our experiments with a Spark implementation, utilizing several popular benchmarking workloads, show that Gargalo improves speedup by up to 81% over the state-of-the-art bottleneck aware scheduler, 164% over the default speculation mechanism, and accuracy of up to 97% in predicting bottleneck detection. Gargalo is robust across different scenarios. © 2019 IEEE.

关键词： Data Analytics

来源：评论

学校读者我要写书评

暂无评论

Direction of arrival estimation method based on first-order differential microphone array 21

Direction of arrival estimation method based on first-order ...

引用

作者： Yang, Juntong Liu, Zhigang Qi, Haoyang Qi, Shengyuan School of Computer and Communication Engineering Northeastern University Qinhuangdao China

ISBN: (纸本)9781728120584

In recent years, it is valuable to accurately estimate the direction of arrival (DOA) of sound source signals in noisy environment, especially for small-sized microphone arrays. Therefore, the Capon beamforming method based on small-sized array is an effective solution. However, the DOA estimation accuracy is greatly reduced, when the Capon beamforming algorithm is applied to a small-sized array. In order to improve the DOA estimation accuracy of the traditional Capon algorithm in small-sized arrays, the differential microphone arrays (DMAs) is used as a spatial filter, and the spatial spectrum of the array output signal is calculated by the Capon algorithm. The simulation results show that the proposed method can improves the anti-noise performance of the traditional Capon algorithm and the accuracy of the traditional Capon algorithm in estimating the direction of arrival in small-sized arrays. © 2019 IEEE.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 60 61 62 63 64 65 66 67 68 69 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：