| // SSimSuperRes by Shiandow | |
| // | |
| // This library is free software; you can redistribute it and/or | |
| // modify it under the terms of the GNU Lesser General Public | |
| // License as published by the Free Software Foundation; either | |
| // version 3.0 of the License, or (at your option) any later version. | |
| // | |
| // This library is distributed in the hope that it will be useful, | |
| // but WITHOUT ANY WARRANTY; without even the implied warranty of | |
| // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| // This library is free software; you can redistribute it and/or | |
| // modify it under the terms of the GNU Lesser General Public | |
| // License as published by the Free Software Foundation; either | |
| // version 3.0 of the License, or (at your option) any later version. | |
| // | |
| // This library is distributed in the hope that it will be useful, | |
| // but WITHOUT ANY WARRANTY; without even the implied warranty of | |
| // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
| // Lesser General Public License for more details. | |
| // |
| THE ISA AND PC/104 BUS | |
| IBM, IBM/XT, IBM PC, and IBM PC AT are registered trademarks of | |
| International Business Machines Corporation. | |
| This file is designed to give a basic overview of the bus found in | |
| most IBM clone computers, often referred to as the XT or AT bus. The | |
| AT version of the bus is upwardly compatible, which means that cards |
| States must be sent as their full capitalized name or in their 2-letter abbreviation, | |
| those from the following list are valid: | |
| 'AL' => 'Alabama', | |
| 'AK' => 'Alaska', | |
| 'AZ' => 'Arizona', | |
| 'AR' => 'Arkansas', | |
| 'CA' => 'California', | |
| 'CO' => 'Colorado', | |
| 'CT' => 'Connecticut', | |
| 'DE' => 'Delaware', |
| #include <stdio.h> | |
| #include <stdlib.h> | |
| #include <string.h> | |
| #include <ctype.h> | |
| #include <openssl/sha.h> | |
| #define TARGET_PREFIX "20250327" | |
| #define MAX_WORDS 256 | |
| #define MAX_TEXT 2048 | |
| #define MAX_ATTEMPTS (1ULL << 32) // 2^32 attempts (~4.3B, enough for 8-char prefix) |
| // ==UserScript== | |
| // @name Activate all Itch.io Bundle downloads | |
| // @version 1 | |
| // @include https://itch.io/bundle/download/* | |
| // @include https://*.itch.io/* | |
| // @require https://ajax.googleapis.com/ajax/libs/jquery/3.4.1/jquery.min.js | |
| // @grant none | |
| // ==/UserScript== | |
| $(document).ready(function() { |
| // TypeScript can be used just like a proof assistant (for intuitionistic propositional logic)! | |
| // | |
| // Inspired by: https://www.youtube.com/watch?v=i-hRpYiNwBw | |
| // We can encode False as the following recursive type, which can never | |
| // be constructed (e.g. you would need { false: { false: { false: ... }}}). | |
| type False = { false: False }; | |
| // True can be encoded as the inhabited singleton type "I", which | |
| // has as its only inhabitant the string "I". |
Created by @rUv
This tutorial demonstrates how to create a Python Flask implementation with React Flow to build complex AI workflows, reasoning systems, and comprehension modeling tools.
React Flow is a powerful open-source library for building interactive node-based interfaces in React applications. Its flexibility and extensibility make it an excellent choice for creating sophisticated AI applications.
| import pandas as pd | |
| from sklearn.feature_selection import mutual_info_regression | |
| from talib import WMA | |
| from dcor import distance_correlation as dcor | |
| from joblib import Parallel, delayed, Memory, cpu_count | |
| from numpy_ext import rolling_apply | |
| import numpy as np | |
| from fml.utils import get_name |
