In this paper we implement a collaborative filtering algorithm on the MovieLens dataset to predict movie ratings for the users. The original matrix, which contains the movie ratings on a 1-5 scale for the users, has many missing entries. Rank-K factorization is used to construct the filtering algorithm and alternating least squares is then performed on the two lower rank matrices in order to fi...

Bortezomib is a highly selective inhibitor of the 26S proteasome and has been approved for clinical use in the treatment of relapsing and refractory multiple myeloma and mantle cell lymphoma. Clinical trials are also underway to assess the role of bortezomib in several other human malignancies, including leukemia. However, the mechanism(s) by which bortezomib acts remain to be fully understood....

High grain production of corn (Zea mays L.) can be maintained by adding inorganic N fertilizer, and also by using crop rotations that include alfalfa (Medicago sativa L.), but the relative impact of these management practices on soil quality is uncertain. We examined the effects on soil of N fertilization rate (0, 90, 180, 270 kg ha, corn phase only) in four cropping systems: CC, continuous cor...

In this paper we train an L1-regularized linear support vector machine (SVM) to determine whether the sentiment of a movie review is positive or negative. We train and test on the movie review polarity dataset introduced by Pang and Lee, 2004 [2]. Classification accuracy of the linear SVM is improved through a series of experiments for various data preprocessing techniques and data transformati...

Family Planning Perspectives year, while induced and spontaneous abortions among teenagers cost more than $180 million.* Additional resources are required to treat sexually transmitted diseases (STDs), acquired by about three million teenagers annually,5 and for programs such as the Special Supplemental Program for Women, Infants and Children. Most sexually active female adolescents are trying ...

Since the supremum is taken over a bigger set as B increases, C(B) is nondecreasing for B ≥ 0. To prove the concavity, let B1 and B2 be two cost constraints. Suppose that R1 is achievable under B1 and R2 is achievable under B2 i.e. R1 ≤ C(B1) and R2 ≤ C(B2). Let k = ⌊αn⌋, k ′ = n − k and α ∈ [0, 1]. We can construct a code by using a (21 , k) code for the first k transmissions and a (2 ′R2 , k)...

My implementation of the discrete difference approximation, as defined by Equation 1, was completed using Matlab and is included as prob1.m. Note that prob1.m accepts a single input argument kMode which is used to toggle λ = 1/2 or λ = h. Before presenting the results of my program, I will briefly outline the architecture of the source code. On lines 21-55 I select the values of {N, h, k} and d...

Notes taken in Professor Boneh’s Introduction to Cryptography course (CS 255) in Winter, 2012. There may be errors! Be warned!