Archigos, returns...

al salamo alikom wa rahmato ALLAH wa barkatoh,

Hello everybody, we are back .. and good news ;)
Do you remember Archigos ? The last year Computer Architecture project.

A brief about the project:
Last year, we and Wael Abul-Kheir developed the Archigos software, that aims to build an emulator from a CPU computer design.
Emulator work is not hardcoded, it's generated from the computer architecture diagram.

What's going on now ?
We have handled the project to a new team, 3 guys that agreed to continue the work, and grow up with Archigos to be completed ... and more.
The new team members are from 3rd year: Alaa Shaker, Mahmoud Osama, Mohammed Fouad.

What shoud I expect ?
Now the creativity phase is running, but the main aim is the completion of Archigos, let it be as much generic as possible.

Where could I find more about Archigos ?
http://team.amigos.googlepages.com/archigos

keep tuned for news on that Blog, and feel free to contact any of the team stuff (to be extended):
Kamal El-Din Mohammed: kishokono@hotmail.com
Mohammed Abdul Aziz: moham_87@hotmail.com
Mohammed Mustafa Moussa: computer_guy86@hotmail.com

al salamo alikom wa rahmato ALLAH wa barkatoh

Suffix Tree

al salamo 3alikom wa ra7mato ALLAH,

Represent your string that way, in a Suffix Tree.
Make searching easier and make use of your study of Automata and Regular Expressions ;)

Brief Explanation:
As I mentioned above, "make use of Automata...", let me explain briefly by example:
The string "bananas", if you wanna extract a substring out of, let's say u wanna choose a string starting with "n" .. you have two choices then...either "nanas" or "nas"
so let's imagine a graph structure, standing at letter (node) "n" and u wanna check what's possible next letter..it's "a" in both choices... then from "a" you go either to another "n" or "s" ... the other "n" goes to "a" then "s"
But, could u observe something, i said "it's 'a' in both choices" why don't concatenate the "a" to "n" then ?
exactly that what we gonna do... (NOTE: suffix tree nodes are not letters, path from root to a node is a substring, edges are labeled with substrings)
Read more here

Uses:

1. Find substrings
2. Find Occurences of a pattern
3. find all strings that contain a pattern
4. Find the longest substring of that appears at least m > 1 times
5. Find the longest common substring of two strings

Uses Explained here

al salamo 3alikom wa ra7mato ALLAH wa barkatoh

Problems Links

al salamo 3alikom wa ra7mato ALLAH wa barkatoh,

here are some useful problem sites:
http://www.acm.inf.ethz.ch/
http://acm.uva.es/p/
http://www.karrels.org/Ed/ACM/
http://acm.timus.ru/forum/
http://cs.tju.edu.cn/acm/list_problem.php?vol=3
http://acmicpc-live-archive.uva.es/nuevoportal/
http://www.acmsolver.org/?itemid=177
http://contest.mff.cuni.cz/archive/problems.html
http://www.comp.nus.edu.sg/~ngchumin/Online%20Judge/

Feel free to add more if any, or tell about broken links ;)
alsalamo 3alikom wa ra7mato ALLAH wa barkatoh

Happy Birthday

al salamo 3alikom,

Today, 9.1.2007, is our friend Mohammed Moussa birthday
<:o)

Happy Birthday Moussa

Testinomials...

al salamo alikom
Hi all,

What do you think about Amigos ?
waiting your comments...

First Post

el salamo 3alikom wa ra7amtoo ALLAH w baraktoo

Hello everyone...

Amigos will invade :D, this bolg is an extension to our Amigos Google Page

Here we'll explain our ideas, advertise what's in our googlpage, talk about us, us about talk, about talk us, something like that :D

wish us be Amigos forever

el salamo 3alikom wa ra7amtoo ALLAH wa baraktoo