I hereby claim:
- I am mayormaier on github.
- I am mayormaier (https://keybase.io/mayormaier) on keybase.
- I have a public key ASDjgdtsB6_4LFTVMo9P-1ykKzmuwotP9-mujCzuFrc65Qo
To claim this, I am signing this object:
# Get the data and factor it as needed | |
data = data.frame() | |
# Create contingency tables | |
data.table = xtabs(~A + B + C, data=data) | |
# Create models | |
library(MASS) | |
model.0 = loglm(~A + B + C + A:B + A:C + B:C + A:B:C, data = table.phishingABC, fit=TRUE) | |
model.1 = loglm(~A + B + C + A:B + A:C + B:C, data = table.phishingABC, fit=TRUE) |
{ | |
"Version": "2012-10-17", | |
"Statement": [ | |
{ | |
"Sid": "VisualEditor0", | |
"Effect": "Allow", | |
"Action": "s3:ListBucket", | |
"Resource": "arn:aws:s3:::nessus-agents" | |
}, | |
{ |
aws s3 cp . s3://bucket-name --recursive --exclude "exclude-path" |
server { | |
listen 80 default_server; | |
root /var/www/wisdompetmed.local; | |
server_name wisdompetmed.local www.wisdompetmed.local; | |
index index.html index.htm index.php; | |
access_log /var/log/nginx/wisdompetmed.local.access.log; |
# If a and b are positive integers, then there are always integers m and n so that the GCD of a and b equals m·a+n·b. | |
# i.e., Since the GCD of 210 and 45 is 15, we should be able to write 15 as a sum of multiples of 210 and 45. | |
# Finding multiplicative inverses mod p | |
a = 3276 | |
b = 29 | |
print("Finding Multiplicative Inverse of", a, "and", b) | |
if a < b: | |
temp = a |
I hereby claim:
To claim this, I am signing this object: