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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

608 篇 会议
9 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

341 篇 工学
- 332 篇 计算机科学与技术...
- 204 篇 软件工程
- 122 篇 信息与通信工程
- 34 篇 电气工程
- 25 篇 控制科学与工程
- 24 篇 电子科学与技术（可...
- 8 篇 动力工程及工程热...
- 8 篇 测绘科学与技术
- 7 篇 机械工程
- 7 篇 建筑学
- 6 篇 生物工程
- 5 篇 光学工程
- 5 篇 安全科学与工程
- 3 篇 力学（可授工学、理...
- 3 篇 土木工程
- 3 篇 生物医学工程（可授...
- 2 篇 仪器科学与技术
109 篇 理学
- 90 篇 数学
- 13 篇 系统科学
- 12 篇 统计学（可授理学、...
- 9 篇 物理学
- 9 篇 生物学
- 5 篇 化学
- 2 篇 大气科学
- 2 篇 地球物理学
76 篇 管理学
- 51 篇 管理科学与工程(可...
- 43 篇 工商管理
- 27 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
4 篇 医学
- 4 篇 临床医学
2 篇 法学
1 篇 教育学
1 篇 农学

主题

174 篇 distributed comp...
111 篇 computer network...
100 篇 software enginee...
93 篇 artificial intel...
73 篇 concurrent compu...
55 篇 computer science
47 篇 grid computing
47 篇 distributed comp...
45 篇 peer to peer com...
39 篇 application soft...
31 篇 parallel process...
31 篇 wireless sensor ...
30 篇 network topology
29 篇 parallel process...
29 篇 delay
28 篇 costs
25 篇 algorithm design...
25 篇 large-scale syst...
24 篇 protocols
23 篇 resource managem...

机构

3 篇 department of co...
3 篇 department of co...
3 篇 school of inform...
3 篇 national laborat...
3 篇 institute of com...
3 篇 school of comput...
3 篇 school of comput...
2 篇 univ sci & techn...
2 篇 huazhong univ sc...
2 篇 department of co...
2 篇 univ adelaide sc...
2 篇 school of comput...
2 篇 univ technol syd...
2 篇 department of co...
2 篇 school of manage...
2 篇 sharif universit...
2 篇 school of comput...
2 篇 lab. com. phys. ...
2 篇 natl univ def te...
2 篇 school of comput...

作者

4 篇 xicheng lu
4 篇 aaron harwood
4 篇 nong xiao
3 篇 shietung peng
3 篇 hong chen
3 篇 rui chu
3 篇 wenhong wei
3 篇 yongxuan lai
3 篇 huanguo zhang
3 篇 engelmann christ...
3 篇 gerald kunzmann
3 篇 wenjun xiao
2 篇 nandi asoke k.
2 篇 xing-ming li
2 篇 choi k.
2 篇 ling zhang
2 篇 wu cheng
2 篇 lo re giuseppe
2 篇 kodama eiichiro
2 篇 brzezinski krzys...

语言

620 篇 英文

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

共 620 条记录，以下是611-620 订阅

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

详细简洁

排序：

RAM Grid Middleware for Autonomic Cooperative Caching

RAM Grid Middleware for Autonomic Cooperative Caching

引用

第六届网格与协同计算国际会议(The Sixth international conference on Grid and Cooperative computing GCC 2007)

作者： Rui Chu Jiancong Xie Nong Xiao Xicheng Lu National Laboratory for Parallel and Distributed Processing ChangSha HuNan China

As an innovative grid computing technique for sharing the distributed memory resources in a widearea network, RAM Grid exploits the free nodes to provide remote memory for others. The data intensive applications with massive random disk IO, such as the web server or database systems, have potential benefits from RAM Grid. We analyzed the trace collected from real servers, and proposed the key issues and solution of the caching RAM Grid system for such applications,to reduce the IO overhead. Furthermore, we proposed an autonomic cooperation mechanism to improve the performance through time correlation and content redundancy detection and elimination. We have verified the effectiveness of the proposed method through comprehensive trace-driven simulations.

关键词： Middleware Cooperative caching Random access memory Read-write memory Grid computing Wide area networks Computer networks Web server Database systems Application software

来源：评论

学校读者我要写书评

暂无评论

Simulation of the Fuel Cell Thermal Behavior with Unified parallel C

Simulation of the Fuel Cell Thermal Behavior with Unified Pa...

引用

IEEE international conference on Signal Processing and Communications, ICSPC

作者： A. Salah O. Serres J. Gaber R. Outbib H. El-Sayed Universite de technologie de Belfort-Montbeliard France George Washington University HPCL USA Laboratoire LSIS France Department of Computer Science Bowie State University USA

In this paper, a parallel simulation to analyze the thermal behavior of proton exchange membrane fuel cells (PEMFC), using Unified parallel C (UPC) is presented. PEMFCs are considered as very promising alternative solution for energy generations in the future for stationary and mobile applications. In particular, they are the most favored fuel cell (FC) type to power electric vehicles of the future as a replacement for the internal combustion engine. The computation model based on the global nodal network method (GNNM) used to describe the thermal behavior presents high scalability and intrinsic parallel characteristics suitable for parallel implementation. The objective of this work is to develop a parallel implementation of GNNM using the Unified parallel C (UPC) for a cluster of processors according to the distributed shared memory programming paradigm. UPC is an explicit parallel language that provides the facilities for direct user specification of program parallelism and control of data distribution and access to maximize performance. Due to its global address space, UPC simplify the management of ghost zones in large-scale simulations. Simulations results shows that computation time to conduct thermal behavior simulation is drastically reduced compared to sequential simulations and obtained simulation data are highly accurate and precise.

关键词： Fuel cells Computational modeling Analytical models Protons Biomembranes Electric vehicles Internal combustion engines Computer networks Concurrent computing Scalability

来源：评论

学校读者我要写书评

暂无评论

Improving Search Using a Fault-Tolerant Overlay in Unstructured P2P Systems

Improving Search Using a Fault-Tolerant Overlay in Unstructu...

引用

international conference on parallel Processing (ICPP)

作者： William Acosta Surendar Chandra University of Notre Dame USA

Gnutella overlays have evolved to use a two-tier topology. However, we observed that the new topology had only achieved modest improvements in search success rates. Also, the new two-tier topology had not reduced the message routing overhead and bandwidth consumption. In this work, we used local information at each node to construct an overlay, Makalu, that improved search performance and reduced bandwidth consumption. The overlay maximized the expansion from each node's neighborhood while minimizing the latency to its neighbors. We show that for a 100,000 node system, wild card searches using flooding successfully resolved most queries within four hops for object replications ratios as lows as 0.05% (50 randomly distributed copies) with less than 3% duplicate messages. Using attenuated bloom filters to route messages for exact identifier searches, we show that Makalu resolved most queries with less than ten messages for networks as large as 100,000 nodes. The performance of this search is comparable to that of structured P2P systems. Finally, using data from traffic traces of Gnutella in 2003 and 2006, we demonstrated search success rates that were up to five times more successful and required 75% less bandwidth on a Makalu overlay than on a modern Gnutella overlay.

关键词： Fault tolerant systems Peer to peer computing Bandwidth Protocols Routing Topology Floods Delay Filters Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

Windowed FIFOs for FPGA-based Multiprocessor Systems

Windowed FIFOs for FPGA-based Multiprocessor Systems

引用

international conference on Application Specific Systems (ASAP), Architectures and Processors

作者： Kai Huang David Grunert Lothar Thiele Swiss Federal Institute of Technology Zurich Computer Engineering and Networks Laboratory ETH Zurich Zurich Switzerland

FPGA-based multiprocessor systems are viable solutions for stream-based embedded applications. They provide a software abstraction which enables coarse-grained parallel deployment on an FPGA chip. A widely used model for such a deployment is the class of Kahn process networks despite their limitation to pure FIFO communications. In this paper, a new mechanism denoted as windowed FIFO is introduced, extending the functionality for data transfer. The new concept allows non-destructive read, reordering, and skipping of data within a communication channel. We present the behavior, the software interface and the hardware design of this mechanism. We introduce our abstraction of WFIFO process network which is suitable for systematic and automated synthesis while still inheriting the nice property of Kahn process networks, i.e. being determinate. Also, we present illuminating examples to demonstrate the practicality of the outlined approach.

关键词： Multiprocessing systems Field programmable gate arrays Communication channels Computer architecture Hardware Network synthesis distributed control Computer networks Embedded computing Laboratories

来源：评论

学校读者我要写书评

暂无评论

e-SAFE: An Extensible, Secure and Fault Tolerant Storage System

e-SAFE: An Extensible, Secure and Fault Tolerant Storage Sys...

引用

international conference on Self-Adaptive and Self-Organizing Systems (SASO)

作者： Sandip Agarwala Arnab Paul Umakishore Ramachandran Karsten Schwan College of Computing Georgia Tech Atlanta GA USA Intel Corporation Portland OR USA

This paper describes e-SAFE , a scalable utility-driven distributed storage system that offers very high availability at an archival scale and reduces management overhead such as periodic repairs. e-SAFE is designed to provide a storage utility for environments such as large-scale data centers in enterprise networks where the servers experience temporary unavailability (possibly high load, temporary downtimes due to repair or software/hardware upgrades). e-SAFE is based on a simple principle: efficiently sprinkle data all over a distributed storage and robustly reconstruct even when many of them are unavailable. e-SAFE also provides strong guarantee on data-integrity. The use of Fountain codes for replicating file data blocks, an efficient algorithm for fast parallel encoding and decoding over multiple file segments, a utility module for service differentiation and auto-adjustments of design parameters, and a background replication mechanism hiding the cost of replication and dissemination from the user, provide a fast, durable and autonomous storage solution.

关键词： Fault tolerant systems Secure storage Availability Environmental management Large-scale systems Network servers Hardware Robustness Encoding Decoding

来源：评论

学校读者我要写书评

暂无评论

ASAP: An Advertisement-based Search Algorithm for Unstructured Peer-to-peer Systems

ASAP: An Advertisement-based Search Algorithm for Unstructur...

引用

international conference on parallel Processing (ICPP)

作者： Peng Gu Jun Wang Hailong Cai Electrical Engineering and Computer Science University of Central Florida Orlando FL USA Google Inc. Mountain View CA USA

Most of existing search algorithms for unstructured peer-to-peer (P2P) systems share one common approach: the requesting node sends out a query and the query message is repeatedly routed and forwarded to other peers in the overlay network. Due to multiple hops involved in query forwarding, the search may result in a long delay before it is answered. Furthermore, some incapable nodes may be easily overloaded when the query traffic becomes intensive or bursty. In this paper, we present a novel content-pushing, Advertisement-based search algorithm for unstructured P2P systems called ASAP. An advertisement (ad in brief) is a synopsis of contents a peer tends to share, and appropriately distributed and selectively cached by other peers in the system. In ASAP, nodes proactively advertise their contents by delivering ads, and selectively store interesting ads received from other peers. Upon a request, a node can locate the destination nodes by looking up its local ads repository, and thus obtain a one-hop search latency with modest search cost. Comprehensive experimental results show that, compared with traditional query-based search algorithms, ASAP achieves much better search efficiency, and maintains system load at a low level with small variances. In addition, ASAP works well under node churn.

关键词： Peer to peer computing Delay Costs Telecommunication traffic Routing Computer science Bandwidth Computer networks Scalability Vehicles

来源：评论

学校读者我要写书评

暂无评论

RouteGA: A Grid Load Balancing Algorithm with Genetic Support

RouteGA: A Grid Load Balancing Algorithm with Genetic Suppor...

引用

international conference on Advanced Information Networking and Applications (AINA)

作者： Rodrigo F. de Mello Jose A. Andrade Filho Luciano J. Senger Laurence T. Yang Instituto de Ciências Matemáticas e de Computação Departmento de Ciencias de Computação Universidade de Sáo Paulo Sao Paulo Brazil Departamento de Informática Universidade Estadual de Ponta Grossa Ponta Grossa Parana Brazil Saint Francis Xavier University Antigonish NS Canada

Motivated by the first process allocation limitations of the original Route load balancing algorithm, this paper presents RouteGA (Route with Genetic Algorithm support) which considers historical information about parallel application executions in order to optimize the first scheduling. This information is extracted by using monitors and summarized in a knowledge base used to quantify process occupation at the launch moment. Such occupation is used to parameterize a genetic algorithm responsible for optimizing the process allocation on heterogeneous computing environments such as Grids. Results confirm RouteGA over- performs the original Route, which had previously overper-formed others from literature.

关键词： Load management Application software Concurrent computing Genetic algorithms Grid computing Scheduling algorithm Data mining Machine learning algorithms distributed computing Computer networks

来源：评论

学校读者我要写书评

暂无评论

Efficient detection of dangling pointer error for C/C++ programs 2

Efficient detection of dangling pointer error for C/C++ prog...

引用

2nd Annual international conference on Information System and Artificial Intelligence, ISAI 2017

作者： Zhang, Wenzhe Science and Technology on Parallel and Distributed Laboratory State Key Laboratory of High Performance Computing State Key Laboratory of High-end Server and Storage Technology College of Computer National University of Defense Technology Changsha China

Dangling pointer error is pervasive in C/C++ programs and it is very hard to detect. This paper introduces an efficient detector to detect dangling pointer error in C/C++ programs. By selectively leave some memory accesses unmonitored, our method could reduce the memory monitoring overhead and thus achieves better performance over previous methods. Experiments show that our method could achieve an average speed up of 9% over previous compiler instrumentation based method and more than 50% over previous page protection based method. © Published under licence by IOP Publishing Ltd.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

Separability and Topology Control of Quasi Unit Disk Graphs

Separability and Topology Control of Quasi Unit Disk Graphs

引用

IEEE Annual Joint conference: INFOCOM, IEEE Computer and Communications Societies

作者： J. Chen A. Jiang I. A. Kanj G. Xia F. Zhang Department of Computer Science Texas A and M University College Station TX USA School of CTI De Paul University Chicago IL USA Department of Computer Science Lafayette College Easton PA USA

A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protocols for wireless networks - routing, topology control, information storage/retrieval and numerous other applications - have been based on the idealized unit-disk graph (UDG) network model. The significant deviation of the UDG model from many real wireless networks is substantially limiting the applicability of such protocols. A more general network model, the quasi unit-disk graph (quasi-UDG) model, captures much better the characteristics of wireless networks. However, the understanding of the properties of general quasi-UDGs has been very limited, which is impeding the designs of key network protocols and algorithms. In this paper, we present results on two important properties of quasi-UDGs: separability and the existence of power efficient spanners. Network separability is a fundamental property leading to efficient network algorithms and fast parallel computation. We prove that every quasi-UDG has a corresponding grid graph with small balanced separators that captures its connectivity properties. We also study the problem of constructing an energy-efficient backbone for a quasi-UDG. We present a distributed localized algorithm that, given a quasi-UDG, constructs a nearly planar backbone with a constant stretch factor and a bounded degree. We demonstrate the excellent performance of these auxiliary graphs through simulations and show their applications in efficient routing.

关键词： Wireless networks Wireless application protocol Network topology Spine Routing protocols Information retrieval Impedance Algorithm design and analysis Computer networks Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

EDDNet: An Efficient and Accurate Defect Detection Network for the Industrial Edge Environment

EDDNet: An Efficient and Accurate Defect Detection Network f...

引用

IEEE international conference on Software Quality, Reliability and Security (QRS)

作者： Runbing Qin Ningjiang Chen Yihui Huang School of Computer and Electronic Information Guangxi University Nanning China Guangxi Intelligent Digital Services Research Center of Engineering Technology Nanning China Guangxi Colleges and Universities Key Laboratory of Parallel and Distributed Computing Nanning China

Defect detection aims to locate the accurate position of defects in images, which is of great significance to quality inspection in the industrial product manufacturing. Currently, many defect detection methods rely on deep neural networks to extract features. Although the accuracy of these methods is relatively high, it is computationally intensive, making the methods difficult to deploy in resource-limited edge devices. In order to solve these problems, a lightweight defect detection model for the industrial edge environment is proposed, termed the efficient defect detection network (EDDNet). EfficientNet-B0 is used as the feature extraction backbone, extracting feature maps from feature layers of different depths of the network and fusing multilevel features by multilevel feature fusion (MFF). To obtain more information, we redesign the attention mechanism in MBConv blocks, taking the encoding space (ES) attention mechanism as a new module, which solves the problem that the defective image spatial information is ignored. The experimental results on the NEU-DET and DAGM2007 datasets and PCB defect datasets demonstrate the effectiveness of the proposed EDDNet and its possibility for application in industrial edge device.

关键词： Image edge detection Computational modeling Neural networks Software quality Object detection Feature extraction Transformers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共62页 << < 53 54 55 56 57 58 59 60 61 62 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：