Today I finished reading “Guerrilla Marketing for Consultants: Breakthrough Tactics for Winning Profitable Clients” by Jay Conrad Levinson
Archives for 2005
Today I finished reading “The Birth of Tragedy” by Friedrich Nietzsche
Why don’t hypodermic needles change colour to indicate that they have been used?
We have a diabetic cat that requires a daily insulin injection and one of the things that frustrates me is if my room-mate or I accidentally leave a needle on the side after use, the other person is not sure if the needle has been used or not.
Now this could be a simple matter of, “if in doubt, throw it out” but a simple visual indication to show that the needle has been used would be much more effective.
Plus it adds an extra layer of safety to prevent accidental needle re-use, especially amongst people with memory problems.
Today I finished reading “Asterix and Cleopatra” by Rene Goscinny
This week I am listening to “The Fall Of Math” by 65daysofstatic
Today I finished reading “The Hunting of the Snark” by Lewis Carroll
This week I am listening to “The Human Equation” by Ayreon
This week I am listening to “Elvis At Sun” by Elvis Presley
Today I finished reading “Castle Dangerous” by Walter Scott
Today I finished reading “Another Day in Cubicle Paradise” by Scott Adams
This month I am studying “Adopting six sigma”
This week I am listening to “Reise, Reise” by Rammstein
Why aren’t razor blades made disolvable in water?
Then you could use the blades for a few times, and when you are done, toss them in the toilet bowl where they dissolve after a few minutes.
The blades could be made out of a bio-degradable material that doesn’t harm the environment.
I am firm believer that the world needs more engineers, medical doctors, educators and artists.
We need more people doing the hard work of building, creating, keeping people alive and mentoring the next generation.
And we need less people doing the easy work of businessman, lawyer and politician where they get to tell other people what to do.
Today I finished reading “Beyond This Horizon” by Robert Heinlein
This week I am listening to “Riot On An Empty Street” by Kings Of Convenience
Today I finished reading “Programming Game AI by Example” by Mat Buckland
Today I read a paper titled “Interactive visualization of higher dimensional data in a multiview environment”
The abstract is:
We develop multiple view visualization of higher dimensional data.
Our work was chiefly motivated by the need to extract insight from four dimensional Quantum Chromodynamic (QCD) data.
We develop visualization where multiple views, generally views of 3D projections or slices of a higher dimensional data, are tightly coupled not only by their specific order but also by a view synchronizing interaction style, and an internally defined interaction language.
The tight coupling of the different views allows a fast and well-coordinated exploration of the data.
In particular, the visualization allowed us to easily make consistency checks of the 4D QCD data and to infer the correctness of particle properties calculations.
The software developed was also successfully applied in material studies, in particular studies of meteorite properties.
Our implementation uses the VTK API.
To handle a large number of views (slices/projections) and to still maintain good resolution, we use IBM T221 display (3840 X 2400 pixels).
This week I am listening to “Seven Swans” by Sufjan Stevens
Today I finished reading “Fooled by Randomness: The Hidden Role of Chance in Life and in the Markets” by Nassim Nicholas Taleb
Today I finished reading “The Mystery of Edwin Drood” by Charles Dickens
Today I read a paper titled “Neural network ensembles: Evaluation of aggregation algorithms”
The abstract is:
Ensembles of artificial neural networks show improved generalization capabilities that outperform those of single networks.
However, for aggregation to be effective, the individual networks must be as accurate and diverse as possible.
An important problem is, then, how to tune the aggregate members in order to have an optimal compromise between these two conflicting conditions.
We present here an extensive evaluation of several algorithms for ensemble construction, including new proposals and comparing them with standard methods in the literature.
We also discuss a potential problem with sequential aggregation algorithms: the non-frequent but damaging selection through their heuristics of particularly bad ensemble members.
We introduce modified algorithms that cope with this problem by allowing individual weighting of aggregate members.
Our algorithms and their weighted modifications are favorably tested against other methods in the literature, producing a sensible improvement in performance on most of the standard statistical databases used as benchmarks.
Why don’t batteries, especially rechargable ones, change colour based on how much power they have left in them?
This week I am listening to “Future Perfect” by Autolux
Today I read a paper titled “On the suitability of the 2 x 2 games for studying reciprocal cooperation and kin selection”
The abstract is:
The 2 x 2 games, in particular the Prisoner’s Dilemma, have been extensively used in studies into reciprocal cooperation and, to a lesser extent, kin selection.
This paper examines the suitability of the 2 x 2 games for modelling the evolution of cooperation through reciprocation and kin selection.
This examination is not restricted to the Prisoner’s Dilemma, but includes the other non-trivial symmetric 2 x 2 games.
We show that the popularity of the Prisoner’s Dilemma for modelling social and biotic interaction is justified by its superiority according to these criteria.
Indeed, the Prisoner’s Dilemma is unique in providing the simplest support for reciprocal cooperation, and additive kin-selected altruism.
However, care is still required in choosing the particular Prisoner’s Dilemma payoff matrix to use.
This paper reviews the impact of non-linear payoffs for the application of Hamilton’s rule to typical altruistic interactions, and derives new results for cases in which the roles of potential altruist and beneficiary are separated.
In doing so we find the same equilibrium condition holds in continuous games between relatives, and in discrete games with roles.
This month I am studying “Six sigma in-depth”
This week I am listening to “Absent Friends” by The Divine Comedy
Today I finished reading “Artificial Intelligence for Computer Games: An Introduction” by John David Funge
Today I finished reading “GPU Gems: Programming Techniques, Tips and Tricks for Real-Time Graphics” by Randima Fernando
Today I finished reading “The Essential Drucker” by Peter Drucker
Today I finished reading “Perfectly Reasonable Deviations from the Beaten Track: Letters of Richard P. Feynman” by Richard Feynman
This week I am listening to “Sonic Nurse” by Sonic Youth
Today I finished reading “Unearthed Arcana” by Andy Collins
Today I finished reading “The Heart of Mid-Lothian” by Walter Scott
Today I finished reading “The Fair Maid of Perth” by Walter Scott
Today I finished reading “Advanced 3D Game Programming All in One” by Kenneth Finney
This week I am listening to “Marbles” by Marillion
Today I finished reading “The Da Vinci Code” by Dan Brown
Today I finished reading “Perfect Phrases for Managers and Supervisors: Hundreds of Ready-to-Use Phrases for Any Management Situation” by Meryl Runion
Today I finished reading “Guerrilla Marketing on the Internet: The Definitive Guide from the Father of Guerrilla Marketing” by Jay Conrad Levinson
This week I am listening to “Medúlla” by Björk
Today I read a paper titled “Finding Approximate Palindromes in Strings Quickly and Simply”
The abstract is:
Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence.
A simple algorithm requires O(n)-space and almost always runs in $O(k.n)$-time where n is the length of the string and k is the number of “errors” allowed in the palindrome.
Its worst-case time-complexity is $O(n^2)$ but this does not occur with real biological sequences.
A more complex algorithm guarantees $O(k.n)$ worst-case time complexity.
Today I finished reading “Macromedia Flash MX 2004 Game Programming” by Craig Murray
As society moves more towards elective, cosmetic surgery and breast implants are becoming quite prevalent I propose that we start utilising them for things other than ogling.
We could store vast amounts of data in a regular breast implant and read it out via contact-less radio frequency.
The amount of storage in most implants would be mind-boggling, that babe over there with the over-inflated cleavage may just be carrying around the Library of Congress with her.
Perhaps you could embed a 4G enabled web browser in the implants with a digital e-ink tattoo on the surface of the breasts themselves for optimal viewing.
A simple Bluetooth enabled keyboard and mouse would allow for easy navigation.
Though the page rendering part of the browser may need to distort the final web image to account for the curvature of the breast much like an IMAX cinema needs to do, but in reverse.
Of course, if you start putting communications in them suddenly you could use breasts as a mobile mesh network or walking WiFi hotspot.
Now imagine a Beowulf cluster of these…
Interesting article I just read on advances in inflatable breast implants lead me to wonder if we could control the size of the breast implant via a web browser or SMS. Certain enterprising young women could then allow their breast size to be set for a fee.
You just wouldn’t want your website breast size account getting hacked.
Expect to see this feature taken up by adult porn sites and female users of MySpace.com very soon.
Obviously if the breast size is controlled via the cellular network it becomes possible to triangulate position and orientation too.
I guess in time it will be possible to control other bodily functions through a web browser too.
Speech, arousal level, breast shape, mood.
I wonder if Microsoft will ever have an operating system that runs on a breast…
This week I am listening to “Vol. 3: (The Subliminal Verses)” by Slipknot
Today I read a paper titled “Intrusion Detection Systems Using Adaptive Regression Splines”
The abstract is:
Past few years have witnessed a growing recognition of intelligent techniques for the construction of efficient and reliable intrusion detection systems.
Due to increasing incidents of cyber attacks, building effective intrusion detection systems (IDS) are essential for protecting information systems security, and yet it remains an elusive goal and a great challenge.
In this paper, we report a performance analysis between Multivariate Adaptive Regression Splines (MARS), neural networks and support vector machines.
The MARS procedure builds flexible regression models by fitting separate splines to distinct intervals of the predictor variables.
A brief comparison of different neural network learning algorithms is also given.
So the elevators in the building where I have my office now sport LCD panels that play adverts on a continuous loop.
I’m curious, in the future, will elevator operators claim that if we don’t watch the ads that we’re stealing elevator rides from them? Just like the TV execs do today when you record a TV show with your PVR and then skip through the ads. Will there be a camera placed in each elevator to ensure you watch at least your fair share of the ads? The only thing that a TV showing ads in an elevator guarantees is that it won’t kill the conversation. There never is any! Mundanes riding elevators never talk to each other, even if they know everybody around them, haven’t seen them in a long time, have some really important news to tell – like the building is collapsing – or they were having a conversation about some really deep subject just prior to stepping on the elevator.
Put a few mundanes in the stairwell of the same building and they’ll start talking to each other as they take the stairs up to their office – or at least they will for the first few floors, then the huffing and puffing starts and the conversation starts coming in gasped bursts.
Today I read a paper titled “Finding Traitors in Secure Networks Using Byzantine Agreements”
The abstract is:
Secure networks rely upon players to maintain security and reliability.
However not every player can be assumed to have total loyalty and one must use methods to uncover traitors in such networks.
We use the original concept of the Byzantine Generals Problem by Lamport, and the more formal Byzantine Agreement describe by Linial, to nd traitors in secure networks.
By applying general fault-tolerance methods to develop a more formal design of secure networks we are able to uncover traitors amongst a group of players.
We also propose methods to integrate this system with insecure channels.
This new resiliency can be applied to broadcast and peer-to-peer secure communication systems where agents may be traitors or become unreliable due to faults.
Today I finished reading “3D Game Programming All in One” by Kenneth Finney