Articles — Essay

This project focuses on a modification of a greedy transition based dependency parser. Typically a Part-Of-Speech (POS) tagger models a probability distribution over all the possible tags for each word in the given sentence and chooses one as its best guess. This is then pass on to the parser which uses this information to build a parse tree. The current state of the art for POS tagging is about 97% word accuracy, which seems high but results in a around 56% sentence accuracy. Small errors at the POS tagging phase can lead to large errors down the NLP pipeline and transition based parsers are particularity sensitive to these types of mistakes. A maximum entropy Markov model was trained as a POS multi-tagger passing more than its 1-best guess to the parser which was thought could make a better decision when committing to a parse for the sentence. This has been shown to give improved accuracy in other parsing approaches. We shown there is a correlation between tagging ambiguity and parsers accuracy and in fact the higher the average tags per word the higher the accuracy.

A proof of the value for Riemann's zeta function of two using integration of a summation, and product and series expansions of the sine function.

Binomial Pricing model, proposal for the final dissertation.

Through the modification of the kernel on a Ubuntu system, we managed to solve the n-Queens problem after changing the default time-slice, swappiness, latency and wakeup-granularity to different values and testing the problem.

Note on problem solving

An attempt of achieving a Kernel optimaization using Ubuntu 16..04.1 LTS, Phoronix Test Suite and different value changes and tests for an internal Kernel variable: the runtime value.

Student of Master of Science in Information Systems at Uganda Martyrs University

In this paper, we measure the memory performance throughout the Phoronix test "RAMspeed SMP". We decide to test this specific benchmark because we know how important is the memory for the system performance. This document shows how much the memory performance could change if we modify some variables in the linux kernel.

The Linux kernel controls the way tasks (or processes) are managed in the running system. The task scheduler, sometimes called process scheduler, is the part of the kernel that decides which task to run next. In this project its analyzed the behavior of scheduler by changing a default value from the runtime scheduling. The default value is 950000µs, or 0.95 seconds for the sched\_rt\_runtime\_us or scheduler realtime running variable. Meaning that 5% of the CPU time is reserved for processes that don't run under a real-time or deadline scheduling policy. This value in this file specifies how much of the "period" time can be used by all real-time and deadline scheduled processes on the system. The AIO-Stress which shows the obtained results in the different tests is an a-synchronous I/O benchmark created by SuSE which is is a German Linux distribution provider and business unit of Novell, Inc.