Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Web archiving (3)
- Memento (2)
- AFLR (1)
- Advancing front (1)
- Archived web pages (1)
-
- Archives (1)
- Cloud computing (1)
- Curvilinear (1)
- Edge Computing (1)
- Fidelity (1)
- Framework (1)
- High-order (1)
- Homeomorphism (1)
- Intelligent transportation systems (1)
- Internet of vehicles (1)
- Local reconnection (1)
- Memento routing (1)
- MementoMap (1)
- Mesh generation (1)
- Mesh refinement (1)
- Micro-collection (1)
- News (1)
- Parallel data refinement (1)
- Parallel mesh generation (1)
- Query routing (1)
- Seed (1)
- Social media (1)
- Tetrahedralization (1)
- Vehicular ad-hoc networks (1)
- Vehicular cloud (1)
Articles 1 - 6 of 6
Full-Text Articles in Physical Sciences and Mathematics
Parallelization Of The Advancing Front Local Reconnection Mesh Generation Software Using A Pseudo-Constrained Parallel Data Refinement Method, Kevin Mark Garner Jr.
Parallelization Of The Advancing Front Local Reconnection Mesh Generation Software Using A Pseudo-Constrained Parallel Data Refinement Method, Kevin Mark Garner Jr.
Computer Science Theses & Dissertations
Preliminary results of a long-term project entailing the parallelization of an industrial strength sequential mesh generator, called Advancing Front Local Reconnection (AFLR), are presented. AFLR has been under development for the last 25 years at the NSF/ERC center at Mississippi State University. The parallel procedure that is presented is called Pseudo-constrained (PsC) Parallel Data Refinement (PDR) and consists of the following steps: (i) use an octree data-decomposition scheme to divide the original geometry into subdomains (octree leaves), (ii) refine each subdomain with the proper adjustments of its neighbors using the given refinement code, and (iii) combine all subdomain data into …
Mementomap: A Web Archive Profiling Framework For Efficient Memento Routing, Sawood Alam
Mementomap: A Web Archive Profiling Framework For Efficient Memento Routing, Sawood Alam
Computer Science Theses & Dissertations
With the proliferation of public web archives, it is becoming more important to better profile their contents, both to understand their immense holdings as well as to support routing of requests in Memento aggregators. A memento is a past version of a web page and a Memento aggregator is a tool or service that aggregates mementos from many different web archives. To save resources, the Memento aggregator should only poll the archives that are likely to have a copy of the requested Uniform Resource Identifier (URI). Using the Crawler Index (CDX), we generate profiles of the archives that summarize their …
Towards Dynamic Vehicular Clouds, Aida Ghazizadeh
Towards Dynamic Vehicular Clouds, Aida Ghazizadeh
Computer Science Theses & Dissertations
Motivated by the success of the conventional cloud computing, Vehicular Clouds were introduced as a group of vehicles whose corporate computing, sensing, communication, and physical resources can be coordinated and dynamically allocated to authorized users. One of the attributes that set Vehicular Clouds apart from conventional clouds is resource volatility. As vehicles enter and leave the cloud, new computing resources become available while others depart, creating a volatile environment where the task of reasoning about fundamental performance metrics becomes very challenging. The goal of this thesis is to design an architecture and model for a dynamic Vehicular Cloud built on …
Bootstrapping Web Archive Collections From Micro-Collections In Social Media, Alexander C. Nwala
Bootstrapping Web Archive Collections From Micro-Collections In Social Media, Alexander C. Nwala
Computer Science Theses & Dissertations
In a Web plagued by disappearing resources, Web archive collections provide a valuable means of preserving Web resources important to the study of past events. These archived collections start with seed URIs (Uniform Resource Identifiers) hand-selected by curators. Curators produce high quality seeds by removing non-relevant URIs and adding URIs from credible and authoritative sources, but this ability comes at a cost: it is time consuming to collect these seeds. The result of this is a shortage of curators, a lack of Web archive collections for various important news events, and a need for an automatic system for generating seeds. …
Automatic Linear And Curvilinear Mesh Generation Driven By Validity Fidelity And Topological Guarantees, Jing Xu
Computer Science Theses & Dissertations
Image-based geometric modeling and mesh generation play a critical role in computational biology and medicine. In this dissertation, a comprehensive computational framework for both guaranteed quality linear and high-order automatic mesh generation is presented. Starting from segmented images, a quality 2D/3D linear mesh is constructed. The boundary of the constructed mesh is proved to be homeomorphic to the object surface. In addition, a guaranteed dihedral angle bound of up to 19:47o for the output tetrahedra is provided. Moreover, user-specified guaranteed bounds on the distance between the boundaries of the mesh and the boundaries of the materials are allowed. The …
A Framework For Verifying The Fixity Of Archived Web Resources, Mohamed Aturban
A Framework For Verifying The Fixity Of Archived Web Resources, Mohamed Aturban
Computer Science Theses & Dissertations
The number of public and private web archives has increased, and we implicitly trust content delivered by these archives. Fixity is checked to ensure that an archived resource has remained unaltered (i.e., fixed) since the time it was captured. Currently, end users do not have the ability to easily verify the fixity of content preserved in web archives. For instance, if a web page is archived in 1999 and replayed in 2019, how do we know that it has not been tampered with during those 20 years? In order for the users of web archives to verify that archived web …