A fuzzy queue-aware routing approach for wireless mesh networks

Recent advances in Wireless Mesh Networks (WMNs) have overcome the drawbacks of traditional wired and ad-hoc networks and now they are seen as a means of allowing last mile communications with quality level assurance in Future Multimedia Systems. However, new routing schemes are needed to provide end-to-end Quality of Service (QoS) and Quality of Experience (QoE) support for delay/loss/jitter-sensitive multimedia applications. The well-known OLSR (Optimized Link State Routing) protocol with ETX (Expected Transmission Count) metric brings many benefits to the path selection process, but has a drawback with regard to queue availability management, which reduces the system performance. This problem is caused when OLSR-EXT control messages are exchanged and the queues of mesh routers along the end-to-end communication path are overloaded. As a result, multimedia-related packets will suffer from loss/delay/jitter and the overall system performance will decrease. This paper proposes the Optimized Link State Routing-Fuzzy ETX Queue (OLSR-FEQ) protocol to overcome the limitations of OLSR-ETX regarding queue availability, QoS and QoE assurance. OLSR-FEQ optimizes network and user-based parameters by coordinating queue availability, QoS and fuzzy issues in the routing decision process as a way of allocating the best paths for multimedia applications. Performance evaluations were carried out with the Network Simulator (NS-2.34) to show the benefits of the proposed solution when compared with existing routing schemes, namely OLSR-ETX, OLSR-FLC, OLSR-MD and HWMP (IEEE 802.11s standard), regarding QoS (unsuccessful packet delivery and throughput) and QoE (PSNR, SSIM, VQM and MOS) parameters.     

Modeling of the condyle elements within a biomechanical knee model

The development of a computational multibody knee model able to capture some of the fundamental properties of the human knee articulation is presented. This desideratum is reached by including the kinetics of the real knee articulation. The research question is whether an accurate modeling of the condyle contact in the knee will lead to reproduction of the complex combination of flexion/extension, abduction/adduction, and tibial rotation observed in the real knee. The model is composed by two anatomic segments, the tibia and the femur, whose characteristics are functions of the geometric and anatomic properties of the real bones. The biomechanical model characterization is developed under the framework of multibody systems methodologies using Cartesian coordinates. The type of approach used in the proposed knee model is the joint surface contact conditions between ellipsoids, representing the two femoral condyles, and points, representing the tibial plateau and the menisci. These elements are closely fitted to the actual knee geometry. This task is undertaken by considering a parameter optimization process to replicate experimental data published in the literature, namely that by Lafortune and his coworkers in 1992. Then kinematic data in the form of flexion/extension patterns are imposed on the model corresponding to the stance phase of the human gait. From the results obtained, by performing several computational simulations, it can be observed that the knee model approximates the average secondary motion patterns observed in the literature. Because the literature reports considerable inter-individual differences in the secondary motion patterns, the knee model presented here is also used to check whether it is possible to reproduce the observed differences with reasonable variations of bone shape parameters. This task is accomplished by a parameter study, in which the main variables that define the geometry of condyles are taken into account. It was observed that the data reveal a difference in secondary kinematics of the knee in flexion versus extension. The likely explanation for this fact is the elastic component of the secondary motions created by the combination of joint forces and soft tissue deformations. The proposed knee model is, therefore, used to investigate whether this observed behavior can be explained by reasonable elastic deformations of the points representing the menisci in the model.     

PhotoGeo: a photo digital library with spatial-temporal support and self-annotation

The recent popularity of digital cameras has posed a new problem: how to efficiently store and retrieve the very large number of digital photos captured and chaotically stored in multiple locations without any annotation. This paper proposes an infrastructure, called PhotoGeo, which aims at helping users with the people photo annotation, event photo annotation, storage and retrieval of personal digital photos. To achieve the desired objective, PhotoGeo uses new algorithms that make it possible to annotate photos with the key metadata to facilitate their retrieval, such as: the people who were shown in the photo (who); where it was captured (where); the date and time of capture (when); and the event that was captured. The paper concludes with a detailed evaluation of these algorithms.     

An infrastructure for smart hospitals

In healthcare facilities most of the daily activities require strict coordination between clinicians, who often operate under heavy workloads and minimal workforce conditions in environments filled with increasingly complex technology. Ubiquitous Computing applications constitute a suitable solution for both reducing medical costs and improving patient safety by better supporting clinical processes. In this study we introduce an intelligent infrastructure for smart hospitals which implements basic services to optimize medical staff/patient interactions and grants ubiquitous and transparent access to clinical data stored in standard clinical databases. This infrastructure relies on the integration of Radio Frequency IDentification (RFID) and photosensor technologies to identify, locate and track clinicians and patients equipped with mobile devices and wearable RFID tags.     

A qualitative human-centric evaluation of flexibility in middleware implementations

Today middleware is much more powerful, more reliable and faster than it used to be. Nevertheless, for the application developer, the complexity of using middleware platforms has increased accordingly. The volume and variety of application contexts that current middleware technologies have to support require that developers be able to anticipate the widest possible range of execution environments, desired and undesired effects of different programming strategies, handling procedures for runtime errors, and so on. This paper shows how a generic framework designed to evaluate the usability of notations (the Cognitive Dimensions of Notations Framework, or CDN) has been instantiated and used to analyze the cognitive challenges involved in adapting middleware platforms. This human-centric perspective allowed us to achieve novel results compared to existing middleware evaluation research, typically centered around system performance metrics. The focus of our study is on the process of adapting middleware implementations, rather than in the end product of this activity. Our main contributions are twofold. First, we describe a qualitative CDN-based method to analyze the cognitive effort made by programmers while adapting middleware implementations. And second, we show how two platforms designed for flexibility have been compared, suggesting that certain programming language design features might be particularly helpful for developers.     

Very true operators in effect algebras

We introduce the concept of very true operator on an effect algebra. Although an effect algebra is only partial, we define it in the way which is in accordance with traditional definitions in residuated lattices or basic algebras. This is possible if we require monotonicity as an additional condition. We prove that very true operators on effect algebras can be characterized by means of certain subsets which are conditionally complete.     

Evaluating the influence of multiplexing schemes and buffer implementation on perceived VoIP conversation quality

This work presents a study of RTP multiplexing schemes, which are compared with the normal use of RTP, in terms of experienced quality. Bandwidth saving, latency and packet loss for different options are studied, and some tests of Voice over IP (VoIP) traffic are carried out in order to compare the quality obtained using different implementations of the router buffer. Voice quality is calculated using ITU R-factor, which is a widely accepted quality estimator. The tests show the bandwidth savings of multiplexing, and also the importance of packet size for certain buffers, as latency and packet loss may be affected. The customer’s experience improvement is measured, showing that the use of multiplexing can be interesting in some scenarios, like an enterprise with different offices connected via the Internet. The system is also tested using different numbers of samples per packet, and the distribution of the flows into different tunnels is found to be an important factor in order to achieve an optimal perceived quality for each kind of buffer. Grouping all the flows into a single tunnel will not always be the best solution, as the increase of the number of flows does not improve bandwidth efficiency indefinitely. If the buffer penalizes big packets, it will be better to group the flows into a number of tunnels. The router processing capacity has to be taken into account too, as the limit of packets per second it can manage must not be exceeded. The obtained results show that multiplexing is a good way to improve customer’s experience of VoIP in scenarios where many RTP flows share the same path.     

How landscape ruggedness influences the performance of real-coded algorithms: a comparative study

Ruggedness has a strong influence on the performance of algorithms, but it has been barely studied in real-coded optimization, mainly because of the difficulty of isolating it from a number of involved topological properties. In this paper, we propose a framework consisting of increasing ruggedness function sets built by a mechanism which generates multiple funnels. This mechanism introduces different levels of sinusoidal distortion which can be controlled to isolate the singular influence of some related features. Some commonly used measures of ruggedness have been applied to analyze these sets of functions, and a numerical study to compare the performance of some representative algorithms has been carried out. The results confirm that ruggedness has an influence on the performance of the algorithm, proving that it depends on the multi-funnel structure and peak features, such as height and relative size of the global peak, and not on the number of peaks.     

Missing data imputation for fuzzy rule-based classification systems

Fuzzy rule-based classification systems (FRBCSs) are known due to their ability to treat with low quality data and obtain good results in these scenarios. However, their application in problems with missing data are uncommon while in real-life data, information is frequently incomplete in data mining, caused by the presence of missing values in attributes. Several schemes have been studied to overcome the drawbacks produced by missing values in data mining tasks; one of the most well known is based on preprocessing, formerly known as imputation. In this work, we focus on FRBCSs considering 14 different approaches to missing attribute values treatment that are presented and analyzed. The analysis involves three different methods, in which we distinguish between Mamdani and TSK models. From the obtained results, the convenience of using imputation methods for FRBCSs with missing values is stated. The analysis suggests that each type behaves differently while the use of determined missing values imputation methods could improve the accuracy obtained for these methods. Thus, the use of particular imputation methods conditioned to the type of FRBCSs is required.     

Mining fuzzy association rules from low-quality data

Data mining is most commonly used in attempts to induce association rules from databases which can help decision-makers easily analyze the data and make good decisions regarding the domains concerned. Different studies have proposed methods for mining association rules from databases with crisp values. However, the data in many real-world applications have a certain degree of imprecision. In this paper we address this problem, and propose a new data-mining algorithm for extracting interesting knowledge from databases with imprecise data. The proposed algorithm integrates imprecise data concepts and the fuzzy apriori mining algorithm to find interesting fuzzy association rules in given databases. Experiments for diagnosing dyslexia in early childhood were made to verify the performance of the proposed algorithm.