The Excitement of Czech Volleyball: Women's 1. Liga
The Czech Republic's Women's 1. Liga is gearing up for an exhilarating day of volleyball matches tomorrow. With teams battling fiercely for supremacy, fans and bettors alike are eagerly anticipating the outcomes. This league, known for its competitive spirit and high-level play, promises a thrilling spectacle as the top teams vie for dominance on the court.
Teams to Watch
As we look ahead to tomorrow's matches, several teams stand out due to their impressive performances this season. The top contenders include Slavia Praha, VK Prostějov, and VK Karlovarsko, each bringing a unique style and strategy to the court.
- Slavia Praha: Known for their strong defensive play and tactical acumen, Slavia Praha has consistently been a powerhouse in the league.
- VK Prostějov: With a robust offensive lineup, VK Prostějov has been making waves with their aggressive playstyle.
- VK Karlovarsko: This team is celebrated for their balanced approach, combining solid defense with dynamic offense.
Match Predictions and Betting Insights
For those interested in placing bets on tomorrow's matches, understanding the dynamics of each team is crucial. Here are some expert predictions based on recent performances and head-to-head statistics:
Prediction: Slavia Praha vs VK Prostějov
Slavia Praha enters this match as favorites due to their consistent performance throughout the season. Their ability to control the tempo of the game makes them a formidable opponent against VK Prostějov.
- Betting Tip: Consider betting on Slavia Praha to win in straight sets.
- Key Player: Watch out for Slavia's star setter, whose precision in setting up attacks could be pivotal.
Prediction: VK Karlovarsko vs VTJ Tábor
VK Karlovarsko faces VTJ Tábor in what promises to be a closely contested match. Both teams have shown resilience and strategic depth, making this matchup unpredictable.
- Betting Tip: A three-set victory for VK Karlovarsko could be a wise bet given their balanced gameplay.
- Key Player: Keep an eye on Karlovarsko’s libero, whose defensive skills could turn the tide of the match.
Tactical Analysis
Understanding the tactics employed by these teams can provide deeper insights into potential outcomes. Here’s a breakdown of key strategies:
Slavia Praha's Tactical Edge
Slavia Praha excels in transitioning from defense to offense swiftly. Their ability to read opponents' plays allows them to counter effectively.
- Defensive Strategy: Utilizing quick rotations and strong blocking formations.
- Offensive Strategy: Employing fast-paced attacks with well-coordinated spikes.
VK Prostějov's Aggressive Playstyle
Known for their aggressive approach, VK Prostějov often dominates through sheer power and speed.
- Defensive Strategy: Focusing on disrupting opponents' serves with strategic positioning.
- Offensive Strategy: Leveraging powerful hitters to break through defenses.
Betting Strategies
<|repo_name|>ApeironGames/IntelliGym<|file_sep#!/usr/bin/env python
import sys
import os
from optparse import OptionParser
import numpy as np
import scipy.io as sio
def parse_args():
parser = OptionParser()
parser.add_option("-f", "--file", dest="filename",
help="Path of file containing matrix")
parser.add_option("-c", "--column", dest="column",
help="Column number (zero-indexed) that contains data")
(options,args) = parser.parse_args()
if not options.filename or not options.column:
print "Must specify file name (-f) AND column number (-c)"
sys.exit(1)
return (options.filename,options.column)
def main():
filename,column = parse_args()
data = np.loadtxt(filename)
data = data[:,int(column)]
sio.savemat("out.mat", {"data":data})
if __name__ == "__main__":
main()
<|repo_name|>ApeironGames/IntelliGym<|file_sep Governing Equations - Muscles
====================================
The governing equations describing muscle behavior are derived from Hill's muscle model.
.. math::
:nowrap:
begin::equationlabel{eqn:muscle_force}
f_{m}=begin{cases}
frac{sigma_{m}A_{0}}{l_{ce}} & l_{ce}f_p^max
end:cases}
end::equation
where :math:`f_p^max` represents maximum force that passive element can withstand without undergoing plastic deformation; above this value it will begin stretching according to spring constant (:math`hat{k}_s`). Note that if passive element does undergo plastic deformation then there will be no recovery once load ceases.
.. math::
:nowrap:
begin::equationlabel{eqn:muscle_active_element_length}
l_a=l_c-l_ce-l_p-Delta{l}_a(t)
end::equation
where term being subtracted off represents active shortening distance.
.. math::
:nowrap:
begin::equationlabel{eqn:muscle_velocity_transition_velocity_at_slack_length}
v_0=alpha(l_c-l_c^*)/l_c^*
end::equation
where term being multiplied by coefficient (:math`alpha`) represents how much longer current muscle fiber bundle length (:math`lc`)is compared with optimal muscle fiber bundle length (:math`lc*`). If current muscle fiber bundle length equals optimal muscle fiber bundle length then transition begins at zero velocity regardless of other factors.
.. math::
<|file_sep|>#include "game.h"
#include "ball.h"
#include "box.h"
#include "humanoid.h"
#include "gripper.h"
#include "target.h"
Game *Game_create() {
Game *game = new Game;
game->world = World_create();
game->camera = Camera_create();
game->ball = Ball_create();
game->box = Box_create();
game->humanoid = Humanoid_create();
game->gripper = Gripper_create();
game->target = Target_create();
return game;
}
void Game_destroy(Game *game) {
delete game->world;
delete game->camera;
delete game->ball;
delete game->box;
delete game->humanoid;
delete game->gripper;
delete game->target;
free(game);
}
void Game_step(Game *game) {
for (int i=0;iworld.bodies[i]) continue;
Body *body = game->world.bodies[i];
body.step(&game->world);
if (body==game->ball || body==game->box || body==game->humanoid || body==game->gripper || body==game->target)
body.render(game);
}
Camera_update(game);
glutPostRedisplay();
}
void Game_render(Game *game) {
glClearColor(0.5f,0.5f,1.f,.5f);
glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);
Camera_set(game);
if (renderWireframe)
glPolygonMode(GL_FRONT_AND_BACK,GL_LINE);
glPushMatrix();
for (int i=0;iworld.bodies[i]) continue;
Ball *ball;
if ((ball=dynamic_cast(game->world.bodies[i])))
ball.render(game);
Box *box;
if ((box=dynamic_cast(game->world.bodies[i])))
box.render(game);
Humanoid *humanoid;
if ((humanoid=dynamic_cast(game->world.bodies[i])))
humanoid.render(game);
Gripper *gripper;
if ((gripper=dynamic_cast(game->world.bodies[i])))
gripper.render(game);
Target *target;
if ((target=dynamic_cast(game->world.bodies[i])))
target.render(game);
Cylinder *cylinder;
if ((cylinder=dynamic_cast(game->world.bodies[i])))
cylinder.render(game);
Sphere *sphere;
if ((sphere=dynamic_cast(game->world.bodies[i])))
sphere.render(game);
Cone *cone;
if ((cone=dynamic_cast(game->world.bodies[i])))
cone.render(game);
Capsule *capsule;
if ((capsule=dynamic_cast(game->world.bodies[i])))
capsule.render(game);
Torus *torus;
if ((torus=dynamic_cast(game->world.bodies[i])))
torus.render(game);
Pyramid* pyramid;
if((pyramid=dynamic_cast(game -> world.bodies [i]))){
pyramid -> render ( );
}
Cube* cube ;
if((cube= dynamic_cast ( game -> world . bodies [i] ))){
cube -> render( );
}
glPopMatrix();
glutSwapBuffers();
}<|repo_name|>ApeironGames/IntelliGym<|file_sep[//]: # (Image References)
[image1]: https://user-images.githubusercontent.com/10624937/42135619-d90f2f28-7d12-11e8-8823-82b970a54d26.gif "Trained Agent"
# Project Report
### Introduction
In this project I am trying to train an agent using DQN algorithm which would learn how to throw ball into target box using humanoid robot arm provided by VREP simulator.
![Trained Agent][image1]
### Implementation Details
I am using OpenAI Gym environment wrapper around VREP simulator which acts as interface between our code running in Python and VREP simulator running on C++ side.
This wrapper takes care of all communication between our code running in Python side and VREP simulator running C++ side.
My implementation consists mainly two parts:
1) Agent part implemented using Pytorch library
2) Environment part implemented using OpenAI Gym library
#### Agent Part
Agent part consists following components:
##### Experience Replay Buffer
This buffer stores agent experience so far which includes information about state , action taken by agent , reward received from environment after taking action , next state reached after taking action , whether episode terminated or not etc .
We use these stored experiences later while training our agent .
##### Deep Q Network Model
Deep Q Network Model consists following layers :
- First Layer - Convolutional Layer
- Second Layer - Convolutional Layer
- Third Layer - Fully Connected layer
#### Environment Part
Environment part consists following components:
##### State Space Definition
State space definition defines how we are going to represent state space for our problem . In my case I am representing state space using image representation where image size would be **64x64x6** . Each channel represents different information about environment like position information about ball , position information about target box etc . Each pixel value would represent some real world distance unit scaled down so that it fits into image size **64x64** .
##### Action Space Definition
Action space definition defines what actions can be taken by agent at any given time step . In my case I am defining action space consisting **6** discrete actions which corresponded with six joints present on humanoid robot arm provided by VREP simulator . These six joints corresponded with shoulder joint , elbow joint , wrist joint etc .
##### Reward Function Definition
Reward function definition defines how we are going calculate reward signal received by agent after taking any particular action at any given time step . In my case I am defining reward function such that if ball falls inside target box then agent gets positive reward otherwise negative reward .
### Training Details
I trained my agent using DQN algorithm where epsilon greedy policy was used along with experience replay buffer . Epsilon value was set initially as **1** but gradually decayed over time so that exploration rate decreases over time allowing more exploitation instead .
Training took around **10 hours** on GPU machine consisting Intel(R) Core(TM)i7-6700HQ CPU @2.60GHz processor along with NVIDIA GeForce GTX960M graphics card .
### Results
After training my agent successfully I tested it against untrained version where trained version performed significantly better than untrained one achieving success rate around **90%** .
### Future Work
In future I would like try implementing following improvements :
1) Implement Double DQN algorithm instead of vanilla DQN algorithm used currently .
2) Try implementing Dueling Network architecture instead of vanilla Deep Q Network architecture used currently .
3) Try implementing Prioritized Experience Replay instead of uniform sampling used currently .
4) Try implementing Noisy Networks instead random noise added during exploration phase used currently .
5) Try implementing Distributional RL instead estimating expected value distribution over returns used currently .
6) Try implementing Hindsight Experience Replay instead relying solely upon actual rewards received during training phase used currently .
### Conclusion
In conclusion I successfully trained an agent using DQN algorithm which learned how throw ball into target box using humanoid robot arm provided by VREP simulator achieving success rate around **90%** .
I believe there are still many improvements left which could further improve performance but overall results were quite satisfactory.
## References
[1] Mnih et al., “Playing Atari with Deep Reinforcement Learning,” arXiv preprint arXiv:1312.5602 (2013).
[2] Mnih et al., “Human-Level Control Through Deep Reinforcement Learning,” Nature vol. 518 no. 7540 pp. 529–533 Dec. 2015 doi:10.1038/nature14236.
## License
MIT License
Copyright (c) [2019] [Anirudha Joshi]
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED,
INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
DAMAGES OR OTHER LIABILITY,
WHETHER IN AN ACTION OF CONTRACT,
TORT OR OTHERWISE,
ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
MIT License
Copyright (c) [2019] [Anirudha Joshi]
Permission is hereby granted,
free of charge,
to any person obtaining a copy
of this software and associated documentation files (the "Software"),
to deal
in the Software without restriction,
including without limitation the rights
to use,
copy,
modify,
merge,
publish,
distribute,
sublicense,
and/or sell copies of the Software,
and to permit persons to whom the Software is furnished
to do so,
subject
to
the following conditions:
The above copyright notice
and this permission notice shall be included
in all copies or substantial portions
of the Software.
THE SOFTWARE IS PROVIDED "AS IS",
WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED,
INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
DAMAGES OR OTHER LIABILITY,
WHETHER IN AN ACTION OF CONTRACT,
TORT OR OTHERWISE,
ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
MIT License
Copyright(c)
2019 Anirudha Joshi
Permissionis hereby granted,freely charge,toany person obtainingacopyofthissoftwareandassociateddocumentationfiles(the"Software"),to dealinthesoftwarewithoutrestriction,includingsubjecttomodify,mergesublicense,and/or sellsellcopiesofthesoftware,andtopermitpersonswhothesoftwareshallbedone,suchthatthecompanyisnotliableforanyclaim,damagesorotherlegalactionarisingfromthesoftwareoritsuse.
THESOFTWAREISPROVIDED"AS-IS",WITHNOMANIFESTOREXPLICITSWARRANTY.FOREXAMPLE,THEREMAYBENOWARRANTYOFMERCHANTABILITY,FITNESSFORAPARTICULARPURPOSEORNONINFRINGEMENT.WEHETHERACTIONOFCONTRACT,TORTORELSEINANYCASEARISINGFROMOUTOFORINCONNECTIONWITHTHESOFTWAREORTHEUSEOROTHERDEALINGSINTHESOFTWARE.SEELESSTHANPERMISSIONNOTICESOFTWARE.HOWEVER,IHAVETAKENTHEPRECAUTIONSNECESSARYTOENSURETHATTHISSOFTWAREISTRUEANDACCURATETOMYKNOWLEDGE.THEREARENOGUARANTEESOFACCURACY.ANYUSEISATYOUROWNRISK.IHAVEDONEWHATISREASONABLELYPOSSIBLETOENSURETHATTHISSOFTWAREISTRUEANDACCURATEBUTAMAKENONEIMPLICITORSPECIFICALLYSTATINGANYTHINGELSE.INNOEVENTSHALLIAMBEHOLDENLIABLEFORANYCLAIM,DAMAGESOROTHERLIABILITYWHETHERINSUITOROTHERWISEARISINGFROMOUTOFORINCONNECTIONWITHTHISSOFTWAREORITSUSE.OROTHERDEALINGSINTHESOFTWARE.IFYOUUSETHISPROGRAMYOUAGREEANDUNDERSTANDTHATITISTHESTANDARDLICENSEAGREEMENTANDCONDITIONSUSEDBYMOSTOPEN-SOURCEPROJECTS.IHAVEWORKEDONTHISPROJECTSOLELYONMYOWN.THEREARENOASSOCIATEDCOMPANIESINVOLVEDWITHTHISPROJECT.BYUSINGTHISPROGRAMYOUAGREEANDUNDERSTANDTHATITISTHESTANDARDLICENSEAGREEMENTANDCONDITIONSUSEDBYMOSTOPEN-SOURCEPROJECTS.IHAVEWORKEDONTHISPROJECTSOLELYONMYOWN.THEREARENOASSOCIATEDCOMPANIESINVOLVEDWITHTHISPROJECT.BYUSINGTHISPROGRAMYOUAGREEANDUNDERSTANDTHATITISTHESTANDARDLICENSEAGREEMENTANDCONDITIONSUSEDBYMOSTOPEN-SOURCEPROJECTS.IHAVEWORKEDONTHISPROJECTSOLELYONMYOWN.THEREARENOASSOCIATEDCOMPANIESINVOLVEDWITHTHISPROJECT.BYUSINGTHISPROGRAMYOUAGREEANDUNDERSTANDTHATITISTHESTANDARDLICENSEAGREEMENTANDCONDITIONSUSEDBYMOSTOPEN-SOURCEPROJECTS.IHAVEWORKEDONTHISPROJECTSOLELYONMYOWN.THEREARENOASSOCIATEDCOMPANIESINVOLVEDWITHTHISPROJECT.BYUSINGTHISPROGRAMYOUAGREEANDUNDERSTANDTHATITISTHESTANDARDLICENSEAGREEMENTANDCONDITIONSUSEDBYMOSTOPEN-SOURCEPROJECTS.IHAVEWORKEDONTHISPROJECTSOLELYONMYOWN.THEREARENOASSOCIATEDCOMPANIESINVOLVEDWITHTHISPROJECT.THISPROGRAMEFFECTIVELYCONTAINSALLCODEREQUIREDTOBUILDACOMPLETEAPPLICATION.THISAPPLICATIONCANBEEXECUTEDFROMANYWHERE.ANDIFNEEDEDCANBEPORTEDTOANYPLATFORM.ITISEASYTOTEST.SIMPLECOMMANDLINETOOLSAREAVAILABLETOHELPDEBUGGING.ITDOESNOTDEPENDONTIME.CONSIDERINGITSCOMPLEXITYTHEPERFORMANCEISSUCCINCT.NOTEHOWEVERTHATASITHASTOTALLYBEDESIGNEDBYONEPERSONINEVERYAVAILABLETIMEIHAVETAKENTHEPRECAUTIONSTOENSURETHATSUCHCIRCUMSTANCEDOESNOTEXIST.THISPROGRAMISFREEFORANYONETOUSE.FORYOUROWNEXPERIMENTATIONPURPOSESONYOURDEVICEONLY.DONOTSHAREWHOLEPACKAGE.EITHERSOURCECODEORMAINEXECUTABLEFILE.OPTIONALLY,YOUCANSENDMEBACKYOURFEEDBACKONSOMEFEATURESFROMUSERPERSPECTIVE.WEATHERITTURNSOUTGOODOREVENBAD.WEALTHOUGHWEKNOWABOUTOURBUGSBUTUSERPERSPECTIVEWILLHELPUSFURTHERMORE.ITSHOULDBEUNDERSTOODTHATSOMEFEATURESWILLBECLOSEDBASEDONUSERFEEDBACK.GENERALLY,IHAVETAKENTHEPRECAUTIONSTOENSURETHATSUCHCIRCUMSTANCEDOESNOTEXIST.YOUHAVEALREADYREADABOUTALLABOVEPOINTSNOWPLEASEREADAGAINIMPORTANTPOINTS.ANDMAKEYOURDECISION.BUTIFYOUCHECKOUTALLABOVETHINGSAGAINTHENJUSTCLICKACCEPTBUTTONTOCONTINUE.FIRSTTIMEWELIKEGETTINGYOURFEEDBACK.ONCEAGAINPLEASEREADALLABOVEPOINTS.CONSENTFORMERDOCUMENTATIONPOINTSFOLLOWINGACCEPTANCEBUTTON.
MIT License
Copyright(c)
2019 Anirudha Joshi
Permissionis hereby granted,freely charge,toany person obtainingacopyofthissoftwareandassociateddocumentationfiles(the"Software"),to dealinthesoftwarewithoutrestriction,includingsubjecttomodify,mergesublicense,and/or sellsellcopiesofthesoftware,andtopermitpersonswhothesoftwareshallbedone,suchthatthecompanyisnotliableforanyclaim,damagesorotherlegalactionarisingfromthesoftwareoritsuse.
THESOFTWAREISPROVIDED"AS-IS",WITHNOMANIFESTOREXPLICITSWARRANTY.FOREXAMPLE,THEREMAYBENOWARRANTYOFMERCHANTABILITY,FITNESSFORAPARTICULARPURPOSEORNONINFRINGEMENT.WEHETHERACTIONOFCONTRACT,TORTORELSEINANYCASEARISINGFROMOUTOFORINCONNECTIONWITHTHESOFTWAREORTHEUSEOROTHERDEALINGSINTHESOFTWARE.SEELESSTHANPERMISSIONNOTICESOFTWARE.HOWEVER,IHAVETAKENTHEPRECAUTIONSNECESSARYTOENSURETHATTHISSOFTWAREISTRUEANDACCURATETOMYKNOWLEDGE.THEREARENOGUARANTEESOFACCURACY.ANYUSEISATYOUROWNRISK.IHAVEDONEWHATISREASONABLYPOSSIBLETOENSURETHATTHISSOFTWAREISTRUEANDACCURATEBUTAMAKENONEIMPLICITORSPECIFICALLYSTATINGANYTHINGELSE.INNOEVENTSHALLIAMBEHOLDENLIABLEFORANYCLAIM,DAMAGESOROTHERLIABILITYWHETHERINSUITOROTHERWISEARISINGFROMOUTOFORINCONNECTIONWITHTHISSOFTWAREORITSUSE.OROTHERDEALINGSINTHESOFTWARE.IFYOUUSETHISPROGRAMYOUAGREEANDUNDERSTANDTHATITISTHESTANDARDLICENSEAGREEMENTANDCONDITIONSUSEDBYMOSTOPEN-SOURCEPROJECTS.IHAVEWORKEDONTHISPROJECTSOLELYONMYOWN.THEREARENOASSOCIATEDCOMPANIESINVOLVEDWITHTHISPROJECT.BYUSINGTHISPROGRAMYOUAGREEANDUNDERSTANDTHATITISTHESTANDARDLICENSEAGREEMENTANDCONDITIONSUSEDBYMOSTOPEN-SOURCEPROJECTS.IHAVEWORKEDONTHISPROJECTSOLELYONMYOWN.THEREARENOASSOCIATEDCOMPANIESINVOLVEDWITHTHISPROJECT.BYUSINGTHISPROGRAMYOUAGREEANDUNDERSTANDTHATITISTHESTANDARDLICENSEAGREEMENTANDCONDITIONSUSEDBYMOSTOPEN-SOURCEPROJECTS.IHAVEWORKEDONTHISPROJECTSOLELYONMYOWN.THEREARENOASSOCIATEDCOMPANIESINVOLVEDWITHTHISPROJECT.BYUSINGTHISPROGRAMYOUAGREEANDLETTERWISESTATEMENTINDICATINGYOURACCEPTANCE.OFTHERMS.EVERYTHINGELSESTATEMENTINDICATINGYOURACCEPTANCE.OFTHERMS.EVERYTHINGELSESTATEMENTINDICATINGYOURACCEPTANCE.OFTHERMS.EVERYTHINGELSESTATEMENTINDICATINGYOURACCEPTANCE.OFTHERMS.EVERYTHINGELSESTATEMENTINDICATINGYOURACCEPTANCE.OFTHERMS.EVERYTHINGELSESTATEMENTINDICATINGYOURACCEPTANCE.OFTHERMS.EVERYTHINGELSESTATEMENTINDICATINGYOURACCEPTANCE.OFTHERMS.EVERYTHINGELSESTATEMENTINDICATINGYOURACCEPTANCE.OFTERMS.YOUHAVEALREADYREADABOUTALLABOVETHINGSNOWPLEASEREADAGAINIMPORTANTPOINTS.ANDMAKEYOURDECISION.BUTIFYOUCHECKOUTALLABOVETHINGSAGAINTHENJUSTCLICKACCEPTBUTTONTOCONTINUE.FIRSTTIMEWELIKEGETTINGYOURFEEDBACK.ONCEAGAINPLEASEREADALLABOVEPOINTS.CONSENTFORMERDOCUMENTATIONPOINTSFOLLOWINGACCEPTANCEBUTTON.
MIT License
Copyright(c)
2019 Anirudha Joshi
Permissionis hereby granted,freely charge,toany person obtainingacopyofthissoftwareandassociateddocumentationfiles(the"Software"),to dealinthesoftwarewithoutrestriction,includingsubjecttomodify,mergesublicense,and/or sellsellcopiesofthesoftware,andtopermitpersonswhothesoftwareshallbedone,suchthatthecompanyisnotliableforanyclaim,damagesorotherlegalactionarisingfromthesoftwareoritsuse.
THESOFTWAREISPROVIDED"AS-IS",WITHNOMANIFESTOREXPLICITSWARRANTY.FOREXAMPLE,THEREMAYBENOWARRANTYOFMERCHANTABILITY,FITNESSFORAPARTICULARPURPOSEORNONINFRINGEMENT.WEHETHERACTIONOFCONTRACT,TORTORELSEINANYCASEARISINGFROMOUTOFORINCONNECTIONWITHTHESOFTWAREORTHEUSEOROTHERDEALINGSINTHESOFTWARE.SEELESSTHANPERMISSIONNOTICESOFTWARE.HOWEVER,IHAVETAKENTHEPRECAUTIONSNECESSARYTOENSURETHAT THIS SOFTWARE IST RUE AND ACCURATE TO MY KNOWLEDGE.THERE ARE NO GUARANTEES OF ACCURACY.ANY USE IS AT YOUR OWN RISK.I HAVE DONE WHAT IS REASON AB LY POSSIBLE TO ENSURE THAT THIS SOFTWARE IS TRUE AND ACCURATE BUT AM MAK EN ONE IMPLICIT O R SPECIFICALLY STAT IN G ANY THI NG ELSE.IN NO EVENT SHALL I BE HOLD EN LI A BLE FOR ANY CLAIM,DAMAGES O R OTHER LI AB IL IT Y WHETHER IN SU IT O R O T H E R WISE AR ISI N G FROM OUT O F O R IN CON NE CT IO N WI TH THIS SO FT WA RE O R ITS USE.OR OT HER DE AL IN GS INT HE SO FTWA RE.If YOU U SE T HIS P RO GR AM Y OU AG REE A ND UN DER ST AND THAT IT IS T HE ST AN DAR D L ICE N SE AG REM ENT A ND CO ND IT IO NS US ED BY MO ST OP EN - SO UR CE PRO JEC TS.I HAVE W O RK ED ON THIS P ROJECT SO LE LY ON MY OW N THERE ARE NO ASS OCIA TED C OMP AN IE S INV OL VE D W IT H THIS P ROJECT.By USING THIS PROGRAM YOU AGREE AND UNDER ST AND THAT IT IS T HE ST AN DAR D L ICE N SE AG REM ENT A ND CO ND IT IO NS US ED BY MO ST OP EN - SO UR CE PRO JEC TS.I HAVE W O RK ED ON THIS P ROJECT SO LE LY ON MY OW N THERE ARE NO ASS OCIA TED C OMP AN IE S INV OL VE D B Y US IN G T HIS P ROGRAM Y OU AG REE AND UN DER ST AND THAT IT IS T HE ST AN DAR D L ICE N SE AG REM ENT A ND CO ND IT IO NS US ED BY MO ST OP EN - SO UR CE PRO JEC TS.I HAVE W O RK ED ON THIS P ROJECT SO LE LY ON MY OW N THERE ARE NO ASS OCIA TED C OMP AN IE S INV OL VE D B Y US IN G T HIS P ROGRAM Y OU AG REE A ND UN DER ST AND THAT IT IS T HE ST AN DAR D L ICE N SE AG REM ENT A ND CO ND IT IO NS US ED BY MO ST OP EN - SO UR CE PRO JEC TS.I HAVE W O RK ED ON THIS P ROJECT SO LE LY ON MY OW N THERE ARE NO ASS OCIA TED C OMP AN IE S INV OL VE D B Y US IN G T HIS P ROGRAM Y OU AG REE A ND UN DER ST AND THAT IT IS T HE ST AN DAR D L ICE N SE AG REM ENT A ND CO ND IT IO NS US ED BY MO ST OP EN - SO UR CE PRO JEC TS.It SHOULD BE UNDE RTA NNDED TH AT SOME FE ATURES WILL BE CLOSE DBASE DON USER FE EDB ACK.GENE RA L LY,I HA VE TA K EN THE PRE CA U TI ON S TO ENSU RE TH AT SUCH C IRCU M STA NC ES DO NOT EX IST.YOU HAVE ALREADY READ ABOUT ALL ABOVE POINTSNOW PLEASE READ AGAIN IMPORTANT POINTSANDMAKE YOUR DECISION.But IF YOU CHECK OUT ALL ABOVE THINGS AGAIN THEN JUST CLICK ACCEPT BUTTON TO CONTINUE.FIRST TIME WE LIKE GETTING YOUR FEEDBACK.ONCE AGAIN PLEASE READ ALL ABOVE POINTSCONSENT FORMER DOCUMENTATION POINTSFOLLOWING ACCEPTANCE BUTTON.
MIT License Copyright(c)[2019]Anirudha Joshi Permissionis herebygranted,freelycharge,toanypersonobtainingacopyofthissoftwareandassociateddocumentationfiles(the"Software"),todealinthesoftwarewithoutrestriction,includingsubjecttomodify,mergesublicense,and/orsellcopiesofthesoftware,andtopermitpersonswhothesoftwareshallbedone,suchthatthecompanyisnotliableforanyclaim,damagesorotherlegalactionarisingfromthesoftwareoritsuse.TheSoftwaredoesnotdependontime.Consideringitscomplexitytheperformanceissuccinct.NotehoweverthatasthitastotallybeDesignedbyOnePersonineveryavailabletimeIhaveTakenthePrecautionsnecessarytoensurethatsuchcircumstancedoesnotexist.ThisProgramEffectivelycontainsallcodeRequiredToBuildACompleteApplication.ThisApplicationCanBeExecutedFromAnywhere.AndIfNeededCanBePortedToAnyPlatform.ItIsEasyToTest.SimpleCommandLinetoToolsAreAvailableToHelpDebugging.ItDoesNotDependentTime.ConsideringItsComplexityThePerformanceIs Succinct.NoteHoweverThatAsItHasTotallyBeenDesignedByOnePersonInEveryAvailableTimeIHavetakenthePrecautionstoEnsureThatSuchCircumstanceDoesNotExist.ThisProgramEffectivelyContainsAllCodeRequiredToBuildACompleteApplication.ThisApplicationCanBeExecutedFromAnywhere.AndIfNeededCanBePortedToAnyPlatform.ItIsEasyToTest.SimpleCommandLinetoToolsAreAvailableToHelpDebugging.ItDoesNotDependentTime.ConsideringItsComplexityThePerformanceIs Succinct.NoteHoweverThatAsItHasTotallyBeenDesignedByOnePersonInEveryAvailableTimeIHavetakenthePrecautionstoEnsureThatSuchCircumstanceDoesNotExist.ThisProgramEffectivelyContainsAllCodeRequiredToBuildACompleteApplication.ThisApplicationCanBeExecutedFromAnywhere.AndIfNeededCanBePortedToAnyPlatform.ItIsEasyToTest.SimpleCommandLinetoToolsAreAvailableToHelpDebugging.ItDoesNotDependentTime.ConsideringItsComplexityThePerformanceIs Succinct.NoteHoweverThatAsItHasTotallyBeenDesignedByOnePersonInEveryAvailableTimeIHavetakenthePrecautionstoEnsureThatSuchCircumstanceDoesNotExist.TheSoftwaredoesnotdependontime.Consideringitscomplexitytheperformanceissuccinct.NotethatasthitastotallybeDesignedbyOnePersonineveryavailabletimeihavetakenthePrecautionsnecessarytoensurethatsuchcircumstancedoesnotexist.thisprogrameffectivelycontainsallcodeRequiredtobuildacompleteapplication.thisapplicationcanbeexecutedfromanywhere.andifneededcanbeportedtoanypatform.itiseasytotest.simplecommandlinetotoolsareavailabletodebugging.itdoesnoDependentTime.ConsideringItsComplexityThePerformanceIs Succinct.NoteHowEverThatAsItHasTotallyBeenDesignedByOnePersonInEveryAvailableTimeIHavetakenthePrecautionstoEnsureThatSuchCircumstanceDoesNotExist.TheSoftwaredoesnotdependontime.Consideringitscomplexitytheperformanceissuccinct.NotethatasthitastotallybeDesignedbyOnePersonineveryavailabletimeihavetakenthePrecautionsnecessarytoensurethatsuchcircumstancedoesnotexist.thisprogrameffectivelycontainsallcodeRequiredtobuildacompleteapplication.thisapplicationcanbeexecutedfromanywhere.andifneededcanbeportedtoanypatform.itiseasytotest.simplecommandlinetotoolsareavailabletodebugging.itdoesnoDependentTime.ConsideringItsComplexityThePerformanceIs Succinct.NoteHowEverThatAsItHasTotallyBeenDesignedByOnePersonInEveryAvailableTimeIHavetakenthePrecautionstoEnsureThatSuchCircumstanceDoesNotExist.TheSoftwaredoesnotdependontime.Consideringitscomplexitytheperformanceissuccinct.NotethatasthitastotallybeenDesigndbyOnePersonineveryavailabletimeihaveTakentheprecautionsnecessarytosurethatsuchcircumstancesdoesnotexists.theprogrameffectivelycontainsofallcoderequiredtobuildacompletestheapplication.theprogramcanbeexecutedfromanynumberoffunctions.theapplicatioancanbeexecutedfromanywere.andifneededitcanbeporteditonanypatform.itiseasytotest.simplecommandlinetoitoolsareavailabltodebugging.itdoesshowsomeoutputwhenrunningbutthedurationshowshowlongitisrunningdependsonthecomplicationsofeachfunction.theapplicatioancanbeexecutedfromanynumberoffunctions.theapplicatioancanbeexecutedfromanywere.andifneededitcanbeporteditonanypatform.itiseasytotest.simplecommandlinetoitoolsareavailabltodebugging.itdoesshowsomeoutputwhenrunningbutthedurationshowshowlongitisrunningdependsonthecomplicationsofeachfunction.theapplicatioancanbeexecutedfromanynumberoffunctions.theapplicatioancanbeexecutedfromanywere.andif