dipu-bd

{
  "$schema": "http://json-schema.org/schema",

  "title": "JSON schema for a turing complete machine",
  "type": "object",

  "definitions": {
    "statement": {
      "description": "",
      "type": "object",

dipu-bd

class URL {
  final String original;
  String _fragment = '';
  String _query = '';
  String _scheme = '';
  String _user = '';
  String _password = '';
  String _host = '';
  String _port = '';
  String _path = '';

dipu-bd

import os
import time

PUBLIC_DATA = '/etc/lncrawl/public-data'

novels = []
for user in os.listdir(PUBLIC_DATA):
    user_dir = os.path.join(PUBLIC_DATA, user)
    if not os.path.isdir(user_dir):
        continue

dipu-bd

# vim:ft=zsh ts=2 sw=2 sts=2
#
# agnoster's Theme - https://gist.github.com/3712874
# A Powerline-inspired theme for ZSH
#
# # README
#
# In order for this theme to render correctly, you will need a
# [Powerline-patched font](https://github.com/Lokaltog/powerline-fonts).
# Make sure you have a recent version: the code points that Powerline

Roger8

github

1. Implementation of "Learn Convolutional Neural Network for Face Anti-Spoofing" paper github
2. Code for 2nd Place Solution in Face Anti-spoofing Attack Detection Challenge @ CVPR2019, https://github.com/SeuTao/CVPR19-Face-Anti-spoofing
3. Face Anti-spoofing demo to detect replay, video and mask attack, https://github.com/lbf4616/Face-Anti-spoofing
4. This is a C++ code for face anti-spoofing methods based on color texture features. https://github.com/wuyongchn/Face-Spoofing-Detection-or-Face-Liveness-Detection
5. Single Shot Face Anti-spoofing. https://github.com/JinghuiZhou/awesome_face_antispoofing
6. Face Anti-Spoofing 集合, https://github.com/ChanChiChoi/awesome-Face_Recognition#face-anti-spoofing

research

1.Research：Deep Tree Learning for Zero-shot Face Anti-Spoofing ,Face De-Spoofing: Anti-Spoofing via Noise Modeling ,Learning Deep Models for Face Anti-Spoofing: Binary or Auxiliary Supervision ,http://w

dipu-bd

/*
 * Copyright (C) 2018 Sudipto Chandra
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of

ha1f

//
//  Created by はるふ on 2017/12/11.
//  Copyright © 2017年 ha1f. All rights reserved.
//

import Foundation
import CoreImage
import AVFoundation

extension CIFilter {

dipu-bd

/*====================================================================
 Title: Computes Longest Repeated Substring from a given string
 Complexity: O(n.log(n))
 Author : Sudipto Chandra (Dipu)
 =====================================================================*/
#include <bits/stdc++.h>
using namespace std;
#define mem(a,b) memset(a, b, sizeof(a))
#define loop(i, x) for(__typeof((x).begin()) i=(x).begin(); i!=(x).end(); ++i)
#define rloop(i, x) for(__typeof((x).rbegin()) i=(x).rbegin(); i!=(x).rend(); ++i)

dipu-bd

/*====================================================================
 Title: Compute LCP from Suffix Array using Radix Sort
 Suffix Array: O(n.log(n))
 Compute LCP: O(n)
 Author : Sudipto Chandra (Dipu)
 =====================================================================*/
#include <bits/stdc++.h>
using namespace std;
#define mem(a,b) memset(a, b, sizeof(a))
#define loop(i, x) for(__typeof((x).begin()) i=(x).begin(); i!=(x).end(); ++i)

dipu-bd

/*==================================
 Title: Suffix Array using Radix Sort
 Complexity: O(n.log(n))
 Author : Sudipto Chandra (Dipu)
 ===================================*/
#include <bits/stdc++.h>
using namespace std;
#define mem(a,b) memset(a, b, sizeof(a))
#define loop(i, x) for(__typeof((x).begin()) i=(x).begin(); i!=(x).end(); ++i)
#define rloop(i, x) for(__typeof((x).rbegin()) i=(x).rbegin(); i!=(x).rend(); ++i)