Variable Structure Control with chattering elimination and guaranteed stability for a generalized T-S model

In this paper, a fuzzy based Variable Structure Control (VSC) with guaranteed stability is presented. The main objective is to obtain an improved performance of highly non-linear unstable systems. The main contribution of this work is that, firstly, new functions for chattering reduction and error convergence without sacrificing invariant properties are proposed, which is considered the main drawback of the VSC control. Secondly, the global stability of the controlled system is guaranteed.The well known weighting parameters approach, is used in this paper to optimize local and global approximation and modeling capability of T-S fuzzy model.A one link robot is chosen as a nonlinear unstable system to evaluate the robustness, effectiveness and remarkable performance of optimization approach and the high accuracy obtained in approximating nonlinear systems in comparison with the original T-S model. Simulation results indicate the potential and generality of the algorithm. The application of the proposed FLC-VSC shows that both alleviation of chattering and robust performance are achieved with the proposed FLC-VSC controller. The effectiveness of the proposed controller is proven infront of disturbances and noise effects.     

On the security of public key cryptosystems with a double decryption mechanism

In public key encryption schemes with a double decryption mechanism (DD-PKE), decryption can be done in either of two ways: by the user owning the secret/public key pair corresponding to the ciphertext, or by a trusted party holding a sort of master secret-key. In this note we argue that the classical security notion for standard public key encryption schemes does not suffice for DD-PKE schemes, and propose a new natural definition. Additionally, we illustrate the usefulness of the new security definition by showing that a DD-PKE scheme presented in the workshop Selected Areas in Cryptography 2005 is insecure under this augmented security notion.     

Segmented software cost estimation models based on fuzzy clustering

Parametric software cost estimation models are based on mathematical relations, obtained from the study of historical software projects databases, that intend to be useful to estimate the effort and time required to develop a software product. Those databases often integrate data coming from projects of a heterogeneous nature. This entails that it is difficult to obtain a reasonably reliable single parametric model for the range of diverging project sizes and characteristics. A solution proposed elsewhere for that problem was the use of segmented models in which several models combined into a single one contribute to the estimates depending on the concrete characteristic of the inputs. However, a second problem arises with the use of segmented models, since the belonging of concrete projects to segments or clusters is subject to a degree of fuzziness, i.e. a given project can be considered to belong to several segments with different degrees.This paper reports the first exploration of a possible solution for both problems together, using a segmented model based on fuzzy clusters of the project space. The use of fuzzy clustering allows obtaining different mathematical models for each cluster and also allows the items of a project database to contribute to more than one cluster, while preserving constant time execution of the estimation process. The results of an evaluation of a concrete model using the ISBSG 8 project database are reported, yielding better figures of adjustment than its crisp counterpart.     

Multicriteria decisions on interdependent infrastructure transportation projects using an evolutionary-based framework

When evaluating transportation infrastructure projects and determining which of them will be carried out from a set of projects and given a budget constraint, several criteria need to be considered in the decision. Standard evaluation practices imply the aggregation of impacts into one utility function which is later optimized. Nevertheless these techniques used for translation of different measuring units into monetary terms are highly controversial. Multicriteria techniques can explicitly deal with different measuring units, however, they are not suitable to model interdependence relationships of projects that share a common characteristic (same route, location or target population, for instance). In this research we model this transportation planning problem, the multi-objective transportation infrastructure project selection problem (MTIPSP), as a constrained multi-objective optimization problem with quadratic objective functions, using a variation of the multi-objective 0–1 knapsack problem plus some additional constraints. Given the combinatorial nature of the problem, an evolutionary-based framework is used for the identification of Pareto solutions, and later, those with non-attractive properties are filtered using a Knee Identification Procedure. The final selection of the projects portfolio is made using a well known multicriteria decision aid method and including the decision makers’ preferences based on the existing context.     

Inductively coupled probe for the measurement of partial discharges

Partial discharges are a transient phenomena whose measurement is remarkably important for electrical equipment diagnosis and maintenance. These discharges appear in the measurement circuit as very narrow current pulses of some nanoseconds. Therefore, discharge pulse detection is a particularly difficult problem, especially because they are superposed on the high voltage waveforms that cause them. In this paper, we present an inductively coupled probe able to measure this physical phenomenon by means of a very simple and inexpensive device that can be installed in the equipment under test. After modeling the probe, its response will be compared to that of commercial devices using both calibrated discharges and partial discharges occurring at real power.     

A logical approach to efficient Max-SAT solving

Weighted Max-SAT is the optimization version of SAT and many important problems can be naturally encoded as such. Solving weighted Max-SAT is an important problem from both a theoretical and a practical point of view. In recent years, there has been considerable interest in finding efficient solving techniques. Most of this work focuses on the computation of good quality lower bounds to be used within a branch and bound DPLL-like algorithm. Most often, these lower bounds are described in a procedural way. Because of that, it is difficult to realize the logic that is behind.In this paper we introduce an original framework for Max-SAT that stresses the parallelism with classical SAT. Then, we extend the two basic SAT solving techniques: search and inference. We show that many algorithmic tricks used in state-of-the-art Max-SAT solvers are easily expressible in logical terms in a unified manner, using our framework.We also introduce an original search algorithm that performs a restricted amount of weighted resolution at each visited node. We empirically compare our algorithm with a variety of solving alternatives on several benchmarks. Our experiments, which constitute to the best of our knowledge the most comprehensive Max-SAT evaluation ever reported, demonstrate the practical usability of our approach.     

New approach for optimizing the interpretation and representation of the degree of historical-archaeological evidence in the virtual reconstructions

Virtual Reality - Virtual reconstruction is defined as the visual recovery of a building or object through the creation of a three-dimensional model of the asset to be reconstructed, in a...     

Weighting Efficient Accuracy and Minimum Sensitivity for Evolving Multi-Class Classifiers

Recently, a multi-objective Sensitivity–Accuracy based methodology has been proposed for building classifiers for multi-class problems. This technique is especially suitable for imbalanced and multi-class datasets. Moreover, the high computational cost of multi-objective approaches is well known so more efficient alternatives must be explored. This paper presents an efficient alternative to the Pareto based solution when considering both Minimum Sensitivity and Accuracy in multi-class classifiers. Alternatives are implemented by extending the Evolutionary Extreme Learning Machine algorithm for training artificial neural networks. Experiments were performed to select the best option after considering alternative proposals and related methods. Based on the experiments, this methodology is competitive in Accuracy, Minimum Sensitivity and efficiency.     

Angle-of-arrival localization based on antenna arrays for wireless sensor networks

Among the large number of contributions concerning the localization techniques for wireless sensor networks (WSNs), there is still no simple, energy and cost efficient solution suitable in outdoor scenarios. In this paper, a technique based on antenna arrays and angle-of-arrival (AoA) measurements is carefully discussed. While the AoA algorithms are rarely considered for WSNs due to the large dimensions of directional antennas, some system configurations are investigated that can be easily incorporated in pocket-size wireless devices.A heuristic weighting function that enables decreasing the location errors is introduced. Also, the detailed performance analysis of the presented system is provided. The localization accuracy is validated through realistic Monte-Carlo simulations that take into account the specificity of propagation conditions in WSNs as well as the radio noise effects. Finally, trade-offs between the accuracy, localization time and the number of anchors in a network are addressed.     

Unsupervised WSD by Finding the Predominant Sense Using Context as a Dynamic Thesaurus

We present and analyze an unsupervised method for Word Sense Disambiguation (WSD). Our work is based on the method presented by McCarthy et al. in 2004 for finding the predominant sense of each word in the entire corpus. Their maximization algorithm allows weighted terms (similar words) from a distributional thesaurus to accumulate a score for each ambiguous word sense, i.e., the sense with the highest score is chosen based on votes from a weighted list of terms related to the ambiguous word. This list is obtained using the distributional similarity method proposed by Lin Dekang to obtain a thesaurus. In the method of McCarthy et al., every occurrence of the ambiguous word uses the same thesaurus, regardless of the context where the ambiguous word occurs. Our method accounts for the context of a word when determining the sense of an ambiguous word by building the list of distributed similar words based on the syntactic context of the ambiguous word. We obtain a top precision of 77.54% of accuracy versus 67.10% of the original method tested on SemCor. We also analyze the effect of the number of weighted terms in the tasks of finding the Most Frecuent Sense (MFS) and WSD, and experiment with several corpora for building the Word Space Model.