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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

954 篇 会议
20 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

654 篇 工学
- 596 篇 计算机科学与技术...
- 238 篇 软件工程
- 190 篇 电气工程
- 76 篇 电子科学与技术（可...
- 61 篇 信息与通信工程
- 31 篇 控制科学与工程
- 23 篇 动力工程及工程热...
- 11 篇 机械工程
- 11 篇 仪器科学与技术
- 8 篇 生物医学工程（可授...
- 7 篇 力学（可授工学、理...
- 7 篇 环境科学与工程（可...
- 7 篇 安全科学与工程
- 5 篇 材料科学与工程（可...
- 5 篇 建筑学
- 5 篇 交通运输工程
- 5 篇 生物工程
- 5 篇 网络空间安全
91 篇 理学
- 53 篇 数学
- 27 篇 系统科学
- 18 篇 物理学
- 8 篇 生物学
- 6 篇 统计学（可授理学、...
- 5 篇 化学
89 篇 管理学
- 77 篇 管理科学与工程(可...
- 32 篇 工商管理
- 14 篇 图书情报与档案管...
10 篇 经济学
- 10 篇 应用经济学
8 篇 法学
- 7 篇 社会学
6 篇 医学
4 篇 教育学
- 4 篇 教育学
3 篇 文学
2 篇 农学
2 篇 军事学

主题

75 篇 computer archite...
62 篇 hardware
60 篇 parallel process...
55 篇 multicore proces...
48 篇 computational mo...
37 篇 concurrent compu...
37 篇 high performance...
34 篇 instruction sets
34 篇 multi-core
33 篇 graphics process...
32 篇 cloud computing
31 篇 scalability
30 篇 parallel program...
29 篇 programming
29 篇 program processo...
29 篇 graphics process...
27 篇 kernel
25 篇 embedded systems
24 篇 conferences
24 篇 resource managem...

机构

9 篇 ohio state univ ...
5 篇 saitama univ gra...
4 篇 ohio state univ ...
3 篇 saitama universi...
3 篇 vienna universit...
3 篇 oak ridge natl l...
3 篇 graduate school ...
3 篇 fraunhofer igd t...
3 篇 center for compu...
3 篇 karlsruhe instit...
3 篇 oak ridge natl l...
3 篇 beihang univ sch...
2 篇 penn state univ ...
2 篇 uppsala univ upp...
2 篇 seoul natl univ ...
2 篇 coll william & m...
2 篇 china university...
2 篇 waseda univ dept...
2 篇 tsinghua univers...
2 篇 national univers...

作者

6 篇 takuya azumi
6 篇 panda d. k.
6 篇 azumi takuya
5 篇 subramoni hari
5 篇 shingo igarashi
5 篇 benini luca
4 篇 tatsuya horiguch...
4 篇 tasuku ishigooka
4 篇 petiton serge
4 篇 el-ghazawi tarek
4 篇 sato mitsuhisa
4 篇 amano hideharu
3 篇 liu bo
3 篇 klasky scott
3 篇 dongarra jack
3 篇 varbanescu ana l...
3 篇 qian depei
3 篇 sriram krishnamo...
3 篇 weichslgartner a...
3 篇 alam sadaf r.

语言

967 篇 英文
8 篇 其他
1 篇 中文

检索条件"任意字段=IEEE International Workshop on Multi-/Many-core Computing Systems"

共 976 条记录，以下是701-710 订阅

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

详细简洁

排序：

multi-objective design of highly interpretable fuzzy rule-based classifiers with semantic cointension

Multi-objective design of highly interpretable fuzzy rule-ba...

引用

international workshop on Genetic and Evolutionary Fuzzy systems

作者： Cannone, R. Alonso, J.M. Magdalena, L. Department of Informatics University of Bari Bari 70125 Italy European Centre for Soft Computing Mieres 33600 Spain

ISBN: (纸本)9781612840505

Although recently there has been many papers dealing with how to characterize and assess interpretability, there is still a lot of work to be done. Interpretability assessment is usually addressed by evaluating the complexity and/or readability of fuzzy rule-based systems. However, comprehensibility is usually not taken into account because it implies more cognitive aspects which are difficult to formalize and to deal with. In this work we show the importance of considering not only readability but also comprehensibility during the design process of fuzzy systems. We introduce the use of a novel index for evaluating comprehensibility in the context of a three-objective evolutionary framework for designing highly interpretable fuzzy rule-based classifiers. It is named as logical view index (LVI) and it is based on a semantic cointension approach. The proposed evolutionary algorithm consists of embedding the HILK (Highly Interpretable Linguistic Knowledge) fuzzy modeling methodology into the classical NSGA-II with the aim of maximizing accuracy, readability, and comprehensibility of the generated fuzzy rule-based classifiers. Our proposal is tested in the well-known PIMA benchmark problem which corresponds to a medical diagnosis problem where interpretability is a strong requirement. © 2011 ieee.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Enabling multi-physics coupled simulations within the PGAS programming framework

Enabling multi-physics coupled simulations within the PGAS p...

引用

ieee/ACM international Symposium on Cluster, Cloud and Grid computing

作者： Zhang, Fan Docan, Ciprian Parashar, Manish Klasky, Scott Center for Autonomic Computing Rutgers University Piscataway NJ United States Oak Ridge National Laboratory P.O. Box 2008 Oak Ridge TN 37831 United States

ISBN: (纸本)9780769543956

Complex coupled multi-physics simulations are playing increasingly important roles in scientific and engineering applications such as fusion plasma and climate modeling. At the same time, extreme scales, high levels of concurrency and the advent of multicore and many core technologies are making the high-end parallel computing systems on which these simulations run, hard to program. While the Partitioned Global Address Space (PGAS) languages is attempting to address the problem, the PGAS model does not easily support the coupling of multiple application codes, which is necessary for the coupled multi-physics simulations. Furthermore, existing frameworks that support coupled simulations have been developed for fragmented programming models such as message passing, and are conceptually mismatched with the shared memory address space abstraction in the PGAS programming model. This paper explores how multi-physics coupled simulations can be supported within the PGAS programming framework. Specifically, in this paper, we present the design and implementation of the XpressSpace programming system, which enables efficient and productive development of coupled simulations across multiple independent PGAS Unified Parallel C (UPC) executables. XpressSpace provides the global-view style programming interface that is consistent with the memory model in UPC, and provides an efficient runtime system that can dynamically capture the data decomposition of global-view arrays and enable fast exchange of parallel data structures between coupled codes. In addition, XpressSpace provides the flexibility to define the coupling process in specification file that is independent of the program source codes. We evaluate the performance and scalability of Xpress Space prototype implementation using different coupling patterns extracted from real world multi-physics simulation scenarios, on the Jaguar Cray XT5 system of Oak Ridge National Laboratory. © 2011 ieee.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Contrasting multi-synchronous MPSoC design styles for fine-grained clock domain partitioning: The full-HD video playback case study

Contrasting multi-synchronous MPSoC design styles for fine-g...

引用

4th international workshop on Network on Chip Architectures, NoCArc 2011, in Conjunction with the 44th Annual ieee/ACM international Symposium on Microarchitecture, MICRO44

作者： Tatenguem, H.F. Ludovici, D. Strano, A. Bertozzi, D. Reinig, H. ENDIF University of Ferrara 44121 Ferrara Italy Intel Mobile Communications Munich Germany

ISBN: (纸本)9781450309479

Fine-grained (per-core) multi-synchronous systems calls for new clocking strategies and new architecture design techniques. This paper compares two fundamental multi-synchronous implementation variants based on the extensive use of dual-clock FIFOs vs mesochronous synchronizers respectively. The architecture-homogeneous experimental setting, the cost-effective merging of synchronizers with NoC switch buffers, the sharing of as many physical synthesis steps as possible between the two architectures and the requirements of a realistic full-HD video playback application are the key innovations of this study. © 2011 ACM.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

Privacy-aware bedtree based solution for fuzzy multi-keyword search over encrypted data

Privacy-aware bedtree based solution for fuzzy multi-keyword...

引用

international workshop on Specialized Ad Hoc Networks and systems

作者： Chuah, M. Hu, W. Department of Computer Science and Engineering Lehigh University Bethlehem PA 18015 United States

ISBN: (纸本)9780769543864

As Cloud computing technology becomes more mature, many organizations and individuals are interested in storing more sensitive data e.g. personal health records, customers related information in the cloud. Such sensitive data needs to be encrypted before it is outsourced to the cloud. Typically, the cloud servers also need to support a keyword search feature for these encrypted files. Traditional searchable encryption schemes typically only support exact keyword matches. However, users sometimes have typos or use slightly different formats e.g. "data-mining" versus "data mining". Thus, fuzzy keyword search is a useful feature to have. Recently, some researchers propose using wild card based approach to provide fuzzy keyword search. They also propose a solution for multi-keyword search. Their approaches have some limitations, namely (a) their fuzzy keyword search solution consumes large storage size since it inserts every fuzzy keyword as a leaf node in the index tree, (b) their fuzzy single-keyword search solution does not support multi-keyword search, (c) the existing multi-keyword search scheme does not provide efficient incremental updates. In this paper, we propose a privacy-aware bed tree based approach to support fuzzy multi-keyword feature. Incremental updates can be easily done using our solution. We have implemented our solution. Our evaluation results show that our approach is more cost-effective in terms of storage size and construction time. Our search time is usually better than the wild card approach for multi-keyword queries where many encrypted files are returned using single-word queries for approaches that do not support multi-keyword queries. © 2011 ieee.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

A very fast simulator for exploring the many-core future

A very fast simulator for exploring the many-core future

引用

25th ieee international Parallel and Distributed Processing Symposium, IPDPS 2011

作者： Certner, Olivier Li, Zheng Raman, Arun Temam, Olivier ST Microelectronics INRIA Saclay France INRIA Saclay Orsay France Princeton University NJ United States

ISBN: (纸本)9780769543857

Although multi-core architectures with a large number of cores ("many-cores") are considered the future of computing systems, there are currently few practical tools to quickly explore both their design and general program scalability. In this paper, we present Simany, a discrete-event-based many-core simulator able to support more than a thousand cores while being orders of magnitude faster than existing flexible approaches. One of the difficult challenges for a reasonably realistic many-core simulation is to model faithfully the potentially high concurrency a program can exhibit. Simany uses a novel virtual time synchronization technique, called spatial synchronization, to achieve this goal in a completely local and distributed fashion, which diminishes interactions and preserves locality. Compared to previous simulators, it raises the level of abstraction by focusing on modeling concurrent interactions between cores, which enables fast coarse comparisons of high-level architecture design choices and parallel programs performance. Sequential pieces of code are executed natively for maximal speed. We exercise the simulator with a set of dwarf-like task-based benchmarks with dynamic control flow and irregular data structures. Scalability results are validated through comparison with a cycle-level simulator up to 64 cores. They are also shown consistent with well-known benchmark characteristics. We finally demonstrate how Simany can be used to efficiently compare the benchmarks' behavior over a wide range of architectural organizations, such as polymorphic architectures and network of clusters. © 2011 ieee.

关键词： Simulators

来源：评论

学校读者我要写书评

暂无评论

Invited paper: Parallel programming and run-time resource management framework for many-core platforms: The 2PARMA approach

Invited paper: Parallel programming and run-time resource ma...

引用

international workshop on Reconfigurable Communication-Centric systems-On-Chip

作者： Silvano, C. Fornaciari, W. Reghizzi, S. Crespi Agosta, G. Palermo, G. Zaccaria, V. Bellasi, P. Castro, F. Corbetta, S. Speziale, E. Melpignano, D. Zins, J.M. Hübert, H. Stabernack, B. Brandenburg, J. Palkovic, M. Raghavan, P. Ykman-Couvreur, C. Anagnostopoulos, I. Bartzas, A. Soudris, D. Kempf, T. Ascheid, G. Ansari, J. Mähönen, P. Vanthournout, B. DEI Politecnico Milano Italy STMicroelectronics France Fraunhofer HHI Germany IMEC Vzw Belgium IBBT Belgium ICCS National Tech. University of Athens Greece RWTH Aachen University Germany Synopsys Belgium

ISBN: (纸本)9781457706424

Real-time applications, hard or soft, are raising the challenge of unpredictability. This is an extremely difficult problem in the context of modern, dynamic, multiprocessor platforms which, while providing potentially high performance, make the task of timing prediction extremely difficult. Also, with the growing software content in embedded systems and the diffusion of highly programmable and re-configurable platforms, software is given an unprecedented degree of control on resource utilization. The 2PARMA project aims at overcoming the lack of parallel programming models and run-time resource management techniques to exploit the features of many-core processor architectures. The main goals of the 2PARMA project are: the definition of a parallel programming model combining component-based and single-instruction multiple-thread approaches, instruction set virtualisation based on portable byte-code, run-time resource management policies and mechanisms as well as design space exploration methodologies for many-core computing architectures. © 2011 ieee.

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

Status of MEGA lib's Real-Time Analysis Tool Realta

Status of MEGA lib's Real-Time Analysis Tool Realta

引用

ieee Nuclear Science Symposium/Medical Imaging Conference (NSS/MIC)/18th international workshop on Room-Temperature Semiconductor X-Ray and Gamma-Ray Detectors

作者： Zoglauer, Andreas Galloway, Michelle Amman, Mark Boggs, Steven E. Univ Calif Berkeley Space Sci Lab Berkeley CA 94720 USA Lawrence Berkeley Natl Lab Berkeley CA 94720 USA

ISBN: (纸本)9781467301206

Realta is the real-time analyzer of MEGAlib, a software tool to simulate and analyze the data from soft-to-medium-energy gamma-ray detectors in space and on the ground. Realta encompasses the complete data analysis path which ranges from coincidence determination, Compton scatter and pair creation event reconstruction, event selection, image reconstruction to spectral identification. Realta is highly multi-threaded to fully utilize today's multi-core CPUs and to enable real-time processing. Taking advantage of the versatility of MEGAlib, Realta can be applied to a wide variety of gamma-ray detectors (pixel detectors, strip detectors) and measurement scenarios (near field 2D and 3D, far field). Realta and MEGAlib are open source, freely available, written in C++, and based on ROOT.

关键词： C++ C++ language Compton effect Compton scatter IP networks Image reconstruction Irrigation MEGAlib real-time analysis tool ROOT Real time systems Realta tool coincidence determination coincidence techniques data analysis data analysis event selection gamma-ray detection high energy physics instrumentation computing image reconstruction image reconstruction multi-threading multicore CPU multiprocessing systems multithreaded CPU pair creation event reconstruction pixel detector position sensitive particle detectors public domain software real-time analyzer real-time processing real-time systems semiconductor counters soft-to-medium-energy gamma-ray detector software tool software tools spectral identification strip detector

来源：评论

学校读者我要写书评

暂无评论

An Experimental Model to Analyze OpenMP Applications for System Utilization

An Experimental Model to Analyze OpenMP Applications for Sys...

引用

7th international workshop on OpenMP (IWOMP)

作者： Woodyard, Mark Oracle Corp 500 Eldorado BlvdUBRM05-420 Broomfield CO 80021 USA

ISBN: (纸本)9783642214875

Data centers are increasingly focused on optimal use of resources. For technical computing environments, with compute-dominated workloads, we can increase data center efficiencies by increasing multi-core processor utilization. OpenMP programmers need assistance in better understanding efficiencies and scaling for both dedicated and throughput environments. An experimental OpenMP performance analysis model has been developed to give insight into many application scalability bottlenecks. A tool has been developed to implement the model. Compared to other performance analysis tools, this tool takes into account how the operating system scheduler affects OpenMP threaded application performance. Poor parallel scalability can result in reduced system utilization. A case study shows how the tool helped diagnose performance loss caused by OpenMP work distribution schedule strategies. Changing the work distribution schedule substantially improved application performance and system utilization. This tool is specific to Solaris and Studio compilers, although the performance model is applicable to other OpenMP compilers, Linux and UNIX systems.

关键词： OpenMP performance analysis DTrace high performance computing parallel computing parallel speed-up parallel efficiency automatic parallelization

来源：评论

学校读者我要写书评

暂无评论

Understanding social networks properties for trustworthy computing

Understanding social networks properties for trustworthy com...

引用

international workshop on Specialized Ad Hoc Networks and systems

作者： Mohaisen, Abedelaziz Tran, Huy Hopper, Nicholas Kim, Yongdae Department of Computer Science and Engineering University of Minnesota Minneapolis MN 55455 United States

ISBN: (纸本)9780769543864

The ever-increasing popularity of social networks opens new directions for leveraging social networks to build primitives for security and communication, in many contexts. Such primitives utilize the trust in these social networks to ensure collaboration and algorithmic properties exhibited in such networks to argue for the effectiveness of such primitives. Despite the importance of such properties and their quality to the operation of these primitives, less effort is made to measure these properties and understand the relationship among them and to other characteristics of social networks. We extend our earlier results measuring the mixing time, to investigate a new property used for building Sybil defenses, namely the expansion of social graphs. We measure the expansion of social graphs, and show quantitatively that, with a few exceptions, it is sufficient to support Sybil defense mechanisms based on expansion. We relate the mixing time of social graphs to graph degeneracy, which captures cohesiveness of the graph. We experimentally show that fast-mixing graphs tend to have a larger single core whereas slow mixing graphs tend to have smaller multiple cores. While this study provides quantitative evidence relating the mixing time to coreness of the graph, it also agrees with our previous observations about the tight-knit community structure in slow mixing social graphs. © 2011 ieee.

关键词： Mixing

来源：评论

学校读者我要写书评

暂无评论

An efficient solution for aligning huge DNA sequences

An efficient solution for aligning huge DNA sequences

引用

2011 international Conference on Computer Engineering and systems, ICCES'2011

作者： Hosny, Ahmad M. Shedeed, Howida A. Hussein, Ashraf S. Tolba, Mohamed F. Department of Scientific Computing Faculty of Computer and Information Sciences Ain Shams University Abbassia Cairo 11566 Egypt

ISBN: (纸本)9781457701283

Recently, many parallel solutions were proposed in order to accelerate the exact methods for optimal alignment of DNA sequences. However, most of these solutions calculate only the alignment similarity score without finding the actual alignment. This paper presents an efficient solution to find the optimal alignment of the huge DNA sequences. This solution releases the condition of the sequence size to be in megabyte-scale instead of few kilobytes. The fundamental innovation in this work is developing an efficient, linear space complexity, parallel solution to achieve the optimum alignment with relatively good performance. The shared memory parallel architecture is the focus of this work therefore;we have considered off-the-shelf systems like multi-core CPUs as well as advanced shared memory platforms. Experimental results show that the proposed solution achieved high records compared to other solutions that targeted the same goal with less hardware requirements. © 2011 ieee.

关键词： DNA sequences

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共98页 << < 67 68 69 70 71 72 73 74 75 76 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：