Real Customer cases for Enterprise software solution implementation
A New Interpretation of Information Rate. Created in 1956 by John Kelly, a Bell Labs scientist. Let us consider a communication channel which is used to transmit the results of a chance situation before those results become common knowledge, so that a gambler may still place bets at the original odds. Consider first the case of a noiseless binary channel, which might be used, for example, to transmit the results of a series of…
Read More
READ: Trading in the Zone by Mark Douglas TRY Those Questions: 1. To make money as a trader you have to know what the market is going co do next. Agree Disagree 2. Sometimes I find myself thinking that there must be a way to trade without having to take a loss. Agree Disagree 3. Making money as a trader is primarily a function of analysis. Agree Disagree 4. Losses are an unavoidable component of…
Read More
To understand why things happen, you need to understand the thoughts and emotions of the people involved
Read More
I had not been bloging much lately shame on me 🙂 Last week after many months I had the opportunity to visit our Palo Alto office. Thanks to the team I had a chance to discuss the hot subjects. when I got back I could not stop investitating on the following technologies. Namely opensource world. If you google on the top opensource technologies with the measured on the basis of received activity you would more…
Read More
SAP Cloud Forum Istanbul 2017 keynote
Read More
Digital Transformation keynote in SAP Forum Ankara 2016
Read More
Can Algorithyms Paint?
Read More
It is not easy to follow without any voice over but you can give it a try. I have composed this slide deck nearly a year ago and the after cheking it last night I really felt that it is even more relevant today. MOONSHOTS for in-memory computing from ugur candan I recently published an other PPT in slideshare. In this one I tries to summarise some interesting examples from digital transformation and in one…
Read More
Why Industry revolution 4.0 matters?
Read More
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…
Read More