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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

534 篇 会议
175 篇 期刊文献
27 册 图书

馆藏范围

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

日期分布

学科分类号

418 篇 工学
- 316 篇 计算机科学与技术...
- 230 篇 软件工程
- 114 篇 信息与通信工程
- 58 篇 控制科学与工程
- 51 篇 电子科学与技术（可...
- 31 篇 电气工程
- 29 篇 生物工程
- 22 篇 动力工程及工程热...
- 21 篇 机械工程
- 19 篇 建筑学
- 18 篇 仪器科学与技术
- 12 篇 土木工程
- 12 篇 交通运输工程
- 12 篇 安全科学与工程
- 11 篇 化学工程与技术
- 10 篇 生物医学工程（可授...
- 9 篇 力学（可授工学、理...
155 篇 理学
- 91 篇 数学
- 30 篇 系统科学
- 29 篇 生物学
- 24 篇 物理学
- 20 篇 统计学（可授理学、...
- 13 篇 化学
122 篇 管理学
- 75 篇 管理科学与工程(可...
- 58 篇 图书情报与档案管...
- 35 篇 工商管理
17 篇 法学
- 12 篇 社会学
14 篇 医学
- 14 篇 临床医学
- 11 篇 基础医学(可授医学...
11 篇 经济学
- 11 篇 应用经济学
5 篇 教育学
5 篇 农学
2 篇 军事学
1 篇 艺术学

主题

53 篇 computer science
26 篇 routing
26 篇 protocols
24 篇 bandwidth
23 篇 quality of servi...
22 篇 monitoring
20 篇 telecommunicatio...
19 篇 application soft...
19 篇 hardware
18 篇 computer archite...
18 篇 throughput
18 篇 real time system...
18 篇 computational mo...
18 篇 distributed comp...
17 篇 runtime
17 篇 software enginee...
15 篇 network topology
15 篇 resource managem...
15 篇 wireless sensor ...
15 篇 vehicles

机构

18 篇 department of di...
15 篇 institute of par...
8 篇 key laboratory o...
8 篇 distributed syst...
7 篇 chair for embedd...
7 篇 school of comput...
7 篇 department of co...
7 篇 department of di...
7 篇 school of comput...
6 篇 microelectronics...
6 篇 department of co...
5 篇 school of electr...
5 篇 institute of dis...
5 篇 distributed and ...
5 篇 embedded systems...
5 篇 distributed embe...
5 篇 swedish institut...
5 篇 department of di...
4 篇 institute of com...
4 篇 center for appli...

作者

16 篇 rajkumar buyya
16 篇 dustdar schahram
15 篇 chen haibo
11 篇 m. menth
11 篇 michael menth
10 篇 jörg henkel
10 篇 könig-ries birgi...
10 篇 muhammad shafiqu...
9 篇 babalou samira
9 篇 menth michael
9 篇 janakiram d.
9 篇 bastian blywis
9 篇 felix juraschek
8 篇 jeon gwanggil
8 篇 frank slomka
8 篇 juraschek felix
8 篇 özdenizci ozan
7 篇 blywis bastian
7 篇 sri parameswaran
7 篇 zang binyu

语言

710 篇 英文
13 篇 中文
10 篇 其他
3 篇 德文
1 篇 葡萄牙文

检索条件"机构=Institute of Computer Science-Distributed Embedded Systems"

共 736 条记录，以下是171-180 订阅

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

详细简洁

排序：

Scalable adaptive NUMA-aware Lock combining local locking and remote locking for efficient concurrency 16

Scalable adaptive NUMA-aware Lock combining local locking an...

引用

21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2016

作者： Zhang, Mingzhe Lau, Francis C.M. Wang, Cho-Li Cheng, Luwei Chen, Haibo Dept. Computer Science University of Hong Kong Hong Kong Facebook United States Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China

ISBN: (纸本)9781450340922

Scalable locking is a key building block for scalable multi-threaded software. Its performance is especially critical in multi-socket, multi-core machines with non-uniform memory access (NUMA). Previous schemes such as local locking and remote locking only perform well under a certain level of contention, and often require non-trivial tuning for a particular configuration. Besides, for large NUMA systems, because of unmanaged lock server's nomination, current distance-first NUMA policies cannot perform satisfactorily. In this work, we propose SANL, a locking scheme that can de-liver high performance under various contention levels by adap-tively switching between the local and the remote lock scheme. Furthermore, we introduce a new NUMA policy for the remote lock that jointly considers node distances and server utilization when choosing lock servers. A comparison with seven represen-tative locking schemes shows that SANL outperforms the others in most contention situations. In one group test, SANL is 3.7 times faster than RCL lock and 17 times faster than POSIX mutex. © 2016 ACM.

关键词： Locks (fasteners)

来源：评论

学校读者我要写书评

暂无评论

A P2P-based framework for distributed Network Management

A P2P-based framework for Distributed Network Management

引用

2nd International Workshop of the EURO-NGI Network of Excellence

作者： Binzenhöfer, Andreas Tutschku, Kurt Auf Dem Graben, Björn Fiedler, Markus Arlos, Patrik Department of Distributed Systems Institute of Computer Science University of Würzburg Am Hubland 97074 Würzburg Germany Dept. of Telecommunication Systems School of Engineering Blekinge Institute of Technology 371 79 Karlskrona Sweden

ISBN: (纸本)3540340254

In this paper we present a novel framework supporting distributed network management using a self-organizing peer-to-peer over-lay network. The overlay consists of several distributed Network Agents which can perform distributed tests and distributed monitoring for fault and performance management. In that way, the concept is able to over-come disadvantages that come along with a central management unit, like lack of scalability and reliability. So far, little attention has been payed to the quality of service experienced by the end user. Our self-organizing management overlay provides a reliable and scalable basis for distributed tests that incorporate the end user. The use of a distributed, self-organizing software will also reduce capital and operational expenditures of the operator since fewer entities have to be installed and operated. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

Trends in distributed systems: Towards a Universal Service Market 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Claudia Linnhoff-Popien Heinz-Gerd Hegering

ISBN: (数字)9783540452720

ISBN: (纸本)9783540410249

USM 2000 is the third event in a series of international IFIP/GI conferences on Trends in distributed systems. Following the venues in Aachen, Germany (1996) and Hamburg, Germany (1998), this event in Munich considers the trend towards a Universal Service Market – USM 2000. The trend towards a universal service market has many origins, e.g., the integration of telecom and data communications, the deregulation e?orts with respect to telco markets, the globalization of information, the virtualization of companies, the requirement of a short time-to-market, the advances in network technologies, the increasing acceptance of e-commerce, and the increase in - bility. This leads to new business-to-business (B2B) and business-to-customer (B2C) environments that o?er both challenges and opportunities to enterprises and end-users. There is the need for ubiquitous services, trading, brokering and information management, for service market and business models, and for ?e- ble infrastructures for dynamic collaboration. Researchers, service vendors, and users must cooperate to set up the app- priate requirements for a universal service market and to ?nd solutions with respect to supporting platforms, middleware, distributed applications, and m- agement. The basis for these solution is a common understanding of means for de?ning, creating, implementing, and deploying the service market. Then, s- vice market makers, service aggregators, service auctioneers, ISP, ASP, BPO, and customers can freely interact in a dynamic, open, and universal market place.

关键词： computer Communication Networks Popular computer science Software Engineering/Programming and Operating systems Software Engineering Information systems Applications (incl. Internet) Management of Computing and Information systems

来源：评论

学校读者我要写书评

暂无评论

Patterns for measuring performance-related QoS properties in service-oriented systems 10

Patterns for measuring performance-related QoS properties in...

引用

17th Conference on Pattern Languages of Programs, PLoP 2010

作者： Oberortner, Ernst Zdun, Uwe Dustdar, Schahram Distributed Systems Group Information Systems Institute Vienna University of Technology Austria Software Architecture Faculty of Computer Science Vienna University Austria Argentinierstrasse 8/184-1 1040 Vienna Austria

ISBN: (纸本)9781450301077

In service-oriented systems, clients can access services via a network. Service level agreements (SLA) can exist, which specify - among other things - performance-related Quality of Service (QoS) properties between the client and the server, such as round-trip time, processing time, or availability. For a service provider serious financial consequences or other penalties can follow in case of not fulfilling the SLAs. The service consumer wants to evaluate that the provider complies with the guaranteed SLAs. Designing and developing a QoS-aware service-oriented system means facing many design challenges, such as where and how to measure the performance-related QoS properties. This paper presents design practices and patterns for measuring such QoS properties by extending and utilizing existing patterns. The focus of the patterns lies on the QoS measuring impact on the client's or service's performance, the extend of separation of concerns, the property of reusability, and the preciseness of the measured QoS properties. The patterns help to build efficient solutions to measure performance-related QoS properties in a service-oriented system.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

$$\mathcal {C}$$ o$$\mathcal {M}$$ erger: A Customizable Online Tool for Building a Consistent Quality-Assured Merged Ontology 17th

$$\mathcal {C}$$ o$$\mathcal {M}$$ erger: A Customizable Onl...

引用

17th Extended Semantic Web Conference, ESWC 2020

作者： Babalou, Samira Grygorova, Elena König-Ries, Birgitta Heinz-Nixdorf Chair for Distributed Information Systems Institute for Computer Science Friedrich Schiller University Jena Jena Germany Michael-Stifel-Center for Data-Driven and Simulation Science Jena Germany

ISBN: (纸本)9783030623265

Merging ontologies enables the reusability and interoperability of existing knowledge. With growing numbers of relevant ontologies in any given domain, there is a strong need for an automatic, scalable multi-ontology merging tool. We introduce erger, which covers four key aspects of the ontology merging field: compatibility checking of the user-selected Generic Merge Requirements (GMR)s, merging multiple ontologies with adjustable GMRs, quality assessment of the merged ontology, and inconsistency handling of the *** is freely accessible through a live portal and the source code is publicly distributed. © 2020, Springer Nature Switzerland AG.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Achieving efficient realization of kalman filter on CGRA through algorithm-architecture co-design 14th

Achieving efficient realization of kalman filter on CGRA thr...

引用

14th International Symposium on Applied Reconfigurable Computing, ARC 2018

作者： Merchant, Farhad Vatwani, Tarun Chattopadhyay, Anupam Raha, Soumyendu Nandy, S.K. Narayan, Ranjani Institute for Communication Technologies and Embedded Systems RWTH Aachen University Aachen Germany Hardware and Embedded Systems Lab Nanyang Technological University Singapore Singapore Scientific Computation Laboratory Indian Institute of Science Bangalore India Computer Aided Design Laboratory Indian Institute of Science Bangalore India Morphing Machines Pvt. Ltd. Bangalore India

ISBN: (纸本)9783319788890

In this paper, we present efficient realization of Kalman Filter (KF) that can achieve up to 65% of the theoretical peak performance of underlying architecture platform. KF is realized using Modified Faddeeva Algorithm (MFA) as a basic building block due to its versatility and REDEFINE Coarse Grained Reconfigurable Architecture (CGRA) is used as a platform for experiments since REDEFINE is capable of supporting realization of a set algorithmic compute structures at run-time on a Reconfigurable Data-path (RDP). We perform several hardware and software based optimizations in the realization of KF to achieve 116% improvement in terms of Gflops over the first realization of KF. Overall, with the presented approach for KF, 4-105x performance improvement in terms of Gflops/watt over several academically and commercially available realizations of KF is attained. In REDEFINE, we show that our implementation is scalable and the performance attained is commensurate with the underlying hardware resources. © Springer International Publishing AG, part of Springer Nature 2018.

关键词： Kalman filters

来源：评论

学校读者我要写书评

暂无评论

RTnet: a distributed real-time protocol for broadcast-capable networks

RTnet: a distributed real-time protocol for broadcast-capabl...

引用

International Conference on Autonomic and Autonomous systems (ICAS)

作者： F. Hanssen P.G. Jansen H. Scholten S. Mullender Distributed and Embedded Systems Group Faculty of Electrical Engineering Mathematics and Computer Science University of Twente Enschede Netherlands

RTnet is a distributed real-time network protocol, to be used on fully-connected local area networks with a broadcast capability. It supports on-the-fly addition and removal of network nodes, resource-lavish and resource-lean devices, streaming real-time and regular non-realtime traffic. It allows the use of standard real-time scheduling paradigms to control network traffic, allows dynamic scheduling and is flexible in stream handling. The design is presented, together with measurement results of an experiment with an implementation on top of Ethernet

关键词： Protocols Broadcasting Ethernet networks Communication system traffic control Dynamic scheduling Hardware Bandwidth Telecommunication traffic embedded system Mathematics

来源：评论

学校读者我要写书评

暂无评论

Computation and communication efficient graph processing with distributed immutable view 14

Computation and communication efficient graph processing wit...

引用

23rd ACM Symposium on High-Performance Parallel and distributed Computing, HPDC 2014

作者： Chen, Rong Ding, Xin Wang, Peng Chen, Haibo Zang, Binyu Guan, Haibing Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science Shanghai Jiao Tong University China

ISBN: (纸本)9781450327480

Cyclops is a new vertex-oriented graph-parallel framework for writing distributed graph analytics. Unlike existing distributed graph computation models, Cyclops retains simplicity and computation-efficiency by synchronously computing over a distributed immutable view, which grants a vertex with read-only access to all its neighboring vertices. The view is provided via readonly replication of vertices for edges spanning machines during a graph cut. Cyclops follows a centralized computation model by assigning a master vertex to update and propagate the value to its replicas unidirectionally in each iteration, which can significantly reduce messages and avoid contention on replicas. Being aware of the pervasively available multicore-based clusters, Cyclops is further extended with a hierarchical processing model, which aggregates messages and replicas in a single multicore machine and transparently decomposes each worker into multiple threads ondemand for different stages of computation. We have implemented Cyclops based on an open-source Pregel clone called Hama. Our evaluation using a set of graph algorithms on an in-house multicore cluster shows that Cyclops outperforms Hama from 2.06X to 8.69X and 5.95X to 23.04X using hash-based and Metis partition algorithms accordingly, due to the elimination of contention on messages and hierarchical optimization for the multicore-based clusters. Cyclops (written in Java) also has comparable performance with PowerGraph (written in C++) despite the language difference, due to the significantly lower number of messages and avoided contention. Copyright © 2014 ACM.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Scheduling of early quantum tasks

Scheduling of early quantum tasks

引用

Euromicro Conference on Real-Time systems

作者： P.G. Jansen F. Hanssen M.E. Lijding Distributed and Embedded Systems group Faculty of Electrical Engineering Mathematics and Computer Science University of Twente Enschede Netherlands

An Early Quantum Task (EQT) is a Quantum EDF task that has shrunk its first period into one quantum time slot. Its purpose is to be executed as soon as possible, without causing deadline overflow of other tasks. We derive the conditions under which an EQT can be admitted and can have an immediate start. The advantage of scheduling EQTs is shown by its use in a buffered multimedia server. The EQT is associated with a multimedia stream and it will use its first invocation to fill the buffer, such that a client can start receiving data immediately.

关键词： Streaming media Quantum computing Processor scheduling Filling Admission control embedded system Mathematics computer science Real time systems Multimedia systems

来源：评论

学校读者我要写书评

暂无评论

PRIPRO:Solution for user profile control and management based on data privacy 15

PRIPRO:Solution for user profile control and management base...

引用

15th Iberian Conference on Information systems and Technologies, CISTI 2020

作者： Cesconetto, Jonas Silva, Luis A. Valderi Leithardt, R.Q. Caceres, Maria N. Selva, Luis A. Garcia, Nuno M. Valderi Leithardt, R.Q. University of Vale Do Itajaí Laboratory of Embedded and Distributed Systems Brazil88302-901 Brazil University of Salamanca Department of Computer Science 37007 Spain Universidade da Beira Interior Departamento de Informática Portugal6201-001 Portugal

ISBN: (纸本)9789895465903

Intelligent environments work collaboratively, bringing more comfort to human beings. The intelligence of these environments comes from technological advances in sensors and communication. IoT is the model developed that allows a wide and intelligent communication between devices. Hardware reduction of IoT devices results in vulnerabilities. Thus, there are numerous concerns regarding the security of user information, since mobile devices are easily trackable over the Internet. Care must be taken regarding the information in user profiles. Mobile devices are protected by a permission-based mechanism, which limits third-party applications from accessing sensitive device resources. In this context, this work aims to present a proposal for materialization of application for the evolution of user profiles in intelligent environments. Having as parameters the parameters presented in the proposed taxonomy. The proposed solution is the development of two applications, one for Android devices, responsible for allowing or blocking some features of the device. And another in Cloud, responsible for imposing the parameters and privacy criteria, formalizing the profile control module (PRIPRO - PRIvacy PROfiles). © 2020 AISTI.

关键词： Taxonomies

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共74页 << < 14 15 16 17 18 19 20 21 22 23 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：