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

2012 4th International Conference on Intelligent Networking and Collaborative systems, INCoS 2012

作者： Zelenkauskaite, Asta Bessis, Nik Sotiriadis, Stelios Asimakopoulou, Eleana Department of Telecommunications Indiana University Bloomington IN United States Distributed and Intelligent Systems Research Group University of Derby Derby United Kingdom Department of Computer Science and Technology University of Bedfordshire Luton United Kingdom

ISBN: (纸本)9780769548081

This visionary paper presents the Internet of Things paradigm in terms of interdependent dynamic dimensions of objects and their properties. Given that in its current state Internet of Things (IoT) has been viewed as a paradigm based on hierarchical distribution of objects, evaluation of the dynamic nature of the hierarchical structures faces challenges in its evaluation and analysis. Within this in mind, our focus is on the area of complex social networks and the dynamic social network construction within the context of IoT. This is by highlighting and addressing the tagging issues of the objects to the real-world domain such as in disaster management, these are in relation to their hierarchies and interrelation within the context of social network analysis. Specifically, we suggest to investigate and deepen the understanding of the IoT paradigm through the application of social network analysis as a method for interlinking objects - and thus, propose ways in which IoT could be subsequently interlinked and analyzed through social network analysis approach - which provides possibilities for linking of the objects, while extends it into real-world domain. With this in mind, we present few applications and key characteristics of disaster management and the social networking analysis approach, as well as, foreseen benefits of its application in the IoT domain. © 2012 IEEE.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Disaster management and profile modelling of IoT objects: Conceptual parameters for interlinked objects in relation to social network analysis

Disaster management and profile modelling of IoT objects: Co...

引用

2012 4th International Conference on Intelligent Networking and Collaborative systems, INCoS 2012

ISBN: (纸本)9780769548081

In recent years, the emergence of ubiquitous and pervasive computing suggests the radical transformation of the Internet to incorporate physical objects. The transformation suggests the enabling of a new form of communication and interaction style that incorporates people, their smart devices and their physical objects through the utilization of distributed sensors spread in the environment. In this study, we propose extending Internet of Things (IoT) by modelling an IoT enabled smart environment as a whole, representing the dynamic communication and interaction among all objects (users, devices, physical objects and sensors). This is by recognizing and categorizing objects' properties in the form of a generic profile. We also reflect this in a disaster management context. That is by identifying which of the parameters of these smart objects are fixed, constant and persistent over time and which parameters are actually change over time, i.e. those characterized by their transient and dynamic nature. Thus, through the process of communication and interaction of the objects, we analyze parameters by demonstrating their static and/or dynamic properties as well as those supporting context-aware variables which are evident in disaster scenarios. To achieve these goals, we designed the persistent or temporal relationships to encompass internal information of smart-objects, along with their characteristics that actually depict their capacity to offer services to users by properties' matchmaking. The interlinked relationships represent a 'social network' providing a terrain of flexible scenarios that would lead to tailored parameters to fit user preferences. To enable communication among them in a dynamic dimension we utilized a distributed topology in which communication could occur indirectly between objects. Finally, we detailed a generic - but equally applicable for disaster management - case scenario in which we used graph theory to demonstrate how embedded intelligenc

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

DEBS grand challenge: Solving manufacturing equipment monitoring through efficient complex event processing

DEBS grand challenge: Solving manufacturing equipment monito...

引用

6th ACM International Conference on distributed Event-Based systems, DEBS'12

作者： Rabl, Tilmann Zhang, Kaiwen Sadoghi, Mohammad Pandey, Navneet Kumar Nigam, Aakash Wang, Chen Jacobsen, Hans-Arno Middleware Systems Research Group Canada Department of Electrical and Computer Engineering Canada Department of Computer Science Canada University of Toronto Canada Department of Informatics Norway University of Oslo Norway

ISBN: (纸本)9781450313155

In this paper, we present an efficient complex event processing system tailored toward monitoring a large-scale setup of manufacturing equipment. In particular, the key challenge in the equipment monitoring is to develop an event-based system for computing complex manufacturing queries coupled with event notifications and event and query result visualization components. Furthermore, we present an experimental evaluation to validate the effectiveness of the proposed solution with respect to both query latency and throughput. Copyright © 2012 ACM.

关键词： computer architecture

来源：评论

学校读者我要写书评

暂无评论

Context-based wireless mesh networks: A case for network virtualization

Context-based wireless mesh networks: A case for network vir...

引用

作者： Matos, Ricardo Sargento, Susana Hummel, Karin Anna Hess, Andrea Tutschku, Kurt De Meer, Hermann Instituto de Telecomunicações - Aveiro University of Aveiro 3810-193 Aveiro Portugal Department of Distributed and Multimedia Systems Distributed Systems Group University of Vienna Lenaugasse 2/8 1080 Vienna Austria Institute of Distributed and Multimedia Systems Department of Future Communication University of Vienna Universitätsstrasse 10/11 1090 Vienna Austria Department of Computer Networks and Communications University of Passau Innstrasse 43 94032 Passau Germany

Wireless Mesh networks (WMNs) have gained increasing attention as an attractive means to provide connectivity in complement to access as offered by regular Internet Service Providers (ISPs). Such a grass-root technique, however, often suffers from detrimental operating conditions and poor quality. Network virtualization, on the other hand, has been widely advocated as a possibility to overcome what has often been referred to as the ossification of the Internet. Combining the concept of network virtualization with WMN technology, therefore, appears to be promising and desirable. It is envisioned that well managed multiple Virtual networks (VNs) may overcome shortcomings of WMNs on the one hand, and extend the reach of the Internet beyond its current confinement into the realm and control of the user on the other hand. In this paper, we argue for a context-based approach for an effective means to extend multi-VNs from the Internet domain into WMN environments. We describe both mobility and preferences as context models in order to create virtualized WMNs based on these types of context models. As a result, it is envisioned to achieve a comprehensive connectivity coverage, accompanied by high assurance in network quality. We further present a distributed solution to manage multi-VNs, and a mobility-aware context use case to demonstrate the usefulness of our approach. © 2011 Springer science+Business Media, LLC.

关键词： Internet service providers

来源：评论

学校读者我要写书评

暂无评论

distributed collision avoidance for autonomous vehicles: world automata representation

引用

IFAC Proceedings Volumes 2012年第9期45卷 216-221页

作者： Nicolae E. Marinica Marta Capiluppi Jonathan A. Rogge Roberto Segala René K. Boel Department of Computer Science University of Verona Italy SYSTeMS Research Group Ghent University Belgium

The automatic control of interacting autonomous vehicles (AVs) is one of the problems that engineers are currently trying to solve. The present paper deals with the design of local control laws governing the movement and collision avoidance of such groups of AVs, enforcing the safeness of the operations as well as task completions. This problem is inspired by the automation of a container terminal where each AV executes tasks assigned by a supervisor. A task involves moving an AV from an assigned origin to an assigned destination by a given deadline. The constraints imposed by the bounded workspace (a long and narrow quay in the container terminal example), the deadlines assigned to each task, and the uncertainty in the detection and communication make the problem difficult to solve in a centralized way. Therefore a distributed control approach is preferred with a local control agent in each AV adjusting its trajectory, so that its task is completed without collisions. By applying a fixed set of priority rules the computational complexity for each agent is reduced compared to the centralized case. Whenever an AV detects a possible conflict, i.e. the estimated position of another AV within the detection range, it must adjust its own speed and trajectory in order to avoid a future collision, reducing the number of cases where a supervisor has to intervene in order to resolve conflicts that degenerate in dead-locks. The modelling and validation of the system is performed by using the world automata theory.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Scalable video coding impact on networks

Scalable video coding impact on networks

引用

6th International ICST Conference on Mobile Multimedia Communications, MOBIMEDIA 2010

作者： Ransburg, Michael Graciá, Eduardo Martínez Sutinen, Tiia Murillo, Jordi Ortíz Sablatschan, Michael Hellwagner, Hermann Klagenfurt University Klagenfurt Austria Intelligent Systems Group Department of Computer Science and Artificial Intelligence University of Murcia Murcia Spain VTT Technical Research Centre of Finland Espoo Finland

ISBN: (纸本)9783642351549

This paper describes the CELTIC project on "Scalable Video Coding Impact on networks" with the focus of designing a streaming system based on the Scalable Video Coding extension of the H.264/AVC standard. The system is designed to cope with streaming scenarios that can be classified in four use cases: session handover, network congestion, receiver heterogeneity and user driven adaptation. A complete overview of the architecture of the system is given. Two demonstration scenarios are described in detail, which point out the advantages of scalable video coding compared to single layer approaches in multimedia transmission and adaptation scenarios. A concluding section summarizes the work and provides an outlook to future work items. © 2012 ICST Institute for computer science, Social Informatics and Telecommunications Engineering.

关键词： Scalable video coding

来源：评论

学校读者我要写书评

暂无评论

Evolving radial basis function networks via GP for estimating fitness values using surrogate models

Evolving radial basis function networks via GP for estimatin...

引用

Congress on Evolutionary Computation

作者： Ahmed Kattan Edgar Galvan Evolutionary Design and Optimisation Group Computer Science Department Um Al-Qura University Saudi Arabia Distributed Systems Group School of Computer Science and Statistics Trinity College Dublin Ireland

In real-world problems with candidate solutions that are very expensive to evaluate, Surrogate Models (SMs) mimic the behaviour of the simulation model as closely as possible while being computationally cheaper to evaluate. Due to their nature, SMs can be seen as heuristics that can help to estimate the fitness of a candidate solution without having to evaluate it. In this paper, we propose a new SM based on Genetic Programming (GP) and Radial Basis Function networks (RBFN), called GP-RBFN Surrogate. More specifically, we use GP to evolve both: the structure of a RBF and its parameters. The SM evolved by our algorithm is tested in one of the most studied NP-complete problem (MAX-SAT) and its performance is compared against RBFN Surrogate, GAs, Random Search and (1+1) ES. The results obtained by performing extensive empirical experiments indicate that our proposed approach outperforms the other four methods in terms of finding better solutions without the need of evaluating a large portion of candidate solutions.

关键词： Training Mathematical model Computational modeling Standards Approximation methods Search problems Optimization

来源：评论

学校读者我要写书评

暂无评论

Geo-spatial autocorrelation as a metric for the detection of Fast-Flux botnet domains

Geo-spatial autocorrelation as a metric for the detection of...

引用

Information Security for South Africa (ISSA)

作者： Etienne Stalmans Samuel Oswald Hunter Barry Irwin Security and Networks Research Group Department of Computer Science Rhodes University Grahamstown South Africa

Botnets consist of thousands of hosts infected with malware. Botnet owners communicate with these hosts using Command and Control (C2) servers. These C2 servers are usually infected hosts which the botnet owners do not have physical access to. For this reason botnets can be shut down by taking over or blocking the C2 servers. Botnet owners have employed numerous shutdown avoidance techniques. One of these techniques, DNS Fast-Flux, relies on rapidly changing address records. The addresses returned by the Fast-Flux DNS servers consist of geographically widely distributed hosts. The distributed nature of Fast-Flux botnets differs from legitimate domains, which tend to have geographically clustered server locations. This paper examines the use of spatial autocorrelation techniques based on the geographic distribution of domain servers to detect Fast-Flux domains. Moran's I and Geary's C are used to produce classifiers using multiple geographic co-ordinate systems to produce efficient and accurate results. It is shown how Fast-Flux domains can be detected reliably while only a small percentage of false positives are produced.

关键词： Servers Correlation Indexes IP networks Accuracy Malware Command and control systems

来源：评论

学校读者我要写书评

暂无评论

distributed verification and hardness of distributed approximation

Distributed verification and hardness of distributed approxi...

引用

作者： Sarma, Atish Das Holzer, Stephan Kor, Liah Korman, Amos Nanongkai, Danupon Pandurangan, Gopal Peleg, David Wattenhofer, Roger EBay Research Labs EBay Inc. San Jose CA 95125 United States Computer Distributed Computing Group ETH Zurich CH-8092 Zurich Switzerland Department of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot 76100 Israel CNRS LIAFA Univ. Paris 7 Paris France Theory and Applications of Algorithms Research Group University of Vienna 1090-Vienna Austria Division of Mathematical Sciences Nanyang Technological University Singapore 637371 Singapore Department of Computer Science Brown University Providence RI 02912 United States

We study the verification problem in distributed networks, stated as follows. Let H be a subgraph of a network G where each vertex of G knows which edges incident on it are in H. We would like to verify whether H has some properties, e.g., if it is a tree or if it is connected (every node knows at the end of the process whether H has the specified property or not). We would like to perform this verification in a decentralized fashion via a distributed algorithm. The time complexity of verification is measured as the number of rounds of distributed communication. In this paper we initiate a systematic study of distributed verification and give almost tight lower bounds on the running time of distributed verification algorithms for many fundamental problems such as connectivity, spanning connected subgraph, and s-t cut verification. We then show applications of these results in deriving strong unconditional time lower bounds on the hardness of distributed approximation for many classical optimization problems including minimum spanning tree (MST), shortest paths, and minimum cut. Many of these results are the first nontrivial lower bounds for both exact and approximate distributed computation, and they resolve previous open questions. Moreover, our unconditional lower bound of approximating MST subsumes and improves upon the previous hardness of approximation bound of Elkin [M. Elkin, SIAM J. Comput., 36 (2006), pp. 433-456] as well as the lower bound for (exact) MST computation of Peleg and Rubinovich [D. Peleg and V. Rubinovich, SIAM J. Comput., 30 (2000), pp. 1427-1442]. Our result implies that there can be no distributed approximation algorithm for MST that is significantly faster than the current exact algorithm for any approximation factor. Our lower bound proofs show an interesting connection between communication complexity and distributed computing which turns out to be useful in establishing the time complexity of exact and approximate distributed computatio

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

A network telescope perspective of the Conficker outbreak

A network telescope perspective of the Conficker outbreak

引用

Information Security for South Africa (ISSA)

作者： Barry Irwin Security and Networks Research Group (SNRG) Department of Computer Science Rhodes University Grahamstown South Africa

This paper discusses a dataset of some 16 million packets targeting port 445/tcp collected by a network telescope utilising a /24 netblock in South African IP address space. An initial overview of the collected data is provided. This is followed by a detailed analysis of the packet characteristics observed, including size and TTL. The peculiarities of the observed target selection and the results of the flaw in the Conficker worm's propagation algorithm are presented. An analysis of the 4 million observed source hosts is reported by grouped by both packet counts and the number of distinct hosts per network address block. Address blocks of size /8, 16 and 24 are used for groupings. The localisation, by geographic region and numerical proximity, of high ranking aggregate netblocks is highlighted. The paper concludes with some overall analyses, and consideration of the application of network telescopes to the monitoring of such outbreaks in the future.

关键词： Telescopes Malware IP networks Grippers Operating systems Monitoring

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：