Surface-surface intersection: auxiliary spheres.
Sweep coverage of discrete time multi-robot networks with general topologies
This paper addresses a sweep coverage problem of multi-robot networks with general topologies. To deal with environmental uncertainties, we present discrete time sweep coverage algorithms to guarantee the complete coverage of the given region by sweeping in parallel with workload partition. Moreover, the error between actual coverage time and the optimal time is estimated with the aid of continuous time results. Finally, numerical simulation is conducted to verify the theoretical results.
SXCCP+: Simple XML Concurrency Control Protocol for XML Database Systems
Symbol Declarations in Mathematical Writing
We present three corpus-based studies on symbol declaration in mathematical writing. We focus on simple object denoting symbols which may be part of larger expressions. We look into whether the symbols are explicitly introduced into the discourse and whether the information on once interpreted symbols can be used to interpret structurally related symbols. Our goal is to support fine-grained semantic interpretation of simple and complex mathematical expressions. The results of our analysis empirically...
Symbolic computation of variational symmetries in optimal control
Symbolic Derivation Without Using Expression Trees
Symbolic discrepancy and self-similar dynamics
We consider subshifts arising from primitive substitutions, which are known to be uniquely ergodic dynamical systems. In order to precise this point, we introduce a symbolic notion of discrepancy. We show how the distribution of such a subshift is in part ruled by the spectrum of the incidence matrices associated with the underlying substitution. We also give some applications of these results in connection with the spectral study of substitutive dynamical systems.
Symbolic Implementation of the Hooke-Jeeves Method
Symmetric flows and broadcasting in hypercubes
In this paper, we propose a method which enables to construct almost optimal broadcast schemes on an -dimensional hypercube in the circuit switched, -port model. In this model, an initiator must inform all the nodes of the network in a sequence of rounds. During a round, vertices communicate along arc-disjoint dipaths. Our construction is based on particular sequences of nested binary codes having the property that each code can inform the next one in a single round. This last property is insured...
Symmetry breaking in graphs.
Symmetry vs. asymmetry.
Synchronized EOL forms under uniform interpretation
Synchronous parallelizations of serial computer programs
Syntactic complexity of regulated rewriting
Syntactic congruences and syntactic algebras
Syntactical definitions of program and flow diagram
Syntaktická analýza textu
Syntéza a minimalizace regulárních lineárních generátorů
Synthesis of finite state machines for CPLDs
The paper presents a new two-step approach to FSM synthesis for PAL-based CPLDs that strives to find an optimum fit of an FSM to the structure of the CPLD. The first step, the original state assignment method, includes techniques of twolevel minimization and aims at area minimization. The second step, PAL-oriented multi-level optimization, is a search for implicants that can be shared by several functions. It is based on the graph of outputs. Results of experiments prove that the presented approach...
Synthesis of non-initial automata