Study on tropical rain with special reference to rain Drop Size Distribution and integral rain parameters using ground-based and satellite measurements

Department of Physics, Cochin University of Science and Technology

Studies on some graph operators and related topics

Department of Mathematics, Cochin University of Science and Technology

Studies on Some Graph Classes

Department of Mathematics, Cochin University of Science and Technology

Studies on some generalizations of line graph and the power domination problem in graphs

Department of Mathematics, Cochin University of Science and Technology

Studies on the Spectrum and the Energy of Graphs

Department of Mathematics, Cochin University of Science and Technology

Strongly distance-balanced graphs and graph products

A graph G is strongly distance-balanced if for every edge uv of G and every i 0 the number of vertices x with d.x; u/ D d.x; v/ 1 D i equals the number of vertices y with d.y; v/ D d.y; u/ 1 D i. It is proved that the strong product of graphs is strongly distance-balanced if and only if both factors are strongly distance-balanced. It is also proved that connected components of the direct product of two bipartite graphs are strongly distancebalanced if and only if both factors are strongly distance-balanced. Additionally, a new characterization of distance-balanced graphs and an algorithm of time complexity O.mn/ for their recognition, wheremis the number of edges and n the number of vertices of the graph in question, are given

Median Sets and Median Number of a Graph

A profile is a finite sequence of vertices of a graph. The set of all vertices of the graph which minimises the sum of the distances to the vertices of the profile is the median of the profile. Any subset of the vertex set such that it is the median of some profile is called a median set. The number of median sets of a graph is defined to be the median number of the graph. In this paper, we identify the median sets of various classes of graphs such as Kp − e, Kp,q forP > 2, and wheel graph and so forth. The median numbers of these graphs and hypercubes are found out, and an upper bound for the median number of even cycles is established.We also express the median number of a product graph in terms of the median number of their factors.

On The Center Sets and Center Numbers of Some Graph Classes

For a set S of vertices and the vertex v in a connected graph G, max x2S d(x, v) is called the S-eccentricity of v in G. The set of vertices with minimum S-eccentricity is called the S-center of G. Any set A of vertices of G such that A is an S-center for some set S of vertices of G is called a center set. We identify the center sets of certain classes of graphs namely, Block graphs, Km,n, Kn −e, wheel graphs, odd cycles and symmetric even graphs and enumerate them for many of these graph classes. We also introduce the concept of center number which is defined as the number of distinct center sets of a graph and determine the center number of some graph classes

Content aggregation on knowledge bases using graph clustering

Recently, research projects such as PADLR and SWAP have developed tools like Edutella or Bibster, which are targeted at establishing peer-to-peer knowledge management (P2PKM) systems. In such a system, it is necessary to obtain provide brief semantic descriptions of peers, so that routing algorithms or matchmaking processes can make decisions about which communities peers should belong to, or to which peers a given query should be forwarded. This paper proposes the use of graph clustering techniques on knowledge bases for that purpose. Using this clustering, we can show that our strategy requires up to 58% fewer queries than the baselines to yield full recall in a bibliographic P2PKM scenario.

La escuela deportiva : un espacio ideal para la educación integral.

Monográfico con el título: 'El Deporte en la Escuela. Educar en valores a través del deporte'. Resumen basado en el de la publicación

Plan integral para la formación, el empleo y la vida independiente para las personas con Síndrome de Down y otras discapacidades psíquicas.

Figuran como colaboradores las profesoras Nuria Illán y María Ángeles García Cerdá de la Universidad de Murcia

La evaluación educativa : un modelo integral de los procesos de enseñanza aprendizaje.

El libro ofrece un modelo de evaluación de los aprendizajes de los alumnos fundamentado conceptualmente pero de carácter eminentemente práctico. El libro presenta propuestas y materiales concretos y de fácil aplicación. El libro se divide en cuatro partes: marco conceptual, justificación de estrategias adoptadas y materiales de evaluación, ejemplificaciones orientativas y análisis de la normativa reguladora.

Rainbow : Programa de Ayuda Integral al Inmigrante. Guía mediterránea de recursos para inmigrantes.

La guía cuenta con un anexo en el que se presenta información actualizada en virtud de la entrada en vigor de la nueva legislación sobre inmigración (Ley Orgánica 8/2000 de 22 de diciembre) y está editada por la Región de Murcia

Educación integral y creatividad metodológica.

El objetivo general de este documento es mostrar a los educadores un proceso metodológico para fomentar la creatividad partiendo de la motivación vivencial y artística de los niños/as. La autora parte del análisis del estado actual de las metodologías predominantes en la primera infancia y propone un esquema de programación para niños de preescolar de 4 años. Partiendo del ritmo, imágenes e ilustraciones de poemas, se trata de estructurar el lenguaje y pensamiento de forma natural y global. Este método se basa en que la expresión abstracta y acabada supone un poema, lleva englobadas sensaciones y conocimientos que el autor tuvo que sintetizar; se trata, entonces, de que el alumno llegue a revivir tales sensaciones. Se propone igualmente la estructura de una clase y un ejemplo de programación anual.

Understanding Subsystems in Biology through Dimensionality Reduction, Graph Partitioning and Analytical Modeling

Biological systems exhibit rich and complex behavior through the orchestrated interplay of a large array of components. It is hypothesized that separable subsystems with some degree of functional autonomy exist; deciphering their independent behavior and functionality would greatly facilitate understanding the system as a whole. Discovering and analyzing such subsystems are hence pivotal problems in the quest to gain a quantitative understanding of complex biological systems. In this work, using approaches from machine learning, physics and graph theory, methods for the identification and analysis of such subsystems were developed. A novel methodology, based on a recent machine learning algorithm known as non-negative matrix factorization (NMF), was developed to discover such subsystems in a set of large-scale gene expression data. This set of subsystems was then used to predict functional relationships between genes, and this approach was shown to score significantly higher than conventional methods when benchmarking them against existing databases. Moreover, a mathematical treatment was developed to treat simple network subsystems based only on their topology (independent of particular parameter values). Application to a problem of experimental interest demonstrated the need for extentions to the conventional model to fully explain the experimental data. Finally, the notion of a subsystem was evaluated from a topological perspective. A number of different protein networks were examined to analyze their topological properties with respect to separability, seeking to find separable subsystems. These networks were shown to exhibit separability in a nonintuitive fashion, while the separable subsystems were of strong biological significance. It was demonstrated that the separability property found was not due to incomplete or biased data, but is likely to reflect biological structure.