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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

73 篇 会议
14 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

71 篇 工学
- 63 篇 计算机科学与技术...
- 50 篇 软件工程
- 29 篇 信息与通信工程
- 13 篇 控制科学与工程
- 4 篇 电气工程
- 3 篇 机械工程
- 3 篇 动力工程及工程热...
- 3 篇 环境科学与工程（可...
- 2 篇 力学（可授工学、理...
- 2 篇 建筑学
- 2 篇 生物工程
- 2 篇 网络空间安全
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
- 1 篇 生物医学工程（可授...
30 篇 理学
- 26 篇 数学
- 6 篇 统计学（可授理学、...
- 2 篇 生物学
- 1 篇 物理学
- 1 篇 地理学
- 1 篇 大气科学
- 1 篇 地球物理学
- 1 篇 系统科学
23 篇 管理学
- 15 篇 图书情报与档案管...
- 10 篇 管理科学与工程(可...
- 6 篇 工商管理
4 篇 法学
- 4 篇 社会学
1 篇 经济学
- 1 篇 应用经济学
1 篇 艺术学
- 1 篇 设计学（可授艺术学...

主题

12 篇 calculus
10 篇 wireless sensor ...
7 篇 delays
6 篇 distributed comp...
5 篇 servers
4 篇 quality of servi...
4 篇 queueing analysi...
4 篇 delay
4 篇 stochastic proce...
4 篇 ontology
3 篇 aggregates
3 篇 wireless communi...
3 篇 topology
3 篇 uncertainty
3 篇 mathematical mod...
3 篇 sensors
2 篇 sensor nodes
2 篇 routing
2 篇 communication sy...
2 篇 multiplexing

机构

6 篇 distributed comp...
4 篇 disco distribute...
3 篇 lab. of computer...
2 篇 distributed comp...
2 篇 parallel and dis...
2 篇 large scale dist...
2 篇 distributed comp...
2 篇 computer network...
2 篇 ieee
2 篇 distributed comp...
2 篇 acm
2 篇 school of comput...
2 篇 distributed know...
2 篇 school of commun...
2 篇 school of comput...
2 篇 artificial intel...
2 篇 disco distribute...
2 篇 disco / distribu...
2 篇 parallel and dis...
1 篇 computer network...

作者

16 篇 schmitt jens b.
8 篇 jens b. schmitt
5 篇 martinovic ivan
5 篇 steffen bondorf
5 篇 zdarsky frank a.
5 篇 garg vijay k.
4 篇 ivan martinovic
4 篇 janakiram d.
3 篇 paul nikolaus
3 篇 jens schmitt
3 篇 poe wint yi
3 篇 nagar atulya
2 篇 nicos gollan
2 篇 peng bo
2 篇 dai yafei
2 篇 honke benjamin
2 篇 reddy m. venkate...
2 篇 kwon oh-young
2 篇 bauer bernhard
2 篇 tawfik hissam

语言

86 篇 英文
2 篇 其他
1 篇 中文

检索条件"机构=Disco Distributed Computer Systems Lab."

共 88 条记录，以下是41-50 订阅

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

详细简洁

排序：

SemanticQA: Web-based ontology-driven question answering 09

SemanticQA: Web-based ontology-driven question answering

引用

24th Annual ACM Symposium on Applied Computing, SAC 2009

作者： Tartir, Samir McKnight, Bobby Arpinar, I. Budak Large-Scale Distributed Information Systems Lab. Department of Computer Science University of Georgia Athens GA 30602-7404 United States

ISBN: (纸本)9781605581668

The ability to ask specific question to the internet using natural language and receiving answers instead of documents is highly desired. Recent advancements in semantic web technologies make it possible to support such capability with more accuracy compared to existing non-semantic techniques. Using our expertise in ontology building and semantic search and discovery we designed an ontology-driven question answering system that extracts answers from web documents. This system processes natural language queries using a background ontology and finds possible answer(s) to the question from web documents. Copyright 2009 ACM.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Self-organized sink placement in large-scale wireless sensor networks

Self-organized sink placement in large-scale wireless sensor...

引用

International Symposium on Modeling, Analysis and Simulation of computer and Telecommunication systems (MASCOTS)

作者： Wint Yi Poe Jens B. Schmitt Distributed Computer Systems Lab (DISCO) Technical University of Kaiserslautern Kaiserslautern Germany

ISBN: (纸本)9781424449279

The deficient energy supplies of wireless sensor networks (WSNs) drives network designers to optimize energy consumption in various ways. Not only with regard to the energy issue but also with respect to system performance, we design a local search technique for sink placement in WSNs that tries to minimize the maximum worst-case delay and extend the lifetime of a WSN, simultaneously. Since it is not feasible for a sink to use global information, which especially applies to large-scale WSNs, we introduce a self-organized sink placement (SOSP) strategy that combines the advantages of our previous works. The goal of this research is to provide a better sink placement strategy with a lower communication overhead. Avoiding the costly design of using nodes' location information, each sink sets up its own group by communicating to its n-hop distance neighbors. While keeping the locally optimal placement, SOSP exhibits a quality of the solutions with respect to communication overhead as well as computational effort that are better than previous solutions. To model and consequently control the worst-case delay of a given WSN we build upon the so-called sensor network calculus (a recent methodology first introduced).

关键词： Large-scale systems Wireless sensor networks Calculus Delay Design optimization Energy consumption System performance Spread spectrum communication Integer linear programming Routing

来源：评论

学校读者我要写书评

暂无评论

A Lie group based Gaussian mixture model distance measure for multimedia comparison 09

A Lie group based Gaussian mixture model distance measure fo...

引用

1st International Conference on Internet Multimedia Computing and Service, ICIMCS 2009

作者： Gong, Liyu Wang, Tianjiang Yu, Yan Liu, Fang Hu, Xiangen Intelligent and Distributed Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan Hubei 430074 China Department of Information and Computing Science School of Science Wuhan University of Science and Technology Wuhan Hubei 430065 China Department of Psychology Institute for Intelligent Systems University of Memphis Memphis TN 38152 United States

ISBN: (纸本)9781605588407

In this paper, we propose a novel method to measure the distance between two Gaussian Mixture Models. The proposed distance measure is based on the minimum cost that must paid to transform from one Gaussian Mixture Model into the other. We parameterize the components of a Gaussian Mixture Model which are Gaussian probability density functions (pdf) as positive definite lower triangular transformation matrices. Then we identify that Gaussian pdfs form a Lie group. Based on Lie group theory, the geodesic length can be used to measure the minimum cost that must paid to transform from one Gaussian pdf into the other. Combining geodesic length with the earth mover's distance, we propose the Lie group earth mover's distance for Gaussian Mixture Models. We test our distance measure in image retrieval. The experimental results indicate that our distance measure is more effective than other measures including the Kullback-Liebler divergence. Copyright 2009 ACM.

关键词： Probability density function

来源：评论

学校读者我要写书评

暂无评论

Placing multiple sinks in time-sensitive Wireless Sensor Networks using a Genetic Algorithm

Placing multiple sinks in time-sensitive Wireless Sensor Net...

引用

2008 14th GI/ITG Conference on Measuring, Modelling and Evaluation of computer and Communication systems, MMB 2008

作者： Poe, Wint Yi Schmitt, Jens B. Disco - Distributed Computer Systems Lab University of Kaiserslautern Germany

ISBN: (纸本)9783800730902

Performance issues in Wireless Sensor Networks (WSNs) play a vital role in many applications. Often the maximum allowable message transfer delay must be bounded in order to enable time-sensitive applications of WSNs like fire or intrusion detection systems. Hence, it is crucial to develop algorithms that minimize the worst-case delay in WSNs. In this work, we focus on the problem of placing multiple sinks such that the maximum worst-case delay is minimized while keeping the energy consumption as low as possible. For that purpose we develop an algorithm based on the Genetic Algorithm (GA) paradigm. To model and consequently control the worst-case delay of a given WSN we build upon the so-called sensor network calculus (a recent methodology introduced in [10]). In order to be able to assess the performance of the GA-based sink placement strategy we compare it to an exhaustive search algorithm as well as a Monte-Carlo search. All of the strategies are based on a discretization of the originally continuous search space into a finite search space, which forms a contribution of our work of independent interest. In the performance comparison with the other strategies the GA exhibits a favourable behaviour with respect to the quality of the solutions found and the computational effort invested. It thus seems to be a good candidate for addressing the problem of placing multiple sinks in large-scale time-sensitive WSNs.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Improving performance bounds in feed-forward networks by paying multiplexing only once

Improving performance bounds in feed-forward networks by pay...

引用

2008 14th GI/ITG Conference on Measuring, Modelling and Evaluation of computer and Communication systems, MMB 2008

作者： Schmitt, Jens B. Zdarsky, Frank A. Martinovic, Ivan Disco Distributed Computer Systems Lab University of Kaiserslautern Germany

ISBN: (纸本)9783800730902

Bounding performance characteristics in communication networks is an important and interesting issue. In this study we assume uncertainty about the way different flows in a network are multiplexed, we even drop the common FIFO assumption. Under so-called arbitrary multiplexing we derive new bounds for the tractable, yet non-trivial case of feed-forward networks. This is accomplished for pragmatic, but general traffic and server models using network calculus. In particular, we derive an end-to-end service curve for a flow of interest under arbitrary multiplexing, establishing what we call the pay multiplexing only once principle. Finally, we present some numerical results to compare our bounds against the best known bounds for networks of arbitrary multiplexing nodes.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Network calculus - What it can do for you and where it needs your help 08

Network calculus - What it can do for you and where it needs...

引用

4th Asian Internet Engineering Conference, AINTEC 2008

作者： Schmitt, Jens B. Distributed Computer Systems Lab. Computer Science Department University of Kaiserslautern 67653 Kaiserslautern Germany

ISBN: (纸本)9781605581279

In this talk, the theory of network calculus is discussed from the point of view: (1) how powerful it is in applications as well as (2) what fundamental challenges it still faces before it can be considered a similarly mature theory as the well-known classical queueing theory. To this end, we briefly review the basic concepts and mathematical foundations of network calculus, before we then show its applicability for the example of wireless sensor networks. The latter work culminated in the so-called sensor network calculus which is a customized and adequately extended set of methods based on the fundamental network calculus results enriched by the requirements stemming from the specific nature of wireless sensor networks. The lessons learned from this exercise are: on the one hand, network calculus provides already a rich and useful set of methods, but on the other hand, substantial work was still necessary to apply it to the particular context of wireless sensor networks (and to some degree still remains). Hence, in the second part of this talk, we outline some of the fundamental open issues with respect to the foundations of network calculus. We discuss current efforts to address these, although some of them are still completely open and thus constitute good opportunities for future research. Copyright 2008 ACM.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Enabling authentic transmissions in WSNs — turning jamming against the attacker

Enabling authentic transmissions in WSNs — turning jamming ...

引用

IEEE Workshop on Secure Network Protocols (NPSec)

作者： Adam Bachorek Ivan Martinovic Jens B. Schmitt Disco Distributed Computer Systems Lab University of Kaiserslautern Germany

Traditional methods for message authentication are based on the cryptographic verification of received data using some sort of a shared secret. While this task is not critical for traditional networks, Wireless Sensor Networks (WSNs) may pay a high price for the gained protection - sensor nodes are forced to invest their already scarce resources in receiving a message and executing cryptographic computations, only to discard the message afterwards in case of a failed authentication. This work introduces a different, crypto-free approach for enabling authenticated communication by leveraging peculiarities of wireless communication, in particular its broadcast nature and the feasibility of channel capacity jamming. Instead of receiving and then verifying transmitted data, sensor nodes are prevented from receiving fake data at all. This is achieved by coupling physical characteristics of signal propagation with legitimate transmissions. Such a coupling enables the detection and invalidation of impersonation attacks by using short jamming pulses emitted by surrounding WSN nodes. We justify this concept by designing a novel communication protocol explicitly integrating the jamming feature, and analyze factors which impact the efficiency of successful jamming, such as the frame length, transmission timing accuracy, and various other issues identified through extensive empirical measurements.

关键词： Jamming Timing Wireless sensor networks Receivers Wireless communication Cryptography Accuracy

来源：评论

学校读者我要写书评

暂无评论

Firewalling wireless sensor networks: Security by wireless

Firewalling wireless sensor networks: Security by wireless

引用

Conference on Local computer Networks (LCN)

作者： Ivan Martinovic Nicos Gollan Jens B. Schmitt Disco-distributed computer systems lab University of Kaiserslautern Germany

Networked sensors and actuators for purposes from production monitoring and control to home automation are in increasing demand. Until recently, the main focus laid on wired systems, although their deployment requires careful planning and expensive infrastructure that may be difficult to install or modify. Hence, solutions based on wireless sensor networks (WSNs) are gaining popularity to reduce cost and simplify installation. Clearly, one of the key issues rising from the switch to wireless communication lies in security; while an air gap is among the most effective security measures in wired networks, wireless communication is not as easy to isolate from attack. In this paper, we propose a system leveraging the peculiarities of the wireless medium, such as the broadcast nature of wireless communication and the unpredictability of indoor signal propagation to achieve effective protection against attacks based on the injection of fake data. Using a real-world WSN deployment and a realistic implementation of an attacker, we analyze this protection scheme and demonstrate that neither position change, transmission power manipulation, nor complete knowledge of wireless parameters can help an attacker to successfully attack the network. As a result, this work demonstrates how the chaotic nature of radio communication, which is often considered a disadvantage in regard to security objectives, can be used to enhance protection and support implementation of lightweight security mechanisms.

关键词： Wireless sensor networks Wireless communication Sensors Security Communication system security Distance measurement Antenna measurements

来源：评论

学校读者我要写书评

暂无评论

Towards multi-perspective intelligent layout design for context-driven route navigation

Towards multi-perspective intelligent layout design for cont...

引用

EMS 2008, European Modelling Symposium, 2nd UKSim European Symposium on computer Modelling and Simulation

作者： Anya, Obinna Tawfik, Hissam Nagar, Atulya Intelligent and Distributed Systems Lab. Deanery of Business and Computer Science Liverpool Hope University Liverpool L16 9JD United Kingdom

ISBN: (纸本)9780769533254

With the growing research interest in intelligent pervasive environments, there is a need to plan our layouts with sufficient criteria modelling so as to provide support for context-driven route navigation. However, current spatial layout modelling and simulation tools are largely inadequate for the task required since they are based on manual and heuristic techniques and do not provide a rich resource of context that will very well reflect user-perceived models of a layout. In this paper, we present an initial proof of concept prototype of a multi-perspective intelligent layout design and analysis framework to support context-driven navigation. We aim to show that some of the ideas to emerge from the field of intelligent systems, HCI, semantic technologies and advanced simulation could be combined with novel techniques in GIS-based information and image processing to analyse and visualise traffic networks and layouts from a range of design, travel and userrelated perspectives. © 2008 IEEE.

关键词： Intelligent systems

来源：评论

学校读者我要写书评

暂无评论

A multi-objective pareto-optimal solution to the box-pushing problem by mobile robots

A multi-objective pareto-optimal solution to the box-pushing...

引用

EMS 2008, European Modelling Symposium, 2nd UKSim European Symposium on computer Modelling and Simulation

作者： Chakraborty, Jayasree Konar, Amit Nagar, Atulya Tawfik, Hissam Artificial Intelligence Lab. ETCE Dept. Jadavpur University Kolkata 700032 India Intelligence and Distributed Systems Lab. Deanery of Business and Computer Sciences Liverpool Hope University Liverpool L169JD United Kingdom

ISBN: (纸本)9780769533254

The paper provides a new formulation of the wellknown box-pushing problem by robots as a multiobjective optimization problem, and presents Paretooptimal solutions to the problem. The proposed method allows both turning and translation of the box, while shifting it to a desired goal position. Local planning scheme is employed here to determine the magnitude of the forces applied by two mobile robots at specific locations on the box to align and translate it in each distinct step of motion of the box, so as to minimize the consumption of both time and energy. This is realized using Non-dominated Sorting Genetic Algorithm-II (NSGA-II). The proposed scheme, to the best of the authors' knowledge, is a first successful communication-free, centralized co-operation between two robots applied in box-shifting, satisfying multiple objectives simultaneously using evolutionary algorithm. © 2008 IEEE.

关键词： Mobile robots

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：