User:Gatoatigrado

From Wikipedia, the free encyclopedia

The correct title of this article is User:gatoatigrado. The initial letter is shown capitalized due to technical restrictions.

Annoying Userboxes

C#	This user can program in C#.

Java

This user can program in Java.

php

This user can program in PHP.

.css

This user can write Cascading Style Sheets.

<html>

This user can write HTML.

js	This user can program in JavaScript.

sql

This user uses SQL queries to locate car keys.

prog-x

This user is merely a humble programmer.

pno-1

This user is a novice pianist.

@	This user can be reached by email at gatoatigrado@myrealbox.com.

This user has a website, which can be found here.

Wiki	This user has a wiki.

This user contributes using Linux.

This user contributes with SuSE Linux.

This user runs Mac OS X.

This user contributes using Mozilla Firefox.

This user believes that George W. Bush's edits to the constitution need to be reverted.

This user believes in the separation of church and state.

This user is a member of the Kindness Campaign.

This user contributes using Nano.

>56k

This user contributes using a broadband connection.

SI	This user uses the metric system of measurement.

?met?

This user prefers metric units and cannot figure out why Americans have such a hard time with them.

[edit] Networks Project

please post any additional information / comments about my networks project here.

(from http://www.ntung.com)

Abstract—This project is an attempt to primarily simulate a small network using various TCP protocols and simple routing, then to analyze the effects of bit errors in physical connections and the effect on performance of recovering from them. The network successfully emulates a simple routing protocol based on the Bellman-Ford algorithm, generates traffic, and uses TCP Reno flow control as well as a selective repeat ACK system. Bit recovery started with the simple assumption that it was unlikely to have two different and incorrect bits, and that all of the permutations from these uncertain bits would eventually lead to the correct message, which could be compared to a sensitive hash, such as SHA1. It was found that the algorithm was successful, and using aggressive timeouts performance similar to time increases from one additional packet sent for every corrupted packet was achieved.