2 resultados para Uncertainty Based Online Planning
em QSpace: Queen's University - Canada
Resumo:
This research is an examination into the ways online abuse functions in certain online spaces. By analyzing text-based online abuse against women who are content creators, this research maps how aspects of violence against women offline extends online. This research examines three different explorations into how online abuse against women functions. Chapter two considers what online abuse against women looks like on Twitter as a case study. This chapter contends that online abuse can be understood as an unintentional use of Twitter’s design. Chapter three focuses specifically on the textual descriptions of sexual violence women who are journalists receive online. Chapter four analyzes Gamergate, an online movement that specifically looks to organize online abuse towards women. Chapter five concludes by meditating on the need to look at a bigger picture that includes cultural shifts that dismantle the normalization of violence against women both on and offline.
Resumo:
A scenario-based two-stage stochastic programming model for gas production network planning under uncertainty is usually a large-scale nonconvex mixed-integer nonlinear programme (MINLP), which can be efficiently solved to global optimality with nonconvex generalized Benders decomposition (NGBD). This paper is concerned with the parallelization of NGBD to exploit multiple available computing resources. Three parallelization strategies are proposed, namely, naive scenario parallelization, adaptive scenario parallelization, and adaptive scenario and bounding parallelization. Case study of two industrial natural gas production network planning problems shows that, while the NGBD without parallelization is already faster than a state-of-the-art global optimization solver by an order of magnitude, the parallelization can improve the efficiency by several times on computers with multicore processors. The adaptive scenario and bounding parallelization achieves the best overall performance among the three proposed parallelization strategies.