Coherent and generalized intelligent states for infinite square well potential and nonlinear oscillators

This article is an illustration of the construction of coherent and generalized intelligent states which has been recently proposed by us for an arbitrary quantum system $[ 1]$. We treat the quantum system submitted to the infinite square well potential and the nonlinear oscillators. By means of the analytical representation of the coherent states \`{a} la Gazeau-Klauder and those \`{a} la Klauder-Perelomov, we derive the generalized intelligent states in analytical ways

Conflict and opportunity: neurosurgery and industry

Journal ArticleThe relationship between neurosurgery and industry is multifaceted. Most aspects of this relationship promote the advancement of a highly technical field such as neurosurgery, helping neurosurgeons bring ever more effective therapies to their patients. However, serious ethical and legal concerns also attend this relationship

Are there any good digraph width measures?

Several different measures for digraph width have appeared in the last few years. However, none of them shares all the "nice" properties of treewidth: First, being \emph{algorithmically useful} i.e. admitting polynomial-time algorithms for all \MS1-definable problems on digraphs of bounded width. And, second, having nice \emph{structural properties} i.e. being monotone under taking subdigraphs and some form of arc contractions. As for the former, (undirected) \MS1 seems to be the least common denominator of all reasonably expressive logical languages on digraphs that can speak about the edge/arc relation on the vertex set.The latter property is a necessary condition for a width measure to be characterizable by some version of the cops-and-robber game characterizing the ordinary treewidth. Our main result is that \emph{any reasonable} algorithmically useful and structurally nice digraph measure cannot be substantially different from the treewidth of the underlying undirected graph. Moreover, we introduce \emph{directed topological minors} and argue that they are the weakest useful notion of minors for digraphs

Assessing evaluation education in African tertiary education institutions: Opportunities and reflections

The demand for knowledge from evaluations to inform evidence-based policy making continues to rise in Africa. Simultaneously, there is increased recognition of the role tertiary education institutions can play in strengthening evaluation practice through high quality evaluation education. Within this context, this paper explores the status quo of evaluation education in selected tertiary institutions in Anglophone African countries. The paper utilizes a mixed methods research methodology that blends secondary data review, an online survey using a structured questionnaire and two regional workshops. Data was collected from 12 Anglophone African tertiary education institutions. Findings indicate that evaluation education in Anglophone African tertiary institutions is mostly in the nascent stages and there are mixed feelings on the appropriate entry levels (undergraduate or postgraduate). The study highlights the need for developing a specialized evaluation curriculum as evaluation education still borrows from theories and methodologies from the North. Institutional, operational and policy-related challenges are highlighted as well as the potential for collaboration among various stakeholders in strengthening the design and implementation of evaluation education. Key tenets for strengthening evaluation education are highlighted and discussed

Facial structures for various notions of positivity and applications to the theory of entanglement

In this expository note, we explain facial structures for the convex cones consisting of positive linear maps, completely positive linear maps, decomposable positive linear maps between matrix algebras, respectively. These will be applied to study the notions of entangled edge states with positive partial transposes and optimality of entanglement witnesses.Comment: An expository note. Section 7 and Section 8 have been enlarge

Fullerene graphs have exponentially many perfect matchings

A fullerene graph is a planar cubic 3-connected graph with only pentagonal and hexagonal faces. We show that fullerene graphs have exponentially many perfect matchings.Comment: 7 pages, 3 figure