Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Digital preservation (3)
- Design (2)
- Search engine caches (2)
- Web archiving (2)
- Ad hoc networks (1)
-
- Assessment tools (1)
- Cache longevity (1)
- Computer communication network (1)
- Computer engineering (1)
- Computerized testing (1)
- Data encryption (Computer science) (1)
- Dynamic coordinate system (1)
- Energy consumption (1)
- General security and protections (1)
- Graph decompositions (1)
- Graph theory (1)
- Human factors (1)
- Hybrid training protocols (1)
- ISTART (1)
- In vivo preservation (1)
- Key management (1)
- Lazy preservation (1)
- Mod_oai (1)
- Modular decomposition (1)
- Multicasting (Computer networks) (1)
- OAI-PMH (1)
- Radar (1)
- Reading comprehension (1)
- Reconstructing websites (1)
- Security (1)
Articles 1 - 10 of 10
Full-Text Articles in Physical Sciences and Mathematics
Factors Affecting Website Reconstruction From The Web Infrastructure, Frank Mccown, Norou Diawara, Michael L. Nelson
Factors Affecting Website Reconstruction From The Web Infrastructure, Frank Mccown, Norou Diawara, Michael L. Nelson
Computer Science Faculty Publications
When a website is suddenly lost without a backup, it may be reconstituted by probing web archives and search engine caches for missing content. In this paper we describe an experiment where we crawled and reconstructed 300 randomly selected websites on a weekly basis for 14 weeks. The reconstructions were performed using our web-repository crawler named Warrick which recovers missing resources from the Web Infrastructure (WI), the collective preservation effort of web archives and search engine caches. We examine several characteristics of the websites over time including birth rate, decay and age of resources. We evaluate the reconstructions when compared …
Providing Vanet Security Through Active Position Detection, Gongjun Yan, Gyanesh Choudhary, Michele C. Weigle, Stephan Olariu
Providing Vanet Security Through Active Position Detection, Gongjun Yan, Gyanesh Choudhary, Michele C. Weigle, Stephan Olariu
Computer Science Faculty Publications
Our main contribution is a novel approach to enhancing position security in VANET. We achieve local and global position security by using the on-board radar to detect neighboring vehicles and to confirm their announced coordinates. We compute cosine similarity among data collected by radar and neighbors' reports to filter the forged data from the truthful data. Based on filtered data, we create a history of vehicle movement. By checking the history and computing similarity, we can prevent a large number of Sybil attacks and some combinations of Sybil and position-based attacks.
Crate: A Simple Model For Self-Describing Web Resources, Joan A. Smith, Michael L. Nelson
Crate: A Simple Model For Self-Describing Web Resources, Joan A. Smith, Michael L. Nelson
Computer Science Faculty Publications
If not for the Internet Archive’s efforts to store periodic snapshots of the web, many sites would not have any preservation prospects at all. The barrier to entry is too high for everyday web sites, which may have skilled webmasters managing them, but which lack skilled archivists to preserve them. Digital preservation is not easy. One problem is the complexity of preservation models, which have specific meta-data and structural requirements. Another problem is the time and effort it takes to properly prepare digital resources for preservation in the chosen model. In this paper, we propose a simple preservation model called …
Istart 2: Improvements For Efficiency And Effectiveness, Irwin B. Levinstein, Chutima Boonthum, Srinivasa P. Pillarisetti, Courtney Bell, Danielle S. Mcnamara
Istart 2: Improvements For Efficiency And Effectiveness, Irwin B. Levinstein, Chutima Boonthum, Srinivasa P. Pillarisetti, Courtney Bell, Danielle S. Mcnamara
Computer Science Faculty Publications
iSTART (interactive strategy training for active reading and thinking) is a Web-based reading strategy trainer that develops students' ability to self-explain difficult text as a means to improving reading comprehension. Its curriculum consists of modules presented interactively by pedagogical agents: an introduction to the basics of using reading strategies in the context of self-explanation, a demonstration of self-explanation, and a practice module in which the trainee generates self-explanations with feedback on the quality of reading strategies contained in the self-explanations. We discuss the objectives that guided the development of the second version of iSTART toward the goals of increased efficiency …
Assessing The Format Of The Presentation Of Text In Developing A Reading Strategy Assessment Tool (R-Sat), Sara Gilliam, Joseph P. Magliano, Keith K. Millis, Irwin Levinstein, Chutima Boonthum
Assessing The Format Of The Presentation Of Text In Developing A Reading Strategy Assessment Tool (R-Sat), Sara Gilliam, Joseph P. Magliano, Keith K. Millis, Irwin Levinstein, Chutima Boonthum
Computer Science Faculty Publications
We are constructing a new computerized test of reading comprehension called the Reading Strategy Assessment Tool (R-SAT). R-SAT elicits and analyzes verbal protocols that readers generate in response to questions as they read texts. We examined whether the amount of information available to the reader when reading and answering questions influenced the extent to which R-SAT accounts for comprehension. We found that R-SAT was most predictive of comprehension when the readers did not have access to the text as they answered questions.
How Much Preservation Do I Get If I Do Absolutely Nothing? Using The Web Infrastructure For Digital Preservation, Martin Klein, Frank Mccown, Joan A. Smith, Michael Nelson
How Much Preservation Do I Get If I Do Absolutely Nothing? Using The Web Infrastructure For Digital Preservation, Martin Klein, Frank Mccown, Joan A. Smith, Michael Nelson
Computer Science Faculty Publications
To date, most of the focus regarding digital preservation has been on removing copies of the resources to be preserved from the “living web” and placing them in an archive for controlled curation. Once inside an archive, the resources are subject to careful processes of refreshing (making additional copies to new media) and migrating (conversion to new formats and applications). For small numbers of resources of known value, this is a practical and worthwhile approach to digital preservation. However, due to the infrastructure costs (storage, networks, machines) and more importantly the human management costs, this approach is unsuitable for web …
Brass: A Queueing Manager For Warrick, Frank Mccown, Amine Benjelloun, Michael L. Nelson
Brass: A Queueing Manager For Warrick, Frank Mccown, Amine Benjelloun, Michael L. Nelson
Computer Science Faculty Publications
When an individual loses their website and a backup can-not be found, they can download and run Warrick, a web-repository crawler which will recover their lost website by crawling the holdings of the Internet Archive and several search engine caches. Running Warrick locally requires some technical know-how, so we have created an on-line queueing system called Brass which simplifies the task of recovering lost websites. We discuss the technical aspects of recon-structing websites and the implementation of Brass. Our newly developed system allows anyone to recover a lost web-site with a few mouse clicks and allows us to track which …
Optimal Layout Of Multicast Groups Using Network Embedded Multicast Security In Ad Hoc Sensor Networks, Richard R. Brooks, Brijesh Pillai, Michele C. Weigle, Matthew Pirretti
Optimal Layout Of Multicast Groups Using Network Embedded Multicast Security In Ad Hoc Sensor Networks, Richard R. Brooks, Brijesh Pillai, Michele C. Weigle, Matthew Pirretti
Computer Science Faculty Publications
This paper considers the security of sensor network applications. Our approach creates multicast regions that use symmetric key cryptography for communications. Each multicast region contains a single keyserver that is used to perform key management and maintain the integrity of a multicast region. Communications between two multicast regions is performed by nodes that belong to both regions. To ease the network management burden, it is desirable for the networks to self-organize into regions and dynamically select their keyservers. This paper shows how to determine the number of keyservers (k) to use and the size in the number of hops (h) …
Hybrid Training With Binary Search Protocol For Wireless Sensor Networks, Ruzana Ishak, Qingwen Xu, Stephan Olariu, Shaharuddin Salleh
Hybrid Training With Binary Search Protocol For Wireless Sensor Networks, Ruzana Ishak, Qingwen Xu, Stephan Olariu, Shaharuddin Salleh
Computer Science Faculty Publications
Locationing problem in Wireless Sensor Networks(WSN) can be viewed as a general distributed sensor problem. It is with sensors that can discover other nodes or estimate ranges between nodes. that serve as position references. In this paper. we show that sensors acquire coarse-grain location awareness by the training protocol. The training protocol which hybrids the synchronization and training procedure. In this protocol, synchronization and training are combined into one scheme. The sink node sends two beacons in each slot instead of one. In the training, sensor searching for its location using a binary search scheme. Our simulation results shown less …
All Minimal Prime Extensions Of Hereditary Classes Of Graphs, Vassilis Giakoumakis, Stephan Olariu
All Minimal Prime Extensions Of Hereditary Classes Of Graphs, Vassilis Giakoumakis, Stephan Olariu
Computer Science Faculty Publications
The substitution composition of two disjoint graphs G1 and G2 is obtained by first removing a vertex x from G2 and then making every vertex in G1 adjacent to all neighbours of x in G2. Let F be a family of graphs defined by a set Z* of forbidden configurations. Giakoumakis [V. Giakoumakis, On the closure of graphs under substitution, Discrete Mathematics 177 (1997) 83–97] proved that F∗, the closure under substitution of F, can be characterized by a set Z∗ of forbidden configurations — the minimal prime extensions of Z. He also …