• الإعلانات

    • فيصل الحربي

      تسجيل عضوية جديدة في المنتدى   01/31/2016

      السلام عليكم ورحمة الله وبركاته  عزيزي العضو الجديد :  حاليا رسالة الإيميل لتأكيد صحة إيميلكم تذهب للبريد العشوائي ( جاري حل المشكلة )  فإذا لم تجد رسالة التحقق من إيميلكم في صندوق الوارد لديكم إتجه للبريد العشوائي ( JUNK)  وقم بتفعيل إشتراككم من هناك   

heem2ua

اعضاء جدد
  • عدد المشاركات

    7
  • تاريخ الانضمام

  • تاريخ اخر زياره

السمعه بالموقع

0 عادي

عن heem2ua

  • الرتبة
    عضو جديد
  1. Sql Injection

    شكرا يا جماعة على ردودكم بجد بشكركم جدا
  2. السلام عليكــم ورحمـة الله وبركاتــه ،، دلوقتى يا خبراء البرمجة بوجه عام و متخصصى الاونلاين استريمنج أو اللى اشتغل فى الموضوع ده انا عاوز اعمل اسكريبت يبث قناة تليفزيونة و الموضوع ده انا اشتغلت عليه كاسكريبت عادى ممكن انه يشغل فيديو طبيعى و يضيفه فى بلاى ليست انما موضوع البث و ان اكتر من شخص يشوف نفس المشهد من المعروض فى نفس التايم لما سألت قاالولى ده أونلاين استريمنج و عليك و على الهيليس سيرفر ممكن أى حد يشرحلى الموضوع بس تكاليفه ازاى أقدر أحجز شكرا ليكم يا جماعة
  3. سلام عليكم يا جماعة اريد عمل هذا الالجوريزم جافا من يجد فى نفسه القدرة يقولى يا جماعة الوقت المتاح له يومان و سيتم محاسبته بعد التشييك على البروجكت سلام عليكم CITS3210 Algorithms Project Due: 5:00pm Mon 19th Oct, week 13, 2009 Your task is to implement a pattern matching algorithm for labelled graphs in java and analyse its performance. These sorts of algorithms are used for examining properties of hardware and software systems, highlighting reaction pathways in complicated biochemical systems, and forensic analysis of observed faults in systems. A labelled graph will be a directed (unweighted) graph (V,E) along with a label μ(v) for each vertex v ∈ V . The labels will just be single letters from a finite alphabet . A pattern is just a string p = hp1, p2, ..., pmi of letters from . Given , (V,E, μ) and p, the task is to search for some sequences v1, ..., vm such that each (vi, vi+1) ∈ E and each μ(vi) = pi. Input will consist of three text files: one to specify the alphabet, one to specify the labelled graph and one to specify the pattern. This is to allow convenient search for the same pattern in several different graphs. To specify an alphabet the text file should just have each different letter on a newline. Eg a b c d Note that to allow for large alphabets or convenience for specific applications, some (or all) letters of the alphabet may be represented by more than one ascii character. For specifying a labelled graph from the file you should use the following format for the input data file: 6 0 1 1 1 0 0 1 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 b a b a b c where the first line is the total number of vertices. The numbers from the second line onward are the entries of the n × n adjacency matrix (just 0 or 1 and not necessarily symmetric.) Then follow the labels of the vertices in order each on a different line. Finally, a pattern is specified by a text file with letters in order: 1 a b b You may assume that all the vertices have distinct numbers 0, 1, 2, · · · (as well as labels). The output should be a text file. If the pattern does not appear in the graph then it should just be a file starting with one line containing -1. If the pattern does appear then the text file should contain a sequence of numbers of vertices in order (with optional newlines) which have the pattern as their respective labels. Eg, 2 3 5 Note that there may be other possible answers to any particular instance of the problem. We just need one correct answer. This assignment can be done in pairs, although you may work on your own if you prefer. This assignment is worth 20% of your final grade, and consists of: • 5% - Commented source files, to be submitted to cssubmit (https://secure.csse.uwa.edu.au/run/cssubmit) • 12% - Written report, to be submitted at the front office. • 3% - Extension and challenge You’re implementation should consist of a set of java classes that allow labelled graphs to be searched from the command line. Your program should also satisfy the following requirements: 1. You may make use of code from our Lab class work but acknowledge any use of lines supplied by the School, (eg Graph.java). 2. You may use classes from java.lang, java.io and java.util. If you wish to use other classes you may post a message to the discussion list. 3. Your classes should be fully commented, including javadoc. Your program should be able to be run from the command line, accepting input and output files as parameters. For example, java LGSearch alph.txt lg.txt pattern.txt out.txt may run your program to look for the pattern pattern.txt from the alphabet alph.txt in the labelled graph lg.txt to produce out.txt. Note that the name of your classes and the way they are run is up to you. Your program should also be designed to perform efficiently. 2 The deliverable are: 1. A report, which should include the following parts: (a) A user guide, detailing how to compile and run your program. (1 mark) (B) A brief overview of the existing graph and pattern matching algorithms you examined and considered. Explain your choice of algorithm (or combination of algorithms). (2 marks) © A detailed description of the algorithm used (both in English and pseudo-code). (2 marks) (d) The software design decisions made and the rationale behind those decisions. (1 marks) (e) A theoretical analysis of the complexity of the algorithms (time and space). (3 marks) (f) Experimental analysis of the efficiency of your programs in terms of the time taken. (3 marks) Note, your report should also reference all resources used to complete your assignment. 2. The source files which are marked as follows: (a) Correctness (i.e. all instances located and no others ) (2/5) (B) Efficiency (time taken) (2/5) © Clarity (programme design, commenting, etc) (1/5) 3. The extension question is worth 3 marks and the effort required is not proportional to the marks so this should only be undertaken after you are satisfied with deliverable 1 and 2. For the extension, you are required to produce (a) an all paths version of your program which finds all the paths of vertices which match the pattern; (B) a labelled graph pattern-matching algorithm, that is able to match a pattern that may contain a simple regular expression such as a(bc)*a meaning any sequence such as aa, abca, abcbca, abcbcbca, ... (instead of just fixed strings); © A short report (2 pages max) (as an appendix to deliverable 1) detailing the algorithm used and the effectiveness of the algorithm. Submit the commented source files through cssubmit. The report should be handed into Room 1.31A, CSSE Building, by the due date/time. 3
  4. Sql Injection

    لف شكر يا جماعة على الردود انا الحمد لله وصلتلها بس كان فيه سوء فهم للموضوع و الحمد الله فيه بس حاجة بسيطة موضوع السكيوريتى عامة عاوزين نعمله زى محاضرات كاملة مع امثلة شاملة و بجد هتبأه خبطة تمام
  5. السلام عليكــم ورحمـة الله وبركاتــه ،، والله يا جماعة انا تعبت من انى ادور على حل لموضوع السكول انجكشنو اشتغلت على كذا حاجة زى mysql_real_escape_string() magic_quotes addslashes ......etc طبعا و غيرهم و عملت حاجات كتير ممكن اى حد تكون وجهته مشكلتى دى يتكلم معايا فيها الكونسبت بس نتكلم مع بعض و نوصل احاجة معينة
  6. مبرمج و مطور-ابراهيم أحمد أبويوسف 0020127246780 [email protected] [email protected] Qualifications: Programming 1 C#.Net Programming. 2 VB 6 Programming 3 Core C/C++ programmer Database 5 SQL Server 2000 6 MySQL 7 ADO.Net. 8 Microsoft Access Web : 10 ASP.Net 2.0 . 11 PHP. 12 Java Script , Ajax . Other Qualifications 12 Reportng Services 13 Knowledge of Mobile Technologies & IVR 14 VOIP. 15 XML Web Services 16 Good deal with CSS. 17 Good Knowledge about QC/QA and Testing concept 18 Good experience with (Win9x and WinNT) Platforms. 19 PC Troubleshooting, Software and hardware installation. 20 Microsoft Office (Word - Power point – Excel - Access ) 97 - 2007 Education: Bachelor of Computer Science -May 2007-Faculty of Computers and Informatics – Suez Canal University 1 Grade: Good 2 Graduation Project: Voice Based Security System . 3 Graduation Project Grade: Excellent (97 %) Graduation Project : Title Voice Based Security System . Category Core Programming Sponsors CS Department ,FCI ,Suez Canal University, Egypt Supervisors Dr.Magdy Shaybob , Dr. Ahmed Magdy . Project Brief We take a sample voice from person who in our net then using - Filter from internal and external noise . - Segmentation Process Segment sample into N sample . - LPC For getting the Voice characteristics. - FFT to convert from Time Frequency to Domain Frequency . - NN ( Neural Net ) all samples must be trainee with each other using BACK PROPAGATION Algorithm (BP) . CASE Tools C#.Net , MATLAB 7.4 . Development tools and IDE's: MS Visual Studio MS Visual Basic 6 , MS Visual C#.Net , MS Visual Basic.Net Borland Borland C++ 3.11(under dos),Borland C++ 5, Data Base M Systems DBMS Access, MYSQL, MS SQL Server 2000, SQL(PL/SQL) . Web Developing Tools HTML, PHP, ASP.Net . Projects : 1. PHP & MYSQL . Ø Simple Coordination Script . Ø Upload and Download Script . Ø Immovables Script . Ø Regiseration Script with a good Validation . Ø Maillist Script with Exist Features . Ø Sport Script ; Ø This beside sharing to do another Scripts . 2. Library System using Microsoft Visual C#.Net & SQL Server 2000 . 3. Simple Encryption and Decryption Programs using C#.Net . 4. Paint Brush Program using Borland C++ . 5. Graphics Project using Visual c( OPENGL) . 6. A lot of Simple Programs .
  7. سلام عليكم ممكن اراسلطك يا فندم و نتفق مبرمج و مطور -ابراهيم يوسف 0020127246780 [email protected] [email protected]
  8. طلب مبرمج

    mashy ya sedy 0127246780 kalmny
  9. momken ya gama3a mosa3dana 3andy labtop toshiba we kont 3amalt password 3la bios we nsset-ha momken ay 7ad yesa3edny plz thnx
  10. momken linkat ya gam3a anazel menha baa3d eznokomomken linkat ya gam3a anazel menha baa3d eznoko