Information processing method

• US 8,250,039 B2
• Filed: 04/08/2009
• Issued: 08/21/2012
• Est. Priority Date: 10/10/2006
• Status: Active Grant

• Current Assignee: Richard Chappuis
• Original Assignee: Richard Chappuis
• Inventors: Chappuis, Richard
• Primary Examiner(s): Corrielus, Jean M
• Application Number:
  US12/420,382
• Publication Number:
  US 20090198665A1
• Time in Patent Office: 1,231 Days
• Field of Search: 707/999.102, 707/999.005, 707/661, 707/827, 704/2, 704/9
• US Class Current: 707/661
• 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. 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 comprising:

using a plurality of Links for storing and processing information,

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

all of the Links being connected to one another, wherein

at least one Link corresponds to a Relation which servers to represent a Container, the Contents of which are Links, and wherein

at least one Relation, called Relation RC, serves to represent a Container identified by the identifier of said Relation RC and having Contents identified by the identifiers of each of the Links contained by said Relation RC.

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

the identifier of a 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 a reference to said Link on the Container Link is equal to the identifier of the Link.

4. 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, or any number of container links chained together, of each Link is constituted by a single Link.

5. The method of claim 1, wherein the identifiers of certain Links correspond implicitly to data.

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

7. The method of claim 1, wherein said structure comprises at least one field allowing each Link'"'"'s own attributes to be stored.

8. 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, or both modifying and deleting Links stored in said Links Base or in several Links Bases.

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

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

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

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

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

14. The method of claim 1, 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 1, wherein each Container is defined by one or several Relations, called ParentRelations that are the Relations of the ParentContainer designating each 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 the Container.

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

18. 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.

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

20. 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.

21. 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.

22. The method of claim 1, wherein all of the information entered or deleted by the users is accomplished by creating or modifying or deleting the Links.

23. 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.

24. The method of claim 1, wherein the method processes all of the information with links.

25. Information processing method comprising:

using a plurality of Links for storing and processing information,

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

all of the Links being connected to one another, wherein

at least one Link corresponds to a Relation, known as a Container, the Contents of which are Links, wherein the Relations are the Contents of a Container called RelationsContainer and which is defined in recursive fashion by ParentRelations that the RelationsContainer precisely serves to define.

26. The method of claim 25 wherein said RelationsContainer defines the Contents of the RelationsContainer, in other words the Relations of the RelationsContainer, by at least two ParentRelations:

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

27. The method of claim 25, wherein the method processes all of the information with links.

28. Information processing method comprising:

using a plurality of Links for storing and processing information,

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

all of the Links being connected to one another, 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.

29. The method of claim 28, wherein the method processes all of the information with links.

30. A computer program product containing a computer program instruction designed to execute by an information processing method so when executed by a computer causes a processor to perform a method comprising:

using a plurality of Links for storing and processing information, wherein each Link has a data structure comprising at least one unique identifier specifying said Link and three references on unique Link identifiers,

all of the Links being connected to one another, wherein

at least one Link corresponds to a Relation known as a Container, the Contents of which are Links, and wherein

at least one Relation, called a Relation RC, serves to represent a Container which is identified by the identifier of said Relation RC and having Contents being identified by the identifiers of each of the Links contained by said Relation RC.