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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

991 篇 会议
20 篇 期刊文献
9 册 图书

馆藏范围

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

日期分布

学科分类号

764 篇 工学
- 736 篇 计算机科学与技术...
- 526 篇 软件工程
- 195 篇 信息与通信工程
- 78 篇 控制科学与工程
- 59 篇 电子科学与技术（可...
- 58 篇 电气工程
- 21 篇 动力工程及工程热...
- 19 篇 机械工程
- 16 篇 生物医学工程（可授...
- 15 篇 生物工程
- 13 篇 建筑学
- 12 篇 环境科学与工程（可...
- 11 篇 安全科学与工程
- 8 篇 仪器科学与技术
- 7 篇 化学工程与技术
- 6 篇 力学（可授工学、理...
- 6 篇 光学工程
- 6 篇 土木工程
256 篇 理学
- 209 篇 数学
- 34 篇 统计学（可授理学、...
- 31 篇 系统科学
- 21 篇 物理学
- 20 篇 生物学
- 12 篇 化学
221 篇 管理学
- 170 篇 管理科学与工程(可...
- 111 篇 工商管理
- 67 篇 图书情报与档案管...
14 篇 经济学
- 14 篇 应用经济学
10 篇 法学
- 7 篇 社会学
6 篇 医学
- 6 篇 基础医学(可授医学...
4 篇 农学
3 篇 文学
2 篇 教育学

主题

95 篇 distributed comp...
71 篇 parallel process...
53 篇 grid computing
50 篇 peer to peer com...
48 篇 distributed comp...
33 篇 parallel process...
32 篇 servers
31 篇 fault tolerance
30 篇 computer archite...
29 篇 computational mo...
27 篇 distributed data...
24 篇 protocols
21 篇 concurrent compu...
21 篇 software enginee...
21 篇 cloud computing
19 篇 parallel program...
18 篇 graphics process...
18 篇 algorithm design...
18 篇 artificial intel...
17 篇 bandwidth

机构

11 篇 institute of com...
10 篇 institute of com...
5 篇 academic center ...
5 篇 department of in...
4 篇 institute of par...
4 篇 national laborat...
4 篇 graduate univers...
4 篇 national laborat...
3 篇 school of comput...
3 篇 chinese academy ...
3 篇 institute of inf...
3 篇 chinese academy ...
3 篇 school of comput...
3 篇 computer science...
2 篇 pervasive techno...
2 篇 inria
2 篇 disca univ. poli...
2 篇 state key labora...
2 篇 west bengal univ...
2 篇 dcse college of ...

作者

7 篇 valentin cristea
5 篇 kurt rothermel
5 篇 nakashima hirosh...
5 篇 kondo toshio
5 篇 sasaki takahiro
5 篇 ohno kazuhiko
5 篇 gonzalez teofilo...
4 篇 dongarra jack
4 篇 tang tao
4 篇 wang guibin
4 篇 florin pop
4 篇 matsumoto masaki
4 篇 andresen daniel
3 篇 suter frédéric
3 篇 kawamura takao
3 篇 xhafa fatos
3 篇 alexandru costan
3 篇 lin yisong
3 篇 cristea valentin
3 篇 takata toyoo

语言

1,001 篇 英文
19 篇 其他

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

共 1020 条记录，以下是511-520 订阅

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

详细简洁

排序：

Robust open Internet services

Robust open Internet services

引用

international conference on parallel distributed and Grid computing (PDGC)

作者： Christian Scheideler Department of Computer Science Universität Paderborn Germany

The Internet offers an enormous potential for all kinds of services, from Web search to online shopping, from social networks to multi-player online games,from online auctions to online encyclopedias. Many of these services thrive due to a vibrant community support. Making services open to community support offers great potentials but makes them also vulnerable to malicious behavior. Malicious behavior in the form of vandalism or denial-of-service attacks is easy to detect. However, there are much more subtle forms of attacks. In fact,often an attacker does not have to find holes and backdoors in order to harm a service or use it to the own advantage. Often, it perfectly suffices to stay within the legal use of a service in order to harm or exploit it. So-called legal attacks have the problem that they could very well be normal behavior, which is why it is hard to detect and filter them. For example, the fact that suddenly a certain piece of information is heavily accessed might be due to the fact that it is suddenly very popular for some reason. However, this could also be due to an adversarial attack. Popular services like the standard email system, Google and Wikipedia and many peer-to-peer systems are continuously attacked. I will show how to model some of these attacks as simple games between an adversary and the system. As I will show, in several cases it is possible for the system to function correctly despite the presence of an adversary and without the system having to determine who is behaving well and who is adversarial.

关键词： Encyclopedias Law Communities Computer science Internet Grid computing

来源：评论

学校读者我要写书评

暂无评论

Bandwidth Constrained Tree Construction for Live Streaming systems in P2P Networks

Bandwidth Constrained Tree Construction for Live Streaming S...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Yunyue Lin Qishi Wu Xukang Lu Yi Gu Department of Computer Science University of Memphis Memphis TN USA

The traditional client-server architecture widely adopted on the Internet is not adequate to meet the increasing user loads and bandwidth demands in live streaming systems especially for multimedia content delivery. Peer-to-peer P2P) overlay networks provide excellent system scalability and high resource utilization, which make it an attractive solution to this problem. This paper considers a hybrid hierarchical P2P overlay network structure that consists of both super and normal peers. The media streaming architecture is built upon a tree structured network of super peers and the tree construction process has a significant impact on the overall system performance. We construct network cost models and formulate a Bandwidth Constrained Tree (BCT) construction problem, which aims at maximizing the number of peers that satisfy a specified bandwidth constraint. We prove that BCT is NP-complete and propose optimal algorithms in two special cases and a heuristic approach in a general case. The performance superiority of the proposed method is illustrated by an extensive set of experiments on simulated networks of various sizes in comparison with existing greedy and degree constrained algorithms.

关键词： Bandwidth Peer to peer computing Throughput Network topology Algorithm design and analysis Topology Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Case for the Optimization of Database Workflow Orchestration in Heterogenous Environments

A Case for the Optimization of Database Workflow Orchestrati...

引用

The Ninth international conference on Grid and Cloud computing(第九届网格与云计算国际学术会议 GCC 2010)

作者： Werner Mach Erich Schikuta University of Vienna Department of Knowledge and Business Engineering Research Lab for Computational Technology and Applications Rathausstraβe 19/9 A-1010 Vienna Austria

We present a novel optimization approach for the orchestration of the execution of database workflows in heterogeneous infrastructures, hereby specifically focusing on sorting algorithms. We give a case for the validity of our approach by developing a generic template for a family of optimization algorithms. We develop a model for the mathematical analysis of parallel sort algorithms and design a graph based algorithm for finding optimal complete binary work flow execution trees in networks aiming for maximum performance of the parallel Merge Sort. We justify our approach by an exhaustive simulation analysis, which leads to a refinement and optimization of the workflow orchestration process.

关键词： Heterogeneous environment distributed and parallel database systems parallel sorting workflow orchestration

来源：评论

学校读者我要写书评

暂无评论

Future Supply Chain Processes and Data for Collective Intelligence

Future Supply Chain Processes and Data for Collective Intell...

引用

international conference on P2P, parallel, Grid, Cloud and Internet computing (3PGCIC)

作者： Martin Watmough Simon Polovina Babak Khazaeri Richard Hill Conceptual Structures Research Group Department of Computing Sheffield Hallam University UK Distributed and Intelligent Systems Research Group University of Derby UK

The aim of this paper is to identify the requirements on data that are necessary to support a collective intelligence solution for future supply chains. It is based on an evidential discussion of the information flows in future supply chains and the impact these will have on the life cycle, governance and ownership of data. Supply Chains are facing an increasing complex future if they are to provide the services required while operating in increasingly diverse landscapes and environments. Integration and coordination across the whole supply chain is requiring new approaches, systems and processes therefore data must be enhanced to support these new demands and provide the agility that organisations and consumers envisage. The content of data or data sets is discussed in the context of semantics and Service Orientated Architecture (SOA). A shift in the content of data to include behaviour and increased synchronisation across processes is developed as a possible solution for future supply chains. The evolution and importance of understanding is discussed and developed into a reliance on the integration of data and processes through change control and governance to achieve a collective intelligence across the supply chain.

关键词： Supply chains Semantics Process control Planning Synchronization Context

来源：评论

学校读者我要写书评

暂无评论

Bandwidth- and Latency-Aware Peer-to-Peer Instant Friendcast for Online Social Networks

Bandwidth- and Latency-Aware Peer-to-Peer Instant Friendcast...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Jehn-Ruey Jiang Chao-Wei Hung Jih-Wei Wu Department of Computer Science and Information Engineering National Central University JhongLi Taiwan

Online Social Networks (OSNs) are more and more popular recently, people may through them interact with each other for the purpose of social intercourse. The client/server OSN architecture brings about the bottleneck of bandwidth and computation. It leads to the scalability problem and the communication latency increases as users grows. This paper proposes a bandwidth- and latency-aware peer-to-peer (P2P) instant friend cast scheme for every user (or peer) in OSNs to construct a friend cast tree (FCT) to send instant messages to all of its friends. A lightweight server is responsible for only easy tasks, such as logining and maintaining peer information, to facilitate the tree construction. A peer logins to the server to obtain the list of friends and their Vivaldi coordinates, which are computed by every peer in a distributed way to estimate the latency between peers. The proposed scheme also uses Available Out-Degree Estimation (AODE) to evaluate the proper out-degree of a peer, and then uses Degree-Adapted Greedy Tree Algorithm (DATGA) to construct FCT. The scheme is simulated and compared with other relevant ones to show its advantages.

关键词： Peer to peer computing Bandwidth Computer architecture Servers Algorithm design and analysis Internet Facebook

来源：评论

学校读者我要写书评

暂无评论

A computing Mode Suitable for Medium and Small-sized Enterprises Cloud computing

A Computing Mode Suitable for Medium and Small-sized Enterpr...

引用

2010 international conference on Intelligent Computation Technology and Automation(2010 智能计算技术与自动化国际会议 ICICTA 2010)

作者： Wei Liu Liyan Zhang Chunying Wu Hongli Cai Lele Qin Hebei University of Science & Technology Shijizhuang Hebei050018China

ISBN: (纸本)9781424472796

Cloud computing is a development and integration result of distributed processing, parallel processing and grid computing technologies. It helps the enterprise switch the resources according to the applications, accesses computer and storage systems according to the demand. And it provides a new computing model for enterprise informatization. This paper introduces items reaited to cloud computing: the concept, the theory, cloud level, the main form, the security analysis, as well as cloud storage.

关键词： computing model cloud computing medium and small-sized enterprises

来源：评论

学校读者我要写书评

暂无评论

A High-Performance Scalable computing System on the RapidIO Interconnect Architecture

A High-Performance Scalable Computing System on the RapidIO ...

引用

international conference on Cyber-Enabled distributed computing and Knowledge Discovery, CyberC

作者： Yong Zhang Yong Wang Ping Zhang Wireless Technology Innovation Institute Key Laboratory of Universal Wireless Communication Ministry of Education Beijing University of Posts and Telecommunications Beijing China Key Laboratory of Universal Wireless Communication Ministry of Education Beijing University of Posts and Telecommunications Beijing China

In order to meet the demanding requirements of scalability, adaptability and computational capability of next-generation signal-processing system, a flexible and high-performance signal-processing module based on Serial RapidIO (SRIO) interconnect and Advanced Mezzanine Card (AMC) modules is developed. RapidIO is a packet-switched interconnect intended primarily as an intra-system interface, allowing chip-to-chip and board-to-board communications at 10 Gigabit per second performance levels. The AMC specification is defined by PCI Industrial Computer Manufacturer Group (PICMG) and mainly covers the base-level requirements for a wide-range of high-speed mezzanine cards optimized for, but not limited to, Advanced Telecommunications computing Architecture (ATCA) Carriers systems. With this versatile module, massively parallel multi-processor computing system is feasible. A prototype of 12 modules is introduced and an application of this computing system in MIMO-OFDM system is covered.

关键词： Fabrics Ethernet networks Backplanes Connectors Topology Signal processing Hardware

来源：评论

学校读者我要写书评

暂无评论

Structural Aware Quantitative Interprocedural Dataflow Analysis

Structural Aware Quantitative Interprocedural Dataflow Analy...

引用

23th international conference on Architecture of computing systems 2010

作者： Carsten Gremzow Nico Moser TU Berlin Department of Computer Engineering and Microelectronics D-10587 Germany

A key challenge in system design whether for high performance computing or in embedded systems is to automatically partition software on the thread level for target architectures like multi-core, heterogeneous, or even hardware/software co-design systems. Similar to the techniques employed on the instruction level, the inter-procedural data flow in a software system is an essential property for identifying global data dependencies and hence extracting tasks or exploiting coarse grained parallelism. Also, detailed insight into the global data flow in quantity and its dynamics is vital to precisely estimate interconnect resources demands (e.g. bandwidth, latency) in distributed or embedded, heterogeneous target environments. This paper presents a novel approach to quantitative, global dataflow analysis based on a virtual instruction set architecture, which allows precise investigation of interprocedural dataflow over time of complex software system from the atomic to the transactional level. The introduced analysis system LLILA is part of the Synphony HW/SW co-design framework and can be used to evaluate the quality of system partitioning.

关键词： Software Runtime Hardware Transform coding parallel processing Arrays

来源：评论

学校读者我要写书评

暂无评论

Implementation of cryptographic algorithms on a Grid infrastructure

Implementation of cryptographic algorithms on a Grid infrast...

引用

IEEE international conference on Automation, Quality and Testing, Robotics, AQTR

作者： E. Cebuc A. Suciu K. Marton S. Dolha L. Muresan Technical University of Cluj Napoca Romania

ISBN: (纸本)9781424467242;9781424467228

Cryptographic algorithms are the fundamental building blocks of information security systems and their strength generally relies on the concept of computational complexity. But the process of increasing the computational effort needed by an adversary in order to break the provided security has a dramatic impact on the performance of the cryptographic application and sets a severe limit to the proposed security level due to the computational and data intensive operations which require extensive processing power and storage resources. Our solution is to link cryptography to an architecture specially designed to satisfy these demands, namely Grid computing, which has known an increasing popularity in recent years. The wide majority of cryptographic algorithms are designed sequentially and are not ready to embrace the enhancement brought by advances in parallel and distributed computing technologies and hence can not take the plunge to a higher performance level through parallel execution without a proper adjustment process. This paper presents our results on adjusting and implementing several well known cryptographic algorithms on a Grid infrastructure focusing on the achieved performance improvements.

关键词： Cryptography Information security Data security Power system security Computational complexity Secure storage Computer architecture Grid computing Algorithm design and analysis distributed computing

来源：评论

学校读者我要写书评

暂无评论

Real Time Commit Protocol-ACTIVE

Real Time Commit Protocol-ACTIVE

引用

international conference on P2P, parallel, Grid, Cloud and Internet computing (3PGCIC)

作者： Udai Shanker Nikhil Agarwal Praphull Goel Shalabh K. Tiwari Praveen Srivastava M.M.M. Engineering College Gorakhpur India

Many existing commit protocols try to improve system performance by allowing a committing cohort to lend its data to an executing cohort, thus reducing data inaccessibility. They block the borrower from sending WORKDONE/PREPARED message and restrict them from lending data so that transaction abort chain is limited to one. Thus, transaction execution time increases. This paper proposes a modified real time commit protocol for distributed real time database systems (DRTDBS), Allow Commit Dependent and in Time borrowers for Incredible Value added data lending without Extended abort chain (ACTIVE), where borrower cohorts are categorized as commit and abort dependent. Further, the commit dependent borrowers can lend data to executing cohorts with still limiting the transaction abort chain to one only and reducing the data inaccessibility. Also, an incoming executing cohort having borrowing factor greater than one can only borrow the dirty data items from lender. This minimizes the fruitless borrowing by the cohort. The performance of ACTIVE is compared with PROMPT, 2SC and SWIFT protocols for both main memory resident and disk resident databases with and without communication delay. Simulation results show that the proposed protocol improves the system performance up to 4% as transaction miss percentage.

关键词： Protocols Real time systems distributed databases Delay Database systems Simulation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 48 49 50 51 52 53 54 55 56 57 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：