Don't wanna be here? Send us removal request.
Text
CS-350 EVAL: Analyzing Traffic Distributions & Queue Behavior (Copy)
In this EVAL assignment we will understand how seemingly insignificant changes in the input traffic distri-bution can lead to measurable differences in the behavior of queues and thus in the perceived service. IMPORTANT: For this EVAL, make sure you download the latest version of the client binary! To confirm that this is the correct version, the client must print a line at startup that states:…
0 notes
Text
Project 2: Branch Prediction (Version 1.0) Solution
In this project, you will construct a branch predictor simulator and use it to evaluate different configurations of branch predictors. 3. Simulator Specification 3.1. ECE 463 and ECE 563 students: Branch predictors Model a gshare branch predictor with parameters {m, n}, where: m is the number of low-order PC bits used to form the prediction table index. Note: discard the lowest two bits of the…
0 notes
Text
CS 446 Homework 2
Soft-margin SVM: 4pts In the lecture, we learned about the duality of hard-margin SVM. Given data examples ((xi, yi))Ni=1, the primal form of hard-margin SVM is min 1 w 2 , s.t. y (wT x ) 1 for all i. arg 2∥ ∥2 ≥ w i i Its dual form is N 1 N N xT x N max α α α y y , α for all i, α y . i − 2 j( s.t. i ≥ 0 α ≥ 0 i j i i j) i i = 0 i=1 i=1…
0 notes
Text
Project Three Solution
Objectives: To develop a two-tier Java based client-server application interacting with a MySQL database utilizing JDBC for the connectivity. This project is designed to give you some experience using the various features of JDBC and its interaction with a MySQL DB Server environment. Description: In this assignment you will develop a Java-based GUI front-end (client-side) application that will…
0 notes
Text
MP 6 A Unification-based Type Inferencer Solution
Change Log 1.0 Initial Release. Objectives Your objectives are: Understand the details of the basic algorithm for first order unification. Understand the type-inference algorithm. Background One of the major objectives of this course is to provide you with the skills necessary to implement a language. There are three major components to a language implementation: the parser, the internal…
0 notes
Text
MP5 Scheme Solution
The objective for this MP is to build an interpreter for a minimalist dialect of Lisp called Scheme. You will learn to build a fully monadic evaluator, and a read-evaluate-print-loop (REPL) to accept input from user. This language will have the normal things you would expect in a Lisp-like language, such as functions, numbers, symbols, and lists. You will also write a macro system and explore how…
0 notes
Text
MP2 Interpreter Solution
The objective for this MP is to write an interpreter for a language with both expressions and statements. In particular, your job is to implement the E (evaluate) part of the read-eval-print loop (REPL.) Goals Become familiar with environments and closures More practice with ADTs, pattern matching, recursion, and other functional programming concepts Learn how to use Hash Maps in…
0 notes
Text
MP1 Basic Haskell Solution
We will be using Haskell throughout the course to implement other programming languages. That being said, the focus of this course is *not* on Haskell, but rather on studying programming languages in general. You need to understand basic Haskell before we can proceed with the rest of the course though; this MP will test that understanding. Goals —– – Part 1: – Write recursive functions and…
0 notes
Text
MiniProject 2: Classification of Image Data with Multilayer Perceptrons and Convolutional Neural Networks
Background In this miniproject, you will implement a multilayer perceptron from scratch, and use it to classify image data. One of the goals is to implement a basic neural network and its training algorithm from scratch and get hands-on experience with important decisions that you have to make while training these models. You will also have a chance to experiment with convolutional neural…
0 notes
Text
Exercise - Week 4: Bayes classi cation (female-male dataset)
Be prepared for the exercise sessions (watch the demo lecture). You may ask TAs to help if you cannot make your program to work, but don’t expect them to show you how to start from the scratch. Male and female { Bayesian classi er (40 points) Download the male and female height and weight measurements: male female X train.txt male female X test.txt male female y train.txt male female y…
0 notes
Text
Web Pro Summer Homework 1 ..Program 1 Javascript
This assignment mainly tests your JavaScript skill. You will create two HTML web pages, a CSS file and a JavaScript file. Part A) Create a web page that uses JavaScript to print the time of the visit to the page. Instead of using the default conversion of a Date object to a string, use the getHours getMinutes methods of the Date class to produce something like this: The time is 19 minutes after…
0 notes
Text
Implement value iteration
In this exercise you will implement the value iteration algorithm for Markov Decision Processes. The value iteration algorithm is applied to a 2D grid decision process, where different locations on a can contain different rewards. The purpose is to compute the value of each location, and the corresponding policy. Instructions ^^^^^^^^^^^^ 1. To prepare for the exercise, make sure you have…
0 notes
Text
Lab 5 – SQL 1 - Solved
In this lab you will learn the following: Write basic retrieval queries using SQL The “Company” Database Consider the “Company” database which includes the tables below. This database records employees of a company with their departments: Table Employee with the following columns: Empno : Employee number on three digits. This column is the primary key of the table Employee. Ename: The…
0 notes
Text
Problem Set 9: Schedule Optimization
Introduction At an institute of higher education that shall be nameless, it used to be the case that a human advisor would help each student formulate a list of subjects that would meet the student’s objectives. However, because of financial troubles, the Institute has decided to replace human advisors with software. Given the amount of work a student wants to do, the program returns a list of…
0 notes
Text
EE 477 Homework 1 Solved
MATLAB: In this part, you will modulate the given bit stream, s, with the following modulation schemes. s = f1; 0; 1; 1; 1; 1; 0; 0g, BPSK, QPSK, 4-PAM, 16-QAM, Binary FSK. For each modulation scheme, give the following: The constellation diagram of the modulation scheme, Sinusoidal waveforms to represent the symbols in the constellation diagram (one waveform per symbol), The modulated…
0 notes
Text
CS 201 Homework Assignment 2
In this homework, you will merge two sorted integer arrays. That is, given two sorted integer arrays arr1 and arr2 of size N, the problem is to create and return a third sorted array arr3 with the items of arr1 and arr2. It will have size 2N. Assume that sorting is done in ascending order of the integer items. Two alternative algorithms that solve this problem are given below in lay terms. Each…
0 notes
Text
ECE 4122/6122 Lab 4: CUDA-based 2D Random Walk Simulation
Objective: Implement a CUDA program to simulate a 2D random walk. A random walk is a mathematical process that describes a path consisting of a sequence of random steps. In this assignment, you will simulate a large number of walkers taking steps either north, south, east, or west on a grid, and calculate the average distance they travel from the origin. Description: Create a C++ application…
0 notes