Let S be a double occurrence word, and let MS be the word’s interlacement matrix, regarded as a matrix over GF (2). Gauss addressed the question of which double occurrence words are realizable by generic closed curves in the plane. We reformulate answers given by Rosenstiehl and by de Fraysseix and Ossona de Mendez to give new graph-theoretic and algebraic characterizations of realizable words....

The near future will present large scale parallel computers, able to provide computing power of more than one TFlop per second. It is commonly agreed that these systems will be based on the model of asynchronous processors connected by a point to point network. There are a number of diierent network architectures presented in the past. In this paper we present an architectural principle that co...

This is a complete exposition of a tight version of a fundamental theorem of computational complexity due to Levin: The inherent space complexity of any partial function is very accurately speciiable in a 1 way, and every such speciication that is even 2 does characterize the complexity of some partial function, even one that assumes only the values 0 and 1.

In this paper, we develop a novel method to design the elements of an antenna array and their feed weights simultaneously. The is based on formulating problem as non-linear multi-objective optimization model that estimates realized gain at certain angles function element-level port signals impedances, array-level for elements. This enables utilization genetic algorithms find optimal signals, gi...

This paper studies the realizability property of bilinear input-output (i/o) models in the classical state space form. Constraints on the parameters of the bilinear i/o model are suggested that lead to realizable models. The complete list of 2nd and 3rd order realizable inputoutput bilinear models together with the corresponding state equations is given. In the general case some subclasses of r...

This analysis investigates the distortion of flow measurement and the increase of cavitation along orifice flowmeter. The analysis using the numerical method (CFD) validated the distortion of flow measurement through the inlet velocity profile considering the convergence and grid dependency. Realizable k-e model was selected and y+ was about 50 in this numerical analysis. This analysis also est...

1An abridged version (Jabalameli and Behal, 2015) of this paper was presented at the 2015 International Conference on Computational Advances in Bio and Medical Sciences.The study was supported by Award # R15NS062402 from NINDS. The content is solely the responsibility of the authors and does not necessarily represent the official views of the NINDS or the NIH. ar X iv :1 80 3. 04 23 6v 1 [ qbi ...

Numerical simulations have been undertaken for the benchmark problem in a Square cavity by using computational fluid dynamics software. This work aims at discussing the fundamental numerical and computational fluid dynamic aspects which can lead to the definition of the following meshing methods and turbulence models. The meshes used for the simulation are hexahedral, hexahedral cell with near ...

In this paper, we propose a method for realizing a polyhedral graph as a deltahedron, i.e., a polyhedron with congruent equilateral triangles as faces. Our experimental result shows that there are graphs that are not realizable as deltahedra. We provide an example of non-realizable graphs which are obtained by trying to construct deltahedra from each of the simple cubic polyhedral graphs with u...