Police/Construction/Turtle/Volleyball-Trevarthan [Neg # 25A]

Roll of B+W scanned; Images of UNF police department making rounds; Campus construction; Turtle; UNF Volleyball practice: Date: undatedhttps://digitalcommons.unf.edu/spinnaker-images/2182/thumbnail.jp

Gym -Omar Rodriguez [Neg #12]

Roll of B+W Film scanned; Images of UNF Arena Construction; Date: Undatedhttps://digitalcommons.unf.edu/spinnaker-images/1996/thumbnail.jp

Graduation [Neg# 3A]

Roll of B+W Film scanned; Images of graduation ceremony with Former UNF President Dr. Adam Herbert and Former Florida Education Commissioner Betty Castor; Date: Undatedhttps://digitalcommons.unf.edu/spinnaker-images/1929/thumbnail.jp

Symphony Club Business Card

Card: New York\u27s Finest and Best Equipped Dining Palace, 115 W. 131 St., New York, New York. Lonnie Hicks, Clarence Garland, Proprietors. Handwritten note, verso: Rev. J. H. [Illegible] 3115 So P. Chic. Undated

Independent Furniture Co. Business Card

Card: Independent Furniture Co., 910-914 Kings Rd., Jacksonville, Florida, G. H. Strayer. Undated. N-13

Lewis Fish Company Business Card

Card: Lewis Fish Company, Mayport, Florida. Handwritten note, verso. Undated

Fast-sparse-spanner: A practical algorithm for constructing low-stretch sparse geometric graphs

When constructing geometric graphs (vertices are points and edges are line segments connecting point pairs) on pointsets, stretch-factor (worst-case detour between any point pair) is often considered a quality metric. A low stretch-factor (a quantity that is usually \u3e 1) guarantees short paths between all vertex pairs. A geometric graph having a stretch-factor of t is known as a t-spanner. Creating low stretch-factor geometric graphs for large pointsets with a low number of edges is an open problem in computational geometry. In this work, we have designed and engineered a new simple and practical (fast and memory-efficient) algorithm named Fast-Sparse-Spanner algorithm for constructing sparse low stretch-factor geometric graphs on large pointsets in the plane. To the best of current knowledge, this is the first practical algorithm capable of constructing fast low stretch-factor graphs on large pointsets with averagedegrees (hence, the number of edges) competitive with that of greedy-spanners, the sparsest known class of Euclidean geometric spanners. To evaluate the implementation in terms of computation speed, memory usage, and quality of output, extensive experiments were performed with synthetic and real-world pointsets, comparing results to Bucketing, the fastest known greedy spanner algorithm for pointsets in the plane, devised by Alewijnse et al. (Algorithmica, 2017). An experiment constructing a 1.1-spanner on a large synthetic pointset with 128K points uniformly distributed within a square demonstrated more than a 41-fold speedup, using roughly a third of the memory of Bucketing, with only a 3% increase in the average-degree of the resulting graph. When run on a pointset with a million points from the same distribution, a 130-fold speedup was observed, with roughly a fourth of the memory usage, and just a 6% increase in average-degree. In terms of diameter, the graphs generated by FastSparse-Spanner outperform greedy-spanners in most cases, exhibiting substantially lower diameter while maintaining near-greedy average-degree. Furthermore, the algorithm can be easily parallelized to take advantage of parallel environments. As a byproduct of this research, Fast-Stretch-Factor was designed and engineered as a practical parallelizable algorithm to measure the stretch-factor of any graph generated by Fast-Sparse-Spanner. Experiments demonstrated that it is significantly faster than the naive Dijkstra-based stretch-factor measurement algorithm. For broader uses and reproducibility of the results obtained, we have shared our code at https://github.com/ghoshanirban/FS

Use of coelomic fluid as a noninvasive indicator of reproductive status in elasmobranchs

Information on reproduction in elasmobranchs is important for the management and conservation of populations. However, the ability to obtain reliable data on elasmobranch reproduction without animal euthanasia is extremely limited. Therefore, there has been a call for nonlethal approaches for identifying reproductive status of elasmobranchs. Although useful, current techniques can be limited with respect to access to equipment and reliability of blood analyses. This study investigates whether a new noninvasive approach, the examination of coelomic fluid (CF), can provide a reliable indicator of reproductive status. CF is fluid that bathes the internal organs of the abdominal cavity, including ovaries, and can be sampled noninvasively through a catheter. Recent studies on CF have demonstrated the presence of yolk platelets in the fluid, a specific indicator of follicular development. This suggests that CF may provide a more detailed representation of reproductive state than other nonlethal approaches, such as plasma hormone levels. Thus, we examined CF collected from bonnethead sharks (Sphyrna tiburo), which serve as model elasmobranchs for this work due to their well-described pattern of reproduction, abundance, and easily accessible coelomic pores. We examined differences in gonadal steroid hormone concentrations and protein content in CF in relation to reproductive stage, as well as in comparison to variations in plasma gonadal steroid concentrations. To understand more about the structure and role of the poorly studied coelomic pore system, we also examined the cellular architecture of these structures in relation to sexual activity

UNF VS JU_ Men\u27s Tennis [Neg# 34]

Roll of B+W Film scanned, UNF VS JU_ Men\u27s Tennis, Unidentified tennis players, Date: Undatedhttps://digitalcommons.unf.edu/spinnaker-images/1507/thumbnail.jp

UNF Men\u27s Tennis (Champs) [Neg# 5]

Roll of B+W Film scanned, UNF Men\u27s Tennis (Champs), Unidentified tennis player, Date: Undatedhttps://digitalcommons.unf.edu/spinnaker-images/1500/thumbnail.jp