rush hour

Thesis/bibliography.bib

@@ -277,7 +277,6 @@
     howpublished={\url{http://www.team-cymru.org/IP-ASN-mapping.html}}
 }
 
-
 @inproceedings{porras2009foray,
   title={A Foray into Conficker's Logic and Rendezvous Points.},
   author={Porras, Phillip A and Sa{\"\i}di, Hassen and Yegneswaran, Vinod},
@@ -285,6 +284,71 @@
   year={2009}
 }
 
+@misc{TrendMicroOnline,
+    author={TREND MICRO},
+    title={{A Look at Locky Ransomware’s Recent Spam Activities}},
+    month=jan,
+    year={2018},
+    howpublished={\url{https://blog.trendmicro.com/trendlabs-security-intelligence/look-locky-ransomwares-recent-spam-activities/}}
+}
+
+@misc{MariaDBOnline,
+    author={The MariaDB Foundation},
+    title={{MariaDB}},
+    month=jan,
+    year={2018},
+    howpublished={\url{https://mariadb.org/}}
+}
+
+@misc{MongoDBOnline,
+    author={MongoDB, Inc},
+    title={{MongoDB}},
+    month=jan,
+    year={2018},
+    howpublished={\url{https://www.mongodb.com}}
+}
+
+@misc{RedisOnline,
+    author={redislabs},
+    title={{Redis}},
+    month=jan,
+    year={2018},
+    howpublished={\url{https://redis.io/}}
+}
+
+@misc{SciKitOnline,
+    author={scikit-learn},
+    title={{scikit-learn - Decision Trees}},
+    month=jan,
+    year={2018},
+    howpublished={\url{http://scikit-learn.org/stable/modules/tree.html#tree-algorithms-id3-c4-5-c5-0-and-cart}}
+}
+
+@misc{SciKitProbOnline,
+    author={scikit-learn},
+    title={{scikit-learn - Classification}},
+    month=jan,
+    year={2018},
+    howpublished={\url{http://scikit-learn.org/stable/modules/tree.html#classification}}
+}
+
+@misc{DENICOnline,
+    author={DENIC e.G.},
+    title={{DENIC}},
+    month=jan,
+    year={2018},
+    howpublished={\url{https://www.denic.de/}}
+}
+
+@misc{IANADNSClassesOnline,
+    author={IANA},
+    title={{Domain Name System (DNS) Parameters}},
+    month=jan,
+    year={2018},
+    howpublished={\url{https://www.iana.org/assignments/dns-parameters/dns-parameters.xhtml}}
+}
+
+
 @inproceedings{Stone-Gross:2009:YBM:1653662.1653738,
  author = {Stone-Gross, Brett and Cova, Marco and Cavallaro, Lorenzo and Gilbert, Bob and Szydlowski, Martin and Kemmerer, Richard and Kruegel, Christopher and Vigna, Giovanni},
  title = {Your Botnet is My Botnet: Analysis of a Botnet Takeover},
@@ -349,4 +413,81 @@ isbn="978-3-540-24668-8"
  acmid = {1643047},
  publisher = {Morgan Kaufmann Publishers Inc.},
  address = {San Francisco, CA, USA},
+}
+
+@Article{Lim2000,
+author="Lim, Tjen-Sien
+and Loh, Wei-Yin
+and Shih, Yu-Shan",
+title="A Comparison of Prediction Accuracy, Complexity, and Training Time of Thirty-Three Old and New Classification Algorithms",
+journal="Machine Learning",
+year="2000",
+month="Sep",
+day="01",
+volume="40",
+number="3",
+pages="203--228",
+abstract="Twenty-two decision tree, nine statistical, and two neural network algorithms are compared on thirty-two datasets in terms of classification accuracy, training time, and (in the case of trees) number of leaves. Classification accuracy is measured by mean error rate and mean rank of error rate. Both criteria place a statistical, spline-based, algorithm called POLYCLSSS at the top, although it is not statistically significantly different from twenty other algorithms. Another statistical algorithm, logistic regression, is second with respect to the two accuracy criteria. The most accurate decision tree algorithm is QUEST with linear splits, which ranks fourth and fifth, respectively. Although spline-based statistical algorithms tend to have good accuracy, they also require relatively long training times. POLYCLASS, for example, is third last in terms of median training time. It often requires hours of training compared to seconds for other algorithms. The QUEST and logistic regression algorithms are substantially faster. Among decision tree algorithms with univariate splits, C4.5, IND-CART, and QUEST have the best combinations of error rate and speed. But C4.5 tends to produce trees with twice as many leaves as those from IND-CART and QUEST.",
+issn="1573-0565",
+doi="10.1023/A:1007608224229",
+url="https://doi.org/10.1023/A:1007608224229"
+}
+
+@book{kernighan2006c,
+  title={The C programming language},
+  author={Kernighan, Brian W and Ritchie, Dennis M},
+  year={2006}
+}
+
+@inproceedings{Jung:2004:ESS:1028788.1028838,
+ author = {Jung, Jaeyeon and Sit, Emil},
+ title = {An Empirical Study of Spam Traffic and the Use of DNS Black Lists},
+ booktitle = {Proceedings of the 4th ACM SIGCOMM Conference on Internet Measurement},
+ series = {IMC '04},
+ year = {2004},
+ isbn = {1-58113-821-0},
+ location = {Taormina, Sicily, Italy},
+ pages = {370--375},
+ numpages = {6},
+ url = {http://doi.acm.org/10.1145/1028788.1028838},
+ doi = {10.1145/1028788.1028838},
+ acmid = {1028838},
+ publisher = {ACM},
+ address = {New York, NY, USA},
+ keywords = {DNS black lists, Zipf-like distribution, spam traffic},
+}
+
+@inproceedings{ramachandran2006can,
+  title={Can DNS-based blacklists keep up with bots?},
+  author={Ramachandran, Anirudh and Dagon, David and Feamster, Nick},
+  booktitle={CEAS},
+  year={2006},
+  organization={Citeseer}
+}
+
+@inproceedings{nazario2008net,
+  title={As the net churns: Fast-flux botnet observations},
+  author={Nazario, Jose and Holz, Thorsten},
+  booktitle={Malicious and Unwanted Software, 2008. MALWARE 2008. 3rd International Conference on},
+  pages={24--31},
+  year={2008},
+  organization={IEEE}
+}
+
+@inproceedings{Deri:2012:TPD:2245276.2245396,
+ author = {Deri, Luca and Trombacchi, Lorenzo Luconi and Martinelli, Maurizio and Vannozzi, Daniele},
+ title = {Towards a Passive DNS Monitoring System},
+ booktitle = {Proceedings of the 27th Annual ACM Symposium on Applied Computing},
+ series = {SAC '12},
+ year = {2012},
+ isbn = {978-1-4503-0857-1},
+ location = {Trento, Italy},
+ pages = {629--630},
+ numpages = {2},
+ url = {http://doi.acm.org/10.1145/2245276.2245396},
+ doi = {10.1145/2245276.2245396},
+ acmid = {2245396},
+ publisher = {ACM},
+ address = {New York, NY, USA},
+ keywords = {domain name system, traffic measurement},
 }