120,406 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
Going Beyond Counting First Authors in Author Co-citation Analysis
No full textThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
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
Inquiry into the interlocution of students engaged with mathematics: appreciating links between research and practice
No full textFor either to be useful, links between research and practice are critical. Just as important are connections between the practice of students engaged in mathematical activity and research that seeks to understand that practice. This research report explores lessons that researchers and practitioners can learn from an inquiry into the interlocution of students working collaboratively in small groups when engaged in talking and listening to each other. We use the term interlocution to denote discursive practices of learners in conversational exchanges. Questions that motivate this research included the following. What discursive practices do interlocutors employ as they work collaboratively to understand and resolve mathematical tasks? How do these practices influence the growth of their mathematical ideas? In what ways do their discursive practices help them move from a contextualized, situated task to generalize the task or their solution? Do students' discursive practices assist them to connect and generalize ideas from a new problem to others on which they have worked?Powell, A. B., & Maher, C. A. (2002). Inquiry into the interlocution of students engaged with mathematics: Appreciating links between research and practice. In D.S. Mewborn, P. Sztajn, D.Y. White, H.G. Wiegel, R.L. Bryant & K. Nooney (Eds.), Proceedings of the twenty-fourth annual meeting of the North American Chapter of the International Group for the Psychology of Mathematics Education (Athens, Georgia) (Vol. 1, pp. 317-329). Columbus, OH: ERIC Clearinghouse for Science, Mathematics, and Environmental Education
[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
Dispelling the Myths Behind First-author Citation Counts
No full textWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
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
- …
