Graph drawing addresses the problem of finding a layout of a graph that satisfies given aesthetic and understandability objectives. The most important objective in graph drawing is minimization of the number of crossings in the drawing, as the aesthe
tics and readability of graph drawings depend on the number of edge crossings. VLSI layouts with fewer crossings are more easily realizable and consequently cheaper. A straight-line drawing of a planar graph G of n vertices is a drawing of G such that each edge is drawn as a straight-line segment without edge crossings. However, a problem with current graph layout methods which are capable of producing satisfactory results for a wide range of graphs is that they often put an extremely high demand on computational resources. This paper introduces a new layout method, which nicely draws internally convex of planar graph that consumes only little computational resources and does not need any heavy duty preprocessing. Here, we use two methods: The first is self organizing map known from unsupervised neural networks which is known as (SOM) and the second method is Inverse Self Organized Map (ISOM).
Thresholding is an important task in image processing. It is a main tool in pattern recognition, image segmentation, edge detection and scene analysis. In this paper, we present a new thresholding technique based on two-dimensional Tsallis entropy. T
he two-dimensional Tsallis entropy was obtained from the twodimensional histogram which was determined by using the gray value of the pixels and the local average gray value of the pixels, the work it was applied a generalized entropy formalism that represents a recent development in statistical mechanics. The effectiveness of the proposed method is demonstrated by using examples from the real-world and synthetic images. The performance evaluation of the proposed technique in terms of the quality of the thresholded images are presented. Experimental results demonstrate that the proposed method achieve better result than the Shannon method.
In this paper, we study the bipartite entanglement of spin coherent states in the case of pure and mixed states. By a proper choice of the subsystem spins, the entanglement for large class of quantum systems is investigated. We generalize the result
to the case of bipartite mixed states using a simplified expression of concurrence in Wootters measure of the bipartite entanglement. It is found that in some cases, the maximal entanglement of mixed states in the context of $su(2)$ algebra can be detected. Our observations may have important implications in exploiting these states in quantum information theory.
We explore the dynamics of the entanglement in a semiconductor cavity QED containing a quantum well. We show the presence of sudden birth and sudden death for some particular sets of the system parameters.
The dynamics of the Buck and Sukumar model [B. Buck and C.V. Sukumar, Phys. Lett. A 81 (1981) 132] are investigated using different semi-classical information-theory tools. Interesting aspects of the periodicity inherent to the model are revealed and
somewhat unexpected features are revealed that seem to be related to the classical-quantum transition.
In this paper, we investigate the geometric phase of the field interacting with $Xi $-type moving three-level atom. The results show that the atomic motion and the field-mode structure play important roles in the evolution of the system dynamics and
geometric phase. We test this observation with experimentally accessible parameters and some new aspects are obtained.
