High density of coexisting networks in the Industrial, Scientific and Medical (ISM) band leads to static and self interferences among different communication entities. The inevitability of these interferences demands for interference avoidance schemes to ensure reliability of network operations. This paper proposes a novel Diversified Adaptive Frequency Rolling (DAFR) technique for frequency hopping in Bluetooth piconets. DAFR employs intelligent hopping procedures in order to mitigate self interferences, weeds out the static interferer efficiently and ensures sufficient frequency diversity. We compare the performance of our proposed technique with the widely used existing frequency hopping techniques, namely, Adaptive Frequency Hopping (AFH) and Adaptive Frequency Rolling (AFR). Simulation studies validate the significant improvement in goodput and hopping diversity of our scheme compared to other schemes and demonstrate its potential benefit in real world deployment. 相似文献
Limited bandwidth resources lead to a number of challenges especially for eHealth applications, which are communicated over IP and wireless networks. These multimedia services include high-resolution videos and have very large file sizes that require a high level of compression to overcome this limitation. Therefore, there is an acute demand for the research community to provide an efficient multimedia framework to encode medical videos with high quality specifically under the conditions of an error-prone environment. Both an affordable delivery framework and effective coding techniques are extremely desirable for the delivery of high-quality eHealth video applications for transmission over heterogeneous networks and devices. In this paper, we propose and demonstrate a multimedia framework to support eHealth applications, which has an improved coding scheme that uses an SVC-scalable extension of MPEC-4 AVC/H.264. Simulation results show that the proposed scheme achieves a significant improvement in terms of the PSNR-Y gain and reduces the picture quality degradation caused by artifacts and distortions, compared to the existing scheme. 相似文献
An intelligent adaptable system, aware of a user’s experienced cognitive load, may help improve performance in complex, time-critical situations by dynamically deploying more appropriate output strategies to reduce cognitive load. However, measuring a user’s cognitive load robustly, in real-time is not a trivial task. Many research studies have attempted to assess users’ cognitive load using different measurements, but these are often unsuitable for deployment in real-life applications due to high intrusiveness. Relatively novel linguistic behavioral features as potential indices of user’s cognitive load is proposed. These features may be collected implicitly and nonintrusively supporting real-time assessment of users’ cognitive load and accordingly allowing adaptive usability evaluation and interaction. Results from a laboratory experiment show significantly different linguistic patterns under different task complexities and cognitive load levels. Implications of the research for adaptive interaction are also discussed, that is, how the cognitive load measurement-based approach could be used for user interface evaluation and interaction design improvement. 相似文献
Software end-users need to sign licenses to seal an agreement with the product
providers. Habitually, users agree with the license (i.e. terms and conditions) without fully
understanding the agreement. To address this issue, an ontological model is developed to
formulate the user requirements and license agreements formally. This paper, introduces
ontological model that includes the abstract license ontology of common features found in
di?erent license agreements. The abstract license ontology is then extended to a few real
world license agreements. The resulting model can be used for di?erent purposes such as
querying the appropriate licenses for a speciˉc requirement or checking the license terms and
conditions with user requirements. 相似文献
Visual Cryptography (VC) is gaining attraction during the past few years to secure the visual information in the transmission network. It enables the visual data i.e. handwritten notes, photos, printed text, etc. to encrypt in such a way that their decryption can be done through the human visual framework. Hence, no computational assistance is required for the decryption of the secret images they can be seen through naked eye. In this paper, a novel enhanced halftoning-based VC scheme is proposed that works for both binary and color images. Fake share is generated by the combination of random black and white pixels. The proposed algorithm consists of 3 stages i.e., detection, encryption, and decryption. Halftoning, Encryption, (2, 2) visual cryptography and the novel idea of fake share, make it even more secure and improved. As a result, it facilitates the original restored image to the authentic user, however, the one who enters the wrong password gets the combination of fake share with any real share. Both colored and black images can be processed with minimal capacity using the proposed scheme.
Automatic key concept identification from text is the main challenging task in information extraction, information retrieval, digital libraries, ontology learning, and text analysis. The main difficulty lies in the issues with the text data itself, such as noise in text, diversity, scale of data, context dependency and word sense ambiguity. To cope with this challenge, numerous supervised and unsupervised approaches have been devised. The existing topical clustering-based approaches for keyphrase extraction are domain dependent and overlooks semantic similarity between candidate features while extracting the topical phrases. In this paper, a semantic based unsupervised approach (KP-Rank) is proposed for keyphrase extraction. In the proposed approach, we exploited Latent Semantic Analysis (LSA) and clustering techniques and a novel frequency-based algorithm for candidate ranking is introduced which considers locality-based sentence, paragraph and section frequencies. To evaluate the performance of the proposed method, three benchmark datasets (i.e. Inspec, 500N-KPCrowed and SemEval-2010) from different domains are used. The experimental results show that overall, the KP-Rank achieved significant improvements over the existing approaches on the selected performance measures.
