The goal of this paper is to define the n-connected regions in the Cartesian workspace of fully-parallel manipulators, i.e. the maximal regions where it is possible to execute pointto-point motions. The manipulators considered in this study may have multiple direct and inverse kinematic solutions. The N-connected regions are characterized by projection, onto the Cartesian workspace, of the conn...

spinoza’s theory of mind posits identity of mind and body in opposition to the cartesian dualistic tradition. these dualistic and monistic views of the mind and body have caused many reactions in the contemporary philosophy. feminists have objected to the dualisms which were resulted from cartesian tradition and criticized them. in doing so, they have found spinoza’s philosophy as a resolution ...

reliability wiener number is a modification of the original wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...

We compute the basic parameters (dimension, length, minimum distance) of affine evaluation codes defined on a cartesian product of finite sets. Given a sequence of positive integers, we construct an evaluation code, over a degenerate torus, with prescribed parameters. As an application of our results, we recover the formulas for the minimum distance of various families of evaluation codes.

A. Samsonov, C. Johnson Scientific Computing and Imaging Institute, University of Utah, Salt Lake City, Utah, United States Introduction: Projections onto convex set (POCS) formalism presents a powerful mathematical apparatus for solving many reconstruction problems that entail incomplete and inconsistent data. Recently, POCS formalism has been adopted for reconstruction of sensitivity encoded ...

We present a cubical type theory based on the Cartesian cube category (faces, degeneracies, symmetries, diagonals, but no connections or reversal) with univalent universes, each containing Π, Σ, path, identity, natural number, boolean, pushout, and glue (equivalence extension) types. The type theory includes a syntactic description of a uniform Kan operation, along with judgemental equality rul...

This note is an illustration of the density-increment method used in the proof of the density Hales-Jewett theorem for k = 3. (Polymath project [2]) I will repeat the argument applying it to a problem which is easier than DHJ. In the last section I will describe the proof of the density Hales-Jewett theorem for k = 3. The results stated here are direct interpretations of the project’s results, ...

This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form of a linear string of integers. The inputs or terminal set and node outputs are numbered sequentially. The node functions are also separately numbered. The genotype is just a list of node connections and functions. The...