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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,393 篇 工学
- 1,180 篇 计算机科学与技术...
- 600 篇 软件工程
- 296 篇 信息与通信工程
- 175 篇 电气工程
- 101 篇 控制科学与工程
- 97 篇 电子科学与技术（可...
- 59 篇 动力工程及工程热...
- 55 篇 机械工程
- 41 篇 仪器科学与技术
- 31 篇 生物工程
- 26 篇 网络空间安全
- 25 篇 生物医学工程（可授...
- 21 篇 建筑学
- 16 篇 环境科学与工程（可...
- 16 篇 安全科学与工程
- 15 篇 光学工程
- 15 篇 土木工程
357 篇 管理学
- 290 篇 管理科学与工程(可...
- 99 篇 图书情报与档案管...
- 95 篇 工商管理
327 篇 理学
- 195 篇 数学
- 63 篇 物理学
- 63 篇 系统科学
- 44 篇 生物学
- 30 篇 统计学（可授理学、...
- 15 篇 化学
26 篇 经济学
- 26 篇 应用经济学
23 篇 法学
- 18 篇 社会学
15 篇 农学
- 14 篇 作物学
15 篇 医学
- 14 篇 临床医学
10 篇 文学
2 篇 艺术学
1 篇 军事学

主题

275 篇 peer to peer com...
237 篇 distributed comp...
203 篇 computer network...
176 篇 wireless sensor ...
132 篇 protocols
131 篇 grid computing
120 篇 cloud computing
107 篇 computational mo...
102 篇 routing
91 篇 delay
89 篇 computer archite...
88 篇 mobile computing
87 篇 servers
81 篇 algorithm design...
79 篇 ad hoc networks
78 篇 mobile communica...
77 篇 bandwidth
75 篇 concurrent compu...
75 篇 network topology
68 篇 computer science

机构

22 篇 institute of com...
16 篇 institute of com...
10 篇 national laborat...
8 篇 school of comput...
8 篇 school of comput...
8 篇 graduate univers...
8 篇 school of comput...
8 篇 school of comput...
7 篇 national laborat...
7 篇 seikei universit...
7 篇 key laboratory o...
6 篇 department of co...
6 篇 rissho universit...
6 篇 national laborat...
6 篇 chinese academy ...
5 篇 key laboratory o...
5 篇 graduate univers...
4 篇 inria
4 篇 department of ma...
4 篇 nokia research c...

作者

8 篇 kurt rothermel
7 篇 zhang desheng
7 篇 makoto takizawa
7 篇 valentin cristea
7 篇 rothermel kurt
6 篇 zomaya albert y.
6 篇 li jinbao
6 篇 ailixier aikebai...
6 篇 frank dürr
5 篇 wei liu
5 篇 tang tao
5 篇 lin yisong
5 篇 min geyong
5 篇 tomoya enokido
5 篇 jin hai
5 篇 guo longjiang
5 篇 kai xiang
5 篇 jiannong cao
4 篇 qishi wu
4 篇 zhang lei

语言

2,386 篇 英文
5 篇 中文
2 篇 其他

检索条件"任意字段=2010 International Conference on Parallel and Distributed Computing and Networks, PDCN 2010"

共 2393 条记录，以下是2021-2030 订阅

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

详细简洁

排序：

An Algorithm for Assigning Tasks in parallel computing

An Algorithm for Assigning Tasks in Parallel Computing

引用

The Third international Joint conference on Computational Science and Optimization(第三届计算科学与优化国际大会 CSO 2010)

作者： Yang Rui Zhang Xinyu School of Computer Science and Engineering Beihang University Beijing 100191 China

As the parallel distributed architectures are increasing used to solve the large-scale scientific problems, the scheduling algorithm which can heavily affect the communication overhead and the execution time is becoming more and more important for the optimization of parallel programs in real distribute system or in the performance prediction to make more precise, so it requires appropriate techniques to identify the factors which influence the application execution time and also the way they interact Generally, parallel applications characterized as a collection of tasks and their interrelations. As the number of the processes increasing, the overhead of the communication among these processes can be very impressive, different tasks assignment algorithm can affect the performance of the parallel application. This paper introduces a scheduling algorithm TMDC (Task Mapping based on Dependence and Communication) for assigning tasks to the processors and minimizes the communications volume to optimize the total execution time. It's based on the DAGs can helps to understand the details of the application and to increase the accuracy of the prediction models.

关键词： parallel performance task assignment shcedule event driven

来源：评论

学校读者我要写书评

暂无评论

MB-tree: A quick indexing structure for multi-dimensional space

MB-tree: A quick indexing structure for multi-dimensional sp...

引用

international conference on Advanced Computer Theory and Engineering, ICACTE

作者： Hai Huang Ying Hou Li-Xiong Liu Fu-Cai Chen National Digital Switching System Engineering & Technological Research Center Zhengzhou China

Efficient indexing structure is the key of multi-dimension retrieval issue. Lots of indexing structures are failed in the parallelism. This paper presents multi-branch indexing tree (MB-tree), using the nearest neighbor criterion to realize the multi space division of the data sets. The experimental results indicate that the structure is suitable for parallel computing and can significantly improve the speed of similarity query.

关键词： Indexing Computational efficiency distributed databases Streaming media Real-time systems Multimedia databases Urban areas

来源：评论

学校读者我要写书评

暂无评论

Sentomist: Unveiling Transient Sensor Network Bugs via Symptom Mining

Sentomist: Unveiling Transient Sensor Network Bugs via Sympt...

引用

IEEE international conference on distributed computing Systems

作者： Yangfan Zhou Xinyu Chen Michael R. Lyu Jiangchuan Liu Dept. of Computer Science & Engineering The Chinese niv. of Hongong School of Computing Science Simon Fraser niv.

ISBN: (纸本)9781424472611;9780769540597

Wireless Sensor Network (WSN) applications are typically event-driven. While the source codes of these applications may look simple, they are executed with a complicated concurrency model, which frequently introduces software bugs, in particular, transient bugs. Such buggy logics may only be triggered by some occasionally interleaved events that bear implicit dependency, but can lead to fatal system failures. Unfortunately, these deeply-hidden bugs or even their symptoms can hardly be identified by state-of-the-art debugging tools, and manual identification from massive running traces can be prohibitively expensive. In this paper, we present Sentomist (Sensor application anatomist), a novel tool for identifying potential transient bugs in WSN applications. The Sentomist design is based on a key observation that transient bugs make the behaviors of a WSN system deviate from the normal, and thus outliers (i.e., abnormal behaviors) are good indicators of potential bugs. Sentomist introduces the notion of event-handling interval to systematically anatomize the long-term execution history of an event-driven WSN system into groups of intervals. It then applies a customized outlier detection algorithm to quickly identify and rank abnormal intervals. This dramatically reduces the human efforts of inspection (otherwise, we have to manually check tremendous data samples, typically with brute-force inspection) and thus greatly speeds up debugging. We have implemented Sentomist based on the concurrency model of TinyOS. We apply Sentomist to test a series of representative real-life WSN applications that contain transient bugs. These bugs, though caused by complicated interactions that can hardly be predicted during the programming stage, are successfully confined by Sentomist.

关键词： bugs Bugs Concurrency Model Wireless sensor networks WSN gene Debugging system failures abnormal behavior Detection algorithms Data sampling

来源：评论

学校读者我要写书评

暂无评论

Data Allocation in distributed Data Base in the Network Using Modularization Algorithm

Data Allocation in Distributed Data Base in the Network Usin...

引用

international conference on Computer Modeling and Simulation, UKSIM

作者： Rezvam Mahmoudie Sa Eed Parsa Young researchers club Qazvin Islamic Azad University Qazvin Iran Iran University of Science and Technology Tehran Iran

ISBN: (纸本)9781424466146;9780769540160

ABSTRACT- Data allocation issue is one of the significant and essential discussions in distributed data base systems. In these systems, operators are located in different places and have to get access to a joint data base. These data have been distributed within the network. Many models have been designed in order to resolve this problem. Also, some algorithms are devised for the purpose of decreasing data transferring expense and decreasing the time of responding. The most important expense belongs to data transferring. This cost equals to a query's access to the required data from different sites to the place in which the query has been produced. In this article, we deal with modularization algorithms which make data transferring expense reduce during a query execution. These algorithms accomplish this by optional modularization of the sites in which the data are located.

关键词： Clustering algorithms Costs Computer networks distributed computing Computational modeling Computer simulation Query processing Scattering Algorithm design and analysis Design optimization

来源：评论

学校读者我要写书评

暂无评论

Traffic in Social Media II: Modeling Bursty Popularity

Traffic in Social Media II: Modeling Bursty Popularity

引用

IEEE international conference on Social computing (SocialCom)

作者： Jacob Ratkiewicz Filippo Menczer Santo Fortunato Alessandro Flammini Alessandro Vespignani Center of Complex Networks and Systems Research School of Informatics and Computing Indiana University Bloomington IN USA Complex Networks and Systems Lagrange Laboratory (CNLL) ISI Foundation Turin Italy

Online popularity has enormous impact on opinions, culture, policy, and profits, especially with the advent of the social Web and Web advertising. Yet the processes that drive popularity in our online world have only begun to be explored. We provide a quantitative, large scale, longitudinal analysis of the dynamics of online content popularity in two massive model systems, the Wikipedia and an entire country's Web space. In these systems, we track the change in the number of links to pages, and the number of times these pages are visited. We find that these changes occur in bursts, whose magnitude and time separation are very broadly distributed. This finding is in contrast with previous reports about news-driven content, and has profound implications for understanding collective attention phenomena in general, and Web trends in particular. To make sense of these empirical results, we offer a simple model that mimics the exogenous shifts of user attention and the ensuing non-linear perturbations in popularity rankings. While established models based on preferential attachment are insufficient to explain the observed dynamics, our stylized model is successful in recovering the key features observed in the empirical analysis of our systems.

关键词： Internet Encyclopedias Electronic publishing Data models Time measurement History

来源：评论

学校读者我要写书评

暂无评论

A distributed parallel approach for BGP routing table partitioning in next generation routers

A distributed parallel approach for BGP routing table partit...

引用

conference on Local Computer networks (LCN)

作者： Wissam Hamzeh Abdelhakim Hafid NRL University of Montreal Canada

The rapid growth of routing tables represents a major challenge facing the scalability of BGP and indeed the whole Internet infrastructure. In this paper, we introduce a novel distributed algorithmic scheme for partitioning the BGP routing table on multiple controller cards, where we exploit parallelism to enhance both the lookup speed and the scalability of the RIB (Routing Information Base). The proposed scheme increases the lookup performance by letting unrelated tasks, such as the Best Match Prefix (BMP) lookup and the BGP decision process to be executed in parallel at different controller cards. Simulations show that our proposal outperforms classical central lookup mechanisms with a reasonably acceptable cost, while it increases considerably the space scalability of the BGP routing table.

关键词： Routing Peer to peer computing Scalability Routing protocols Process control Synchronization

来源：评论

学校读者我要写书评

暂无评论

Multi-packet & multi-session signature detection using state based model

Multi-packet & multi-session signature detection using state...

引用

IEEE international Advance computing conference, IACC

作者： Pramod S. Pawar Mayank Pal Singh Sachin Narayanan Computer Network and Internet Engineering(CNIE) Centre for Development of Advanced Computing Bangalore India

ISBN: (纸本)9781424447909

Signature Detection modules in IDS/IPS though accurate in pattern matching, yet it leads to false positives. This is due to the incompleteness of the signatures which lacks or has very little information about when, where and how to match these signatures. The signatures enriched with this information significantly brings down the false positives and at the same time enhances the performance of the signature detection module. In this paper we propose a state base signature detection model which leverages on our state aware signatures with sufficiently complete information to match these signatures. The proposed model keeps track of the state of the connection and matches the signatures within appropriate packets. We further classify our signatures that span across multiple packet and across multiple sessions. We also provide the notion of virtual signatures which represents patterns within packets in a distributed form. In this paper we demonstrate the capabilities of our proposed model to detect these virtual patterns, multi-packet and multi-session leveraging on our state aware signatures.

关键词： Intrusion detection Computer networks IP networks Search engines Pattern matching Protocols Change detection algorithms Telecommunication traffic Computer vision

来源：评论

学校读者我要写书评

暂无评论

Cloud-MAQ: The cloud-enabled scalable whole genome reference Assembly application

Cloud-MAQ: The cloud-enabled scalable whole genome reference...

引用

IFIP international conference on Wireless and Optical Communications networks (WOCN)

作者： Asoke K Talukder Santhosh Gandham H. A Prahalad Nitai Pada Bhattacharyya Geschickten Solutions A501 Ashwini 100Ft Ring Road BSK II Stage Bangalore 560070 India Crystallography and Molecular Biology Division Saha Institute of Nuclear Physics Kolkata India

Biology problems are in general NP-hard that demands tremendous resource both in terms of time and computing resources. Most of the computing systems developed for quantifying biological objects suffer from such limitations. MAQ (Mapping and Assembly with Quality) is one such popular bioinformatics system developed for whole genome reference assembly - it is designed to handle the challenges related to short sequence reads generated by Illumina sequencing machines, and can support a maximum read length of 63 nucleotides. MAQ is not multithreaded or many core ready - it runs on single CPU and does not scale. Therefore, as the data size increases, it fails to scale efficiently and requires a supercomputer to perform the assembly within a desired time. In this paper we report Cloud-MAQ that uses the cloud computing paradigm to address the NP-hard related challenges of whole genome reference assembly. Through Hadoop and the cloud paradigm MAQ is made parallel and scalable. Also, MAQ functionality has been enhanced to support recent reads from Illumina that are of 76 nucleotides. This cloud-enabled Cloud-MAQ increases the performance of MAQ reference assembly multi-fold.

关键词： Assembly Bioinformatics Genomics Cloud computing Software Clouds

来源：评论

学校读者我要写书评

暂无评论

Load-Balancing Properties of 3D Voronoi Diagrams in Peer-to-Peer Virtual Environments

Load-Balancing Properties of 3D Voronoi Diagrams in Peer-to-...

引用

international conference on parallel and distributed Systems (ICPADS)

作者： Mahathir Almashor Ibrahim Khalil Royal Melbourne Institute of Technology University Australia

Balancing communication workloads is a perennial performance issue in the area of distributed Virtual Environments (DVE). The stringent time constraints of Multiplayer Online Games (MOG) complicate efforts to effectively distribute the networking load amongst servers. This issue becomes ever more exacting, when we move towards a fully Peer-to-peer virtual world (P2P-VE). We are consequently forced to factor in the limited capabilities of ordinary peers in the network. Traditional MOGs have been built on the client-server (CS) paradigm and the industry brute-force approach of over-provisioning resources is both inelegant and non-resilient in the face of failures. Moving such systems onto P2P architectures mitigates these drawbacks significantly. Our recent application of three-dimensional Voronoi Diagrams (3D-VD) onto P2P-VEs has further introduced desirable load-balancing properties in such systems. This is due to the novel use network capacity as the metric for the 3rd dimension and the subsequent use of the 3D-VD to intelligently appoint dynamic game-play arbitrators from amongst the peer population. This short paper is a preliminary report on the load-balancing properties seen in our extensive simulations. It is shown how this approach is able to appropriately distribute load in a variety of network configurations and peer populations. Thus, the performance of the collaborating peers is enhanced, ultimately leading to better game-play experience.

关键词： Peer to peer computing Servers Games Three dimensional displays Virtual environment Industries Measurement

来源：评论

学校读者我要写书评

暂无评论

Cooperative Spectrum Sensing with Multi-Channel Coordination in Cognitive Radio networks

Cooperative Spectrum Sensing with Multi-Channel Coordination...

引用

IEEE international conference on Communications (ICC)

作者： C. Song Q. Zhang Hong Kong University of Science and Technology Hong Kong China

Accurate spectrum sensing is one of the key technologies to enable dynamic spectrum access in cognitive radio networks. Recently cooperative spectrum sensing is proposed as an efficient way to achieve better sensing accuracy. It makes use of multiple nodes to sense a channel and then analyzes their results together to get more accurate results. Several works have been conducted to study this technology and they mostly focus on the cooperation in individual channels. However, cognitive radio networks usually deal with multiple channels, therefore the coordination among multiple channels needs be studied to fully explore the potential of cooperative sensing. In this paper we focus on the coordination among multiple channels in cooperative spectrum sensing. We at first study the theoretical improvement made by multi-channel coordination, then propose a centralized and a distributed algorithm to implement it. The theoretical analysis proves cooperative sensing can be improved significantly if the coordination among multiple channels is considered. To verify our analysis, we measure licensed channels then conduct simulations basing on collected data. The results show that the proposed algorithms can approximate optimal solution very well.

关键词： Cognitive radio Interference Paper technology Wireless sensor networks Communications Society Peer to peer computing distributed algorithms Analytical models Signal to noise ratio Performance analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共240页 << < 199 200 201 202 203 204 205 206 207 208 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：