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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

6,700 篇 会议
114 册 图书
71 篇 期刊文献

馆藏范围

6,885 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,559 篇 工学
- 3,365 篇 计算机科学与技术...
- 1,735 篇 软件工程
- 1,054 篇 信息与通信工程
- 673 篇 电气工程
- 229 篇 控制科学与工程
- 179 篇 电子科学与技术（可...
- 143 篇 机械工程
- 97 篇 动力工程及工程热...
- 97 篇 生物工程
- 94 篇 测绘科学与技术
- 42 篇 生物医学工程（可授...
- 40 篇 仪器科学与技术
- 39 篇 光学工程
- 34 篇 建筑学
- 29 篇 土木工程
- 28 篇 网络空间安全
- 27 篇 安全科学与工程
770 篇 理学
- 567 篇 数学
- 112 篇 生物学
- 102 篇 统计学（可授理学、...
- 100 篇 物理学
- 75 篇 系统科学
- 37 篇 化学
511 篇 管理学
- 383 篇 管理科学与工程(可...
- 197 篇 工商管理
- 155 篇 图书情报与档案管...
82 篇 医学
- 80 篇 临床医学
- 25 篇 基础医学(可授医学...
42 篇 经济学
- 42 篇 应用经济学
35 篇 法学
- 25 篇 社会学
12 篇 农学
10 篇 文学
8 篇 教育学
8 篇 军事学
1 篇 艺术学

主题

894 篇 distributed comp...
801 篇 computer network...
513 篇 concurrent compu...
450 篇 wireless sensor ...
376 篇 parallel process...
354 篇 computer science
352 篇 routing
344 篇 neural networks
342 篇 computational mo...
304 篇 computer archite...
260 篇 application soft...
257 篇 protocols
255 篇 network topology
253 篇 peer to peer com...
244 篇 bandwidth
235 篇 grid computing
232 篇 software enginee...
194 篇 costs
180 篇 artificial intel...
175 篇 intelligent netw...

机构

28 篇 institute of com...
24 篇 shandong provinc...
20 篇 key laboratory o...
15 篇 shandong fundame...
14 篇 department of co...
13 篇 university of ch...
12 篇 department of co...
11 篇 department of co...
11 篇 department of co...
11 篇 institute of com...
11 篇 national laborat...
11 篇 beijing universi...
10 篇 college of compu...
10 篇 institute of inf...
10 篇 school of cyber ...
10 篇 department of co...
10 篇 school of comput...
9 篇 shandong enginee...
9 篇 department of co...
9 篇 school of comput...

作者

18 篇 jiannong cao
15 篇 m. takizawa
15 篇 li dongsheng
15 篇 eyas el-qawasmeh
14 篇 shietung peng
14 篇 shen hong
14 篇 hong shen
13 篇 lemin li
13 篇 rothermel kurt
12 篇 hai jin
11 篇 dongsheng li
11 篇 jack dongarra
11 篇 wei zhang
10 篇 koibuchi michihi...
10 篇 t. enokido
10 篇 wang yang
10 篇 stephen l. scott
10 篇 j. duato
10 篇 m. ould-khaoua
9 篇 duerr frank

语言

6,817 篇 英文
56 篇 其他
16 篇 中文

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

共 6885 条记录，以下是4971-4980 订阅

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

详细简洁

排序：

7th IFIP TC 1/WG 2.2 international conference on Theoretical Computer Science, TCS 2016

7th IFIP TC 1/WG 2.2 International Conference on Theoretical...

引用

7th IFIP TC 1/WG 2.2 international conference on Theoretical Computer Science, TCS 2016

ISBN: (纸本)9783642334740

The proceedings contain 28 papers. The special focus in this conference is on Theoretical Computer Science. The topics include: Computability and non-computability issues in amorphous computing;static single information form for abstract compilation;input-driven stack automata;probabilistic inference and monadic second order logic;Cinderella versus the wicked stepmother;weak bisimulations for coalgebras over ordered functors;a context-free linear ordering with an undecidable first-order theory;open bisimulation for quantum processes;a modular LTS for open reactive systems;unidirectional channel systems can be tested;on properties and state complexity of deterministic state-partition automata;on union-free and deterministic union-free languages;a characterisation of languages on infinite alphabets with nominal regular expressions;formal verification of distributed algorithms;from pseudo code to checked proofs;a temporal logic for multi-threaded programs;the algorithmic complexity of k-domatic partition of graphs;unique parallel decomposition in branching and weak bisimulation semantics;modal interface automata;proofs as executions;efficient algorithms for the max k-vertex cover problem;compositional abstraction techniques for probabilistic automata;broadcast abstraction in a stochastic calculus for mobile networks;an intersection type system for deterministic pushdown automata;probabilistic inference and monadic second order logic and cinderella versus the wicked stepmother.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PLAPA CK: parallel linear algebra package design overview 97

PLAPA CK: Parallel linear algebra package design overview

引用

1997 ACM/IEEE conference on Supercomputing, SC 1997

作者： Alpatov, Philip Baker, Greg Edwards, Carter Gunnels, John Morrow, Greg Overfelt, James Van De Geijn, Robert Wu, Yuan-Jye J. University of Texas Austin TX 78712 United States Argonne National Laboratory Argonne IL 60439 United States

ISBN: (纸本)0897919858

Over the past twenty years, dense linear algebra libraries have gone through three generations of public domain general purpose packages. In the seventies, the first generation of packages were EISPACK and LINPACK, which implemented a broad spectrum of algorithms for solving dense linear eigenproblems and dense linear systems. In the late eigh ties, the second generation package called LAPACK was developed. This package attains high performance in a portable fashion while also improving upon the functionality and robustness of LINPACK and EISPACK. Finally, since the early nineties, a third generation package which ports LAPACK to distributed memory networks of computers has been underway as part of the ScaLAPACK project. PLAPACKis a maturing fourth generation package which uses a more application-centric view of vector and matrix distribution, Physically Based Matrix Distribut ion. It also uses an \MPI-like" programming interface that hides distribution and indexing details in opaque objects, provides a natural layering in the library, and provides a straight-forward application interface. In this paper, we give an overview of the design of PLAPACK. © 1997 ACM.

关键词： Linear systems

来源：评论

学校读者我要写书评

暂无评论

Collaborative Clustering of XML Documents

Collaborative Clustering of XML Documents

引用

international conference on parallel Processing Workshops (ICPPW)

作者： Sergio Greco Francesco Gullo Giovanni Ponti Andrea Tagarelli Department of Electronics Computer and Systems Sciences (DEIS) University of Calabria Cosenza Italy

This paper presents a distributed collaborative approach to XML document clustering. According to a previous study, XML documents are mapped to a transactional domain, based on a data representation model which exploits the notion of XML tree tuple. This XML transactional model is well-suited to the identification of semantically cohesive substructures from XML documents, according to structure as well as content information. The proposed clustering framework employs a centroid-based partitional clustering paradigm in a distributed environment. Each peer in the network is allowed to compute a local clustering solution over its own data, then exchanges cluster centroids with other peers. The exchanged centroids correspond to recommendations offered by a peer to peers allowed to compute global representatives. Exploiting these recommendations, each peer becomes responsible for computing a global set of centroids for a given set of clusters. The overall clustering solution is hence computed in a collaborative way according to data from all the peers. Our approach has been evaluated on real XML document collections varying the number of peers. Results have shown that collaborative clustering leads to accurate overall clustering solutions with a relatively low load in the network.

关键词： XML Peer to peer computing Collaborative work international collaboration parallel processing Concurrent computing distributed computing Computer networks Query processing Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Data Burst Statistics and Performance Analysis of Optical Burst Switching networks with Self-Similar Traffic

Data Burst Statistics and Performance Analysis of Optical Bu...

引用

ACIS international conference on Software Engineering, Artificial Intelligence, Networking, and parallel/distributed computing (SNPD)

作者： Wang Ruyan Wu Dapeng Guo Fang School of Communication and Information Engineering Chongqing University of Posts and Telecommunications Chongqing China Broadband Communication Network Laboratory Beijing University of Posts and Telecommunications Beijing China

The self-similar model can reflect the Internet traffic property more precisely than Poisson model, the theoretical and simulation results of burst length distribution based on the time threshold assembly mechanism are shown in this paper. Moreover, the simulation result of OBS schedule algorithm under self-similar traffic model is reported. Both the analytic and simulation results show that burst length distribution is related to the length of assembly period; secondly, the assembly mechanism based on time period can reduce the self-similarity of traffic effectively; at last, the schedule algorithms in OBS have different performance based on the self-similar traffic.

关键词： Statistical analysis Performance analysis Optical burst switching Telecommunication traffic Traffic control Assembly Scheduling algorithm Statistical distributions Internet Mechanical factors

来源：评论

学校读者我要写书评

暂无评论

A Gaming Fuzzy QoS Multicast Routing Scheme in NGI

A Gaming Fuzzy QoS Multicast Routing Scheme in NGI

引用

IEEE international conference on parallel and distributed computing, Applications and Technologies (PDCAT)

作者： Xingwei Wang Qi Wang Min Huang School of Information Science and Engineering Northeastern University Shenyang China

In this paper, a game theory based fuzzy QoS multicast routing scheme is proposed and has been implemented by simulation. It consists of three parts: edge evaluation, game analysis, and multicast tree construction. It does comprehensive evaluation on candidate edges based on adaptability membership degree functions for edge parameters, determines whether Nash equilibrium between network provider utility and user utility has been achieved on candidate edges by gaming analysis, and attempts to construct a multicast routing tree with not only user QoS requirements satisfied but also Pareto optimum under Nash equilibrium on network provider utility and user utility achieved or approached by the proposed algorithm. Simulation results have shown that the proposed scheme is effective

关键词： Routing Quality of service Nash equilibrium Delay Error analysis Game theory Pareto analysis Algorithm design and analysis Multicast algorithms IP networks

来源：评论

学校读者我要写书评

暂无评论

Agent middleware for heterogeneous scientific simulations

Agent middleware for heterogeneous scientific simulations

引用

1998 ACM/IEEE conference on Supercomputing, SC 1998

作者： Ho, Shirun Itoh, Satoshi Ihara, Sigeo Schlichting, Richard D. Parallel Application Hitachi Laboratory Real World Computing Partnership Japan Central Research Laboratory Hitachi Ltd Japan Department of Computer Science University of Arizona United States

ISBN: (纸本)081868707X

The current technology of parallel and distributed systems allows users to exploit a variety of resources across networks. However, the support provided is often insufficient for computational scientists to simulate complicated real-world scenarios in which different kinds of scientific applications need to be combined to perform high fidelity simulations. As a result, users waste a large amount of time and effort developing custom techniques for performing semantic-level communication between heterogeneous scientific simulations. This paper describes a new middleware system that provides high-level transparency in the form of agents that automatically transfer and transform data between simulations that use different mathematical and physical modeling approaches. Based on a specification that correlates different discrete points in finite difference method (FDM), finite element method (FEM) or particle simulations, the agents provide a variety of techniques for semantically transforming the values associated with correlated points and automatically determine to which processes the values must be transferred. To facilitate use and minimize impact on user programs, the agent system includes three types of library calls that manage task identification, register different kinds of discrete points and construct a correlation table according to the specification, and transfer messages that incorporate extraction and transformation of the values on the correlated points. Another library specially optimized for parallel simulations that use a SPMD (Single Program Multiple Data stream) structure is also offered to control communication through the agents. A prototype system has been developed on the Hitachi SR2201 parallel machine as well as workstation clusters, and applied to several example applications. These include an advanced device simulation that combines quantum transport simulation with electric potential simulation, and a simulation of thermal flow resulting fro

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

A Disaster Recovery System Model in an E-government System

A Disaster Recovery System Model in an E-government System

引用

IEEE international conference on parallel and distributed computing, Applications and Technologies (PDCAT)

作者： Kun Wang Lihua Zhou Zhen Cai Zengxin Li Key Laboratory of Computer Network and Information Security of the Ministry of Education Xidian University Xi'an China National Info Security Engineering and Technology Research Center Beijing China

We present a Robust Disaster Recovery System Model (RDRSM) for highly security-critical systems to realize continuous service. Through strengthening safe communication ability, RDRSM guarantees secure and reliable command on disaster recovery. It uses selfsupervision function to monitor the integrality and security of system itself. Through GIS, this model makes disaster recovery system easier to use, manage and maintain. RDRSM possesses features of security, robustness and controllability and can be applied to environments such as e-government and bank. This model successfully conducted the construction of an important e-government disaster recovery system, which verified its feasibility and the significance of its components, such as disaster recovery planning, system supervision and robust communication support.

关键词： Electronic government Robustness Communication system security Stability Disaster management Computer networks Information security Monitoring Geographic Information Systems Protection

来源：评论

学校读者我要写书评

暂无评论

VoD Service Model and Performance Evaluation on the China's High Performance Broadband Information Network (3Tnet)

VoD Service Model and Performance Evaluation on the China's ...

引用

IEEE international conference on parallel and distributed computing, Applications and Technologies (PDCAT)

作者： Feng Lin Xin Wang Xiangyang Xue Department of Computer Science and Engineering Fudan University Shanghai China

Providing large-scale true video-on-demand (VoD) service is a challenging problem over the Internet. Some characteristics of the Internet, such as packet switching, best effort mechanism, make it difficult to provide VoD services with enough Quality of Service (QoS) assurance. In this paper, we propose a VoD service model that uses a content delivery network approach on backbone and a peer-to-peer (p2p) approach on access over the China’s high performance broadband information network (named 3Tnet). We discuss the feasibility of our approach and evaluate the performance by using simulation. The results show that our proposed service model can support true VoD service on the 3Tnet in a scalable way.

关键词： Network servers Web server Large-scale systems Spine IP networks Web and internet services Quality of service Convergence Computer science Packet switching

来源：评论

学校读者我要写书评

暂无评论

Applications of the soft computing in the automated history matching

Applications of the soft computing in the automated history ...

引用

Canadian international Petroleum conference, CIPC 2006

作者： Silva, P.C. Maschio, C. Schiozer, D.J. DEP FEM UNICAMP France

A fundamental problem in the automated history matching is the development of optimization algorithms to find optimal solution in multidimensional search spaces. These optimization algorithms can be of two different types: global optimizers, which are able to work with noisy multi-modal functions and local optimizers, which are not able to work with noisy multimodal functions. Global optimizers present a shortcoming related to very large number of function calls. In reservoir engineering, optimization methods with a large number of function calls is a drawback since a reservoir simulation can take days. Due to this drawback in the last years, techniques such as Least Squared, Thin Plane Spline, Kriging and Artificial Neural networks (ANN) have been used as proxies to reservoir simulators. This article shows the results of the research developed with relation to the application of evolutionary algorithms to find global optima in the automated history matching. Several ANN are used as proxies to reservoir simulator. The ANN used are Generalized Regression Neural Network;Fuzzy System with Subtractive Clustering;Radial Basis Network (two architectures). The research is realized in a distributed parallel software that supports decisions of reservoir engineers, UNIPAR. In this software the results obtained from evolutionary algorithms are fine-tuned by using local optimizers based on the Hooke-Jeeves optimization method. Two case studies with synthetic and real reservoirs are examined.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Evaluation of simulation strategies for computer networks on parallel MIMD computers

Evaluation of simulation strategies for computer networks on...

引用

CompEuro

作者： E. Dirkx F. Verboven Department INFO Free University of Brussels Brussels Belgium

A comparison by practical evaluation of several general-purpose distributed simulation algorithms that use different ways of bringing parallelism to the simulation of computer networks is presented. A description is given of the characteristics of computer networks relevant to distributed simulation, an approach to their modeling, and the characteristics of the parallel computer architecture used. The authors' simulation goals and how these influence the simulator are described. The results and conclusions of the comparison of different strategies for parallelization are also given.< >

关键词： Computer networks Computational modeling Computer simulation Concurrent computing Discrete event simulation Computer architecture Context modeling parallel processing Analytical models Communication system traffic control

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 491 492 493 494 495 496 497 498 499 500 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：