Abstract Graph states are one of the most significant classes entangled states, serving as quantum resources for technologies. Recently, integrated photonics is becoming a promising platform information processing, enabling generation, manipulation, and measurement photonic states. This article summarizes state-of-the-art experimental progress advances in chip-based graph

Implementing graph algorithms efficiently in a rule-based language is challenging because pattern matching expensive. In this paper, we present number of linear-time implementations GP 2, an experimental programming based on transformation rules which aims to facilitate program analysis and verification. We focus two classes programs: reduction programs check some property, using depth-first se...

Based on psychophysiological research, coherent heart-brain interaction can change afferent cardiac signal pattern sent to the brain. Accordingly, the present study aimed at facilitating the emotion-cognition interaction through HeartMath Institute self-regulated emotional techniques to investigate the efficacy of heart-brain coherence on reading anxiety reduction that significantly enhances at...

The present research has been conducted in two quantitative and qualitative sections. In the qualitative section, and based on Grounded Theory, the organizational social coherence model was presented. In the quantitative section, the data obtained from the questionnaires was analyzed at two levels of descriptive and inferential statistics including structural equations and through the SPSS and ...

Let G be a connected simple (molecular) graph. The distance d(u, v) between two vertices u and v of G is equal to the length of a shortest path that connects u and v. In this paper we compute some distance based topological indices of H-Phenylenic nanotorus. At first we obtain an exact formula for the Wiener index. As application we calculate the Schultz index and modified Schultz index of this...

university course timetabling is a complex optimizationproblem. there are many components like departments, faculties, rooms,and students making the problem huge and difficult to solve. eachcomponent enforces a set of normally conflicting constraints on thesolution space. the problem will be solved if courses are scheduled indifferent rooms and within some specific time slots such that a set of...

Automatic detection of salient image regions is a useful tool with applications in intelligent camera control, virtual cinematography, video summarization and editing, evaluation of viewer preferences, and many others. This paper presents an effective method for detecting potentially salient foreground regions. Salient regions are identified by eigenvalue analysis of a graph Laplacian that is d...

we present a matching and lp based heuristic algorithm that decides graph non-hamiltonicity. each of the n! hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices p, such that pu,i = 1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n + 1. a graph instance (g) is initially coded as exclusion set ...

BACKGROUND Graph theory has been recently introduced to characterize complex brain networks, making it highly suitable to investigate altered connectivity in neurologic disorders. A current model proposes autism spectrum disorder (ASD) as a developmental disconnection syndrome, supported by converging evidence in both non-syndromic and syndromic ASD. However, the effects of abnormal connectivit...