1,982 research outputs found
Darrell and Sharon Kunzler interview
No full textMr. Darrell Kunzler talks about his life-long career in the cattle industry as well as his roles in various organizations and associations. He discusses the year-long ranching cycle, and how he has come to grow his ranch (and is now handing it down to his son). Interviewed by Randy Williams and Bob Parson on October 26, 2011 at the Kunzler home in Benson, Utah. The transcript is provided in both PDF and Word Doc formats, if you encounter difficulty opening the transcript in your browser try loading the other format
Darrell and Sharon Kunzler interview (transcript)
No full textMr. Darrell Kunzler talks about his life-long career in the cattle industry as well as his roles in various organizations and associations. He discusses the year-long ranching cycle, and how he has come to grow his ranch (and is now handing it down to his son). Interviewed by Randy Williams and Bob Parson on October 26, 2011 at the Kunzler home in Benson, Utah. The transcript is provided in both PDF and Word Doc formats, if you encounter difficulty opening the transcript in your browser try loading the other format
Oral history interview with Darrell Stiles and Nancy Chipukites
No full textFourth-generation owners of Cabin Creek Farm, Darrell Stiles and Nancy Stiles Chipukites, discuss the history of the property and the early members of their family that homesteaded the land in 1891 as part of Sac and Fox Land Run. The major crops of the farm at the time of the interview included wheat and rye grass, as well as cattle. For a long time, the farm operated as a dairy, known as Cabin Creek Dairy. Also discussed were the long held traditions of the Stiles family and the future of Cabin Creek Farm.The Oklahoma Centennial Farm Families Collection is comprised of interviews with farm owners and operators whose families have been involved in the farming and/or ranching business in Oklahoma for 100 years or more with properties designated an Oklahoma Centennial Farm or Ranch through the Oklahoma Historical Society
Recommended from our members
Percival: A Reliable, Long-Term, Distributed Storage System Free of Fixed-Key Encryption
No full textSecret splitting has been shown to improve reliability, reduce the risk of insider threat, and remove the issues surrounding key management in distributed long-term datastores. However, to date there has been little or no adoption of this technique in production environments. When it has been implemented, it was done relying on fixed-key encryption for various parts of the system, e.g. during ingestion to maintain user privacy, or pre-indexing to facilitate searching since the inherent security of such a datastore normally precludes it from being directly searched without reassembling the data. Fixed-key encryption, unfortunately, is not well suited for long-term applications due to its introduction of a single point of compromise and failure as well as its key management issues. Furthermore, even if the data remains intact after a long period of time, since standard reconstruction methodologies rely upon external knowledge to perform the reconstruction, they will eventually fail. When they do, information loss is almost certain in applications of sufficient size to make reconstruction combinatorially prohibitive. The most recent method to mitigate this risk has a high runtime, and limits the inherent security of the secret-split datastore.To address the need of a reliable, long-term, distributed storage system free of fixed-key encryption, we propose Percival: a novel system that enables searching a secret-split datastore, maintains information privacy, and does not rely on external information to ensure reconstruction remains feasible. It is built upon the knowledge gained from conducting an in-depth comparison of file migration activity on the mass storage system (MSS) at the National Center for Atmospheric Research (NCAR) during two periods, one in the early 1990s, and another nearly twenty years later. To accommodate real-world user access patterns, Percival allows one to search the secret-split data while both keeping the bulk of the work on each client and the data custodians blinded to both the contents of a query as well as its results. Furthermore, to ensure reconstruction is feasible for even very large secret-split datastores, we also present two novel disaster recovery methods that greatly reduce the number of reconstruction attempts required during reconstruction; this enables recovery of the original data, where previously the data would have been lost
Design Choices for Weak-Consistency Group Communication
No full textThis paper was written using Refdbms. Richard Golding was supported in part by a fellowship from the Santa Cruz Operation, and by the Concurrent Systems Project at Hewlett-Packard Laboratories. Darrell Long was supported in part by the National Science Foundation under grant NSF CCR-9111220 and by the Office of Naval Research under grant N00014-92-J-1807. Reference
Dr Darrell Lewis
No full textNorthern Territory author and anthropologist, Dr Darrell LewisDonated by David Ritchie, 22/06/2016Photographs of the Kenbi Handover 2016, the resolution of the 37 year Kenbi Land Claim over the Cox Peninsula. The handback, presided over by Prime Minister Malcolm Turnbull, took place at Mandorah on 21 June 2016 and was attended by many of the people who had worked on, or been involved in the landclaim processes
Recommended from our members
Techniques for Reducing Long-Term Data Movement on Shingled Magnetic Recording Drives
No full textShingled Magnetic Recording (SMR) is a means of increasing the density of hard drives that brings a new set of challenges. SMR drives increase storage density by overlapping the write tracks (shingling) to be as wide as the read head. Due to the nature of SMR disks, updating in place is not an option. Holes left by invalidated data can only be filled if the entire band is reclaimed, and a poor band compaction algorithm could result in spending a lot of time moving blocks over the lifetime of the device. I propose using write frequency to separate blocks to reduce data movement and provide three band compaction algorithms that implement this heuristic in varying degrees: cold-weight, empty-separation, and separation+cold-weight. I demonstrate that using the techniques from the log-structured file system (LFS) perform worse than the greedy baseline algorithm. I demonstrate how my algorithms provides a reduction in long-term data movement. The cold-weight algorithm results in 1.81 times fewer blocks moved during required data movements when compared to naive approaches to band management. The empty-separation algorithm results in 135 times fewer blocks moved during required data movements compared to the greedy baseline algorithm. The separation+cold-weight algorithm results in moving up to 319 times fewer blocks during required data movements compared to the greedy baseline algorithm
Recommended from our members
Lethe: It Won't Take Long To Forget
No full textModern general data privacy regulations in Europe (GDPR) stipulate that, at a user’s request, data pertaining to them is deleted without undue delay. Existing storage systems are not equipped to provide secure deletion, leaving traces of deleted data for indeterminate periods of time, sometimes on the order of months. Current approaches to secure deletion, overwrite erasure and cryptographic erasure, are also unsatisfactory. Overwrite erasure requires numerous in- place overwrites that are difficult on flash media and negatively impact media lifetime. With cryptographic erasure, secure deletion of data is tied to secure deletion of the encryption key. This quickly becomes a key management problem since enabling fine-grained deletion requires that a key must be maintained for each data block that may be deleted. To address these prob- lems, we propose Lethe, a new system that provides fine-grained secure deletion regardless of storage medium by utilizing keyed hash trees. With keyed hash trees, Lethe is able to drastically reduce the amount of key material that must be stored and forgotten while still providing the necessary amount of keys required for fine-grained secure deletion. The amount of key material that needs to be securely deleted in Lethe does not increase linearly with the amount of data that is to be securely deleted. With Lethe, the fine-grained secure deletion of any amount of data requires only a single key to be securely forgotten
Darrell Posey: an engaged researcher
No full textVisionary scientist (idealistic for some), engaged citizen (activist for others), Darrell Posey (1947-2001) impacted for a long time with his passage in indigenous territory. He had the merit of opening a needed debate on the border between cultures, sciences and development involving the Kayapó Indian to his thoughts and actions. He also allowed them to make their voices heard and to defend their rights on a national and international stage
Darrell Huff and Fifty Years of How to Lie with Statistics
No full textOver the last fifty years, How to Lie with Statistics has sold more copies than any other statistical text. This note explores the factors that contributed to its success and provides biographical sketches of its creators: author Darrell Huff and illustrator Irving Geis
- …
