INFORMATION PROCESSING METHOD

• US 20090198665A1
• Filed: 04/08/2009
• Published: 08/06/2009
• Est. Priority Date: 10/10/2006
• Status: Active Grant

• Current Assignee: Richard Chappuis
• Original Assignee: Richard Chappuis
• Inventors: Chappuis, Richard
• Granted Patent: US 8,250,039 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/288 Entity relationship models
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence

Abstract

Method for generating information processing Systems wherein informative Containers and Contents are created, identified, stored, modeled, communicated, modified and deleted by creating, modifying or deleting Links (1). The whole information entered by the users and the information for describing the System takes the form of Links having identical sizes and stored by a Links Base. The Links can be provided with attributes, notably time attributes.

Claims

1. Information processing method using a plurality of Links for storing and processing the totality of the information,

each Link having a data structure comprising at least one unique identifier specifying said Link and three references on unique Link identifiers,

the whole of the Links being connected to one another.

2. The method of claim 1, wherein each Link represents at least one Content, said three references designating respectively:

the identifier of the Container Link that contains said Link,

the identifier of a Link representing a ParentContent,

and the identifier of a Link representing a ChildContent,

said Link connecting the ParentContent to the ChildContent.

3. The method of claim 2, wherein at least one Link is re-entering, so that its reference on the Container Link is equal to its own identifier.

4. The method of claim 1, wherein the identifiers of certain Links correspond implicitly to data, for example to characters and/or to words of a dictionary.

5. The method of claim 1, wherein said structure further comprises temporal attributes indicating a beginning and/or an end of at least one period of activation of the Links.

6. The method of claim 1, wherein said structure comprises at least one field allowing each Link'"'"'s own attributes to be stored, indicating for example whether a Link is active or inactive.

7. The method of claim 1, wherein said Links are stored in a Links Base and wherein all the information is processed by creating, modifying and/or deleting Links stored in said Links Base or in several Links Bases.

8. The method of claim 1, wherein said unique identifier of the Link and said three references all have the same digital data format.

9. The method of claim 7, wherein said structure comprises at least one reference designating an external data outside said Links Base.

10. The method of claim 1, wherein said structure is stored by lists, tables, graphs, triplets or objects.

11. The method of claim 1, wherein said structure is identical for all Links.

12. The method of claim 1, wherein said structure uses fixed-size data formats.

13. The method of claim 1, wherein at least one Link corresponds to a Relation, i.e. a Container whose Contents are Links.

14. The method of claim 13, wherein said Relation associates a ParentContainer to a ChildContainer, so that each Link contained by said Relation connects, by the references onto a ParentContent and a ChildContent peculiar to each Link, a Content of the ParentContainer to a content of the ChildContainer.

15. The method of claim 13, wherein a Container is defined by one or several Relations, called ParentRelations, so that the ParentRelations of a Container are the Relations whose ParentContainer designates this Container.

16. The method of claim 15, wherein a Content is created in a Container by creating a Link for each of the ParentRelations required of this Container.

17. The method of claim 13, wherein some of said Relations, called Relation RC, serve to represent a Container which is identified by the identifier of said Relation RC,

the Contents of this Container being identified by the identifiers of each of the Links contained by said Relation RC.

18. The method of claim 13, wherein the Relations are the Contents of a Container called RelationsContainer, which is defined in recursive fashion by ParentRelations that this RelationsContainer precisely serves to define.

19. The method of claim 18, wherein said RelationsContainer defines its Contents, in other words its Relations, by at least two ParentRelations:

the Relation CP designating the ParentContainer of a Relation, and the Relation CE designating the ChildContainer of a Relation.

20. The method of claim 2, wherein the Container Link, or the Container Link of the Container Link, or the Container Link of the Container Link of the Container Link, etc. of each Link is constituted by a single Link.

21. The method of claim 1, wherein a particular set of Links forms a Kernel, said Kernel being only described with the aid of Links and allowing the System to boot.

22. The method of claim 21, wherein said Kernel is constituted by the enrichment of a 9- or 14-Link Kernel or by the enrichment of a depleted 9- or 14-Link Kernel, said Kernel containing itself.

23. The method of claim 1, wherein said Links are stored in a Links Base defining a System, said System having the capacity of being self-described, of being identified by a Link, of containing itself, of containing one or several sub-Systems called IntraSystems and of being contained on one or several super-Systems called MetaSystems.

24. The method of claim 1, wherein at least certain Links represent an active and autonomous logic unit, capable of requesting processing time to perform various operations.

25. The method of claim 1, wherein the whole of the information entered by the users is done so by creating or modifying Links, and wherein the whole of the information deleted by the users is done so by deleting or modifying Links.

26. The method of claim 1, comprising a step of creating and of propagating continuous Selections in order to verify Boolean conditions on the tested Links.

27. Method for processing information, characterized in that it allows the totality of the information processed to be identified by a plurality of Links, each Link being stored by a data structure comprising at least one unique identifier specifying said Link and three references on the unique Link identifiers, so as to connect directly or indirectly the whole of the Links to one another, wherein said structure is identical for all Links, wherein at least one Link is said re-entering, so that its reference on the Container Link is equal to its own identifier, wherein each Link represents at least one Content, wherein said three references designate respectively:

the identifier of the Container Link that contains said Link,

the identifier of a Link representing a ParentContent,

and the identifier of a Link representing a ChildContent,

said Link connecting the ParentContent to the ChildContent.

29. Computer data carrier containing a computer program designed to be executed by an information processing machine so as to execute the method of claim 27 when said computer program is executed.

28. Information processing machine, comprising:

a Links Base for storing a plurality of Links describing the whole of the processed information and meta-information, each Link being stored by a data structure comprising at least one unique identifier specifying said Link and at least three references on the unique identifiers of Links,

computer processing means for creating, deleting or editing Links in said Links Base.