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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

40 篇 会议
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

14 篇 工学
- 10 篇 计算机科学与技术...
- 7 篇 信息与通信工程
- 4 篇 软件工程
- 3 篇 电气工程
- 2 篇 控制科学与工程
- 1 篇 机械工程
- 1 篇 光学工程
- 1 篇 仪器科学与技术
- 1 篇 生物工程
- 1 篇 安全科学与工程
4 篇 理学
- 1 篇 数学
- 1 篇 物理学
- 1 篇 海洋科学
- 1 篇 生物学
- 1 篇 系统科学
1 篇 法学
- 1 篇 法学
1 篇 管理学
- 1 篇 管理科学与工程(可...

主题

2 篇 cloud
2 篇 security
2 篇 availability
1 篇 sensor nodes
1 篇 vpki
1 篇 networked contro...
1 篇 information syst...
1 篇 reliability
1 篇 scalability
1 篇 adaptive sensor ...
1 篇 approximation al...
1 篇 supervision
1 篇 smartphones
1 篇 peer to peer com...
1 篇 task analysis
1 篇 micro-service
1 篇 application soft...
1 篇 vehicle detectio...
1 篇 real time system...
1 篇 identity and cre...

机构

2 篇 university of sc...
2 篇 singapore univer...
2 篇 microsoft
2 篇 uc berkeley
2 篇 microsoft resear...
1 篇 computer science...
1 篇 dropbox
1 篇 the national sch...
1 篇 faculty of infor...
1 篇 university of ca...
1 篇 nanyang technol ...
1 篇 dept. of electri...
1 篇 intel labs
1 篇 microsoft resear...
1 篇 dept. of enginee...
1 篇 college of infor...
1 篇 usc information ...
1 篇 university of ca...
1 篇 natl univ singap...
1 篇 university of ca...

作者

1 篇 p. brighten godf...
1 篇 keith winstein
1 篇 he jheng-jhan
1 篇 fan chih-peng
1 篇 rachid guerraoui
1 篇 khodaei mohammad
1 篇 bin hu
1 篇 tua a. tamba
1 篇 asma ben mansour
1 篇 p. tupec
1 篇 chitra muthukris...
1 篇 gerald q. maguir...
1 篇 robert ricci
1 篇 hongze zhao
1 篇 varadharajan vij...
1 篇 eric brewer
1 篇 emin gün sirer
1 篇 philip levis
1 篇 chabir alaa
1 篇 liang he

语言

41 篇 英文

检索条件"任意字段=Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation"

共 41 条记录，以下是21-30 订阅

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

详细简洁

排序：

Demo abstract: Exploring smartphone-based participatory computing to improve pervasive surveillance

Demo abstract: Exploring smartphone-based participatory comp...

引用

11th ACM conference on Embedded networked Sensor systems, SenSys 2013

作者： Dong, Zheng Lu, Banghui He, Liang Cheng, Peng Gu, Yu Fang, Lu Singapore University of Technology and Design Singapore University of Science and Technology of China China

ISBN: (纸本)9781450320276

Participatory Computing is a promising solution to fully utilize the wasted computation resources of mobile devices such as smartphones. In this demo abstract, we present our design and implementation of an participatory computing en- hanced pervasive surveillance system. Our evaluation results show that the proposed system can effectively utilize the computation capability of mobile devices while guaranteeing the service reliability even with the intermittent nature of participatory computing.

关键词： Smartphones

来源：评论

学校读者我要写书评

暂无评论

Exploring smartphone-based participatory computing to improve pervasive surveillance 13

Exploring smartphone-based participatory computing to improv...

引用

proceedings of the 11th ACM conference on Embedded networked Sensor systems

作者： Zheng Dong Banghui Lu Liang He Peng Cheng Yu Gu Lu Fang Singapore University of Technology and Design Singapore University of Science and Technology of China China

ISBN: (纸本)9781450320276

Participatory Computing is a promising solution to fully utilize the wasted computation resources of mobile devices such as smartphones. In this demo abstract, we present our design and implementation of an participatory computing enhanced pervasive surveillance system. Our evaluation results show that the proposed system can effectively utilize the computation capability of mobile devices while guaranteeing the service reliability even with the intermittent nature of participatory computing.

关键词： task assignment participatory computing

来源：评论

学校读者我要写书评

暂无评论

design and implementation of a consolidated middlebox architecture 12

Design and implementation of a consolidated middlebox archit...

引用

proceedings of the 9th usenix conference on networked systems design and implementation

作者： Vyas Sekar Norbert Egi Sylvia Ratnasamy Michael K. Reiter Guangyu Shi Intel Labs Huawei UC Berkeley UNC Chapel Hill

Network deployments handle changing application, workload, and policy requirements via the deployment of specialized network appliances or "middleboxes". Today, however, middlebox platforms are expensive and closed systems, with little or no hooks for extensibility. Furthermore, they are acquired from independent vendors and deployed as standalone devices with little cohesiveness in how the ensemble of middleboxes is managed. As network requirements continue to grow in both scale and variety, this bottom-up approach puts middlebox deployments on a trajectory of growing device sprawl with corresponding escalation in capital and management *** address this challenge, we present CoMb, a new architecture for middlebox deployments that systematically explores opportunities for consolidation, both at the level of building individual middleboxes and in managing a network of middleboxes. this paper addresses key resource management and implementation challenges that arise in exploiting the benefits of consolidation in middlebox deployments. Using a prototype implementation in Click, we show that CoMb reduces the network provisioning cost 1.8-2.5× and reduces the load imbalance in a network by 2-25×.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CORFU: a shared log design for flash clusters 12

CORFU: a shared log design for flash clusters

引用

proceedings of the 9th usenix conference on networked systems design and implementation

作者： Mahesh Balakrishnan Dahlia Malkhi Vijayan Prabhakaran Ted Wobber Michael Wei John D. Davis Microsoft Research Silicon Valley University of California San Diego

CORFU organizes a cluster of flash devices as a single, shared log that can be accessed concurrently by multiple clients over the network. the CORFU shared log makes it easy to build distributed applications that require strong consistency at high speeds, such as databases, transactional key-value stores, replicated state machines, and metadata services. CORFU can be viewed as a distributed SSD, providing advantages over conventional SSDs such as distributed wear-leveling, network locality, fault tolerance, incremental scalability and geo-distribution. A single CORFU instance can support up to 200K appends/sec, while reads scale linearly with cluster size. Importantly, CORFU is designed to work directly over network-attached flash devices, slashing cost, power consumption and latency by eliminating storage servers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Embedding Virtual Topologies in networked Clouds 11

Embedding Virtual Topologies in Networked Clouds

引用

6th International conference on Future Internet Technologies (CFI)

作者： Xin, Yufeng Baldine, Ilia Mandal, Anirban Heermann, Chris Chase, Jeff Yumerefendi, Aydan UNC CH RENCI Chapel Hill NC 27599 USA Duke Univ Durham NC USA

ISBN: (纸本)9781450308212

Embedding virtual topologies in physical network infrastructure has been an area of active research for the future Internet and network testbeds. Virtual network embedding is also useful for linking virtual compute clusters allocated from cloud providers. Using advanced networking technologies to interconnect distributed cloud sites is a promising way to provision on-demand large-scale virtualized networked systems for production and experimental purposes. In this paper, we study the virtual topology embedding problem in a networked cloud environment, in which a number of cloud provider sites are connected by multi-domain wide-area networks that support virtual networking technology. A user submits a request for a virtual topology, and the system plans a low-cost embedding and orchestrates requests to multiple cloud providers and network transit providers to instantiate the virtual topology according to the plan. We describe an efficient heuristic algorithm design and a prototype implementation within a GENI control framework candidate called ORCA.

关键词： Virtual topology Embedding Cloud

来源：评论

学校读者我要写书评

暂无评论

design, implementation and evaluation of congestion control for multipath TCP 11

Design, implementation and evaluation of congestion control ...

引用

proceedings of the 8th usenix conference on networked systems design and implementation

作者： Damon Wischik Costin Raiciu Adam Greenhalgh Mark Handley University College London

Multipath TCP, as proposed by the IETF working group mptcp, allows a single data stream to be split across multiple paths. this has obvious benefits for reliability, and it can also lead to more efficient use of networked resources. We describe the design of a multipath congestion control algorithm, we implement it in Linux, and we evaluate it for multihomed servers, data centers and mobile clients. We show that some 'obvious' solutions for multipath congestion control can be harmful, but that our algorithm improves throughput and fairness compared to single-path TCP. Our algorithmis a drop-in replacement for TCP, and we believe it is safe to deploy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Epidemic K-Means Clustering

Epidemic K-Means Clustering

引用

IEEE International conference on Data Mining Workshops (ICDM Workshops)

作者： Giuseppe Di Fatta Francesco Blasa Simone Cafiero Giancarlo Fortino School of Systems Engineering University of Reading Reading UK Dipartimento di Informatica Elettronica e Sistemistica University of Calabria Italy

the K-Means algorithm for cluster analysis is one of the most influential and popular data mining methods. Its straightforward parallel formulation is well suited for distributed memory systems with reliable interconnection networks. However, in large-scale geographically distributed systems the straightforward parallel algorithm can be rendered useless by a single communication failure or high latency in communication paths. this work proposes a fully decentralised algorithm (Epidemic K-Means) which does not require global communication and is intrinsically fault tolerant. the proposed distributed K-Means algorithm provides a clustering solution which can approximate the solution of an ideal centralised algorithm over the aggregated data as closely as desired. A comparative performance analysis is carried out against the state of the art distributed K-Means algorithms based on sampling methods. the experimental analysis confirms that the proposed algorithm is a practical and accurate distributed K-Means implementation for networked systems of very large and extreme scale.

关键词： Protocols Peer to peer computing Clustering algorithms Algorithm design and analysis Approximation algorithms Approximation methods Vectors

来源：评论

学校读者我要写书评

暂无评论

A semantic framework for data analysis in networked systems 11

A semantic framework for data analysis in networked systems

引用

proceedings of the 8th usenix conference on networked systems design and implementation

作者： Arun Viswanathan Alefiya Hussain Jelena Mirkovic Stephen Schwab John Wroclawski USC Information Sciences Institute USC Information Sciences Institute and Sparta Inc. Sparta Inc.

Effective analysis of raw data from networked systems requires bridging the semantic gap between the data and the user's high-level understanding of the system. the raw data represents facts about the system state and analysis involves identifying a set of semantically relevant behaviors, which represent "interesting" relationships between these facts. Current analysis tools, such as wireshark and splunk, restrict analysis to the low-level of individual facts and provide limited constructs to aid users in bridging the semantic gap. Our objective is to enable semantic analysis at a level closer to the user's understanding of the system or process. the key to our approach is the introduction of a logic-based formulation of high-level behavior abstractions as a sequence or a group of related facts. this allows treating behavior representations as fundamental analysis primitives, elevating analysis to a higher semantic-level of abstraction. In this paper, we propose a behavior-based semantic analysis framework which provides: (a) a formal language for modeling high-level assertions over networked systems data as behavior models, (b) an analysis engine for extracting instances of user-specified behavior models from raw data. Our approach emphasizes reuse, composibility and extensibility of abstractions. We demonstrate the effectiveness of our approach by applying it to five analyses tasks; modeling a hypothesis on traffic traces, modeling experiment behavior, modeling a security threat, modeling dynamic change and composing higher-level models. Finally, we discuss the performance of our framework in terms of behavior complexity and number of input records.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Model checking a networked system without the network 11

Model checking a networked system without the network

引用

proceedings of the 8th usenix conference on networked systems design and implementation

作者： Rachid Guerraoui Maysam Yabandeh School of Computer and Communication Sciences EPFL Switzerland

Current approaches to model checking distributed systems reduce the problem to that of model checking centralized systems: global states involving all nodes and communication links are systematically explored. the frequent changes in the network element of the global states lead however to a rapid state explosion and make it impossible to model check any non-trivial distributed system. We explore in this paper an alternative: a local approach where the network is ignored, a priori: only the local nodes' states are explored and in a separate manner. the set of valid system states is a subset of all combinations of the node local states and checking validity of such a combination is only performed a posteriori, in case of a possible bug. this approach drastically reduces the number of transitions executed by the model checker. It takes for example the classic global approach several minutes to explore the interleaving of messages in the celebrated Paxos distributed protocol even considering only three nodes and a single proposal. Our local approach explores the entire system state in a few seconds. Our local approach does clearly not eliminate the state exponential explosion problem. Yet, it postpones its manifestations till some deeper levels. this is already good enough for online testing tools that restart the model checker periodically from the current live state of a running system. We show for instance how this approach enables us to find two bugs in variants of Paxos.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cheap and large CAMs for high performance data-intensive networked systems 10

Cheap and large CAMs for high performance data-intensive net...

引用

proceedings of the 7th usenix conference on networked systems design and implementation

作者： Ashok Anand Chitra Muthukrishnan Steven Kappes Aditya Akella Suman Nath UW-Madison Microsoft Research

We show how to build cheap and large CAMs, or CLAMs, using a combination of DRAM and flash memory. these are targeted at emerging data-intensive networked systems that require massive hash tables running into a hundred GB or more, with items being inserted, updated and looked up at a rapid rate. For such systems, using DRAM to maintain hash tables is quite expensive, while on-disk approaches are too slow. In contrast, CLAMs cost nearly the same as using existing on-disk approaches but offer orders of magnitude better performance. Our design leverages an efficient flash-oriented data-structure called BufferHash that significantly lowers the amortized cost of random hash insertions and updates on flash. BufferHash also supports flexible CLAM eviction policies. We prototype CLAMs using SSDs from two different vendors. We find that they can offer average insert and lookup latencies of 0.006ms and 0.06ms (for a 40% lookup success rate), respectively. We show that using our CLAM prototype significantly improves the speed and effectiveness of WAN optimizers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共5页 << < 1 2 3 4 5 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：