Edta como extractante universal : I- cationes mayores (Ca, Mg y K)

p.133-137

Exact colorations of graphs and digraphs

A coloration is an exact regular coloration if whenever two vertices are colored the same they have identically colored neighborhoods. For example, if one of the two vertices that are colored the same is connected to three yellow vertices, two white and red, then the other vertex is as well. Exact regular colorations have been discussed informally in the social network literature. However they have been part of the mathematical literature for some time, though in a different format. We explore this concept in terms of social networks and illustrate some important results taken from the mathematical literature. In addition we show how the concept can be extended to ecological and perfect colorations, and discuss how the CATREGE algorithm can be extended to find the maximal exact regular coloration of a graph.

A generational scheme for partitioning graphs

Graph partitioning divides a graph into several pieces by cutting edges. Very effective heuristic partitioning algorithms have been developed which run in real-time, but it is unknown how good the partitions are since the problem is, in general, NP-complete. This paper reports an evolutionary search algorithm for finding benchmark partitions. Distinctive features are the transmission and modification of whole subdomains (the partitioned units) that act as genes, and the use of a multilevel heuristic algorithm to effect the crossover and mutations. Its effectiveness is demonstrated by improvements on previously established benchmarks.

Visualizing a temporal consistency checker

The notion of time plays a vital and ubiquitous role of a common universal reference. In knowledge-based systems, temporal information is usually represented in terms of a collection of statements, together with the corresponding temporal reference. This paper introduces a visualized consistency checker for temporal reference. It allows expression of both absolute and relative temporal knowledge, and provides visual representation of temporal references in terms of directed and partially weighted graphs. Based on the temporal reference of a given scenario, the visualized checker can deliver a verdict to the user as to whether the scenario is temporally consistent or not, and provide the corresponding analysis / diagnosis.

On Hamilton cycles in locally connected graphs with vertex degree constraints

It is shown that every connected, locally connected graph with the maximum vertex degree Δ(G)=5 and the minimum vertex degree δ(G)3 is fully cycle extendable. For Δ(G)4, all connected, locally connected graphs, including infinite ones, are explicitly described. The Hamilton Cycle problem for locally connected graphs with Δ(G)7 is shown to be NP-complete

The missing link between information and action: hastenings and delays as universal reactions to performance feedback

This chapter focuses on what the key decision makers in organizations decide after having received information on the current state of the organizational performance. Because of strong attributions to success and failure, it is impossible to predict in advance which concrete actions will occur. We can however find out what kinds of actions are decided upon by means of an organizational learning model that focuses on the hastenings and delays after performance feedback. As an illustration, the responses to performance signals by trainers and club owners in Dutch soccer clubs are analyzed.

Complex coastal oceanographic fields can be described by universal multifractals

Characterization of chlorophyll and sea surface temperature (SST) structural heterogeneity using their scaling properties can provide a useful tool to estimate the relative importance of key physical and biological drivers. Seasonal, annual, and also instantaneous spatial distributions of chlorophyll and SST, determined from satellite measurements, in seven different coastal and shelf-sea regions around the UK have been studied. It is shown that multifractals provide a very good approximation to the scaling properties of the data: in fact, the multifractal scaling function is well approximated by universal multifractal theory. The consequence is that all of the statistical information about data structure can be reduced to being described by two parameters. It is further shown that also bathymetry scales in the studied regions as multifractal. The SST and chlorophyll multifractal structures are then explained as an effect of bathymetry and turbulence.

Hall conditions for edge-weighted bipartite graphs

A weighted variant of Hall's condition for the existence of matchings is shown to be equivalent to the existence of a matching in a lexicographic product. This is used to introduce characterizations of those bipartite graphs whose edges may be replicated so as to yield semiregular multigraphs or, equivalently, semiregular edge-weightings. Such bipartite graphs will be called semiregularizable. Some infinite families of semiregularizable trees are described and all semiregularizable trees on at most 11 vertices are listed. Matrix analogues of some of the results are mentioned and are shown to imply some of the known characterizations of regularizable graphs.

A Universal Flow Regime Map for Horizontal Two-Phase Flow in Pipes

A new universal flow map has been developed for two-phase co-current flow. The map has been successfully tested against wide variety of data. Flow regime transition predictors suggested by other authors have been shown to be useful. New transitional models are proposed for the stratified to annular regimes, blow through slug and intermittent regimes.