This paper describes a memory model with 2 levels of information. The lower-level stores source data, is Markov-like and unweighted. Then an upper-level ontology is created from a further 3 phases of aggregating source information, by transposing from an ensemble to a hierarchy at each level. The ontology is useful for search processes and the aggregating process transposes the information from horizontal set-based sequences to more vertical typed-based clusters. The base memory is essentially neutral, where any weighted constraints or preferences should be sent by the calling module. This therefore allows different weight sets to be imposed on the same linking structure. The success of the ontology typing is open to interpretation, but the author would suggest that when clustering text, the result was types based more on use and context, for example, 'linking' with 'structure' or 'provide' with 'web,' for a document describing distributed service-based networks. This allows the system to economise over symbol use, where links to related symbols will be clustered together. The author then conjectures that a third level would be more neural in nature and would include functions or operations to be performed on the data, along with related memory information.

This paper considers the problem of predicting earthquakes. It uses a small amount of information to create a descriptive key that can be used as a footprint to describe an event. A frequency grid clusters events that occurred at the same time and then the algorithm averages the history of these events over preceding days, in particular the gaps when the events did not occur. The gaps are measured for the clustered events only and can be used to create a description that is quite unique. Results suggest that seismic events can in fact be traced using this key and subsequently recognised again, if the same conditions reoccur. They also suggest that force direction may be more important than magnitude, after the initial cluster selections are made. Greek and USA datasets have been looked at and the prediction accuracy can be 70% or better. The author therefore suggests that this is an interesting method that deserves attention.

This concept paper gives a narrative about intelligence from insects to the human brain, showing where evolution may have been influenced by the structures in these simpler organisms. The ideas also come from the author's own cognitive model, where a number of algorithms have been developed over time and the precursor structures should be codable to some level. Through developing and trying to implement the design, ideas like separating the data from the function have become architecturally appropriate and there have been several opportunities to make the system more orthogonal. Similarly for the human brain, neural structures may work in-sync with the neural functions, or may be slightly separate from them. Each section discusses one of the neural assemblies with a potential functional result, that cover ideas such as timing or scheduling, structural intelligence and neural binding. Another aspect of self-representation or expression is interesting and may help the brain to realise higher-level functionality based on these lower-level processes.

This paper describes an image processing method that makes use of image parts instead of neural parts. Neural networks excel at image or pattern recognition and they do this by constructing complex networks of weighted values that can cover the complexity of the pattern data. These features however are integrated holistically into the network, which means that they can be difficult to use in an individual sense. A different method might scan individual images and use a more local method to try to recognise the features in it. This paper suggests such a method, where a trick during the scan process can not only recognise separate image parts, as features, but it can also produce an overlap between the parts. It is therefore able to produce image parts with real meaning and also place them into a positional context. Tests show that it can be quite accurate, on some handwritten digit datasets, but not as accurate as a neural network, for example. The fact that it offers an explainable interface could make it interesting however. It also fits well with an earlier cognitive model, and an ensemble-hierarchy structure in particular.

This paper describes an entropy equation that can be used for measuring energy. It originated from measuring economy in AI models, where the assumption would be that any organic system makes use of energy efficiency to form its structures. Looking at clustering and cohesion resulted in the equation E = (mean * variance). It was apparent however, that it was a very generic type of equation and it could be adjusted so that distance represents mean. This new version was applied to the domain of physics and the universe, when the equation can support the idea that work is done through the energy released by the 'change' in entropy. A comparison with Einstein's relativity equation is made and also the audacious suggestion that a black hole has only potential energy inside, which converts to kinetic energy after a Big Bang, for example. From that suggestion, a universal theory about state change can be made.

This paper describes a stochastic clustering architecture that is used in the paper for making predictions over energy data. The design is discrete, localised optimisations based on similarity, followed by a global aggregating layer, which can be compared with the recent random neural network designs, for example. The topic relates to the IDEAS Smart Home Energy Project, where a client-side Artificial Intelligence component can predict energy consumption for appliances. The proposed data model is essentially a look-up table of the key energy bands that each appliance would use. Each band represents a level of consumption by the appliance. This table can replace disaggregation from more complicated methods, usually constructed from probability theory, for example. Results show that the table can accurately disaggregate a single source to a set of appliances, because each appliance has quite a unique energy footprint. As part of predicting energy consumption, the model could possibly reduce costs by 50% and more than that if the proposed schedules are also included. The hyper-grid has been changed to consider rows as single units, making it more tractable. A second case study considers wind power patterns, where the grid optimises over the dataset columns in a self-similar way to the rows, allowing for some level of feature analysis.