Downloads

FAIR ROUND-ROBIN SCHEDULING

One of the critical requirements of a scheduler is to be fair. The original Linux scheduler is designed to share resources fairly between processes. However, more recently it has become clear that schedulers should be fair to users rather than just processes. more...

 

TODO PORTLET

The Todo portlet is a JSR-168 (Portlet API) portlet that can be deployed on every JSR-168 compliant portal server. The overall purpose of the Todo portlet is to allow users to manage todo items and to organize them in categories. more...

 

AROUND(J2)ME

Around(J2)ME is a location-based J2ME application that uses the phone's current location in order to provide all nearby places that are either belonging to a pre-defined category (e.g. banks, bars, pubs, restaurants, taxis, theaters, parking) or that match a certain search criteria (e.g. name, description, address). more...

 

JUMBO (JAVA UNSTRUCTURED MAIL-BASED OVERLAY)

The Jumbo (Java Unstructured Mail-Based Overlay) protocol has been implemented as a project for the Computer Networks course at the Free University of Bozen-Bolzano. This protocol is similar to the Gnutella 0.4 protocol and it uses SMTP and POP3 to define a P2P network for file sharing. more...

 

 

SPECTRAL CLUSTERING

Clustering is a popular data mining technique that is used to place data elements into related groups of “similar behaviour”. The traditional clustering algorithm is the so-called k-means algorithm. However, k-means has some well-known problems, i.e. it does not work well on clusters with not well-defined centers, it is difficult to choose the number k of clusters to construct upfront and different initial centers can lead to different final clusters. more...

 

RSSOWL SPM

RSSOwl is written in Java as an Eclipse RCP application. It is an RSS and Atom News reader / aggregator that is able to collect and display feeds from different compliant websites. more...

 

CONNECT4

This simple Java-project implements the popular Connect4 game. The source code contains an implementation of both, the Minimax algorithm and the more efficient Alpha-Beta pruning algorithm. Since it is infeasible to discover all terminal states (i.e. when the game is won, lost, drawn), both algorithms search upon a certain depth limit (cutoff) and make use of an evaluation function that measures the chance of winning from a certain position. more...

 

RMI CHAT

This Java-project realizes a chat system by using Java RMI (Remote Method Invocation). RMI allows the invocation of methods on remote objects that reside on different Java Virtual Machines (JVM). The project consists of a client and a server. The client invokes methods on the distributed server object whenever it enters the chat room or it sends a message. The server maintains a reference to all remote client objects to broadcast incoming messages. more...

 

ITERATIVE-DEEPENING SEARCH

This Java-project shows an implementation of an in-memory graph. This in-memory graph is stored by using the java.util.HashMap class that allows to map several keys to certain values. In this case the keys are vertices and their corresponding values are all their adjacent vertices. more...

 

COMPILER

This project implements a simple compiler for a C-like language that has been developed as a project for the Compiler course at the Free University of Bozen-Bolzano. In general, a compiler is made up of two parts: source program analyzer and target program synthesizer. more...

 

MYSHELL

This mini-shell has been developed as a project during the Operating Systems course at the Free University of Bozen-Bolzano. The shell supports the following functionalities: command invocation, input / output redirection, backgrounding, environment variables, change directory, piping. more...




StatCounter
About | Privacy Policy | Sitemap
© Matthias Braunhofer. All rights reserved