List of Interesting ideas and Views:
- Real Time Data Platform Presentation IDC Big Data Forum 2013
- Winning back the Zero Moment of Truth (ZMOT)
- 50 Times a Second measure and correct: Quad copters and Algorithms
- What Shazam and Cortexica can not survive without !
- Why can’t we deliver an open source Science and Technology project in Turkey?
- Drifting Fish Farms Hawaii Big Island – Exprience for Turkey
- Coca-Cola Adjust Taste of Orange Juice by Secret Algorithm (Black Book)
- How does 2013 Budget look like in Turkey?
- Model Yacht Coming Back To Life with Remote Control
- Reinventing Your Company
- The Moment at its Best Visual Form
- Combination of in-Memory R and SAP HANA: Complex Analytics at Speed of Tought
- Top Five Things to Consider in Mobile Era: Benchmark Your Company !
- Algorithms and Sex Appeal: Could algorithms work for Sex Appeal? Can you look more sexy if you know some Mathematics?
- Complex Event Processing and Carrier Hotel New York City – What do they have in common?
Deep Learning : Where are we headed?
I was amazed to see that NVIDIA was just talking about deep learning. I am not here to talk about the differences between Artificial Intelligence or Neural Networks or deep learning, but look a the photo below. NVIDIA CEO on stage and painting his vision for next few years for nvidia. 1- A new GPU and deep learning 2- A very fast box and deep learning 3- Roadmap reveal and deep learning 4- Self-Driving cars...
Guney Digital Art – TSP Path Algorithm
The Original Photo of Guney Candan Back ground removed Thanks to http://www.evilmadscientist.com/ below is the Voronoi Diagram calculated by StippleGen_2 Then after 20 iterations with 3000 dots ductBelow is the TSP path calculated The final V plated end product ! One hand drawing added. This time no software generated view I tried to converting to SVG file
Traveling Salesman Problem and Digital Art
Traveling salesman problem: Wikipedia: “The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.” In the mathematics literature, it appears that the first mention of the TSP was...
High Altitude Tests Part1
As promised I will start my high altitude journey. My aim is to come up with some videos until next summer. Yes you are right it is too much time but I need to start from some where and there is too much to learn. Here are some basic sketches how it is designed for in the first place Basic calculation and assumptions. From: http://www.chem.hawaii.edu/uham/lift.html Lift of Helium Balloons Dia. Ft. Vol. l Lift...