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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

197 篇 会议
6 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

154 篇 工学
- 150 篇 计算机科学与技术...
- 67 篇 软件工程
- 24 篇 电气工程
- 20 篇 信息与通信工程
- 13 篇 控制科学与工程
- 9 篇 仪器科学与技术
- 5 篇 动力工程及工程热...
- 5 篇 电子科学与技术（可...
- 5 篇 交通运输工程
- 5 篇 安全科学与工程
- 4 篇 网络空间安全
- 3 篇 生物工程
- 2 篇 机械工程
- 2 篇 建筑学
- 2 篇 土木工程
- 2 篇 生物医学工程（可授...
- 1 篇 冶金工程
- 1 篇 水利工程
- 1 篇 化学工程与技术
33 篇 理学
- 23 篇 数学
- 6 篇 化学
- 5 篇 系统科学
- 4 篇 生物学
- 2 篇 统计学（可授理学、...
- 1 篇 物理学
30 篇 管理学
- 22 篇 管理科学与工程(可...
- 17 篇 工商管理
- 14 篇 图书情报与档案管...
1 篇 经济学
- 1 篇 应用经济学
1 篇 医学
- 1 篇 临床医学

主题

21 篇 cloud computing
9 篇 parallel process...
9 篇 distributed comp...
8 篇 peer to peer com...
8 篇 distributed comp...
7 篇 concurrent compu...
7 篇 grid computing
7 篇 computational mo...
7 篇 scheduling
6 篇 message passing
6 篇 computer archite...
6 篇 distributed syst...
5 篇 computer science
5 篇 mobile agents
5 篇 bandwidth
5 篇 genetic algorith...
5 篇 data models
4 篇 parallel algorit...
4 篇 application soft...
4 篇 fault tolerance

机构

2 篇 high-performance...
2 篇 parallel and dis...
2 篇 institut univers...
2 篇 ibm t.j. watson ...
2 篇 department of co...
2 篇 beihang univ sch...
2 篇 parallel and dis...
1 篇 faculty of infor...
1 篇 department of co...
1 篇 department of co...
1 篇 rechen- und komm...
1 篇 institut für inf...
1 篇 cicese ensenada ...
1 篇 faculty of infor...
1 篇 univ utah sci co...
1 篇 tech univ berlin...
1 篇 high-performance...
1 篇 simula research ...
1 篇 chongqing univ k...
1 篇 swiss fed inst t...

作者

3 篇 kuan-ching li
3 篇 chao-tung yang
3 篇 li xiaorong
2 篇 park woo-chan
2 篇 bouamama sadok
2 篇 dieter mey
2 篇 kim il-san
2 篇 han tack-don
2 篇 lee kil-whan
2 篇 yoon duk-ki
2 篇 domenico talia
2 篇 li kuan-ching
2 篇 akl selim g.
2 篇 plale beth
2 篇 chen peng
2 篇 yang chao-tung
1 篇 nandi asoke k.
1 篇 han biao
1 篇 ortiz aurélien
1 篇 hillhouse bob

语言

205 篇 英文

检索条件"任意字段=19th International Conference on Parallel and Distributed Computing Systems, PDCS 2006"

共 205 条记录，以下是191-200 订阅

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

详细简洁

排序：

Credibility Enhanced Reputation Mechanism for distributed E-communities

Credibility Enhanced Reputation Mechanism for Distributed E-...

引用

Euromicro conference on parallel, distributed and Network-Based Processing

作者： Eleni Koutrouli Aphrodite Tsalgatidou Department of Informatics & Telecommunications National and Kapodistrian University of Athens Athens Greece

P2P communities are online communities of entities which offer services to each other without a central administration. Community members that need a specific service have to choose the transaction partner which they believe that will provide them with a required service of the expected quality, thus, they need mechanisms to support trust decisions regarding who they will transact with. P2P reputation systems provide trust mechanisms for P2P communities. Due to their decentralized and social nature, they are vulnerable to various types of attacks which distort their credibility and effectiveness. In our paper we first identify the credibility factors of a P2P reputation system. then we describe a dynamic reputation mechanism for P2P communities, which integrates some of these credibility factors and which can be used as part of a comprehensive reputation system enhancing its robustness against some types of attacks. Simulation results show the effectiveness of our mechanism in relation to other reputation mechanisms which do not integrate such factors.

关键词： Communities Peer to peer computing Measurement Collaboration Heuristic algorithms Quality of service Silicon

来源：评论

学校读者我要写书评

暂无评论

Job Scheduling with License Reservation: A Semantic Approach

Job Scheduling with License Reservation: A Semantic Approach

引用

Euromicro conference on parallel, distributed and Network-Based Processing

作者： Jorge Ejarque Andras Micsik Raul Sirvent Peter Pallinger Laszlo Kovacs Rosa M. Badia Computer Architecture Department Universitat Politecnica de Catalunya Barcelona Spain Grid Computing and Clusters Group Barcelona Supercomputing Center Barcelona Spain Distributed Systems Department-Computer and Automation Research Institute Hungarian Academy of Sciences (ATOMKI) Budapest Hungary Artificial Intelligence Research Institute Spanish National Research Council Barcelona Spain

the license management is one of the main concerns when Independent Software Vendors (ISV) try to distribute their software in computing platforms such as Clouds. they want to be sure that customers use their software according to their license terms. the work presented in this paper tries to solve part of this problem extending a semantic resource allocation approach for supporting the scheduling of job taking into account software licenses. this approach defines the licenses as another type of computational resource which is available in the system and must be allocated to the different jobs requested by the users. License terms are modeled as resource properties, which describe the license constraints. A resource ontology has been extended in order to model the relations between customers, providers, jobs, resources and licenses in detail and make them machine processable. the license scheduling has been introduced in a semantic resource allocation process by providing a set of rules, which evaluate the semantic license terms during the job scheduling.

关键词： Licenses Software Semantics Resource management Ontologies Processor scheduling Law

来源：评论

学校读者我要写书评

暂无评论

Cloud and network facilities federation in BonFIRE

引用

19th international conference on parallel Processing Workshops, Euro-Par 2013 - BigDataCloud, DIHC, FedICI, HeteroPar, HiBB, LSDVE, MHPC, OMHI, PADABS, PROPER, Resilience, ROME, and UCHPC 2013

作者： García-Pérez, David Lorenzo Del Castillo, Juan Ángel Al-Hazmi, Yahya Martrat, Josep Kavoussanakis, Konstantinos Hume, Alastair C. López, Celia Velayos Landi, Giada Wauters, Tim Gienger, Michael Margery, David Atos Research and Innovation Group Barcelona Spain Hewlett-Packard Laboratories Bristol United Kingdom Next Generation Networks Technical University Berlin Berlin Germany EPCC University of Edinburgh King's Buildings Edinburgh United Kingdom Distributed Applications and Networks Area I2CAT Foundation Barcelona Spain Nextworks S.r.l. Pisa Italy Department of Information Technology Ghent University IMinds Ghent Belgium Stuttgart Germany INRIA Rennes - Bretagne Atlantique Research Center Rennes France

ISBN: (纸本)9783642544194

In recent years we have seen how Cloud computing is changing the way of doing businesses and how services are delivered over the Internet. this disruption is a major challenge for Service Providers and Independent Software Vendors when creating new services and software applications for the Cloud. BonFIRE offers a federated, multi-site cloud testbed to support large-scale testing of applications, services and systems. this is achieved by federating geographically distributed, heterogeneous clouds testbeds where each exposes unique configuration and/or features while giving to the experimenters (users) an homogeneous way to interact with the facility. All those testbeds are controlled by a central set of services commonly denominated "Broker". Additionally, BonFIRE is federated with different network facilities like the Virtual Wall, FEDERICA and AutoBAHN to provide high-level interfaces to network control functionality, in order to simulate diverse network QoS scenarios, enabling vertical federation. © 2014 Springer-Verlag Berlin Heidelberg.

关键词： Testbeds

来源：评论

学校读者我要写书评

暂无评论

Campaign scheduling

Campaign scheduling

引用

international conference on High Performance computing

作者： Vinicius Pinheiro Krzysztof Rzadca Denis Trystram Laboratory for Parallel and Distributed Computing University of São Paulo Brazil Institute of Informatics University of Warsaw Poland Institut Universitaire de France France

We study the problem of scheduling in parallel systems with many users. We analyze scenarios with many submissions issued over time by several users. these submissions contain one or more jobs; the set of submissions are organized in successive campaigns. Jobs belonging to a single campaign are sequential and independent, but any job from a campaign cannot start until all the jobs from the previous campaign are completed. Each user's goal is to minimize the sum of flow times of his campaigns. We define a theoretical model for Campaign scheduling and show that, in the general case, it is NP-hard. For the single-user case, we show that an ρ-approximation scheduling algorithm for the (classic) parallel job scheduling problem is also an ρ-approximation for the Campaign scheduling problem. For the general case with k users, we establish a fairness criterion inspired by time sharing. We propose FAIRCAMP, a scheduling algorithm which uses campaign deadlines to achieve fairness among users between consecutive campaigns. We prove that FAIRCAMP increases the flow time of each user by a factor of at most k ρ compared with a machine dedicated to the user. We also prove that FAIRCAMP is a ρ-approximation algorithm for the maximum stretch. By simulation, we compare FAIRCAMP to the First-Come-First-Served (FCFS). We show that, compared with FCFS, FAIRCAMP reduces the maximum stretch by up to 3.4 times. the difference is significant in systems used by many (k > 5) users. Our results show that, rather than just individual, independent jobs, campaigns of jobs can be handled by the scheduler efficiently and fairly.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Autonomous systems demand new computer system architectures and new development strategies

Autonomous systems demand new computer system architectures ...

引用

international conference on Industrial Electronics, Control and Instrumentation

作者： B. Svensson P.-A. Wiberg Department of Computer Engineering Chalmers University of Technology Goteborg Sweden Centre for Computer Architecture Halmstad University Halmstad Sweden

this paper addresses two related problem areas with regard to autonomous systems, namely (i) appropriate architectures of the embedded computing systems, and (ii) appropriate system development strategies and tools. Adaptivity and learning are identified as important characteristics of autonomous systems. A modular architecture capable of executing multiple-neural-network systems with real-time learning and control abilities is described. this architecture is based on distributed nodes of massively parallel processing elements communicating by means of a scalable high bandwidth medium. the nodes and the medium operate in a time-deterministic manner. Further, it is argued that autonomous systems must be developed through a process of system alteration-change-orientation rather than the phase-oriented specify-design-implement-and-test model which is common today. A tool which, in cooperation with the system architecture, supports this paradigm is described. Required functions of the development tool are, e.g., inspection and visualization of data, change of software and hardware functions, and ability to cope with changes in the mechanical structure, including sensors and actuators, all while the autonomous system is in action. A graphical, interactive design environment that meets these demands is outlined.< >

关键词： Computer architecture Embedded computing Real time systems Control systems parallel processing Bandwidth Inspection Data visualization Software tools Hardware

来源：评论

学校读者我要写书评

暂无评论

Fault tolerant parallel data-intensive algorithms

Fault tolerant parallel data-intensive algorithms

引用

international conference on High Performance computing

作者： Mucahid Kutlu Gagan Agrawal Oguz Kurt Department of Computer Science and Engineering Ohio State University Columbus OH USA Department of Mathematics Ohio State University Columbus OH USA

Fault-tolerance is rapidly becoming a crucial issue in high-end and distributed computing, as increasing number of cores are decreasing the mean-time to failure of the systems. While checkpointing, including checkpointing of parallel programs like MPI applications, provides a general solution, the overhead of this approach is becoming increasingly unacceptable. thus, algorithm-based fault-tolerance provides a nice practical alternative, though it is less general. Although this approach has been studied for many applications, there is no existing work for algorithm-based fault-tolerance for the growing class of data-intensive parallel applications. In this paper, we present an algorithm-based fault tolerance solution that handles fail-stop failures for a class of data intensive algorithms. We divide the dataset into smaller data blocks and in replication step, we distribute the replicated blocks with the aim of keeping the maximum data intersection between any two processors minimum. this allows us to have minimum data loss when multiple failures occur. In addition, our approach enables better load balance after failure, and decreases the amount of re-processing of the lost data. We have evaluated our approach by using two popular parallel data mining algorithms, which are k-means and apriori. We show that our approach has negligible overhead when there are no failures, and allows us to gracefully handle different number of failures, and failures at different points of processing. We also provide the comparison of our approach with the MapReduce based solution for fault tolerance, and show that we outperform Hadoop both in absence and presence of failures.

关键词：

来源：评论

学校读者我要写书评

暂无评论

distributed control of voltage supply system used in electric vehicles

Distributed control of voltage supply system used in electri...

引用

international conference on System theory, Control, and computing (ICSTCC)

作者： Ioan - Alex Alexa Alexandru Onea Department of automatic control and applied informatics “Gh. Asachi” Technical University of Iasi Romania Department of automatic control and applied informatics “Gh. Asachi” Technical University of Iasi Iasi Romania

the actual trend in automotive is to reduce as much as possible pollution caused by motor vehicle emissions. this could be achieved by using electrical propulsion systems which usually contains: electrical machine, three phase voltage source inverter (VSI), voltage supply system. the main problem of the full electric vehicles represents the autonomy due to low energy capacity of batteries. this issue could be solved by using a hydrogen fuel cell in parallel with a battery pack to extend the range of the electrical vehicles. this paper presents a voltage supply system which connects to a DC bus a battery, a fuel cell, and a supercapacitor using DCDC converters. the focus of this work is on keeping controlling the voltage level of DC bus and on energy distribution between elements of voltage supply system. the proposed algorithm is validated using a close loop model which contains simulation of: fuel cell, battery pack, supercapacitor, DCDC converter, distributed control strategy of voltage supply system, DC Link capacitor, VSI, electrical machine, vehicle dynamics, and driver. the model is developed in Matlab/Simulink.

关键词： Batteries Supercapacitors Fuel cells Voltage control Mathematical model Integrated circuit modeling

来源：评论

学校读者我要写书评

暂无评论

Explainable Artificial Intelligence to Enhance Data Trustworthiness in Crowd-Sensing systems

Explainable Artificial Intelligence to Enhance Data Trustwor...

引用

international conference on distributed computing in Sensor systems (DCOSS)

作者： Sam Afzal-Houshmand Dimitrios Papamartzivanos Sajad Homayoun Entso Veliou Christian D. Jensen Athanasios Voulodimos thanassis Giannetsos Cyber Security Section Technical University of Denmark (DTU) Denmark Ubitech Ltd. Digital Security & Trusted Computing Group Greece Department of Informatics and Computer Engineering University of West Attica Athens Greece School of Electrical & Computer Engineering National Technical Univ. of Athens Greece

Around the world there has been an advancement of IoT edge devices, that in turn have enabled the collection of rich datasets as part of the Mobile Crowd Sensing (MCS) paradigm, which in practice is implemented in a variety of safety critical applications. In spite of the advantages of such datasets, there exists an inherent data trustworthiness challenge due to the interference of malevolent actors. In this context, there has been a great body of proposed solutions which capitalize on conventional machine algorithms for sifting through faulty data without any assumptions on the trustworthiness of the source. However, there is still a number of open issues, such as how to cope with strong colluding adversaries, while in parallel managing efficiently the sizable influx of user data. In this work we suggest that the usage of explainable artificial intelligence (XAI) can lead to even more efficient performance as we tackle the limitation of conventional black box models, by enabling the understanding and interpretation of a model's operation. Our approach enables the reasoning of the model's accuracy in the presence of adversaries and has the ability to shun out faulty or malicious data, thus, enhancing the model's adaptation process. To this end, we provide a prototype implementation coupled with a detailed performance evaluation under different scenarios of attacks, employing both real and synthetic datasets. Our results suggest that the use of XAI leads to improved performance compared to other existing schemes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Atheris: A First Step Towards a Uni?ed Peer-to-Peer Traf?c Measurement Framework

Atheris: A First Step Towards a Uni?ed Peer-to-Peer Traf?c M...

引用

Euromicro conference on parallel, distributed and Network-Based Processing

作者： Philipp M. Eittenberger Udo R. Krieger Faculty of Information Systems and Applied Computer Science Otto-Friedrich Universitat Bamberg Germany

the extensive growth of peer-to-peer video applications (P2PTV) indicates the evolutionary path towards the next generation of networking. To enhance the quality of experience for P2PTV users, new P2P video traffic models are required. these models are often developed by measurement-driven performance modeling based upon statistical analysis. However, this type of analysis can be a challenging task, due to the complexity and especially, with large sample sizes, the sheer quantity of the data. For this reason, preliminary data examination by graphical means and appropriate visualization techniques can be of great value. In this paper, the versatile network traffic analyzer Atheris will be introduced. It is an essential part of a comprehensive traffic measurement and analysis concept to cope with the rapid deployment of P2PTV applications and their overlay structures. Atheris has been designed specially for measuring P2P applications and for visualizing their inherent properties. As a part of its functionality, Atheris performs traffic measurements at the packet layer, data extraction, flow analysis and enables the visual inspection of statistical characteristics. Furthermore, an evaluation of overlay structures by bandwidth estimation techniques and an overview of the statistical P2P traffic features are provided.

关键词： Protocols Peer to peer computing Data visualization Loading Bandwidth Inspection Data models

来源：评论

学校读者我要写书评

暂无评论

Implementation of visual MPI parallel program performance analysis tool for cluster environments

Implementation of visual MPI parallel program performance an...

引用

international conference on Advanced Information Networking and Applications (AINA)

作者： Kuan-Ching Li Hsun-Chang Chang Chao-Tung Yang Li-Jen Chang Hsiang-Yao Cheng Liang-Teh Lee Parallel and Distributed Processing Center CSIM Department Providence University Taichung Taiwan HPC Laboratory CSIE Department Tunghai University Taichung Taiwan Department of Computer Science and Engineering Tatung University Taipei Taiwan

ISBN: (纸本)0769522491

In this paper, we present visual tool for performance measurement and analysis of MPI parallel programs in cluster environments. Most of tools available today for cluster systems show solely system performance data (e.g., CPU load, memory usage, network bandwidth, machine-room temperature, server average load, among others), being more suitable for system administrators who maintain such system. the visual tool is designed to show performance data of all computer nodes involved in the execution of MPI parallel program, such as CPU load level and memory usage. Additionally, this tool is able to display comparative performance data charts of multiple executions of the application (instrumented with MPI interface) under development.

关键词： Performance analysis Measurement System performance Bandwidth Temperature Network servers Concurrent computing Computer displays Application software Instruments

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共21页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：