[ POPULAR STORIES ]

CATCH UP THE POPULAR STORIES

AMD Radeon RAMDisk – Software solution – Get faster performance than SSDs with existing RAM

        We all know about computer storage devices namely volatile and nonvolatile storage. Non-volatile storage devices stores the data even during the device is powered off and on the other hand volatile storage devices do not store the data when it is powered off. Hard disks or hard drives used in desktops and… Read More »

Read more
Alternative text

Custom Elasticsearch Index Name/Type Name based on Events in Logstash

     The article details on how to use custom Index/Type name when using Logstash for proessing logs and Elasticsearch as Output. input { file { } } filter { grok { pattern => "%{NUMBER:attribute1} %{GREEDYDATA:attribute2}" } ruby { code => ' event["custom_index_name"] = event["attribute1"] event["custom_type_name"] = event["attribute2"] ' #You can also set an field… Read More »

Read more
Alternative text

iMotion – Haptic Feedback Virtual Reality Motion Controller

      We are now in the generation of virtual reality. Virtual reality displays and Virtual reality controllers are becoming very popular. Some of the examples are GlassUp – An augmented reality eye wear, MYO – YOUR MUSCLE CAN TALK – HAND BASED GESTURE CONTROL, Oculus Rift – nxtGen Virtual Reality Headset and many more.       iMotion,… Read More »

Read more
Alternative text

Create Vertex If Does Not Exist – Gremlin Query – Titan

Create Vertex If Does Not Exist Return a vertex with given label and property. If the vertex does not exist, a new vertex is created and returned to vertexObject. vertexObject = g.V().hasLabel('VERTEX_LABEL').has('property','value').tryNext().orElseGet{ graph.addVertex(label, 'VERTEX_LABEL', 'property', 'value'); }; Related Links:

Read more
Alternative text

Linked List in C – Detect/Find Loop

DATA STRUCTURES IN C – LINKED LIST (20 PROGRAMS) Try DATA STRUCTURES IN C – LINKED LIST (20 PROGRAMS) Linked List in C – Detect/Find Loop :            Loop in linked list is a situation where a node points to one of the previous node in the same linked list Example: Nodes:… Read More »

Read more
Alternative text

[ LATEST STORIES ]

CATCH UP THE LATEST STORIES

[ SUBSCRIBE TO OUR BLOG ]