A fuzzy technique to control congestion in WSN

Congestion in wireless sensor networks (WSNs) is a crucial issue. That is due to the relatively high node density and source-to-sink communication pattern. Congestion not only causes packet loss, but also leads to excessive energy consumption as well as delay. Therefore, in order to prolong network lifetime and improve fairness and provide better quality of service, developing a novel solution for congestion estimation and control is important to be considered. To address this problem, we propose a type-2 fuzzy logic based algorithm to detect and control congestion level in WSNs. The proposed algorithm considers local information such as packet loss rate and delay to control congestion in the network. Simulation results show that our protocol performs better than a recently developed protocol in prolonging network lifetime as well as decreasing packet loss.

Face recognition from face motion manifolds using robust kernel resistor-average distance

In this work we consider face recognition from face motion manifolds. An information-theoretic approach with Resistor-Average Distance (RAD) as a dissimilarity measure between distributions of face images is proposed. We introduce a kernel-based algorithm that retains the simplicity of the closed-form expression for the RAD between two normal distributions, while allowing for modelling of complex, nonlinear manifolds. Additionally, it is shown how errors in the face registration process can be modelled to significantly improve recognition. Recognition performance of our method is experimentally demonstrated and shown to outperform state-of-the-art algorithms. Recognition rates of 97–100% are consistently achieved on databases of 35– 90 people.

An information-theoretic approach to face recognition from face motion manifolds

In this work, we consider face recognition from face motion manifolds (FMMs). The use of the resistor-average distance (RAD) as a dissimilarity measure between densities confined to FMMs is motivated in the proposed information-theoretic approach to modelling face appearance. We introduce a kernel-based algorithm that makes use of the simplicity of the closed-form expression for RAD between two Gaussian densities, while allowing for modelling of complex and nonlinear, but intrinsically low-dimensional manifolds. Additionally, it is shown how geodesically local FMM structure can be modelled, naturally leading to a stochastic algorithm for generalizing to unseen modes of data variation. Recognition performance of our method is demonstrated experimentally and is shown to exceed that of state-of-the-art algorithms. Recognition rate of 98% was achieved on a database of 100 people under varying illumination

Full-order observer design for nonlinear complex large-scale systems with unknown time-varying delayed interactions

This article is concerned with the problem of state observer for complex large-scale systems with unknown time-varying delayed interactions. The class of large-scale interconnected systems under consideration is subjected to interval time-varying delays and nonlinear perturbations. By introducing a set of argumented Lyapunov–Krasovskii functionals and using a new bounding estimation technique, novel delay-dependent conditions for existence of state observers with guaranteed exponential stability are derived in terms of linear matrix inequalities (LMIs). In our design approach, the set of full-order Luenberger-type state observers are systematically derived via the use of an efficient LMI-based algorithm. Numerical examples are given to illustrate the effectiveness of the result

Joint resource allocation for max-min throughput in multicell networks

We investigate the resource-allocation problem in multicell networks targeting the max-min throughput of all cells. A joint optimization over power control, channel allocation, and user association is considered, and the problem is then formulated as a nonconvex mixed-integer nonlinear problem (MINLP). To solve this problem, we proposed an alternating-optimization-based algorithm, which applies branch-and-bound and simulated annealing in solving subproblems at each optimization step. We also demonstrate the convergence and efficiency of the proposed algorithms by thorough numerical experiments. The experimental results show that joint optimization over all resources outperforms the restricted optimization over individual resources significantly.

Mining allocating patterns in one-sum weighted items

An Association Rule (AR) is a common knowledge model in data mining that describes an implicative cooccurring relationship between two disjoint sets of binary-valued transaction database attributes (items), expressed in the form of an "antecedent⇒ consequent" rule. A variant of the AR is the Weighted Association Rule (WAR). With regard to a marketing context, this paper introduces a new knowledge model in data mining -ALlocating Pattern (ALP). An ALP is a special form of WAR, where each rule item is associated with a weighting score between 0 and 1, and the sum of all rule item scores is 1. It can not only indicate the implicative co-occurring relationship between two (disjoint) sets of items in a weighted setting, but also inform the "allocating" relationship among rule items. ALPs can be demonstrated to be applicable in marketing and possibly a surprising variety of other areas. We further propose an Apriori based algorithm to extract hidden and interesting ALPs from a "one-sum" weighted transaction database. The experimental results show the effectiveness of the proposed algorithm. © 2008 IEEE.

An effortless hybrid method to solve economic load dispatch problem in power systems

This paper proposes a new approach and coding scheme for solving economic dispatch problems (ED) in power systems through an effortless hybrid method (EHM). This novel coding scheme can effectively prevent futile searching and also prevents obtaining infeasible solutions through the application of stochastic search methods, consequently dramatically improves search efficiency and solution quality. The dominant constraint of an economic dispatch problem is power balance. The operational constraints, such as generation limitations, ramp rate limits, prohibited operating zones (POZ), network loss are considered for practical operation. Firstly, in the EHM procedure, the output of generator is obtained with a lambda iteration method and without considering POZ and later in a genetic based algorithm this constraint is satisfied. To demonstrate its efficiency, feasibility and fastness, the EHM algorithm was applied to solve constrained ED problems of power systems with 6 and 15 units. The simulation results obtained from the EHM were compared to those achieved from previous literature in terms of solution quality and computational efficiency. Results reveal that the superiority of this method in both aspects of financial and CPU time. (C) 2011 Elsevier Ltd. All rights reserved.

Uma investigação de algoritmos exatos e metaheurísticos aplicados ao nonograma

Nonogram is a logical puzzle whose associated decision problem is NP-complete. It has applications in pattern recognition problems and data compression, among others. The puzzle consists in determining an assignment of colors to pixels distributed in a N  M matrix that satisfies line and column constraints. A Nonogram is encoded by a vector whose elements specify the number of pixels in each row and column of a figure without specifying their coordinates. This work presents exact and heuristic approaches to solve Nonograms. The depth first search was one of the chosen exact approaches because it is a typical example of brute search algorithm that is easy to implement. Another implemented exact approach was based on the Las Vegas algorithm, so that we intend to investigate whether the randomness introduce by the Las Vegas-based algorithm would be an advantage over the depth first search. The Nonogram is also transformed into a Constraint Satisfaction Problem. Three heuristics approaches are proposed: a Tabu Search and two memetic algorithms. A new function to calculate the objective function is proposed. The approaches are applied on 234 instances, the size of the instances ranging from 5 x 5 to 100 x 100 size, and including logical and random Nonograms

Synchronization of the unified chaotic system and application in secure communication

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Photon-induced multiple particle emissions of Zr90 and natZr from 10 to 140 MeV

A comprehensive analysis of electrodisintegration yields of protons on Zr90 is proposed taking into account the giant dipole resonance, isovector giant quadrupole resonance (IVGQR), and quasideuteron contributions to the total photoabsorption cross section from 10 to 140 MeV. The calculation applies the MCMC intranuclear cascade to address the direct and pre-equilibrium emissions and another Monte Carlo-based algorithm to describe the evaporation step. The final results of the total photoabsorption cross section for Zr90 and relevant decay channels are obtained by fitting the (e,p) measurements from the National Bureau of Standards and show that multiple proton emissions dominate the photonuclear reactions at higher energies. These results provide a consistent explanation for the exotic and steady increase of the (e,p) yield and also a strong evidence of a IVGQR with a strength parameter compatible with the E2 energy-weighted sum rule. The inclusive photoneutron cross sections for Zr90 and natZr, derived from these results and normalized with the (e,p) data, are in agreement within 10% with both Livermore and Saclay data up to 140 MeV. © 2007 The American Physical Society.

Multiple particle and cluster emissions from Zr following intermediate energies photo absorption

A new approach based on a N-a cluster photoabsorption model is proposed for the understanding of the puzzling steady increase behavior of the 90Zr (e, α) yield measured at the National Bureau of Standards (NBS) within the Giant Dipole Resonance and quasideuteron energy range. The calculation takes into account the pre-equilibrium emissions of protons, neutrons and alpha particles in the framework of an extended version of the multicollisional intranuclear cascade model (MCMC). Another Monte Carlo based algorithm describes the statistical decay of the compound nucleus in terms of the competition between particle evaporation (p, n, d, α, 3He and t) and nuclear fission. The results reproduce quite successfully the 90Zr (e,α) yield, suggesting that emissions of a particles are essential for the interpretation of the exotic increase of the cross sections.

Optimization of query results in peer-to-peer database supported by semantics

The development of new technologies that use peer-to-peer networks grows every day, with the object to supply the need of sharing information, resources and services of databases around the world. Among them are the peer-to-peer databases that take advantage of peer-to-peer networks to manage distributed knowledge bases, allowing the sharing of information semantically related but syntactically heterogeneous. However, it is a challenge to ensure the efficient search for information without compromising the autonomy of each node and network flexibility, given the structural characteristics of these networks. On the other hand, some studies propose the use of ontology semantics by assigning standardized categorization of information. The main original contribution of this work is the approach of this problem with a proposal for optimization of queries supported by the Ant Colony algorithm and classification though ontologies. The results show that this strategy enables the semantic support to the searches in peer-to-peer databases, aiming to expand the results without compromising network performance. © 2011 IEEE.

Optimum-Path Forest pruning parameter estimation through Harmony Search

Pattern recognition in large amount of data has been paramount in the last decade, since that is not straightforward to design interactive and real time classification systems. Very recently, the Optimum-Path Forest classifier was proposed to overcome such limitations, together with its training set pruning algorithm, which requires a parameter that has been empirically set up to date. In this paper, we propose a Harmony Search-based algorithm that can find near optimal values for that. The experimental results have showed that our algorithm is able to find proper values for the OPF pruning algorithm parameter. © 2011 IEEE.

Particle swarm optimization aplicada ao planejamento da expansão de sistemas de transmissão

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

Constrained least square pre-distortion scheme for multiuser ultra-wideband

The study proposes a constrained least square (CLS) pre-distortion scheme for multiple-input single-output (MISO) multiple access ultra-wideband (UWB) systems. In such a scheme, a simple objective function is defined, which can be efficiently solved by a gradient-based algorithm. For the performance evaluation, scenarios CM1 and CM3 of the IEEE 802.15.3a channel model are considered. Results show that the CLS algorithm has a fast convergence and a good trade-off between intersymbol interference (ISI) and multiple access interference (MAI) reduction and signal-to-noise ratio (SNR) preservation, performing better than time-reversal (TR) pre-distortion.