We investigate the magic number problem, that is, the question whether there exists a minimal n-state nondeterministic finite automaton (NFA) whose equivalent minimal deterministic finite automaton (DFA) has α states, for all n and α satisfying n ≤ α ≤ 2n. A number α not satisfying this condition is called a magic number (for n). It was shown in [11] that no magic numbers exist for general regu...

Several mutual information (MI)-based algorithms have been developed to identify dynamic gene-gene and function-function interactions governed by key modulators (genes, proteins, etc.). Due to intensive computation, however, these methods rely heavily on prior knowledge and are limited in genome-wide analysis. We present the modulated gene/gene set interaction (MAGIC) analysis to systematically...

AIMS We developed a textile-based wearable system, named MagIC, for the unobtrusive monitoring of one electrocardiogram (ECG) lead, respiratory frequency and motion. In the present study, we investigated the ability of this system to monitor cardiac rhythm and arrhythmic events in cardiac patients. METHODS AND RESULTS The study was carried out by comparing ECG tracings simultaneously recorded...

Quantum error correction and fault-tolerance have provided the possibility for large scale quantum computations without a detrimental loss of quantum information. A very natural class of gates for fault-tolerant quantum computation is the Clifford gate set and as such their usefulness for universal quantum computation is of great interest. Clifford group gates augmented by magic state preparati...

The study of graph labellings has focused on finding classes of graphs which admit a particular type of labelling. Here we consider variations of the well-known edge-magic and vertex-magic total labellings for which all graphs admit such a labelling. In particular, we consider two types of injections of the vertices and edges of a graph with positive integers: (1) for every edge the sum of its ...

Introduction: In radiotherapy, treatment planning methods are evaluating and transforming every day, so precision in calculation and determination of dose delivery process is performing more important role in radiotherapy than past. In modern radiotherapy treatments, deramatically increase of small fields utilization, causes the polymeric gels has known as the most reliable dos...

Introduction: Computed tomography (CT) has numerous applications in clinical procedures but its main problem is its high radiation dose to the patients compared to other imaging modalities using x-ray. CT delivers approximately high doses to the nearby tissues due to the scattering effect, fan beam (beam divergence) and limited collimator efficiency. The radiation dose from multi-slice scanners...

We introduce the notion of magic functions of a general domain in C and show that the set of magic functions of a given domain is an intrinsic complex-geometric object. We determine the set of magic functions of the symmetrised bidisc G, and thereby find all automorphisms of G and a formula for the Carathéodory distance on G.

Let G be a subdivision of a ladder graph. In this paper we study magic evaluation with type (1, 1, 1) for a given any general ladder graph G. We prove that subdivided ladder admits magic evaluation having type (1, 1, 1). We also prove such a subdivision admits consecutive magic evaluation having type (1, 1, 0). AMS (MOS) Subject Classification Codes: 05C78