• Facets (new session)
• Description
• Metadata
• Settings
  • Rule: ActivityStreamsMapasEquivalentb3sb3sifpdbprdf-labelfacetshttp://dbpedia.org/resource/inference/rules/dbpedia#http://dbpedia.org/resource/inference/rules/opencyc#http://dbpedia.org/resource/inference/rules/umbel#http://dbpedia.org/resource/inference/rules/yago#http://dbpedia.org/schema/property_rules#http://www.ontologyportal.org/inference/rules/SUMO#http://www.ontologyportal.org/inference/rules/WordNet#http://www.w3.org/2002/07/owl#ldpoplwebskos-transurn:det:rdf:labelvirtrdf-labelvirtrdf-urlNone
    
  • Inverse Functional Properties: Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects
  • "Same As": Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects (recommended) Apply to subjects, objects and predicates (not recommended on big datasets) Apply to predicates only (special use cases only)

About: Circular shift     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatProgrammingConstructs, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)

Type: yago:Abstraction100002137yago:Change107296428yago:Cognition100023271yago:Concept105835747yago:Content105809192yago:Event100029378yago:Happening107283608yago:Idea105833840yago:PsychologicalFeature100023100yago:YagoPermanentlyLocatedEntityyago:Substitution107443761yago:Variation107337390yago:WikicatPermutationsyago:WikicatProgrammingConstructs New Facet based on Instances of this Class

In combinatorial mathematics, a circular shift is the operation of rearranging the entries in a tuple, either by moving the final entry to the first position, while shifting all other entries to the next position, or by performing the inverse operation. A circular shift is a special kind of cyclic permutation, which in turn is a special kind of permutation. Formally, a circular shift is a permutation σ of the n entries in the tuple such that either modulo n, for all entries i = 1, ..., n or modulo n, for all entries i = 1, ..., n.