I love open source and I love to share my knowledge as I come across issues that people might struggle with.
Apart from coding, I maintain a blog where you can find my articles on Medium.
Name: danielchu
Type: User
Bio: Passionate developer. Always keep learning and applying effectively.
Location: singapore
I love open source and I love to share my knowledge as I come across issues that people might struggle with.
Apart from coding, I maintain a blog where you can find my articles on Medium.
Template rendering, notifier, and supervisor for @HashiCorp Consul and Vault data.
Home repository for .NET Core
Script for downloading Coursera.org videos and naming them.
Novel Coronavirus (COVID-19) Cases, provided by JHU CSSE
Crash Course in Python
A cross-platform C and C++ unit testing framework for the 21st century
Gives criticality score for an open source project
CTF Field Guide
A TensorFlow implementation of CTPN model for text detection problem
cuddly-yaml : A housekeeping tool powered by GLib, offering threat safety and automatic garbage collection through reference counting. Define file retention periods conveniently using YAML configuration files.
Animated Curved Navigation Bar in Flutter
Powerful and efficient Computer Vision Annotation Tool (CVAT)
The Cyber Swiss Army Knife - a web app for encryption, encoding, compression and data analysis
Fast, easy and reliable testing for anything that runs in a browser.
This is an example app used to showcase Cypress.io testing.
🐅 Simple and complete custom Cypress commands and utilities that encourage good testing practices.
NTU CZ1007 Data Structures
In this lab, you are required to complete a virtual memory implementation, including how to get a physical frame for a virtual page from the IPT if it exists there, how to put a physical frame/virtual page entry into TLB, and how to implement a least recently used page replacement algorithm. A software-managed TLB is implemented in Nachos. There is one TLB per machine. There is also an IPT which maps physical frames to virtual pages. Basically, the translation process first examines the TLB to see if there is a match. If so, the matching entry in the TLB will be used for address translation. If there is a miss, the IPT will be looked up. If a matching entry is found in the IPT, the entry will be used to update the TLB. A miss in the IPT means that the page will have to be loaded from disk, and a page in and page out will be performed. To decide which page to page out, a page replacement policy is used, for example, a least recently used algorithm which will be explained late on. During each lookup process, you need to perform some checking in order to make sure that you are looking up the correct entry and that the entry is valid. In order to check whether you are referencing the correct entries from the TLB, you have to check the valid bit. The TLB will get updated when an exception is raised and the required page entry isn't in it. In this case, a new entry needs to be inserted into the TLB. The new entry will be inserted into an invalid entry in the TLB or replace an existing entry if it is full. Since the TLB is small, the replacement policy for the TLB is simply FIFO. When there is a context switch between processes, e.g. the main process executing a child process, the entries in the TLB will be cleared by setting all entries to invalid. The IPT is simply implemented using an array, represented by the memoryTable (a mapping of what pages are in memory and their properties). There is one entry for each of the physical frame, and each entry contains the corresponding process id, virtual page number, and the last used field that records the tick value when the page was last accessed. The least recently used algorithms works by iterating through the memoryTable, from the beginning, to look for the entry that has been least recently used. If there is an entry that is not valid (i.e., its process is dead), the algorithm will return the index of this invalid entry. Otherwise, the algorithm will return the index of the least recently used entry (that is, the entry with the smallest last used field).
NTU Computer Science - CZ2006 Software Engineering
Bring data to life with SVG, Canvas and HTML. :bar_chart::chart_with_upwards_trend::tada:
Data Science Using Python
Portfolio of data science projects completed by me for academic, self learning, and hobby purposes.
Reference from https://blog.logrocket.com/data-visualization-angular-d3/
Async database support for Python. 🗄
Tools and Docs on the Azure Data Science Virtual Machine (http://aka.ms/dsvm)
This repo test out docsify functionality
Keras code and weights files for popular deep learning models.
DeepPrivacy: A Generative Adversarial Network for Face Anonymization
A declarative, efficient, and flexible JavaScript library for building user interfaces.
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google ❤️ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.