Jeremy A Hansen

Jeremy A Hansen
  • PhD, Computer Science (UW-Milwaukee, 2009)
  • Professor (Associate) at Noroff University College

About

23
Publications
5,412
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
56
Citations
Current institution
Noroff University College
Current position
  • Professor (Associate)
Additional affiliations
Norwich University
Position
  • Professor (Associate)
July 2010 - June 2016
Norwich University
Position
  • Assistant Professor
July 2016 - present
Norwich University
Position
  • Associate Professor of Computer Science

Publications

Publications (23)
Article
Full-text available
Background: Intracranial neoplasm, often referred to as a brain tumor, is an abnormal growth or mass of tissues in the brain. The complexity of the brain and the associated diagnostic delays cause significant stress for patients. This study aims to enhance the efficiency of MRI analysis for brain tumors using deep transfer learning. Methods: We dev...
Conference Paper
Full-text available
This work introduces a theory of a category of inalienable legal rights of origination which encompasses many currently unconnected rights like privacy, bodily integrity, and publicity. Rights of origination are based on the premise that a natural person has a unique identity that originates in and is inherently tied to their physical body or actio...
Conference Paper
Full-text available
The goal of this survey was to identify a relationship between an individual's role in the equine community (owner, trainer, caretaker, casual rider, and competitive rider) and their attitude about the use of technology in the collection and application of biometric health data and the maintenance of records of the horse's health data. An advertise...
Conference Paper
Full-text available
There is no known general formula to calculate the total number of magic squares of a given order. However, using various methods, the number of magic squares has been calculated for orders smaller than 6. In this work we describe an approach to bounding the computational complexity of enumerating order-6 squares and provide a related method to app...
Conference Paper
Full-text available
This paper introduces and evaluates the Random Pairs voting rule to show that it significantly improves upon the communication complexity of balloting methods requiring complete orderings of candidates while maintaining a high Condorcet efficiency. To this end, Random Pairs is compared to plurality, 2-approval, Borda, and range voting on elections...
Research
Full-text available
(Presented to Vermont Blockchain Study Committee, 29 Sep 2015) In this report, I describe the software protocol popularly referred to as "blockchain" which has attracted much attention for its ability to facilitate electronic contracts and other transactions in a decentralized environment. Section 1 begins with the history of blockchain and relate...
Data
Full-text available
(Presented to Vermont Blockchain Study Committee, 29 Sep 2015)
Article
Full-text available
The recent election of Governor Shumlin has caused many commentators to call for a change in how our statewide officials are elected, but few have challenged the many assumptions built into our system of elections.
Article
Full-text available
Using actual ballots cast in Vermont’s 2014 General Election, this work demonstrates the value of ballot-level analysis in answering a variety of interesting questions, including identifying groups of voters, measuring partisan voting, investigating voter confusion between the Liberty Union and Libertarian parties, and demonstrating that strategic...
Conference Paper
Full-text available
Using Monte Carlo simulations, we compare approval at-large (AAL) voting to plurality at-large (PAL) voting in multi-member districts. While similar simulations have been run to measure the performance of single-winner elections, this work seeks to confirm and extend prior results to multiple-winner elections. We intend this evaluation of approval...
Conference Paper
Full-text available
Neurosecurity focuses on the security of the increasingly intimate coupling of human brains and computers, addressing issues surrounding modern computer security and how they relate to brain-computer interfaces (BCIs). Although several elements of this field are not yet relevant in today’s society, the goal is to examine what can be done to avoid t...
Conference Paper
Full-text available
We propose a high-level framework that extends the notion of opportunistic mesh networking to include opportunistic access to and sharing of other device resources such as nonvolatile data storage and computation. While work has been done on providing opportunistic access to each of these resources (network access, data storage, and computation, th...
Article
Full-text available
Once the domain of science fiction, devices connecting bio-logical systems with computers have become reality. Secu-rity vulnerabilities that might be exploited in such systems by malicious parties or by inadvertent manipulation are also now a reality. Where previous research has described cer-tain categories of attacks against and countermeasures...
Conference Paper
Full-text available
Social networking and e-commerce sites have many mechanisms with which they encourage generation of user content, represent user trust and reputation relationships, and control access to desirable digital resources. Using anonymous electronic cash (or scrip), the proposed system RepScrip provides the preceding three features and adds optional (to t...
Article
Full-text available
Thesis (M.S. in Computer Science)--University of Wisconsin--Milwaukee, 2005. CD-ROM contains 5 C Programming language files (.c) and 3 UNIX shell code files. Includes bibliographical references (leaves 26-27).
Article
Full-text available
Cryptographic hash algorithms are important building blocks in cryptographic protocols, providing authentication and assurance of integrity. While many different hash algorithms are available including MD5, Tiger, and HAVAL, it is difficult to compare them since they do not necessarily use the same techniques to achieve their security goals. This w...
Article
Full-text available
The traditional method for describing cryptographic hash algorithms is to offer two components: the compression function and an iteration scheme. This paper shows that describing cryptographic hash algorithms as being comprised of four components more easily and more accurately illustrates the operation of the algorithm and simplifies analysis. In...

Network

Cited By