Stigmatized Portrayals of Single Women : A Content Analysis of News Coverage on Single Women and Single Men in China

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journal

5 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)197-211
Journal / PublicationJournal of Gender Studies
Volume26
Issue number2
Online published19 Oct 2015
Publication statusPublished - 2017

Abstract

We study the average-case complexity of mm-sum product of matrices, which is a fundamental operation that has many applications in computer science. We focus on optimizing the number of "algebraic" operations (i.e., operations involving real numbers) used in the computation, since such operations are usually expensive in various environments. We present an algorithm that can compute the min-sum product of two n x n real matrices using only O(n(2)) algebraic operations, given that the matrix elements are drawn independently and identically from some fixed probability distribution satisfying several constraints. This improves the previously best known upper-bound of O(n(2) logo). The class of probability distributions under which our algorithm works include many important and commonly used distributions, such as uniform distributions, exponential distributions, folded normal distributions, etc. In order to evaluate the performance of the proposed algorithm, we performed experiments to compare the running time of the proposed algorithm with algorithms in [1]. The experimental results demonstrate that our algorithm achieves significant performance improvement over the previous algorithms. (C) 2015 Elsevier B.V. All rights reserved.