Pedro Jaime González pdrjmg
pdrjmg
/ Dashboard.java
Created
February 11, 2018 12:24
Product Management System (Web Application with Glassfish)
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| package productManagement.user; | |
| import com.vaadin.cdi.CDIViewProvider; | |
| import com.vaadin.navigator.Navigator; | |
| import com.vaadin.ui.Alignment; | |
| import com.vaadin.ui.Component; | |
| import com.vaadin.ui.CssLayout; | |
| import com.vaadin.ui.HorizontalLayout; | |
| import com.vaadin.ui.Label; | |
| import com.vaadin.ui.Layout; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #Pedro Jaime González | |
| #Matrikelnummer 81726 | |
| #Modern E-Shops | |
| #Implementieren Sie in R eine Methode rank(products, method, var), die ein Dataframe von | |
| #Produkten übergeben bekommt und diese mit einer bestimmten Methode (method) sortiert. Als | |
| #Methoden sollen möglich sein: | |
| #*ascending: Die Produkte werden aufsteigend nach ihrer Ausprägung des Attributes var sortiert und zurückgegeben | |
| #*descending: Die Produkte werden absteigend nach ihrer Ausprägung des Attributes var sortiert und zurückgegeben |
pdrjmg
/ Exercise 3.R
Created
January 4, 2018 15:40
Euclidean distance, Pearson correlation and Collaborative filtering in R
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #Pedro Jaime González | |
| #Matrikelnummer 81726 | |
| #Modern E-Shops | |
| #a) Function to calculate the Euclidean distance | |
| #b) Function to calculate the Pearson correlation | |
| #c) Function that uses "Collaborative Filtering" to determine new rating | |
| example = matrix(c( | |
| 5, 25, 18, 20, 5, 80, |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| <link href="https://fonts.googleapis.com/css?family=Lobster" rel="stylesheet" type="text/css"> | |
| <link href="https://fonts.googleapis.com/css?family=Raleway" rel="stylesheet"> | |
| <!-- here starts the page --> | |
| <!-- Title --> | |
| <body> | |
| <div class = "container-fluid"> | |
| <div class = "jumbotron"> | |
| <h1 id="title" class="gray-text text-center">John C. Mayer</h1> | |
| <div class="row"> | |
| <div class="col-lg-12 col-md-12 col-xs-12"> |
pdrjmg
/ IncorrectNumberOfColumnsException.java
Created
November 26, 2017 15:54
Online analytical processing in Java
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /** | |
| * Class created for the custom IncorrectNumberOfColumnsException exception | |
| * @author Pedro Jaime González | |
| */ | |
| public class IncorrectNumberOfColumnsException extends Exception { | |
| private static final long serialVersionUID = 1; | |
| String message; | |
| /** |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import java.util.Scanner; | |
| /** | |
| * <h1>Hangman</h1> | |
| * <p> | |
| * The Hangman program implements an application that lets you play the classic hangman game. | |
| * The user types a word at the beginning of the program and then must try to guess either | |
| * letters of said word or the complete word itself. Every time the user guesses a correct letter, | |
| * the letter inside the word is printed. |