Slicing the metric space to provide quick indexing of complex data in the main memory

Searching in a dataset for elements that are similar to a given query element is a core problem in applications that manage complex data, and has been aided by metric access methods (MAMs). A growing number of applications require indices that must be built faster and repeatedly, also providing faster response for similarity queries. The increase in the main memory capacity and its lowering costs also motivate using memory-based MAMs. In this paper. we propose the Onion-tree, a new and robust dynamic memory-based MAM that slices the metric space into disjoint subspaces to provide quick indexing of complex data. It introduces three major characteristics: (i) a partitioning method that controls the number of disjoint subspaces generated at each node; (ii) a replacement technique that can change the leaf node pivots in insertion operations; and (iii) range and k-NN extended query algorithms to support the new partitioning method, including a new visit order of the subspaces in k-NN queries. Performance tests with both real-world and synthetic datasets showed that the Onion-tree is very compact. Comparisons of the Onion-tree with the MM-tree and a memory-based version of the Slim-tree showed that the Onion-tree was always faster to build the index. The experiments also showed that the Onion-tree significantly improved range and k-NN query processing performance and was the most efficient MAM, followed by the MM-tree, which in turn outperformed the Slim-tree in almost all the tests. (C) 2010 Elsevier B.V. All rights reserved.

Nonexistence of global solutions for a class of complex vector fields on two-torus

The goal of this paper is study the global solvability of a class of complex vector fields of the special form L = partial derivative/partial derivative t + (a + ib)(x)partial derivative/partial derivative x, a, b epsilon C(infinity) (S(1) ; R), defined on two-torus T(2) congruent to R(2)/2 pi Z(2). The kernel of transpose operator L is described and the solvability near the characteristic set is also studied. (c) 2008 Elsevier Inc. All rights reserved.

MODELING THE EVOLUTION OF COMPLEX NETWORKS THROUGH THE PATH-STAR TRANSFORMATION AND OPTIMAL MULTIVARIATE METHODS

The topology of real-world complex networks, such as in transportation and communication, is always changing with time. Such changes can arise not only as a natural consequence of their growth, but also due to major modi. cations in their intrinsic organization. For instance, the network of transportation routes between cities and towns ( hence locations) of a given country undergo a major change with the progressive implementation of commercial air transportation. While the locations could be originally interconnected through highways ( paths, giving rise to geographical networks), transportation between those sites progressively shifted or was complemented by air transportation, with scale free characteristics. In the present work we introduce the path-star transformation ( in its uniform and preferential versions) as a means to model such network transformations where paths give rise to stars of connectivity. It is also shown, through optimal multivariate statistical methods (i.e. canonical projections and maximum likelihood classification) that while the US highways network adheres closely to a geographical network model, its path-star transformation yields a network whose topological properties closely resembles those of the respective airport transportation network.

Sensitivity of complex networks measurements

Complex networks obtained from real-world networks are often characterized by incompleteness and noise, consequences of imperfect sampling as well as artifacts in the acquisition process. Because the characterization, analysis and modeling of complex systems underlain by complex networks are critically affected by the quality and completeness of the respective initial structures, it becomes imperative to devise methodologies for identifying and quantifying the effects of the sampling on the network structure. One way to evaluate these effects is through an analysis of the sensitivity of complex network measurements to perturbations in the topology of the network. In this paper, measurement sensibility is quantified in terms of the relative entropy of the respective distributions. Three particularly important kinds of progressive perturbations to the network are considered, namely, edge suppression, addition and rewiring. The measurements allowing the best balance of stability (smaller sensitivity to perturbations) and discriminability (separation between different network topologies) are identified with respect to each type of perturbation. Such an analysis includes eight different measurements applied on six different complex networks models and three real-world networks. This approach allows one to choose the appropriate measurements in order to obtain accurate results for networks where sampling bias cannot be avoided-a very frequent situation in research on complex networks.

On the efficiency of data representation on the modeling and characterization of complex networks

Specific choices about how to represent complex networks can have a substantial impact on the execution time required for the respective construction and analysis of those structures. In this work we report a comparison of the effects of representing complex networks statically by adjacency matrices or dynamically by adjacency lists. Three theoretical models of complex networks are considered: two types of Erdos-Renyi as well as the Barabasi-Albert model. We investigated the effect of the different representations with respect to the construction and measurement of several topological properties (i.e. degree, clustering coefficient, shortest path length, and betweenness centrality). We found that different forms of representation generally have a substantial effect on the execution time, with the sparse representation frequently resulting in remarkably superior performance. (C) 2011 Elsevier B.V. All rights reserved.

Concentric characterization and classification of complex network nodes: Application to an institutional collaboration network

Differently from theoretical scale-free networks, most real networks present multi-scale behavior, with nodes structured in different types of functional groups and communities. While the majority of approaches for classification of nodes in a complex network has relied on local measurements of the topology/connectivity around each node, valuable information about node functionality can be obtained by concentric (or hierarchical) measurements. This paper extends previous methodologies based on concentric measurements, by studying the possibility of using agglomerative clustering methods, in order to obtain a set of functional groups of nodes, considering particular institutional collaboration network nodes, including various known communities (departments of the University of Sao Paulo). Among the interesting obtained findings, we emphasize the scale-free nature of the network obtained, as well as identification of different patterns of authorship emerging from different areas (e.g. human and exact sciences). Another interesting result concerns the relatively uniform distribution of hubs along concentric levels, contrariwise to the non-uniform pattern found in theoretical scale-free networks such as the BA model. (C) 2008 Elsevier B.V. All rights reserved.

Border trees of complex networks

The comprehensive characterization of the structure of complex networks is essential to understand the dynamical processes which guide their evolution. The discovery of the scale-free distribution and the small-world properties of real networks were fundamental to stimulate more realistic models and to understand important dynamical processes related to network growth. However, the properties of the network borders (nodes with degree equal to 1), one of its most fragile parts, remained little investigated and understood. The border nodes may be involved in the evolution of structures such as geographical networks. Here we analyze the border trees of complex networks, which are defined as the subgraphs without cycles connected to the remainder of the network (containing cycles) and terminating into border nodes. In addition to describing an algorithm for identification of such tree subgraphs, we also consider how their topological properties can be quantified in terms of their depth and number of leaves. We investigate the properties of border trees for several theoretical models as well as real-world networks. Among the obtained results, we found that more than half of the nodes of some real-world networks belong to the border trees. A power-law with cut-off was observed for the distribution of the depth and number of leaves of the border trees. An analysis of the local role of the nodes in the border trees was also performed.

Characterizing topological and dynamical properties of complex networks without border effects

The properties of complex networks are highly Influenced by border effects frequently found as a consequence of the finite nature of real-world networks as well as network Sampling Therefore, it becomes critical to devise effective means for sound estimation of net work topological and dynamical properties will le avoiding these types of artifacts. In the current work, an algorithm for minimization of border effects is proposed and discussed, and its potential IS Illustrated with respect to two real-world networks. namely bone canals and air transportation (C) 2009 Elsevier B.V. All rights reserved.

Characterization of protein hydrolysates of cosmetic use by CE-MS

Protein hydrolysates have been used as active principles in cosmetic products conferring different properties to the final formulations, which are mostly controlled by the peptide size and its amino acid sequence. In this work, capillary electrophoresis coupled to mass spectrometry analyses were carried out in order to investigate such characteristics of protein hydrolysates. Samples of different origins (milk, soy and rice) were obtained from a local company, and were analyzed without a previous preparation step. The background electrolyte (BGE) and sheath liquid compositions were optimized for each sample. The best BGE composition (860 mmol/L formic acid - pH 1.8 - in 70: 30 v/v water/methanol hydro-organic solvent) was chosen based on the overall peak resolution whereas the best sheath liquid was selected based on increased sensitivity and presented different compositions to each sample (10.9-217 mmol/L formic acid in 75: 25-25: 75 v/v water/methanol hydro-organic solvent). Most of the putative peptides in the hydrolysate samples under investigation presented molecular masses of 1000 Da or less. De novo sequencing was carried out for some of the analytes, revealing the hydrophobicity/polarity of the peptides. Hence, the technique has proved to be an advantageous tool for the quality control of industrial protein hydrolysates.

Interaction and Persuasion:An analysis of the use of rhetorical devices in Gordon Brown's speech to the Labour Party Conference, on September 25, 2006

This essay has identified and analysed rhetorical devices in Gordon Brown’s speech delivered at the Labour Party conference on September 25, 2006. The aim of the study was to identify specific rhetorical devices which are described as interactional resources, analyse their uses and discuss possible effects that they may have when included in a political speech. The results are based on my own interpretations but are supported by information provided in current literature by analysts and researchers of rhetoric use. The result findings could probably serve as evidence of the need for better understanding of the devices used by politicians in their relentless endeavours to influence audience decisions.

Influences of infrastructure and attitudes to health on value of travel time savings in bicycle journeys

In this paper we investigate how attitudes to health and exercise in connection with cycling influence the estimation of values of travel time savings in different kinds of bicycle environments (mixed traffic, bicycle lane in the road way, bicycle path next to the road, and bicycle path not in connection with the road). The results, based on two Swedish stated choice studies, suggest that the values of travel time savings are lower when cycling in better conditions. Surprisingly, the respondents do not consider cycling on a path next to the road worse than cycling on a path not in connection to the road, indicating that they do not take traffic noise and air pollution into account in their decision to cycle. No difference can be found between cycling on a road way (mixed traffic) and cycling in a bicycle lane in the road way. The results also indicate that respondents that include health aspects in their choice to cycle have lower value of travel time savings for cycling than respondents that state that health aspects are of less importance, at least when cycling on a bicycle path. The appraisals of travel time savings regarding cycling also differ a lot depending on the respondents’ alternative travel mode. The individuals who stated that they will take the car if they do not cycle have a much higher valuation of travel time savings than the persons stating public transport as the main alternative to cycling.

The Impact of Land Use Patterns and Watershed Characteristics on China Lake, Kennebec County, Maine

China Lake is located in Kennebec County, Maine. Since 1983 the lake has suffered from yearly algal blooms as a result of the addition of excess nutrients. The nutrient load was amplified by erosion within the watershed. Erosion varies widely depending on a number of factors, including the slope of the land, the type of soil, and the way the land is being used. Certain land use types have a high potential to add nutrients to the environment, while others may help absorb excess nutrients and prevent erosion and runoff into the lake. A comprehensive examination of the China Lake watershed was completed using GIS to calculate the erosion potential for the entire area, taking into account past and present land use patterns. This information will help the towns around the lake to make informed decisions about future development and land management.

The Econometric Value of Silence and Noise as Seen by a Non-practicing Marxist

A Collection of Poetry and Fiction