Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons

Open Access. Powered by Scholars. Published by Universities.®

2018

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 2911 - 2925 of 2925

Full-Text Articles in Computer Sciences

That Seems Made Up: Deep Learning Classifiers For Fiction & Non Fiction Book Reviews, Clement Manger Jan 2018

That Seems Made Up: Deep Learning Classifiers For Fiction & Non Fiction Book Reviews, Clement Manger

Dissertations

The thesis aims to take the first step towards automated extraction of the information found in book reviews, by using machine learning tools to assign a label of fiction or non fiction to the text. The thesis makes use of neural networks and performs experiments around architecture, hyper-parameters and text processing from which an optimized model is produced. The thesis enjoys certain successes; it was possible to match the state of the art achieved by (Kim, 2014) and computation was sped up considerably from the default to the optimized model by 13.8 seconds per 50 steps. Further it is confirmed …


Hollow Core Fiber Based Interferometer For High Temperature (1000 °C) Measurement, Dejun Liu, Qiang Wu, Chao Mei, Jinhui Yuan, Xiangjun Xin, Arun Mallik, Fangfang Wei, Wei Han, Rahul Kumar, Chongxiu Yu, Shengpeng Wan, Xingdao He, Bo Liu, Gang-Ding Peng, Yuliya Semenova, Gerald Farrell Jan 2018

Hollow Core Fiber Based Interferometer For High Temperature (1000 °C) Measurement, Dejun Liu, Qiang Wu, Chao Mei, Jinhui Yuan, Xiangjun Xin, Arun Mallik, Fangfang Wei, Wei Han, Rahul Kumar, Chongxiu Yu, Shengpeng Wan, Xingdao He, Bo Liu, Gang-Ding Peng, Yuliya Semenova, Gerald Farrell

Articles

A simple, cost effective high temperature sensor (up to 1000 °C) based on a hollow core fiber (HCF) structure is reported. It is configured by fusion splicing a short section of HCF with a length of few millimeters between two standard single mode fibers (SMF-28). Due to multiple beam interference introduced by the cladding of the HCF, periodic transmission dips with high spectral extinction ratio and high quality (Q) factor are excited. However, theoretical analysis shows that minor variations of the HCF cladding diameter may result in a significant decrease in the Q factor. Experimental results demonstrate that the position …


A Parallel Mesh Generator In 3d/4d, Kirill Voronin Jan 2018

A Parallel Mesh Generator In 3d/4d, Kirill Voronin

Portland Institute for Computational Science Publications

In the report a parallel mesh generator in 3d/4d is presented. The mesh generator was developed as a part of the research project on space-time discretizations for partial differential equations in the least-squares setting. The generator is capable of constructing meshes for space-time cylinders built on an arbitrary 3d space mesh in parallel. The parallel implementation was created in the form of an extension of the finite element software MFEM. The code is publicly available in the Github repository


Introduction To Data Science: Executive Summary, Liming Wang Jan 2018

Introduction To Data Science: Executive Summary, Liming Wang

TREC Project Briefs

This education project created the curriculum for a new course: Introduction to Data Science for Planners, Engineers, and Scientists. The course helps students and professionals tackle the challenges of processing high volumes of data.


Sensory Seduction And Narrative Pull, Nina Lyons, Matt Smith, Hugh Mccabe Jan 2018

Sensory Seduction And Narrative Pull, Nina Lyons, Matt Smith, Hugh Mccabe

Conference papers

User experience design is a process that has been defined, developed and refined over the last few decades. It is a process of shaping a user's movements through a website or mobile application. It is user-focussed, prioritising utility, ease-of-use and efficiency. It is widely used and has helped advance the way in which users interact with websites and mobile applications, making it far less frustrating. User experience design is a key element in how the internet and mobile technology have become ubiquitous in our daily lives. Given this success, it would seem that continuing to use this process for new …


Privacy In Iot Cloud, Aftab Ahmad, Ravi Mukkamala, Karthik Navuluri Jan 2018

Privacy In Iot Cloud, Aftab Ahmad, Ravi Mukkamala, Karthik Navuluri

Computer Science Faculty Publications

We present a framework for privacy preservation in an information cloud of IoT devices. We contend that privacy provisioning should be located in the user device and must protect the user, the information, and the device from breaches in privacy. We elaborate on how the layered privacy model can ensure such privacy provisioning, and justify the device being the provisioning point instead of the cloud alone. We present the point of view that, due to resource limitations of the IoT devices in general, the privacy preserving measures need to be hard-coded in the device technology. We fall short of suggesting …


Off Topic Memento Toolkit, Shawn M. Jones, Michele C. Weigle, Michael L. Nelson Jan 2018

Off Topic Memento Toolkit, Shawn M. Jones, Michele C. Weigle, Michael L. Nelson

Computer Science Faculty Publications

Web archive collections are created with a particular purpose in mind. A curator selects seeds, or original resources, which are then captured by an archiving system and stored as archived web pages, or mementos. The systems that build web archive collections are often configured to revisit the same original resource multiple times. This is incredibly useful for understanding an unfolding news story or the evolution of an organization. Unfortunately, over time, some of these original resources can go off-topic and no longer suit the purpose for which the collection was originally created. They can go off-topic due to web site …


Unobtrusive And Extensible Archival Replay Banners Using Custom Elements, Sawood Alam, Mat Kelly, Michele C. Weigle, Michael L. Nelson Jan 2018

Unobtrusive And Extensible Archival Replay Banners Using Custom Elements, Sawood Alam, Mat Kelly, Michele C. Weigle, Michael L. Nelson

Computer Science Faculty Publications

We compare and contrast three different ways to implement an archival replay banner. We propose an implementation that utilizes Custom Elements and adds some unique behaviors, not common in existing archival replay systems, to enhance the user experience. Our approach has a minimal user interface footprint and resource overhead while still providing rich interactivity and extended on-demand provenance information about the archived resources.


Quantification Of Twist From The Central Lines Of Β-Strands, Tunazzina Islam, Michael Poteat, Jing He Jan 2018

Quantification Of Twist From The Central Lines Of Β-Strands, Tunazzina Islam, Michael Poteat, Jing He

Computer Science Faculty Publications

Since the discovery of right-handed twist of a β-strand, many studies have been conducted to understand the twist. Given the atomic structure of a protein, twist angles have been defined using atomic positions of the backbone. However, limited study is available to characterize twist when the atomic positions are not available, but the central lines of β-strands are. Recent studies in cryoelectron microscopy show that it is possible to predict the central lines of β-strands from a medium-resolution density map. Accurate measurement of twist angles is important in identification of β-strands from such density maps. We propose an effective method …


Efficient Randomized Algorithms For The Fixed Precision Low Rank Matrix Approximation, Wenjian Yu, Yu Gu, Yaohang Li Jan 2018

Efficient Randomized Algorithms For The Fixed Precision Low Rank Matrix Approximation, Wenjian Yu, Yu Gu, Yaohang Li

Computer Science Faculty Publications

Randomized algorithms for low-rank matrix approximation are investigated, with the emphasis on the fixed-precision problem and computational efficiency for handling large matrices. The algorithms are based on the so-called QB factorization, where Q is an orthonormal matrix. First, a mechanism for calculating the approximation error in the Frobenius norm is proposed, which enables efficient adaptive rank determination for a large and/or sparse matrix. It can be combined with any QB-form factorization algorithm in which B's rows are incrementally generated. Based on the blocked randQB algorithm by Martinsson and Voronin, this results in an algorithm called randQB_EI. Then, we further revise …


205.3 The Many Shapes Of Archive-It, Shawn Jones, Michael L. Nelson, Alexander Nwala, Michele C. Weigle Jan 2018

205.3 The Many Shapes Of Archive-It, Shawn Jones, Michael L. Nelson, Alexander Nwala, Michele C. Weigle

Computer Science Faculty Publications

Web archives, a key area of digital preservation, meet the needs of journalists, social scientists, historians, and government organizations. The use cases for these groups often require that they guide the archiving process themselves, selecting their own original resources, or seeds, and creating their own web archive collections. We focus on the collections within Archive-It, a subscription service started by the Internet Archive in 2005 for the purpose of allowing organizations to create their own collections of archived web pages, or mementos. Understanding these collections could be done via their user-supplied metadata or via text analysis, but the metadata is …


A Survey Of Archival Replay Banners, Sawood Alam, Mat Kelly, Michele C. Weigle, Michael L. Nelson Jan 2018

A Survey Of Archival Replay Banners, Sawood Alam, Mat Kelly, Michele C. Weigle, Michael L. Nelson

Computer Science Faculty Publications

We surveyed various archival systems to compare and contrast different techniques used to implement an archival replay banner. We found that inline plain HTML injection is the most common approach, but prone to style conflicts. Iframe-based banners are also very common and while they do not have style conflicts, they suffer from screen real estate wastage and limited design choices. Custom Elements-based banners are promising, but due to being a new web standard, these are not yet widely deployed.


Swimming In A Sea Of Javascript Or: How I Learned To Stop Worrying And Love High-Fidelity Replay, John A. Berlin, Michael L. Nelson, Michele C. Weigle Jan 2018

Swimming In A Sea Of Javascript Or: How I Learned To Stop Worrying And Love High-Fidelity Replay, John A. Berlin, Michael L. Nelson, Michele C. Weigle

Computer Science Faculty Publications

[First paragraph] Preserving and replaying modern web pages in high-fidelity has become an increasingly difficult task due to the increased usage of JavaScript. Reliance on server-side rewriting alone results in live-leakage and or the inability to replay a page due to the preserved JavaScript performing an action not permissible from the archive. The current state-of-the-art high fidelity archival preservation and replay solutions rely on handcrafted client-side URL rewriting libraries specifically tailored for the archive, namely Webrecoder's and Pywb's wombat.js [12]. Web archives not utilizing client-side rewriting rely on server-side rewriting that misses URLs used in a manner not accounted for …


Client-Assisted Memento Aggregation Using The Prefer Header, Mat Kelly, Sawood Alam, Michael L. Nelson, Michele C. Weigle Jan 2018

Client-Assisted Memento Aggregation Using The Prefer Header, Mat Kelly, Sawood Alam, Michael L. Nelson, Michele C. Weigle

Computer Science Faculty Publications

[First paragraph] Preservation of the Web ensures that future generations have a picture of how the web was. Web archives like Internet Archive's Wayback Machine, WebCite, and archive.is allow individuals to submit URIs to be archived, but the captures they preserve then reside at the archives. Traversing these captures in time as preserved by multiple archive sources (using Memento [8]) provides a more comprehensive picture of the past Web than relying on a single archive. Some content on the Web, such as content behind authentication, may be unsuitable or inaccessible for preservation by these organizations. Furthermore, this content may be …


It Is Hard To Compute Fixity On Archived Web Pages, Mohamed Aturban, Michael L. Nelson, Michele C. Weigle Jan 2018

It Is Hard To Compute Fixity On Archived Web Pages, Mohamed Aturban, Michael L. Nelson, Michele C. Weigle

Computer Science Faculty Publications

[Introduction] Checking fixity in web archives is performed to ensure archived resources, or mementos (denoted by URI-M) have remained unaltered since when they were captured. The final report of the PREMIS Working Group [2] defines information used for fixity as "information used to verify whether an object has been altered in an undocumented or unauthorized way." The common technique for checking fixity is to generate a current hash value (i.e., a message digest or a checksum) for a file using a cryptographic hash function (e.g., SHA-256) and compare it to the hash value generated originally. If they have different hash …