New Code
Rentonn - Airbnb clone 1.0
VisualNEO for Windows
SentiVeillance SDK Trial 7.0.191272
dbForge SQL Complete 6.1
Uber for E-Scooters 1.0
ODBC Driver for MySQL 2.4
dbForge Schema Compare for MySQL 4.4
dbForge Studio for MySQL 8.1
dbForge Query Builder for MySQL 4.4
dbForge Data Compare for MySQL 5.5
Aqua Data Studio 19.5
ConyEdit for Windows 1.1.1
Database Workbench Pro 5.6.0
.Net VCL for Delphi
Top Code
Paste phpSoftPro 1.4.1
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Availability Booking Calendar PHP 1.0
PHP GZ Blog Script 1.1
ATN Jobs Software 4.0
ATN Mall 2.0
WeBuilder 2015 13.3
Code Listing by Guangdi Li

Code 1-6 of 6   

As a famous sub-structure of Bayesian network, causal polytree is able to recover the causality very efficiently.

Here, I implement pearl's classical algorithm here for easy using. Details can be seen in Pearl's paper[1].

To recover general Causal polytree, one can download "Fisher's exact test" in my space for conditional independence test.

One can start from ControlCenter.m, I add a simple...

The probabilistic logic sampling algorithm is described in (Henrion 1988). Here is the website:

About the theory under PLS, please refer...

Our basic idea is based on (n,k)-gray code which was introduced in one paper named :"Generalized Gray Codes with Applications".

Our extention is allowing each digit ranged from different digit which is widely useful in some...

A simple, fast and short code for beginners, who cares about Fisher's Exact Test, .
As a beginner, at least you need to know what we do with Fisher's Exact Test (see [1][2]). My function is simple,

Pvalue =...

The definition of mutual information could resort to wiki:

For marginal mutual information, we say it is :
I(A,B)=sum sum P(A,B) log[P(A,B)/P(A)P(B)]

For conditional...

We use the idea of Chu-Liu/Edmonds Algorithm, see paper [1,2], to implement four functions here.
1. Maximal Directed Maximum Spanning Tree
By DirectedMaximumSpanningTree.m
2. Minimal Directed Maximum Spanning Tree