Blackboard Computing Adventures πŸ’‘
8 subscribers
786 photos
73 videos
62 files
263 links
Welcome to BCA ⚑⚑ our Virtual Learning Space. Mostly Blackboard snapshots, sometimes with explanatory/exploratory and analytical notes. Open teaching efforts by Fut. Prof. JWL at his BC gate on 1st Cwa Road and HQ research dissemination.
Download Telegram
Blackboard Computing Adventures πŸ’‘
https://youtu.be/tqitFtcWzOM?feature=shared πŸ‘‹βš™οΈπŸ’‹πŸ‘‰πŸ» If you have followed the previous lecture introducing Alphabetical Cryptanalysis by JWL: https://youtu.be/3VeCKBE-GBk We now build from those ideas to explore practically, how Alphabetical Cryptanalysis…
https://youtube.com/shorts/8BMBFwxf1BA?feature=shared

πŸ‘‹βš™οΈπŸ’‹πŸ‘‰πŸ» If you have followed the previous lecture introducing Alphabetical Cryptanalysis by JWL as well as followed other research works shared via Blackboard Adventures, then you'll very well follow in today's class:

Titled "Mini-Lecture: Modern Code Matrix Analysis (software language research)", J. Willrich Lutalo Bsc. Msc. (Ph.D candidate at Makerere University) demonstrates with a simple 10 Γ— 6 stochastic matrix of symbols from the English alphabet, how actual computer programs can be automatically randomly generated using machine vision, language parsers and some artificial intelligence.

This is part of on-going fundamental research in computer science and platform engineering at Nuchwezi, Makerere University and in the SLE Community worldwide.

#jwl #sle #tealang #phd #executablealphabets #modern #languages #ai #research


## Another JWL Alphabetical Cryptanalysis Mini-Lecture

#research #nuchwezi #jwl #tea #infosec #advanced #computing
Glad to see more students and researchers picking interest in our work here πŸ‘
We continue with our thorough review of important works across the Software Language Engineering (SLE) field over the years, and today, we come across a paper that made some very big claims touching on most of contemporary SLE; the "DSLTrans" paper[2].

Meet Professor Bruno Barroca!

---[Brief Bio]:

Professor Bruno Barroca is an architect and urban engineer at the Paris-Est University[1]. He is also a member of the urban engineering team at the LEESU laboratory (Water, Environment, and Urban Systems Laboratory)[1]. His research focuses on urban resilience, vulnerability assessment, and the integration of resilience objectives in urban projects, especially in areas prone to natural and technological risks[1].

He has contributed to the field of urban risk management and resilience, aiming to design towns that can better withstand various risks[1]. His work is interdisciplinary, linking geography, town planning, and regional development[1].
Blackboard Computing Adventures πŸ’‘
Photo
---[About The Paper]:

First, though Prof. Bruno appears as the first author, and with some background interest in models & visual systems [4], perhaps it's more correct to place the burden of the SLE-related science in this paper [2] on his co-author, Levi LΓΊcio (who has a deeper background in software engineering and has also worked as a software architect [3]).

The paper does make some useful contributions in the form of attempting to express and prove important results concerning re-write systems (of which visual transformation languages such as DSLTrans are a subset); using Graph theory formalisms, however, a lack of thorough development of the mathematical basis of the claims made in the paper imply that this work still needs be taken with a grain of salt despite looking rigorous enough by typical SLE paper standards. Definitions were written in a rush, and (informal) proofs (to formal claims) were left in sketch form.

It still is an interesting paper to read and we'll perhaps help evolve this work further...

---[REFS]:

1. https://www.routledge.com/Resilience-and-Urban-Risk-Management/Serre-Barroca-Laganier/p/book/9780415621472

2. Barroca, Bruno, Levi LΓΊcio, Vasco Amaral, Roberto FΓ©lix, and Vasco Sousa. "Dsltrans: A turing incomplete transformation language." In Software Language Engineering: Third International Conference, SLE 2010, Eindhoven, The Netherlands, October 12-13, 2010, Revised Selected Papers 3, pp. 296-305. Springer Berlin Heidelberg, 2011. url:https://www.academia.edu/download/90614869/paper_sle2010.pdf


3. https://www.linkedin.com/in/levi-l%C3%BAcio-b3ab433

4. https://www.researchgate.net/profile/Bruno-Barroca-2
Blackboard Computing Adventures πŸ’‘
Glad to see more students and researchers picking interest in our work here πŸ‘
At our private research lab, we continue to define the next generation of computing and info-sec technologies and formalisms.. Esp. for the greater good πŸ‘“πŸŽ©πŸ’»βš‘βš‘πŸ‘‰πŸ»πŸ’ΆπŸ’·βœ¨πŸŒ
Blackboard Computing Adventures πŸ’‘
At our private research lab, we continue to define the next generation of computing and info-sec technologies and formalisms.. Esp. for the greater good πŸ‘“πŸŽ©πŸ’»βš‘βš‘πŸ‘‰πŸ»πŸ’ΆπŸ’·βœ¨πŸŒ
Memories of Joseph W. Lutalo with classmates (L-R; Ssegawa, Stephen, Maurice, and JWL himself) back in their undergraduate days at Makerere.. circa 2009. That's one example of a very successful and productive study group we formed to see us to the finals with flying colours.. 🀞😁
So, today, after about 3 days of hard reading work, we've finished reviewing the smaller (21 pages) version of Dr. Tom Ridge's epic, foundational 2014 ACM SLE paper [3].
Blackboard Computing Adventures πŸ’‘
Photo
---[Brief Bio]:

Not to be confused with the former & first US Secretary of Homeland Security that goes by the same name and title[1], Dr. Tom Ridge is an ex-academician[2] and computer scientist interested in programming, and who is currently working on AWS Cloud problems [2]. He previously worked in academia at the University of Leicester, as well as University of Cambridge[2].
Blackboard Computing Adventures πŸ’‘
Photo
---[About Paper]:

Ridge's paper[3] covers his GLR-related work involving a more performant version of the P3 combinator parsing algorithm that enhances its performance by introducing the mechanism of an oracle. Ridge's new algorithm is "Mini-P3". In this paper, we also discover that in terms of performance, Ridge's algorithm was the best as of writing, for all/any-CFG (Context Free Grammar) parser, with the only potential serious competition likely to come from future attempts from anyone building a more performant (O(n^3) Earley parsing-like or better) GLL parsers that also offer a combinator parsing (parsers built out of combinations of other parsers) interface.


---[REFS]:

1. https://en.m.wikipedia.org/wiki/Tom_Ridge

2. https://www.linkedin.com/in/tom-ridge-5baab135?

3. Ridge, T. (2014). Simple, efficient, sound and complete combinator parsing for all context-free grammars, using an oracle. In Software Language Engineering: 7th International Conference, SLE 2014, VΓ€sterΓ₯s, Sweden, September 15-16, 2014. Proceedings 7 (pp. 261-281). Springer International Publishing. URL: https://figshare.le.ac.uk/articles/conference_contribution/Simple_efficient_sound_and_complete_combinator_parsing_for_all_context-free_grammars_using_an_oracle/10143794/1/files/18281084.pdf