Laboratory Investigations of Extrasensory Identification of Concealed 5-Character Codes by a Presumably Gifted Teenager

This report summarizes three “eyeless sight” experiments and reaffirms the authenticity of the phenomenon of clairvoyance (extrasensory perception). On 2014 and 2015, a total of 37 trials were conducted. Each trial involved a computer printing a 5-character permutation (e.g. 37K9J) in bold type on a piece of paper which was then folded to conceal the text. The “eyeless sight” practitioner was a girl who had previously been trained to develop her “eyeless sight” ability. The practitioner held the folded specimen between her thumb and forefinger. After adjusting to a specific state of consciousness (Second Consciousness State, SCS), the practitioner visualized a “ Third Eye Screen” (TES) in front of her forehead. The five-character string was then automatically perceived on the TES by the practitioner. After the perceived image stabilized, the permutation was reported to the researcher and transcribed. The whole experimental process was recorded on video cameras. The mean chance expectation for the correct hit rate of a five-character permutation is p≈10-70 and is vanishingly small. The importance of the SCS and the image generation process on the TES is discussed. Key words: Eyeless sight - Extrasensory perception (ESP) - Psychokinesis (PK) - Third Eye Screen (TES) - First Consciousness State (FCS) - Second Consciousness State (SCS) - recognition of characters with fingers (Clairvoyance)

Encoding

In their model of digital objects, David Dubin and others postulate three entity types (propositions, symbols, and documents) with three relationships: “expresses”, “encodes”, and “inscribes”. We can “express” an assertion with a sentence. We can also “inscribe” symbols in physical media. I’d like to investigate the cascade of “encodings” that we find in every digital computing system, and the articulation of those encodings that is bound up in everything we do. Encoding can be recursive, but do we really understand it? What is happening when we encode a sentence as a character string? A character as an integer? An integer as an octet? Is encoding a well-understood linguistic or mathematical relationship? Is encoding just a mapping (function)? Is it the same as the relationship between a name and its referent? Is it the same as the relationship between a sentence and the proposition it expresses? I don’t think so. So let’s explore some possibilities.

Stable assessment of the quality of similarity algorithms of character strings and their normalizations

The choice of search tools for hidden commonality in the data of a new nature requires stable and reproducible comparative assessments of the quality of abstract algorithms for the proximity of symbol strings. Conventional estimates based on artificially generated or manually labeled tests vary significantly, rather evaluating the method of this artificial generation with respect to similarity algorithms, and estimates based on user data cannot be accurately reproduced. A simple, transparent, objective and reproducible numerical quality assessment of a string metric. Parallel texts of book translations in different languages are used. The quality of a measure is estimated by the percentage of errors in possible different tries of determining the translation of a given paragraph among two paragraphs of a book in another language, one of which is actually a translation. The stability of assessments is verified by independence from the choice of a book and a pair of languages. The numerical experiment steadily ranked by quality algorithms for abstract character string comparisons and showed a strong dependence on the choice of normalization.

Scalable Hardware Mechanism for Partitioned Circuits Operation

For designing hardware with a high-level synthesis tool using a programming language such as C or Java, its large size of logic circuit makes it difficult to implement the design in a single FPGA. In such a case, partitioning the logic circuit and implementing in multiple FPGAs is a commonly used approach. We propose the Scalable Hardware Mechanism, which enables the operation of a partitioned circuit to prevent the degradation of clock frequency by minimizing its dependence on the usage and the type of FPGA. Our mechanism provides a reduced delay by the collective signal transmission with the partitioned AES code generation circuit and the character string edit distance calculation circuit as partitioned circuits. The collective signal transmission has attained 1.27 times improvement in the speed for the AES code generation circuit and 3.16 times improvement for the character string edit distance calculation circuit compared with the circuit by the conventional method.