7,142 research outputs found
[Cleve B. Singleton]
No full textHead-and-shoulders portrait of Cleve B. Singleton, a Denton police officer
Singleton, D B, VX36227
No full textThis record was harvested from a previous catalogue system and will be withdrawn in 2025. Information in this record may be superseded or incomplete. Visit this record in UMA's new catalogue at: https://archives.library.unimelb.edu.au/nodes/view/417158Surname: SINGLETON. Given Name(s) or Initials: D B. Military Service Number or Last Known Location: VX36227. Missing, Wounded and Prisoner of War Enquiry Card Index Number: 46970.239852
Item: [2016.0049.49419] "Singleton, D B, VX36227
Implementation Of Various Types Of Fuzzy Controls On A Mobile Robot Using Sonar Sensors [QA9.64. N438 2008 f rb].
No full textDalam penyelidikan ini, sebuah robot bergerak telah digunakan untuk mengimplementasikan kawalan fuzzy jenis ‘Non-Singleton Type-2’ untuk kawalan pergerakan pengemudian dan tepian dinding dengan bantuan penderia sonar.
In this work, non-singleton type-2 fuzzy control has been implemented on a mobile robot for steering and sidewall movement control with the aid of ultrasonic sensors to compare its performances with the singleton type-2 and type-1 fuzzy control
[Cleve B. Singleton]
No full textHead-and-shoulders portrait of Cleve B. Singleton, a City of Denton police officer. He grew up singing in his father's church and sang at other events. He became a police officer in 1959 and stayed with the Denton until 1963-64 when he and his wife moved to Richardson
A lattice singleton bound
No full textThe binary coding theory and subspace codes for random network coding exhibit similar structures. The method used to obtain a Singleton bound for subspace codes mimic the technique used in obtaining the Singleton bound for binary codes. This motivates the question of whether there is an abstract framework that captures these similarities. As a first step towards answering this question, we use the lattice framework proposed in [1]. A lattice is a partially ordered set in which any two elements have a least upper bound and a greatest lower bound. A `lattice scheme' is defined as a subset of a lattice. In this paper, we derive a Singleton bound for lattice schemes and obtain Singleton bounds known for binary codes and subspace codes as special cases. The lattice framework gives additional insights into the behaviour of Singleton bound for subspace codes. We also obtain a new upper bound on the code size for non-constant dimension codes. The plots of this bound along with plots of the code sizes of known non-constant dimension codes in the literature reveal that our bound is tight for certain parameters of the code
Patricia Singleton-Young, oral history interview
No full textAn actively involved Coastal student, Singleton-Young began (and ended) her 35+-year professional career at Coastal in a variety of student services areas, including Greek life, career services and financial aid. She was the first African-American Director of Student Activities (and later Multi-cultural Student Services) at Coastal. Beloved by students, her personal approach to caring for students gained her a lasting reputation for Feeling the Teal . In 2019, a residence hall was named in her honor.https://digitalcommons.coastal.edu/oral-history-project/1006/thumbnail.jp
A Lattice Singleton Bound
No full textThe binary coding theory and subspace codes for random network coding exhibit similar structures. The method used to obtain a Singleton bound for subspace codes mimic the technique used in obtaining the Singleton bound for binary codes. This motivates the question of whether there is an abstract framework that captures these similarities. As a first step towards answering this question, we use the lattice framework proposed in 1]. A lattice is a partially ordered set in which any two elements have a least upper bound and a greatest lower bound. A `lattice scheme' is defined as a subset of a lattice. In this paper, we derive a Singleton bound for lattice schemes and obtain Singleton bounds known for binary codes and subspace codes as special cases. The lattice framework gives additional insights into the behaviour of Singleton bound for subspace codes. We also obtain a new upper bound on the code size for non-constant dimension codes. The plots of this bound along with plots of the code sizes of known non-constant dimension codes in the literature reveal that our bound is tight for certain parameters of the code
LSB - Live and Safe B: Alternative semantics for Event B
No full textWe define two lifted, total relation semantics for Event B machines: Safe B for safety-only properties and Live B for liveness properties. The usual Event B proof obligations, Safe, are sufficient to establish Safe B refinement. Satisfying Safe plus a simple additional proof obligation ACT REF is sufficient to establish Live B refinement. The use of lifted, total relations both prevents the ambiguity of the unlifted relational semantics and prevents operations being clairvoyant
State- and event-based refinement
No full textIn this paper we give simple example abstract data types, with atomic operations, that are related by data refinement under a definition used widely in the literature, but these abstract data types are not related by singleton failure refinement. This contradicts results found in the literature. Further we show that a common way to change a model of atomic operations to one of value passing operations actually changes the underlying atomic operational semantics
Singleton Packing Employees at a Party, B
No full textSingleton Packing employees sit at a table during a party.https://digitalcommons.usf.edu/gandy_commercial/10379/thumbnail.jp
- …
