Home → News 2014 May
 
 
News 2014 May
   
 

01.May.2014
Style of Speed Further steps
In the last days, we have worked on the basic concepts and designs of our Orbital SpacePlanes (OSPs) and AeroSpacePlanes (ASPs) fur- ther that resulted into several modifications and considerations.
The first development is related with our Thermal Protection System (TPS) that features now an old technology, that matured in recent years, and a new technology developed by us in the last days to re- duce the stress on the applied materials.
In a subsequent step we generalized our new technology used for the reworked TSP that potentially led to a new way how OSPs and ASPs can be constructed.
Also, we would like to give the information that we now are consid- ering the general concept of the Aerial Propellant Transfer (APT) operation mode officially (see also the concept of the One-and-a-Half-Stage-To-Orbit Reusable Launch Vehicle (OaHSTORLV) Black Horse). The APT operation mode applies aerial refueling of a launch vehicle, that leads to a reduction of the takeoff gross weight of an OSP or an ASP, that again leads to significant changes, specifically either a smaller design with reduced size and weight, or an increased payload, and hence results in a reduced overall cost eventually.
We extended the basic concepts of our ASPs X-3*/LittleStar and Space Shuttle III/BigStar with the option to launch in the APT mode.
A further consideration made is to use H2O2/RP-1 or even H202/JP-5 for the LittleStar and the BigStar as propellants, that support the APT operation mode in an ideal way, because hydrogen peroxide and kerosene are non-cryogenic at room temperature and in this way make the construction of a tanker aircraft and the accomplishment of the APT operation much easier by far.
Even better, two virtually identical ASPs could be taken, one loaded with a common payload and the other one loaded with fuel, and flown in the ATP mode and with a reduced speed to a suborbital trajectory at first, which is fuel-efficient and gentle on material. Then in free fall exhibiting zero gravity the propellant loaded in the one ASP could be pumped to the other ASP, which would take on the function of an OSP and fly further to Low Earth Orbit (LEO). For sure, this special ATP mode of operation works with a Two-Stage-To-Orbit Launch Vehicle (TSTOLV) as well, though in this case two different launch vehicles have to be constructed and used on the one hand, but on the other hand these two vehicles could be optim- ized for their different tasks.


03.May.2014
Style of Speed Further steps
While reviewing our latest developments related with our Thermal Protection System (TPS; see the Further steps of the 1st of May 2014), we developed the basic concept further by applying another relatively new technology of us, which can be used as an alternative to our other TPSs on the one hand, but can also be integrated with them on the other hand. These new TPS technologies are not limited to Orbital Space Planes (OSPs) and can be used with our Hyperjets and Hypersoars as well.


04.May.2014
intelliTablet Further steps Iri #4
We have finished the next five basic design concepts for our Iri plat- form (for a short list of all variants see the Further steps Iri #2 of the 26th of April 2014).


05.May.2014
Comment of the Day
Superspace™
Superspacer™
Cybercore™
Spacecore™
Timecore™
Transspace™
Transtime™
Element Cyber™
Element Space™
Element Time™
Cyber Element™
Space Element™
Time Element™

Original vs. Inspiration
iRaiment Smartwatch Designs
We complemented our smartwatch collection with some more designs of our Classic Series and Modern Series:

→ iRaiment Smartwatch Cybergraph  Design→ iRaiment Smartwatch Cybergraph Transspace Design
→ iRaiment Smartwatch Cybergraph Cybercore Design→ iRaiment Smartwatch Cybergraph Elementum Cyber Design
© Breitling, Suunto, and iRaiment

The images will be updated with Graphical User Interfaces (GUIs).

intelliTablet Further steps Iri #5
We extended three of the new basic design concepts for our Iri plat- form that we have finished yesterday.


06.May.2014
Ontonics Further steps
We have added two new laptop models (see the Further steps of the 25th of April 2014) with truly amazing functionalities.


07.May.2014
Ontonics Further steps
We developed an extension for a device.

intelliTablet Further steps Iri #6
For sure, our Iri platform is also integrated with our P@d computer technology (for our original and unique concept see for example the intelliTablet Further steps One Tablet Per Child (OTPC) and One Pad Per Child (OPPC/OP²C) #16 of the 28th of April 2014 once again) that comprises a battery/accumulator dock, a keyboard dock with battery, and much more modules as options.

John Freund Lego Laptop Model → Iri Tablet Computer with Keyboard Dock MockupLego cased Laptop → Iri Tablet Computer with Keyboard Dock Prototype
Peter Howkins Lego cased A7000 Laptop → Iri Tablet Computer with Keyboard Dock MockupPeter Howkins Lego cased A7000 Laptop → Iri Tablet Computer with Keyboard Dock Prototype
© John Freund, :(, and Peter Howkins


08.May.2014
Clarification #1
"Smartwatches and smart wearables have yet to become main- stream devices, with many being bought but discarded within six months because they do not offer a compelling reason to consist- ently use them.", [The Guardian, Today]. This is well known by everybody, who followed for example the way the Spot technology of the company Microsoft took and the comment of the company Swatch to the actual smartwatch trend: No interest. Also, high- quality smartwatches are still expensive, actually.
So, why is iRaiment active in this field of mobile devices? Simply be- cause we are true watch enthusiasts not driven by the data kraken or share holder paranoias. The latter is also the reason why we are still watching for watches like e.g. The Black Watch of the company Sinclair.
By the way: Who wants to manufacture our iR smartwatches?

Clarification #2
For sure, because it is not too general and commonly used, definite- ly, we claim the copyright for our original and unique description of the integration of a drone (e.g. a multirotor air vehicle like a quad- copter or an octocopter) with mobile rapid prototyping technologies/ 3D printing that literally even can work on-the-fly (see for example the description of the McNano Mobile technology in conjunction with our Flying LAN and Carrier Pigeon 2.0 solutions, and all contents of the 15th of June 2013). That we only gave the production of food on a molecular scale as a special example does not change the fact about the true origin of this foundational general concept, because 3D printing of food on the nanoscale on the fly or on the ground after landing still belongs to this field of technology.

Exactly like for example the idea of integrating mobile handheld dev- ices with 3D sensors, 3D displays, and 3D gesture control among other features, this flying rapid replicator concept also is too special and unusual, because the idea has this little touch of craziness as well as prevision, which is so high enough that the general public was unable to create it at all and the industry is afraid to touch and produce it at first, and hence makes it an original and unique work.
Because of taking the risk of being seen as abnormal, crazy or freaky for example, an artist gets the copyrights for the expression and the meaning of such works respectively ideas. In many cases of C.S. a work is the idea's description itself that has as the meaning the idea itself, and using another wording for describing the same idea still expresses exactly the same meaning of the work in the same context, which disqualifies such a way of copying in whole or only in part as a legal act, because nothing new, original and unique is added in this way, as it would be needed in a case covered by the fair use clause.

Ontonics Further steps
We have developed a new electric component.

Also, we have developed mobile devices further in two different ways.

In addition, we have developed another mobile device further.

Moreover, we have added two new models of a multimedia device with truly fascinating functionalities.

Finally, we developed an old solution further.


09.May.2014
Ontonics Further steps
We have developed a mobile device further. This includes its funct- ionality as well as its design.

Also, we have developed another mobile device further. This includes its functionality, its design, as well as the applied materials for its production.

Indeed, in both cases we made again some of these little steps of development that are simple but have not been conceived before on the one hand and on the other hand make the difference and hope- fully awake this must-have feeling. Now, it is time for presenting at least mockups or even a functional prototypes to test the reactions of the public.


12.May.2014
OntoLix and OntoLinux Further steps 11:00 CET
The Further steps of the 20th of February 2014 have to be seen in relation with the Ontonics, OntoLab, Ontologics, OntoLix and Onto- Linux Further steps of the same day as well, and due to several comprehensible reasons we have not explicitly named some specific software libraries with basic functions for the processing and analys- ing of graphs, specifically of extremely large graphs, which do not fit into the available primary storage/main memory of a single computer. Instead we have pointed on these libraries only in an implicit but still unmistakable way with the phrases "Latent Dirichlet Allocation (LDA), and more, inclusive their distributed parallel versions" and "We are also looking at some other packages in the fields of Machine Learning (ML), Data Mining (DM), and NLP, as well as basic graph processing and analytics".
Also at that time, we have begun already with the rework respect- ively the extension and the adaption of one of the related graph- oriented techniques called parallel sliding windows, that is only a general and simple way to partition, process, and compute on a graph, so that it can be integrated with our log-structured, hash- based, and row- and column-oriented file database system, which is a product of the already given integration of our Reflection DB and our Log-Structured Hash-Based File System. In a first step, this graph-oriented technique has to be extended in such a way that it features the functionality of for example our Reflection DB, which means to add some additional indices to the basic data structure missed by the developers in the last two years and to update the related functions in such a way that the technique can handle in- coming edges (in-edges) and outgoing edges (out-edges) of graph vertices efficiently at the same time. In a second step, the implem- entation of the technique has to be harmonized with the basic data structures and algorithms of our Log-Structured Hash-Based File System. After putting all together we get a log-structured, hash- based, row- and column-oriented data storage system in the end, that can handle graphs now, which represent the files and the dir- ectories, but also the functions, data, and metadata if useful, and constitutes one of the foundations of our OntoFS, which belongs to the class of file database systems, and hence is mentioned in the descriptions of both systems and also constitutes the system, that unites all features.
Sadly to say, two researchers recognized the phrases mentioned above, because their are based on the contents of the websites of their two related graph libraries, and somehow cloned essential parts of our concept presented with the descriptions of our Reflection DB, our Log-Structured Hash-Based File System, and the connected Further steps of the 20th of February 2014 as a reaction. But luckily, they failed to do it correctly (see also the Investigations::Multimedia of today below and the OntomaX Website of today above) and we now have at least a potential initial data structure for a working pro- totyp of OntoFS, which can handle the whole operating system, the applications, and the data of the applications and the user, and a prove that parts of our system really work and that in the end the whole OntoFS will work in practice as expected and claimed.

This is a serious copyright warning in respect to the general con- cept, the specific concepts of the collection, selection, dissection, and re-integration of foundational elements, as well as the system architecture and the components.

Investigations::Multimedia

  • Carnegie Mellon University and University of Washington: Two researchers of the universities saw our informations publicated on the 20th of February 2014, directly recognized that we pointed to their software libraries for the processing and analysing of graphs, decided to jointly write a document about a graph database system, and finally publicated this document on the 4th of March 2014, that is exactly one year after we publicated the description of our Re- flection DB concept by the way (see also the OntoLix and OntoLinux Further steps of today above). As we could prove with this invest- igative case, the document is based on the description of our Re- flection DB and our Log-Structured Hash-Based File System con- cepts, on their integration to a log-structured, hash-based, row- and column-oriented data storage system, that can also handle graphs and constitutes one of the foundations of our OntoFS, and on as many as possible of the other elements of the building blocks and related technical terms listed in the OntoLix and OntoLinux Fur- ther steps on the 20th of February 2014. In addition, one author also included the said graph database system respectively our log- structured, hash-based, row- and column-oriented data storage system in his thesis, while the other author is a member of the rel- ated thesis committee and also the founder of a related company.
    At first, we quote from the document that is called "Gaph[...]-DB: Simple Design for a Scalable Graph Database System on Just a PC": "The [data] structure is based on the graph storage model of [the so-called parallel sliding windows technique], but we extend it to enable online database features such as queries and fast insert- ions. In addition, we extend the model with edge and vertex attrib- utes. Compared to previous data structures, [the data structure] can store graphs more compactly while allowing fast access to both the incoming and the outgoing edges of a vertex, without duplicating data. Based on [the data structure], we design a graph database management system, Graph[...]-DB, which can also execute power- ful analytical graph computation. [Obviously, everything mentioned here can be found in the description of our Reflection DB concept and in the related Further steps of the 20th of February 2014. Also, the presented data structure is based on arrays, that were added to the initial data structure of the basic graph handling technique to hold missing indices and additional data. Such data structures are commonly used in computer science and it even might be that an already existing solution was used.]", "[...] cluster by partitioning the graph so that each machine can store a part in memory. On the other hand, the database community has been working on specializ- ed graph databases [...] Systems offering both database functional- ity and largescale analytical computation for graphs include the dis- tributed systems [...] [Compare this introductory overview about distributed and specialized graph stores with the related informations we gave on the 20th of February 2014.]", "[...] Partitioned [...] [At this point we would like to mention already, that in the context of the parallel sliding windows technique the term shard was used in the past on the one hand and that on the other hand the term part- ition is also used in the field of file systems.]", "We adapt the Log- Structured Merge Tree (LSM-tree) [...] to obtain very high insert performance. [This is important to quote due to the two facts that the database management system library SQLite(4) uses an LSM- tree data structure as well and is also a part of the Virtual OntoFS variant.]", "[...] simplicity [...]", "[...] the data structure is based on immutable flat arrays, simplifying greatly the system design because complex mechanisms are not needed for protecting the integrity of the data structure in case of failures [...] [The integrity of a basic data structure in a case of a failure is not the problem, but the integrity of the data that is stored and organized with it. So if we understand the authors correctly, then they tell us here that the data structure itself is data in the sense of a file used to store an embedded database, which again reflects an essential part of our OntoFS in the overall context. It is also important to quote this statement, because it gives us a differentiation between the pres- ented clone Graph[...]-DB from our original and unique log-structur- ed, hash-based, row- and column-oriented data storage systems, inclusive our OntoFS, and in this way narrows the range of applic- ations of its Graph[...]-DB. By the way, most of the time of devel- opment processes of file and database systems is focused on com- plex mechanisms to ensure the integrity of the data handled with such data storage systems. In the event that the authors suddenly will change their minds we will take this statement as a foundation for further investigations.]", "[...] our design is flexible and allows [a] user to choose a model that best suits a particular workload: for example, Graph[...]-DB can be used as an OLAP data warehouse for analytics or as an online graph database processing hundreds of thousands of writes per second. [First of all, we do not understand how a user is able to chose a model, if only one specific data struct- ure is given as the model. Also, see the OntoLix and OntoLinux Fur- ther steps of the 20th of February 2014 again to find out that we listed the point multi-model, tuple and graph stores and already ex- plained that "our Ontologic Systems (OSs) give a user or a machine exactly the right data storage and retrieval systems, which [...] comprise OnLine Analytical Processing (OLAP), and OnLine Transact- ion Processing (OLTP) on the application side", and that "the proto- type of OntoFS [...] consists of building blocks that feature elem- ents of: file systems [and ... data] stores [...]". We also gave the explanation in the description of our Reflection DB that "row-oriented databases are best suited for [...] OnLine Transaction Processing (OLTP), while column-oriented databases are best suited for [...] OnLine Analytical Processing (OLAP)". Doubtlessly, this is the next clear evidence that the authors do know our works very well and deliberately infringed our copyright.]", "Adjusting the parameters of the [data] structure, Graph[..]-DB can be tuned for various types of workloads. [Somehow, this reminds us of the feature of dynamic re- finement of OntoFS. Besides of this and the claim about the possib- ility to choose a model (see the previous quote), there are only some few parameters for the definition of the data structure avail- able that even might be unimportant for the majority of the users in practice.]", "[...] Adjacency lists allow fast access to the in- or out- neighbors of a vertex. If access to both in- and out-neighbors is required, two adjacency lists must be stored for each vertex (other- wise, finding in-neighbors from an out-adjacency list requires a full scan). [...] If access to both in- and out-neighbors is required, the storage requirements are doubled. [These are the main reasons why we developed solutions with our Reflection DB concept in the year 2013 for our OntoFS, because "In this way, the advantages of both approaches can be obtained". The description of the Reflection DB mentions also at least two variants that do not duplicate the data, which proves that this statement was deliberately made to be highly misleading, because the concept presented by the authors is not an invention of them at all, as also claimed in the thesis of one of the authors (see the related section below), but just only a specific im- plementation of some parts of our original and unique concept of a log-structured, hash-based, row- and column-oriented data storage system, which surely is also the reason why it has not been refer- enced in the quoted document by the authors and in the thesis.]", "[...] B-tree [...] [See again the list given in the OntoLix and Onto- Linux Further steps of the 20th of February 2014 and the referenced embedded database library SQLite3, and keep in mind that a B+ tree can be viewed as a B-tree somehow.]", "[...] edge attributes are stored in column-oriented storage symmetrically to the adjacency information [...] [See the points column and column, relational stores of the list given in the OntoLix and OntoLinux Further steps of the 20th of February 2014 and again the description of our Reflection DB.]", "[...] ordered tuple [...] [See the points tuple, and multi-mod- el, tuple and graph stores, as well as the related features of e.g. the key-value stores Lightning Memory-mapped DataBase (LMDB), Kyoto Cabinet and Tarantool of the list given in the OntoLix and OntoLinux Further steps of the 20th of February 2014.]", "Both edges and vert- ices can have attributes, organized in typed columns [...] [See the related quotes and comments before.]", "[...] partition(i) [... foot- note] We do not use the term "shard" as used by [the parallel sliding windows technique] to avoid confusion with the other uses of the term. [We think that this decision is also related with our decision to list the points vertical partitioning (colum-oriented) and horizontal partitioning/splitting into shards (row-oriented) in the OntoLix and OntoLinux Further steps of the 20th of February 2014. Later, we come to this point in another comment again.]", "[...] in the online setting the distribution of edges is not known beforehand. To bal- ance the edge distribution, Graph[...]-DB uses a reversible hash function to map the vertex IDs so that edges are, in expectation, distributed evenly into partitions [...] [See the point hash tables, the file system feature Dirhash and the related file system Magma, the key-value store Kyoto Cabinet, specifically its File Hash Data- base (HashDB), File Tree Database (TreeDB), Cache Hash Database (CacheDB), and Grass Tree Database (GrassDB) data structures, and again our Log-Structured Hash-Based File System of the list given in the OntoLix and OntoLinux Further steps of the 20th of February 2014. Indeed, to use a hash-based approach to manage a distribut- ion of data, like e.g. a consistent hashing with finger tables and hash tables, comes from techniques like distributed caching, partit- ioning of databases, load balancing of web servers, online file shar- ing, and peer-to-peer file systems for example. But to integrate it with an also unusual row- and column-oriented database was not described before us as far as we know. At this point, the authors have described a log-structured, hash-based, and row- and column-oriented data storage system, that without any doubts reflects ma- ny essential, unusual features of our original data storage systems, specifically of our OntoFS. Said this, we have here the next evid- ence of the authors' plagiarism and due to the explanations that were given so far our claim of the copyright infringement in relation with our descriptions is proven already.]", "[...] file structure [...] [Now, we can wait for the day, when the directory structure is de- scribed as well.]", "The [data structure] model allows both row-ori- ented and column-oriented storage [...] of the edge attributes. [See again the description of our Reflection DB.]", "[...] store a key-value pair [...] [See the points of the list given in the OntoLix and OntoLi- nux Further steps of the 20th of February 2014 that contain the term key-value and the related databases as well.]", "[...] Log- Structured Merge-tree, which is a write-optimized data structure based on stacking B-trees into an overlay tree structure [...] [May- be we will see a B+ tree next time. We also mentioned already the database management system libraries SQLite with its LSM-tree basis and Kyoto Cabinet that also applies algorithms on B+ trees based on logging and merge sort, and their relations to our OntoFS. ]", "[...] memory mapping functionality provided by the operating system [...] uses the virtual memory system so files can be access- ed through ordinary pointers. [See for example the key-value stores Lightning Memory-mapped DataBase (LMDB), MemcacheDB, and also Kyoto Cabinet that we listed in the OntoLix and OntoLinux Further steps of the 20th of February 2014.]", "[...] semantics for transact- ions [...] [Besides the wordplay, we direct the reader to the point Atomicity, Consistency, Isolation, and Durability (ACID) of the list given in the OntoLix and OntoLinux Further steps of the 20th of February 2014.]", "With durable buffers, each edge insertion is first written into a log-file that is synced with the filesystem to guaran- tee durability over computer crash. [Obviously, we have here a two- level LSM-tree version as part of the log-structured and hash-based storage system. But more important is the statement that it "is synced with the filesystem" and not with one or more files resident on disk, which can be seen as a first step of integration of the da- tabase clone with a filesystem, which again leads to our Log-Struct- ured Hash-Based File System and eventually to our OntoFS. But it has to be seen as an attempt to confuse the reader of the docu- ment at least, because to use the phrase "synced with the filesyst- em" to describe the function of an LSM-tree was not needed at all. Now, the last critics should be convinced that we are right with our claim of plagiarism.]", "[...] SPARQL [...] [This term is a recursive acronym for SPARQL Protocol and RDF Query Language. See the point Resource Description Framework (RDF) of the list given in the OntoLix and OntoLinux Further steps of the 20th of February 2014 and the description of our OntoFS again. A further time, we have an evidence that taken together with the other presented evidences so far is convicting.]", "[...] did not implement a query language for Graph[...]-DB, but instead provide a Scala-API to access the graph [... (what follows is an excerpt of the given source code example)] val friends = queryVertex(queryId, DB) [...] believe the Scala API to be good alternative for a query language [...] [This explanation is related with the point "programming language with integrated data store interaction, direct access to the built-in data store OntoFS using simple symbolic program variables" that is given on the web- page of the OntoBlender software component of OntoLix and Onto- Linux. At this point, we can see again without any doubts, that our original concept of such a graph database system, which is a subst- antial part of our OntoFS, was copied from our descriptions.]", "[...] relational SQL database [...] [See the OntoLix and OntoLinux Further steps of the 20th of February 2014 and the description of OntoFS again.]", "[...] in-memory caching [...] [See the general-purpose distributed memory caching system Memcached that is referenced together with the key-value store MemcacheDB in the list given in the OntoLix and OntoLinux Further steps of the 20th of February 2014.]", "Graph[...]-DB stores variable length data by writing them into a separate log, similarly to a Log-Structured Filesystem [...]. The log-position of the value is then stored as the edge or vertex attribute. [See again the points related with the term log-structured in the list in the OntoLix and OntoLinux Further steps of the 20th of February 2014 and the related comments to quotes made before. At this point we do see a further time that an essential feature of a log-structured file system is used in conjunction with a log-structur- ed, hash-based, and row- and column-oriented storage system, and that our Reflection DB and our Log-Structured Hash-Based File Syst- em, and hence our OntoFS based on them have been approached from two different sides, which proves that the authors do know our solutions, do not want to respect our copyright, have already stolen our intellectual properties, and also cheated the scientific community with this quoted document. In the description of the Log-Structured Hash-Based File System we also mentioned the point "store inter- mediate key-score pairs, with the score being the hash of the data used as the data address" (score is a synonym for value), which should be compared with the explanation that "Graph[...]-DB uses a reversible hash function to map the vertex IDs", so that the applic- ation of very similar methods can be seen.]", "[...] RDF [...] [This is the acronym for the Resource Description Framework. It is also re- ferenced on the webpage of our OntoFS and in the list given with the OntoLix and OntoLinux Further steps of the 20th of February 2014.]", "[...] Graph[...]-DB could also be used as a backend for storing RDF triples [...] [Again, we have a clear evidence that the authors have copied a substantial feature of our OntoFS illegally.]", "The [data structure] model is specifically designed for storing graphs, and we argue that it has several advantages over generic relational or key-value stores. [Not surprisingly, we said the same before in a different way on the webpage of our OntoFS.]", "Howev- er, we do not necessarily agree with the argument often heard from the graph database industry that RDBMS are a fundamentally defic- ent technology for graph storage: for example, [the data structure] could be used as a special table storage engine of a RDBMS, and accessed via SQL. [In general, this is a ypical "blahbalicious" state- ment said by fraudsters in case they do not want to take a clear stand and was said due to the fact that we emphasize the relational data model all the time in relation with our OntoFS, as it can be seen with the related points of the list given in the OntoLix and OntoLinux Further steps of the 20th of February 2014. We are sure that every expert of our readers wondered at first that we listed the points column, relational stores, and also row, relational stores, as well as relational stores. This is again a clear evidence that elements of our concept have been copied without referencing.]", "An interesting property of [the data structure] is that it is highly adjustable [...]", and "We propose that it would be possible to build a system that automatically adapts to the observed workload, using techniques from Machine Learning. [We would be more precisely and hence say that they copied the proposition to build an adapting system. Again, this is doubtlessly an evidence that our work was copied, as it can be seen with the first two sections of the OntoLix and OntoLinux Further steps of the 20th of February 2014, where we proposed this possibility in conjunction with such a data store and for example Machine Learning (ML).]".
    From the discussion group related with the source code of the graph database system we quote two messages. The first message was publicated on the 16th of April 2014 by the author, who also manip- ulated his thesis, and contains the following informations: "I have just released the source code of Graph[...]-DB [...] the code is experimental, probably very buggy and has an awful API [...] The design and evalution of Graph[...]-DB can be found from preprint: [the document publicated on the 4th of March 2014 and quoted in the previous section]." The second message publicated on the 19th of April 2014 by the same person gives us the following informations: "[The parallel sliding windows method] is the core of my Ph.D. thesis, which I will defend soon. For my thesis, it would be useful to get some idea on how you use [the parallel sliding windows method], and what is good and bad about it."
    The following quotes were taken from the slides about the defending of the thesis that must have happended between the 20th of April and 8th of May 2014: ""only 3 hops" [In the context, this sounds like the 3³ Theme by C.S..]", "Thesis statement The Parallel Sliding Win- dows algorithm and the Partitioned Adjacency Lists data structure enable computation on very large graphs in external memory, on just a personal computer. [We could not study the thesis of A. Kyrola until today, but the related document quoted at first was publicated on the 4th of March 2014, just exactly one year after we publicated the description of our Reflection DB in the Innovation-Pipeline of Ontonics, and the slapdash source code was uploaded respectively publicated on the 16th of April 2014 the first time (see above for the related quoted message). Taken the facts together, it becomes obvi- ous that the document of the 4th of March 2014 has to be seen as some kind of a white paper, which seems to be extended somehow with data taken from experiments with the initial parallel sliding win- dows algorithm to give it an appearance of authenticity, and that the related concept and specific features of OntoFS were copied into the thesis after we publicated the OntoLix and OntoLinux Fur- ther steps of the 20th of February 2014. Said this, we have here a serious case of plagiarism in a thesis submitted to get the degree as a Doctor of Philosophy (Ph.D.).]", "Minimum-Spanning Forest [The quote of this term is not so easy to understand, because it is relat- ed with a file system that seems to be an prototypical implement- ation of our Log-Structured Hash-Based File System based on the forest data structure, which is a disjoint union of undirected, cycle- free, connected graphs respectively trees in the mathematical field of graph theory, and the algorithm of leaving a dirty B-tree in the memory cache and logging its updates as hash shards in a so-called shard map with a hash index on a B-tree. The implementation of the file system was discussed on the mailing list of the developers of the Linux file system on the 19th to 25th of June 2013 due to its first presentation and our claim of a copyright infringement, because in our point of view the developer used only a different wording to de- scribe the concept of our Log-Structured Hash-Based File System. In this context, the quoted term also points to the file spanning technique, which "is the ability to package respectively partition a single file or data stream into separate files of a specified size". See also again the file system feature Dirhash and the related file system Magma, the key-value store Kyoto Cabinet, specifically its File Hash Database (HashDB), File Tree Database (TreeDB), Cache Hash Data- base (CacheDB), and Grass Tree Database (GrassDB) data struct- ures, and our Log-Structured Hash-Based File System of the list giv- en in the OntoLix and OntoLinux Further steps of the 20th of Febru- ary 2014.]", "New Work Graph[...]-DB [As we said before, without the thesis we can't say in detail what was already there and what was added after the 20th of February 2014. Strange is the bad quality of the document publicated on the 4th of March 2014 and the "experimental source code" uploaded on the 16th of April 2014, which should be much better if both would be based on the work done in conjunction with the thesis. Also, authoring such a thesis needs much time and so something must have been there before the 20th of February 2014, but we could not see and still can't see any- thing. Until the 20th of February 2014 the work was solely focused on graph processing and analysing, but not on storing, logging, and so on.]", "1) Specialized single-machine graph databases 2) Relation- al/key-value databases as graph storage Problems: [...] No/weak support for analytical computation [We do not think that this is truly the case in general. See also the Ontonics, OntoLab, Ontologics, OntoLix and OntoLinux Further steps of the 20th of February 2014 again.]", "Log-Structured Merge-tree (LSM) [We discussed this al- ready in the case of the quoted document above.]", "Columnar data model [We also discussed this already in the case of the quoted document above.]", "Efficient for mixed read/write workload. [This reminds us of a file system somehow.]", "recommender toolkit [This was one of the first suspicious points when we visited the website of the software library the first time. See also the webpage Onto- logic Applications of the websites of OntoLix and OntoLinux.]", "Orig- inal target algorithm: Belief Propagation on Probabilistic Graphical Models. [...] LDA [The generative model Latent Dirichlet Allocation belongs to the class of hierarchical Bayesian models with categorical variables. On the one hand we now know the "original target algo- rithm", which was not mentioned in a very similar slide about the initial parallel sliding windows algorithm, but on the other hand we also have the Ontonics, OntoLab, Ontologics, OntoLix and OntoLinux Further steps of the 20th of February 2014, which mentions the LDA model. For us this is a proof that the authors recognized their graph library in the said Further steps, as we claimed in the beginning and in more detail in the OntoLix and OntoLinux Further steps of today above, and hence both Further steps of the 20th of February 2014 are treated as one in this investigation.]", "Distributed PSW (one shard/node) [See again the list in the OntoLix and OntoLinux Further steps of the 20th of February 2014.]", "Abstractions for learning graph structure [This reminds us of graph and term rewriting syst- ems with graph rewrite rules respectively graph grammars as feat- ured by the OntoBot software component, listed in the Feature-List #5, and mentioned on the webpage of OntoBlender.]", "Graph-aware optimizations to Graph[...]-DB. Buffer management. Smart cach- ing. Learning configuration. [Read again the first two sections of the OntoLix and OntoLinux Further steps of the 20th of February 2014.]", "[...] object-oriented and graph databases: [] - Focus was on modeling, graph storage on top of relational DB or key-value store[;] RDF databases - Most do not use graph storage but store triples as relations + use indexing.[;] Modern solutions have propos- ed graph-specific storage [See again the list in the OntoLix and OntoLinux Further steps of the 20th of February 2014.]", and "Vertex IDs mapped to internal IDs to balance shards [This is done by a "reversible hash function", as quoted and commented above already, which points again to our Log-Structured Hash-Based File System and the list in the OntoLix and OntoLinux Further steps of the 20th of February 2014.]".

    We do not think that a collision of ideas has happened, because the thesis was still a work in progress in the end of February 2014, as it is proven with:

  • the fact that we already clearly said in their descriptions that our Log-Structured Hash-Based File System and Reflection DB can be integrated, and generally a file database system and particularly our file database system OntoFS can be implemented with their features and hence all three data storage and retrieval systems can be inte- grated, but only 1 year later the quoted document appeared in an ad hoc act after we publicated the two Further steps of the 20th of February 2014,
  • the bad quality of the immature, experimental prototyp potentially implemented under a serious pressure of time in the 6 weeks be- tween the 20th of February and the 16th of April 2014,
  • the point "Discussion" of the defending of the thesis, which is only about the basic graph processing algorithm called parallel sliding windows, but not about the Graph[...]-DB,
  • the many quoted text passages and their related comments, that mention many essential parts of our data storage and retrieval syst- ems, which without any doubts were methodically copied from our original descriptions in a hateful act of extensive looting with the goal to deeply harmful attack C.S. personally and totally destroy our related intellectual properties, specifically the ones related with our OntoFS, and
  • the fact that our two Further steps of the 20th of February 2014 were written as a lure of the test created exactly for them, which functioned perfectly.

    In general, the said scientific document of the researchers does not have the expected quality seen from the point of view of scientific research, which demands a body of original research and correctly made references to prior works, but also from the viewpoint of soft- ware technology. While the former work related with the parallel sliding windows algorithm may be acceptable with some shortcom- ings, which finally were corrected and added with the Graph[...]-DB by simply adding two missing arrays for additional indices to the init- ial data/file structure, the rest of this work is simply said bad and badly constructed without knowing what to steal this second time after the recommender system issue.

    That the thesis and the document were still submitted as the results of original academic research is a case of willful deception of the scientific community, because neither very well known databases based on an LSM-tree data structure like SQLite and Kyoto Cabinet nor our without any doubts also known Reflection DB, Log-Structur- ed Hash-Based File System, and OntoFS were referenced, which questions the legitimation of the award of the postgraduate acad- emic degree as well. Additionally, the submissions are also a case of willful deception of potential investors and customers, which makes it a case for the market regulator and the prosecutor.

    The other major issue is the infringement of our copyright. Potent- ially, the basic concepts and the parts with the data structues of our Reflection DB and Log-Structured Hash-Based File System might be too general, but all the rest that was also copied coincides ex- actly with our original, unique, too specific, and uncommon works, specifically with many essential features of our OntoFS, so that the trick to talk about a graph store only does not work as well. Hence, we claim for a copyright infringement and a serious illegal action comitted by the two authors, Aapo Kyrola and Carlos Guestrin, and their supporters.

    Also convicting points are some bold details, like for example the grimace of A. Kyrola, that looks similar to the original image used for the collage "Evidence of Reflection" by C.S., which again taken toge- ther with the date of publication on the 4th of March directly points to our Reflection DB.

    We recommend to add the missing informations and references to our works in all scientific papers and on the related websites immed- iately, and to make other needed corrections (e.g. take down the source code again) before the authors' reputation is going down the drain completely.
    In addition, we recommend that both authors make use of profess- ional support to keep their serious mental diseases and social deficits under control and on an acceptable level.


    16.May.2014
    OntoLix and OntoLinux Website update
    We have uploaded the new webpage for our Ontologic data storage Base (OntoBase), which was announced in the Further steps of the 20th of February 2014.

    Because we simply thought that the strong connection between our OntoFS, Log-Structured Hash-Based File System, and Reflection DB as a log-structured, hash-based, row- and column-oriented file da- tabase system respectively data storage system would be obvious for our readers due to the facts that we gave in the description of the Log-Structured Hash-Based File System the explanation that its "Applications are all kinds of data storage systems, like file systems, and database systems and associative arrays based on them [...], triple stores and graph stores, our Ontologic File System (OntoFS)", in the description of the Reflection DB the explanation that "The concept can also be used for file database systems", and in the description of the OntoFS the specification that it belongs to the class of file database systems, we have not listed the Reflection DB in the OntoLix and OntoLinux Further steps of the 20th of February 2014 at first. Explained this, we have added the point "row, column stores" to the list on the wepage and listed our Reflection DB under it today. In fact, only an implicitly given or already publicated in- formation related with this context has been added in this way (see also the related OntoLix and OntoLinux Further steps of the 12th of May 2014).

    OntoLix and OntoLinux Further steps 00:03 CET
    We would like to give the information that the graph store element of OntoBase and in this way OntoFS can also handle hypergraphs and hence supports for example Topic Maps (TMs) and RDF-based data model as well as Natural Language Processing (NLP), as we always said since the beginning of OntoLix and OntoLinux.
    Furthermore, through the latest update of the referenced tuple store Tarantool the transactional key-value store Sophia, that is based on the Log-Structured Merge tree (LSM-tree) and B-tree data struct- ures, and the fractional cascading technique, is also referenced now.
    We will add all these features and the database to the OntoBase webpage (see the related Further steps of the 20th of February 2014).

    In the meantime, the momentum around our OntoBase ontology is increasing, as a new section on a webpage about NoSQL databases of an internet encyclopedia and a related request in a discussion group of a hypergraph store showed.

    Investigations::Multimedia

  • Kobrix Software: In the related discussion group of its hypergraph store the following questions were asked: "Is there a available onto- logie (i.e. schema, meta-model, ...) of the concepts manipulated by HyperGraphDB? Or any other "diagramatic" representation?". The founder replied as followed: "The concepts are informally described best in the paper [...]. But it sounds like a good idea to formalize the model in some meta-notation [...]" (see also its case in the Invest- igations::AI and Knowledge management of the 8th of February 2014). Obviously, both the questions and the answer point to the OntoBlender software component of OntoLix and OntoLinux.
  • Dmitry Simonenko: He is the developer of the embeddable, trans- actional key-value store Sophia shortly discussed here and one of the contributers of the tuple store Tarantool that was extended with the data engine of Sophia last month (see the next section). From the website of the in-memory database Sophia we got the following informations: "[The] database and its architecture was born as a result of research and rethinking primary alghorithmic constraints associated with a getting popular Log-file based data structures such as LSM- tree, it's variations based on Fractional Cascading ideas and a B-Tree. [...] Most log-based databases (or LSM-alike specifically) trend to organize their file storage as a collection of sorted files which are periodically merged." Remarkably, the term "Log-file based" is marked up as a hyperlink that points to the de- scription of the log-structured filesystem of an internet encycloped- ia, which reminds us of an essential concept of a clone of our Log- Structured Hash-Based File System (see also the Ontonics Website update of the 20th of June 2013). Because we have not seen the use of a hash function with Sophia itself so far, we surely do not claim for a copyright infringement. Also important to note in this conjunction is the point that the source code of Sophia seems to be publicated on the 15th of September 2013.
    A different issue is the update of the tuple store Tarantool made official on the 14th of April 2014. On the one hand the tuple store Tarantool provides the feature that an index can have the type hash. On the other hand the other key-value store Sophia is said to be based on the concept of the log-structured file system. With the update of the database Tarantool the data engine of the database Sophia was integrated among other changes, so that in this way a log-structured and hash-based storage system was created as it happened in the case of the clone of our Log-Structured Hash-Bas- ed File System (see again the Ontonics Website update of the 20th of June 2013). When we bring these facts together with the related point of the feature list on the website of Tarantool, that says "2- level disk-based B-tree" and is marked up as a hyperlink that points to Sophia, then at least the description of the tuple store Tarantool might already be related with a copyright infringement in our point of view. This is strengthened by our belief that the developers are too competent to confuse the different concepts and that they tried to come as close as possible with their distributed but still directly connected descriptions of their data stores to our description of our Log-Structured Hash-Based File System and its applications, or even attempted to circumvent our copyright in this way, which implies that they do know our works.


    17.May.2014
    OntoLix and OntoLinux Website update
    After looking again on the contents of the OntoBase webpage we realized that it is not so easy to get the informations about the latest version of SQLite, which is based on a Log-Structured Merge tree (LSM-tree). To solve this little problem we changed the link SQLite to SQLite3 and added the link SQLite4.

    In conjunction with the Further steps of the 16th of May 2014 (ye- sterday) we also added links to the key-value store Sophia and the points hypergraph, fractional cascading, run-time interchangeable data management engine, Topic Map (TM), Web Ontology Lang- uage, Ontologic Web Language (OWL), Ontologic Modeling/Design Language (OML/ODL), Natural Language Processing to Web Ontology Language (NLP2OWL) and Natural Image Processing to Web Ontology Language (NIP2OWL) at the appropriate places.

    Please keep in mind that in comparison to the Web Ontology Lang- uage our Ontologic Web Language (OWL) offers direct language support for n-ary relationships, which can be handled by the hyper- graph feature of the OntoBase and the directly connected features of pattern recognition and querying, and term and graph rewritting of the OntoBot and OntoBlender components.


    18.May.2014
    OntoLix and OntoLinux Website update
    We added the points memory mapping, shadow paging used by e.g. Lightning Memory-mapped DataBase (LMDB) and Kyoto Cabinet, Write-Ahead Logging (WAL) used by e.g. SQLite, PostgreSQL, and MongoDB, journaling, Compare-And-Swap (CAS) used by e.g. Kyoto Cabinet, and also MultiVersion Concurrency Control (MVCC) used by e.g. LMDB, PostgreSQL, and ArangoDB to the list on the webpage of OntoBase.

    OntoLix and OntoLinux Further steps
    As it can be seen easily by the list given on the OntoBase webpage, to select a combination of building blocks for a data storage system is a highly complex task, which can be done by hand but our propos- ed support by techniques of the fields of Artificial Intelligence (AI) with its branches Machine Learning (ML) and Knowledge Engineering (KE), Evolutionary Algorithms (EA), specifically its branch Genetic Programming (GP), and Computational Creativity is highly recomm- ended. Luckily, OntoLix and OntoLinux are Ontologic Systems (OSs) and reflective Hightech Operating Systems (HOSs), that feature the OntoBase, OntoBot, and OntoBlender software components.

    This is a serious copyright warning in respect to the general con- cept, the specific concepts of the collection, selection, dissection, and re-integration of foundational elements, as well as the system architecture and the components.


    19.May.2014
    OntoLix and OntoLinux Further steps
    In the case of the OntoBase component we looked at the Feather- stitch File System, which offers the patch abstraction that make write-before relationships explicit and file system agnostic to est- ablish on-disk file system consistency and can be used to implement the soft updates, journaling, and Write Anywhere File Layout (WAFL) approaches and in this way to build reliable, transactional data stor- age systems.

    In the case of the Ontologic Language Onto# and the OntoBlender component we looked at the Visual Programming (VP) environment Programming Without Coding Technology (PWCT). The PWCT has to be seen as a visual multi-paradigm programming environment focused on the simple visualization of the Abstract Syntax Tree (AST) of a program and the basic component libraries, and the presentation of related data entry forms, but not as a Visual Programming Language (VPL), that can be used to bridge the gap between textual and lit- erate programming languages, inclusive programming languages bas- ed on Controlled Natural Languages (CNLs), on the one side and icon-, shape-, and diagram-based VPLs, like e.g. the referenced DRAKON VPL, as well as truly geometrical VPLs on the other side (see also the Website update of the 12th of February 2014 and the Ontonics, OntoLab, Ontologics, OntoLix and OntoLinux Further steps of the 12th, 17th, 19th, and 24th of February 2014).


    20.May.2014
    OntoDroid Further steps 11:00 CET
    We have designed the new version of our mobile operating system OntoDroid 2 that consists of a Linux kernel, the Android operating system stack on top of it, inclusive the support for OpenGL for Em- bedded Systems (OpenGL ES or GLES), a Virtual Machine (VM) that can run bytecode compiled from source code written with the multi-paradigm programming language Scala or/and the programming lang- uage Java, and the clone of our log-structured, hash-based, and row- and column-oriented graph storage and retrieval system called GraphChi-DB (see also the OntoLix and OntoLinux Website update and Further steps, and also the Investigations::Multimedia of the 12th of May 2014). Yes indeed, OntoDroid 2 is an essential part of OntoLix and OntoLinux implemented with Scala and Java.

    This is a serious copyright warning in respect to the general con- cept, the specific concepts of the collection, selection, dissection, and re-integration of foundational elements, as well as the system architecture and the components.

    Ontonics, OntoLab, Ontologics, OntoLix and OntoLinux Further steps
    After we looked at comparisons of the common programming lang- uages and some multi-paradigm programming languages again, we came back to one of the specific features of our Ontologic Language Onto# best described as some kind of a super programming lang- uage. This specific feature is the technique that Onto# can also change the programming paradigm, programming language syntax, and coding style used to write a source code at least as far as possible. For example, a source code that was written in one spec- ific programming language with its paradigm extensions can be pres- ented with the language syntax or/and in the coding style of anoth- er programming language that belongs to the same paradigm, or even in a mixed way whenever and wherever it is advantageous, which means that one section of a source code is shown with one specific syntax or/and in one specific style and another section is shown in another syntax or/and style. Conceputally, this even works with the programming paradigms, so that also one specific paradigm can be exchanged or mixed with another paradigm and its programm- ing language syntaxes and coding styles.
    If a substitution or mixture of one programming language paradigm, syntax, or coding style with another one is not possible or if it is not clear what a developer wants to express in a source code, then our related development environment OntoBlender can communicate with the developer, automatically extend the written code, or do some other supporting activities. Onto# makes it superfluous to use a specific syntax to define for example a data structure, class, meth- od, function, loop, or whatever concepts and constituents are used in the course of programming, as long as the development environ- ment understands the intention and is able to handle the source code.
    In the end, the task of programming is freed from a specific para- digm, syntax, and style, and completely resolved on these levels, so that in this way a developer can choose her/his prefered programm- ing paradigm, syntax, and style individually in the same way and for the same reasons, as it is already done with the layouts, typogra- phies, icons, graphics, and colours for formatting and highlighting a source code.
    As easier examples take the comparisons of the programming lang- uages and their extensions:

  • C++ with a reflection library vs. Java,
  • C++ with a reflection library vs. Objective-C,
  • Scala vs. Groovy with GPars (concurrency library), or
  • Lisp vs. its many dialects.

    OntoLix and OntoLinux Website update
    On the webpage of the OntoBase component we added transaction processing to the point Atomicity, Consistency, Isolation, and Durab- ility (ACID) and logging to the point Write-Ahead Logging (WAL), the points Copy-On-Write (COW), soft updates, and versioning, and a link to the Featherstitch File System.
    We also added a link to the peer-to-peer, read-only, Cooperative File System (CFS) [PDF], which is based on the global, decentrally con- trolled, secure, Self-certifying File System (SFS), because the CFS is an essential part of our Log-Structured Hash-Based File System (LogHashFS), though in fact we found the CFS only 2 months later after we already publicated the description of the LogHashFS as part of our SASOS4Fun, while we were looking again for the referenced Metis in-memory MapReduce library of the same researchers (see also the related Ontonics, OntoLab, and OntoLinux Further steps of the 8th of October 2012).


    22.May.2014
    Question of the Day
    "Primacy of politics or primates of politics?", [C.S., 16.May.2014]


    23.May.2014
    Comment of the Day
    "The Murderer", [Ray Bradbury, 1953]

    Clarification #1
    Again, many media companies have infringed our copyright in con- junction with the original and unique multimedia work of art, the Ontoscope paradigm, this time in conjunction with a tablet computer that features a common 2D camera and a 3D/range camera at the backside. Indeed, it is an interesting strategy to circumvent our copyright in this way (see also the Clarification of the 29th of April 2014), but we are sorry and directly refer to Judge Birss (see the Pictures of the Day of the 25th of July 2013 and the comment). The important points are that:

  • all types of mobile devices with for example a (multi-)touchscreen and a network connectivity are addressed by the Ontoscope para- digm, specifically the tablet computers of the slate type by our oth- er business division intelliTablet in this actual case (read their web- sites), without being too general,
  • the same components have been taken, in this case two backside cameras, one common 2D camera and one 3D/range camera based on an infrared projector and a image sensor (see our MobileKinetic technology), and integrated in one casing of a mobile device, or said in other words an arbitrary Ontoscope or intelliTablet with Ontoscope technology has been taken and then features were removed until it was thought that the resulting mobile device has not enough sub- stantial features of the original work anymore and hence would not be covered by the description of the Ontoscope paradigm anymore, though this plagiarism still starts with the original work and is not a unique work of its own due to the fact that the original work or a set of its substantial features is still recognizable, as some of the other points prove,
  • the Ontoscope paradigm does cover this specific backside camera configuration as well (one common 2D camera and one 2D or 3D sensor used with the MobileKinetic technology) besides all the other variants (add these variants to the Clarification of the 29th of April 2014), because a specific configuration with for example specific cameras, one common sensor or separated sensors, casing, optical lenses, and so on is not demanded by the Ontoscope paradigm for its realization and hence not relevant,
  • the sensors respectively cameras work together either in a sequ- ential or a parallel way,
  • the 2D and 3D informations recorded by the sensors respectively the 2D and 3D pictures taken by the cameras are interpreted with and for high-level processes by the mobile device itself and are not simply used for watching or editing by a user, like with a 3D camera for example,
  • the description of the clones are directly connected to spatial (contextual) awareness (environment focused, e.g. position deter- mination),
  • the description of the second clone has direct links to robotics (for example the device is similar to the head and the control logic of a humanoid) and to the first clone of the Ontoscope with mobile connectivity,
  • the clones are powered with a specific mobile operating system, that in large parts was also copied in the same way from our origin- al and unique operating system OntoLinux that is designated to pow- er our Ontoscopes and intelliTablets as well as our robots, as it can be seen easily with the features of the Augmented Reality (AR) paradima and more importantly with an (Proactive) Intelligent Pers- onal Agent ((P)IPA) and a connection to a knowledge base, because the latter features imply the use of more functions of the field of Artificial Intelligence (AI), which again leads directly to the Onto- scope paradigm, and in this way
  • it is proven that the plagiator is absolutely aware about the origin- al and unique, not too general, and also uncommon intention behind and expression of the multimedia work of art by C.S. and wants to reproduce as much as possible of it in exactly the same context.

    In general, such a strategy does not work, because it does not abrade but sums up everytime, so that sooner or later the whole house of cards will collapse.

    Clarification #2
    We would like to clarify that the software stack of OntoDroid 2 (see the Further steps of the 20th of May 2014) offers the many basic features of our Ontologic Systems (OSs) and Hightech Operating Systems (HOSs) OntoLix and OntoLinux that can be easily connect- ed with the software and used with the hardware listed on the relat- ed webpages as well. In fact, the other basic functions of the soft- ware components of OntoLix and OntoLinux are already implemented in the programming languages Java and Scala as well, like logic programming, ontology-oriented programming, agent systems, game platforms, Augmented Reality (AR) frameworks, Virtual Reality (VR) envrionments, Problem Solving Environments (PSEs), and so on. Said this, OntoDroid 2 can be described in a better way as the implem- entation of our Ontologic System Architecture (OSA) with Scala and Java, though we are sure that this point was never a source of confusion.

    By the way: The Web Operating Systems (WOSs) based on our OSA are listed under the label Boot to Web (B2W) in the Innovation-Pipe- line of Ontonics, actually.

    Ontonics Further steps
    We developed a simple component. The general concept behind it might not be new, but its specific way of application and most pot- entially its construction are inventions.

    We also reworked an interesting concept with the integration of other interesting technologies. You will love it.
    As a by-product the other technologies in their extended versions can be used alone as well.


    24.May.2014
    Pictures of the Day
    Person(alitie)s→Male Artists→Don Pablo 001t (2009)
    Space (1st Steps into)→Moonwalk 013m (2009)
    Space (1st Steps into)→Space Shuttle→Space Shuttle 001m (2009) and Space Shuttle 007m (2009)
    Space (1st Steps into)→Mars Rovers→Mars Pathfinder Rover Sojourner 001m (2009)

    C.S. Don Pablo
    C.S. Moonwalk
    C.S. Space ShuttleC.S. Space Shuttle
    C.S. Sojourner
    © King Smiley

    Luckily, we have original negatives of our series. See also the other images of the Don Pablo series presented on the 29th and 30th August 2009, Moonwalk series presented on the 22nd of February 2009, and 9th, 10th and 22nd of March 2009, Space Shuttle series presented on the 11th to 14th of March 2009, and Sojourner series presented on the 23rd of March 2009 and 28th of August 2009.

    Clarification
    Obviously, we have to repeat a point once again. In the last years we have proven that large companies have copied works of C.S. ma- ny times, which might have been legal or illegal. But in the course of the whole process it became absolutely evident that large compa- nies are so focused on everything that C.S. did, does, and will do, that their behaviour has to be compared with an obsession and an addiction conected with spying, stalking, and similar unwanted act- ivities, so that we are allowed to declare that everything C.S. did, does, and will do is protected by the corresponding laws like the copyright law, and every activity related with copying parts of or even whole works is an attack of C.S.' way of expression and hence of the personality. Psychological harassment is a serious crime.

    Ontonics Further steps
    We worked on a new concept that emerged out of pure blue sky thinking and correspondingly has to be classified as only experiment- al actually.


    26.May.2014
    Comment of the Day
    "You have to accept competition or competition does not accept you.", [C.S., Today]

    Ontonics Further steps
    We have developed a new material or maybe even a new class of materials, but actually we can't give any informations about its efficiency. Nevertheless, it belongs to the fascinating stuff.


    27.May.2014
    Ontonics Further steps
    We developed new applications of a multimedia device. Many people will like at least one of them very much like we do as well.

    Style of Speed Further steps
    We thought about the possibility to take the chassis of the Pan Speedster with shortened front and rear overhangs and a fastback configuration with shared rear passenger seats and trunk for the Caccia, which would imply a front-mounted engine.


    28.May.2014
    Comment of the Day
    "Standard Internet", [C.S., Today]

    Ontoscope Further steps
    We have developed a new model that delivers a much higher performance now.

    Investigations::Multimedia

  • Samsung: The company has stolen intellectual properties of us once again. This time it took the concept of our modular Sm@rt- watch System, specifically our FitWatch, and presented it as its in- vention in the form of a fitness band. From the slides of the related presentation we got the following informations: "Biojournal [This term is related with the specification of our intelliTablets and also with our activities in relation with the learning environment Sugar, that has a journal as one of its essential features (see also the Silverfox project for example).]", "Complex, diverse data [-] Capture in original format [Like in the case with the same typeface (see the image below), these terms were choosen to confuse and mislead the public.]", "Tools for analysis [Obviously, this points to OntoLix and OntoLinux, specifically to the OntoBlender software component. See also the section Human Simulation/Holomer of the webpage Links to Soft- ware, which is also reflected as a part of the name of the fitness band.]", "The journey begins [This was said due to our slogans "The Journey has just begun.", "Journey of Life", and "Life is a Journey", and hence we have here a further clear evidence of the claimed copyright infringement.]", "An open modular sensor framework [In fact, our wearable computers of iRaiment, inclusive our smartwat- ches, are already offering such a modular system platform and in addition are connected with for example our Ontoscope architecture as well, that also offers a modular sensor framework. See also the intelliTablet Further steps One Tablet Per Child (OTPC) and One Pad Per Child (OPPC/OP²C) #16 and the intelliTablet Further steps Iri #3 of the 28th of April 2014.]", "Investigational Device [If this should be a joke, then it is a very bad one.]", "[...] Multimodal (optical, elec- trical, physical) [This was said due to our Multimodal Multimedia User Interface (M²UI) of OntoLix and OntoLinux. It is another undeniable evidence for the fact that the company has done marketing only with our intellectual properties.]", and "Modular design [-] Built for customization [...] [Besides the jump on the bandwagon of modular design we can see nothing else than a highly integrated circuit bas- ed on our original FitWatch and FitCore, that can't be customized at all. In the end, we have here a bunch of technical terms that were only used as part of its marketing to mislead the public, because the company does not know what to do with the exception of copying and stealing.]".
    Compare also the typeface of the logo of iRaiment and the logo of its fitness band (hint: it is the same).

    Typeface iRaiment and Plagiarist

    Again, the company proved that it is not trustworthy and does not respect common laws, because it has presented only an implement- ation of our original concept, and copied the related descriptions and further contents from our websites as part of its marketing. Said this, we have here a clear case of an illegal abuse of market power besides other legal issues (see also the Clarification of the 24th of May 2014) and obviously not a custodian.


    29.May.2014
    OntoLix, OntoLinux, and OntoDroid Further steps
    After we had investigated the clone of the concepts behind our data storage and retrieval systems, specifically the OntoFS, called Graph- Chi-DB we looked at some details of it once again and got more and more doubts if there is truly something special about the related algorithms and data structures. While it should be already clear that OntoLix and OntoLinux are based on our OntoBase, we will go on and replace the GraphiChi-DB as well in the case of OntoDroid 3 (see also the related Clarification #2 of the 23rd of May 2014), though this does not mean that OntoDroid 2 is not existent anymore.

  •    
     
    © and/or ®
    Christian Stroetmann GmbH
    Disclaimer