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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,713 篇 会议
29 册 图书
25 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,298 篇 工学
- 1,197 篇 计算机科学与技术...
- 536 篇 软件工程
- 235 篇 电气工程
- 203 篇 信息与通信工程
- 72 篇 控制科学与工程
- 45 篇 电子科学与技术（可...
- 31 篇 机械工程
- 31 篇 生物工程
- 19 篇 动力工程及工程热...
- 17 篇 力学（可授工学、理...
- 16 篇 网络空间安全
- 14 篇 仪器科学与技术
- 13 篇 化学工程与技术
- 13 篇 石油与天然气工程
- 12 篇 建筑学
- 12 篇 生物医学工程（可授...
- 11 篇 土木工程
- 10 篇 材料科学与工程（可...
- 10 篇 交通运输工程
243 篇 理学
- 172 篇 数学
- 33 篇 生物学
- 33 篇 系统科学
- 31 篇 物理学
- 20 篇 化学
- 19 篇 统计学（可授理学、...
165 篇 管理学
- 116 篇 管理科学与工程(可...
- 59 篇 图书情报与档案管...
- 49 篇 工商管理
65 篇 医学
- 60 篇 临床医学
18 篇 经济学
- 18 篇 应用经济学
11 篇 法学
5 篇 教育学
4 篇 农学
3 篇 文学
1 篇 军事学

主题

155 篇 distributed comp...
84 篇 distributed comp...
77 篇 parallel process...
68 篇 cloud computing
51 篇 artificial intel...
50 篇 computational mo...
46 篇 computer archite...
46 篇 software enginee...
46 篇 distributed data...
44 篇 parallel program...
38 篇 parallel computi...
35 篇 application soft...
32 篇 big data
31 篇 parallel algorit...
31 篇 optimization
31 篇 intelligent netw...
31 篇 protocols
30 篇 concurrent compu...
30 篇 fault tolerance
29 篇 grid computing

机构

7 篇 chinese acad sci...
6 篇 univ adelaide sc...
5 篇 zhejiang univ co...
5 篇 shanghai jiao to...
4 篇 school of comput...
4 篇 harbin inst tech...
4 篇 univ stuttgart i...
4 篇 univ otago dept ...
4 篇 univ stuttgart i...
4 篇 institute of com...
4 篇 national laborat...
3 篇 huazhong univ sc...
3 篇 univ sydney sch ...
3 篇 univ chinese aca...
3 篇 reutlingen univ ...
3 篇 centre for distr...
3 篇 chinese acad sci...
3 篇 lomonosov moscow...
3 篇 huazhong univ sc...
3 篇 university of el...

作者

14 篇 zomaya albert y.
11 篇 shen hong
11 篇 rothermel kurt
7 篇 jack dongarra
6 篇 li y
6 篇 albert y. zomaya
6 篇 roman wyrzykowsk...
5 篇 fahringer thomas
5 篇 duerr frank
5 篇 jerzy waśniewski
5 篇 leymann frank
5 篇 kopp oliver
5 篇 li kuan-ching
5 篇 nakayama shigeru
5 篇 konrad karczewsk...
5 篇 huang z.
5 篇 lee young choon
4 篇 leung k.
4 篇 yang yang
4 篇 prodan radu

语言

1,724 篇 英文
30 篇 俄文
9 篇 其他
4 篇 中文
1 篇 乌克兰文

检索条件"任意字段=10th International Conference on Parallel and Distributed Computing, Applications and Technologies"

共 1767 条记录，以下是1111-1120 订阅

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

详细简洁

排序：

A distributed P2P-based architecture for semantic Web services discovery and composition

A distributed P2P-based architecture for semantic Web servic...

引用

international conference on New technologies of distributed Systems (NOTERE)

作者： Mohamed Gharzouli Mahmoud Boufaida LIRE Laboratory Department of Computer Sciences Mentouri University of Constantine Constantine Algeria

Web services paradigm is considered as the most prevailing instantiation of the service-oriented computing. this computing technology can he used potentially to compose new distributed collaborative applications and make easy the development of more complex Web processes. In this context, other representatives computing technologies, such as peer-to-peer (P2P), have also adopted the service-oriented approach and exposed functionalities as services. Recently, Web services based on P2P computing require special attention from collaboration and interoperability in a distributed computing environment. In this paper, we present a distributed architecture for semantic Web services automatic composition through a P2P network this architecture implements a pure distributed solution based on epidemic discovery algorithms to discover semantic Web services in unstructured Peer-to-Peer networks. However, a centralized base in this solution contains ontologies r fields helping different peers to develop semantic descriptions for their Web services.

关键词： Service oriented architecture Semantic Web

来源：评论

学校读者我要写书评

暂无评论

A robust decision tree algorithm for imbalanced data sets

A robust decision tree algorithm for imbalanced data sets

引用

10th SIAM international conference on Data Mining, SDM 2010

作者： Liu, Wei Chawla, Sanjay Cieslak, David A. Chawla, Nitesh V. Centre for Distributed and High Performance Computing School of Information Technologies University of Sydney Sydney NSW 2006 Australia University of Notre Dame Notre Dame IN 46556 United States

We propose a new decision tree algorithm, Class Confidence Proportion Decision Tree (CCPDT), which is robust and insensitive to size of classes and generates rules which are statistically significant. In order to make decision trees robust, we begin by expressing Information Gain, the metric used in C4.5, in terms of confidence of a rule. this allows us to immediately explain why Information Gain, like confidence, results in rules which are biased towards the majority class. To overcome this bias, we introduce a new measure, Class Confidence Proportion (CCP), which forms the basis of CCPDT. To generate rules which are statistically significant we design a novel and efficient top-down and bottom-up approach which uses Fisher's exact test to prune branches of the tree which are not statistically significant. Together these two changes yield a classifier that performs statistically better than not only traditional decision trees but also trees learned from data that has been balanced by well known sampling techniques. Our claims are confirmed through extensive experiments and comparisons against C4.5, CART, HDDT and SPARCCC. Copyright © by SIAM.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

parallel computing technologies - 10th international conference, PaCT 2009, Proceedings

Parallel Computing Technologies - 10th International Confere...

引用

10th international conference on parallel computing technologies, PaCT 2009

ISBN: (纸本)3642032745

the proceedings contain 45 papers. the topics discussed include: asynchronous language and system of numerical algorithms fragmented programming;analyzing metadata performance in distributed file systems;towards parametric verification of prioritized time Petri Nets;software transactional memories: an approach for multicore programming;sparse matrix operations on multi-core architectures;multi-granularity parallel computing in a genome-scale molecular evolution application;efficient parallelization of the preconditioned conjugate gradient method;parallel FFT with Eden skeletons;parallel implementation of generalized Newton method for solving large-scale LP problems;dynamic real-time resource provisioning for massively multiplayer online games;2D fast Poisson solver for high-performance computing;solution of large-scale problems of global optimization on the basis of parallel algorithms and cluster implementation of computing processes;and efficiency of parallel Monte Carlo method to solve nonlinear coagulation equation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Scenarios-based testing of systems with distributed ports

Scenarios-based testing of systems with distributed ports

引用

10th international conference on Quality Software, QSIC 2010

作者： Hierons, Robert M. Merayo, Mercedes G. Núñez, Manuel Department of Information Systems and Computing Brunel University Uxbridge Middlesex UB8 3PH United Kingdom Departamento de Sistemas Informáticos y Computación Universidad Complutense de Madrid Madrid Spain

ISBN: (纸本)9780769541310

Current distributed systems are usually composed of several distributed components that communicate through specific ports. When testing these systems we separately observe sequences of inputs and outputs at each port rather than a global sequence and potentially cannot reconstruct the global sequence that occurred. In this paper we concentrate on the problem of formally testing systems with distributed components that, in general, have independent behaviors but that at certain points of time synchronization can occur. these situations appear very often in large real systems that regularly go through maintenance and/or update operations. If we represent the specification of the global system by using a state-based notation, we say that a scenario is any sequence of events that happens between two of these operations;we encode these it special operations by marking some of the states of the specification. In order to assess the appropriateness of our new framework, we show that it represents a conservative extension of previous implementation relations defined in the context of the distributed test architecture: If we consider that all the states are marked then we simply obtain ioco (the classical relation for single-port systems) while if no state is marked then we obtain dioco (our previous relation for multi-port systems). © 2010 IEEE.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Secure information flow in Java via reachability analysis of pushdown system

Secure information flow in Java via reachability analysis of...

引用

10th international conference on Quality Software, QSIC 2010

作者： Sun, Cong Tang, Liyong Chen, Zhong Institute of Software School of Electronics Engineering and Computer Science Peking University China Key Laboratory of High Confidence Software Technologies Ministry of Education China

ISBN: (纸本)9780769541310

Automated verification of noninterference is commonly considered more precise than type-based approach on enforcing secure information flow for program. We propose an approach on model checking symbolic pushdown system generated from Java bytecode, and develop a deployment-time verification framework to ensure noninterference of bytecode. In order to overcome the constraints brought by the nature of object-oriented language and application scenario, we extend self-composition to low-recorded self-composition to reduce the partial correctness judgements on safety property to reachability analysis. In this variation, meta-level indices of heap are recorded into the self-composed pushdown system for the construction of auxiliary interleaving assignments and branch condition to illegal-flow state. Our experiments show that the approach is more scalable than previous work based on automated verification. © 2010 IEEE.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

dAUTObase: Mining gems on autoimmune diseases utilizing web visualization technologies

dAUTObase: Mining gems on autoimmune diseases utilizing web ...

引用

10th international conference on Information Technology and applications in Biomedicine: Emerging technologies for Patient Specific Healthcare, ITAB 2010

作者： Antoniou, Dimitris I. Georgitsi, Marianthi A. Gkantouna, Vassiliki A. Patrinos, George P. Poulas, Konstantinos A. Tsakalidis, Athanasios K. Tzimas, Giannis E. Viennas, Emmanouil S. Technological Educational Institute of Messolonghi Department of Applied Informatics in Management and Finance Messolonghi 30200 Greece Department of Computer Engineering and Informatics Faculty of Engineering University of Patras Patras 26504 Greece Department of Pharmacy School of Health Sciences University of Patras Patras 26504 Greece

ISBN: (纸本)9781424465606

An autoimmune disorder is a condition that occurs when the immune system mistakenly attacks and destroys healthy body parts. the epidemiology of these diseases is a matter of study and discussion, with many published results worldwide. We have critically collected more than 100 publications, analyzing autoimmune diseases' frequencies in various populations and ethnic groups. Simultaneously, we developed a web application in order to host the collected data. By utilizing Microsoft Silverlight technology, we have built a multimedia web frontend, in order to support a high level visualization of the data and the mining process. In parallel we continue the data mining process and the update of our database. © 2010 IEEE.

关键词： Data visualization

来源：评论

学校读者我要写书评

暂无评论

Design of parallel distributed algorithm for the Permutation Flow Shop Problem

Design of parallel distributed algorithm for the Permutation...

引用

international conference on New technologies of distributed Systems (NOTERE)

作者： S. Kouki M. Jemni T. Ladhari Ecole Supérieure Sciences et Techniques de Tunis Research Laboratory UTIC Tunis Tunisia Ecole Supérieure des Sciences Economiques et Commerciales Tunis Tunisia

this paper deals with the resolution of the Permutation Flow Shop Problem (PFSP) which requires scheduling n jobs through m machines that are placed in series so as to minimize the makespan. In this study, we focus on parallel methods for solving the one-machine PFSP. We present a parallel distributed Algorithm for this problem with extensive computational results on cluster of computers using well-known benchmarks. the experimental evaluation of our distributed parallel algorithm gives promising results and shows clearly the benefit of the parallel paradigm to solve large-scale instances in moderate CPU time.

关键词： Algorithm design and analysis distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Data unpredictability in software defect-fixing effort prediction

Data unpredictability in software defect-fixing effort predi...

引用

10th international conference on Quality Software, QSIC 2010

作者： He, Zhimin Shu, Fengdi Yang, Ye Zhang, Wen Wang, Qing Laboratory for Internet Software Technologies Institute of Software Chinese Academy of Sciences Beijing 100080 China Graduate University Chinese Academy of Sciences Beijing 100039 China

ISBN: (纸本)9780769541310

the prediction of software defect-fixing effort is important for strategic resource allocation and software quality management. Machine learning techniques have become very popular in addressing this problem and many related prediction models have been proposed. However, almost every model today faces a challenging issue of demonstrating satisfactory prediction accuracy and meaningful prediction results. In this paper, we investigate what makes high-precision prediction of defect-fixing effort so hard from the perspective of the characteristics of defect dataset. We develop a method using a metric to quantitatively analyze the unpredictability of a defect dataset and carry out case studies on two defect datasets. the results show that data unpredictability is a key factor for unsatisfactory prediction accuracy and our approach can explain why high-precision prediction for some defect datasets is hard to achieve inherently. We also provide some suggestions on how to collect highly predictable defect data. © 2010 IEEE.

关键词： Defects

来源：评论

学校读者我要写书评

暂无评论

On the Effect of Using third-Party Clouds for Maximizing Profit

On the Effect of Using Third-Party Clouds for Maximizing Pro...

引用

10th international conference on Algorithms and Architectures for parallel Processing

作者： Lee, Young Choon Wang, Chen Taheri, Javid Zomaya, Albert Y. Zhou, Bing Bing Univ Sydney Sch Informat Technol Ctr Distributed & High Performance Comp Sydney NSW 2006 Australia CSIRO ICT Ctr Epping NSW 1710 Australia

ISBN: (纸本)9783642131189

Services in cloud computing systems are typically categorized into three types software as a service (SaaS), platform as a service (PaaS) and infrastructure as a service (laaS). these services can be prepared in the form of virtual machine (VM) images;and they can be deployed and run dynamically as clients request. Since the cloud service provider has to deal with a diverse set of clients, including both regular and new/one-off clients, and their requests most likely differ from one another, the judicious scheduling of these requests plays a key role in the efficient use of resources for the provider to maximize its profit. In this paper, we address the problem of scheduling arbitrary service requests of those three different types taking into account the maximization of profit in cloud environments, and present the client satisfaction oriented scheduling (CSoS) algorithm. Our algorithm effectively exploits different characteristics of those three service types and the availability of third-party cloud service providers who have (or are capable of having) identical service offerings (using virtual machine images). Our main contribution is the incorporation of client satisfaction into our request scheduling;this incorporation enables to increase profit by avoiding the discontinuation of service requests from those unsatisfied clients due to the poor quality of service.

关键词： Profitability

来源：评论

学校读者我要写书评

暂无评论

distributed, scalable clustering for detecting halos in terascale astronomy datasets

Distributed, scalable clustering for detecting halos in tera...

引用

10th IEEE international conference on Data Mining Workshops, ICDMW 2010

作者： Daruru, Srivatsava Dhandapani, Sankari Gupta, Gunjan Iliev, Ilian Xu, Weijia Navratil, Paul Marín, Nena Ghosh, Joydeep Dept. of Computer Sciences University of Texas Austin United States Dept. of Electrical and Comp. Eng. University of Texas Austin United States Dept. of Physics and Astronomy University of Sussex Brighton United Kingdom Texas Advanced Computing Center University of Texas Austin United States Innovations Laboratory Pervasive Software Austin United States Department of Electrical and Computer Engineering University of Texas Austin United States

ISBN: (纸本)9780769542577

Terascale astronomical datasets have the potential to provide unprecedented insights into the origins of our universe. However, automated techniques for determining regions of interest are a must if domain experts are to cope with the intractable amounts of simulation data. this paper addresses the important problem of locating and tracking high density regions in space that generally correspond to halos and sub-halos and host galaxies. A density based, mode following clustering method called Automated Hierarchical Density Shaving (Auto-HDS) is adapted for this application. Auto-HDS can detect clusters of different densities while discarding the vast majority of background data. Two alternative parallel implementations of the algorithm, based respectively on the dataflow computational model and on Hadoop/ MapReduce functional programming constructs, are realized and compared. Based on runtime performance, scalability across compute cores and across increasing data volumes, we demonstrate the benefits of fine grain parallelism. the proposed distributed and multithreaded AutoHDS clustering algorithm is shown to produce high quality clusters, be computationally efficient, and scalable from 1 through 1024 compute-cores. © 2010 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 108 109 110 111 112 113 114 115 116 117 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：