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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

768 篇 会议
27 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

384 篇 工学
- 362 篇 计算机科学与技术...
- 194 篇 软件工程
- 58 篇 信息与通信工程
- 51 篇 电气工程
- 27 篇 电子科学与技术（可...
- 18 篇 控制科学与工程
- 13 篇 材料科学与工程（可...
- 7 篇 安全科学与工程
- 7 篇 网络空间安全
- 4 篇 生物医学工程（可授...
- 3 篇 光学工程
- 3 篇 动力工程及工程热...
- 3 篇 生物工程
- 2 篇 力学（可授工学、理...
- 2 篇 机械工程
- 2 篇 冶金工程
- 2 篇 土木工程
- 2 篇 交通运输工程
101 篇 理学
- 95 篇 数学
- 18 篇 统计学（可授理学、...
- 8 篇 系统科学
- 5 篇 物理学
- 4 篇 生物学
72 篇 管理学
- 51 篇 管理科学与工程(可...
- 38 篇 工商管理
- 24 篇 图书情报与档案管...
8 篇 经济学
- 8 篇 应用经济学
7 篇 医学
- 7 篇 临床医学
- 2 篇 基础医学(可授医学...
3 篇 法学
- 3 篇 社会学
1 篇 教育学
1 篇 文学
1 篇 农学
1 篇 军事学

主题

121 篇 computer science
94 篇 concurrent compu...
94 篇 distributed comp...
83 篇 distributed data...
79 篇 parallel process...
78 篇 application soft...
76 篇 databases
74 篇 database systems
73 篇 parallel process...
55 篇 delay
53 篇 distributed comp...
52 篇 processor schedu...
45 篇 computer archite...
43 篇 transaction data...
41 篇 algorithm design...
40 篇 costs
39 篇 relational datab...
35 篇 protocols
34 篇 computational mo...
33 篇 hardware

机构

6 篇 ibm thomas j. wa...
5 篇 ieee
4 篇 school of comput...
4 篇 department of co...
4 篇 department of co...
3 篇 center for paral...
3 篇 department of co...
3 篇 lip ens-lyon lyo...
3 篇 department of co...
2 篇 department of co...
2 篇 institute of inf...
2 篇 department of co...
2 篇 institute of inf...
2 篇 computer systems...
2 篇 department of co...
2 篇 school of comput...
2 篇 department of co...
2 篇 department of el...
2 篇 department of co...
2 篇 school of comput...

作者

7 篇 a. choudhary
6 篇 a. boukerche
5 篇 j. saltz
4 篇 s.k. das
4 篇 t. kurc
4 篇 a. el abbadi
3 篇 a. rau-chaplin
3 篇 o. wolfson
3 篇 f. dehne
3 篇 p.s. yu
3 篇 a. singh
3 篇 casanova henri
3 篇 c. liu
3 篇 a. bar-noy
3 篇 s. kipnis
3 篇 g. gupta
3 篇 d. agrawal
3 篇 x. shen
2 篇 grove matthew
2 篇 a. burger

语言

792 篇 英文
4 篇 其他

检索条件"任意字段=Proceedings of the first international symposium on Databases in parallel and distributed systems"

共 796 条记录，以下是121-130 订阅

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

详细简洁

排序：

High performance peer-to-peer distributed computing with application to obstacle problem

High performance peer-to-peer distributed computing with app...

引用

2010 IEEE international symposium on parallel and distributed Processing, Workshops and Phd Forum, IPDPSW 2010

作者： Nguyen, The Tung El Baz, Didier Spitéri, Pierre Jourjon, Guillaume Chau, Ming CNRS LAAS 7 avenue du colonel Roche F-31077 Toulouse France Université de Toulouse UPS INSA INP ISAE LAAS F-31077 Toulouse France ENSEEIHT-IRIT 2 rue Charles Camichel 31071 Toulouse France NICTA Australian Technology Park Eveleigh NSW Australia Advanced Solutions Accelerator 199 rue de l'Oppidum 34170 Castelnau le Lez France

ISBN: (纸本)9781424465347

This paper deals with high performance Peer-to-Peer computing applications. We concentrate on the solution of large scale numerical simulation problems via distributed iterative methods. We present the current version of an environment that allows direct communication between peers. This environment is based on a self-adaptive communication protocol. The protocol configures itself automatically and dynamically in function of application requirements like scheme of computation and elements of context like topology by choosing the most appropriate communication mode between peers. A first series of computational experiments is presented and analyzed for the obstacle problem.© 2010 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A scalable algorithm for maintaining perpetual system connectivity in dynamic distributed systems

A scalable algorithm for maintaining perpetual system connec...

引用

24th IEEE international parallel and distributed Processing symposium, IPDPS 2010

作者： Bansal, Tarun Mittal, Neeraj Department of Computer Science Ohio State University Columbus OH 43202 United States Department of Computer Science University of Texas Dallas Richardson TX 75080 United States

ISBN: (纸本)9781424464432

We investigate the problem of maintaining a topology with small degree as well as small diameter in a dynamic distributed system such that the system always stays connected and processes that wish to leave the system can do so quickly. Perpetual system connectivity is necessary to solve many important problems in dynamic distributed systems, including atomic broadcast and stable property detection, that need strict (deterministic) guarantees about system connectivity to be solvable. To our knowledge, in all existing topology maintenance algorithms for asynchronous distributed systems that provide perpetual system connectivity, either: (i) the topology has large worst-case degree and/or diameter (ii) a process may experience high worst-case delay when leaving the system, or (iii) processes cannot join and/or leave concurrently. In this paper, we present a spanning tree maintenance algorithm that satisfies the following desirable properties. first, the spanning tree has small maximum degree of O(1) and small maximum diameter of O(log N), where N denotes the maximum size of the system. Second, any process can leave the system within O(log N) time even in the presence of concurrent arrivals and departures. Third, the system always stays connected. We show using a simple knowledge-based argument that, in any algorithm that maintains perpetual connectivity such that the topology has either worst-case diameter of fi(log N) or worst-case degree of O(1), the departure of a process may be delayed by fi(log log N) time in the worst-case. ©2010 IEEE.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Cluster-and-Conquer: Hierarchical Multi-metric Query Processing in Large-scale Database Federations 10

Cluster-and-Conquer: Hierarchical Multi-metric Query Process...

引用

14th international Database Engineering and Applications symposium (IDEAS)

作者： Wang, Di Mani, Murali Rundersteiner, Elke A. Worcester Polytech Inst Worcester MA 01609 USA Univ Michigan Flint MI 48503 USA

ISBN: (纸本)9781605589008

The federated database architecture has been introduced to maintain the autonomy of individual data sources yet accomplish federated task for diverse applications from traditional enterprises to computational sciences. We identify two challenging problems of query optimization in large-scale database federation systems. first, run-time conditions of data sources have a profound effect on the performance of database federations, yet the distributed environment of database federations makes it prohibitively expensive for the optimizer to gather rapidly fluctuating run-time conditions from remote data sources. Second, large-scale database federation systems are often widely distributed and built on heterogeneous networks, thus efficiently utilizing network resources is of ever increasing importance for query scheduling. In this paper, we propose to exploit the clustered hierarchical structure of database federations to solve these two problems. Our Cluster-and-Conquer strategy coordinates hierarchical clusters of data sources to optimize and process queries cooperatively. Within each cluster we employ an I/O-bound cost model with run-time conditions being accessible with relatively little delay. While among clusters a network-bound cost model is instead utilized to capture the network heterogeneity and optimize the query plans for efficient network utilization. The experimental study on the prototype database federation system with real-world network settings shows the effectiveness of our Cluster-and Conquer strategy for scheduling data-intensive queries, as well as demonstrates the performance benefits of our proposed strategies over existing state-of-art solutions.

关键词： Database Federations Query Optimization distributed databases

来源：评论

学校读者我要写书评

暂无评论

parallel computation of best connections in public transportation networks

Parallel computation of best connections in public transport...

引用

24th IEEE international parallel and distributed Processing symposium, IPDPS 2010

作者： Delling, Daniel Katz, Bastian Pajor, Thomas Microsoft Research Silicon Valley 1065 La Avenida Mountain View CA 94043 United States Department of Computer Science Karlsruhe Institute of Technology 76128 Karlsruhe Germany

ISBN: (纸本)9781424464432

Exploiting parallelism in route planning algorithms is a challenging algorithmic problem with obvious applications in mobile navigation and timetable information systems. In this work, we present a novel algorithm for the so- called one-to-all profile-search problem in public transportation networks. It answers the question for all fastest connections between a given station S and any other station at any time of the day in a single query. This algorithm allows for a very natural parallelization, yielding excellent speed- ups on standard multi-core servers. Our approach exploits the facts that first, time-dependent travel-time functions in such networks can be represented as a special class of piecewise linear functions, and that second, only few connections from S are useful to travel far away. Introducing the connection- setting property, we are able to extend DlJKSTRA's algorithm in a sound manner. Furthermore, we also accelerate station-to- station queries by preprocessing important connections within the public transportation network. As a result, we are able to compute all relevant connections between two random stations in a complete public transportation network of a big city (Los Angeles) on a standard multi-core server in less than 55 ms on average. © 2010 IEEE.

关键词： Travel time

来源：评论

学校读者我要写书评

暂无评论

distributed monitoring of conditional entropy for anomaly detection in streams

Distributed monitoring of conditional entropy for anomaly de...

引用

2010 IEEE international symposium on parallel and distributed Processing, Workshops and Phd Forum, IPDPSW 2010

作者： Arackaparambil, Chrisil Bratus, Sergey Brody, Joshua Shubina, Anna Dept. of Computer Science Dartmouth College Hanover NH 03755 United States

ISBN: (纸本)9781424465347

In this work we consider the problem of monitoring information streams for anomalies in a scalable and efficient manner. We study the problem in the context of network streams where the problem has received significant attention. Monitoring the empirical Shannon entropy of a feature in a network packet stream has previously been shown to be useful in detecting anomalies in the network traffic. Entropy is an information-theoretic statistic that measures the variability of the feature under consideration. Anomalous activity in network traffic can be captured by detecting changes in this variability. There are several challenges, however, in monitoring this statistic. Computing the statistic efficiently is non-trivial. Further, when monitoring multiple features, the streaming algorithms proposed previously would likely fail to keep up with the everincreasing channel bandwidth of network traffic streams. There is also the concern that an adversary could attempt to mask the effect of his attacks on variability by a mimicry attack disguising his traffic to mimic the distribution of normal traffic in the network, thus avoiding detection by an entropy monitoring sensor. Also, the high rate of false positives is a big problem with Intrusion Detection systems, and the case of entropy monitoring is no different. In this work we propose a way to address the above challenges. first, we leverage recent progress in sketching algorithms to develop a distributed approach for computing entropic statistics accurately, at reasonable memory costs. Secondly, we propose monitoring not only regular entropy, but the related statistic of conditional entropy, as a more reliable measure in detecting anomalies. We implement our approach and evaluate it with real data collected at the link layer of an 802.11 wireless network. © 2010 IEEE.

关键词： Statistics

来源：评论

学校读者我要写书评

暂无评论

parallel computing of a large scale spatially distributed model using the Soil and Water Assessment Tool (SWAT)

Parallel computing of a large scale spatially distributed mo...

引用

5th Biennial Conference of the international Environmental Modelling and Software Society: Modelling for Environment's Sake, iEMSs 2010

作者： Yalew, S.G. Van Griensven, A. Kokoszkiewicz, L. UNESCO-IHE Institute for Water Education Department of Hydroinformatics and Knowledge Management 2601 DA Delft Netherlands CERN - European Organization for Nuclear Research Switzerland

ISBN: (纸本)9788890357411

The Soil and Water Assessment Tool (SWAT) has been used widely for large scale applications, reaching entire continents. Within the EU funded EnviroGrids project, a detailed application of SWAT on the Black Sea Basin is envisaged using high resolution data. In order to support the computation, the model is run on a computer grid. The use of the SWAT allowed for such computations with little adaptations to the source. A 3-step procedure is needed. In the first step, a program is run in order to split the model into several sub-models. Afterwards, the sub-models are run in parallel. In a last step, the outputs of the sub-basins are collected at a central computer and the routing is performed. High computations are also needed when simulations have to be repeated, such as for sensitivity, calibration and uncertainty analysis. In these cases, the simulations are repeated for different parameter sets. In this paper, we discuss the gridification of the algorithm "LH-OAT" that performs sensitivity analysis and has been linked to the SWAT model. The results show a clear improvement in calculation time. Nevertheless, it is concluded that the parallel computing of a distributed model is mainly beneficial for large scale applications with high resolution, while running the sensitivity analysis algorithm has more general and obvious benefit. In a next step, the gridification will be optimised depending on the application and the overheads that are due to submission and receiving of files, as well as potential waiting times for executions on the grid.

关键词： SWAT

来源：评论

学校读者我要写书评

暂无评论

Solving the Multi-Operator Placement Problem in Large-Scale Operator Networks

Solving the Multi-Operator Placement Problem in Large-Scale ...

引用

international Conference on Computer Communications and Networks (ICCCN)

作者： Stamatia Rizou Frank Dürr Kurt Rothermel Universität Stuttgart Institute of Parallel and Distributed Systems Stuttgart Germany

Processing streams of data in an overlay network of operators distributed over a wide-area network is a common idea shared by different applications such as distributed event correlation systems and large-scale sensor networks. In order to utilize network resources efficiently and allow for the parallel deployment of a large number of large-scale operator networks, suitable placement algorithms are vital that place operators on physical nodes. In this paper, we present a distributed placement algorithm that minimizes the bandwidth-delay product of data streams between operators of the network in order to reduce the induced network load. Since the fundamental optimization problem is NP-hard, we propose a heuristic solution. first, we calculate an optimal solution in an intermediate continuous search space, called latency space. Subsequently the continuous solution is mapped to the physical network. Our evaluations show that this algorithm reduces the resulting network load significantly compared to state of the art algorithms and achieves results close to the optimum.

关键词： Peer to peer computing Approximation algorithms Delay Optimization distributed databases Approximation methods

来源：评论

学校读者我要写书评

暂无评论

On the Design of the Semantic P2P System for Music Recommendation

On the Design of the Semantic P2P System for Music Recommend...

引用

international symposium on parallel and distributed Processing with Applications, ISPA

作者： Ming-Hung Chen Kate Ching-Ju Lin Chui-Chiu Kung Cheng-Fu Chou Chang-Jen Tu Department of Computer Science and Information Engineering National Taiwan University Taiwan Institute for Information Industry Taipei Taiwan

The pervasive use of Peer-to-Peer (P2P) systems and the growing demand on personalization for consumers has made future business focus on the niche market instead of the mass market. The recommender system, which is able to timely select data of the interest to each individual user, has become the key to any successful business. However, currently most recommendation systems are based on a centralized architecture; nonetheless, they are not suitable for P2P environments. In this article, we propose a distributed semantic P2P overlay, which can provide music search and recommendation services by considering both of user preference and diversity of interests. We then propose a 3C hybrid recommendation procedure that adapts three traditional filtering techniques to fitting the requirements in a distributed semantic overlay. first, we choose a set of proper meta-data to represent a music object and use them to construct the characteristic-vector-based content filter. Second, a dominant attribute, which is one of the attributes in the characteristic vector of a music object, is used to build the profile of a peer. With the idea of the social network, a P2P profile-based collaborative filter is proposed. Finally, we explore the item-to-item relationship to construct a history-based cooperative filter. We use simulations and a real database called Audio Scrobbler, which tracks users' listening habits, to evaluate the performance of the recommendation system. The results demonstrate the effectiveness of the proposed approach compared with existing recommendation systems.

关键词： Peer to peer computing Semantics Music Recommender systems Collaboration Social network services databases

来源：评论

学校读者我要写书评

暂无评论

NETplace: Efficient runtime minimization of network emulation experiments

NETplace: Efficient runtime minimization of network emulatio...

引用

international symposium on Performance Evaluation of Computer & Telecommunication systems SPECTS

作者： Andreas Grau Klaus Herrmann Kurt Rothermel Institute of Parallel and Distributed Systems (IPVS) Universität Stuttgart Stuttgart Germany

Network emulation is an efficient method for evaluating distributed applications and communication protocols by combining the benefits of real world experiments and network simulation. The process of network emulation involves execution of thousands of connected virtual nodes running the software under test in a controlled environment. Along with the quality of the experiment results, the runtime of network experiments strongly influences the convenience of users and operators of emulation testbeds. The goal of this paper is, therefore, to minimize the experiment runtime of network emulations. In order to achieve this goal, we make the following contributions in this paper: first, we present a highly scalable emulation architecture to efficiently support network emulation testbeds with multicore CPUs. Second, we propose a detailed and generic cost model for the communication costs of emulation testbeds. Third, we present an efficient placement strategy (NETplace) to assign virtual nodes to physical nodes of the testbed while minimizing the runtime of network experiments. Therefore, we combine graph partitioning and greedy approaches. Our evaluations show that our placement strategy outperforms existing methods by reducing the experiment runtime up to 64%.

关键词： Emulation Runtime Virtual machining Mathematical model Computer architecture Partitioning algorithms Clocks

来源：评论

学校读者我要写书评

暂无评论

The envision project: Towards a visual tool to support schema evolution in distributed databases 15

The envision project: Towards a visual tool to support schem...

引用

15th international Conference on distributed Multimedia systems, DMS 2008

作者： Polese, Giuseppe Vacca, Mario 84084 Italy

ISBN: (纸本)189170625X

Changes to the schema of databases naturally and frequently occur during the life cycle of information systems;supporting their management, in the context of distributed databases, requires tools to perform changes easily and to propagate them efficiently to the database instances. In this paper we illustrate ENVISION, a project aiming to develop a Visual Tool for Schema Evolution in distributed databases to support the database administrator during the schema evolution process. The first stage of this project concerned the design of an instance update language, allowing to perform schema changes in a parallel way [14];in this paper we deal with further steps toward the complete realization of the project: the choice of a declarative schema update language and the realization of the mechanism for the automatic generation of instance update routines. The architecture of the system, which has been implementing, is also designed. © 2009 by Knowledge systems Institute Graduate School.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共80页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：