1,721,005 research outputs found
Convertible, Nearly Decomposable and Nearly Reducible Matrices
No full textShader, Bryan L.. (1992). Convertible, Nearly Decomposable and Nearly Reducible Matrices. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/1833
Strong hall matrices
No full textBrualdi, Richard A.; Shader, Bryan L.. (1991). Strong hall matrices. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/1797
Tournament matrices with extremal spectral properties
No full textKirkland, Stephen J.; Shader, Bryan L.. (1992). Tournament matrices with extremal spectral properties. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/2143
Combinatorial orthogonality
No full textBeasley, LeRoy B.; Brualdi, Richard A.; Shader, Bryan L.. (1991). Combinatorial orthogonality. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/1795
On Multipartite Tournament Matrices with Constant Team Size
No full textKirkland, Steve; Shader, Bryan L.. (1992). On Multipartite Tournament Matrices with Constant Team Size. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/1803
Conditional sign-solvability
No full textBrualdi, Richard A.; Chavey, Keith L.; Shader, Bryan L.. (1992). Conditional sign-solvability. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/1848
Bipartite graphs and inverse sign patterns of strong sign-nonsingular matrices
No full textBrualdi, Richard A.; Chavey, Keith L.; Shader, Bryan L.. (1993). Bipartite graphs and inverse sign patterns of strong sign-nonsingular matrices. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/2381
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe 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
Set-systems with signed solutions
No full textAbstractQualitative properties of general collections of systems of m linear equations in n unknowns are studied. More precisely, a family Ax=B of systems of linear equations is determined by A=(A1,A2,…,An) where each Ai and B is a nonempty subset of Rm. The family consists of all systems Ax=b̃ where the ith column of A belongs to Ai, and b̃ belongs to B. These general collections include the purely qualitative systems (where each Ai and B is set of all vectors with a given sign pattern), cone-systems (where each Ai and B is a cone in Rm), and interval systems (where each Ai and B is an interval of vectors). We give necessary and sufficient conditions on A and B for the sign patterns of the solutions to Ax=b̃ to be independent of the choice of A and b̃
- …
