Search Results for "red"

LoggingExtras allows routing logged information to different places when constructing complicated "log plumbing" systems. Built upon the concept of simple parts composed together, subtyping AbstractLogger provides a powerful and flexible definition for your logging system without a need to define any custom loggers. When we talk about composability, the composition of any set of Loggers is itself a Logger, and LoggingExtras is a composable logging system.

...In the CNN above, tensors will be 3-dimensional with the exception of the output layer. A neuron can be thought of as a function that takes in multiple inputs and yields a single output. The outputs of neurons are represented above as the red → blue activation maps.

...Although developed for determining feature volume, LAVA is also completely compatible with other types of image analysis, such as fluorescence intensity. Work is in progress to provide three-channel functionality, allowing comparison of relative intensity of red, green, and blue channels in multi-color images.

...Ccide checks all conditions once and only once, avoiding side effects. Ccide checks tables for conflicts and other errors. Input example: //DECISION_TABLE: // 1 3 2 2 | light == $$ /* 1=red, 2= yellow, 3=green. */ // N - - - | speed == STOPPED // - - Y - | speed == SLOW // - N - Y | speed == FAST // ______|___________________ // X - X - | Stop(); // - - - X | SlowDown(); // - X - - | SpeedUp(); //END_TABLE:

Simulates a city grid of streets, intersections and traffic signals. It supports 8 phases with overlaps, right and left hand drive, turnouts, permitted left and right on red, density and semi-actuation and help screens for every panel.

AnaglyphCanvas3D is library for adding anaglyphs (red-green, red-cyan and so on) to the Java3D programming language. It utilizes the normal Canvas (-3D) class of Java3D and extends it for stereoscopic effects. A prototypic GUI for testing is also ava

This application is a tree algorithms visualizator. The user can create his own tree of a certain type (among binary, binary search, and red black), his algorithm and then can observe the execution in real time of his algorithm on his tree.