Scott Sullivan

Blowin' up like the Death Star! My proper name is Scott Sullivan, but your likely to have an easier time searching for me by my pseudonym: "Guy Hoozdis".

---

My name is Scott Sullivan, but that's a fairly common name, you are more likely to find my contact information if you are looking for my alias, Guy Hoozdis.  There is a good story behind that alias-- ask me someday and I'll tell it to you. I've spent most of my life trying not to be tracked or locatable, because I am all-too-aware of how this information can be used for malicious purposes.  Alas, business has called me out-- to show myself.  Now I am spending a fair amount of time updaing profiles and making connections that I would have previously just discussed in person.

Human at Team Sullivan

December 2011 - January 2012

Pursuing endeavors that satisfy my need for creativity, my aptitude for problem solving, and my addiction to technology. Spiritual projects, Community influence projects, and generally applying my skills/energy on projects that promote human welfare.

V.P. of Research at Ziften Technologies, Inc.

September 2009 - October 2011

Organization of technical exploration and the realization of sought after capabilities for productization. Data Czar, responsible for the formulation and tuning of decision making algorithms. Perpetual student and creative abuser of the Windows Operating System and its mechanisms; documented and otherwise.Product concept development pre-incorporation. Server product and infrastructure architect. Conceptual formation and prototype implementation of behavioral analysis algorithms, schemes, and domains.

Software Developer at Symantec

January 2006 - October 2009

Feature prototyping and development for the refinement and continuing development on the behavioral detection engines for identifying malicious software. Prototyping and proof-of-concept development in the application nontraditional solutions and novel concepts to thwart identity theft and credit card fraud.

Software Developer at WholeSecurity

2003 - 2005

Malware analysis-- black box and behavioral profiling to understand the techniques behind malicious intent. Studied trends and techniques employed by criminals, so that we could prototype-- and ultimately patent, productize, then sell-- novel technology that targeted the essence of the the most common attack vectors affecting consumers at that time. Simulate the attacker scenarios against our own products. Maintain and improve automation frameworks that facilitated running thousands of attack scenarios across datasets of unique malware samples. Those interactions performed en-masse generated large amounts of data to be collated and analyzed. The resulting dataset consisted of mitigation results (i.e. success/failures rates for efficacy testing), as well as, datum describing the internal state of the anti-malware technology and environmental expressions directly related to the introduction of the malware. This type of analysis was preformed over-and-over; iteratively improving our products efficacy.

Owner, Entrepreneur, and resident Technocrat at Phoenix Artistry, LLC.

January 2012

Developing Brand Identity, Strengthening Web Presence, Protecting Intellectual Property, Business Analytics, and creative business media and designs-- making everyday corporate agenda's accessible to small-medium local businesses.

The University of Texas at Austin

1999 – 2003

I'm going to start collecting information on the other guys named Scott Sullivan as a hobby. There are just a ton of them. I love to play Sudoku and every other Christmas or so, when things are quite and I'm just enjoying hanging out with the family, I like to write solvers where I explore different mathematical curiosities that I have. I typically done iterative solvers, but I think that I could construct a matrix and do linear algebra to achieve the same result. Other than pranks, security scenarios, and crack.me challenges the other bit of programming logic that I love to write is and seem to come back to over-and-over is a class that uses factoradic-base counting to iterate permutations in O(n) time-- that is, assuming the factorials for very high values have been calculated once before and cached for subsequent use.