Faculty of Science
http://hdl.handle.net/10294/147
2017-07-28T04:44:41Z
2017-07-28T04:44:41Z
Discernibility in the Analysis of Binary Card Sort Data
Hepting, Daryl
http://hdl.handle.net/10294/7263
2017-02-23T09:00:25Z
2013-10-11T00:00:00Z
Discernibility in the Analysis of Binary Card Sort Data
Hepting, Daryl
In an open card sorting study of 356 facial photographs, each of 25 participants created an unconstrained number of piles. We consider all 63,190 possible pairs of photos: if both photos are in the same pile for a participant, we consider them as rated similar; otherwise we consider them as rated dissimilar. Each pair of photos is an attribute in an information system where the participants are the objects. We consider whether the attribute values permit accurate classification of the objects according to binary decision classes, without loss of generality. We propose a discernibility coefficient to measure the support of an attribute for classification according to a given decision class pair. We hypothesize that decision class pairs with the support of many attributes are more representative of the data than those with the support of few attributes. We present some computational experiments and discuss opportunities for future work.
2013-10-11T00:00:00Z
Operationalizing Ethics in Food Choice Decisions
Hepting, Daryl
Jaffe, JoAnn
Maciag, Timothy
http://hdl.handle.net/10294/6892
2016-11-29T07:00:22Z
2014-06-01T00:00:00Z
Operationalizing Ethics in Food Choice Decisions
Hepting, Daryl; Jaffe, JoAnn; Maciag, Timothy
There is a large gap between attitude and action when it comes to consumer purchases of ethical food. Amongst the various aspects of this gap, this paper focuses on the difficulty in knowing enough about the various dimensions of food production, distribution and consumption to make an ethical food purchasing decision. There is neither one universal definition of ethical food. We suggest that it is possible to support consumers in operationalizing their own ethics of food with the use of appropriate information and communication technology. We consider eggs as an example because locally produced options are available to many people on every continent. We consider the dimensions upon which food ethics may be constructed, then discuss the information required to assess it and the tools that can support it. We then present an overview of opportunities for design of a new software tool. Finally, we offer some points for discussion and future work.
2014-06-01T00:00:00Z
The enhanced principal rank characteristic sequence for skew-symmetric matrices
Fallat, Shaun
Olesky, Dale
van den Driessche, Pauline
http://hdl.handle.net/10294/6588
2016-01-29T07:00:19Z
2015-08-15T00:00:00Z
The enhanced principal rank characteristic sequence for skew-symmetric matrices
Fallat, Shaun; Olesky, Dale; van den Driessche, Pauline
The enhanced principal rank characteristic sequence (epr-sequence) was originally defined for an n ×n real symmetric matrix or an n ×n Hermitian matrix. Such a sequence is defined to be l1l2···ln where lk is A,S, or N depending on whether all, some, or none of the matrix principal minors of order k are nonzero. Here we give a complete characterization of the attainable epr-sequences for real skew-symmetric matrices. With the constraint that lk=0 if k is odd, we show that nearly all epr-sequences are attainable by skew-symmetric matrices, which is in contrast to the case of real symmetric or Hermitian matrices for which many epr-sequences are forbidden.
©2015
2015-08-15T00:00:00Z
On the complexity of the positive semidefinite zero forcing number
Meagher, Karen
Fallat, Shaun
Yang, Boting
http://hdl.handle.net/10294/5691
2015-05-13T07:00:25Z
2015-01-01T00:00:00Z
On the complexity of the positive semidefinite zero forcing number
Meagher, Karen; Fallat, Shaun; Yang, Boting
The positive semidefinite zero forcing number of a graph is a graph parameter that arises from a non-traditional type of graph colouring and is related to a more conventional version of zero forcing. We establish a relation between the zero forcing and the fast–mixed searching, which implies some NP-completeness results for the zero forcing problem. Relationships between positive semidefinite zero forcing sets and clique coverings are well-understood for chordal graphs. Building upon constructions associated with optimal tree covers and forest covers, we present a linear time algorithm for computing the positive semidefinite zero forcing number of chordal graphs. We also prove that it is NP-complete to determine whether a graph has a positive semidefinite zero forcing set with an additional property.
2015-01-01T00:00:00Z