Pinned Repositories
angular-essential-training
basic-forum
We generate a forum system where a user can login, see a list of topics, see the messages under a topic, can add a message to any topic. A user should be able to delete one of their own messages and edit one of their own messages.
Check_Smart_Contract
fairdolce
Markovian-tweets
Consume a text file with sentences and produce a tweet (< 145 characters) with the style of the input text. I see several layers of success in this project and encourage you to shoot for the level that best matches your team's abilities: Level 1 does the base Markov Sentence Generation from the sample text. (Google around and you'll find lots of info on this part.) Layer 2 if you've got web skills on your team: Consume a Twitter username and create a sample of that person's tweets, then generate a tweet in their style. Layer 3: Create a bot which accepts username and tweets a message in that user's style.
Sparse-Matrix-vector-multiplication-on-GPU
Large sparse matrices multiplication often appear in scientific or engineering applications when solving partial differential equations. By this means, if we store and calculate every element of the matrix in computer it may waste much space. So we need find a way to calculate the sparse matrix more efficiently in order to make sparse matrix-vector multiplication at high speed. If we could find a way not only to store but also to calculate the large sparse-vector multiplication very efficiently it would benefit in engineering or scientific domain to save time.
Testing-strategies-and-plan-design
Testing strategies and plan design 1.Recommend testing strategies 2.Implement Test plan –- a detailed test plan that describes how all facets of testing will be performed for the implementation: i. cover all testing types in the document (unit, component, system, UAT/beta). ii. make a determination on which testing functions should be automated and recommend tools for this automation based on the development platform selected. iii. make a recommendation on regression testing and how it could be supported. 3.Resource requirements 4.Ongoing maintenance testing resource requirements and the process of testing in a live maintenance environment.
harderbetter's Repositories
harderbetter/Testing-strategies-and-plan-design
Testing strategies and plan design 1.Recommend testing strategies 2.Implement Test plan –- a detailed test plan that describes how all facets of testing will be performed for the implementation: i. cover all testing types in the document (unit, component, system, UAT/beta). ii. make a determination on which testing functions should be automated and recommend tools for this automation based on the development platform selected. iii. make a recommendation on regression testing and how it could be supported. 3.Resource requirements 4.Ongoing maintenance testing resource requirements and the process of testing in a live maintenance environment.
harderbetter/fairdolce
harderbetter/Markovian-tweets
Consume a text file with sentences and produce a tweet (< 145 characters) with the style of the input text. I see several layers of success in this project and encourage you to shoot for the level that best matches your team's abilities: Level 1 does the base Markov Sentence Generation from the sample text. (Google around and you'll find lots of info on this part.) Layer 2 if you've got web skills on your team: Consume a Twitter username and create a sample of that person's tweets, then generate a tweet in their style. Layer 3: Create a bot which accepts username and tweets a message in that user's style.
harderbetter/Sparse-Matrix-vector-multiplication-on-GPU
Large sparse matrices multiplication often appear in scientific or engineering applications when solving partial differential equations. By this means, if we store and calculate every element of the matrix in computer it may waste much space. So we need find a way to calculate the sparse matrix more efficiently in order to make sparse matrix-vector multiplication at high speed. If we could find a way not only to store but also to calculate the large sparse-vector multiplication very efficiently it would benefit in engineering or scientific domain to save time.
harderbetter/angular-essential-training
harderbetter/basic-forum
We generate a forum system where a user can login, see a list of topics, see the messages under a topic, can add a message to any topic. A user should be able to delete one of their own messages and edit one of their own messages.
harderbetter/Check_Smart_Contract
harderbetter/checkcontract
harderbetter/Coursera-Java-Programming-Specialization
harderbetter/data-science-question-answer
A repo for data science related questions and answers
harderbetter/domain_shift_model
harderbetter/easy_shopping_app_requirement_analysis
1:Purpose of the requirements document : This document details the functionalities required for the new App, Easy Shopping (ES). 2.Scope of the product: The primary audience are customers who expect shopping more convenient. And the developers of the app “Easy Shopping” are also the target of the document. This app is intended initially to change people’s traditional consumption patterns. People used to shop at some place considered to be time-saving and money-saving based on their own experience. But it’s always not right. By using “Easy shopping”, shopping efficiency would be greatly improved.
harderbetter/ffml_experiments
harderbetter/javaprogram
Here are some java program and Project I have designed.
harderbetter/machine-learning-interview
算法工程师-机器学习面试题总结
harderbetter/Machine-Learning-Interviews
This repo is meant to serve as a guide for Machine Learning/AI technical interviews.
harderbetter/MachineLearning_Python
机器学习算法python实现
harderbetter/New-York-stop-and-frisk-dataset-preprocessing
harderbetter/new_model_domain_shift
harderbetter/PDFM-experiments
harderbetter/pdfm_experiments
harderbetter/peer_to_peer_network
In peer-to-peer networks such as gnutella, each host must search out other hosts. When a host finds another host, these hosts become neighbors. Often a host will continue to search for peers until a sufficient number of hosts have been found. Let's assume that a host will continue to search for hosts until it has N neighbors. In this project, peer-to-peer neighborhoods are made and maintained. Each host maintains list of neighbors and sends hello packets to these neighbors every 10 seconds. If a host is on the neighbor list, and no hello packet is received from the host for 40 seconds, then this host is removed from the neighbor list. If a node does not have enough neighbors, then it selects an address (e.g., IP and port) at random and tries to become its neighbor.
harderbetter/reproduce
harderbetter/reproduce_results
harderbetter/stackflow_style_database_design_and_optimization
Design a database for stackoverflow.com, a large question-and-answer website for programming. Real data from the site will be provided to populate the database. Optimization method also used in this database.
harderbetter/TensorFlowProject
harderbetter/Text-twist-clone
a basic stack word game.
harderbetter/Transformer-Neural-Network
Code Transformer neural network components piece by piece
harderbetter/Transformers-for-NLP-2nd-Edition
Transformer models from BERT to GPT-4, environments from Hugging Face to OpenAI. Fine-tuning, training, and prompt engineering examples. A bonus section with ChatGPT, GPT-3.5-turbo, GPT-4, and DALL-E including jump starting GPT-4, speech-to-text, text-to-speech, text to image generation with DALL-E, Google Cloud AI,HuggingGPT, and more
harderbetter/travelplanner_Aalgorithm_implement
Lisp language has been used in this program which means that this programs needs much recursion method thinking that is a reverse direction of the loop. The scenario is simple: When given a starting city (S) and a destination city (G) and the travel agent must find a means of getting from S to G. At various cities, the travel agent has one or more options for travel: fly, take-train, or take-bus. Time is valuable, and thus a direct flight would be better than a direct train for long distances, and a direct train would be better than taking a bus except for very short distances. Considering the cities and the transportation method, by using the A* algorithm, the travel plan agent needs to find the most convenient one. This project gave me a new understanding about the programing because of the recursion which needs contrarain and abstraction thinking.