harderbetter Goto Github PK

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

checkcontract

command-line-minesweeper

Enter two digits which are width and height number_of_mines then generates a Minesweeper board internally. The board is a rectangle with a cover over each square. It will display this board to the user and prompt for a coordinate where they predict that no mine exists (format: x-coord y-coord 0-indexed). If they struck a mine then they lose (let them know). Otherwise uncover the selected square. If there are no adjacent mines then it should be blank and you uncover all adjacent squares too (chain-react this for every blank square). Otherwise show the number of mines in the surrounding 8 squares. If at somepoint only mines are covered then the user wins and the game ends.

coursera-java-programming-specialization

data-science-question-answer

A repo for data science related questions and answers

domain_shift_model

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.

fairdolce

ffml_experiments

gee-mail

Here is a secure asynchronous (same-machine) message platform. Here is what is must do: When loaded prompt the user to sign-in or register. When a user registers get their username and password. When a user logs in ask for username and validate password. If login fails, choose your response. Once logged in, tell them the number of messages they have, list the users that have sent them a message. (You can limit this to one message from a given sender or add a timestamp or even a title to messages if you want a level 2.) Then ask if they want to read messages or write messages. When writing messages prompt them for the receipient username, the message, and a shared passphrase with that receipient. When they read a message let them select the message somehow, then prompt them for the shared passphrase with that receipient, then show a plaintext message. IMPORTANT: do not ever store passwords, messages, or passphrases in plaintext, this is an encrypted messaging system. The rule sets in play for this stage are FIO and ERR.

javaprogram

Here are some java program and Project I have designed.

machine-learning-interview

算法工程师-机器学习面试题总结

machinelearning_python

机器学习算法python实现

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.

new-york-stop-and-frisk-dataset-preprocessing

new_model_domain_shift

pdfm-experiments

pdfm_experiments

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.

prolog_small_program

Here is the small program I design use prolog language. Here are the tasks that I accomplished: 1.Translate System Requirements, Domain Properties, and Assumptions toa Prolog Database to be used for consistency checking from the given logical non-Prolog statements. 2.Set the appropriate software state to be true and verify that the resulting system state is a requirement statement that is true. 3.Set the appropriate system state to be true and verifying that the resulting software state is a requirement statement that is true.

reproduce

reproduce_results

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.

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.

tensorflowproject

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.

text-twist-clone

a basic stack word game.

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.