M-Dimension : multi-characteristics based routing protocol in human associated delay-tolerant networks with improved performance over one dimensional classic models

Human associated delay-tolerant network (HDTN) is a new delay-tolerant network where mobile devices are associated with humans. It can be viewed from both their geographic and social dimensions. The combination of these different dimensions can enable us to more accurately comprehend a delay-tolerant network and consequently use this multi-dimensional information to improve overall network efficiency. Alongside the geographic dimension of the network which is concerned with geographic topology of routing, social dimensions such as social hierarchy can be used to guide the routing message to improve not only the routing efficiency for individual nodes, but also efficiency for the entire network.

We propose a multi-dimensional routing protocol (M-Dimension) for the human associated delay-tolerant network which uses the local information derived from multiple dimensions to identify a mobile node more accurately. Each dimension has a weight factor and is organized by the Distance Function to select an intermediary and applies multi-cast routing. We compare M-Dimension to existing benchmark routing protocols using the MIT Reality Dataset, a well-known benchmark dataset based on a human associated mobile network trace file. The results of our simulations show that M-Dimension has a significant increase in the average success ratio and is very competitive when End-to-End Delay of packet delivery is used in comparison to other multi-cast DTN routing protocols.

Faster and parameter-free discord search in quasi-periodic time series

Time series discord has proven to be a useful concept for time-series anomaly identification. To search for discords, various algorithms have been developed. Most of these algorithms rely on pre-building an index (such as a trie) for subsequences. Users of these algorithms are typically required to choose optimal values for word-length and/or alphabet-size parameters of the index, which are not intuitive. In this paper, we propose an algorithm to directly search for the top-K discords, without the requirement of building an index or tuning external parameters. The algorithm exploits quasi-periodicity present in many time series. For quasi-periodic time series, the algorithm gains significant speedup by reducing the number of calls to the distance function.

Previsão do índice bovespa por meio de redes neurais artificiais: uma análise comparada aos métodos tradicionais de séries de tempo

Forecast is the basis for making strategic, tactical and operational business decisions. In financial economics, several techniques have been used to predict the behavior of assets over the past decades.Thus, there are several methods to assist in the task of time series forecasting, however, conventional modeling techniques such as statistical models and those based on theoretical mathematical models have produced unsatisfactory predictions, increasing the number of studies in more advanced methods of prediction. Among these, the Artificial Neural Networks (ANN) are a relatively new and promising method for predicting business that shows a technique that has caused much interest in the financial environment and has been used successfully in a wide variety of financial modeling systems applications, in many cases proving its superiority over the statistical models ARIMA-GARCH. In this context, this study aimed to examine whether the ANNs are a more appropriate method for predicting the behavior of Indices in Capital Markets than the traditional methods of time series analysis. For this purpose we developed an quantitative study, from financial economic indices, and developed two models of RNA-type feedfoward supervised learning, whose structures consisted of 20 data in the input layer, 90 neurons in one hidden layer and one given as the output layer (Ibovespa). These models used backpropagation, an input activation function based on the tangent sigmoid and a linear output function. Since the aim of analyzing the adherence of the Method of Artificial Neural Networks to carry out predictions of the Ibovespa, we chose to perform this analysis by comparing results between this and Time Series Predictive Model GARCH, developing a GARCH model (1.1).Once applied both methods (ANN and GARCH) we conducted the results' analysis by comparing the results of the forecast with the historical data and by studying the forecast errors by the MSE, RMSE, MAE, Standard Deviation, the Theil's U and forecasting encompassing tests. It was found that the models developed by means of ANNs had lower MSE, RMSE and MAE than the GARCH (1,1) model and Theil U test indicated that the three models have smaller errors than those of a naïve forecast. Although the ANN based on returns have lower precision indicator values than those of ANN based on prices, the forecast encompassing test rejected the hypothesis that this model is better than that, indicating that the ANN models have a similar level of accuracy . It was concluded that for the data series studied the ANN models show a more appropriate Ibovespa forecasting than the traditional models of time series, represented by the GARCH model

Swarm-based descriptor combination and its application for image classification

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Estudos de técnicas de reinicialização em métodos level-set e suas aplicações em escoamentos bifásicos

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

Exercise training normalizes an increased neuronal excitability of NTS-projecting neurons of the hypothalamic paraventricular nucleus in hypertensive rats

Stern JE, Sonner PM, Son SJ, Silva FC, Jackson K, Michelini LC. Exercise training normalizes an increased neuronal excitability of NTS-projecting neurons of the hypothalamic paraventricular nucleus in hypertensive rats. J Neurophysiol 107: 2912-2921, 2012. First published February 22, 2012; doi:10.1152/jn.00884.2011.-Elevated sympathetic outflow and altered autonomic reflexes, including impaired baroreflex function, are common findings observed in hypertensive disorders. Although a growing body of evidence supports a contribution of preautonomic neurons in the hypothalamic paraventricular nucleus (PVN) to altered autonomic control during hypertension, the precise underlying mechanisms remain unknown. Here, we aimed to determine whether the intrinsic excitability and repetitive firing properties of preautonomic PVN neurons that innervate the nucleus tractus solitarii (PVN-NTS neurons) were altered in spontaneously hypertensive rats (SHR). Moreover, given that exercise training is known to improve and/or correct autonomic deficits in hypertensive conditions, we evaluated whether exercise is an efficient behavioral approach to correct altered neuronal excitability in hypertensive rats. Patch-clamp recordings were obtained from retrogradely labeled PVN-NTS neurons in hypothalamic slices obtained from sedentary (S) and trained (T) Wistar-Kyoto (WKY) and SHR rats. Our results indicate an increased excitability of PVN-NTS neurons in SHR-S rats, reflected by an enhanced input-output function in response to depolarizing stimuli, a hyperpolarizing shift in Na+ spike threshold, and smaller hyperpolarizing afterpotentials. Importantly, we found exercise training in SHR rats to restore all these parameters back to those levels observed in WKY-S rats. In several cases, exercise evoked opposing effects in WKY-S rats compared with SHR-S rats, suggesting that exercise effects on PVN-NTS neurons are state dependent. Taken together, our results suggest that elevated preautonomic PVN-NTS neuronal excitability may contribute to altered autonomic control in SHR rats and that exercise training efficiently corrects these abnormalities.

PRoSPer: perceptual similarity queries in medical CBIR systems through user profiles

In this paper, we present a novel approach to perform similarity queries over medical images, maintaining the semantics of a given query posted by the user. Content-based image retrieval systems relying on relevance feedback techniques usually request the users to label relevant/irrelevant images. Thus, we present a highly effective strategy to survey user profiles, taking advantage of such labeling to implicitly gather the user perceptual similarity. The profiles maintain the settings desired for each user, allowing tuning of the similarity assessment, which encompasses the dynamic change of the distance function employed through an interactive process. Experiments on medical images show that the method is effective and can improve the decision making process during analysis.

Estudio comparativo de medidas de distancia para histogramas en problemas de reidentificación

Máster Universitario en Sistemas Inteligentes y Aplicaciones Numéricas en Ingeniería (SIANI)

Efficiency in Managing the Environment and the Opportunity Cost of Pollution Abatement

Using the directional distance function we study a cross section of 110 countries to examine the efficiency of management of the tradeoffs between pollution and income. The DEA model is reformulated to permit 'reverse disposability' of the bad output. Further, we interpret the optimal solution of the multiplier form of the DEA model as an iso-inefficiency line. This permits us to measure the shadow cost of the bad output for a country that is in the interior, rather than on the frontier of the production possibilities set. We also compare the relative environmental performance of countries in terms of emission intensity adjusted for technical efficiency. Only 10% of the countries are found to be on the frontier. Also, there is considerable inter-country variation in the imputed opportunity cost of CO2 reduction. Further, differences in technical efficiency contribute substantially to differences in the observed levels of CO2 intensity.

Multiple Hashing Integration for Real-Time Large Scale Part-to-Part Video Matching

A real-time large scale part-to-part video matching algorithm, based on the cross correlation of the intensity of motion curves, is proposed with a view to originality recognition, video database cleansing, copyright enforcement, video tagging or video result re-ranking. Moreover, it is suggested how the most representative hashes and distance functions - strada, discrete cosine transformation, Marr-Hildreth and radial - should be integrated in order for the matching algorithm to be invariant against blur, compression and rotation distortions: (R; _) 2 [1; 20]_[1; 8], from 512_512 to 32_32pixels2 and from 10 to 180_. The DCT hash is invariant against blur and compression up to 64x64 pixels2. Nevertheless, although its performance against rotation is the best, with a success up to 70%, it should be combined with the Marr-Hildreth distance function. With the latter, the image selected by the DCT hash should be at a distance lower than 1.15 times the Marr-Hildreth minimum distance.

An adaptive algorithm for clustering cumulative probability distribution functions using the Kolmogorov–Smirnov two-sample test

This paper proposes an adaptive algorithm for clustering cumulative probability distribution functions (c.p.d.f.) of a continuous random variable, observed in different populations, into the minimum homogeneous clusters, making no parametric assumptions about the c.p.d.f.’s. The distance function for clustering c.p.d.f.’s that is proposed is based on the Kolmogorov–Smirnov two sample statistic. This test is able to detect differences in position, dispersion or shape of the c.p.d.f.’s. In our context, this statistic allows us to cluster the recorded data with a homogeneity criterion based on the whole distribution of each data set, and to decide whether it is necessary to add more clusters or not. In this sense, the proposed algorithm is adaptive as it automatically increases the number of clusters only as necessary; therefore, there is no need to fix in advance the number of clusters. The output of the algorithm are the common c.p.d.f. of all observed data in the cluster (the centroid) and, for each cluster, the Kolmogorov–Smirnov statistic between the centroid and the most distant c.p.d.f. The proposed algorithm has been used for a large data set of solar global irradiation spectra distributions. The results obtained enable to reduce all the information of more than 270,000 c.p.d.f.’s in only 6 different clusters that correspond to 6 different c.p.d.f.’s.

Modelling the conversion of Colombian lowland ecosystems since 1940: Drivers, patterns and rates

In biologically mega-diverse countries that are undergoing rapid human landscape transformation, it is important to understand and model the patterns of land cover change. This problem is particularly acute in Colombia, where lowland forests are being rapidly cleared for cropping and ranching. We apply a conceptual model with a nested set of a priori predictions to analyse the spatial and temporal patterns of land cover change for six 50-100 km(2) case study areas in lowland ecosystems of Colombia. Our analysis included soil fertility, a cost-distance function, and neighbourhood of forest and secondary vegetation cover as independent variables. Deforestation and forest regrowth are tested using logistic regression analysis and an information criterion approach to rank the models and predictor variables. The results show that: (a) overall the process of deforestation is better predicted by the full model containing all variables, while for regrowth the model containing only the auto-correlated neighbourhood terms is a better predictor; (b) overall consistent patterns emerge, although there are variations across regions and time; and (c) during the transformation process, both the order of importance and significance of the drivers change. Forest cover follows a consistent logistic decline pattern across regions, with introduced pastures being the major replacement land cover type. Forest stabilizes at 2-10% of the original cover, with an average patch size of 15.4 (+/- 9.2) ha. We discuss the implications of the observed patterns and rates of land cover change for conservation planning in countries with high rates of deforestation. (c) 2005 Elsevier Ltd. All rights reserved.

Malmquist-type indices in the presence of negative data:an application to bank branches

In this paper we develop an index and an indicator of productivity change that can be used with negative data. For that purpose the range directional model (RDM), a particular case of the directional distance function, is used for computing efficiency in the presence of negative data. We use RDM efficiency measures to arrive at a Malmquist-type index, which can reflect productivity change, and we use RDM inefficiency measures to arrive at a Luenberger productivity indicator, and relate the two. The productivity index and indicator are developed relative to a fixed meta-technology and so they are referred to as a meta-Malmquist index and meta-Luenberger indicator. We also address the fact that VRS technologies are used for computing the productivity index and indicator (a requirement under negative data), which raises issues relating to the interpretability of the index. We illustrate how the meta-Malmquist index can be used, not only for comparing the performance of a unit in two time periods, but also for comparing the performance of two different units at the same or different time periods. The proposed approach is then applied to a sample of bank branches where negative data were involved. The paper shows how the approach yields information from a variety of perspectives on performance which management can use.

Type-2 TOPSIS:a group decision problem when ideal values are not extreme endpoints

In the traditional TOPSIS, the ideal solutions are assumed to be located at the endpoints of the data interval. However, not all performance attributes possess ideal values at the endpoints. We termed performance attributes that have ideal values at extreme points as Type-1 attributes. Type-2 attributes however possess ideal values somewhere within the data interval instead of being at the extreme end points. This provides a preference ranking problem when all attributes are computed and assumed to be of the Type-1 nature. To overcome this issue, we propose a new Fuzzy DEA method for computing the ideal values and distance function of Type-2 attributes in a TOPSIS methodology. Our method allows Type-1 and Type-2 attributes to be included in an evaluation system without compromising the ranking quality. The efficacy of the proposed model is illustrated with a vendor evaluation case for a high-tech investment decision making exercise. A comparison analysis with the traditional TOPSIS is also presented. © 2012 Springer Science+Business Media B.V.

A Partition Metric for Clustering Features Analysis

A new distance function to compare arbitrary partitions is proposed. Clustering of image collections and image segmentation give objects to be matched. Offered metric intends for combination of visual features and metadata analysis to solve a semantic gap between low-level visual features and high-level human concept.