Skip to main content

Home/ Computer Science Knowledge Sharing/ Group items tagged org

Rss Feed Group items tagged

Janos Haits

Numenta | NuPIC - 0 views

  •  
    Numenta.org Platform for Intelligent Computing The mission of this project is to build and support a community interested in machine learning and machine intelligence based on modeling the neocortex and the principles upon which it works.
Janos Haits

Zotero | Home - 0 views

  •  
    A personal research assistant. Zotero is the only research tool that automatically senses content, allowing you to add it to your personal library with a single click. Whether you're searching for a preprint on arXiv.org, a journal article from JSTOR, a news story from the New York Times, or a book from your university library catalog, Zotero has you covered with support for thousands of sites.
Janos Haits

Compute Library for Deep Neural Networks (clDNN) | 01.org - 0 views

  •  
    "Compute Library for Deep Neural Networks (clDNN) is an open source performance library for Deep Learning (DL) applications intended for acceleration of DL inference on Intel® HD Graphics Driver and  Intel® Iris® graphics (also referred to as Intel® Processor Graphics)."
Islam TeCNo

List of network protocols - Wikipedia, the free encyclopedia - 0 views

  • IPv4 Internet Protocol version 4
    • Islam TeCNo
       
      el mafroud dah eli howa asasn e7na bensta5dmo now ...maslan el IP beta3i 217.154.89.2 ....el mafroud dah IPv4 we el mafroud ba2a ba3den netawr we neb2a IPv6 :D
  • IPv6 Internet Protocol version 6
    • Islam TeCNo
       
      المفروض ده بقي البروتوكول الجديد الي إن شاء الله هيطبق بعيدن
    • Ahmed Mansour
       
      Currently there are two types of Internet Protocol (IP) addresses in active use: IP version 4 (IPv4) and IP version 6 (IPv6). IPv4 was initially deployed on 1 January 1983 and is still the most commonly used version. IPv4 addresses are 32-bit numbers often expressed as 4 octets in "dotted decimal" notation (for example, 192.0.2.53). Deployment of the IPv6 protocol began in 1999. IPv6 addresses are 128-bit numbers and are conventionally expressed using hexadecimal strings (for example, 2001:0db8:582:ae33::29). source : http://www.iana.org/numbers/ thanks tecno for your useful comments :) keep it up(Y)
  • TCP Transmission Control Protocol UDP User Datagram Protocol
    • Islam TeCNo
       
      The Diffrance between TCP and UDP is that TCP check the packet that packets are sent correctly ... but UDP just send and don't check ....so UDP is faster than TCP but TCP check that data is sent correctly .... so UDP is used in applications like Video Streaming (You Tube) and Voice Streaming too
    • Islam TeCNo
  • ...6 more annotations...
  • Jabber, an instant-messaging protocol
    • Islam TeCNo
       
      Great protcol .....also Called XMPP and this is the protocol used by Google Talk
    • Islam TeCNo
       
      port 5222 i think is it's default :D
  • Internet Relay Chat (IRC)
    • Islam TeCNo
       
      I think this is a very old chat protocol
  • ED2K, A peer-to-peer file sharing protocol
    • Islam TeCNo
       
      I think this is used by emule P2P program !! A Great P2P File Sharing program
  • FTP, File Transfer Protocol
    • Islam TeCNo
       
      use port 21 :D
    • Islam TeCNo
       
      loooooooot of protocols ....any one know simple explainations ?
  • HTTP, HyperText Transfer Protocol
Islam TeCNo

Design pattern - Wikipedia, the free encyclopedia - 0 views

  • A pattern must explain why a particular situation causes problems, and why the proposed solution is considered a good one. Christopher Alexander describes common design problems as arising from "conflicting forces" -- such as the conflict between wanting a room to be sunny and wanting it not to overheat on summer afternoons. A pattern would not tell the designer how many windows to put in the room; instead, it would propose a set of values to guide the designer toward a decision that is best for their particular application. Alexander, for example, suggests that enough windows should be included to direct light all around the room. He considers this a good solution because he believes it increases the enjoyment of the room by its occupants. Other authors might come to different conclusions, if they place higher value on heating costs, or material costs. These values, used by the pattern's author to determine which solution is "best", must also be documented within the pattern. A pattern must also explain when it is applicable. Since two houses may be very different from one another, a design pattern for houses must be broad enough to apply to both of them, but not so vague that it doesn't help the designer make decisions. The range of situations in which a pattern can be used is called its context. Some examples might be "all houses", "all two-story houses", or "all places where people spend time." The context must be documented within the pattern. For instance, in Christopher Alexander's work, bus stops and waiting rooms in a surgery are both part of the context for the pattern "A PLACE TO WAIT."
    • Islam TeCNo
       
      This is Not a CS related articile ....check this link !! http://en.wikipedia.org/wiki/Design_pattern_(computer_science)
  •  
    Design Patterns
  •  
    Design Patterns
Islam TeCNo

علم الحاسب للناشئة - 0 views

shared by Islam TeCNo on 09 Jun 09 - No Cached
  • علم الحاسوب للناشئة
    • Abdelrahman Ogail
       
      Many people now feel the importance of teaching programming to children. I suggest each one try to test this with his brothers :D
    • Islam TeCNo
       
      LOL @ this picture and thanks ZiKaS
  •  
    a Page that contains some Sites and programming languages that help young to start programming
  •  
    Great Page that contains some Sites and programming languages that help young to start programming
Janos Haits

DevoPedia.org - 0 views

  •  
    for developers, by developers
Janos Haits

Logseq: A privacy-first, open-source knowledge base - 1 views

  •  
    "Logseq is a privacy-first, open-source knowledge base that works on top of local plain-text Markdown and Org-mode files. Use it to write, organize and share your thoughts, keep your to-do list, and build your own digital garden."
Islam TeCNo

Deep Blue (chess computer) - Wikipedia, the free encyclopedia - 0 views

  • Deep Blue was a chess-playing computer developed by IBM. On May 11, 1997, the machine won a six-game match by two wins to one with three draws against world champion Garry Kasparov.[1] Kasparov accused IBM of cheating and demanded a rematch, but IBM declined and dismantled Deep Blue.[2] Kasparov had beaten a previous version of Deep Blue in 1996
    • Abdelrahman Ogail
       
      When AI beats humanity!
  • Deep Blue was then heavily upgraded (unofficially nicknamed "Deeper Blue")[11] and played Kasparov again in May 1997, winning the six-game rematch 3½–2½, ending on May 11, finally ending in game six, and becoming the first computer system to defeat a reigning world champion in a match under standard chess tournament time controls.
  • The system derived its playing strength mainly out of brute force computing power.
    • Islam TeCNo
       
      Dah eli bysamoh brute force men no3 el 7aywan :D
Ahmed Mansour

Introduction to Design Patterns - 0 views

  • design pattern is a widely accepted solution to a recurring design problem in OOP a design pattern describes how to structure classes to meet a given requirement provides a general blueprint to follow when implementing part of a program does not describe how to structure the entire application does not describe specific algorithms focuses on relationships between classes
  • design patterns: make you more productive help you write cleaner code Observer and Singleton are just two of the many available if you like design patterns, try these resources: GoF book -- Design Patterns: Elements of Reusable Object-oriented Software design pattern examples in Java, see Design Patterns in Java Reference and Example Site
  • learn what a design pattern is
    • Ahmed Mansour
       
      link to download Design Patterns: Elements of Reusable Object-oriented Software book : http://rs638.rapidshare.com/files/242614498/Design_Patterns_Elements_Of_Reusable_Object_Oriented_Software.pdf
  •  
    in summary :D we can say that a design pattern is a general reusable solution to a commonly occurring problem in software design. and it gives the way and relation between the classes and object to solve a certain problem and it doesn't specity the final application here is a book which Tecno give it tom me http://www.4shared.com/file/111350944/8be77835/Dummies_-_DesignPattern.html hope that it will be usefull
Abdelrahman Ogail

Quis custodiet ipsos custodes? - Wikipedia, the free encyclopedia - 0 views

  • The question is put to Socrates, "Who will guard the guardians?" or, "Who will protect us against the protectors?" Plato's answer to this is that they will guard themselves against themselves. We must tell the guardians a "noble lie."[1] The noble lie will inform them that they are better than those they serve and it is therefore their responsibility to guard and protect those lesser than themselves. We will instill in them a distaste for power or privilege; they will rule because they believe it right, not because they desire it.
Ahmed Mansour

Netwokring Introduction - 0 views

  • Networking Tutorial
  •  
    Nice.. ana kont 3ayez a3raf aktar 3n el networking field...Thanks Mans :)
Abdelrahman Ogail

Genetic programming - Wikipedia, the free encyclopedia - 0 views

  • In artificial intelligence, genetic programming (GP) is an evolutionary algorithm-based methodology inspired by biological evolution to find computer programs that perform a user-defined task. It is a specialization of genetic algorithms (GA) where each individual is a computer program. Therefore it is a machine learning technique used to optimize a population of computer programs according to a fitness landscape determined by a program's ability to perform a given computational task.
  • In artificial intelligence, genetic programming (GP) is an evolutionary algorithm-based methodology inspired by biological evolution to find computer programs that perform a user-defined task. It is a specialization of genetic algorithms (GA) where each individual is a computer program. Therefore it is a machine learning technique used to optimize a population of computer programs according to a fitness landscape determined by a program's ability to perform a given computational task.
Abdelrahman Ogail

ELIZA - Wikipedia, the free encyclopedia - 0 views

  • ELIZA was a computer program and an early example (by modern standards) of primitive natural language processing. ELIZA operated by processing users' responses to scripts, the most famous of which was DOCTOR, a simulation of a Rogerian psychotherapist. In this mode, ELIZA mostly rephrased the user's statements as questions and posed those to the 'patient.' ELIZA was written by Joseph Weizenbaum between 1964 to 1966
Abdelrahman Ogail

Simulated annealing - Wikipedia, the free encyclopedia - 1 views

  • Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global minimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration — provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution. The name and inspiration come from annealing in metallurgy, a technique involving heating and controlled cooling of a material to increase the size of its crystals and reduce their defects. The heat causes the atoms to become unstuck from their initial positions (a local minimum of the internal energy) and wander randomly through states of higher energy; the slow cooling gives them more chances of finding configurations with lower internal energy than the initial one. By analogy with this physical process, each step of the SA algorithm replaces the current solution by a random "nearby" solution, chosen with a probability that depends on the difference between the corresponding function values and on a global parameter T (called the temperature), that is gradually decreased during the process. The dependency is such that the current solution changes almost randomly when T is large, but increasingly "downhill" as T goes to zero. The allowance for "uphill" moves saves the method from becoming stuck at local minima—which are the bane of greedier methods. The method was independently described by S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi in 1983 [1], and by V. Černý in 1985 [2]. The method is an adaptation of the Metropolis-Hastings algorithm, a Monte Carlo method to generate sample states of a thermodynamic system, invented by N. Metropolis et al. in 1953 [3].
  • Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global minimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration — provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution. The name and inspiration come from annealing in metallurgy, a technique involving heating and controlled cooling of a material to increase the size of its crystals and reduce their defects. The heat causes the atoms to become unstuck from their initial positions (a local minimum of the internal energy) and wander randomly through states of higher energy; the slow cooling gives them more chances of finding configurations with lower internal energy than the initial one. By analogy with this physical process, each step of the SA algorithm replaces the current solution by a random "nearby" solution, chosen with a probability that depends on the difference between the corresponding function values and on a global parameter T (called the temperature), that is gradually decreased during the process. The dependency is such that the current solution changes almost randomly when T is large, but increasingly "downhill" as T goes to zero. The allowance for "uphill" moves saves the method from becoming stuck at local minima—which are the bane of greedier methods. The method was independently described by S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi in 1983 [1], and by V. Černý in 1985 [2]. The method is an adaptation of the Metropolis-Hastings algorithm, a Monte Carlo method to generate sample states of a thermodynamic system, invented by N. Metropolis et al. in 1953 [3].
  • Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global minimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration — provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution. The name and inspiration come from annealing in metallurgy, a technique involving heating and controlled cooling of a material to increase the size of its crystals and reduce their defects. The heat causes the atoms to become unstuck from their initial positions (a local minimum of the internal energy) and wander randomly through states of higher energy; the slow cooling gives them more chances of finding configurations with lower internal energy than the initial one. By analogy with this physical process, each step of the SA algorithm replaces the current solution by a random "nearby" solution, chosen with a probability that depends on the difference between the corresponding function values and on a global parameter T (called the temperature), that is gradually decreased during the process. The dependency is such that the current solution changes almost randomly when T is large, but increasingly "downhill" as T goes to zero. The allowance for "uphill" moves saves the method from becoming stuck at local minima—which are the bane of greedier methods. The method was independently described by S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi in 1983 [1], and by V. Černý in 1985 [2]. The method is an adaptation of the Metropolis-Hastings algorithm, a Monte Carlo method to generate sample states of a thermodynamic system, invented by N. Metropolis et al. in 1953 [3].
  • ...1 more annotation...
  • Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global minimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration — provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution. The name and inspiration come from annealing in metallurgy, a technique involving heating and controlled cooling of a material to increase the size of its crystals and reduce their defects. The heat causes the atoms to become unstuck from their initial positions (a local minimum of the internal energy) and wander randomly through states of higher energy; the slow cooling gives them more chances of finding configurations with lower internal energy than the initial one. By analogy with this physical process, each step of the SA algorithm replaces the current solution by a random "nearby" solution, chosen with a probability that depends on the difference between the corresponding function values and on a global parameter T (called the temperature), that is gradually decreased during the process. The dependency is such that the current solution changes almost randomly when T is large, but increasingly "downhill" as T goes to zero. The allowance for "uphill" moves saves the method from becoming stuck at local minima—which are the bane of greedier methods. The method was independently described by S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi in 1983 [1], and by V. Černý in 1985 [2]. The method is an adaptation of the Metropolis-Hastings algorithm, a Monte Carlo method to generate sample states of a thermodynamic system, invented by N. Metropolis et al. in 1953 [3].
  •  
    Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global minimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration - provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution. The name and inspiration come from annealing in metallurgy, a technique involving heating and controlled cooling of a material to increase the size of its crystals and reduce their defects. The heat causes the atoms to become unstuck from their initial positions (a local minimum of the internal energy) and wander randomly through states of higher energy; the slow cooling gives them more chances of finding configurations with lower internal energy than the initial one. By analogy with this physical process, each step of the SA algorithm replaces the current solution by a random "nearby" solution, chosen with a probability that depends on the difference between the corresponding function values and on a global parameter T (called the temperature), that is gradually decreased during the process. The dependency is such that the current solution changes almost randomly when T is large, but increasingly "downhill" as T goes to zero. The allowance for "uphill" moves saves the method from becoming stuck at local minima-which are the bane of greedier methods. The method was independently described by S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi in 1983 [1], and by V. Černý in 1985 [2]. The method is an adaptation of the Metropolis-Hastings algorithm, a Monte Carlo method to generate sample states of a thermodynamic system, invented by N. Metropolis et al. in 1953 [3].
  •  
    A natural AI approach
Islam TeCNo

Database - Wikipedia, the free encyclopedia - 0 views

shared by Islam TeCNo on 08 Jun 09 - Cached
  • A database is a structured collection of records or data that is stored in a computer system. The structure is achieved by organizing the data according to a database model. The model in most common use today is the relational model. Other models such as the hierarchical model and the network model use a more explicit representation of relationships
    • Abdelrahman Ogail
       
      Database official definition
    • Islam TeCNo
       
      yes .... bas a3taked en el wa7ed yfham ahm b keter men eno ye3ref el Definition (dah mogarad test post hehe )
    • Islam TeCNo
       
      But in File Stucter we took that database is set of related files
  • increase their speed
  • common kind of index is a sorted list of the contents of some particular table column, with pointers to the row associated with the value
  • ...1 more annotation...
  • Typically, indexes are also stored in the various forms of data-structure mentioned above (such as B-trees, hashes, and linked lists)
Abdelrahman Ogail

Voice over Internet Protocol - Wikipedia, the free encyclopedia - 0 views

shared by Abdelrahman Ogail on 01 Jul 09 - Cached
Ahmed One liked it
  • Voice over Internet Protocol (VoIP) is a general term for a family of transmission technologies for delivery of voice communications over IP networks such as the Internet or other packet-switched network
  • Internet telephony refers to communications services—voice, facsimile, and/or voice-messaging applications—that are transported via the Internet, rather than the public switched telephone network (PSTN). The basic steps involved in originating an Internet telephone call are conversion of the analog voice signal to digital format and compression/translation of the signal into Internet protocol (IP) packets for transmission over the Internet; the process is reversed at the receiving end.[1]
Ahmed  One

Cryptography - Wikipedia, the free encyclopedia - 0 views

  •  
    I think this Concept is very important to know.
Islam TeCNo

What's in an HTTP request? - 0 views

shared by Islam TeCNo on 15 Jun 09 - Cached
Ahmed Mansour liked it
  • These headers tell us which web server you were trying to contact.  If that seems odd, bear in mind that many web sites can be "hosted" on a single server, so when the request is received it needs to know which web site you were attempting to access
    • Islam TeCNo
       
      el server momken yekon 3aleh aktar men site ....3ashan keda lama bab3t request ba2olo bardo ana 3ayez site eh !!
  • The request method is usually either "GET" or "POST".  Basically if you fill in and submit a form on a web page it might generate a POST request (or it might be "GET"), whereas if you just click on a link, or activate one of your browser's "bookmarks" or "favourites", then the request method will always be "GET". Therefore, if it's "POST", we can tell that a form was definitely submitted.  The contents of the form would appear here, and there would also be some "Content-" headers describing the data. Web browsers generate two kinds of "POST" data: either "multipart/form-data", which is used when uploading files to a web server, or the more common "application/x-www-form-urlencoded".
    • Islam TeCNo
       
      el 7eta deh mohema ....we fe anwa3 tania bardo 3'er el GET we el POST
  • The "referer" header tells us which document referred you to us - in essence, if you followed a link to get to this page, it is the URL of the page you came from to get here.
    • Islam TeCNo
       
      el Referer by2ol lel server el page eli enta gaii menha ....we a3taked deh el tare2a eli fe sites betsta5dmha 3ashan temna3 maslan en sora aw keda tetshaf ela men el site zat nafso
  • ...2 more annotations...
  • Connection control Connection:keep-alive Keep-Alive:300 These headers are used to fine-tune the network traffic between you and the web server.  They don't tell us much, except a little about the capabilities of your web browser.
    • Islam TeCNo
       
      kan nefsi yekon fe shar7 lel 7eta deh aktar !!
  • Authorisation Username:not present If you have "logged in" to a web site, your username appears here. Note that this only applies to web sites which use proper HTTP authentication - typically, a "login" window pops up and you get three chances to enter your username and password, otherwise you see a page which says "Authentication Required" or similar.  It doesn't apply to web sites where the "login" is a separate page. It's also possible to supply the username and password in the URL you tell your browser to visit - for example, http://user:password@www.example.com/.  In that case, the username would appear here too.
    • Ahmed Mansour
       
      msh fahem el goz2 dah 2wey !! .. 7d yewad7ely please ...
    • Islam TeCNo
       
      ya3ni ya mans a7yanan fe sites bykon feha UserName we password 3an tare2 el HTTP protocol .....ya3ni el mail maslan aw cisclub dol fehom username we password mesh 3an tare2 el HTTP protocol ....el HTTP protocl el username we el pass beto3o bytlbo menak 2abl ma td5ol 3ala el page asasn we bytl3lk keda pop up tekteb feha
  •  
    really very important and useful article ... thanks tecno very match :P
  •  
    Nice Article Tecno..Go On
1 - 20 of 111 Next › Last »
Showing 20 items per page