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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

626 篇 工学
- 576 篇 计算机科学与技术...
- 291 篇 软件工程
- 229 篇 电气工程
- 225 篇 信息与通信工程
- 80 篇 控制科学与工程
- 41 篇 仪器科学与技术
- 38 篇 动力工程及工程热...
- 37 篇 网络空间安全
- 36 篇 交通运输工程
- 36 篇 安全科学与工程
- 17 篇 电子科学与技术（可...
- 12 篇 机械工程
- 11 篇 生物工程
- 7 篇 建筑学
- 7 篇 环境科学与工程（可...
- 4 篇 化学工程与技术
- 4 篇 生物医学工程（可授...
122 篇 理学
- 62 篇 数学
- 36 篇 化学
- 13 篇 系统科学
- 12 篇 生物学
- 10 篇 统计学（可授理学、...
- 6 篇 物理学
111 篇 管理学
- 81 篇 管理科学与工程(可...
- 64 篇 图书情报与档案管...
- 34 篇 工商管理
8 篇 经济学
- 8 篇 应用经济学
5 篇 医学
- 5 篇 基础医学(可授医学...
- 5 篇 临床医学
3 篇 法学
- 3 篇 社会学
1 篇 军事学

主题

121 篇 distributed comp...
73 篇 computer science
57 篇 protocols
56 篇 distributed comp...
55 篇 cloud computing
53 篇 mobile computing
49 篇 middleware
47 篇 computer archite...
46 篇 costs
42 篇 scalability
41 篇 application soft...
41 篇 computer network...
40 篇 computational mo...
39 篇 intelligent netw...
38 篇 bandwidth
36 篇 real time system...
35 篇 peer to peer com...
33 篇 monitoring
31 篇 network servers
31 篇 internet

机构

4 篇 university of st...
4 篇 school of scienc...
3 篇 college of compu...
3 篇 ibm thomas j. wa...
3 篇 school of comput...
3 篇 brown univ dept ...
3 篇 department of el...
3 篇 univ chicago il ...
3 篇 nppd tehran
3 篇 georgia institut...
3 篇 institute of com...
3 篇 natl univ def te...
2 篇 department of co...
2 篇 school of comput...
2 篇 univ nevada dept...
2 篇 department of co...
2 篇 the chinese univ...
2 篇 mitre corporatio...
2 篇 information init...
2 篇 computer science...

作者

4 篇 uwe breitenbüche...
4 篇 frank leymann
3 篇 y. shibata
3 篇 dustdar schahram
3 篇 takizawa hiroyuk...
2 篇 j.a. stankovic
2 篇 posdorfer wolf
2 篇 miremadi seyed g...
2 篇 datskova olga
2 篇 m. ito
2 篇 garcia jordi
2 篇 li j
2 篇 jukan admela
2 篇 souissi samia
2 篇 cheng yijun
2 篇 cook james r.
2 篇 m. takizawa
2 篇 casadei roberto
2 篇 bouamama sadok
2 篇 wu jan-jan

语言

1,042 篇 英文

检索条件"任意字段=23rd International Conference on Distributed Computing Systems Workshops"

共 1042 条记录，以下是971-980 订阅

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

详细简洁

排序：

An integrated approach to modeling and analysis of embedded real-time systems based on Timed Petri Nets

An integrated approach to modeling and analysis of embedded ...

引用

international conference on distributed computing systems

作者： Zonghua Gu K.G. Shin Real-Time Computing Laboratory EECS Department University of Michigan Ann Arbor MI USA

In computer-based control systems, embedded software is taking over what mechanical and dedicated electronic systems used to do, that is, to engage and control the physical world, interacting directly with sensors and actuators. Therefore, software running on a digital processor is tightly-coupled with its surrounding physical environment. We propose an integrated approach based on Timed Petri-Nets for modeling and analysis of embedded real-time systems where real-time scheduling behavior of the controller software is explicitly represented at the model-level, together with the physical environment that it interacts with. This enables the designer to have an integrated view of the entire system while analyzing the system and making design decisions. We also describe a syntax-directed, automated translation procedure from Timed Petri-Nets to Timed Automata, thus enabling the use of model checkers such as UPPAAL for analysis purposes. We consider the railroad crossing problem as an application example, and evaluate alternatives for controller implementation on either single-processor or distributed multi-processor platforms based on the integrated approach.

关键词： Real time systems Petri nets Control systems Embedded software Automatic control Embedded computing Physics computing Mechanical sensors Sensor systems Actuators

来源：评论

学校读者我要写书评

暂无评论

New algorithms for content-based publication-subscription systems

New algorithms for content-based publication-subscription sy...

引用

international conference on distributed computing systems

作者： A. Riabov Zhen Liu J.L. Wolf P.S. Yu Li Zhang IEOR Department Columbia University NY USA IBM Thomas J. Watson Research Center Yorktown Heights NY USA

This paper introduces new algorithms specifically designed for content-based publication-subscription systems. These algorithms can be used to determine multicast groups with as much commonality as possible, based on the totality of subscribers' interests. The algorithms are based oil concepts borrowed from the literature on spatial databases and clustering. These algorithms perform well in the context of highly heterogeneous subscriptions, and they also scale well. Based on concepts borrowed from the spatial database literature, we develop an algorithm to match publications to subscribers in real-time. We also investigate the benefits of dynamically determining whether to unicast, multicast or broadcast information about the events over the network to the matched subscribers. We call this the distribution method problem. Some of these same concepts can be applied to match publications to subscribers in real-time, and also to determine dynamically whether to unicast, multicast or broadcast information about the events over the network to the matched subscribers. We demonstrate the quality of our algorithms via a number of realistic simulation experiments.

关键词： distributed computing

来源：评论

学校读者我要写书评

暂无评论

Scalable resource allocation for multi-processor QoS optimization

Scalable resource allocation for multi-processor QoS optimiz...

引用

international conference on distributed computing systems

作者： S. Ghosh R. Rajkumar J. Hansen J. Lehoczky Department of Electrical and Computer Engineering Carnegie Mellon University USA Institute for Complex Engineered Systems Carnegie Mellon University USA Department of Statistics Carnegie Mellon University USA

We present scalable QoS optimization algorithms for allocating resources to tasks in a multi-processor environment. Given a set of tasks, each of which is capable of running at one of several different QoS levels, the algorithms can select a QoS operating point, the number of replicas for fault-tolerance and the processors on which to run the replicas so as to maximize overall system QoS. The algorithms are extensions of Q-RAM (QoS-based Resource Allocation Model) [5] and fix two deficiencies with the basic algorithm. The first is that the existing algorithm is weak in making resource trade-off decisions such as to which processor to map a task. The second was that it was not scalable to very large numbers of resources such as in a large multi-processor system. In this paper we present two new algorithms which significantly enhance the ability of Q-RAM to make resource tradeoff decisions. We also introduce a hierarchical decomposition scheme which enables QoS optimization to be performed on problems with thousands of resources and thousands of tasks.

关键词： Resource management distributed computing

来源：评论

学校读者我要写书评

暂无评论

PEAS: a robust energy conserving protocol for long-lived sensor networks

PEAS: a robust energy conserving protocol for long-lived sen...

引用

international conference on distributed computing systems

作者： Fan Ye G. Zhong J. Cheng Songwu Lu Lixia Zhang Computer Science Department UCLA Los Angeles CA USA

In this paper we present PEAS, a robust energy-conserving protocol that can build long-lived, resilient sensor networks using a very large number of small sensors with short battery lifetime. PEAS extends the network lifetime by maintaining a necessary set of working nodes and turning off redundant ones. PEAS operations are based on individual node's observation of the local environment and do not require any node to maintain per neighbor node state. PEAS performance possesses a high degree of robustness in the presence of both node power depletions and unexpected failures. Our simulations and analysis show that PEAS can maintain an adequate working node density in the face of up to 38% node failures, and it can maintain roughly a constant overhead level under various deployment conditions ranging from sparse to very dense node deployment by using less than 1% of total energy consumption. As a result, PEAS can extend a sensor network's functioning time in linear proportion to the deployed sensor population.

关键词： Robustness Protocols Sensor systems distributed computing

来源：评论

学校读者我要写书评

暂无评论

SPEED: a stateless protocol for real-time communication in sensor networks

SPEED: a stateless protocol for real-time communication in s...

引用

international conference on distributed computing systems

作者： Tian He J.A. Stankovic Chenyang Lu T. Abdelzaher Department of Computer Science University of Virginia USA Department of Computer Science & Engineering Washington University Saint Louis USA

In this paper, we present a real-time communication protocol for sensor networks, called SPEED. The protocol provides three types of real-time communication services, namely, real-time unicast, real-time area-multicast and real-time area-anycast. SPEED is specifically tailored to be a stateless, localized algorithm with minimal control overhead End-to-end soft real-time communication is achieved by maintaining a desired delivery speed across the sensor network through a novel combination of feedback control and non-deterministic geographic forwarding. SPEED is a highly efficient and scalable protocol for sensor networks where the resources of each node are scarce. Theoretical analysis, simulation experiments and a real implementation on Berkeley motes are provided to validate our claims.

关键词： Intelligent networks Intelligent sensors Routing protocols Computer science Unicast Feedback control Large-scale systems Base stations Communication system control Analytical models

来源：评论

学校读者我要写书评

暂无评论

Building topology-aware overlays using global soft-state

Building topology-aware overlays using global soft-state

引用

international conference on distributed computing systems

作者： Zhichen Xu Chunqiang Tang Zheng Zhang Hewlett Packard Laboratories USA Department of Computer Science University of Rochester USA Microsoft Research Asia China

ISBN: (纸本)0769519202

distributed hash table (DHT) based overlay networks offer an administration-free and fault-tolerant storage space that maps "keys" to "values". For these systems to function efficiently, their structures must fit that of the underlying network. Existing techniques for discovering network proximity information, such as landmark clustering and expanding-ring search are either inaccurate or expensive. The lack of global proximity information in overlay construction and maintenance can result in bad proximity approximation or excessive communication. To address these problems, we propose the following: (1) Combining landmark clustering and round-trip time (RTT) measurements to generate proximity information, achieving both efficiency and accuracy. (2) Controlled placement of global proximity information on the system itself as soft-state, such that nodes can independently access relevant information efficiently. (3) Publish/subscribe functionality that allows nodes to subscribe to the relevant soft-state and get notified as the state changes necessitate overlay restructuring.

关键词： Routing Network topology Internet Buildings Fault tolerance Time measurement Communication system control Control systems Fault tolerant systems Extraterrestrial measurements

来源：评论

学校读者我要写书评

暂无评论

SPIN: a toolkit for distributed scientific computing

SPIN: a toolkit for distributed scientific computing

引用

Computer Science Society (SCCC) international conference Chilean FLAGGED

作者： M. Gonzalez Laboratoire PRiSM Université de Versailles Saint Quentin en Yvelines Versailles France

The aim of this paper is to present SPIN, an interactive and integrated software environment for scientific computation. The main goal of SPIN is to allow the access to remote computational and storage resources in an easy to use and transparent way from the user's point of view. This environment, based on a multi-tier architecture, has been developed following a state of the art software engineering process which incorporates the CORBA standard (Common Object Request Broker Architecture) the PAC-Amodeus model, (a multi-agent based model for interactive systems architecture) and the Unified Process (UP) to guide the whole life-cycle of the project.

关键词： distributed computing Computer architecture Sparse matrices Interactive systems Libraries Vectors Linear algebra Concurrent computing High performance computing Java

来源：评论

学校读者我要写书评

暂无评论

Method partitioning - runtime customization of pervasive programs without design-time application knowledge

Method partitioning - runtime customization of pervasive pro...

引用

international conference on distributed computing systems

作者： Dong Zhou S. Pande K. Schwan DoCoMo Communications Laboratory USA Inc. San Jose CA USA Center for Experimental Research in Computer Science Georgia Institute of Technology Atlanta GA USA

Method Partitioning is a dynamic technique for customizing performance-critical message-based interactions between program components, at runtime and without the need for design-time application knowledge. The technique partitions program units that implement message handling, with low costs and high levels of flexibility. It consists of (a) static analysis of a message handling method to produce candidate partitioning plans for the method, (b) cost models for evaluating the cost/benefits of different partitioning plans, (c) a Remote Continuation mechanism that "connects" the distributed parts of a partitioned method at runtime, and (d) Runtime Profiling and Reconfiguration which monitors actual costs of candidate plans and dynamically selects "best" plans from candidates. Experiments with prototypical implementation of Method Partitioning in the JECho distributed event system demonstrate significant performance improvements for both communication-bound and compute-intensive applications, with both applications having dynamic factors that are not predictable at design time.

关键词： Runtime Costs Application software USA Councils distributed computing Network servers Optimization methods Computer science Mobile agents Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

Weakly-connected dominating sets and sparse spanners in wireless ad hoc networks

Weakly-connected dominating sets and sparse spanners in wire...

引用

international conference on distributed computing systems

作者： K.M. Alzoubi Peng-Jun Wan O. Frieder Department of Computer Science Illinois Institute of Technology Chicago IL USA

A set S is dominating if each node in the graph G = (V, E) is either in S or adjacent to at least one of the nodes in S. The subgraph weakly induced by S is the graph G' = (V, E') such that each edge in E' has at least one end point in S. The set S is a weakly-connected dominating set (WCDS) of G if S is dominating and G' is connected G' is a sparse spanner if it has linear edges. In this paper, we present two distributed algorithms for finding a WCDS in O(n) time. The first algorithm has an approximation ratio of 5, and requires O(n log n) messages. The second algorithm has a larger approximation ratio, but it requires only O(n) messages. The graph G' generated by the second algorithm forms a sparse spanner with a topological dilation of 3, and a geometric dilation of 6.

关键词： Intelligent networks Ad hoc networks Spine Approximation algorithms Mobile ad hoc networks distributed algorithms Routing Broadcasting Linear approximation Computer science

来源：评论

学校读者我要写书评

暂无评论

Self-stabilizing smoothing and counting

Self-stabilizing smoothing and counting

引用

international conference on distributed computing systems

作者： M. Herlihy S. Tirthapura Computer Science Department Brown University USA Department of Electrical and Computer Engineering Iowa State University USA

A smoothing network is a distributed data structure that accepts tokens on input wires and routes them to output wires. It ensures that however imbalanced the traffic on input wires, the numbers of tokens emitted on output wires are approximately balanced. Prior work on smoothing networks always assumed that such networks were properly initialized. In a real distributed system, however, network switches may be rebooted or replaced dynamically, and it may not be practical to determine the correct initial state for the new switch. Prior analyses do not work under these new assumptions. This paper makes the following contributions. First, we show that some well-known 1-smoothing networks, known as counting networks, when started in an arbitrary initial state (perhaps chosen by an adversary), remain remarkably smooth, degrading from 1-smooth to log(n)-smooth, where n is the number of input/output wires. Second, we show that the same networks can be made eventually 1-smooth by "piggy-backing" a small amount of additional information on messages when (and only when) trouble is detected.

关键词： Smoothing methods Wires Switches Data structures Telecommunication traffic Network servers Computer science Degradation distributed computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共105页 << < 94 95 96 97 98 99 100 101 102 103 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：