Search results for "reduction"
showing 10 items of 2058 documents
The terminal hyperspace of homogeneous continua
2010
Abstract We investigate the structure of the collection of terminal subcontinua in homogeneous continua. The main result is a reduction of this structure to six specific types. Three of these types are of one-dimensional spaces, and examples representing these types are known. It is not known whether higher dimensional examples having non-trivial terminal subcontinua and representing the three remaining types exist.
On the computational power of affine automata
2017
We investigate the computational power of affine automata (AfAs) introduced in [4]. In particular, we present a simpler proof for how to change the cutpoint for any affine language and a method how to reduce error in bounded error case. Moreover, we address to the question of [4] by showing that any affine language can be recognized by an AfA with certain limitation on the entries of affine states and transition matrices. Lastly, we present the first languages shown to be not recognized by AfAs with bounded-error.
The Action of the Symplectic Group Associated with a Quadratic Extension of Fields
1999
Abstract Given a quadratic extension L/K of fields and a regular alternating space (V, f) of finite dimension over L, we classify K-subspaces of V which do not split into the orthogonal sum of two proper K-subspaces. This allows one to determine the orbits of the group SpL(V, f) in the set of K-subspaces of V.
An Exact Algorithm for the Quadratic Assignment Problem on a Tree
1989
The Tree QAP is a special case of the Quadratic Assignment Problem (QAP) where the nonzero flows form a tree. No condition is required for the distance matrix. This problem is NP-complete and is also a generalization of the Traveling Salesman Problem. In this paper, we present a branch-and-bound algorithm for the exact solution of the Tree QAP based on an integer programming formulation of the problem. The bounds are computed using a Lagrangian relaxation of this formulation. To solve the relaxed problem, we present a Dynamic Programming algorithm which is polynomially bounded. The obtained lower bound is very sharp and equals the optimum in many cases. This fact allows us to employ a redu…
Symmetry-assisted adversaries for quantum state generation
2011
We introduce a new quantum adversary method to prove lower bounds on the query complexity of the quantum state generation problem. This problem encompasses both, the computation of partial or total functions and the preparation of target quantum states. There has been hope for quite some time that quantum state generation might be a route to tackle the $backslash$sc Graph Isomorphism problem. We show that for the related problem of $backslash$sc Index Erasure our method leads to a lower bound of $backslash Omega(backslash sqrt N)$ which matches an upper bound obtained via reduction to quantum search on $N$ elements. This closes an open problem first raised by Shi [FOCS'02]. Our approach is …
Circular sturmian words and Hopcroft’s algorithm
2009
AbstractIn order to analyze some extremal cases of Hopcroft’s algorithm, we investigate the relationships between the combinatorial properties of a circular sturmian word (x) and the run of the algorithm on the cyclic automaton Ax associated to (x). The combinatorial properties of words taken into account make use of sturmian morphisms and give rise to the notion of reduction tree of a circular sturmian word. We prove that the shape of this tree uniquely characterizes the word itself. The properties of the run of Hopcroft’s algorithm are expressed in terms of the derivation tree of the automaton, which is a tree that represents the refinement process that, in the execution of Hopcroft’s alg…
Automated detection and localization system of myocardial infarction in single-beat ECG using Dual-Q TQWT and wavelet packet tensor decomposition.
2019
Abstract Background and objective It is challenging to conduct real-time identification of myocardial infarction (MI) due to artifact corruption and high dimensionality of multi-lead electrocardiogram (ECG). In the present study, we proposed an automated single-beat MI detection and localization system using dual-Q tunable Q-factor wavelet transformation (Dual-Q TQWT) denoising algorithm. Methods After denoising and segmentation of ECG, a fourth-order wavelet tensor (leads × subbands × samples × beats) was constructed based on the discrete wavelet packet transform (DWPT), to represent the features considering the information of inter-beat, intra-beat, inter-frequency, and inter-lead. To red…
A Mesh-free Particle Method for Transient Full-wave Simulation
2007
A mesh-free particle method is presented for electromagnetic (EM) transient simulation. The basic idea is to obtain numerical solutions for the partial differential equations describing the EM problem in time domain, by using a set of particles, considered as spatial interpolation points of the field variables, arbitrarily placed in the problem domain and by avoiding the use of a regular mesh. Irregular problems geometry with diffused non-homogeneous media can be modeled only with an initial set of arbitrarily distributed particles. The time dependence is accounted for with an explicit finite difference scheme. Moreover the particle discretization can be improved during the process time ste…
A coupled Finite Volume–Smoothed Particle Hydrodynamics method for incompressible flows
2016
Abstract An hybrid approach is proposed which allows to combine Finite Volume Method (FVM) and Smoothed Particle Hydrodynamics (SPH). The method is based on the partitioning of the computational domain into a portion discretized with a structured grid of hexahedral elements (the FVM-domain ) and a portion filled with Lagrangian particles (the SPH-domain ), separated by an interface made of triangular elements. A smooth transition between the solutions in the FVM and SPH regions is guaranteed by the introduction of a layer of grid cells in the SPH-domain and of a band of virtual particles in the FVM one (both neighboring the interface), on which the hydrodynamic variables are obtained throug…
Polymer Synthesis in Supercritical Carbon Dioxide
2003
It is current opinion of most of the people involved in supercritical fluids (SCFs) technology that as the end of the twentieth century has been devoted to enlarge exploitation of compressed gases in separation processes the beginning of the twenty-first will be mainly aimed to improve their utilisation as solvents for reactions.