Publications

Peer-Reviewed Publications

Cognitive MRI of AI Conversations: Analyzing AI Interactions through Semantic Embedding Networks

Alex Towell , John Matta
๐Ÿ“ Complex Networks 2025 ๐Ÿ“… December 2025

Through a single-user case study of 449 ChatGPT conversations, we introduce a cognitive MRI applying network analysis to reveal thought topology hidden in linear conversation logs. We construct โ€ฆ

Preventing Ransomware Damages Using in-Operation Off-Site Backup to Achieve a 10โปโธ False-Negative Miss-Detection Rate

Hiroshi Fujinoki , Alex Towell , Vamshi Anirudh Thota
๐Ÿ“ 2025 7th International Conference on Computer Communication and the Internet (ICCCI) ๐Ÿ“… June 2025 ๐Ÿ”— DOI: 10.1109/ICCCI65070.2025.11158394

This paper presents a novel approach to preventing ransomware damages through in-operation off-site backup systems designed to achieve an exceptionally low false-negative miss-detection rate of 10โปโธ.

Reliability Estimation in Series Systems: Maximum Likelihood Techniques for Right-Censored and Masked Failure Data

Alex Towell
๐Ÿ“… September 2023 ๐Ÿ”— DOI: 10.5281/zenodo.15151227

This paper investigates maximum likelihood techniques to estimate component reliability from masked failure data in series systems. A likelihood model accounts for right-censoring and candidate sets โ€ฆ

Estimating How Confidential Encrypted Searches Are Using Moving Average Bootstrap Method

Alex Towell , Hiroshi Fujinoki
๐Ÿ“ 8th International Conference on Computing Communication and Networking Technologies (ICCCNT) ๐Ÿ“… January 2016 ๐Ÿ”— DOI: 10.1109/ICCCNT.2016.7540294

This paper applies an approach of resilience engineering in studying how effective encrypted searches will be. One of the concerns on encrypted searches is frequency attacks. In frequency attacks, โ€ฆ

Preprints

The Beautiful Deception: How 256 Bits Pretend to be Infinity

Alex Towell
๐Ÿ“ arXiv ๐Ÿ“… January 2024 ๐Ÿ“„ arXiv: 2510.12802

How do you store infinity in 256 bits? This paper explores the fundamental deception at the heart of computational cryptography: using finite information to simulate infinite randomness. We prove why โ€ฆ