An iterative algorithm is constructed to solve the generalized coupled Sylvester matrix equations AXB − CYD,EXF − GYH M,N , which includes Sylvester and Lyapunov matrix equations as special cases, over generalized reflexive matrices X and Y . When the matrix equations are consistent, for any initial generalized reflexive matrix pair X1, Y1 , the generalized reflexive solutions can be obtained b...

The general coupled matrix equations (including the generalized coupled Sylvester matrix equations as special cases) have numerous applications in control and system theory. In this paper, an iterative algorithm is constructed to solve the general coupled matrix equations over reflexive matrix solution. When the general coupled matrix equations are consistent over reflexive matrices, the reflex...

A novel two-step paradigm was used to investigate the parallel programming of consecutive, stimulus-elicited ('reflexive') and endogenous ('voluntary') saccades. The mean latency of voluntary saccades, made following the first reflexive saccades in two-step conditions, was significantly reduced compared to that of voluntary saccades made in the single-step control trials. The latency of the fir...

This study addresses the matter of reflexive control of the emotional states by means of Reflexive Game Theory (RGT). It is shown how to build a bridge between RGT and emotions. For this purpose the Pleasure-Arousal-Dominance (PAD) model is adopted. The major advantages of RGT are its ability to predict human behavior and unfold the entire spectra of reflexion in the human mind. On the other ha...

We examine the computational complexity of approximately counting the list H-colourings of a graph. We discover a natural graph-theoretic trichotomy based on the structure of the graph H . If H is an irreflexive bipartite graph or a reflexive complete graph then counting list H-colourings is trivially in polynomial time. Otherwise, if H is an irreflexive bipartite permutation graph or a reflexi...

We recall and reformulate certain known constructions, in order to make a convenient setting for obtaining generalized monotone-light factorizations in the sense of A. Carboni, G. Janelidze, G. M. Kelly and R. Paré. This setting is used to study the existence of monotone-light factorizations both in categories of simplicial objects and in categories of internal categories. It is shown that ther...

We consider when the quaternion matrix equation AXB+CXD=E has a reflexive (or anti-reflexive) solution with respect to given generalized reflection matrix. adopt real representation method derive solutions it is solvable. Moreover, we obtain explicit expressions of least-squares solutions.

We study list homomorphism problems L-HOM(H) for the class of reflexive digraphs H (digraphs in which each vertex has a loop). These problems have been intensively studied in the case of undirected graphs H, and appear to be more difficult for digraphs. However, it is known that each problem L-HOM(H) is NP-complete or polynomial time solvable. In this paper we focus on reflexive digraphs. We in...

The goal of achieving powerful problem solving capabilities leads to the “advice taker” form of program and the associated problem of control. This proposal outlines an approach to this problem based on the construction of problem solvers with advanced self-knowledge and introspection capabilities. 1 The Problem of Control Self-reverence, self-knowledge, self-control, These three alone lead lif...

BACKGROUND Cough reflex testing is a validated tool for identifying patients at risk of silent aspiration. However, inter- and intra-rater reliabilities of perceptual judgements of cough strength are sub-optimal. Although there are clinically established methods for measuring volitional cough strength, no similar methods are identified for reflexive cough strength. This study evaluated three me...