tuantm8

index=_internal sourcetype=scheduler search_type="scheduled" scheduled_time=* savedsearch_name=*rule scheduler rule earliest=-24h@h latest=@h

| eventstats count by savedsearch_name
| where count>=23

| eval H=strftime(scheduled_time, "%-H")
| eval M=strftime(scheduled_time, "%-M")

| chart limit=24 count over M by H
| table M 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

tuantm8

PostgreSQL is Enough

• Simplify: move code into database functions
• Just Use Postgres for Everything
• PostgreSQL is the worlds’ best database
• Postgres is eating the database world
• Hacker News discussion

Background and Cron Jobs

tuantm8

Rating System:

| 😡 - Awful | 😠 - Bad | 😐 - Fine | 😃 - Good | 😁 - Exceptional |

---------------------------------------------------------------------------------------------------------------

books listed in chronological order from last read to first read

• 😃 - Surveillance Valley - Yasha Levine
• 😃 - The Ransomware Hunting Team - Renee Dudley and Daniel Golden
• 😠 - CRACK99 - David Locke Hall
• 😃 - The Spy Who Couldn't Spell - Yudhijit Bhattacharjee
• 😐 - The Fifth Domain - Richard A. Clarke, Robert K. Knake
• 😁 - Fancy Bear Goes Phishing: The Dark History of the Information Age, in Five Extraordinary Hacks - Scott J. Shapiro

tuantm8

------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
# PS : ChatGPT makes mistakes, consider "trust but verify" principle
------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
#Events to Monitor
https://learn.microsoft.com/en-us/windows-server/identity/ad-ds/plan/appendix-l--events-to-monitor
------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
#run 
eventvwr.msc            Event viewer
------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Event Viewer(Local)-Windows Logs (shutdown / restart )

tuantm8

using System;
using System.Collections.Generic;
using System.Diagnostics.Eventing.Reader;
using System.Text.RegularExpressions;
using System.Threading;

namespace EventLogSearcher
{
    class Program
    {	

tuantm8

###############################################################################
# The MIT License
#
# Copyright 2012-2014 Jakub Jirutka <jakub@jirutka.cz>.
#
# 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

tuantm8

#!/usr/bin/env python
# Author: Michael Devens
#         Derek Ditch <github:@dcode>
# Github: https://github.com/co-devs
# Simple, poorly written script to download all of the files being shared
# by microsoft instead of downloading by hand. Downloads consecutively,
# will therefore take a while. Could be optimized, but meh.
# Also, download path is hardcoded. If you want to use it you will need
# to change the baseDir variable at a minimum

tuantm8

Security Onion
Aug 2014:

... my purpose for installing this was to:
    - learn more about security stuff
    - steal the packet captures (pcap) provided so I can replay them using tcpreplay for snort testing, 
       as it's not so sexy to just test using ICMP ping data or local rules that match anything

see:
http://blog.securityonion.net/

tuantm8

def ransom_note(magazine, ransom):
    if len(magazine) < len(ransom):
        return False
        
    dict_magazine = dict()
    dict_ransom = dict()
    
    for word in magazine:
        if word not in dict_magazine:
            dict_magazine[word] = 1

tuantm8

def getWays(n, c):
    # Complete this function
    m = len(c)
    
    # table will contains "cache"
    # table[i, j] ~  change number i by first j coins (coins array should be sorted firstly)
    table = [ [0 for j in range(m)] for i in range(n + 1) ]
    for i in range(n+1):
        for j in range(m):
            if i == 0: