Scenario Plans
loading x elements...

Scenario Plans

This page lets you browse all Scenario Plans that have been created by contributors.
For a list of official Scenario Plans created by Elody's own developers, see here.
Name Description Creator
Mohsen Hello World This Scenario Plan is part of the tutorial. Just clicking the start button of this plan will print "Hello World!". muhsenbarati@gmail.com
Yolo Object Detection Demo of Object Detection using YOLO Object detection algorithm. YOLO:- You only look once (YOLO) is a system for detecting objects on the Pascal VOC 2012 dataset. Pascal VOC 2012:- http://host.robots.ox.ac.uk:8080/pascal/VOC/ It also makes predictions with a single network evaluation unlike systems like R-CNN which require thousands for a single image. This makes it extremely fast, more than 1000x faster than R-CNN and 100x faster than Fast R-CNN. mahanteshj1996@gmail.com
computer vision project on tracking human and football by Multi-Layered tracker like tv. This program is built with the idea of building layer by layer elliptical and circular tracker around human and football in picture or image file. this program is built by me and I have also uploaded the program to my github account at links - https://github.com/pritam-code-ai/Pritam_AI_code_in_python_1/blob/master/changed_graphical_tracker/yolo.py and https://github.com/pritam-code-ai/Pritam_AI_code_in_python_1/tree/master/changed_graphical_tracker . It allows the user to build an output image as multi-layered elliptical tracker around lower part of human and circular multi layered tracker around football using opencv python library, yolo-v3 weight file, yolo-v3 configuration file and yolo-v3 label names file. The output image or picture file is like shown in football or soccer video analysis in tv. pritambhc@gmail.com
Levenshtein Distance Receives parameters from the option generated by the rule "Demo-levenshtein-distance". These parameters are two strings. The program finds the levenshtein distance between the two strings. The Levenshtein distance between two strings is the number of single character deletions, insertions or substitutions required to transform one string into the other. This is also known as the edit distance. The product of the lengths of the strings has been limited to 10^6 as the worst case time and space complexity of the algorithm used is O(N*M), where "N" and "M" are the lengths of the two strings. omarhassangul@hotmail.com
(Omar) Hello World This Scenario Plan is part of an implementation the tutorial. Just clicking the start button will print 'Hello World!'. omarhassangul@hotmail.com
(Tutorial) Triggers This Scenario Plan is part of the tutorial. Elody runs a Rule that demonstrates how the trigger field works. tutorial_developer_demo
(Tutorial) Improved Presentation This Scenario Plan is part of the tutorial. Elody runs a Rule that demonstrates some improved ways to present your results to the user. tutorial_developer_demo
(Tutorial) A simple Program This Scenario Plan is part of the tutorial. Elody runs a Program that prints the current time. tutorial_developer_demo
(Tutorial) Option used to give a choice This Scenario Plan is part of the tutorial. Elody will ask the user whether or not she should greet the world. tutorial_developer_demo
(Tutorial) Option used as a wrapper This Scenario Plan is part of the tutorial. Just clicking the start button of this plan will print three Messages, one of which is created by an Option. tutorial_developer_demo