Skip to main content

Home/ Computer Science Knowledge Sharing/ Group items tagged analysis

Rss Feed Group items tagged

Janos Haits

Cytoscape: An Open Source Platform for Complex-Network Analysis and Visualization - 0 views

  •  
    Cytoscape is an open source software platform for visualizing complex-networks and integrating these with any type of attribute data. A lot of plugins are available for various kinds of problem domains, including bioinformatics, social network analysis, and semantic web.
Janos Haits

Vulnerability, CDR and Antivirus APIs | Metadefender - 0 views

  •  
    "Select or drop a file up to 140 MB in size for malware analysis, vulnerability check, and data sanitization (CDR; Content Disarm and Reconstruction)."
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
Janos Haits

e-LICO Front Page | Data Mining Portal - 0 views

  •  
    "The goal of the e-LICO project is to build a virtual laboratory for interdisciplinary collaborative research in data mining and data-intensive sciences. The e-lab comprises three layers: the e-science and data mining layers form a generic research environment that can be adapted to different scientific domains by customizing the application layer. e-LICO uses both Taverna and RapidAnalytics/RapidMiner to design and enact data analysis workflows. It provides a variety of general-purpose and application-specific services and a broad toolkit to assist the user in designing such workflows."
Janos Haits

web.dev  |  web.dev - 0 views

  •  
    "Let's build the future of the web Get the web's modern capabilities on your own sites and apps with useful guidance and analysis from web.dev."
Janos Haits

Freedom to Tinker - Research and expert commentary on digital technologies in public life - 0 views

  •  
    "Freedom to Tinker is hosted by Princeton's Center for Information Technology Policy, a research center that studies digital technologies in public life. Here you'll find comment and analysis from the digital frontier, written by the Center's faculty, students, and friends."
veera90

Expert Biostatistics Services | Biostatistics | ACL Digital Life Sciences | IT Consulting - 0 views

  •  
    Biostatistics plays a vital role in clinical research. From protocol development and clinical trial designs to sample size calculation, data analysis and more, our team of Biostatisticians have the right SME expertise in multiple therapeutic areas to help deliver quality outcomes quickly and efficiently. You can rely on us to determine and apply the appropriate statistical model, write CSR sections to interact with regulatory authorities, and examine the efficacy of safety data. Innovative and insight-driven statistical methods play a crucial role in every step of the drug development process. At ACL Digital, biostatistics remains an integral part of our services.
Ahmed Mansour

CRC Cards Tutorial - 0 views

  • Object Oriented Analysis and Design using CRC Cards
  • A CRC cards is an index card that is use to represent the responsibilities of classes and the interaction between the classes. CRC cards are an informal approach to object oriented modeling. The cards are created through scenarios, based on the system requirements, that model the behavior of the system. The name CRC comes from Class, Responsibilities, and Collaborators which the creators found to be the essential dimensions of object oriented modeling.
    • Ahmed Mansour
       
      One of the most popular methods for identifying and categorizing classes is to use class-responsibility-collaboration cards (CRC). Each CRC card represents a single class's data attributes, responsibilities, and collaborations. source : Thought Process Book..
    • Ahmed Mansour
       
      You need to create three sections on each card: - The name of the class - The responsibilities of the class - The collaborations of the class
  • Why uses CRC cards?
  • ...4 more annotations...
  • They are portable... No computers are required so they can be used anywhere. Even away from the office. The allow the participants to experience first hand how the system will work. No computer tool can replace the interaction that happens by physically picking up the cards and playing the roll of that object... The are a useful tool for teaching people the object-oriented paradigm. They can be used as a methodology them selves or as a front end to a more formal methodology such as Booch, Wirfs-Brock, Jacobson, etc.
  • Tutorial
    • Ahmed Mansour
       
      here we can found simple tutorial for illustration...
  • A CRC cards is an index card that is use to represent the responsibilities of classes and the interaction between the classes. CRC cards are an informal approach to object oriented modeling. The cards are created through scenarios, based on the system requirements, that model the behavior of the system. The name CRC comes from Class, Responsibilities, and Collaborators which the creators found to be the essential dimensions of object oriented modeling.
  • Why uses CRC cards? They are portable... No computers are required so they can be used anywhere. Even away from the office. The allow the participants to experience first hand how the system will work. No computer tool can replace the interaction that happens by physically picking up the cards and playing the roll of that object... The are a useful tool for teaching people the object-oriented paradigm. They can be used as a methodology them selves or as a front end to a more formal methodology such as Booch, Wirfs-Brock, Jacobson, etc.
  •  
    This is great tutorial for CRC cards ( sort of object oriented modeling approach) \ni think it was useful for me ... hoping to be useful for all of us : ) ..
fili el sayed

Introduction to Model View Control (MVC) Pattern using C# - 3 views

  • we need to figure out what the heck it is.
    • fili el sayed
       
      LOOOOOOOL, this is a good aproach to start analysis
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; }
1 - 11 of 11
Showing 20 items per page