Segmentation Of Thermographic Images Of Hands Using A Genetic Algorithm, 2010 Portland State University
Segmentation Of Thermographic Images Of Hands Using A Genetic Algorithm, Payel Ghosh, Judith Gold, Melanie Mitchell
Computer Science Faculty Publications and Presentations
This paper presents a new technique for segmenting thermographic images using a genetic algorithm (GA). The individuals of the GA also known as chromosomes consist of a sequence of parameters of a level set function. Each chromosome represents a unique segmenting contour. An initial population of segmenting contours is generated based on the learned variation of the level set parameters from training images. Each segmenting contour (an individual) is evaluated for its fitness based on the texture of the region it encloses. The fittest individuals are allowed to propagate to future generations of the GA run using selection, crossover and ...
Graph-Based Global Illumination, 2010 Brigham Young University - Provo
Graph-Based Global Illumination, Brian C. Ricks
All Theses and Dissertations
The slow render times of global illumination algorithms make them impractical in most commercial and academic settings. We propose a novel framework for calculating the computational complexity of global illumination algorithms and show that no other recent improvements have reduced this complexity. We further show that many algorithms use a tree as their rendering paradigm. We propose a new rendering algorithm, pipe casting, which calculates light paths using a graph instead of a tree. Pipe casting significantly reduces both computational complexity and actual render time of rendering. Using an L2 pixel-wise error comparison, on average our algorithm can render a ...
Categorical Abstract Algebraic Logic: Equivalence Of Closure Systems, 2010 Iowa State University
Categorical Abstract Algebraic Logic: Equivalence Of Closure Systems, George Voutsadakis
Computer Science Technical Reports
In their famous ``Memoirs" monograph, Blok and Pigozzi defined algebraizable deductive systems as those whose consequence relation is equivalent to the algebraic consequence relation associated with a quasivariety of universal algebras. In characterizing this property, they showed that it is equivalent with the existence of an isomorphism between the lattices of theories of the two consequence relations that commutes with inverse substitutions. Thus emerged the prototypical and paradigmatic result relating an equivalence between two consequence relations established by means of syntactic translations and the isomorphism between corresponding lattices of theories. This result was subsequently generalized in various directions. Blok and ...
Quantification Of Artistic Style Through Sparse Coding Analysis In The Drawings Of Pieter Bruegel The Elder, James M. Hughes, Daniel J. Graham, Daniel N. Rockmore
Open Dartmouth: Faculty Open Access Articles
Recently, statistical techniques have been used to assist art historians in the analysis of works of art. We present a novel technique for the quantification of artistic style that utilizes a sparse coding model. Originally developed in vision research, sparse coding models can be trained to represent any image space by maximizing the kurtosis of a representation of an arbitrarily selected image from that space. We apply such an analysis to successfully distinguish a set of authentic drawings by Pieter Bruegel the Elder from another set of well-known Bruegel imitations. We show that our approach, which involves a direct comparison ...
Overseer: A Mobile Context-Aware Collaboration And Task Management System For Disaster Response, 2010 Carnegie Mellon University
Overseer: A Mobile Context-Aware Collaboration And Task Management System For Disaster Response, Faisal B. Luqman, Martin L. Griss
Martin L Griss
Efficient collaboration and task management is challenging in distributed, dynamically-formed organizations such as ad hoc disaster response teams. Ineffective collaboration may result in poor performance and possible loss of life. In this paper, we present an open multi-agent system, called Overseer, that leverages context information in a mobile setting to facilitate collaboration and task allocation for disaster response. We describe our system architecture, deployment, evaluation metrics, challenges and proposed solutions. We also show how mobile context can be used to create dynamic rolebased assignments to support collaboration and effective task management
Lightweight Linear Types In System F°, 2010 University of Pennsylvania
Lightweight Linear Types In System F°, Karl Mazurak, Jianzhou Zhao, Stephan A. Zdancewic
Departmental Papers (CIS)
We present Fo, an extension of System F that uses kinds to distinguish between linear and unrestricted types, simplifying the use of linearity for general-purpose programming. We demonstrate through examples how Fo can elegantly express many useful protocols, and we prove that any protocol representable as a DFA can be encoded as an Fo type. We supply mechanized proofs of Fo's soundness and parametricity properties, along with a nonstandard operational semantics that formalizes common intuitions about linearity and aids in reasoning about protocols.
We compare Fo to other linear systems, noting that the simplicity ...
Ssrn As An Initial Revolution In Academic Knowledge Aggregation And Dissemination, 2010 National Defense University
Ssrn As An Initial Revolution In Academic Knowledge Aggregation And Dissemination, David Bray, Sascha Vitzthum, Benn Konsynski
Within this paper we consider our results of using the Social Science Research Network (SSRN) over a period of 18 months to distribute our working papers to the research community. Our experiences have been quite positive, with SSRN serving as a platform both to inform our colleagues about our research as well as inform us about related research (through email and telephoned conversations of colleagues who discovered our paper on SSRN). We then discuss potential future directions for SSRN to consider, and how SSRN might well represent an initial revolution in 21st century academic knowledge aggregation and dissemination. Our paper ...
Real-Time Heart Model For Implantable Cardiac Device Validation And Verification, 2010 University of Pennsylvania
Real-Time Heart Model For Implantable Cardiac Device Validation And Verification, Zhihao Jiang, Miroslav Pajic, Allison T. Connolly, Sanjay Dixit, Rahul Mangharam
Technical Reports (ESE)
Designing bug-free medical device software is dif- ficult, especially in complex implantable devices that may be used in unanticipated contexts. Safety recalls of pacemakers and implantable cardioverter defibrillators due to firmware problems between 1990 and 2000 affected over 200,000 devices, comprising 41% of the devices recalled and are increasing in frequency. There is currently no formal methodology or open experimental platform to validate and verify the correct operation of medical device software. To this effect, a real-time Virtual Heart Model (VHM) has been developed to model the electrophysiological operation of the functioning (i.e. during normal sinus rhythm) and ...
Enterprise Development Policies And Capacity-Building In Science, Technology And Innovation (Sti)-Response To The Issue Note, 2010 The University of the South Pacific
Enterprise Development Policies And Capacity-Building In Science, Technology And Innovation (Sti)-Response To The Issue Note, Deogratias Harorimana
Dr Deogratias Harorimana
Enterprise Development, Investment and Business Climate are all important for economic growth. But what policies, strategies are needed to make economic growth a reality. The author has followed one of the World's fastest reformer and emerging nation in the Heart of Africa-Rwanda. The paper shares lessons and practical aspects related to building an entrepreneurial population, and building a government which is a facilitator of business climate
Arity-Generic Datatype-Generic Programming, 2010 University of Pennsylvania
Arity-Generic Datatype-Generic Programming, Stephanie Weirich, Chris Casinghino
Departmental Papers (CIS)
Some programs are doubly-generic. For example, map is datatypegeneric in that many different data structures support a mapping operation. A generic programming language like Generic Haskell can use a single definition to generate map for each type. However, map is also arity-generic because it belongs to a family of related operations that differ in the number of arguments. For lists, this family includes repeat, map, zipWith, zipWith3, zipWith4, etc. With dependent types or clever programming, one can unify all of these functions together in a single definition. However, no one has explored the combination of these two forms of genericity ...
A Game Theoretic Approach For Deploying Intrusion Detection Agent, 2010 National Central University
A Game Theoretic Approach For Deploying Intrusion Detection Agent, Cheng-Kuang Wu
The proposed framework applies two game theoretic models for economic deployment of intrusion detection system (IDS). The first scheme models and analyzes the interaction behaviors of between an attacker and intrusion detection agent within a non-cooperative game, and then the security risk value is derived from the mixed strategy Nash equilibrium. The second scheme uses the security risk value to compute the Shapley value of intrusion detection agent under the various threat levels. Therefore, the fair agent allocation creates a minimum set of IDS deployment costs. Numerical examples show that the network administrator can quantitatively evaluate the security risk of ...
Contracts Made Manifest, 2010 University of Pennsylvania
Contracts Made Manifest, Michael Greenberg, Benjamin C. Pierce, Stephanie Weirich
Departmental Papers (CIS)
Since Findler and Felleisen introduced higher-order contracts, many variants have been proposed. Broadly, these fall into two groups: some follow Findler and Felleisen in using latent contracts, purely dynamic checks that are transparent to the type system; others use manifest contracts, where refinement types record the most recent check that has been applied to each value. These two approaches are commonly assumed to be equivalent-different ways of implementing the same idea, one retaining a simple type system, and the other providing more static information. Our goal is to formalize and clarify this folklore understanding.
Our work extends that of Gronski ...
Dependent Types And Program Equivalence, 2010 University of Pennsylvania
Dependent Types And Program Equivalence, Limin Jia, Jianzhou Zhao, Vilhelm Sjoberg, Stephanie Weirich
Departmental Papers (CIS)
The definition of type equivalence is one of the most important design issues for any typed language. In dependently-typed languages, because terms appear in types, this definition must rely on a definition of term equivalence. In that case, decidability of type checking requires decidability for the term equivalence relation.
Almost all dependently-typed languages require this relation to be decidable. Some, such as Coq, Epigram or Agda, do so by employing analyses to force all programs to terminate. Conversely, others, such as DML, ATS, Omega, or Haskell, allow nonterminating computation, but do not allow those terms to appear in types. Instead ...
A Randomized Sublinear Time Parallel Gcd Algorithm For The Erew Pram, 2010 Butler University
A Randomized Sublinear Time Parallel Gcd Algorithm For The Erew Pram, Jonathan P. Sorenson
Jonathan P. Sorenson
We present a randomized parallel algorithm that computes the greatest common divisor of two integers of n bits in length with probability 1−o(1) that takes O(n log logn/ logn) time using O(n6 + ) processors for any > 0 on the EREW PRAM parallel model of computation. The algorithm either gives a correct answer or reports failure. We believe this to be the first randomized sublinear time algorithm on the EREW PRAM for this problem.
A Game Theoretic Framework For Multi-Agent Deployment In Intrusion Detection Systems, 2010 National Central University
A Game Theoretic Framework For Multi-Agent Deployment In Intrusion Detection Systems, Cheng-Kuang Wu
Due to cost considerations there must exist in intrusion detection system, a trade-off between the user’s ease of access and capability of detecting attacks. The proposed framework applies two game theoretic models for economic deployment of intrusion detection agent. The first scheme models and analyzes the interaction behaviors between an attacker and intrusion detection agent within a non-cooperative game, and then the security risk value is derived from the mixed strategy Nash equilibrium. The second scheme uses the security risk value to compute the Shapley value of intrusion detection agent while considering the various threat levels. Therefore, the efficient ...
Automated Software License And Copyright Analysis, 2010 University of Colorado, Boulder
Automated Software License And Copyright Analysis, Adam R. Bates
Computer Science Graduate Theses & Dissertations
The complex interactions of software licensing and intellectual property prove daunting hurdles for many individuals and businesses looking to open source software solutions. The financial reproductions for misusing a piece of open source software is high, and require great attention. Many resources are required to determine a software packages copyright holders and licensing information.
The cost of such an analysis may become too costly to justify the use of the open source solution. The existing tools for analyzing software projects licenses and copyrights are lacking, and much hand vetting is required. If these tool could be improved then free and ...
Design Patterns Go To Hollywood: Teaching Patterns With Multimedia, 2010 California Polytechnic State University - San Luis Obispo
Design Patterns Go To Hollywood: Teaching Patterns With Multimedia, Adam Dukovich, David S. Janzen
David S. Janzen
Studies indicate that understanding the contexts in which design patterns are to be used is one of the most (if not the most) difficult challenge in applying design patterns, yet little research on the topic attempts to solve the problem of better teaching the contexts. This paper discusses a new paradigm through which the teaching of design patterns can be viewed, one which focuses on conceptual examples and contexts as the key elements in teaching design patterns. We created several multimedia learning modules that use this approach and we evaluated the modules by comparing them to other methods of instruction ...
Fddb: A Benchmark For Face Detection In Unconstrained Settings, 2010 University of Massachusetts - Amherst
Fddb: A Benchmark For Face Detection In Unconstrained Settings, Vidit Jain, Erik Learned-Miller
Erik G Learned-Miller
Despite the maturity of face detection research, it re- mains difficult to compare different algorithms for face de- tection. This is partly due to the lack of common evaluation schemes. Also, existing data sets for evaluating face detec- tion algorithms do not capture some aspects of face appear- ances that are manifested in real-world scenarios. In this work, we address both of these issues. We present a new data set of face images with more faces and more accurate annotations for face regions than in previous data sets. We also propose two rigorous and precise methods for evaluat- ing the ...
Adapting Blstm Neural Network Based Keyword Spotting Trained On Modern Data To Historical Documents, 2010 University of Massachusetts - Amherst
Adapting Blstm Neural Network Based Keyword Spotting Trained On Modern Data To Historical Documents, Volkmar Frinken, Andreas Fischer, Horst Bunke, R. Manmatha
Being able to search for words or phrases in historic handwritten documents is of paramount importance when preserving cultural heritage. Storing scanned pages of written text can save the information from degradation, but it does not make the textual information readily available. Automatic keyword spotting systems for handwritten historic documents can fill this gap. However, most such systems have trouble with the great variety of writing styles. It is not uncommon for handwriting processing systems to be built for just a single book. In this paper we show that neural network based keyword spotting systems are flexible enough to be ...
Image Retrieval Using Markov Random Fields And Global Image Features, 2010 University of Massachusetts - Amherst
Image Retrieval Using Markov Random Fields And Global Image Features, Ainhoa Llorente, R. Manmatha, Stefan Rüger
In this paper, we propose a direct image retrieval framework based on Markov Random Fields (MRFs) that exploits the semantic context dependencies of the image. The novelty of our approach lies in the use of different kernels in our non-parametric density estimation together with the utilization of configurations that explore semantic relationships among concepts at the same time as low-level features, instead of just focusing on correlation between image features like in previous formulations. Hence, we introduce several configurations and study which one achieve the best performance. Results are presented for two datasets, the usual benchmark Corel 5k and the ...