Tag Archives: Coding

DarkNet in OpenCL on Asus Tinker Board S

Posted on by — 2 Comments ↓

Hi, today I would like to share the setup of DarkNet in OpenCL that works fine on Asus Tinker Board S. Here is the setup. mkdir github cd github git clone https://github.com/krrishnarraj/libopencl-stub cd libopencl-stub make sudo cp -r include/* /usr/include sudo cp libOpenCL.a /usr/lib cd .. git clone https://github.com/sowson/darknet.git cd darknet # change in Makefile OPENCV=0 and ARM=1 make As an example let me show to you Yolo3-Tiny computation And here it Continue ReadingDarkNet in OpenCL on Asus Tinker Board S→

Tic Tac Toe

Posted on by — Leave a reply

Hello, today I would like to share with you work done in 2011, the tic tac toe game. It is based on jQuery and pure JavaScript, so you can see its source code. And that is why I will not share the HTML5 JS CSS code separately here, so let’s play! Enjoy! p ;).

DarkNet in OpenCL

Posted on by — 33 Comments ↓

Hi, Today I would like to announce that my GitHub fork at https://github.com/sowson/darknet has a new update, the fork is an advanced port of DarkNet CNN from CUDA to OpenCL and tested on macOS with eGPU from Sonnet named Breakaway RX 570 Puck and on my GreenPC it also supports Intel Iris GPU, OpenCV 3, and there are several use cases for it. Yolo3, Yolo2, Yolo1, CIFAR-10 solutions work fine, using demo from Continue ReadingDarkNet in OpenCL→

Floating Pointers on OpenCL cl_mem

Posted on by — Leave a reply

Hi, First welcome in 2018 on my blog, I hope you all feel excited in the new year like me, sorry to be silent for a while, but I was absorbing my first GitHub fork which is “sowson/darknet” and I was coding like a crazy one. Still, I have several to-dos on this code, but I really like it. And regarding this journey, I would like to share with you something awesome Continue ReadingFloating Pointers on OpenCL cl_mem→

HackerRank Customer Service Capacity

Posted on by — Leave a reply

Hi, today I would like to show you how to solve the code puzzle with the timeline. Where you have to in O(n) determine how many maximal events happen simultaneously… I hope you like it ;-). I looked on the Internet, and there is no correct solution for this problem, in my opinion, so far. So I decided to write on my own this solution and share it with my readers… On Continue ReadingHackerRank Customer Service Capacity→

Multi Service Bus Core 2.0

Posted on by — 2 Comments ↓

Hi, today I want to present Multi Service Bus Core 2.0. The new version has a lot of small bugs fixed. I recently bought myself an excellent tool to draw diagrams. Below I will want first to start by showing the concept diagram. Multi-Service Bus Core 2.0 offers Server-Client communication. It is an important point, so I described it first with this but let me start from the basics principles of the Continue ReadingMulti Service Bus Core 2.0→

Multi Service Bus Core

Posted on by — 4 Comments ↓

Hi, this is a day I have been looking forward to for about two years. At least I can put here a pre-release of the Multi-Service Bus Core solution. It is a pre-release because .NET Core 2.0 is still in the preview2 stage. This is, for me, revolutionary code. It is something best I ever did. The C# piece of code that before even .NET Core started supporting WCF Service Host, I Continue ReadingMulti Service Bus Core→

PL Lotto Predictor in C# with Encog 3.3

Posted on by — 14 Comments ↓

Yes, I know that it is impossible to predict lottery results. But if the results would be predictable? Of course, I know they are not, but just hypothetically, for a play with Perceptron Neural Network and prediction algorithms, I want to show you that in 250 lines of code, you can play with prediction thanks to the Encog 3.3 library. I recently bought 2 of Jeff Heaton’s  books about neural networks and Continue ReadingPL Lotto Predictor in C# with Encog 3.3→

Batch Processing Aspect in C#

Posted on by — 1 Comment ↓

Hi, today I want to share with you idea of batch processing aspect. It solves an issue with calling T-SQL Server procedures 1-by-1 requests, for example, for inserts calls. And instead of calling 1-by-1, I prepared aspects that you call 1-by-1, but it does it in batches, for example, up to 100-by-100, like in my test example. Below you can find a code that includes aspects and a simple test. The most Continue ReadingBatch Processing Aspect in C#→

Learn Java so Far so Good Java 1D Array

Posted on by — Leave a reply

Hi, I am happy to announce, that my learn Java journey at the Hacker Rank is going very nice. Today I was pleased to solve the code puzzle named Java 1D Array (Part 2), and this puzzle already has a 39.64% success rate. And its category of Data Structure Challenges, most of the code puzzles have more than a 90% success rate. So far, so good. I have 313 points in Java Continue ReadingLearn Java so Far so Good Java 1D Array→

Learn Java proof at Hacker Rank in Tag Content Extractor

Posted on by — Leave a reply

Hi, some time ago I started learn Java language. I am trying to self-study and learn Java. And I have to say that the language is very nice, and with deep knowledge of C#, my progress is fast. I want to show you today here one of the nice code puzzle solutions named Tag Content Extractor. It takes me some time. I started learning Java from straightforward puzzles, and every next one Continue ReadingLearn Java proof at Hacker Rank in Tag Content Extractor→