Dokument-ID Dokumenttyp Verfasser/Autoren Herausgeber Haupttitel Abstract Auflage Verlagsort Verlag Erscheinungsjahr Seitenzahl Schriftenreihe Titel Schriftenreihe Bandzahl ISBN Quelle der Hochschulschrift Konferenzname Quelle:Titel Quelle:Jahrgang Quelle:Heftnummer Quelle:Erste Seite Quelle:Letzte Seite URN DOI Abteilungen
OPUS4-7879 Dissertation Sultanow, Eldar Real World Awareness in kollaborativen Unternehmensprozessen Berlin GITO 2015 221 Schriften der Forschungsvereinigung Software ; 3 978-3-95545-118-9 Wirtschaftswissenschaften
OPUS4-30565 Wissenschaftlicher Artikel Sultanow, Eldar; Vladova, Gergana; Weber, Edzard Overcoming communication barriers for CMC in enterprises 2009 978-0-615-30358-1 Wirtschaftswissenschaften
OPUS4-30393 Wissenschaftlicher Artikel Fröming, Jane; Gronau, Norbert; Sultanow, Eldar MDA-Werkzeuge : Softwareautomaten ; im Vergleich: jABC, AndroMDA und OpenArchitectureWare 2008 Wirtschaftswissenschaften
OPUS4-30404 Wissenschaftlicher Artikel Brockmann, Carsten; Gronau, Norbert; Sultanow, Eldar ERP und MES : Teil 3 2008 Wirtschaftswissenschaften
OPUS4-30416 Wissenschaftlicher Artikel Sultanow, Eldar; Weber, Edzard Klassifikation und Identifikation von Kommunikationsbarrieren in Unternehmen 2009 978-3-88579-239-0 Wirtschaftswissenschaften
OPUS4-30417 Wissenschaftlicher Artikel Sultanow, Eldar; Weber, Edzard Systeme für Dokumenten-Management (DMS) und Content Management (CMS) : Definitionen und Kategorien 2009 Wirtschaftswissenschaften
OPUS4-30418 Wissenschaftlicher Artikel Sultanow, Eldar; Weber, Edzard Management-Leitstände 2.0 : Kollaboration, Semantic Web und Web 3D 2009 Wirtschaftswissenschaften
OPUS4-35340 Wissenschaftlicher Artikel Sultanow, Eldar; Weber, Edzard Pharmataxigraphie Model of a Hybrid System of RFID Technology and optical Methods Aulendorf Editio-Cantor-Verl. für Medizin und Naturwiss. 2013 6 Die pharmazeutische Industrie 75 7 1197 + Institut für Biochemie und Biologie
OPUS4-39922 Bericht Sultanow, Eldar; Volkov, Denis; Cox, Sean Introducing a Finite State Machine for processing Collatz Sequences The present work will introduce a Finite State Machine (FSM) that processes any Collatz Sequence; further, we will endeavor to investigate its behavior in relationship to transformations of a special infinite input. Moreover, we will prove that the machine's word transformation is equivalent to the standard Collatz number transformation and subsequently discuss the possibilities for use of this approach at solving similar problems. The benefit of this approach is that the investigation of the word transformation performed by the Finite State Machine is less complicated than the traditional number-theoretical transformation. 1st version 2017 urn:nbn:de:kobv:517-opus4-399223 Wirtschaftswissenschaften
OPUS4-40473 Bericht Sultanow, Eldar; Volkov, Denis; Cox, Sean Introducing a Finite State Machine for processing Collatz Sequences The present work will introduce a Finite State Machine (FSM) that processes any Collatz Sequence; further, we will endeavor to investigate its behavior in relationship to transformations of a special infinite input. Moreover, we will prove that the machine's word transformation is equivalent to the standard Collatz number transformation and subsequently discuss the possibilities for use of this approach at solving similar problems. The benefit of this approach is that the investigation of the word transformation performed by the Finite State Machine is less complicated than the traditional number-theoretical transformation. 2nd version 2017 17 urn:nbn:de:kobv:517-opus4-404738 Wirtschaftswissenschaften
OPUS4-7289 Wissenschaftlicher Artikel Sultanow, Eldar; Weber, Edzard Prozessleitstände für verteilte und nichtplanbare Organisationsprozesse Berlin GITO 2014 9 Handbuch prozessorientiertes Wissensmanagement 978-3-95545-026-7 335 344 Wirtschaftswissenschaften
OPUS4-43008 Bericht Sultanow, Eldar; Koch, Christian; Cox, Sean Collatz Sequences in the Light of Graph Theory The Collatz conjecture is a number theoretical problem, which has puzzled countless researchers using myriad approaches. Presently, there are scarcely any methodologies to describe and treat the problem from the perspective of the Algebraic Theory of Automata. Such an approach is promising with respect to facilitating the comprehension of the Collatz sequences "mechanics". The systematic technique of a state machine is both simpler and can fully be described by the use of algebraic means. The current gap in research forms the motivation behind the present contribution. The present authors are convinced that exploring the Collatz conjecture in an algebraic manner, relying on findings and fundamentals of Graph Theory and Automata Theory, will simplify the problem as a whole. 2019 15 urn:nbn:de:kobv:517-opus4-430089 10.25932/publishup-43008 Wirtschaftswissenschaften
OPUS4-44185 Bericht Sultanow, Eldar; Koch, Christian; Cox, Sean Collatz Sequences in the Light of Graph Theory It is well known that the inverted Collatz sequence can be represented as a graph or a tree. Similarly, it is acknowledged that in order to prove the Collatz conjecture, one must demonstrate that this tree covers all (odd) natural numbers. A structured reachability analysis is hitherto not available. This paper investigates the problem from a graph theory perspective. We define a tree that consists of nodes labeled with Collatz sequence numbers. This tree will be transformed into a sub-tree that only contains odd labeled nodes. The analysis of this tree will provide new insights into the structure of Collatz sequences. The findings are of special interest to possible cycles within a sequence. Next, we describe the conditions which must be fulfilled by a cycle. Finally, we demonstrate how these conditions could be used to prove that the only possible cycle within a Collatz sequence is the trivial cycle, starting with the number 1, as conjectured by Lothar Collatz. 3rd version 2020 29 urn:nbn:de:kobv:517-opus4-441859 10.25932/publishup-44185 Wirtschaftswissenschaften
OPUS4-43741 Bericht Sultanow, Eldar; Koch, Christian; Cox, Sean Collatz Sequences in the Light of Graph Theory The Collatz conjecture is a number theoretical problem, which has puzzled countless researchers using myriad approaches. Presently, there are scarcely any methodologies to describe and treat the problem from the perspective of the Algebraic Theory of Automata. Such an approach is promising with respect to facilitating the comprehension of the Collatz sequence's "mechanics". The systematic technique of a state machine is both simpler and can fully be described by the use of algebraic means. The current gap in research forms the motivation behind the present contribution. The present authors are convinced that exploring the Collatz conjecture in an algebraic manner, relying on findings and fundamentals of Graph Theory and Automata Theory, will simplify the problem as a whole. 2nd version 2019 21 urn:nbn:de:kobv:517-opus4-437416 10.25932/publishup-43741 Wirtschaftswissenschaften
OPUS4-44325 Bericht Sultanow, Eldar; Koch, Christian; Cox, Sean Collatz Sequences in the Light of Graph Theory It is well known that the inverted Collatz sequence can be represented as a graph or a tree. Similarly, it is acknowledged that in order to prove the Collatz conjecture, one must demonstrate that this tree covers all odd natural numbers. A structured reachability analysis is hitherto not available. This paper investigates the problem from a graph theory perspective. We define a tree that consists of nodes labeled with Collatz sequence numbers. This tree will be transformed into a sub-tree that only contains odd labeled nodes. The analysis of this tree will provide new insights into the structure of Collatz sequences. The findings are of special interest to possible cycles within a sequence. Next, we describe the conditions which must be fulfilled by a cycle. Finally, we demonstrate how these conditions could be used to prove that the only possible cycle within a Collatz sequence is the trivial cycle, starting with the number one, as conjectured by Lothar Collatz. 4th version 2020 31 urn:nbn:de:kobv:517-opus4-443254 10.25932/publishup-44325 Wirtschaftswissenschaften
OPUS4-48214 Bericht Sultanow, Eldar; Koch, Christian; Cox, Sean Collatz Sequences in the Light of Graph Theory It is well known that the inverted Collatz sequence can be represented as a graph or a tree. Similarly, it is acknowledged that in order to prove the Collatz conjecture, one must demonstrate that this tree covers all odd natural numbers. A structured reachability analysis is hitherto unavailable. This paper investigates the problem from a graph theory perspective. We define a tree that consists of nodes labeled with Collatz sequence numbers. This tree will be transformed into a sub-tree that only contains odd labeled nodes. Furthermore, we derive and prove several formulas that can be used to traverse the graph. The analysis covers the Collatz problem both in it's original form 3x + 1 as well as in the generalized variant kx + 1. Finally, we transform the Collatz graph into a binary tree, following the approach of Kleinnijenhuis, which could form the basis for a comprehensive proof of the conjecture. Fifth version 2020 47 urn:nbn:de:kobv:517-opus4-482140 10.25932/publishup-48214 Wirtschaftswissenschaften