Explore Algorithm
Algorithm
-
Binary Search on Sorted Array
Functionality : Perform binary search on a sorted arrayMR Num:4 -
kth Occurrence of x in Unsorted Array
Functionality : locate the kth occurrence of a key from an unsorted arrayMR Num:3 -
Grep
Functionality : Searches file for lines containing a match to a specified pattern.MR Num:1 -
Electronic payment
Functionality : To validate the MT framework for testing Web services, and report the effectiveness of MT.MR Num:6 -
Cloud model
Functionality : Detecting unexpected behaviour when simulating cloud provisioning and usage.MR Num:3 -
Grep
Functionality : Searching some input files for lines containing a match to the specified pattern.MR Num:3 -
Replace
Functionality : Performing regular expression matching and substitutions.MR Num:6 -
Schedule and schedule2
Functionality : Internally maintaining four mutually exclusive job lists, while schedule is non-preemptive and schedule2 is preemptive.MR Num:0 -
Tcas
Functionality : A module of an on-board aircraft conflict detection and resolution system used by commercial aircraft.MR Num:3 -
Tot_info
Functionality : Printing the Kullbacks information measure, the degree of freedom and the possibility density of distribution of one table.MR Num:3 -
HRRN(Highest Response Ratio Next)
Functionality : Deciding which process should be allocated CPU time when there are more than one process waiting and competing the resources.MR Num:6 -
Shortestpath
Functionality : Calculating the shortest path.MR Num:2 -
the string searching program
Functionality : to search stringMR Num:4 -
Binary Search into a sorted array
Functionality : Perform binary search on a sorted arrayMR Num:1 -
ShortestPath
Functionality : Calculating the shortest pathMR Num:6 -
Context-Sensitive Middleware-Based Software Applications
Functionality : The system includes two features: (i) As far as possible, every visitor can personalize their favorite level of illumination irrespectively of their location within the zone. (ii) At the same time, the system maximizes energy savings by dimming unnecessary streetlights. The system assumes that the effective distance for any streetlight to serve a visitor is at most 5 meters. And the testing is for the unit testing of the function $PowerUp()$MR Num:1 -
Context-Sensitive Middleware-Based Applications B
Functionality : A example of a smart delivery system of a supermarket chain such that individual suppliers replenish their products onto pallets, shelves, and cases in various warehouses according to the demand sent off by such pallets. The smart deliver system includes four features: (1)Each smart pallet can be dynamically configured to store a particular kind of product at, as far as possible, a desired quantity level. (2)Each van of a supplier delivers a type of goods. (3)Goods that cannot sell can be returned to the supplier. A smart pallet may request a van to retract certain amount of goods. (4)The system assumes that the effective delivery distance for any pallet by any van is at most 25 metersMR Num:2 -
Testing of Boyer Program
Functionality : The program returns the index of the first occurrence of a specified pattern within a given text.MR Num:18 -
Feature Models
Functionality : Given an FM and its known set of products, a set of neighbour FMs together with their corresponding set of products are automatically generated and used for testing different analyses.MR Num:5 -
Grep:pattern matching
Functionality : Grep is a UNIX command-line utility program written in C, which performs the pattern matching.MR Num:3 -
Monte Carlo Modeling Program
Functionality : The program is used for accurate and efficient modeling of reflectance images from turbid tissue phantoms.MR Num:5 -
Binary Space Partitioning Algorithm
Functionality : Deals with the surface visibility using the BSP tree named BSP tree visible surface (abbreviated as “BSP-treeVS”) algorithm.MR Num:5 -
Association rules algorithm
Functionality : Association rules algorithm in data miningMR Num:7 -
Web Services in WS-BPEL
Functionality : A classical WS-BPEL example of the Loan Approval Service.MR Num:3 -
Banking system
Functionality : The system four modules viz. Deposit module, Withdraw module, Loan module and Fixed Deposit module.And an important activity in banking system is calculation of interest that needs to be correct.MR Num:11 -
Epidemiological Models
Functionality : Models are used to study the potential behavior and impact of disease spread in populations.MR Num:14 -
SeqMap
Functionality : A Short Sequence Mapping Tool in bioinformatics.MR Num:3 -
Print_tokens and Print_tokens2
Functionality : Read a sequence of strings from a file, group these strings into tokens, identify token categories and print out all the tokens and their categories in order.MR Num:3 -
Replace
Functionality : Regular expression matching and substitutions.MR Num:2 -
Schedule and Schedule2
Functionality : These two programs perform priority scheduling,which internally maintain four mutually exclusive job lists:(1) Three priority job-lists $P_1,P_2$ and $P_3$;(2) One blocked job list $P_B$.MR Num:3 -
Ochiai algorithm
Functionality : Ochiai algorithmMR Num:5 -
Web Search Engine
Functionality : A web search engine $S$ takes a set of key words as an input and displays the results containing all the key words.MR Num:2 -
Hill algorithm
Functionality : It encrypts a plaintext, which is usually a sequence of m letters, into a ciphertext that has the same size as the plaintext.MR Num:3 -
RSA algorithm
Functionality : RSA is an important cipher in public key cryptography, and its process involves a public key and a private key.MR Num:1 -
Feature Selection
Functionality : FS aims at reducing the dimensionality of the training sample set, removing irrelevant feature information, so as to increase the learning accuracy and improve result comprehensibility. We will focus on the filter method, which evaluates the relevance of features by studying the intrinsic property of the training data.MR Num:10 -
String Searching
Functionality : String Searching Algorithm like BM,KMP,RK.MR Num:4 -
Minimal Spanning Tree
Functionality : Using Kruskal's Algorithm to find minimal spanning tree.MR Num:5 -
Simulation Mode:gossip propagation
Functionality : A gossip propagation model and simulationMR Num:6 -
Simulation Model:Cloud System
Functionality : Integrates a complete simulation platform for modelling cloud computing systems, with testing methods for checking the correctness of modelled cloud systems.MR Num:3 -
Soundex algorithm for phonetic indexing (SNDX)
Functionality : An algorithm for computing the phonetic soundex code of a given word by collecting its consonants into classes based on the sounding similarity between themMR Num:5 -
Edit distance algorithm
Functionality : It calculates the total minimum number of edit operations that transforms one given string $x$ into another one $y$.MR Num:2 -
Approximate string matching
Functionality : Determines the approximate equality between two strings using 12 different algorithms such as Longest Common Subsequence, and Sørensen-Dice Distance.MR Num:3 -
Parking fee system
Functionality : A parking fee calculation system FEE.MR Num:3 -
ABM
Functionality : Introduce the type of metamorphic properties for ABM.(To demonstrate the process of discovering metamorphic properties for validation, and identifying MR based on those properties, we use a agent-based model of angiogenesis to illustrate it.You can find it by searching ``Angiogenesis model")MR Num:6 -
Angiogenesis model
Functionality : The simulation model studies angiogenesis, the growth of new blood vessels that is crucial for tumors to be able to grow enough to cause problems within their tissue.(This model's MRs are derive accroding to the types of metamorphic properties for ABM.You can find it by searching ``ABM'')MR Num:0 -
Tot_info
Functionality : Given a test case have $n$ tables $T_s=\{t^s_1,t^s_2,\ldots ,t^s_n\}$.For each table $t^s_i \in T_s$,tot_info prints $(info)^s_i,(df)^s_i$ and $q^s_i$,where $(info)^s_i,(df)^s_i$ and $q^s_i$ denote the Kullbacks information measure,the degree of freedom and the possibility density of $\chi^2$ distribution of $t^s_i$,respectively.In addition, tot_info prints $(tot\_info)^s,(tot\_df)^s$ and $(df)^s_i$,respectively,and $q^s$ is the possibility density of $\chi^2$ distribution calculated with $(tot\_info)^s$ and $(tot\_df)^s$MR Num:3 -
MinimizeDFA
Functionality : Transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has minimum number of states based on Hopcroft’s algorithm.MR Num:16