Results 1 - 10 of 264

Optimizing Seed Selection for Fuzzing

by Alexandre Rebert, Sang Kil Cha, Thanassis Avgerinos, Jonathan Foote, David Warren, Gustavo Grieco, David Brumley - in Proceedings of the USENIX Security Symposium, 2014
"... Randomly mutating well-formed program inputs or sim-ply fuzzing, is a highly effective and widely used strategy to find bugs in software. Other than showing fuzzers find bugs, there has been little systematic effort in understand-ing the science of how to fuzz properly. In this paper, we focus on ho ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
on how to mathematically formulate and reason about one critical aspect in fuzzing: how best to pick seed files to maximize the total number of bugs found during a fuzz campaign. We design and evaluate six different algorithms using over 650 CPU days on Amazon Elas-tic Compute Cloud (EC2) to provide

jFuzz: A Concolic Whitebox Fuzzer for Java

by Karthick Jayaraman, David Harvison, Vijay Ganesh
"... We present jFuzz, a automatic testing tool for Java programs. jFuzz is a concolic whitebox fuzzer, built on the NASA Java PathFinder, an explicit-state Java model checker, and a framework for developing reliability and analysis tools for Java. Starting from a seed input, jFuzz automatically and syst ..."
Abstract - Cited by 13 (1 self) - Add to MetaCart
We present jFuzz, a automatic testing tool for Java programs. jFuzz is a concolic whitebox fuzzer, built on the NASA Java PathFinder, an explicit-state Java model checker, and a framework for developing reliability and analysis tools for Java. Starting from a seed input, jFuzz automatically

Doc-Start Optimal Seed Solver: Optimizing Seed Selection in Read Mapping

by Hongyi Xin, Richard Zhu, Sunny Nahar, John Emmons, Gennady Pekhimenko, Carl Kingsford, Can Alkan, Onur Mutlu
"... Motivation: Optimizing seed selection is an important problem in read mapping. The number of non-overlapping seeds a mapper selects determines the sensitivity of the mapper while the total frequency of all selected seeds determines the speed of the mapper. Modern seed-and-extend mappers usually sele ..."
Abstract - Add to MetaCart
Motivation: Optimizing seed selection is an important problem in read mapping. The number of non-overlapping seeds a mapper selects determines the sensitivity of the mapper while the total frequency of all selected seeds determines the speed of the mapper. Modern seed-and-extend mappers usually

Fast Isocontouring for Improved Interactivity

by Chandrajit L. Bajaj, Valerio Pascucci, Daniel R. Schikore - In Proceedings of 1996 Symposium on Volume Visualization , 1996
"... We present an isocontouringalgorithm which is near-optimal for real-time interaction and modification of isovalues in large datasets. A preprocessing step selects a subset S of the cells which are considered as seed cells. Given a particular isovalue, all cells in S which intersect the given isocont ..."
Abstract - Cited by 126 (34 self) - Add to MetaCart
We present an isocontouringalgorithm which is near-optimal for real-time interaction and modification of isovalues in large datasets. A preprocessing step selects a subset S of the cells which are considered as seed cells. Given a particular isovalue, all cells in S which intersect the given

Alpha seeding for support vector machines

by Dennis Decoste, Kiri Wagstaff - In International Conference on Knowledge Discovery and Data Mining (KDD-2000 , 2000
"... A key practical obstacle in applying support vector machines to many large-scale data mining tasks is that SVM’s generally scale quadratically (or worse) in the number of examples or support vectors. This complexity is further compounded when a specific SVM training is but one of many, such as in Le ..."
Abstract - Cited by 41 (4 self) - Add to MetaCart
, such as in Leave-One-Out-Cross-Validation (LOOCV) for determining optimal SVM kernel parameters or as in wrapper-based feature selection. In this paper we explore new techniques for reducing the amortized cost of each such SVM training, by seeding successive SVM trainings with the results of previous similar

A MATHEMATICAL APPROACH TO OPTIMIZE SEED SELECTION PROCESS IN PERMACULTURE

by Mamoon Alameen , Mamoon Alameen , Mohammad Abdul-Niby , Tarek Selmi , Sadeq Damrah
"... As a stepping stone towards achieving a concept of resource-independence from artificial and synthesized agricultural materials, an organic gardening approach is followed using seed selection criterion. In this paper, the seed selection will be shown for its importance in maximizing the revenue in ..."
Abstract - Add to MetaCart
As a stepping stone towards achieving a concept of resource-independence from artificial and synthesized agricultural materials, an organic gardening approach is followed using seed selection criterion. In this paper, the seed selection will be shown for its importance in maximizing the revenue

Quick, practical selection of effective seeds for homology search

by Franco P. Preparata, Louxin Zhang, Kwok Pui Choi - JOURNAL OF COMPUTATIONAL BIOLOGY , 2005
"... It has been observed that in homology search gapped seeds have better sensitivity than ungapped ones for the same cost (weight). In this paper, we propose a probability leakage model (a dissipative Markov system) to elucidate the mechanism that confers power to spaced seeds. Based on this model, we ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
identify desirable features of gapped search seeds and formulate an extremely efficient procedure for seed design: it samples from the set of spaced seed exhibiting those features, evaluates their sensitivity, and then selects the best. The sensitivity of the constructed seeds is negligibly less than

On subset seeds for protein alignment

by Mikhail A. Roytberg, Anna Gambin, Laurent Noé, Sławomir Lasota, Eugenia Furletova, Ewa Szczurek, Gregory Kucherov - IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS , 2009
"... We apply the concept of subset seeds proposed in [1] to similarity search in protein sequences. The main question studied is the design of efficient seed alphabets to construct seeds with optimal sensitivity/selectivity trade-offs. We propose several different design methods and use them to construc ..."
Abstract - Cited by 13 (6 self) - Add to MetaCart
We apply the concept of subset seeds proposed in [1] to similarity search in protein sequences. The main question studied is the design of efficient seed alphabets to construct seeds with optimal sensitivity/selectivity trade-offs. We propose several different design methods and use them

Interactive Live-Wire Boundary Extraction

by William A. Barrett, Eric N. Mortensen - Medical Image Analysis , 1997
"... Live-wire segmentation is a new interactive tool for efficient, accurate, and reproducible boundary extraction which requires minimal user input with a mouse. Optimal boundaries are computed and selected at interactive rates as the user moves the mouse starting from a manually specified seed point. ..."
Abstract - Cited by 83 (1 self) - Add to MetaCart
Live-wire segmentation is a new interactive tool for efficient, accurate, and reproducible boundary extraction which requires minimal user input with a mouse. Optimal boundaries are computed and selected at interactive rates as the user moves the mouse starting from a manually specified seed point

Semi Supervised Image Segmentation by Optimal Color Seed Selection using Fast Genetic Algorithm

by L. Sankari
"... Key factors like similarity, proximity, and good Many researchers have mentioned the significance of perceptual grouping and organization in vision and listed various continuation that guide to visual grouping of image. However, even to the present situation, many of the computational factors of per ..."
Abstract - Add to MetaCart
clicks as prior information or certain constraints and then Clustering. In this paper semi supervised clustering using prior information is discussed. The prior information is nothing but selected color seeds using FGA and then EM Clustering. The proposed idea results in better visual appearance and also
Results 1 - 10 of 264