Search

E-health for both chronic patients and wellness persons has recently attracted the interest of researchers and practitioners. The physical vital signs are one of the most important factors used to evaluate individual wellness. The variations of daily vital signs are even significant in analyzing physical health trends that can be applied in self-caring for individuals at home. In this paper, an Intelligent-Mamdani Inference Scheme (IMIS) based on fuzzy markup language (FML) is proposed to define approximate health conditions of the individuals via the blood pressure and the body mass index in out-of-hospital. The IMIS can fuse these vital signs and infer semantic health summary using the constructed fuzzy rules and the knowledge base. The main contributions of the this paper are: (1) to leverage personal vital signs by fuzzy logic technology for self-health management at home; (2) to design the novel scheme in detail for practicability and reproduction. The experimental results show that the scheme is feasible to infer personal health status. An individual can easily recognize self-health trend through semantic sentence generation, which further advances self-health management in out-of-hospital. [ABSTRACT FROM AUTHOR]

Securing information systems and the networks that connect them is paramount in the age of growing incidents of cyber attacks. Invasive and continuous cyber attacks on information systems continue to create a potentially shocking blow to the transmission of information from one end to the other. Wireless networks are often vulnerable to intentional interference physical layer reactive jamming attacks, in which the adversaries effectively and stealthily corrupt the packet by injecting high level of noise thereby keeping the channel busy. Consequently, legitimate traffic gets completely blocked; resulting in packet loss at the receiver side. These jammers cause serious threat to wireless communication and they are difficult to identify. A novel method known as 'Neuro Fuzzy Detachment Scheme' has been proposed to prevent such sophisticated and powerful jamming attack. The key idea is to identify and detach jammers from the network to ensure perspicuous transmission. The proposed detachment scheme operates in three modules. In module one, the past record log files are analyzed to extract the trust values for different traces. Using the extracted trust values, the decision factors are monitored for different runs with the attacker in between the communication range of source and the sink and then the suspicious traces are identified and classified using ANFIS classifier. In module two, to trace abnormality, three reorganizing algorithms have been developed to reorganize the categorized traces. In module three, misbehaving nodes are identified and detached from the network. It is observed through simulation studies that the proposed scheme attains higher throughput and packet delivery ratio while attaining lower delay. [ABSTRACT FROM AUTHOR]

User authentication schemes have been a key research topic in the field of data security for decades. Such schemes are evaluated according to at least two parameters: security and usability. Since a number of secure and usable authentication schemes are available, each institution can select the scheme that is considered to be most appropriate for its security policy. Such a per-site system selection has the following feature: each site has to authorize each user that tries to access its resources. In a world in which users mobility is growing, the feature we have just described forces a huge overhead; both from the site's viewpoint and the users' viewpoint, since each user needs to store different credentials for each site she accesses to.Federated authentication allows users to use their home authentication credentials for gaining access to other institutions services while moving among different institutions. Different federated authentication systems have been designed and implemented. Despite simplified users mobility, one key problem in this area is that, often, different authentication systems do not cooperate or provide a limited interoperability. In this paper we discuss the problem of achieving full interoperability among Federated Identity Management Systems and present, as proof-of-concept, a solution to allow full communication between two federated authentication systems, Shibboleth a de facto standard in this context, and PAPI (Point of Access to Providers of Information). Such a solution leverages an intermediate bridge which joins both federations and features protocols translation during cross-federation Authentication/Authorization (AA) sessions. [ABSTRACT FROM AUTHOR]

We propose an efficient algorithm based on continuous-time Markov chain to compute the availability of network connections protected by shared recovery schemes in optical networks. The shared schemes are widely used to improve the availability without excessively expending network resources. The basic idea consists to share the recovery resources between two or more connections in order to reduce the amount of extra resources. This approach assumes that only a limited number of simultaneous failures that overlaps may happen in the network. In the presence of overlapping failures that affect simultaneously many connections, some may not be recovered, determining a reduction on their availability. The order in which overlapping failures occur is important because the first affected connection will acquire the shared resources, preventing the remaining connections to activate the recovery. The algorithm proposed in this paper significantly simplifies the calculation of the steady-state vector. We show that our approach is computationally more efficient and more accurate than the traditional approach used in the literature. [ABSTRACT FROM AUTHOR]

With the rapid development of network technologies and the continuing growth of the online population, the distribution of streamed media on the Internet has become a cause for concern. In order to securely deliver large-scale message streams, various multicast authentication protocols have been proposed. Recently, Abdellatif et al. proposed a real-time multicast authentication protocol called LAR1. The LAR1 protocol has low computation and communication overheads and uses the erasure code function to deal with the packet loss problem. However, through careful analyses, we find that their scheme cannot resist impersonation attacks on signers and only partially solves the packet loss problem. Moreover, there are still some design weaknesses. Then, we propose a more secure multicast authentication protocol, called IMA, with almost the same computation overheads and lower communication overheads. We adopt the BAN logic to demonstrate the authentication accuracy of our proposed scheme. Comparisons of other related works show that our proposed IMA protocol maintains efficiency and is more secure. Therefore, our proposed protocol is more suitable for practical applications. [ABSTRACT FROM AUTHOR]

The development of a desynchronization invariant audio watermarking scheme without degrading acoustical quality is a challenging work. This paper proposes a robust audio watermarking scheme in Empirical Mode Decomposition (EMD) domain, in which the higher-order statistics and synchronization code are utilized. Firstly, the wavelet de-noising is performed on the original host audio, the de-noised digital audio is segmented, and then each segment is cut into two parts. Secondly, with the spatial watermarking technique, synchronization code is embedded into the statistics average value of audio samples in the first part. Thirdly, for the second part, EMD is performed, and a series of Intrinsic Mode Functions (IMFs) and a residual are given, and then the higher-order statistics of residual are obtained by using the Hausdorff distance. Finally, the digital watermark is embedded into the residual in EMD domain by using the higher-order statistics. Simulation results show that the proposed watermarking scheme is not only inaudible and robust against common signal processing operations such as MP3 compression, noise addition,resampling, and re-quantization etc, but also robust against the desynchronization attacks such as random cropping, amplitude variation, pitch shifting, and jittering etc. [ABSTRACT FROM AUTHOR]

An Unequal Error Protection (UEP) scheme for image steganography is proposed in this paper. When stego images are transmitted through a noisy channel, the embedded message may be more sensitive to noise than the cover message. Therefore, we propose a Turbo UEP coding scheme for steganographic communication in a noisy channel, which provides higher error protection for the embedded message and lower error protection for the cover message. Simulations show that this coding scheme provides different error protection levels in one coding process and maintains the coding rate constant. In addition, an application scheme of the proposed Turbo UEP code for steganographic communication is presented, and the experimental results show that the extracted secret images have better quality than the cover images after decoding. [ABSTRACT FROM AUTHOR]

While users increasingly use such large multimedia data, more people use the cloud computing technology. It is necessary to manage large data in an efficient way, and to consider transmission efficiency for multimedia data of different quality. To this end, an important thing is to ensure efficient distribution of important resources (CPU, network and storage) which constitute cloud computing, and variable distribution algorithms are required therefor. This study proposes a method of designing a scheme for applying MapReduce of the FP-Growth algorithm which is one of data mining methods based on the Hadoop platform at the stage of IaaS (Infrastructure As a Service) including CPU, networking and storages. The method is then for allocating resources with the scheme. [ABSTRACT FROM AUTHOR]

The correctness of logic programs which are constructed by a schema-based method is presented in this paper. This schema-based method constructs typed, moded logic programs by stepwise top-down design using five program schemata, data types and modes. Correctness proofs in this approach are guided by the constructed logic programs. A proof scheme is proposed for each program schema. It is claimed that the structure of a logic program constructed by this schema-based method is reflected in the structure of its correctness proof. The proof schemes which correspond to design schemata are followed in the correctness proofs of logic programs. [ABSTRACT FROM AUTHOR]

Ticket market is a multi-million dollar industry for any popular event. When the tickets are sold by the event organiz-ers in the ticket market, the most popular scheme used is the first-come-first-serve (FCFS). But in a competitive environment is this FCFS efficient? In this paper this situation is investigated from the view point of profit making and efficiency in allocation of the tickets that are being sold. In ticket market multiple customers are handled when each customer has some private value (not known by others) for purchasing a ticket. One tool that has found wide-spread application to address this situation is the framework of mechanism design. In this paper with the use of mechanism design framework some elegant alternative solutions are proposed so that it could outperform the earlier FCFS scheme both from the view point of profit making and efficiency in allocation. [ABSTRACT FROM AUTHOR]

Realizing application systems that match people's expectations and providing adequate network services for various users under various network and platform environments are difficult challenges. To overcome these problems, we have studied application systems based on multiagent systems and design models of multiagent systems. We propose a method to observe and control the behavioral characteristics of multiagent systems to support the design, development, and operation of such systems. More specifically, we propose a Flexible Distributed System and a Behavioral Characteristics Model, and we apply these two models to the design of an actual multimedia communication system and evaluate the effectiveness of the proposed scheme. [ABSTRACT FROM AUTHOR]

The aim of this paper is, in accordance with efficient web search service operation objectives, to propose enhancements to the sophistication of the functionality that can be offered by search engine services. A meta-search third-party result ranking mechanism is proposed, which is capable of adapting over the continuous changes that occur on the web, providing in parallel personalized information acquisition considering the user's navigation behaviour. Transparency is achieved for both personalization and web evolution adaptation mechanisms, requiring virtually none effort from the user's part. In essence, the proposed meta search engine rates, re-organises and combines the results acquired from search services for a specific user information resource request in accordance with a weighted combination of a performance related factor (tightly related to the ranking of the web result as given by the search engine service) and a reliability related factor (corresponding to the user satisfaction stemming from the specific web result that he/she browses), while the performance of each search engine with respect to adequately adapting to the web evolution is taken into account. For the evaluation of the web results reliability, a collaborative reputation mechanism is utilized, which helps estimating their quality and predicting their future usability, taking into account their past performance in consistently satisfying user expectations. A set of results indicative of the efficiency of our proposed scheme is provided. The Internet search services used were Google, MSN and Yahoo! [ABSTRACT FROM AUTHOR]

Graphical password is an authentication means alternative to textual password and biometric password. Graphical passwords are classified into two groups: picture based password and user-drawn based password. To pass the authentication, in the picture based graphical password, users have to choose right photos whereas in the user-drawn based graphical password, users have to draw correct pictures. In this paper, we propose a new user-drawn based graphical password. The proposed scheme requires users to create their secret by selecting individual points or by connecting points into curves from a given set of points. Compared to textual password and existing graphical password such as DAS, our proposed password gives larger memorable password space with sufficiently large number of given points. [ABSTRACT FROM AUTHOR]

Presents the study of the cell loss priority schemes in the Asynchronous Transfer Mode (ATM). Proposal of these schemes; Reference to the affects experienced by such schemes; Information on the Separate Logic Queues with Complete Buffer Sharing (SQCS) schemes.