5 We propose an advanced framework for the automatic configuration of 6 spectral dimensionality reduction methods. This is achieved by introducing, 7 first, the mutual information measure to assess the quality of discovered 8 embedded spaces. Secondly, unsupervised Radial Basis Function network is 9 designated for mapping between spaces where the learning process is derived 10 from graph theory...

This paper presents a new method for reconfiguration of radial distribution systems for minimisation of real power loss using Adaptive Genetic Algorithm without involving any additional cost for the installation of tap changing transformers, capacitors and concerned switching equipments. The initial population for Genetic Algorithm is created using a heuristic approach and the genetic operators...

In the classical Gaussian SVM classification we use the feature space projection transforming points to normal distributions with fixed covariance matrices (identity in the standard RBF and the covariance of the whole dataset in Mahalanobis RBF). In this paper we add additional information to Gaussian SVM by considering local geometry-dependent feature space projection. We emphasize that our ap...

In this paper, we shall prove that every bipartite quadrangulation G on the torus admits a simple closed curve visiting each face and each vertex of G exactly once but crossing no edge. As an application, we conclude that the radial graph of any bipartite quadrangulation on the torus has a hamiltonian cycle.

The talk will summarize recent works on the stability under disorder of the absolutely continuous spectra of random operators on tree graphs. The cases covered include: Schroedinger operators with random potential, quantum graph operators for trees with randomized edge lengths, and Schroedinger operators with radial quasi-periodic potentials. The results were derived jointly with R. Sims and S....

In this work, we give a priori height and gradient estimates for solutions of the prescribed constant Gauss curvature equation in Euclidean space. We shall consider convex radial graphs with positive constant mean curvature. The estimates are established by considering in such a graph, the Riemannian metric given by the second fundamental form of the immersion. r 2003 Elsevier Inc. All rights r...

We present a method for analysing the phase space of star-forming regions. In particular we are searching for clumpy structures in the 3D subspace formed by two position coordinates and radial velocity. The aim of the method is the detection of kinematic segregated radial velocity groups, that is, radial velocity intervals whose associated stars are spatially concentrated. To this end we define...

this paper is concerned with the consensus tracking problem of high order mimo nonlinear multi-agent systems. the agents must follow a leader node in presence of unknown dynamics and uncertain external disturbances. the communication network topology of agents is assumed to be a fixed undirected graph. a distributed adaptive control method is proposed to solve the consensus problem utilizing re...

The execution performance of scientiic application programs on parallel systems depends critically upon exploiting data locality and balancing computation loads. We have developed an event-driven visualization and optimization tool for data-parallel programs, called *Graph, which helps programmers reduce the communication costs by providing data locality information, communication bottlenecks, ...

Let be a smooth domain on the unit sphere S whose closure is contained in an open hemisphere and denote by H the mean curvature of ∂ as a submanifold of with respect to the inward unit normal. It is proved that for each real number H that satisfies inf H > −H ≥ 0, there exists a unique radial graph on bounded by ∂ with constant mean curvature H . The orientation on the graph is based on the nor...