Feedback and generalized logic

Although the distinction between software and hardware is a posteriori, there is an a priori distinction that masquerades as the software—hardware distinction. This is the distinction between procedure interconnection, the semantics of flow chart diagrams, which is known to be described by the regular expression calculus; and system interconnection, the semantics of network diagrams, which is described by a certain logical calculus, dual to a calculus of regular expressions. This paper presents a proof of the duality in a special case, and gives the interpretation of the logical calculus for sequential machine interconnection. A minimal realization theorem for feedback systems is proved, which specializes to known open loop minimal realization theorems

Parameterized Complexity of Graph Constraint Logic

Graph constraint logic is a framework introduced by Hearn and Demaine, which provides several problems that are often a convenient starting point for reductions. We study the parameterized complexity of Constraint Graph Satisfiability and both bounded and unbounded versions of Nondeterministic Constraint Logic (NCL) with respect to solution length, treewidth and maximum degree of the underlying constraint graph as parameters. As a main result we show that restricted NCL remains PSPACE-complete on graphs of bounded bandwidth, strengthening Hearn and Demaine's framework. This allows us to improve upon existing results obtained by reduction from NCL. We show that reconfiguration versions of several classical graph problems (including independent set, feedback vertex set and dominating set) are PSPACE-complete on planar graphs of bounded bandwidth and that Rush Hour, generalized to $k\times n$ boards, is PSPACE-complete even when $k$ is at most a constant

Universal quantum interfaces

To observe or control a quantum system, one must interact with it via an interface. This letter exhibits simple universal quantum interfaces--quantum input/output ports consisting of a single two-state system or quantum bit that interacts with the system to be observed or controlled. It is shown that under very general conditions the ability to observe and control the quantum bit on its own implies the ability to observe and control the system itself. The interface can also be used as a quantum communication channel, and multiple quantum systems can be connected by interfaces to become an efficient universal quantum computer. Experimental realizations are proposed, and implications for controllability, observability, and quantum information processing are explored.Comment: 4 pages, 3 figures, RevTe

Notion of Neutrosophic Risk and Financial Markets Prediction

Presenting an application of the neutrosophic logic in the prediction of the financial markets

Regression between headmaster leadership, task load and job satisfaction of special education integration program teacher

Managing school is a daunting task for a headmaster. This responsibility is exacerbated when it involves the Special Education Integration Program (SEIP). This situation requires appropriate and effective leadership in addressing some of the issues that are currently taking place at SEIP such as task load and job satisfaction. This study aimed to identify the influence of headmaster leadership on task load and teacher job satisfaction at SEIP. This quantitative study was conducted by distributing 400 sets of randomized questionnaires to SEIP teachers across Malaysia through google form. The data obtained were then analyzed using Structural Equation Modeling (SEM) and AMOS software. The results show that there is a significant positive effect on the leadership of the headmaster and the task load of the teacher. Likewise, the construct of task load and teacher job satisfaction has a significant positive effect. However, for the construct of headmaster leadership and teacher job satisfaction, there was no significant positive relationship. This finding is very important as a reference to the school administration re-evaluating their leadership so as not to burden SEIP teachers and to give them job satisfaction. In addition, the findings of this study can also serve as a guide for SEIP teachers to increase awareness of the importance of managing their tasks. This study also focused on education leadership in general and more specifically on special education leadership

The Variable Hierarchy for the Games mu-Calculus

Parity games are combinatorial representations of closed Boolean mu-terms. By adding to them draw positions, they have been organized by Arnold and one of the authors into a mu-calculus. As done by Berwanger et al. for the propositional modal mu-calculus, it is possible to classify parity games into levels of a hierarchy according to the number of fixed-point variables. We ask whether this hierarchy collapses w.r.t. the standard interpretation of the games mu-calculus into the class of all complete lattices. We answer this question negatively by providing, for each n >= 1, a parity game Gn with these properties: it unravels to a mu-term built up with n fixed-point variables, it is semantically equivalent to no game with strictly less than n-2 fixed-point variables