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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

204 篇 会议
4 册 图书
2 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

147 篇 工学
- 122 篇 计算机科学与技术...
- 69 篇 软件工程
- 41 篇 信息与通信工程
- 22 篇 电气工程
- 8 篇 控制科学与工程
- 5 篇 动力工程及工程热...
- 5 篇 生物医学工程（可授...
- 4 篇 电子科学与技术（可...
- 4 篇 土木工程
- 4 篇 生物工程
- 3 篇 机械工程
- 3 篇 建筑学
- 2 篇 交通运输工程
- 2 篇 农业工程
- 2 篇 环境科学与工程（可...
22 篇 管理学
- 19 篇 管理科学与工程(可...
- 12 篇 工商管理
- 5 篇 图书情报与档案管...
21 篇 理学
- 14 篇 数学
- 5 篇 统计学（可授理学、...
- 4 篇 生物学
- 3 篇 物理学
- 3 篇 大气科学
- 2 篇 系统科学
6 篇 法学
- 3 篇 法学
- 3 篇 社会学
5 篇 经济学
- 5 篇 应用经济学
5 篇 医学
- 5 篇 基础医学(可授医学...
- 5 篇 临床医学
- 3 篇 公共卫生与预防医...
2 篇 农学

主题

27 篇 cloud computing
16 篇 mobile computing
11 篇 internet
10 篇 distributed comp...
9 篇 social networkin...
9 篇 peer-to-peer com...
8 篇 routing
8 篇 wireless sensor ...
8 篇 protocols
7 篇 software enginee...
6 篇 artificial intel...
6 篇 distributed data...
5 篇 fault tolerance
5 篇 computer archite...
5 篇 smart phones
5 篇 security
5 篇 mobile communica...
4 篇 peer to peer com...
4 篇 grid computing
4 篇 resource managem...

机构

3 篇 department of in...
3 篇 univ fed paraiba...
3 篇 beijing jiaotong...
2 篇 inria
2 篇 rhein westfal th...
2 篇 department of co...
2 篇 parallel and dis...
2 篇 parallel wireles...
2 篇 univ minnesota d...
2 篇 freelance kanaga...
2 篇 faculty of elect...
2 篇 department of co...
2 篇 amrita vishwa vi...
2 篇 univ stuttgart i...
1 篇 anna university ...
1 篇 king abdulaziz u...
1 篇 sprint
1 篇 department of co...
1 篇 techno internati...
1 篇 department of co...

作者

3 篇 teruhisa hochin
3 篇 shen hong
2 篇 jin miao
2 篇 duerr frank
2 篇 shigeaki tanimot...
2 篇 zhou hongyu
2 篇 hiroki nomiya
2 篇 mostefaoui achou...
2 篇 motoi iwashita
2 篇 raynal michel
2 篇 mokbel mohamed f...
2 篇 li yidong
2 篇 sattler kai-uwe
2 篇 hiep hoang-van
2 篇 chen chao-chun
2 篇 henze martin
2 篇 iwashita motoi
2 篇 ziegeldorf jan h...
2 篇 wu hongyi
2 篇 chuang kun-ta

语言

209 篇 英文
1 篇 其他

检索条件"任意字段=14th International Conference on Distributed Computing and Networking, ICDCN 2013"

共 210 条记录，以下是31-40 订阅

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

详细简洁

排序：

Backtrack-based Failure Recovery in distributed Stream Processing

Backtrack-based Failure Recovery in Distributed Stream Proce...

引用

14th ACIS international conference on Software Engineering, Artificial Intelligence, networking and Parallel/distributed computing (SNPD)

作者： Chen, Qiming Hsu, Meichun Castellanos, Malu HP Labs Palo Alto CA 94304 USA

ISBN: (纸本)9780769550053

Since stream analytics is treated as a kind of cloud service, there exists a pressing need for its reliability and fault-tolerance. In a streaming process, the parallel and distributed tasks are chained in a graph-structure with each task transforming a stream to a new stream;the transaction property guarantees the streaming data, called tuples, to be processed in the order of their generation in every dataflow path, with each tuple processed once and only once. the failure recovery of a task allows the previously produced results to be corrected for eventual consistency, which is different from the instant consistency of global state enforced by the failure recovery of general distributed systems, and therefore presents new technical challenges. Transactional stream processing typically requires every task to checkpoint its execution state, and when it is restored from a failure, to have the last state recovered from the checkpoint and missing tuple re-acquired and processed. Currently there exist two kind approaches: one treats the whole process as a single transaction, and therefore suffers from the loss of intermediate results during failures;the other relies on the receipt of acknowledgement (ACK) to decide whether moving forward to emit the next resulting tuple or resending the current one after timeout, on the per-tuple basis, thus incurs extremely high latency penalty. In contradistinction to the above, we propose the backtrack mechanism for failure recovery, which allows a task to process tuples continuously without waiting for ACKs and without resending tuples in the failure-free case, but to request (ASK) the source tasks to resend the missing tuples only when it is restored from a failure which is a rare case thus has limited impact on the overall performance. We have implemented the proposed mechanisms on Fontainebleau, the distributed stream analytics infrastructure we developed on top of Storm. As a principle, we ensure all the transactional propertie

关键词： Stream processing Dataflow transaction

来源：评论

学校读者我要写书评

暂无评论

pDCell: an End-to-End Transport Protocol for Mobile Edge computing Architectures 19

pDCell: an End-to-End Transport Protocol for Mobile Edge Com...

引用

20th international conference on distributed computing and networking (icdcn)

作者： Fiandrino, Claudio de la Oliva, Antonio Widmer, Joerg Kogan, Kirill IMDEA Networks Inst Madrid Spain Univ Carlos III Madrid Madrid Spain

ISBN: (纸本)9781450360944

To deal with increasingly demanding services and the rapid growth in number of devices and traffic, 5G and beyond mobile networks need to provide extreme capacity and peak data rates at very low latencies. Consequently, applications and services need to move closer to the users into so-called edge data centers. At the same time, there is a trend to virtualize core and radio access network functionalities and bring them to edge data centers as well. However, as is known from conventional data centers, legacy transport protocols such as TCP are vastly suboptimal in such a setting. In this work, we present pDCell, a transport design for mobile edge computing architectures that extends data center transport approaches to the mobile network domain. Specifically, pDCell ensures that data traffic from application servers arrives at virtual radio functions (i.e., C-RAN Central Units) timely to (i) minimize queuing delays and (ii) to maximize cellular network utilization. We show that pDCell significantly improves flow completion times compared to conventional transport protocols like TCP and data center transport solutions, and is thus an essential component for future mobile networks.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

An Authentication Method with Spatiotemporal Interval and Partial Matching

An Authentication Method with Spatiotemporal Interval and Pa...

引用

14th ACIS international conference on Software Engineering, Artificial Intelligence, networking and Parallel/distributed computing (SNPD)

作者： Tsunoda, Masateru Fushida, Kyohei Kamei, Yasutaka Nakamura, Masahide Mitsui, Kohei Goto, Keita Matsumoto, Kenichi Toyo Univ Saitama Japan Nara Inst Sci & Technol Nara Japan Kyushu Univ Fukuoka Japan Kobe Univ Kobe Hyogo Japan

ISBN: (纸本)9780769550053

In past research, we proposed an authentication method that combines actions with spatiotemporal information such as location, time, and distance. With the method, a user succeeds in authentication when he/she performs preset actions such as pushing button n times on preset intervals defined by spatiotemporal information. In this paper, we improve the authentication method using a partial matching method. We propose two kinds of partial matching methods for pushing button and interval. A type I method assumes the number of pushing button is sometimes less than preset count, but the number never exceeds it, and a user never pushes the button out of preset areas. A type II method assumes the number of pushing button is less or more than preset count occasionally, and a user pushes the button out of preset areas. We showed how to calculate FAR when the type I or II is applied. In the experiment, we compared the type I and II methods with a conventional method to evaluate their security. As a result, the type I method improved false acceptance rate (FAR) from 0.097% to 0.053%. the type II method improved FAR from 0.097% to 0.035%.

关键词： spatiotemporal information spatiotemporal character partial match authentication authentication interval ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

PeerVault: A distributed peer-to-peer platform for reliable data backup

PeerVault: A distributed peer-to-peer platform for reliable ...

引用

14th international conference on distributed computing and networking, icdcn 2013

作者： Khan, Adnan Shahriar, Mehrab Imon, Sk Kajal Arefin Di Francesco, Mario Das, Sajal K. University of Texas Arlington TX United States Department of Computer Science and Engineering Aalto University School of Science Finland

ISBN: (纸本)9783642356674

Large scale peer-to-peer (P2P) systems are envisioned as a way to provide online storage service. For a reliable storage service, the participating peers are required to maintain strict commitments for their online duration. On the other hand, recent results show that users participating in volunteer computing collectively exhibit certain patterns in terms of their long-term availability, a metric that denotes periodic online durations for a considerably long time interval. In this article we introduce PeerVault, a P2P platform that leverages the long-term availability of the computer users to form a distributed reliable storage service, targeted to backup of personal data. We further present a distributed monitoring scheme that assists PeerVault to detect peer churns and ensure the reliability of the proposed backup service. To the best of our knowledge, this is the first effort to describe the architecture of a reliable P2P backup service exploiting the long-term availability and idle resources of computing devices. We conduct experiments based on the availability traces of hundreds of thousands of hosts from the SETI@home computing project. the obtained results show that the proposed approach is effective in terms of availability as well as reliability of the offered backup service. © Springer-Verlag 2013.

关键词： Reliability

来源：评论

学校读者我要写书评

暂无评论

Decentralized erasure coding for efficient data archival in distributed storage systems

Decentralized erasure coding for efficient data archival in ...

引用

14th international conference on distributed computing and networking, icdcn 2013

作者： Pamies-Juarez, Lluis Oggier, Frederique Datta, Anwitaman School of Mathematical and Physical Sciences Singapore School of Computer Engineering Nanyang Technological University Singapore

ISBN: (纸本)9783642356674

distributed storage systems usually achieve fault tolerance by replicating data across different nodes. However, redundancy schemes based on erasure codes can provide a storage-efficient alternative to replication. this is particularly suited for data archival since archived data is rarely accessed. Typically, the migration to erasure-encoded storage does not leverage on the existing replication based redundancy, and simply discards (garbage collects) the excessive replicas. In this paper we propose a new decentralized erasure coding process that achieves the migration in a network-efficient manner in contrast to the traditional coding processes. the proposed approach exploits the presence of data that is already replicated across the system and distributes the redundancy generation among those nodes that store part of this replicated data, which in turn reduces the overall amount of data transferred during the encoding process. By storing additional replicated blocks at nodes executing the distributed encoding tasks, the necessary network traffic for archiving can be further *** analyze the problem using symbolic computation and show that the proposed decentralized encoding process can reduce the traffic by up to 56% for typical system configurations. © Springer-Verlag 2013.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

A Game Based Power Allocation in Cloud computing Data Centers 14

A Game Based Power Allocation in Cloud Computing Data Center...

引用

14th international conference on Wireless and Mobile computing, networking and Communications (WiMob)

作者： Benblidia, Mohammed Anis Brik, Bouziane Esseghir, Moez Merghem-Boulahia, Leila Univ Technol Troyes CNRS UMR 6281 ICDERA Troyes France

ISBN: (纸本)9781538668764

the emergence of smart systems based on Internet of things (IoT) and new technologies has led to use more cloud computing services. this incentivizes to build more geographically distributed data centers. However, the data centers consume a tremendous amount of electricity which significantly increases load on power grid. there are broad concerns about the impact that this huge consumption may cause to the power grid. Moreover, the data centers are competing to get the maximum of power from the smart grid in a selfish way, which also has a negative impact on both the smart grid and the other data centers. In this paper, we model the power allocation problem between the smart grid and cloud data centers as a noncooperative game. the basic idea of our approach is to determine the optimal quantity of power that will be assigned to each data center, in order to have a fair power allocation. To do so, we consider the data center priority in terms of number of active servers, state of energy charge and number of running critical applications. Moreover, we prove the existence and uniqueness of Nash equilibrium, and compute the optimal quantity of power using Lagrange multipliers and KarushKuhnTucker (KKT) conditions. Simulation results confirm the effectiveness of the proposed approach, and show that our scheme can reduce the load on the power grid up to 80%.

关键词： Cloud data centers Smart Grid power allocation game theory

来源：评论

学校读者我要写书评

暂无评论

P2PTV Traffic Localization by Deep Packet Inspection

P2PTV Traffic Localization by Deep Packet Inspection

引用

14th ACIS international conference on Software Engineering, Artificial Intelligence, networking and Parallel/distributed computing (SNPD)

作者： Hiep Hoang-Van Miyoshi, Takumi Fourmaux, Olivier Shibaura Inst Technol Grad Sch Engn & Sci Saitama Japan UPMC Sorbonne Univ Informat Lab Paris 6 Paris France

ISBN: (纸本)9780769550053

Recently, peer-to-peer has been becoming a promising architecture for developing video streaming services because it can reduce the bottlenecks and the load at the server side. However, P2P systems implement their own routing protocols on overlay networks, which are largely independent of the Internet routing. As a result, the traffic generated by P2P systems is immense and unpredictable. Controlling the P2P traffic is therefore becoming a big challenge for internet service providers (ISPs). Considering the P2P traffic localization is one of the most efficient solutions to optimize the traffic. the existing approaches, however, require several modifications of the application software. In this paper, we propose a novel traffic localization method for P2P streaming application (P2PTV) by deep packet inspection. Based on the peer list and the geographical location of the listed peers, we propose two mechanisms for localizing the traffic: the modification of the peer list packets and the redirection of the video request packets at network routers. Since our method is implemented on the network routers, it can be applied for all P2P applications without any software modifications. the experiments evaluated on a popular P2PTV, namely PPStream, prove the effectiveness of our proposed method on the problem of traffic localization.

关键词： peer-to-peer computing telecommunication network routing telecommunication traffic video streaming

来源：评论

学校读者我要写书评

暂无评论

Budget Constrained Selection of Cloud Storage Services for Advanced Processing in Datacenters 14

Budget Constrained Selection of Cloud Storage Services for A...

引用

14th RoEduNet international conference on networking in Education and Research (RoEduNet NER)

作者： Negru, Catalin Pop, Florin Marcu, Ovidiu Cristian Mocanu, Mariana Cristca, Valcntin Univ Politehn Bucuresti Fac Automat Control & Comp Dept Comp Sci Bucharest Romania

ISBN: (纸本)9781467381796

large scale, cyber-infrastructure systems include a large base of heterogeneous data sources, geographically distributed. Cloud storage services can be an ideal candidate for storing all these data. However, it is difficult to find the optimal solution in order to select a set of storage providers, with respect to different multiple objectives of this type of systems, such as cost optimization, budget constraints, Quality of Service (QoS), load balancing etc. In this paper, we study the multi-objective optimization problem for storage service selection with budget constraints. We start from a real world case scenario and build our mathematical model lbr the optimization problem. then we propose a linear programming technique to find a near optimal solution for the service selection problem.

关键词： Cost optimization Budget Constraints Data Storage Cloud computing Datacenters

来源：评论

学校读者我要写书评

暂无评论

Fast distributed PageRank computation

Fast distributed PageRank computation

引用

14th international conference on distributed computing and networking, icdcn 2013

作者： Das Sarma, Atish Molla, Anisur Rahaman Pandurangan, Gopal Upfal, Eli eBay Research Labs. eBay Inc. CA United States Division of Mathematical Sciences Nanyang Technological University Singapore 637371 Singapore Department of Computer Science Brown University Providence RI 02912 United States

ISBN: (纸本)9783642356674

Over the last decade, PageRank has gained importance in a wide range of applications and domains, ever since it first proved to be effective in determining node importance in large graphs (and was a pioneering idea behind Google's search engine). In distributed computing alone, PageRank vectors, or more generally random walk based quantities have been used for several different applications ranging from determining important nodes, load balancing, search, and identifying connectivity structures. Surprisingly, however, there has been little work towards designing provably efficient fully-distributed algorithms for computing PageRank. the difficulty is that traditional matrix-vector multiplication style iterative methods may not always adapt well to the distributed setting owing to communication bandwidth restrictions and convergence rates. In this paper, we present fast random walk-based distributed algorithms for computing PageRank in general graphs and prove strong bounds on the round complexity. We first present an algorithm that takes O (log n/Ε) rounds with high probability on any graph (directed or undirected), where n is the network size and Ε is the reset probability used in the PageRank computation (typically Ε is a fixed constant). We then present a faster algorithm that takes O(√log n/Ε) rounds in undirected graphs. Both of the above algorithms are scalable, as each node processes and sends only small (polylogarithmic in n, the network size) number of bits per round and hence work in the CONGEST distributed computing model. For directed graphs, we present an algorithm that has a running time of O (√log n/Ε), but it requires a polynomial number of bits to processed and sent per node in a round. To the best of our knowledge, these are the first fully distributed algorithms for computing PageRank vectors with provably efficient running time. © Springer-Verlag 2013.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

distributed Mobility Management With Tunneled And Tunnel Free Approach: A Compressive Literature Review 14

Distributed Mobility Management With Tunneled And Tunnel Fre...

引用

14th international conference on computing Communication and networking Technologies, ICCCNT 2023

作者： Mane, Sayali N. Khairnar, D.G. D.Y.Patil College of Engineering Akurdi Dept. of Electronics and Telecommunication Maharashtra Pune India

ISBN: (纸本)9798350335095

Because of the rise in popularity of mobile devices and the rising demand for high-quality multimedia content, mobile node traffic and mobile Internet data have increased dramatically in recent years. distributed mobility management (D.M.M.) is usually viewed as a solution to the issues brought on by centralized mobility management (C.M.M.).the effectiveness of the current distributed Mobility Management IP version 6 mobility management protocols Comparing tunneled versus tunnel-free approaches from the angles of handover delay, blocking probability, along with packet loss. Comparative analysis shows that the tunnel-free DMM method performs better by reducing - 1. Handover-latency, ***-blockingprobability 3. Data-packet-loss. Also, the Handover delay and Average propagation delay are observed in the simulation. © 2023 IEEE.

关键词： Packet loss

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共21页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：