Skip to main content

Home/ Computer Science Knowledge Sharing/ Group items tagged relational

Rss Feed Group items tagged

Islam TeCNo

Ternary relation - Wikipedia, the free encyclopedia - 0 views

  • n mathematics, a ternary relation or triadic relation is a finitary relation in which the number of places in the relation is three. Ternary relations may also be referred to as 3-adic, 3-ary, 3-dimensional, or 3-place. Just as a binary relation is formally defined as a set of pairs, i.e. a subset of the Cartesian product A × B of some sets A and B, so a ternary relation is a set of triples, forming a subset of the Cartesian product A × B × C of three sets A, B and C.
    • Abdelrahman Ogail
       
      Well known relation types is binary relation. Also ternary relation is a basic relation type
    • Islam TeCNo
       
      thanks zikas .... we bardo fe 7aga esmaha Ternary Search zaii ma fe binary search
computersciencej

Relational Algebra in Database - 0 views

  •  
    Relational algebra in database based this tutorial is helpful for computer science graduate in understanding the concepts of relational algebra. In 1971, relational algebra is defined by E.F. Codd based on relational language.
Janos Haits

GRID - Global Research Identifier Database - 0 views

  •  
    "GRID is a free and openly available global database of research-related organisations, cataloging research-related organisations and providing each with a unique and persistent identifier. With GRID you have over 102,392 carefully curated records at hand, enabling you to identify and distinguish research-related institutions worldwide.
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)
Islam TeCNo

Neuroplasticity - Wikipedia, the free encyclopedia - 0 views

  • Neuroplasticity (also referred to as brain plasticity, cortical plasticity or cortical re-mapping) is the changing of neurons and the organization of their networks and so their function by experience. This idea was first proposed in 1892 by Santiago Ramón y Cajal the proposer of the neuron doctrine though the idea was largely neglected for the next fifty years.[1] The first person to use the term neural plasticity appears to have been the Polish neuroscientist Jerzy Konorski.[2]
    • Abdelrahman Ogail
       
      This is why when a person thinks more he/she be more smarter!
    • Islam TeCNo
       
      3azeem .....bas deh mesh 7agat related l CS ya Zi3'az
    • Abdelrahman Ogail
       
      How said that? It's related to Artificial Neural Networks that require understanding of actual Human Neurons. BTW, plasticity principle is used in Games AI where the Controlled-AI determines if it forgot what happened or still remember it and seeks to revenge
    • Islam TeCNo
       
      oooooooooh ........ 3'reaaaaaat
Janos Haits

BabelNet | The largest multilingual encyclopedic dictionary and semantic network - 0 views

  •  
    "BabelNet is both a multilingual encyclopedic dictionary, with lexicographic and encyclopedic coverage of terms, and a semantic network which connects concepts and named entities in a very large network of semantic relations, made up of about 15 million entries, called Babel synsets. Each Babel synset represents a given meaning and contains all the synonyms which express that meaning in a range of different languages. Its evolution, BabelNet live, is a new, continuously growing resource, .."
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

Artificial life - Wikipedia, the free encyclopedia - 2 views

  • Artificial life (commonly Alife or alife) is a field of study and an associated art form which examine systems related to life, its processes, and its evolution through simulations using computer models, robotics, and biochemistry.[1] There are three main kinds of alife[2], named for their approaches: soft[3], from software; hard[4], from hardware; and wet, from biochemistry. Artificial life imitates traditional biology by trying to recreate biological phenomena.[5] The term "artificial life" is often used to specifically refer to soft alife
  • The modeling philosophy of alife strongly differs from traditional modeling, by studying not only “life-as-we-know-it”, but also “life-as-it-might-be” [7].
Abdelrahman Ogail

Hill climbing - Wikipedia, the free encyclopedia - 0 views

  • In computer science, hill climbing is a mathematical optimization technique which belongs to the family of local search. It is relatively simple to implement, making it a popular first choice. Although more advanced algorithms may give better results, in some situations hill climbing works just as well. Hill climbing can be used to solve problems that have many solutions, some of which are better than others. It starts with a random (potentially poor) solution, and iteratively makes small changes to the solution, each time improving it a little. When the algorithm cannot see any improvement anymore, it terminates. Ideally, at that point the current solution is close to optimal, but it is not guaranteed that hill climbing will ever come close to the optimal solution. For example, hill climbing can be applied to the traveling salesman problem. It is easy to find a solution that visits all the cities but will be very poor compared to the optimal solution. The algorithm starts with such a solution and makes small improvements to it, such as switching the order in which two cities are visited. Eventually, a much better route is obtained. Hill climbing is used widely in artificial intelligence, for reaching a goal state from a starting node. Choice of next node and starting node can be varied to give a list of related algorithms.
Islam TeCNo

Design and Analysis of Computer Algorithms - 0 views

  • Dijkstra's Algorithm
    • Islam TeCNo
       
      Algorithm for finding shortest path is graph
  • Huffman's Codes
    • Islam TeCNo
       
      used in data compression
  •  
    recommended !! :D Mathematics for Algorithmic Sets Functions and Relations Vectors and Matrices Linear Inequalities and Linear Equations Greedy Algorithms Knapsack Problem o O-I Knapsack o Fractional Knapsack * Activity Selection Problem * Huffman's Codes * Minimum Spanning Tree * Kruskal's Algorithm * Prim's Algorithm * Dijkstra's Algorithm Divide & Conquer Algorithms Dynamic Programming Algorithms * Knapsack Problem DP Solution * Activity Selection Problem DP Solution Amortized Analysis * Aggregate Method * Accounting Method * Potential Method * Dynamic Table Hash Table Binary Search Tree Graph Algorithms * Breadth First Search (BFS) * Depth First Search (DFS) * Topological Sort * Strongly Connected Components * Euler Tour * Generic Minimum Spanning Tree * Kruskal's Algorithm * Prim's Algorithm * Single Source Shortest Path o Dijkstra's Algorithm o Bellman-Ford Algorithm String Matching * Naïve String Matching * Knuth-Morris-Pratt Algorithm * Boyer-Moore Algorithm Sorting * Bubble Sort * Insertion Sort * Selection Sort * Shell Sort * Heap Sort * Merge Sort * Quick Sort Linear-Time Sorting * Counting Sort * Radix Sort * Bucket Sort Computational Geometry Computational Complexity * Information-Theoretic Argument * Adversary Argument * NP-Completeness And Reduction Approximate Algorithms * Vertex Cover * The Traveling Salesman Problem Linear Programming Appendix 1. Parabola 2. Tangent Codes References hoping to discuss these algorithms with each other !
  •  
    this web page contain a lot of algorithms discussed with simple ways !! i think these maybe useful Tutorials !! hoping to discuss these algorithms with each other !
  •  
    Ohhhhhhh .....Gammmeeeeeeeeed gedan ya Mans ...thanks
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

Belief-Desire-Intention software model - Wikipedia, the free encyclopedia - 0 views

  • The Belief-Desire-Intention (BDI) software model (usually referred to simply, but ambiguously, as BDI) is a software model developed for programming intelligent agents. Superficially characterized by the implementation of an agent's beliefs, desires and intentions, it actually uses these concepts to solve a particular problem in agent programming. In essence, it provides a mechanism for separating the activity of selecting a plan (from a plan library) from the execution of currently active plans. Consequently, BDI agents are able to balance the time spent on deliberating about plans (choosing what to do) and executing those plans (doing it). A third activity, creating the plans in the first place (planning), is not within the scope of the model, and is left to the system designer and programmer.
    • Abdelrahman Ogail
       
      This model is used to simulate human behavior its under area of research and its so interesting and innovative
    • Islam TeCNo
       
      nice ..... dah tab3an related lel AI !
Islam TeCNo

COUNT (Transact-SQL) - 0 views

  • COUNT(*) returns the number of items in a group. This includes NULL values and duplicates. COUNT(ALL expression) evaluates expression for each row in a group and returns the number of nonnull values. COUNT(DISTINCT expression) evaluates expression for each row in a group and returns the number of unique, nonnull values.
    • Abdelrahman Ogail
       
      Count Function is a Mathematical Aggregation Function. Many forms of it appreas below
    • Islam TeCNo
       
      ana fahem el kalam eli maktoub :D bas mesh fahm el bo2en eli enta katbhom dol :D
    • Abdelrahman Ogail
       
      In Relational Algebra and Set Theory COUNT is a type of function called Aggregation Function that is applied to an attribute (databse column) and results in one value
    • Islam TeCNo
       
      ahaaaa ...thanks ZiKaS
Abdelrahman Ogail

Mutation testing - Wikipedia, the free encyclopedia - 1 views

  • Mutation testing (or Mutation analysis) is a method of software testing, which involves modifying program's source code in small ways.[1] These, so-called mutations, are based on well-defined mutation operators that either mimic typical programming errors (such as using the wrong operator or variable name) or force the creation of valuable tests (such as driving each expression to zero). The purpose is to help the tester develop effective tests or locate weaknesses in the test data used for the program or in sections of the code that are seldom or never accessed during execution.
  • For example, consider the following C++ code fragment: if (a && b) c = 1; else c = 0; The condition mutation operator would replace '&&' with '||' and produce the following mutant: if (a || b) c = 1; else c = 0;
  • Many mutation operators can produce equivalent mutants. For example, consider the following code fragment: int index=0; while (...) { . . .; index++; if (index==10) break; } Boolean relation mutation operator will replace "==" with ">=" and produce the following mutant: int index=0; while (...) { . . .; index++; if (index>=10) break; }
samantha armstrong

FixComputerpProblemsSite Surely Knows How to Fix Computer Problems! - 2 views

I was having problems with my laptop before. Good thing FixComputerpProblemsSite helped me fix it. And they are really the experts when it comes to solving any computer related issues. They can eas...

fix computer problems

started by samantha armstrong on 12 May 11 no follow-up yet
sam neilson

FixComputerpProblemsSite Surely Knows How to Fix Computer Problems! - 1 views

I was having problems with my laptop before. Good thing FixComputerpProblemsSite helped me fix it. And they are really the experts when it comes to solving any computer related issues. They can eas...

fix computer problems

started by sam neilson on 11 May 11 no follow-up yet
shai edrote

They Fixed My Slow Computer - 1 views

My computer started running so slow that it takes me 10 minutes just to open a site. So I called Fix Slow Computer Today to help me with my concern. They have expert computer technicians who can fi...

They Fixed My Slow Computer

started by shai edrote on 12 Sep 11 no follow-up yet
1 - 17 of 17
Showing 20 items per page