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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,293 篇 会议
29 篇 期刊文献
8 册 图书

馆藏范围

2,330 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,456 篇 工学
- 1,377 篇 计算机科学与技术...
- 673 篇 软件工程
- 295 篇 电气工程
- 290 篇 信息与通信工程
- 125 篇 电子科学与技术（可...
- 98 篇 网络空间安全
- 75 篇 控制科学与工程
- 57 篇 动力工程及工程热...
- 40 篇 生物工程
- 34 篇 机械工程
- 21 篇 材料科学与工程（可...
- 21 篇 建筑学
- 16 篇 生物医学工程（可授...
- 15 篇 光学工程
- 14 篇 环境科学与工程（可...
- 12 篇 仪器科学与技术
- 11 篇 土木工程
409 篇 理学
- 307 篇 数学
- 49 篇 物理学
- 46 篇 生物学
- 43 篇 系统科学
- 37 篇 统计学（可授理学、...
- 11 篇 地球物理学
- 9 篇 化学
214 篇 管理学
- 157 篇 管理科学与工程(可...
- 111 篇 工商管理
- 65 篇 图书情报与档案管...
30 篇 经济学
- 30 篇 应用经济学
28 篇 法学
- 25 篇 社会学
18 篇 医学
- 14 篇 临床医学
8 篇 农学
7 篇 教育学
3 篇 文学
1 篇 艺术学

主题

530 篇 computer archite...
204 篇 high performance...
201 篇 concurrent compu...
173 篇 hardware
173 篇 distributed comp...
164 篇 application soft...
146 篇 computer science
133 篇 parallel process...
126 篇 computational mo...
125 篇 delay
117 篇 costs
115 篇 computer network...
109 篇 grid computing
96 篇 bandwidth
91 篇 laboratories
77 篇 processor schedu...
67 篇 scalability
66 篇 resource managem...
62 篇 cloud computing
56 篇 distributed comp...

机构

7 篇 univ chicago dep...
7 篇 computer science...
7 篇 carnegie mellon ...
6 篇 univ wisconsin m...
6 篇 mathematics and ...
6 篇 intel corp santa...
6 篇 mathematics and ...
6 篇 changsha univers...
6 篇 institute of com...
5 篇 penn state univ ...
5 篇 univ toronto on
5 篇 school of electr...
5 篇 georgia inst tec...
5 篇 sandia national ...
5 篇 univ illinois ur...
5 篇 computer systems...
5 篇 college of compu...
5 篇 department of co...
4 篇 department of co...
4 篇 school of comput...

作者

9 篇 i. foster
8 篇 mutlu onur
7 篇 chong frederic t...
7 篇 guedes dorgival
7 篇 zhou huiyang
7 篇 magoules frederi...
7 篇 prasanna viktor ...
6 篇 navaux philippe ...
6 篇 patt yale n.
6 篇 torrellas josep
6 篇 kim nam sung
6 篇 d.k. panda
6 篇 wen-mei w. hwu
6 篇 r.k. iyer
5 篇 xie yuan
5 篇 loh gabriel h.
5 篇 schwan karsten
5 篇 li chao
5 篇 ahamed abal-kass...
5 篇 panda dhabaleswa...

语言

2,313 篇 英文
17 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings - 16th Symposium on Computer Architecture and High Performance Computing"

共 2330 条记录，以下是471-480 订阅

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

详细简洁

排序：

2017 11th IEEE/ACM International symposium on Networks-on-Chip, NOCS 2017

2017 11th IEEE/ACM International Symposium on Networks-on-Ch...

引用

11th IEEE/ACM International symposium on Networks-on-Chip, NOCS 2017

ISBN: (纸本)9781450349840

the proceedings contain 20 papers. the topics discussed include: minimally buffered deflection routing with in-order delivery in a torus;distributed and dynamic shared-buffer router for high-performance interconnect;a novel approach to reduce packet latency increase caused by power gating in network-on-chip;improving the reliability and energy-efficiency of high-bandwidth photonic NoC architectures with multilevel signaling;energy and area efficient near field inductive coupling: a case study on 3D NoC;achieving lightweight multicast in asynchronous NoCs using a continuous-time multi-way read buffer;BiNoCHS: bimodal network-on-chip for CPU-GPU heterogeneous systems;synchoricity and NOCs could make billion gate custom hardware centric SOCs affordable;system-level design of networks-on-chip for systems-on-chip;addressing extensibility and fault tolerance in CAN-based automotive systems;JAMS: jitter-aware message scheduling for FlexRay automotive networks;hybrid automotive in-vehicle networks;fairness-oriented and location-aware NUCA for many-core SoC;on the accuracy of stochastic delay bound for network on chip;SMART: a scalable mapping and routing technique for power-gating in NoC routers;on runtime communication- and thermal-aware application mapping in 3D NoC;3D NoC-enabled heterogeneous manycore architectures for accelerating CNN training: performance and thermal trade-offs;rethinking NoCs for spatial neural network accelerators;and adaptive manycore architectures for big data computing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Is Intel high performance analytics toolkit a good alternative to Apache Spark?

Is Intel high performance analytics toolkit a good alternati...

引用

IEEE International symposium on Network computing and Applications

作者： Rafael Aquino de Carvalho Alfredo Goldman Gerson Geraldo H. Cavalheiro Institute of Mathematic and Statistic (IME) University of são Paulo (USP) São Paulo Brazil Graduate Program in Computer Science (PPGC) Universidade Federal de Pelotas (UFPel) Pelotas Brazil

this paper compares the performance and stability of two Big Data processing tools: the Apache Spark and the high performance Analytics Toolkit (HPAT). the comparison was performed using two applications: a unidimensional vector sum and the K-means clustering algorithm. the experiments were performed in distributed and shared memory environments with different numbers and configurations of virtual machines. By analyzing the results we are able to conclude that HPAT has performance improvements in relation to Apache Spark in our case studies. We independently validated the results and potential presented by the HPAT developers. We also provide an analysis of both frameworks in the presence of failures.

关键词： Sparks Big Data Clustering algorithms Databases Programming Logistics

来源：评论

学校读者我要写书评

暂无评论

performance Prediction of Spark Based on the Multiple Linear Regression Analysis 8th

Performance Prediction of Spark Based on the Multiple Linear...

引用

8th International symposium on Parallel architectures, Algorithms, and Programming (PAAP)

作者： Dong, Lu Li, Peng Xu, He Luo, Baozhou Mi, Yu Nanjing Univ Posts & Telecommun Sch Comp Sci & Technol Nanjing 210003 Peoples R China Jiangsu High Technol Res Key Lab Wireless Sensor Nanjing 210003 Jiangsu Peoples R China

ISBN: (纸本)9789811064425;9789811064418

It is crucial to evaluate performance of a cloud platform and determine the main factors influencing the property. Moreover, the analysis results of related performance indicators can be applied to making theoretical predictions about the performance status of the cloud platform. this work mainly focuses on researching the interrelations between the performance indicators based on the Spark technology of the cloud platform and the load performance of the cluster, and furthermore makes effective predictions for the load performance. Firstly, we put forward the analytic frameworks of Spark performance analysis, the specific indicators analysis as well as the prediction models towards the cluster load. Secondly, with respect to the evaluation indicators, we explore the basis for their selections as well as their concrete implications, and then objectively, accurately calculate the correlation formula between the practically produced performance parameters and the load performance of the cluster when the Spark cluster performs the batch applications utilizing the MLR (Multiple Linear Regression) method, and, therefore, determine the main factors impacting the load performance. Finally, we predict the load value utilizing the Spark indicator analysis and the load prediction model. the results indicate that accuracy is up to 92.307%. Consequently, the solution presented in this paper predicts the cluster load value with effetioncy.

关键词： Cloud computing Spark Indicator analysis performance prediction Multiple linear regression

来源：评论

学校读者我要写书评

暂无评论

SINGLE pass spectral sparsification in dynamic streams

SINGLE pass spectral sparsification in dynamic streams

引用

作者： Kapralov, M. Lee, Y.T. Musco, C.N. Musco, C.P. Sidford, A. LausanneCH-1015 Switzerland Department of Mathematics and Electrical Engineering and Computer Science Massachusetts Institute of Technology CambridgeMA02139 United States Department of Management Science and Engineering Stanford University StanfordCA94305 United States

We present the first single pass algorithm for computing spectral sparsifiers for graphs in the dynamic semi-streaming model. Given a single pass over a stream containing insertions and deletions of edges to a graph G, our algorithm maintains a randomized linear sketch of the incidence matrix of G into dimension O(1/ϵ2 n polylog(n)). Using this sketch, at any point, the algorithm can output a (1 ± ϵ) spectral sparsifier for G with high probability. While O( 1/ϵ2 n polylog(n)) space algorithms are known for computing cut sparsifiers in dynamic streams [K. J. Ahn, S. Guha, and A. McGregor, in proceedings of the 31st ACM symposium on Principles of Database Systems, 2012, pp. 5-14;A. Goel, M. Kapralov, and I. Post, arXiv:1203.4900, 2002] and spectral sparsifiers in insertion-only streams [J. A. Kelner and A. Levin, theory Comput. Syst., 53 (2013), pp. 243-262], prior to our work, the best known single pass algorithm for maintaining spectral sparsifiers in dynamic streams required sketches of dimension ω (1/ϵ2 n5/3) [K. J. Ahn, S. Guha, and A. McGregor, in proceedings of the 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, 2013, pp. 1-10]. To achieve our result, we show that using a coarse sparsifier for G and a linear sketch of G's incidence matrix, it is possible to sample edges by effective resistance, obtaining a spectral sparsifier of arbitrary precision. Sampling from the sketch requires a novel application of l2=l2 sparse recovery, a natural extension of the l0 methods used for cut sparsifiers in [K. J. Ahn, S. Guha, and A. McGregor, in proceedings of the 31st ACM symposium on Principles of Database Systems, 2012, pp. 5-14]. Recent work on row sampling for matrix approximation gives a recursive approach for obtaining the required coarse sparsifiers [G. L. Miller and R. Peng, arXiv:1211.2713v1, 2012]. Under certain restrictions, our approach also extends to the problem of maintaining a spectral approximation for a gen

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

A Unified Framework for Multidisciplinary Design Optimization Application

A Unified Framework for Multidisciplinary Design Optimizatio...

引用

International symposium on Distributed computing and Applications to Business, Engineering and Science (DCABES)

作者： Ning Zhang Baowei Song Peng Wang School of Marine Science and Technology Northwestern Polytechnical University Xi'an PR China

ISBN: (纸本)9781538621639

Research on the development of optimization modeling systems is relatively mature, but for multidisciplinary design optimization (MDO) application there are still some issues of accessibility and high efficiency. Based on the existing MDO algorithms, this paper presents a unified framework for formulating and solving the multidisciplinary optimization problem with various MDO methods in an efficient, simple and friendly manner. A multidisciplinary descriptive language is also proposed at the same time for the unified framework. the framework is designed to make researchers focus on the multidisciplinary optimization problem, rather than on algorithms implementation and software programming. Using the unified framework, researchers can solve the multidisciplinary optimization problem by creating a configuration file without any coding. the framework has integrated a variety of MDO architectures and also provides interface for other developers to add new optimization algorithm. Furthermore, examples demonstrate the usage of the framework as well as the advantages of the unified framework.

关键词： computer architecture Software Couplings Design optimization Programming Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Advanced interest flooding attacks in named-data networking

Advanced interest flooding attacks in named-data networking

引用

IEEE International symposium on Network computing and Applications

作者： Salvatore Signorello Samuel Marchal Jérôme François Olivier Festor Radu State Universite du Luxembourg Luxembourg LU Aalto University Finland Inria Nancy Grand Est France Telecom Nancy Université de Lorraine France SnT University of Luxembourg

the Named-Data Networking (NDN) has emerged as a clean-slate Internet proposal on the wave of Information-Centric Networking. Although the NDN's data-plane seems to offer many advantages, e.g., native support for multicast communications and flow balance, it also makes the network infrastructure vulnerable to a specific DDoS attack, the Interest Flooding Attack (IFA). In IFAs, a botnet issuing unsatisfiable content requests can be set up effortlessly to exhaust routers' resources and cause a severe performance drop to legitimate users. So far several countermeasures have addressed this security threat, however, their efficacy was proved by means of simplistic assumptions on the attack model. therefore, we propose a more complete attack model and design an advanced IFA. We show the efficiency of our novel attack scheme by extensively assessing some of the state-of-the-art countermeasures. Further, we release the software to perform this attack as open source tool to help design future more robust defense mechanisms.

关键词： Monitoring Electronic mail computer architecture Routing protocols Robustness

来源：评论

学校读者我要写书评

暂无评论

Leveraging high performance computing for Bioinformatics: A Methodology that Enables a Reliable Decision-Making 16

Leveraging High Performance Computing for Bioinformatics: A ...

引用

16th IEEE/ACM International symposium on Cluster, Cloud and Grid computing (CCGrid)

作者： Ferro, Mariza Nicolas, Marisa F. Saji, Quadalupe del Rosario Q. Mury, Antonio R. Schulze, Bruno Natl Lab Sci Comp Petropolis RJ Brazil

ISBN: (纸本)9781509024537

Bioinformatics could greatly benefit from increased computational resources delivered by high performance computing. However, the decision-making about which is the best architecture to deliver good performance for a set of Bioinformatics applications is a hard task. the traditional way is finding the architecture with a high theoretical peak of performance, obtained with benchmark tests. But, this is not an assured way for this decision, because each application of Bioinformatics has different computational requirements, which frequently are much different from usual benchmarks. We developed a methodology that assists researchers, even when their specialty is not high performance computing, to define the best computational infrastructure focused on their set of scientific application requirements. For this purpose, the methodology enables to define representative evaluation tests, including a model to define the correct benchmark, when the tests endorsed by the methodology could not be fully used. Further, a Gain Function allows a reliable decision-making based on the performances of a set of applications and architectures. It is also possible to consider the relative importance between applications and also between cost and performance.

关键词： high performance computing performance evaluation scientific applications bioinformatics

来源：评论

学校读者我要写书评

暂无评论

A Review of Recent Developments in NOMA & SCMA Schemes for 5G Technology

A Review of Recent Developments in NOMA & SCMA Schemes for 5...

引用

International symposium on Distributed computing and Applications to Business, Engineering and Science (DCABES)

作者： Miznah H. Alshammary Fahad A. Alanezi Dept. computer science King's College London U.K. Dept. computer science Bedfordshire University London U.K.

ISBN: (纸本)9781538621639

the race for developing 5G technology has taken a multiorganizational competition in the recent past, where the professional bodies, private organizations, and research units are carrying out research in developing various technologies relating to 5G. Multiple Access Scheme is one of the most important aspects that have been an area of interest for the majority as 5G is expected to accommodate large number of users with high speed of data transmission. this paper review the latest developments in the field of research concerning Sparse code multiple access (SCMA) and Non-orthogonal multiple access (NOMA). Ann extensive research has been carried out to identify the recent developments and their results are presented in this paper. this study has found that most of the recent developments in SCMA were focusing on achieving lower complexity levels, low BER, and effective and efficient energy utilization, and the recent developments identified regarding NOMA focused especially on the performance attributes like spectral efficiency, spatial efficiency, low BER and latency, and resource allocation and multiple access.

关键词： NOMA 5G mobile communication Complexity theory Resource management Receivers Organizations Uplink

来源：评论

学校读者我要写书评

暂无评论

Predicting and choosing alternatives of route updates per QoS VNF in SDN

Predicting and choosing alternatives of route updates per Qo...

引用

IEEE International symposium on Network computing and Applications

作者： Sergei Frenkel Daniel Khankin Alona Kutsyy Institute of Informatics Problems of FRC “Computer Science and Control” Russian Academy of Sciences Moscow Russia Department of Software Engineering Shamoon College of Engineering Beer-Sheva Israel Department of Computer Science Ben-Gurion University of the Negev Beer-Sheva Israel

In this work, we model route updates as part of Quality of Service (QoS) Virtual Network Function (VNF) in Software-Defined Networking (SDN) architecture. In SDN, the control plane and the data plane are decoupled. this allows high flexibility by providing abstractions for network management applications and being directly programmable. However, reconfiguration and updates of a network are sometimes inevitable due to policy changes, maintenance or failures. the update process should not form congestion in the network, nor result in time delays, and not lose any packets. It may be the case that there exist several alternatives for a route update. In the extreme case, there is a chance that one of the possible existing routes is much longer, however, a more reliable one, and as such will update faster. Taking into account the random nature of the network functioning, we supplement the proposed algorithm by Delaet et al. for route updates with a technique based on Markov chains. In our extension of the algorithm, we describe the transmission of packets through a chosen route for comparing the update process for all the possible alternative routes. the virtualized service implementing the update algorithm will provide a recommendation for an optimal choice of a route based on the performed calculations. Fundamentally, we create a QoS VNF for seamlessly updating a route, regarding network parameters, and taking into consideration the complexity and possible failures of updating a route.

关键词： Quality of service Markov processes Routing Delays Nickel Algorithm design and analysis Reliability

来源：评论

学校读者我要写书评

暂无评论

Speeding Up Stencil Computations with Kernel Convolution 28

Speeding Up Stencil Computations with Kernel Convolution

引用

28th IEEE International symposium on computer architecture and high performance computing (SBAC-PAD)

作者： Januario, Guilherme C. Rosenburg, Bryan S. Park, Yoonho Perrone, Michael Moreira, Jose Carvalho, Tereza C. M. B. IBM Corp TJ Watson Res Ctr Yorktown Hts NY 10598 USA Univ Sao Paulo Polytech Sch Lab Sustainabil Sao Paulo SP Brazil

ISBN: (纸本)9781509061082

A technique to speed up stencil computation is introduced. Computation and data reuse schemes are developed for its application to 1- and 3-dimensional stencils. the approach traverses the data domain fewer times than a state-of-the-art, straightforward iterative stencil implementation would. performance results are shown for a variety of platforms, exemplifying how it can be straightforwardly applied with existing techniques and frameworks. the technique, named Aggregate Stencil-Loop Iteration (ASLI), works by applying a stencil obtained by the original stencil operator convolved with itself one or more times. this more complex operator creates new opportunities for in-register data reuse and increases the FLOPs-to-load ratio. the total number of FLOPs decreases for 1D but increases for 2D and 3D star-shaped stencils. In both scenarios, speed-up relative to the state-of-the-art is achieved. ASLI is relatively easy to implement and works synergistically with existing methods to optimize stencil computations.

关键词： high-performance computing Numeric kernels optimization stencil computation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共233页 << < 44 45 46 47 48 49 50 51 52 53 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：