Joseph Mullins

Programmer | Security | Automation

joseph@ropeney.com

Good security, clean code, scalable architecture, what else is better? Maybe beer comes close, which is why I also blog at HoppyJo. Take a read and drop me a message if you find anything useful or better yet, if you disagree.

Blog

Setting up Good Security Practices 11 Oct, 2017 @ 00:00

Simple steps you can take to improve your current security practices. With an ever changing land field, making sure you follow some best practices will help prevent future disasters.

ActiveMQ brokering between Ruby and Java 05 Aug, 2017 @ 17:34

With so many popular languages today, the importance of a Message Queue is becoming more and more paramount to enable inter language communication.

Trying out GoLang 06 Jul, 2017 @ 00:00

Why I started and got hooked with GoLang

Making Ruby faster with Rust and Fiddle 07 Aug, 2016 @ 02:47

Some Rust examples for calling rust code from ruby using Fiddle/FFI - Updated 5th September 2016 with new rust struct example using move instead of clone.

Trialing the new kid on the block, Rust 18 Jun, 2016 @ 22:34

Rust is the kid on the block for systems programming languages, meant to be a safer alternative for C, C++. Solving Project Euler problems 8, 9, 10

Project Euler problem 7 10 May, 2016 @ 19:04

Project Euler problem 7 in x86 ASM Prime number generator.

Project Euler problems 5 and 6 11 Apr, 2016 @ 23:23

Project Euler problem 5 and Project Euler problem 6 in assembly. The problems were both rather simple so I decided to put both solutions together.

Project Euler 4 27 Mar, 2016 @ 03:11

Project Euler 4's problem is a unique one, that is very easily solvable using strings and characters. In the interest of making everything difficult for myself, I have implemented it using a mathematical only approach.

Project Euler 3 25 Mar, 2016 @ 15:42

The next part of the Project Euler's problems, number 3. This one was fairly straight forward if you want to brute force it, but required a more proven algorithm to get the real result in any decent time frame. We see why n² is such a bad way to go.

Project Euler 2 23 Mar, 2016 @ 23:27

Solving Project Euler's second problem in ASM. This required finding the sum of the even values terms in the Fibonacci sequence under 4,000,000