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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

349 篇 会议
236 篇 期刊文献
9 册 图书

馆藏范围

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

日期分布

学科分类号

373 篇 工学
- 265 篇 计算机科学与技术...
- 203 篇 软件工程
- 85 篇 信息与通信工程
- 77 篇 控制科学与工程
- 51 篇 电气工程
- 37 篇 机械工程
- 31 篇 电子科学与技术（可...
- 26 篇 生物工程
- 24 篇 动力工程及工程热...
- 13 篇 航空宇航科学与技...
- 12 篇 安全科学与工程
- 11 篇 化学工程与技术
- 10 篇 交通运输工程
- 9 篇 生物医学工程（可授...
- 8 篇 仪器科学与技术
- 8 篇 建筑学
- 8 篇 环境科学与工程（可...
- 7 篇 光学工程
192 篇 理学
- 124 篇 数学
- 57 篇 系统科学
- 34 篇 统计学（可授理学、...
- 29 篇 生物学
- 20 篇 物理学
- 11 篇 化学
117 篇 管理学
- 84 篇 管理科学与工程(可...
- 50 篇 工商管理
- 38 篇 图书情报与档案管...
21 篇 法学
- 17 篇 社会学
11 篇 经济学
- 11 篇 应用经济学
10 篇 教育学
- 10 篇 教育学
10 篇 农学
8 篇 医学
2 篇 文学
1 篇 军事学

主题

33 篇 distributed comp...
32 篇 computer science
30 篇 laboratories
20 篇 cloud computing
16 篇 computer archite...
13 篇 algorithm design...
13 篇 computer network...
12 篇 application soft...
12 篇 machine learning
12 篇 protocols
11 篇 grid computing
11 篇 resource managem...
11 篇 educational inst...
11 篇 quality of servi...
11 篇 data mining
11 篇 delay
10 篇 routing
10 篇 software enginee...
10 篇 monitoring
10 篇 artificial intel...

机构

10 篇 school of comput...
9 篇 state key labora...
9 篇 shandong provinc...
9 篇 school of cyber ...
9 篇 science and tech...
8 篇 college of compu...
8 篇 national laborat...
7 篇 department of co...
7 篇 state key labora...
6 篇 beijing key labo...
6 篇 intelligent dist...
6 篇 singapore univer...
6 篇 state key labora...
6 篇 department of in...
6 篇 division of deci...
6 篇 school of inform...
5 篇 hubei key labora...
5 篇 school of electr...
5 篇 department of co...
5 篇 the state key la...

作者

14 篇 johansson karl h...
13 篇 yi xinlei
13 篇 yang tao
11 篇 rajkumar buyya
11 篇 buyya rajkumar
10 篇 ismail leila
10 篇 materwala huned
9 篇 xiong zehui
8 篇 dustdar schahram
8 篇 zhigang luo
8 篇 xuhui huang
8 篇 junping du
8 篇 duan zhisheng
8 篇 chai tianyou
8 篇 jin hai
7 篇 niyato dusit
7 篇 naiyang guan
7 篇 shi ling
7 篇 yingmin jia
6 篇 hangjun zhou

语言

534 篇 英文
54 篇 其他
6 篇 中文

检索条件"机构=Computer Networh and Distributed Systems Laboratory Department of Computer Science and Technology"

共 594 条记录，以下是461-470 订阅

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

详细简洁

排序：

Towards a group-based RBAC model and decentralized user-role administration

Towards a group-based RBAC model and decentralized user-role...

引用

28th International Conference on distributed Computing systems Workshops, ICDCS Workshops 2008

作者： Li, Qi Xu, Mingwei Zhang, Xinwen Department of Computer Science Tsinghua University Beijing 100084 China Tsinghua National Laboratory for Information Science and Technology Beijing 100084 China Samsung Information Systems America San Jose CA 95134 United States

ISBN: (纸本)9780769531731

Role-based Access Control (RBAC) has been widely deployed in many distributed systems in recent years. However, in many large-scale enterprise environments, it is difficult to manage RBAC because of the huge number of users and roles, and complex interrelationships between them. Moreover, with the development of information and communication technologies, many temporal and ad hoc collaborations between groups and departments are emerging, which require dynamic user-role and permission-role assignments. In these scenarios it is infeasible, if not impossible, for few security officers to administrate the assignment for various applications. In this paper, we propose a novel RBAC model for decentralized and distributed systems. As one of the main contributions, we also propose a decentralized administration model to address the management issues in traditional RBAC systems, Our model can be used for group-based applications with dynamic assignments where typically local (group-level) administrators take charge of the dynamic assignments. In this way, many administrative tasks for different applications can spread over many different local administrators, and a fine-grained administration model of RBAC based on the local administration policies is realized. As a proof-of-concept system, we implemented a secure Spread prototype based on our proposed model to show the feasibility in the real applications. © 2008 IEEE.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

Advanced QoS methods for Grid workflows based on meta-negotiations and SLA-mappings

Advanced QoS methods for Grid workflows based on meta-negoti...

引用

Workshop on Workflows in Support of Large-Scale science, WORKS

作者： Ivona Brandic Dejan Music Schahram Dustdar Srikumar Venugopal Rajkumar Buyya Institute of Information Systems University of Technology Vienna Austria Grid Computing and Distributed System (GRIDS) Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

In novel market-oriented resource sharing models, resource consumers pay for the resource usage and expect that non-functional requirements for the application execution, termed as quality of service (QoS), are satisfied. QoS is negotiated between two parties following the specific negotiation protocols and is recorded using service level agreements (SLAs). However, most of the existing work assumes that the communication partners know about the SLA negotiation protocols and about the SLA templates before entering the negotiation. However, this is a contradictory assumption, if we consider computational grids and novel, commercially oriented computing clouds where consumers and providers meet each other dynamically. In this paper, we present novel meta-negotiation and SLA-mapping solutions for grid workflows bridging the gap between current QoS models and grid workflows, one of the most successful grid programming paradigms. We illustrate the open research issues with a real world case study. Thereafter, we present document models for the specification of meta-negotiations and SLA-mappings. We discuss the architecture for the management of meta-negotiations and SLA-mappings as well as integration of the architecture into a grid workflow management framework.

关键词： Quality of service Protocols Grid computing Cloud computing Resource management Information systems Laboratories computer science Software engineering Application software

来源：评论

学校读者我要写书评

暂无评论

Merge-by-Wire: Algorithms and System Support

Merge-by-Wire: Algorithms and System Support

引用

Real-Time systems Symposium (RTSS)

作者： Vipul Shingde Gurulingesh Raravi Ashish Gudhe Prakhar Goyal Krithi Ramamritham Embedded Real-Time Systems Laboratory Department of Computer Science and Engineering Indian Institute of Technology Bombay

Automakers are trying to make vehicles more intelligent and safe by embedding processors which can be used to implement ldquoby-wirerdquo applications for taking smart decisions on the road or assisting the driver in doing the same. Given this proliferation, there is a need to minimize the computing power required without affecting the performance and safety of the applications. The latter is especially important since these by-wire applications are distributed and real-time in nature and involve deadline bound computations on critical data gathered from the environment. These applications have stringent requirements on the freshness of data items and completion time of the tasks. Our work studies one such safety-related automotive application namely, automatic merge control (AMC) which ensures safe vehicle maneuver in the region where two or more roads *** our contributions, we (i) propose two merge algorithms for amc: head of the lane (HoL) and all feasible sequences (AFS) (ii) demonstrate how DSRC-based wireless communication protocol can be leveraged for the development of AMC (iii) present a real-time approach towards designing AMC by integrating mode-change and real-time repository concepts for reducing the processing power requirements and (iv) provide a scheduling strategy to meet AMC taskspsila timing requirements. Simulations and implementation on robotic vehicular platforms demonstrate the advantages of using our approach for constructing merge-by-wire systems.

关键词： Intelligent vehicles Road vehicles Vehicle safety Vehicle driving distributed computing Automotive applications Automatic control Communication system control Scheduling algorithm Wireless communication

来源：评论

学校读者我要写书评

暂无评论

A Generative Probabilistic Model for Multi-label Classification

A Generative Probabilistic Model for Multi-label Classificat...

引用

IEEE International Conference on Data Mining (ICDM)

作者： Hongning Wang Minlie Huang Xiaoyan Zhu State Key Laboratory of Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and Technology Department of Computer Science and Technology Tsinghua University Beijing China

Traditional discriminative classification method makes little attempt to reveal the probabilistic structure and the correlation within both input and output spaces. In the scenario of multi-label classification, most of the classifiers simply assume the predefined classes are independently distributed, which would definitely hinder the classification performance when there are intrinsic correlations between the classes. In this article, we propose a generative probabilistic model, the Correlated Labeling Model (CoL Model), to formulate the correlation between different classes. The CoL model is presented to capture the correlation between classes and the underlying structures via the latent random variables in a supervised manner. We develop a variational procedure to approximate the posterior distribution and employ the EM algorithm for the empirical Bayes parameter estimation. In our evaluations, the proposed model achieved promising results on various data sets.

关键词： Space technology Laboratories Text categorization Data mining Intelligent systems Intelligent structures Information science computer science Labeling Random variables

来源：评论

学校读者我要写书评

暂无评论

Flexible Routing in Grouped DHTs

Flexible Routing in Grouped DHTs

引用

International Conference on Peer-to-Peer Computing

作者： Yiming Zhang Dongsheng Li Lei Chen Xicheng Lu National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China Department of Computer Science Hong Kong University of Science and Technology Hong Kong China

In most DHTs proposed so far, all nodes are assumed to be homogeneous, and all messages are routed using a common algorithm. In practice, however, nodes in large-scale systems might be heterogeneous with respect to their capabilities, reputations, affiliations of administrative domains, and so on, which consequently makes it preferable to distinguish the heterogeneity of participant nodes. To achieve this, in this paper we present grouped tapestry (GTap), a novel tapestry-based DHT that supports organizing nodes into groups and allows flexible DHT routing. The effectiveness of our proposals is demonstrated through theoretical analysis and extensive simulations.

关键词： Routing Fingers Peer to peer computing Maintenance engineering Security Availability Data structures

来源：评论

学校读者我要写书评

暂无评论

Jeeva: Enterprise Grid Enabled Web Portal for Protein Secondary Structure Prediction

Jeeva: Enterprise Grid Enabled Web Portal for Protein Second...

引用

International Conference on Advanced Computing and Communications (ADCOM)

作者： Chao Jin Jayavardhana Gubbi Rajkumar Buyya Marimuthu Palaniswami Grid Computing and Distributed Systems (GRIDS) Laboratory Department of Computer Science and Software Engineering University of Melbourne Melbourne VIC Australia Department of Electrical and Electronic Engineering University of Melbourne Melbourne VIC Australia

This paper presents a grid portal for protein secondary structure prediction developed by using services of Aneka, a .NET-based enterprise grid technology. The portal is used by research scientists to discover new prediction structures in a parallel manner. An SVM (support vector machine)-based prediction algorithm is used with 64 sample protein sequences as a case study to demonstrate the potential of enterprise grids.

关键词： Portals Protein engineering Grid computing Prediction algorithms Support vector machines distributed computing Environmental management Chaos computer science History

来源：评论

学校读者我要写书评

暂无评论

A concurrency control protocol for parallel B-tree structures without latch-coupling for explosively growing digital content 08

A concurrency control protocol for parallel B-tree structure...

引用

11th International Conference on Extending Database technology, EDBT 2008

作者： Yoshihara, Tomohiro Kobayashi, Dai Yokota, Haruo Department of Computer Science Tokyo Institute of Technology 2-12-1 Ookayama Meguro-ku Tokyo 152-8552 Japan Global Scientific Information and Computing Center Tokyo Institute of Technology 2-12-1 Ookayama Meguro-ku Tokyo 152-8550 Japan Systems Development Laboratory Hitachi Ltd. JSPS

ISBN: (纸本)9781595939265

While shared-nothing parallel infrastructures provide fast processing of explosively growing digital content, managing data efficiently across multiple nodes is important. The value-range partitioning method with parallel B-tree structures in a shared-nothing environment is an efficient approach for handling large amounts of data. To handle large amounts of data, it is also important to provide an efficient concurrency control protocol for the parallel B-tree. Many studies have proposed concurrency control protocols for B-trees, which use latch-coupling. None of these studies has considered that latch-coupling contains a performance bottleneck of sending of messages between processing elements (PEs) in distributed environments because latch-coupling is efficient for a B-tree on a single machine. The only protocol without latch-coupling is the B-link algorithm, but it is difficult to use the B-link algorithm directly on an entire parallel B-tree structure because it is necessary to guarantee the consistency of the side pointers. We propose a new concurrency control protocol named LCFB that requires no latch-coupling in optimistic processes. LCFB reduces the amount of communication between PEs during a B-tree traversal. To detect access path errors in the LCFB protocol caused by removal of latch-coupling, we assign boundary values to each index page. Because a page split may cause page deletion in a Fat-Btree, we also propose an effective method for handling page deletions without latch-coupling. We then combine LCFB with the B-link algorithm within each PE to reduce the cost of Structure Modification Operations (SMOs) in a PE, as a solution to the difficulty of consistency management for the side pointers in a parallel B-tree structure. To compare the performance of the proposed protocol with conventional protocols MARK-OPT, INC-OPT, and ARIES/IM, we implemented them on an autonomous disk system with a Fat-Btree structure. Experimental results in various environments

关键词： Network protocols

来源：评论

学校读者我要写书评

暂无评论

distributed ship relative positioning algorithm in the MITS

Distributed ship relative positioning algorithm in the MITS

引用

World Congress on Intelligent Control and Automation (WCICA)

作者： Quanbo Ge Fuchun Sun Chenglin Wen State Key Laboratory of Intelligent Technology and Systems Department of Computer Science and Technology Tsinghua University Beijing China College of Automation Hangzhou Dianzi University Hangzhou Zhejiang China

Most of the traditional ship positioning methods only consider how to integrate or fuse the active information from GPS, SINS, TNS, and SMS and so forth. But because of the complexity possessed by the modern marine intelligent transport system (MITS) and the uncertainty of hardware systems, especially the fallibility of GPS, the application abilities of the current ship positioning methods are limited badly and suffer many problems and challenges. Aiming at these, the ship navigation positioning based on relative measurements (SNPRM) algorithm, which uses the other shippsilas information to further update the target shippsilas active integrated navigation positioning estimate (AINPE), has been presented. Accordingly, the accuracy and reliability of the navigation positioning estimate are improved. Unfortunately, it is suboptimal in minimum mean square error (MMSE) and doesnpsilat have feedback function; therefore, both of them lead directly the low accuracy and bad local performance. In order to solve the above problems, a novel distributed SNPRM (DSNPRM) method is proposed in this paper by introducing the optimal distributed fusion and global feedback. The algorithm analysis and simulation both show its validity and superiority compared with the current SNPRM algorithm.

关键词： Marine vehicles Equations Navigation Global positioning system Algorithm design and analysis Position measurement Accuracy

来源：评论

学校读者我要写书评

暂无评论

distributed subgradient methods and quantization effects

Distributed subgradient methods and quantization effects

引用

IEEE Conference on Decision and Control

作者： Angelia Nedic Alex Olshevsky Asuman Ozdaglar John N. Tsitsiklis Department of Industrial and Enterprise Systems Engineering University of Illinois Urbana-Champaign IL USA Department of Electrical Engineering and Computer Science Laboratory for Information and Decision Systems Massachusetts Institute of Technology Cambridge MA USA

ISBN: (纸本)9781424431236

We consider a convex unconstrained optimization problem that arises in a network of agents whose goal is to cooperatively optimize the sum of the individual agent objective functions through local computations and communications. For this problem, we use averaging algorithms to develop distributed subgradient methods that can operate over a time-varying topology. Our focus is on the convergence rate of these methods and the degradation in performance when only quantized information is available. Based on our recent results on the convergence time of distributed averaging algorithms, we derive improved upper bounds on the convergence rate of the unquantized subgradient method. We then propose a distributed subgradient method under the additional constraint that agents can only store and communicate quantized information, and we provide bounds on its convergence rate that highlight the dependence on the number of quantization levels.

关键词： Quantization Convergence Optimization methods Network topology Upper bound Resource management Control systems Communication industry computer industry Electrical equipment industry

来源：评论

学校读者我要写书评

暂无评论

On distributed averaging algorithms and quantization effects

On distributed averaging algorithms and quantization effects

引用

IEEE Conference on Decision and Control

作者： Angelia Nedic Alex Olshevsky Asuman Ozdaglar John N. Tsitsiklis Industrial and Enterprise Systems Engineering Department University of Illinois Urbana-Champaign Urbana IL USA Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Department Massachusetts Institute of Technology Cambridge MA USA

ISBN: (纸本)9781424431236

We consider distributed iterative algorithms for the averaging problem over time-varying topologies. Our focus is on the convergence time of such algorithms when complete (unquantized) information is available, and on the degradation of performance when only quantized information is available. We study a large and natural class of averaging algorithms, which includes the vast majority of algorithms proposed to date, and provide tight polynomial bounds on their convergence time. We then propose and analyze distributed averaging algorithms under the additional constraint that agents can only store and communicate quantized information. We show that these algorithms converge to the average of the initial values of the agents within some error. We establish bounds on the error and tight bounds on the convergence time, as a function of the number of quantization levels.

关键词： Quantization Convergence Iterative algorithms Algorithm design and analysis Polynomials distributed control Topology Degradation Information analysis Large-scale systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共60页 << < 43 44 45 46 47 48 49 50 51 52 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：