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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,750 篇 会议
29 册 图书
25 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,388 篇 工学
- 1,272 篇 计算机科学与技术...
- 598 篇 软件工程
- 238 篇 信息与通信工程
- 218 篇 电气工程
- 87 篇 控制科学与工程
- 53 篇 电子科学与技术（可...
- 44 篇 机械工程
- 41 篇 生物工程
- 33 篇 动力工程及工程热...
- 26 篇 石油与天然气工程
- 20 篇 化学工程与技术
- 19 篇 环境科学与工程（可...
- 18 篇 仪器科学与技术
- 17 篇 生物医学工程（可授...
- 17 篇 网络空间安全
- 15 篇 材料科学与工程（可...
- 15 篇 测绘科学与技术
- 14 篇 力学（可授工学、理...
- 14 篇 安全科学与工程
307 篇 理学
- 202 篇 数学
- 48 篇 生物学
- 41 篇 物理学
- 39 篇 系统科学
- 30 篇 统计学（可授理学、...
- 25 篇 化学
198 篇 管理学
- 130 篇 管理科学与工程(可...
- 77 篇 图书情报与档案管...
- 57 篇 工商管理
72 篇 医学
- 64 篇 临床医学
16 篇 法学
15 篇 经济学
- 15 篇 应用经济学
15 篇 教育学
6 篇 农学
3 篇 文学
2 篇 军事学

主题

105 篇 distributed comp...
101 篇 distributed comp...
74 篇 parallel process...
59 篇 cloud computing
44 篇 computational mo...
44 篇 parallel computi...
38 篇 distributed data...
37 篇 parallel program...
37 篇 grid computing
36 篇 parallel algorit...
33 篇 computer archite...
31 篇 big data
31 篇 parallel process...
28 篇 application soft...
26 篇 fault tolerance
26 篇 machine learning
25 篇 resource managem...
24 篇 scalability
24 篇 middleware
23 篇 concurrent compu...

机构

9 篇 laboratory of in...
8 篇 zhejiang univ co...
7 篇 plekhanov russia...
7 篇 chinese acad sci...
7 篇 science and tech...
6 篇 univ adelaide sc...
6 篇 institute of com...
5 篇 department of in...
5 篇 shanghai jiao to...
4 篇 college of compu...
4 篇 school of comput...
4 篇 harbin inst tech...
4 篇 school of inform...
4 篇 univ otago dept ...
3 篇 huazhong univ sc...
3 篇 fuyang rongda co...
3 篇 key laboratory o...
3 篇 department of co...
3 篇 university of el...
3 篇 school of comput...

作者

13 篇 zomaya albert y.
10 篇 shen hong
8 篇 todorov venelin
8 篇 rothermel kurt
7 篇 li kuan-ching
6 篇 leymann frank
6 篇 li y
6 篇 liu jie
6 篇 kopp oliver
5 篇 dimov ivan
5 篇 nakayama shigeru
5 篇 huang z.
5 篇 gankevich ivan
5 篇 albert y. zomaya
5 篇 breitenbuecher u...
5 篇 yang chao-tung
4 篇 li kenli
4 篇 blochinger wolfg...
4 篇 liu yang
4 篇 leung k.

语言

1,730 篇 英文
56 篇 其他
15 篇 中文
10 篇 俄文

检索条件"任意字段=8th International Conference on Parallel and Distributed Computing, Applications and Technologies"

共 1804 条记录，以下是851-860 订阅

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

详细简洁

排序：

Efficient parallel Algorithms for XML Filtering with Structural and Value Constraints

引用

8th international conference on Web Information Systems and technologies (WEBIST)

作者： Antonellis, Panagiotis Makris, Christos Pispirigos, Georgios Univ Patras Fac Engn Dept Comp Engn & Informat Patras Greece

ISBN: (纸本)9783642366086;9783642366079

Information seeking applications employ information filtering techniques as a main component of their functioning. the purpose of the present article is to explore techniques to efficiently implement scalable and efficient information filtering techniques, based on the XML representation, when both structural and value constraints are imposed. In the majority of the provided implementations the use of the XML representation appears in single processor systems, and the involved user profiles are represented using the XPath query language and efficient heuristic techniques for constraining the complexity of the filtering mechanism are employed. Here, we propose a parallel filtering algorithm based on the well known YFilter algorithm, which dynamically applies a work-load balancing approach to each thread to achieve the best parallelization. In addition, the proposed filtering algorithm adds support for value-based predicates by embedding three different algorithms for handling value constraints during XML filtering, based on the popularity and the semantic interpretation of the predicate values. Experimental results depict that the proposed system outperforms the previous parallel approaches to the XML filtering problem.

关键词： XML filtering parallel algorithms Semantic similarity

来源：评论

学校读者我要写书评

暂无评论

Automatic Extraction of Behavioral Models from distributed Systems and Services

Automatic Extraction of Behavioral Models from Distributed S...

引用

8th international conference on Evaluation of Novel Approaches to Software Engineering, ENASE 2013

作者： Şora, Ioana Popovici, Doru-thom Department of Computer and Software Engineering Politehnica University of Timisoara Romania

ISBN: (纸本)9783642540912

Many techniques used for discovering faults and vulnerabilities in distributed systems and services require as inputs formal behavioral models of the systems under validation. Such models are traditionally written by hand, according to the specifications which are known, leading to a gap between the real systems which have to be validated and their abstract models. A method to bridge this gap is to develop tools that automatically extract the models directly from the implementations of distributed systems and services. We propose here a general model extraction solution, applicable to several service technologies. At the core of our solution we develop a method for transforming the control flow graph of an abstract communicating system into its corresponding behavioral model represented as an Extended Finite State Machine. We then illustrate our method for extracting models from services implemented using different concrete technologies such as Java RMI, Web services and HTTP Web applications and servlets. © Springer international Publishing Switzerland 2013.

关键词： Reverse engineering

来源：评论

学校读者我要写书评

暂无评论

Architecture based on mobile agent and PEIDs technologies to improve innovation in PLM

Architecture based on mobile agent and PEIDs technologies to...

引用

2013 8th international conference on Intelligent Systems: theories and applications, SITA 2013

作者： Boulaalam, Abdelhak Nfaoui, El Habib Beqqali, Omar El Computer Science Departement Sidi Mohamed Ben AbdEllah University FSDM Fez Morocco

ISBN: (纸本)9781479902996

the product life cycle management (PLM) system focuses on tracking and managing the information of whole product life cycle, with possible feedback of information to product life cycle phases. It provides opportunities to reduce the inefficiency of life cycle operations and gain in term of competitiveness. Our research consist of the effective management of product life cycle activities by using product data/information/knowledge which are accumulated in the closed-loops of product life cycle with the support of product embedded information devices (PIEDs), multi-agent systems (MAS) and product data & knowledge management (PDKM). In this article we propose an approach based on three organizations: physical product, product Agent, and PLM system. the product Agent can gather product life cycle information from each product with a mobile device such as a personal digital assistant (PDA) or a fixed reader with built-in antenna. He sends information gathered at each site (e.g retail sites, distribution sites...) to a PLM system. From the PLM's point of view, the product is allowing itself to manage information resources relevant layers to itself in a distributed manner is a logical and practical approach. © 2013 IEEE.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

the 3-D parallel Processor applied to Matrix Inversion

The 3-D Parallel Processor applied to Matrix Inversion

引用

8th international Microsystems, Packaging, Assembly and Circuits Technology conference (IMPACT)

作者： Cheng, Karl Cheng, Robert Cheng, Alan Innotest Inc Hsinchu 30076 Taiwan

ISBN: (纸本)9781479906673

Matrix computation such as matrix addition, subtraction, multiplication and inversion are frequently used in various fields for research and engineering application. It is a very important tool for image processing, speech recognition and signal processing for spectral analysis and beam forming ... etc .... As the area of computer application has broadened, the quantity of data to be operated has greatly increased. With a serial machine as we have now in the 2-D computer system it is becoming too much time consuming in matrix computation to meet the applications. the speed of data processing can be increased or improved by using the 3-D parallel processor, a 3-D IC hardware machine. With the advancement of the TSV (through Silicon Via), wafer to wafer interconnection and stacking technologies in 3-D IC manufacturing, it has become relatively easy and low cost to produce a 3-D parallel processor to meet the requirement for advance research and engineering. What will be the different between the 2-D and 3-D processor is that the processing algorithm and the circuit design architecture. A 3-D processor can be designed to execute the data signal paralleling while the conventional 2-D is sequentially. therefore, the power of the 3-D data processing could be much greater than that of the 2-D version. this paper will describe how this 3-D IC design architecture for handling great number of data processing for matrix inversion as an example in comparing with the current 2-D machine in processing power and execution time. [GRAPHICS] .

关键词： integrated circuit design matrix convertors parallel processing three-dimensional integrated circuits

来源：评论

学校读者我要写书评

暂无评论

IX-level adversaries on entry- and exit-transmission paths in tor network

IX-level adversaries on entry- and exit-transmission paths i...

引用

2013 IEEE 8th international conference on Networking, Architecture and Storage, NAS 2013

作者： Liu, Peipeng Shi, Jinqiao Wang, Lihong Wang, Xiao Tan, Qingfeng Institute of Computing Technology Chinese Academy of Sciences 100080 Beijing China Graduate University of Chinese Academy of Sciences Beijing 100039 China Institute of Information Engineering Chinese Academy of Sciences China National Engineering Laboratory for Information Security Technologies IIE China

ISBN: (纸本)9780769550343

Tor is a worldwide publicly deployed low-latency anonymity system. In order to prevent observers from telling where the data came from and where it's going, data packets on the Tor network take a pathway through several intermediate relays. However, nodes selection to build such a pathway is oblivious to Internet routing, so anonymity guarantees can break down in cases where an attacker can correlate traffic across the entry- and exit-segments of a Tor circuit. Although many works have been done to avoid this kind of collusion attack, recent researches [18] indicated that some Internet exchanges (IXes) locating at the entry- and exit-transmission paths in Tor network (that are the paths from the client to the chosen entry node and from the chosen exit node to the destination) are still possible to perform a correlation attack. However, few works have been done to suggest and verify modifications to Tor's path selection algorithm that would help clients avoid an IX-level observer. In this paper, we first, based on the entry-exit pairs chosen by Tor's path selection algorithm, demonstrated that the probability of a single IX observing both ends of an anonymous Tor connection is greater than previously thought. And then, we proposed and evaluated the effectiveness of a simple IX-awareness path selection algorithm that help to resist IX-level attackers. © 2013 IEEE.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

DDASTM: Ensuring conflict serializability efficiently in distributed STM

引用

8th international conference on Grid and Pervasive computing, GPC 2013

作者： Zhang, Yu Jin, Hai Liao, Xiaofei Services Computing Technology and System Lab. Cluster and Grid Computing Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9783642380266

CS (Conflict Serializability) is a recently proposed relaxer correctness criterion that can increase transactional memory's parallelism. DDA (distributed Dependency-Aware) model is currently proposed to implement CS in distributed STM (Software Transactional Memory) for the first time. However, its transactions detect conflicts individually via detecting cycles in PG (Precedence Graph) and cause extra runtime overhead, especially at the condition that the transactions access lots of objects or the PG is large. In this paper, we propose an approach to make each cycle in PG detected by those transactions, which construct this cycle, together in parallel way, instead of detecting cycle individually. Experimental results show that the average execution time and communication cost of all transactions, including aborted ones, in our approach, can be decreased to 76% and 78% of those in DDA respectively. Its speedup is up to 2.56x against baseDSTM, employing two-phase locking. © 2013 Springer-Verlag.

关键词： Locks (fasteners)

来源：评论

学校读者我要写书评

暂无评论

A web application for distributed computing: Solving a typical statistical problem in industry

A web application for distributed computing: Solving a typic...

引用

Iberian conference on Information Systems and technologies (CISTI)

作者： Miguel Ferreira Miguel Casquilho Instituto Superior Técnico Technical University of Lisbon Lisbon Portugal

ISBN: (纸本)9781479912179

A web application of scientific computing over the Internet is presented, for distributed computing, parallel programming in MPI, using the resolution of a typical statistical problem in packaging. this problem is found in many industries, and is solved empirically. As no analytical solution seems viable, a Monte Carlo approach was adopted. After briefly describing a previous series programming solution of the problem, its parallel programming version is detailed. From the authors' experience, the web environment is clearly recommended for scientific computing, for academic and industrial purposes.

关键词： parallel processing Monte Carlo methods Internet Scientific computing Educational institutions Industries

来源：评论

学校读者我要写书评

暂无评论

Topic 6: Grid, Cluster and Cloud computing (Introduction)

Topic 6: Grid, Cluster and Cloud Computing (Introduction)

引用

19th international conference on Euro-Par

作者： Laure, Erwin Kao, Odej Badia, Rosa M. Lefevre, Laurent Di Martino, Beniamino Prodan, Radu Turilli, Matteo Warneke, Daniel KTH Royal Institute of Technology Sweden Technische Universität Berlin Germany Barcelona Supercomputing Center CSIC Spain INRIA University of Lyon France Seconda Universitá di Napoli Italy University of Innsbruck Austria University of Oxford United Kingdom International Computer Science Institute Berkeley United States

ISBN: (纸本)9783642400476

Grid and cloud computing have changed the IT landscape in the way we access and manage IT infrastructures. the use of computing resources has become essential for many applications in various areas. Both technologies provide easyto- use and on-demand access to large-scale infrastructures. the high number of submissions to “Topic 6: Grid, Cluster and Cloud computing-reflected the importance of the research area. the papers addressed key challenges regarding design, deployment, operation and use of Grid and cloud infrastructures. Moreover, several innovative algorithms and methods for fundamental capabilities and services that are required in a heterogeneous environment, such as adaptability, scalability, reliability and security, and to support applications as diverse as ubiquitous local services, enterprise-scale virtual organizations, and internet-scale distributed supercomputing were proposed. Finally, many experimental evaluations and use-cases delivered an insight into the deployment in real-world scenarios and showed interesting future application domains. Each submission was reviewed by at least four reviewers and, finally, we were able to select nine high-quality papers. the papers were grouped in four sessions that are briefly summarized in following.

关键词： Cluster computing

来源：评论

学校读者我要写书评

暂无评论

Dynamic and Hierarchical Load-Balancing Techniques Applied to parallel Branch-and-Bound Methods

Dynamic and Hierarchical Load-Balancing Techniques Applied t...

引用

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

作者： Herrera, Juan F. R. Casado, Leocadio G. Hendrix, Eligius M. T. Paulavicius, Remigijus Zilinskas, Julius Univ Almeria Dept Informat Agrifood Campus Int Excell CeiA3 Almeria Spain

ISBN: (纸本)9780769550947

Most Lipschitzian Global Optimization algorithms perform an exhaustive search using a branch-and-bound (B&B) scheme. the question is how to run multi-dimensional Lipschitz Global Optimization in parallel, such that the implementation depending on the used platform is efficient. Previous work shows a parallel version developed for multicore nodes with two levels of parallelism: intra-node and inter-node. On intra-node level, one can perform dynamic load balancing by generating threads dynamically. threads end when they complete their assigned work. the inter-node level carries out a static load balancing using MPI. In general, algorithm design depends on the characteristics of problems to be solved. there are several ways to improve performance of general parallel B&B algorithms. Specifically, we are interested in how to apply them to parallel Lipschitz Global Optimization algorithms. Operations like selecting the next subproblem to be evaluated become critical in parallel B&B schemes. We study Depth and Hybrid (Best-Depth) options as selection criterion. Previous work, using only MPI or OpenMP, discard not only the broadcasting of the best found upper bound of the solution due to its high average cost/performance but also the use of dynamic load balancing. Here we check how broadcasting the upper bound affects the developed MPI-Pthreads algorithm. Additionally, we study how to perform dynamic load balancing at inter-node level. Experimental results show which designs perform better on which type of instances for the used computational architecture.

关键词： Lipschitz optimization branch-and-bound global optimization distributed computing dynamic load balancing

来源：评论

学校读者我要写书评

暂无评论

Enabling a Metric Space for Content Search in Information-Centric Networks

Enabling a Metric Space for Content Search in Information-Ce...

引用

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

作者： Truong, Patrick Peltier, Jean-Francois Orange F-22307 Lannion France

ISBN: (纸本)9780769550947

the emergence of vivacious bandwidth-consuming services leveraged by the overwhelmingly content-centric usage on Internet has fostered over last years a new foundation for networking architecture design. Several Information-Centric Networking (ICN) architectures have then been proposed to tackle the challenging problems for content dissemination and distribution. those architectures propose a forwarding plane based on a naming scheme that uniquely identifies content objects in the network regardless of their location. Routing in ICN is thus performed on content names by means of a name resolution service that can be operated independently on the current endpoint-centric networking infrastructure. In order to sketch out the efficient design of such information-centric networks, an important functionality need to be taken into account for resolving information usability which consists in finding appropriate content objects matching users' interest. We propose in this paper a novel forwarding scheme which integrates content search in the network path when resolving content names into locators (where content is actually stored). the content indexing and discovery function relies on distance sensitive hashing based DHT for similarity search between content objects. the proposed routing algorithm can be used for better performance than using classical DHTs for resolving names in ICN. We conceptually embed the high-dimension set of content objects into a low-dimension for reducing processing complexity, which allows us to design an efficient and scalable information-centric forwarding plane with in-network content search.

关键词： Information Centric Networking (ICN) in-network content search name resolution distributed Hash Table (DHT) routing indexing distance similarity

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共181页 << < 82 83 84 85 86 87 88 89 90 91 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：