1) it is optional, not required (the ProQuest deposit is required); and
2) it will be available to everyone on the Internet; there is no embargo for dissertations in the UNL DigitalCommons.
Master's candidates: Deposit of your thesis or project is required. (If an embargo, [restricted access] is necessary, you may deposit the thesis at http://digitalcommons.unl.edu/embargotheses/ — but only after getting the prior approval of your department and the Graduate Office; contact Terri Eastin).
All depositors: We try to observe a 24-hour "cooling off" period to give you opportunity to correct those "oops" issues that seem to emerge just after deposit.
Upon deposit, you will immediately receive an email that your submission has been received (and this is what you need to show the Graduate Office).
However, you can still log back in and select Revise and upload a new version with your advisor's name spelled right, or your mother thanked in the Acknowledgments, or whatever you're stressing about.
After about a day, your submission will be "published" or "posted", making it available to the Internet; you will get another email to that effect, and your submission can no longer be changed--by you.
If further changes are needed, these can be made by sending a revised file to the administrator < email@example.com > requesting replacement of the current online version. DO NOT RESUBMIT YOUR THESIS / DISSERTATION. That creates duplicate records, confusion, wasted effort, frustration, sadness, tears, and causes kittens to get sick.
Finally: Congratulations; you are almost there. Click the "Submit your paper or article" link at the bottom of the gray box at left. Follow the instructions. You should be able to copy (Ctrl-C) and paste (Ctrl-V) most fields.
You are the sole author; your advisor is not considered a co-author.
Your institution is "University of Nebraska-Lincoln" (not "at Lincoln" or ", Lincoln"). Do not leave it blank; then the administrator has to fill it in, and he is tempted to make it something silly.
You do not need to repeat your name and title in the Abstract field; just the body of the abstract.
When you reach the question "Was this submission previously published in a journal?", just skip that part.
Be sure to click the "Submit" button at the bottom. Files upload at the rate of about 5 Mb per minute, so if you have an ungodly large file, it may take a bit of time. If your file exceeds 40 Mb, think about reducing its size--there are many ways; Google "reduce pdf file size" to find some.
Okay, get started. That thesis is not going to submit itself.
Advanced Security Analysis for Emergent Software Platforms, Mohannad Alhanahnah
New Algorithms for Large Datasets and Distributions, Sutanu Gayen
Image Processing Algorithms for Elastin Lamellae Inside Cardiovascular Arteries, Mahmoud Habibnezhad
Dimensional Analysis of Robot Software without Developer Annotations, John-Paul W. Ore
A DATA DRIVEN APPROACH TO IDENTIFY JOURNALISTIC 5WS FROM TEXT DOCUMENTS, Venkata Krishna Mohan Sunkara
Distributed Edge Bundling for Large Graphs, Yves Tuyishime
GAINDroid: General Automated Incompatibility Notifier for Android Applications, Bruno Vieira Resende e Silva
Controller Evolution and Divergence: A Software Perspective, Balaji Balasubramaniam
Performance Evaluation of v-eNodeB using Virtualized Radio Resource Management, Sai Keerti Teja Boddepalli
Effectively Enforcing Minimality During Backtrack Search, Daniel J. Geschwender
Optical Wireless Data Center Networks, Abdelbaset S. Hamza
Scheduling in Mapreduce Clusters, Chen He
COST-EFFECTIVE TECHNIQUES FOR CONTINUOUS INTEGRATION TESTING, Jingjing Liang
Application of Cosine Similarity in Bioinformatics, Srikanth Maturu
Scale-Out Algorithm For Apache Storm In SaaS Environment, Ravi Kiran Puttaswamy
A Comprehensive Framework to Replicate Process-Level Concurrency Faults, Supat Rattanasuksun
Speech Emotion Recognition using Convolutional Neural Networks, Somayeh Shahsavarani
Assessing the Quality and Stability of Recommender Systems, David Shriver
Higher-Level Consistencies: Where, When, and How Much, Robert J. Woodward
An Unmanned Aerial System for Prescribed Fires, Evan M. Beachly
Rate based Impact Analysis, Nishant Sharma
Deep Learning and Transfer Learning in the Classification of EEG Signals, Jacob M. Williams
Querying and Visualization of Moving Objects Using Constraint Databases, Semere M. Woldemariam
Autonomous UAVs for Near Earth Environmental Sensing, David J. Anthony
TOWARDS BUILDING AN INTELLIGENT INTEGRATED MULTI-MODE TIME DIARY SURVEY FRAMEWORK, Hariharan Arunachalam
Using Software Testing Techniques to Infer Biological Models, Mikaela Cashman
A ROADMAP TO SAFE AND RELIABLE ENGINEERED BIOLOGICAL NANO-COMMUNICATION NETWORKS, Justin W. Firestone
Why Do Record/Replay Tests of Web Applications Break?, Mouna Hammoudi
Finding DNA Motifs: A Probabilistic Suffix Tree Approach, Abhishek Majumdar
Sonifying Git History, Kevin J. North
OPTIMIZATION OF IRRIGATION DECISION IN CORNSOYWATER, Dharmic Payyala
On Path Consistency for Binary Constraint Satisfaction Problems, Christopher G. Reeson
Power Management in Heterogeneous MapReduce Cluster, Rojee Sunuwar
Improving the Efficiency of CI with Uber-commits, Matias Waterloo
SECURE AND LIGHTWEIGHT HARDWARE AUTHENTICATION USING ISOLATED PHYSICAL UNCLONABLE FUNCTION, Mehrdad Zaker Shahrak
Rectilinear Steiner Tree Construction, Zhiliu Zhang
Dynamic Data Management In A Data Grid Environment, Björn Barrefors
Routing Optimization in Interplanetary Networks, Sara El Alaoui
REMOTE MOBILE SCREEN (RMS): AN APPROACH FOR SECURE BYOD ENVIRONMENTS, Santiago Manuel Gimenez Ocano
Transforming C OpenMP Programs for Verification in CIVL, Michael Rogers
On Problematic Robotic Thresholds, Adam K. Taylor
Enabling Distributed Scientific Computing on the Campus, Derek J. Weitzel
Bandwidth Estimation for Virtual Networks, Ertong Zhang
A COMPARATIVE STUDY OF GENERALIZED ARC-CONSISTENCY ALGORITHMS, Olufikayo S. Adetunji
DNN: A Distributed NameNode Filesystem for Hadoop, Ziling Huang
INVARIANT INFERRING AND MONITORING IN ROBOTIC SYSTEMS, Hengle Jiang
Autonomous Aerial Water Sampling, John-Paul W. Ore