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

International Conference on Software, Telecommunications and computer networks (SoftCOM)

作者： Jochen Issing Nikolaus Färber Department Computer Science 7 Computer Networks and Communication Systems Friedrich-Alexander-Universitat Erlangen Germany Multimedia Transport Group Fraunhofer IIS Erlangen Germany

The impact of mouth-to-ear delay on Conversational Quality (CQ) has been subject to manyfold research in the field of telecommunications. However, its dependency on Conversational Interactivity (CI) has not been studied explicitly in a quantitative way. To investigate the impact of both delay and CI, we conducted 48 tests with 96 different participants and controlled the interactivity through different tasks, namely natural conversation (flight), proof reading of text (text), and random number verification (rnv). The control of interactivity is proven to be effective and remains stable for delays from 100 ms to 800 ms. The Speaker Alternation Rate (SAR) is used as the metric for interactivity. It is shown to have a significant impact on CQ after 200ms delay and the effect does not alleviate until 800 ms. The hypothesis is proven using both graphical analysis and statistical evaluation based on a linear model and Analysis of Variance (ANOVA).

关键词： Delay Interrupters Telecommunications Correlation Predictive models Analysis of variance

来源：评论

学校读者我要写书评

暂无评论

Interconnectedness of Complex systems of Internet of Things through Social Network Analysis for Disaster Management

Interconnectedness of Complex Systems of Internet of Things ...

引用

International Conference on Intelligent Networking and Collaborative systems (INCOS)

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

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.

关键词： Social network services Context Sensors Internet Disaster management Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

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...

引用

International Conference on Intelligent Networking and Collaborative systems (INCOS)

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

关键词： Social network services Context Organizations Disaster management Sensors Object recognition Internet

来源：评论

学校读者我要写书评

暂无评论

Handling missing values in data mining - A case study of heart failure dataset

Handling missing values in data mining - A case study of hea...

引用

International Conference on Fuzzy systems and Knowledge Discovery (FSKD)

作者： N. Poolsawad L. Moore C. Kambhampati J. G. F. Cleland Distributed Reliable Intelligent Systems Research Group (DRIS) Department of Computer Science University of Hull Hull UK Hull York Medical School Department of Cardiology University of Hull Hull UK

In this paper, we investigate the characteristics of a clinical dataset using feature selection and classification techniques to deal with missing values and develop a method to quantify numerous complexities. The research aims to find features that have high effect on mortality time frame, and to design methodologies which will cope with the following challenges: missing values, high dimensionality, and the prediction problem. The experimental results will be extended to develop prediction model for HF This paper also provides a comprehensive evaluation of a set of diverse machine learning schemes for clinical datasets.

关键词： Data mining Classification algorithms Predictive models Heart Artificial neural networks Accuracy Prediction algorithms

来源：评论

学校读者我要写书评

暂无评论

Brief announcement: Maintaining large dense subgraphs on dynamic networks 12

Brief announcement: Maintaining large dense subgraphs on dyn...

引用

2012 ACM Symposium on Principles of distributed Computing, PODC'12

作者： Sarma, Atish Das Lall, Ashwin Nanongkai, Danupon Trehan, Amitabh eBay Research Labs. eBay Inc. San Jose CA United States Department of Mathematics and Computer Science Denison University Granville OH United States Theory and Applications of Algorithms Research Group University of Vienna Vienna Austria Information Systems Group Faculty of Industrial Engineering and Management Technion Haifa Israel

ISBN: (纸本)9781450314503

In distributed networks, some groups of nodes may have more inter-connections, perhaps due to their larger bandwidth availability or communication requirements. In many scenarios, it may be useful for the nodes to know if they form part of a dense subgraph, e.g., such a dense subgraph could form a high bandwidth backbone for the network. In this work, we address the problem of self-awareness of nodes in a dynamic network with regards to graph density, i.e., we give distributed algorithms for maintaining dense subgraphs (subgraphs that the member nodes are aware of). The only knowledge that the nodes need is that of the dynamic diameter D, i.e., the maximum number of rounds it takes for a message to traverse the dynamic network. For our work, we consider a model where the number of nodes are fixed, but a powerful adversary can add or remove a limited number of edges from the network at each time step. The communication is by broadcast only and follows the CONGEST model in the sense that only messages of O(log n) size are permitted, where n is the number of nodes in the network. Our algorithms are continuously executed on the network, and at any time (after some initialization) each node will be aware if it is part (or not) of a particular dense subgraph. We give algorithms that approximate both the densest subgraph, i.e., the subgraph of the highest density in the network, and the at-least-k-densest subgraph (for a given parameter k), i.e., the densest subgraph of size at least k. We give a (2 + Ε)-approximation algorithm for the densest subgraph problem. The at-least-k-densest subgraph is known to be NP-hard for the general case in the centralized setting and the best known algorithm gives a 2-approximation. We present an algorithm that maintains a (3+Ε)-approximation in our distributed, dynamic setting. Our algorithms run in O(Dlog1+Ε n) time. © 2012 Authors.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Tomorrow's In-Car Interconnect? A Competitive Evaluation of IEEE 802.1 AVB and Time-Triggered Ethernet (AS6802)

Tomorrow's In-Car Interconnect? A Competitive Evaluation of ...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Till Steinbach Hyung-Taek Lim Franz Korf Thomas C. Schmidt Daniel Herrscher Adam Wolisz Department of Computer Science Hamburg University of Applied Sciences Germany BMW Group Research and Technology Germany Telecommunication Networks Group Technische Universität Berlin Germany

Ethernet-based in-car communication is currently a hot topic in the automotive industry. Soon Ethernet will start to oust MOST bus in its domain of info- and entertainment applications. However, the full benefit of a technologically integrated in-car network will only become rewarding with the deployment of an Ethernet-based backbone that integrates all automotive domains on a single layer at increased bandwidth, reduced complexity and cost, while opening car intelligence for future innovations. Such backbone must transport critical control data in real-time. Standard Ethernet requires extensions to comply with the strict timing requirements of driver assistance and safety applications while simultaneously supporting broadband multimedia traffic. In this paper, we compare IEEE 802.1 AVB and Time-triggered Ethernet, two competing real-time approaches. While the first fosters over- provisioning and prioritisation, the second is based on a coordinated time-division-multiple-access (TDMA) policy for media access. By simulating a realistic in-car backbone design and traffic model, we reveal the strengths and weaknesses of both protocols and point to the diverging characteristics of event- and time-triggered policies. Our results show that in this in-car network scenario both protocols are able to meet the rigid timing requirements, while each has its unique benefits and disadvantages.

关键词： Synchronization Protocols Cameras Streaming media Jitter Media Real-time systems

来源：评论

学校读者我要写书评

暂无评论

More practical power analysis attack on LFSR based stream ciphers

引用

Journal of Information and Computational science 2012年第12期9卷 3517-3527页

作者： Jia, Yanyan Hu, Yupu Zhang, Wenzheng Department of Computer Science Xi'an University of Science and Technology Xi'an 710054 China Laboratory of Computer Networks and Information Security Xidian University Xi'an 710071 China Science and Technology on Communication Security Laboratory The 30th Research Institute of China Electronics Technology Group Corporation Chengdu 610041 China

Power analysis attack is a powerful cryptanalytic technique aiming to extract the secret data from a cryptographic device by collecting and analyzing power consumption traces. In this paper, we present a practical power analysis attack on Linear Feedback Shift Registers (LFSR) based stream ciphers. Based on Information Theory, the problem of the power analysis attack is converted into the problem of decoding over a 3-ary symmetric channel. By setting two thresholds, the attack algorithm can significantly eliminate the effect of noise. And therefore, the correctness of decoding is enhanced. Compared with Burman's attack, the proposed attack algorithm is much more practical since the algorithmic noise and electronic noise are taken into account. Simulation results show that when the Signal to Noise Ratio (SNR) is higher than -6.5dB, the algorithm can always be practically performed and effective. © 2012 Binary Information Press.

关键词： Side channel attack

来源：评论

学校读者我要写书评

暂无评论

Traffic Differentiation - A Basic Step Towards Providing End-to-End QoS on the Train-to-Wayside Wireless Communication System

Traffic Differentiation - A Basic Step Towards Providing End...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Milos Rovcanin Dries Naudts Daan Pareit Ingrid Moerman Johan Bergs Erwin Van de Velde Chris Blondia Department of information Technology Internet Based Communication Networks and Services Ghent University-IBBT Ghent Belgium PATS Research Group Department od Mathematics and Computer Science University of Antwerp Antwerp Belgium

We developed a network platform that is responsible for an uninterrupted and seamless connectivity from the train to the wayside through heterogeneous wireless access technologies. However, limiting the offered services to only an onboard Internet is not a feasible business case. A viable one should extend to a broad spectrum of railway communication services like: train control, diagnostics, real time passenger information, entertainment, security CCTV surveillance etc. In a highly dynamic environment (from the communication link point of view) such a fast moving train, it is necessary to introduce prioritization among different traffic classes. This will implicitly determine under what conditions a certain flow should get suspended or dropped in order to preserve the flows of a higher priority as long as possible and to ensure that they meet their QoS demands. The first step towards this goal is data traffic differentiation.

关键词： Bandwidth Quality of service Wireless communication Delay Oscillators

来源：评论

学校读者我要写书评

暂无评论

Saliency map estimation by constructing graphs of possible eye-tracking paths

Saliency map estimation by constructing graphs of possible e...

引用

International Conference on Cognitive Infocommunications (CogInfoCom)

作者： Szilard Szalai Tamas Sziranyi Zoltan Vidnyanszky Distributed Events Analysis Research Group Computer and Automation Research Institute Budapest Hungary Faculty of Information Technology Pazmany Peter Catholic University Budapest Hungary Department of Cognitive Science Budapest University of Technology and Economics Budapest Hungary

We introduce a novel approach for saliency detection where we fuse perceptional saliency with machine saliency in a statistical approach. The improvement of our fused algorithm against other methods is presented. Human saliency is recorded from human eye movement during free view training. The transition movements caused by the saccades are evaluated to generate transition probability tables. This new kind of training is applied into a connection graph based model where transitions among the machine generated saliency points are weighted by the probabilities derived from the human trained probability table. In the presented method, different psychophysical studies are taken into consideration by inferring regions of interests. The proposed method results in a good estimation of the possible interest areas of the human vision measurements.

关键词： Humans Training Visualization Probability Observers Feature extraction

来源：评论

学校读者我要写书评

暂无评论

The dispersion of Slepian-Wolf coding

The dispersion of Slepian-Wolf coding

引用

IEEE International Symposium on Information Theory

作者： Vincent Y. F. Tan Oliver Kosut Institute for Infocomm Research Agency for Science Technology and Research Singapore Department of Electrical and Computer Engineering National University of Singapore Singapore Stochastic Systems Group (SSG) Massachusetts Institute of Technology USA

ISBN: (纸本)9781467325790

We characterize second-order coding rates (or dispersions) for distributed lossless source coding (the Slepian-Wolf problem). We introduce a fundamental quantity known as the entropy dispersion matrix, which is analogous to scalar dispersion quantities. We show that if this matrix is positive-definite, the optimal rate region under the constraint of a fixed blocklength and non-zero error probability has a curved boundary compared to being polyhedral for the Slepian-Wolf case. In addition, the entropy dispersion matrix governs the rate of convergence of the non-asymptotic region to the asymptotic one. As a by-product of our analyses, we develop a general universal achievability procedure for dispersion analysis of some other network information theory problems such as the multiple-access channel. Numerical examples show how the region given by Gaussian approximations compares to the Slepian-Wolf region.

关键词： Dispersion Entropy Vectors Decoding Channel coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：