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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

7,021 篇 会议
92 篇 期刊文献
52 册 图书

馆藏范围

7,165 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,954 篇 工学
- 3,402 篇 计算机科学与技术...
- 1,562 篇 信息与通信工程
- 1,421 篇 软件工程
- 1,051 篇 电气工程
- 241 篇 控制科学与工程
- 123 篇 电子科学与技术（可...
- 91 篇 网络空间安全
- 76 篇 动力工程及工程热...
- 74 篇 仪器科学与技术
- 64 篇 生物工程
- 52 篇 机械工程
- 35 篇 安全科学与工程
- 34 篇 建筑学
- 34 篇 土木工程
- 33 篇 测绘科学与技术
- 31 篇 生物医学工程（可授...
- 30 篇 交通运输工程
560 篇 管理学
- 412 篇 管理科学与工程(可...
- 186 篇 图书情报与档案管...
- 141 篇 工商管理
517 篇 理学
- 314 篇 数学
- 94 篇 物理学
- 73 篇 生物学
- 71 篇 系统科学
- 66 篇 统计学（可授理学、...
100 篇 法学
- 52 篇 社会学
- 49 篇 法学
63 篇 医学
- 37 篇 基础医学(可授医学...
- 31 篇 公共卫生与预防医...
42 篇 经济学
- 41 篇 应用经济学
26 篇 文学
23 篇 教育学
12 篇 农学
6 篇 军事学
2 篇 艺术学

主题

1,159 篇 distributed comp...
419 篇 software enginee...
363 篇 cloud computing
361 篇 artificial intel...
312 篇 computer archite...
306 篇 computer network...
274 篇 social networkin...
270 篇 protocols
247 篇 computer science
231 篇 computational mo...
221 篇 wireless sensor ...
210 篇 scalability
205 篇 peer to peer com...
204 篇 resource managem...
195 篇 routing
190 篇 bandwidth
189 篇 servers
188 篇 application soft...
181 篇 distributed data...
166 篇 grid computing

机构

110 篇 beijing univ pos...
88 篇 state key labora...
12 篇 department of co...
11 篇 college of compu...
10 篇 tsinghua univers...
10 篇 poznan supercomp...
10 篇 school of comput...
10 篇 department of co...
10 篇 beijing universi...
9 篇 inria
9 篇 beijing universi...
9 篇 research institu...
9 篇 rissho universit...
9 篇 tsinghua univ pe...
9 篇 institute of net...
9 篇 school of cyber ...
9 篇 institute of com...
8 篇 georgia inst tec...
8 篇 department of co...
8 篇 institute of net...

作者

25 篇 yang yang
16 篇 huang lican
16 篇 lican huang
14 篇 wehrle klaus
13 篇 gao zhipeng
12 篇 dustdar schahram
12 篇 buyya rajkumar
12 篇 rothermel kurt
11 篇 duerr frank
11 篇 wu jan-jan
11 篇 rajkumar buyya
11 篇 wang wei
11 篇 liu pangfeng
11 篇 teruhisa hochin
11 篇 qi qi
10 篇 ming chen
10 篇 hoefler torsten
10 篇 m. takizawa
10 篇 cheng shiduan
10 篇 schahram dustdar

语言

7,086 篇 英文
47 篇 中文
35 篇 其他

检索条件"任意字段=International Conference on Networking and Distributed Computing"

共 7165 条记录，以下是4951-4960 订阅

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

详细简洁

排序：

Batch Updates of distributed Streaming Graphs using Linear Algebra

Batch Updates of Distributed Streaming Graphs using Linear A...

引用

High Performance computing, networking, Storage and Analysis, SC-W: Workshops of the international conference for

作者： Elaheh Hassani Md Taufique Hussain Ariful Azad Dept. of Intelligent Systems Engineering Indiana University Bloomington IN USA

ISBN: (数字)9798350355543

ISBN: (纸本)9798350355550

We develop a distributed-memory parallel algorithm for performing batch updates on streaming graphs, where vertices and edges are continuously added or removed. Our algorithm leverages distributed sparse matrices as the core data structures, utilizing equivalent sparse matrix operations to execute graph updates. By reducing unnecessary communication among processes and employing shared-memory parallelism, we accelerate updates of distributed graphs. Additionally, we maintain a balanced load in the output matrix by permuting the resultant matrix during the update process. We demonstrate that our streaming update algorithm is at least 25 times faster than alternative linear-algebraic methods and scales linearly up to 4,096 cores (32 nodes) on a Cray EX supercomputer.

关键词： High performance computing conferences Linear algebra Data structures Supercomputers Sparse matrices Parallel algorithms Standards

来源：评论

学校读者我要写书评

暂无评论

Research of contour extraction for mountain tunnel entrance images

Research of contour extraction for mountain tunnel entrance ...

引用

2013 international conference on Computer,Networks and Communication Engineering(ICCNCE 2013)

作者： Liu Minjia Lin Jie Yuan Yuyu School of Computer Science and Technology Beijing University of Posts and Telecommunications Key Laboratory of Trustworthy Distributed Computing and Services Ministry of Education Beijing University of Posts and Telecommunications

ISBN: (纸本)9781629932170

Unmanned aerial vehicle (UAV) needs unmanned ground vehicle (UGV) searching the areas, such as tunnel inside the mountain. The technology of UGV extraction image features of mountain tunnel portal is very important. This paper implies embedded hardware platform to realize the UGV scanning environment image contour feature extraction. A new digital image processing algorithm with MATLAB is expressed for miniaturization real-time image contour feature extraction procedure. The processing speed is fast enough for real-time search task. Otsu method is implied to determine the threshold value, combining with Sobel operator, Prewitt operator and Canny operator to verify that Canny operator has the best effect in images contour extraction. The contour is precision with small amount of calculation.

关键词： UAV, cooperative search, wireless communication, image feature extraction, 3G SIM card networking

来源：评论

学校读者我要写书评

暂无评论

Context aware routing in distributed Sensor Networks for data gathering and dissemination

Context aware routing in Distributed Sensor Networks for dat...

引用

international conference on computing and networking Technology (ICCNT)

作者： Lokesh. B. Bhajantri N. Nalini Vijaylaxmi S. Patil Department of Information Science and Engineering Basaveshwar Engineering College Bagalkot Karnataka India Department of Computer Science and Engineering Nitte Meenakashi Institute of Technological Yelahanka Bangalore. Karnataka India

ISBN: (纸本)9781467356930

This paper proposes a context aware routing in distributed sensor network for data gathering and dissemination. A distributed Sensor Network (DSN) is composed of intelligent sensors that are geographically dispersed in the region of interest and interconnected through a communication network. The (acoustic, seismic, and infrared) data by leaf sensor nodes are transmitted over the network and integrated at the processing element to derive appropriate interferences about the environment for different purposes, such as target tracking, location, surveillance and so on. Since a DSN is typically deployed for remote operations in unstructured area and the measurements are usually collected in a harsh, unreliable, and even adversarial environment, it is critical to provide extended networking capability to guarantee the performance of the entire system. In this work, we consider different contexts in distributed sensors network by considering the scenario of forest area such as: temperature context, air pressure context and object aware context. This work mainly focuses on routing the data from source to sink, and gathering and dissemination of related data. In this work, data aggregation is done in two phase: In first phase data is aggregated in Data Aggregator (DA) and in second phase data is aggregated in Master Aggregator (MA). If the context is in the emergency level then data is disseminated to target area. We simulated the context aware routing for data gathering and dissemination to test the operation scheme in terms of performance parameters.

关键词： Context Computational modeling

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Approach for Consistency Management in Large Scale Systems

A Hybrid Approach for Consistency Management in Large Scale ...

引用

international conference on networking and Services (ICNS)

作者： G. Belalem Y. Slimani Dept. of Computer Science University of Oran Oran Algeria Dept. of Computer Science Faculty of Sciences of Tunis Tunis Tunisia

The emergence of grid architectures brings in new challenges in terms of high latencies, dynamic resource availability, and data sharing. Data grids connect collections of thousands of geographically distributed computational and storage resources, and promote their sharing between users. Data sharing can be accomplished through data replication. Although this later is a well-established technique, its implementation presents additional problems such as the management of replica consistency. In this paper, we propose a new model to address this specific problem in large scale systems. The model combines two existing approaches. It benefits from their advantages and offers more. It optimizes the cost of replica consistency management and resists to changes in large systems

关键词： Large-scale systems Grid computing Delay Availability Resource management Computer science distributed computing Quality of service Disaster management Computer architecture

来源：评论

学校读者我要写书评

暂无评论

A Dependable Global Location Service using Rendezvous on Hierarchic distributed Hash Tables

A Dependable Global Location Service using Rendezvous on Hie...

引用

international conference on Systems and international conference on Mobile Communications and Learning Technologies, (ICN/ICONS/MCL) international conference on networking

作者： J. Risson S. Qazi T. Moors A. Harwood University of New South Wales Australia University of Melbourne Australia

A location service is the part of a naming architecture that maps identifiers to network addresses. Ideally, the identifiers are globally unique, persistent and semantic-free. It has been acknowledged that distributed Hash Tables (DHTs) enable, for the first time, the use of semantic-free identifiers in massive, global networks. We argue that hierarchy is essential for dependability in massive, geographically distributed DHTs. Existing hierarchic DHTs embed location information in identifiers. Consequently, if identifiers move between DHTs in the hierarchy, then the changes always propagate to the root DHT. This Location Information Plane (LIP) design is the first hierarchic DHT that contains "moves and changes" within the lower layers of the hierarchy. It protects the root DHT using the rendezvous abstraction. We show how it supports global internet telephony networks based on the Session Initiation Protocol (SIP).

关键词： Internet telephony Protection Protocols Law Legal factors Peer to peer computing Mobile communication Communications technology Uniform resource locators Databases

来源：评论

学校读者我要写书评

暂无评论

BGP Blockchain for Metaverse - A distributed Consensus System for BGP

BGP Blockchain for Metaverse - A Distributed Consensus Syste...

引用

Metaverse computing, networking and Applications (MetaCom), IEEE international conference on

作者： Mike McBride Xinxin Fan David Guzman Futurewei Technologies Santa Clara CA IoTeX Menlo Park CA Technical University of Munich Munich Germany

A Metaverse provides an immersive and linked experience for individuals similar to what is depicted in the book "Ready Player One". Experiences will be enabled by VR headsets, gaming systems, desktop computers, smartphones, etc., while there will likely emerge several metaverses which in turn will need interconnection. Thus, the Metaverse may be portrayed as a platform that utilizes networking to build an open ecosystem in which different platforms co-exist to serve all users. One key technology for the Metaverse is a distributed consensus system (DCS), underpinning a set of distributed applications, most notably for cryptocurrency and asset management in general, often characterized as blockchain-based trading platforms. But the use of DCSs is not limited to applications. We assert that for a true Metaverse experience, and to prevent metaverse silos, there will need to be DCS-based security between the various metaverse platforms interconnected by the Border Gateway Protocol (BGP). Key for such security is the permissionless notion in its participation to enable a truly open ecosystem, while also addressing key performance aspects such as low latency across the various interconnections. This position paper highlights various opportunities for integrating DCSs with BGP in order to provide a secure and interoperable Metaverse architecture, and we propose a BGP Blockchain system as one area for additional BGP route security. We further propose the necessary elements needed in order to address key performance aspects in such a BGP Blockchain environment.

关键词：

来源：评论

学校读者我要写书评

暂无评论

distributed Reinforcement Learning with States Feature Encoding and States Stacking in Continuous Action Space 16th

Distributed Reinforcement Learning with States Feature Encod...

引用

16th EAI international conference on Collaborative computing: networking, Applications, and Worksharing, CollaborateCom 2020

作者： Xu, Tianqi Shi, Dianxi Wang, Zhiyuan Chen, Xucan Zhang, Yaowen Beijing100071 China Tianjin300457 China

ISBN: (纸本)9783030675363

The practical application of reinforcement learning agents is often bottlenecked by the duration of training time. To accelerate training, practitioners often turn to distributed reinforcement learning architectures to parallelize and accelerate the training process. This work, we utilize the distributed reinforcement learning architecture to deal with continuous control tasks. The Importance Weighted Actor-Learner Architectures (IMPALA) decouples the acting and learning process to reduce queuing time. IMPALA attains higher scores on the new DMLab-30 set and the Atari-57 set because of its high performance, good scalability, and high efficiency. We extend IMPALA on the continuous control tasks with three changes. We encoder states into low dimensional data to establish an action distribution function that the agents have the ability to exploit and explore. A queue buffer is used to store a mini-batch data and discard them after training. In order to make the agent take appropriate action in the continuous control environment, we stack the past three steps states that attempt to make the robot moves smoothly. Finally, experiments are carried out on Mujoco tasks. The results show that our work is better than other distributed reinforcement learning algorithms. © 2021, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Cost-based Solution for Optimizing Multi-join Queries over distributed Streaming Sensor Data

Cost-based Solution for Optimizing Multi-join Queries over D...

引用

international conference on Collaborative computing: networking, Applications and Worksharing (CollaborateCom)

作者： Joseph Gomes Hyeong-Ah Choi Department of Computer Science George Washington University Washington D.C. DC USA

Sensors are envisioned to be at the center of distributed collaborative computing services involving time-critical decision support. Sensors are small devices with limited communication and computational capabilities that collect data on their neighboring physical world and send the data periodically to server machines. Sensors form a collaborative network with these servers, where the sensors gather information and the servers perform various operations (e.g. filter, aggregate, join etc) on the information streams in real-time according to predefined queries or rules. Sensor data streams are continuous, un-ending and have highly volatile characteristics. As a result, traditional database systems are inappropriate for handling queries for sensor streams, and several stream data management systems have been proposed in the literature. In this paper we focus on a special type of query, namely join queries, which is the most expensive query operator. Here, we address the problem of finding an optimal join tree that maximizes throughput for sliding window based multi-join queries over continuous sensor data streams. We present a polynomial time algorithm Fodp and three variants of Fodp. Our experiments in ARES show that for almost all instances, trees from Fodp and its variants perform close to the optimal trees from our exponential time algorithm OptDP (Gomes, 2006), and significantly better than existing XJoin based heuristic algorithms

关键词： Sensor phenomena and characterization Network servers Collaboration distributed computing Time factors Physics computing Collaborative work Information filtering Information filters Aggregates

来源：评论

学校读者我要写书评

暂无评论

No-wait Packet Scheduling for IEEE Time-sensitive Networks (TSN) 16

No-wait Packet Scheduling for IEEE Time-sensitive Networks (...

引用

24th international conference on Real-Time Networks and Systems (RTNS)

作者： Duerr, Frank Nayak, Naresh Ganesh Univ Stuttgart Inst Parallel & Distributed Syst Stuttgart Germany

ISBN: (纸本)9781450347877

The IEEE Time-sensitive networking (TSN) Task Group has recently standardized enhancements for IEEE 802.3 networks for enabling it to transport time-triggered traffic (aka scheduled traffic) providing them with stringent bounds on network delay and jitter while also transporting best-effort traffic. These enhancements primarily include dedicating one queue per port of the switch for scheduled traffic along with a programmable gating mechanism that dictates which of the queues are to be considered for transmission. While the IEEE 802.1Qbv standards define these mechanisms to handle scheduled traffic, it stops short of specifying algorithms to compute fine-grained link schedules for the streams of scheduled traffic. Further, the mechanisms in TSN require creation of so-called guard bands to isolate scheduled traffic from the best-effort traffic. These guard bands may potentially result in bandwidth wastage, and hence schedules with lower number of guard bands are preferred. In this paper, we introduce the No-wait Packet Scheduling Problem (NWPSP) for modelling the scheduling in IEEE Time-sensitive Networks and map it to the No-wait Job-shop Scheduling Problem (NW-JSP), a well-known problem from the field of operational research. In particular, we present a Tabu search algorithm for efficient computing of schedules and a schedule compression technique to reduce number of guard bands in schedule. Our evaluations show that our Tabu search algorithm can compute near-optimal schedules for over 1500 flows and the subsequent schedule compression reduces the number of guard bands on an average by 24 %.

关键词： Time-sensitive network TSN Real-time communication Job shop scheduling problem Tabu search IEEE 802.1Qbv

来源：评论

学校读者我要写书评

暂无评论

Applicability analysis of grid security mechanisms on cloud networking

Applicability analysis of grid security mechanisms on cloud ...

引用

international conference on Cloud and Service computing (CSC)

作者： Rasib Hassan Khan Miika Komu Tuomas Aura Department of Computer Science and Engineering School of Science and Technology Aalto University Finland

Grid computing has been around for quite a while. It facilitates utilization of distributed resources and has been extremely popular in its implementation. Grids have evolved enough to secure their operational architecture. On the other hand, cloud computing offers more recent alternative in distributed virtualization of resources, providing an on-demand architecture with a simple model for service charges. However, cloud computing is still struggling with different approaches to secure its operations. This paper discusses the security mechanisms in grid and cloud computing, and based on the current implementations in grid security, proposes a simple architecture for secured access control and policy enforcement system for cloud networks.

关键词： Cloud computing conferences

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 491 492 493 494 495 496 497 498 499 500 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：