332 research outputs found
Sequencing and scheduling for non serial permutation flowshops
No full textMost flowshop problems that have been researched have dealt with serial precedence requirements such that the flowshop has become synonymous with the serial assembly line. However, non-serial precedence requirements can also occur for which the resulting problem is still a type of flowshop. This research addresses in particular, non-serial versions of the three standard flowshop problems, namely the intermediate storage, no-intermediate storage and no-wait flowshop scenarios. The outcomes of this research include a number of new and alternative mathematical formulations for finding the optimal sequence of the products to be processed through the non-serial line. Secondly recurrence equations for scheduling purposes have also been developed
A General Framework for Constructive Meta-heuristics
Get PDFMeta-heuristic search algorithms, by their very nature, are applicable across a range of optimisation problems. In practice however, meta-heuristics have been tailored to solve particular problems. Recent work by Randall and Abramson (2001b)has successfully shown that iterative meta-heuristics, such as simulated annealing and tabu search, can be successfully generalised to solve a range of problems without modification though the use of a uniform representation language. Constructive meta-heuristics, such as ant colony optimisation and generalised random adaptive search procedures, pose more substantial problems to achieve this same level of generalistaion. This paper investigates the issues involved and suggests some measures by which generalisation could be achieved
Working memory capacity: Is there a bilingual advantage?
Get PDFabstract: Previous studies suggest that bilinguals have certain executive function advantages over monolinguals. However, few studies have examined specific working memory (WM) differences between monolinguals and bilinguals using complex span tasks. In the current study, 52 bilingual and 53 monolingual speakers were administered simple and complex WM span tasks, including a backward digit-span task, standard operation span tasks and a non-verbal symmetry span task. WM performance was a strong predictor of performance on other WM tasks, whereas bilingual status was not. Thus, the present study did not find evidence of a bilingual advantage in WM capacity.This is an Author's Accepted Manuscript of an article published as Ratiu, Ileana, & Azuma, Tamiko (2015). Working memory capacity: Is there a bilingual advantage?. JOURNAL OF COGNITIVE PSYCHOLOGY, 27(1), 1-11. DOI: 10.1080/20445911.2014.976226. Copyright Taylor & Francis, available online at: http://www.tandfonline.com/doi/abs/10.1080/20445911.2014.97622
A feminist guide to hacking this tech gatebox "Azuma Hikari"
Get PDFDouglas College student research essay submitted as partial requirement for GSWS 2101: Gender Today (Fall 2021) course. Faculty sponsor to submit this essay to DOOR: Dr. Jill Fellows.
The use of virtual assistants is increasing every day, as a technological tool that is marketed as a necessity to assist in making our modern lives more efficient. These tools are designed to help us with daily tasks such as searching for information, reading emails, writing messages, making calls and scheduling meetings with others. The most popular examples “Siri” or “Alexa” have been created with specific gendered characteristics and behavior as the author points out “virtual assistants are very obviously gendered. Siri and Alexa both have female names”, (Fellows, forthcoming 2022) designed with a personality of submissive and serviceable, as the author mentions “they portray a gender binary dominant-submissive relationship, positioning the user in the dominant position, and they play out subordination as feminine.” (Fellows, forthcoming 2022)Not peer reviewe
Modularity in noncopying term rewriting
No full textAbstractIt is known that termination and completeness are not modular properties of term rewriting systems: the disjoint union of terminating (complete) term rewriting systems need not be terminating (complete). In this paper, we introduce a class of “noncopying” term rewriting systems as a new, term-based formalism for a kind of graph rewriting systems, and prove that this class enjoys the modularity of termination and of completeness. Actually, our results are stronger in the sense that the disjointness condition is relaxed for allowing the systems to share constructors and some defined symbols while preserving the main results
Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs
No full text- …
