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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

1,059 篇 电子文献
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 篇 department of co...
3 篇 ibm thomas j. wa...
3 篇 school of comput...
3 篇 brown univ dept ...
3 篇 dept. of cs geor...
3 篇 department of el...
3 篇 univ chicago il ...
3 篇 nppd tehran
3 篇 georgia institut...
3 篇 institute of com...
3 篇 natl univ def te...
3 篇 distributed syst...
2 篇 department of co...
2 篇 school of comput...
2 篇 univ nevada dept...
2 篇 department of co...
2 篇 the chinese univ...

作者

5 篇 yi pan
4 篇 uwe breitenbüche...
4 篇 frank leymann
3 篇 y. shibata
3 篇 jianhua sun
3 篇 dustdar schahram
3 篇 nong xiao
3 篇 hai jin
3 篇 takizawa hiroyuk...
3 篇 jiannong cao
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

语言

1,059 篇 英文

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

共 1059 条记录，以下是871-880 订阅

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

详细简洁

排序：

Supporting Social Networks with Agents

Supporting Social Networks with Agents

引用

IEEE international Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises (WET ICE)

作者： Federico Bergenti Agostino Poggi Michele Tomaiuolo Dipartimento di Matematica e Informatica Università degli Studi di Parma Parma Italy Dipartimento di Ingegneria dell'Informazione Università degli Studi di Parma Parma Italy

Multi-agent systems have been contributing to the development of both theory and practice of complex distributed systems. Social networks are probably the systems that exhibit the highest degree of similarity with multi-agent systems because members of a social network interact as agents do in a multi-agent system. Multi-agent system may be the best solution to enrich and facilitate the interaction and the collaboration among the members of a social network. After an introduction on the relationships between multi-agent systems and social networks, this paper describes Blogracy, a multi-agent system that supports the interaction among the members of a social network.

关键词： Social network services Multi-agent systems Peer-to-peer computing Blogs Containers conferences Collaboration

来源：评论

学校读者我要写书评

暂无评论

Process-Based Composition of Permissioned and Permissionless Blockchain Smart Contracts

Process-Based Composition of Permissioned and Permissionless...

引用

international conference on Enterprise distributed Object computing (EDOC)

作者： Ghareeb Falazi Michael Hahn Uwe Breitenbücher Frank Leymann Vladimir Yussupov Institute for Architecture of Application Systems University of Stuttgart Stuttgart University of Stuttgart Stuttgart Germany

Blockchains are distributed systems that facilitate the interaction of autonomous entities with limited mutual trust. Many of them support transactional applications known as smart contracts, which access and modify the shared world state. Permissionless blockchains are completely decentralized and do not require mutual trust between interacting peers, but at the expense of having low performance and limited data confidentiality capabilities. On the other hand, permissioned blockchains solve these issues, but sacrifice complete decentralization and involve more trust assumptions. Therefore, there is no single blockchain system suitable for all use-cases. However, this becomes a serious integration challenge for enterprises that need to interact with multiple permissioned and permissionless blockchains in the same context. To facilitate this, we propose an approach that enables composing smart contract functions of various permissioned and permissionless blockchain systems by providing the ability to invoke them directly from business process models using a new task type. To keep this task blockchain-agnostic, we designed a generic technique to identify smart contract functions, as well as a generic metric to describe the degree-of-confidence in the finality of blockchain transactions. Thereby, the proposed approach extends our previous work, BlockME, which provides business modeling extensions only suitable for interacting with permissionless blockchains. To validate the practical feasibility of our approach, we provide a detailed system architecture and a prototypical implementation supporting multiple blockchains.

关键词： Blockchain Smart contracts Bitcoin Task analysis

来源：评论

学校读者我要写书评

暂无评论

QoS-assured service composition in managed service overlay networks

QoS-assured service composition in managed service overlay n...

引用

international conference on distributed computing systems

作者： Xiaohui Gu K. Nahrstedt R.N. Chang C. Ward Department of Computer Science University of Illinois Urbana-Champaign USA Network Hosted Application Services IBM Thomas J. Watson Research Center USA

Many value-added and content delivery services are being offered via service level agreements (SLAs). These services can be interconnected to form a service overlay network (SON) over the Internet. Service composition in SON has emerged as a cost-effective approach to quickly creating new services. Previous research has addressed the reliability, adaptability, and compatibility issues for composed services. However little has been done to manage generic quality-of-service (QoS) provisioning for composed services, based on the SLA contracts of individual services. In this paper we present QUEST a QoS assUred composEable Service infrasTructure, to address the problem. QUEST framework provides: (1) initial service composition, which can compose a qualified service path under multiple QoS constraints (e.g., response time, availability). If multiple qualified service paths exist, QUEST chooses the best one according to the load balancing metric; and (2) dynamic service composition, which can dynamically recompose the service path to quickly recover from service outages and QoS violations. Different from the previous work, QUEST can simultaneously achieve QoS assurances and good load balancing in SON.

关键词： Intelligent networks Contracts Load management Web and internet services NASA Portals Peer to peer computing Quality of service Protocols Computer network management

来源：评论

学校读者我要写书评

暂无评论

Priority Heuristic in Mobile distributed Real Time Database Using Optimistic Concurrency Control

Priority Heuristic in Mobile Distributed Real Time Database ...

引用

international conference on Advanced computing and Communications (ADCOM)

作者： Prakash Kumar Singh Udai Shanker Department of Computer Science and Engineering M. M. M. University of Technology Gorakhpur India

ISBN: (纸本)9781538669129;9781538669112

Priority scheduling among running transactions is one of the most important issues in the design of mobile distributed real-time database systems (MDRTDBS). In MDRTDBS, to perform correct transaction scheduling, several priority heuristics with different concurrency control methods are used, so that, it could minimize transaction abort rate. Priority heuristic approaches deal with problem of assigning the priorities among transactions so that it could helpful with concurrency control (CC) mechanism to achieve typical time constraint. In recent few years, the performance of CC protocols of distributed real-time database systems (DRTDBS) have been examined using different priority heuristics methods. However, very few numbers of approaches have been proposed on priority heuristics for wireless environments. Hence, a new priority heuristic method based on deadline computed by considering write only operations has been proposed for wireless environments. It is improved priority heuristic approach which shows better results than earlier priority heuristics. In recent years, researchers have classified the transactions in two types called as Read only transactions (ROT) and Update transaction. This new priority heuristic for mobile environment considers ROT and update transactions separately. Further, a study has also been done to examine the impact of these priority heuristics as compared with number of locks and mixed method approaches.

关键词： Real-time systems Servers distributed databases Wireless communication Concurrency control Broadcasting

来源：评论

学校读者我要写书评

暂无评论

SONET: A SOcial NETwork Model for Privacy Monitoring and Ranking

SONET: A SOcial NETwork Model for Privacy Monitoring and Ran...

引用

international conference on distributed computing systems Workshop

作者： Raj Kumar Nepali Yong Wang College of Business and Information Systems Dakota State University Madison SD

Many concerns have been raised regarding the privacy issues in social media. The risks, as well as the security and privacy issues of social media in business, public policy, and legislation need to be evaluated and studied. However, there is lack of effective and practical way to quantify, measure, and evaluate privacy. In this paper, we propose a social network model, SONET, for privacy monitoring and ranking. The model provides a novel, effective, and practical way to quantify, measure, and evaluate privacy. Further, the proposed model is also flexible and built on real data from social media. The proposed privacy risk indicator, PIDX, can be calculated in real time and the value can be used for privacy monitoring and risk control.

关键词： Privacy Social network services Media SONET Security Communities Indexes

来源：评论

学校读者我要写书评

暂无评论

Collaborative defense as a pervasive service architectural insights and validation methodologies of a trial deployment

Collaborative defense as a pervasive service architectural i...

引用

2009 5th international conference on Testbeds and Research Infrastructures for the Development of Networks and Communities and workshops, TridentCom 2009

作者： Schooler, Eve M. Livadas, Carl Kim, Joohwan Gandhi, Prashant Passera, Pablo R. Chandrashekar, Jaideep Orrin, Steve Koyabe, Martin El-Moussa, Fadi Daa Dabibi, Gogobada Corporate Technology Group Intel Corporation 2200 Mission College Boulevard Santa Clara CA 95054 United States Centre for Information Security and Systems Research British Telecommunications plc BT Innovate Orion Building Adastral Park Martlesham Heath Ipswich IP5 3RE United Kingdom

ISBN: (纸本)9781424428472

Network defense is an elusive art. The arsenal to defend our devices from attack is constantly lagging behind the latest methods used by attackers to break into them and subsequently into our networks. To counteract this trend, we developed a distributed, scalable approach that harnesses the power of collaborative end-host detectors or sensors. Simulation results reveal order of magnitude improvements over stand-alone detectors in the accuracy of detection (fewer false alarms) and in the quality of detection (the ability to capture stealthy anomalies that would otherwise go undetected). Although these results arise out of a proof of concept in the arena of botnet detection in an Enterprise network, they have broader applicability to the area of network self-manageability of pervasive computing devices. To test the efficacy of these ideas further, Intel Corporation partnered with British Telecommunications plc to launch a trial deployment. In this paper, we report on results and insights gleaned from the development of a testbed infrastructure and phased experiments;(1) the design of a re-usable measurementinference architecture into which 3rd party sensor developers can integrate a wide variety of "anomaly detection" algorithms to derive the same correlation-related performance benefits;(2) the development of a series of validation methodologies necessitated by the lack of mature tools and approaches to attest to the security of distributed networked systems;(3) the critical role of learning and adaptation algorithms to calibrate a fullydistributed architecture of varied devices in varied contexts, and (4) the utility of large-scale data collections to assess what's normal behavior for Enterprise end-host background traffic as well as malware command-and-control protocols. Finally, we propose Collaborative Defense as a blueprint for emergent collaborative systems and its measurement-everywhere approach as the adaptive underpinnings needed for pervasive services.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

Towards Priority-Flexible Task Mapping for Heterogeneous Multi-core NUMA systems 23rd

Towards Priority-Flexible Task Mapping for Heterogeneous Mu...

引用

23rd international conference on Parallel and distributed computing, Applications, and Technologies, PDCAT 2022

作者： Jin, Yifan Agung, Mulya Takahashi, Keichi Shimomura, Yoichi Takizawa, Hiroyuki Cyberscience Center Tohoku University Sendai Japan Institute of Genetics and Cancer University of Edinburgh Edinburgh United Kingdom

ISBN: (纸本)9783031299261

With the rapid development of heterogeneous multi-core processors, a new High Performance computing (HPC) system architecture combining the heterogeneous multi-core architecture and NUMA architecture will emerge in the future. However, existing task mapping methods are ineffective on such systems because they do not simultaneously consider multiple performance factors caused by the heterogeneity in memory access and core performance. In a parallel application, one factor can affect performance more than another depending on the communication and computation load imbalances among parallel tasks. In this case, a task mapping method must prioritize one factor over another when calculating the mapping. To solve this problem, this paper proposes a new mapping method with two task mapping priority options: the memory-aware priority option (MPO) and the heterogeneity-aware priority option (HPO). A priority option switching mechanism (POSM) selects the appropriate priority option for the combination of a system and an application by analyzing their characteristics. Compared with other methods that do not switch mapping priorities, the proposed method achieves overall performance improvement when dealing with a set of applications with different characteristics. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Load Distribution Fairness in P2P Data Management systems

Load Distribution Fairness in P2P Data Management Systems

引用

international conference on Data Engineering

作者： Theoni Pitoura Peter Triantafillou Research Academic Computer Technology Institute and Computer Engineering and Informatics Department University of Patras Greece

ISBN: (纸本)1424408024

We address the issue of measuring storage, or query load distribution fairness in peer-to-peer data management systems. Existing metrics may look promising from the point of view of specific peers, while in reality being far from optimal from a global perspective. Thus, first we define the requirements and study the appropriateness of various statistical metrics for measuring load distribution fairness towards these requirements. The metric proposed as most appropriate is the Gini coefficient (G). Second, we develop novel distributed sampling algorithms to compute G on-line, with high precision, efficiently, and scalably. Third, we show how G can readily be utilized on-line by higher-level algorithms which can now know when to best intervene to correct load imbalances. Our analysis and experiments testify for the efficiency and accuracy of these algorithms, permitting the online use of a rich and reliable metric, conveying a global perspective of the distribution.

关键词： Peer to peer computing distributed computing Load management Sampling methods Technology management Engineering management Testing Data engineering Informatics Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A Flexible and Portable Large-Scale DGEMM Library for Linpack on Next-Generation Multi-GPU systems

A Flexible and Portable Large-Scale DGEMM Library for Linpac...

引用

Euromicro conference on Parallel, distributed and Network-Based Processing

作者： David Rohr Volker Lindenstruth Frankfurt Institute for Advanced Studies Frankfurt am Main Germany

In recent years, high performance computing has benefitted greatly from special accelerator cards such as GPUs. Matrix multiplication performed by the BLAS function DGEMM is one of the prime examples where such accelerators excel. DGEMM is the computational hotspot of many tasks, among them the Linpack benchmark. Current GPUs achieve more than 1 TFLOPS real performance in this task. Being connected via PCI Express, one can easily install multiple GPUs in a single compute node. This enables the construction of multi-TFLOPS systems out of off-the-shelf components. At such high performance, it is often complicated to feed the GPUs with sufficient data to run at full performance. In this paper we first analyze the scalability of our DGEMM implementation for multiple fast GPUs. Then we suggest a new scheme optimized for this situation and we present an implementation.

关键词： Graphics processing units Kernel Bandwidth Engines Benchmark testing Memory management Next generation networking

来源：评论

学校读者我要写书评

暂无评论

Parallel I/O Optimizations for Scalable Deep Learning

Parallel I/O Optimizations for Scalable Deep Learning

引用

international conference on Parallel and distributed systems (ICPADS)

作者： Sarunya Pumma Min Si Wu-chun Feng Pavan Balaji Virginia Tech USA Argonne National Laboratory USA

ISBN: (纸本)9781538632086

As deep learning systems continue to grow in importance, researchers have been analyzing approaches to make such systems efficient and scalable on high-performance computing platforms. As computational parallelism increases, however, data I/O becomes the major bottleneck limiting the overall system scalability. In this paper, we continue our efforts to improve LMDB, the I/O subsystem of the Caffe deep learning framework. In a previous paper we presented LMDBIO---an optimized I/O plugin for Caffe that takes into account the data access pattern of Caffe in order to vastly improve I/O performance. Nevertheless, LMDBIO's optimizations, which we henceforth call LMM (localized mmap), are limited to intranode performance, and these optimizations do little to minimize the I/O inefficiencies in distributed-memory environments. In this paper, we propose LMDBIO-DM, an enhanced version of LMDBIO-LMM that optimizes the I/O access of Caffe in distributed-memory environments. We present several sophisticated data I/O techniques that allow for significant improvement in such environments. Our experimental results show that LMDBIO-DM can improve the overall execution time of Caffe by more than 30-fold compared with LMDB and by 2-fold compared with LMDBIO-LMM.

关键词： Training Machine learning Optimization Parallel processing Scalability distributed databases

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共106页 << < 84 85 86 87 88 89 90 91 92 93 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：