Dominating set and network coding-based routing in wireless mesh networks

Wireless mesh networks are widely applied in many fields such as industrial controlling, environmental monitoring, and military operations. Network coding is promising technology that can improve the performance of wireless mesh networks. In particular, network coding is suitable for wireless mesh networks as the fixed backbone of wireless mesh is usually unlimited energy. However, coding collision is a severe problem affecting network performance. To avoid this, routing should be effectively designed with an optimum combination of coding opportunity and coding validity. In this paper, we propose a Connected Dominating Set (CDS)-based and Flow-oriented Coding-aware Routing (CFCR) mechanism to actively increase potential coding opportunities. Our work provides two major contributions. First, it effectively deals with the coding collision problem of flows by introducing the information conformation process, which effectively decreases the failure rate of decoding. Secondly, our routing process considers the benefit of CDS and flow coding simultaneously. Through formalized analysis of the routing parameters, CFCR can choose optimized routing with reliable transmission and small cost. Our evaluation shows CFCR has a lower packet loss ratio and higher throughput than existing methods, such as Adaptive Control of Packet Overhead in XOR Network Coding (ACPO), or Distributed Coding-Aware Routing (DCAR).

Robust adaptive backstepping excitation controller design for simple power system models with external disturbances

This paper presents a nonlinear robust adaptive excitation controller design for a simple power system model where a synchronous generator is connected to an infinite bus. The proposed controller is designed to obtain the adaption laws for estimating critical parameters of synchronous generators which are considered as unknown while providing the robustness against the bounded external disturbances. The convergence of different physical quantities of a single machine infinite bus (SMIB) system, with the proposed control scheme, is ensured through the negative definiteness of the derivative of Lyapunov functions. The effects of external disturbances are considered during formulation of Lyapunov function and thus, the proposed excitation controller can ensure the stability of the SMIB system under the variation of critical parameters as well as external disturbances including noises. Finally, the performance of the proposed scheme is investigated with the inclusion of external disturbances in the SMIB system and its superiority is demonstrated through the comparison with an existing robust adaptive excitation controller. Simulation results show that the proposed scheme provides faster responses of physical quantities than the existing controller.

Verifiable auditing for outsourced database in cloud computing

The notion of database outsourcing enables the data owner to delegate the database management to a cloud service provider (CSP) that provides various database services to different users. Recently, plenty of research work has been done on the primitive of outsourced database. However, it seems that no existing solutions can perfectly support the properties of both correctness and completeness for the query results, especially in the case when the dishonest CSP intentionally returns an empty set for the query request of the user. In this paper, we propose a new verifiable auditing scheme for outsourced database, which can simultaneously achieve the correctness and completeness of search results even if the dishonest CSP purposely returns an empty set. Furthermore, we can prove that our construction can achieve the desired security properties even in the encrypted outsourced database. Besides, the proposed scheme can be extended to support the dynamic database setting by incorporating the notion of verifiable database with updates.

Functional observer design with application to pre-compensated multi-variable systems

Partial state estimation of dynamical systems provides significant advantages in practical applications. Likewise, pre-compensator design for multi variable systems invokes considerable increase in the order of the original system. Hence, applying functional observer to pre-compensated systems can result in lower computational costs and more practicability in some applications such as fault diagnosis and output feedback control of these systems. In this note, functional observer design is investigated for pre-compensated systems. A lower order pre-compensator is designed based on a H2 norm optimization that is designed as the solution of a set of linear matrix inequalities (LMIs). Next, a minimum order functional observer is designed for the pre-compensated system. An LTI model of an irreversible chemical reactor is used to demonstrate our design algorithm, and to highlight the benefits of the proposed schemes.

Minimal multi-functional observers for linear systems using a direct approach

The direct approach in designing functional observers was first presented in [1] for estimating a single function of the states of a Linear Time-Invariant (LTI) system. One of the benefits of the direct scheme is that it does not require solving the interconnected Sylvester equations that appear in the other observer design approaches. In the present paper, the direct approach is extended to reconstruct multiple functions of the states in such a way that the minimum possible order of the observer is achieved. The observer is designed so that an asymptotic functional observer can be obtained with arbitrary convergence rate. In the proposed methodology, it is not necessary that a reduced order observer exists for the desired functions to be estimated. To release this limitation, an algorithm is employed to find some auxiliary functions in the minimum required number to be appended to the desired functions. This method assumes that the system is functional observable. This assumption however is less restrictive than the observability and detectability conditions of the system. A numerical example and simulation results explain the efficacy and the benefits of the proposed algorithm.

Construction and aggregation of preference relations based on fuzzy partial orders

In group decision-making problems it is common to elicit preferences from human experts in the form of pairwise preference relations. When this is extended to a fuzzy setting, entries in the pairwise preference matrix are interpreted to denote strength of preference, however once logical properties such as consistency and transitivity are enforced, the resulting preference relation requires almost as much information as providing raw scores or a complete order over the alternatives. Here we instead interpret fuzzy degrees of preference to only apply where the preference over two alternatives is genuinely fuzzy and then suggest an aggregation procedure that minimizes a generalized Kemeny distance to the nearest complete or partial order. By focusing on the fuzzy partial order, the method is less affected by differences in the natural scale over which an expert expresses their preference, and can also limit the influence of extreme scores.

A new fuzzy-based combined prediction interval for wind power forecasting

This paper makes use of the idea of prediction intervals (PIs) to capture the uncertainty associated with wind power generation in power systems. Since the forecasting errors cannot be appropriately modeled using distribution probability functions, here we employ a powerful nonparametric approach called lower upper bound estimation (LUBE) method to construct the PIs. The proposed LUBE method uses a new framework based on a combination of PIs to overcome the performance instability of neural networks (NNs) used in the LUBE method. Also, a new fuzzy-based cost function is proposed with the purpose of having more freedom and flexibility in adjusting NN parameters used for construction of PIs. In comparison with the other cost functions in the literature, this new formulation allows the decision-makers to apply their preferences for satisfying the PI coverage probability and PI normalized average width individually. As the optimization tool, bat algorithm with a new modification is introduced to solve the problem. The feasibility and satisfying performance of the proposed method are examined using datasets taken from different wind farms in Australia.

Linear approximation of Karnik-Mendel type reduction algorithm

Karnik-Mendel (KM) algorithm is the most used and researched type reduction (TR) algorithm in literature. This algorithm is iterative in nature and despite consistent long term effort, no general closed form formula has been found to replace this computationally expensive algorithm. In this research work, we demonstrate that the outcome of KM algorithm can be approximated by simple linear regression techniques. Since most of the applications will have a fixed range of inputs with small scale variations, it is possible to handle those complexities in design phase and build a fuzzy logic system (FLS) with low run time computational burden. This objective can be well served by the application of regression techniques. This work presents an overview of feasibility of regression techniques for design of data-driven type reducers while keeping the uncertainty bound in FLS intact. Simulation results demonstrates the approximation error is less than 2%. Thus our work preserve the essence of Karnik-Mendel algorithm and serves the requirement of low<br />computational complexities.

Effect of different initializations on EKM algorithm

As an integral part of interval type-2 fuzzy logic system (IT2FLS), type reduction (TR) plays a vital role in determining the performance of IT2FLS. Out of many type reduction algorithms, only Karnik-Mendel type TR algorithms capture the essence of interval type-2 fuzzy sets in type reduction. Enhanced Karnik-Mendel (EKM) algorithm is the most commonly used TR algorithm. In this work, we propose three new initializations for EKM algorithm. It is shown they are performing better than EKM and one of the proposed initializations significantly outperforms others. The performance gain can be upto 40% as per comprehensive simulation results demonstrated in this paper. Our findings are justified by computational time savings and iteration requirement for switch point search.

Mass spectrometry-based proteomic data for cancer diagnosis using interval type-2 fuzzy system

An interval type-2 fuzzy logic system is introduced for cancer diagnosis using mass spectrometry-based proteomic data. The fuzzy system is incorporated with a feature extraction procedure that combines wavelet transform and Wilcoxon ranking test. The proposed feature extraction generates feature sets that serve as inputs to the type-2 fuzzy classifier. Uncertainty, noise and outliers that are common in the proteomic data motivate the use of type-2 fuzzy system. Tabu search is applied for structure learning of the fuzzy classifier. Experiments are performed using two benchmark proteomic datasets for the prediction of ovarian and pancreatic cancer. The dominance of the suggested feature extraction as well as type-2 fuzzy classifier against their competing methods is showcased through experimental results. The proposed approach therefore is helpful to clinicians and practitioners as it can be implemented as a medical decision support system in practice.

Switch point finding using polynomial regression for fuzzy type reduction algorithms

Karnik-Mendel (KM) algorithm is the most widely used type reduction (TR) method in literature for the design of interval type-2 fuzzy logic systems (IT2FLS). Its iterative nature for finding left and right switch points is its Achilles heel. Despite a decade of research, none of the alternative TR methods offer uncertainty measures equivalent to KM algorithm. This paper takes a data-driven approach to tackle the computational burden of this algorithm while keeping its key features. We propose a regression method to approximate left and right switch points found by KM algorithm. Approximator only uses the firing intervals, rnles centroids, and FLS strnctural features as inputs. Once training is done, it can precisely approximate the left and right switch points through basic vector multiplications. Comprehensive simulation results demonstrate that the approximation accuracy for a wide variety of FLSs is 100%. Flexibility, ease of implementation, and speed are other features of the proposed method.

Networking for big data

Big data is an emerging hot research topic due to its pervasive application in human society, such as government, climate, finance, and science. Currently, most research work on big data falls in data mining, machine learning, and data analysis. However, these amazing top-level killer applications would not be possible without the underneath support of networking due to their extremely large volume and computing complexity, especially when real-time or near-real-time applications are demanded.

Labeled random finite sets and the bayes multi-target tracking filter

An analytic solution to the multi-target Bayes recursion known as the &delta;-Generalized Labeled Multi-Bernoulli ( &delta;-GLMB) filter has been recently proposed by Vo and Vo in [&ldquo;Labeled Random Finite Sets and Multi-Object Conjugate Priors,&rdquo; IEEE Trans. Signal Process., vol. 61, no. 13, pp. 3460-3475, 2014]. As a sequel to that paper, the present paper details efficient implementations of the &delta;-GLMB multi-target tracking filter. Each iteration of this filter involves an update operation and a prediction operation, both of which result in weighted sums of multi-target exponentials with intractably large number of terms. To truncate these sums, the ranked assignment and K-th shortest path algorithms are used in the update and prediction, respectively, to determine the most significant terms without exhaustively computing all of the terms. In addition, using tools derived from the same framework, such as probability hypothesis density filtering, we present inexpensive (relative to the &delta;-GLMB filter) look-ahead strategies to reduce the number of computations. Characterization of the L1-error in the multi-target density arising from the truncation is presented.

Big data for networking

Big data analytics has shown great potential in optimizing operations, making decisions, spotting business trends, preventing threats, and capitalizing on new sources of revenues in various fields such as manufacturing, healthcare, finance, insurance, and retail. The management of various networks has become inefficient and difficult because of their high complexities and interdependencies. Big data, in forms of device logs, software logs, media content, and sensed data, provide rich information and facilitate a fundamentally different and novel approach to explore, design, and develop reliable and scalable networks. This Special Issue covers the most recent research results that address challenges of big data for networking. We received 45 submissions, and ultimately nine high quality papers, organized into two groups, have been selected for inclusion in this Special Issue.

Uma investigação da influência do parâmetro de barreira na solução do problema de fluxo de potência ótimo

Pós-graduação em Engenharia Elétrica - FEB