85000 research outputs found
Sort by
RMIT’s AI Venn Outcome Context Method (OCM) Handout
No full textThe AI Venn Outcome Context Method (OCM) Handout has been developed for use in educator development workshops to support educators in designing learning for generative artificial intelligence. The resource provides a visual guide to support educators in determining use cases for artificial intelligence, by helping educators to consider the position artificial intelligence has in relation to a human and the task required to achieve any defined outcome. The handout has been designed to be used with RMIT’s AI Venn Outcome Context Method (OCM) Framework, RMIT’s Artificial Intelligence Assurance of Learning Typology, RMIT's Artificial Intelligence Assurance of Learning Typology Extended Guide and Curriculum Mapping GenAI Handout. </p
The weight of things: Object-oriented mania, citational hoarding and critical-mess literature
No full textThis creativecritical essay investigates the author’s object-oriented mania and her anticipatory relationship to “happy objects” (Ahmed, 2010) through the lens of her obsessive-compulsive disorder, shadowed by memories around inheritance, a family propensity toward hoarding and the empty promise of capitalism under a “regime of crisis ordinariness” (Berlant, 2011). The chaos of the hoard, in which objects congeal rather than circulate, suspends the hoard in a time outside of time, similar to Kristeva’s (1982) chora (Lepselter, 2011). While the hoarder as artist manifests a “poetics of accumulation” (Falkoff, 2021), a writer as hoarder amasses a citational hoard via reference manager. This essay applies Zinman and Reese’s “critical-mess theory” (qtd. in Singer, 2001) to creative writing, arguing that critical mess literature demands a collaged form where one might draw conclusions from patterns made evident by the accumulated, intertextual, polyvocal hoard. It poses citations managers as a modern tool of Lévi-Strauss’s (2021) bricoleur. In “stringing up a narrative” of things (Juckes, 2017), the author puts word-things into place through object recollection, curation and citation, forming an interweb of narrative objects to demonstrate the application of critical mess theory with and through life writing.</p
Creativecritical writing as methodology
No full textThe traditional view of theory as necessarily distinct from creativity has become
increasingly unsatisfactory. In response to such dissatisfaction writers and scholars such
as Maggie Nelson, Christina Sharpe, Michael Taussig, Saidiya Hartman, McKenzie
Wark, Stephen Muecke, Joan Rettalack and others have introduced into the theoretical
field qualities associated with creative writing – including, anecdote, memory, poetics
and play. In doing so they have expanded the boundaries of what counts as theory and
why. In Depression: a public feeling, literary and affect theorist Ann Cvetkovich argues
for her use of memoir as a research methodology. She writes: “While I could have
written a critical essay that analysed the genre [of depression memoirs], the results
seemed rather predictable” (2012, p. 78). This article takes up Cvetkovitch’s desire for
a mode “beyond” the predictable to argue that creativecritical writing might be better
understood as a methodology than as a genre of writing. It claims the most radical aspect
of the creativecritical mode is not so much the refusal of the critical/creative,
nonfiction/fiction, objective/personal binaries, as what the doing of the refusal surfaces
and therefore demands of the writer.</p
Effect of Reflective Practices on Student Learning in Higher Education—A Real Life Approach
No full textValidation of ideas are of paramount importance in STEM fields. Learning and converting ideas into practical application is the main purpose of technical education. Aviation is a highly safety sensitive field where confusion and mistakes are not acceptable. This brings serious challenges for academia that provides higher education in this field. A yearlong observation of the reflective practices was done at an Australian university while teaching aviation students to analyse outcomes of reflection on teaching and learning. Reflection provides a powerful opportunity to a teacher in improving teaching qualities and to identify training needs for enhancing teaching capabilities.</p
A deep learning computational fluid dynamics solver for simulating liquid hydrogen jets
No full textModeling and simulating the sudden depressurization of liquids inside nozzles is a significant challenge because of the plethora of the associated complex phenomena. This pressure drop together with the rapid phase change of the liquid is important characteristics of flash boiling. Computational fluid dynamics (CFD) multiscale simulations of flashing jets usually deploy additional models for modeling heat and mass transfer with long computational times. Intermediate steps such as volumetric meshing in mesh-based methods can also significantly increase the computational cost. This paper aims at providing academia and industry with a modeling tool to simulate and investigate the complex multi-facet phenomenon of flash-boiling atomization deploying a machine-learning method that could save thousand Central Processing Unit hours offering instantaneous CFD predictions. The presented machine-learning CFD method completely replaces the traditional CFD simulations workflow and requires little simulation expertise from the end-user. Notably, this is a novel model that couples for the first time the thermodynamic non-equilibrium with convolutional neural networks to simulate flashing liquid hydrogen jets thousand times faster than the standalone CFD solver. The accuracy of the novel approach is evaluated, demonstrating adequate accuracy compared to different unseen simulations and experiments. This work offers the groundwork for further accelerating CFD predictions in multiphase flow problems and could significantly improve testing flash-boiling scenarios in various industrial settings.</p
Security threats to agricultural artificial intelligence: Position and perspective
No full textIn light of their remarkable predictive capabilities, artificial intelligence (AI) models driven by deep learning (DL) have witnessed widespread adoption in the agriculture sector, contributing to diverse applications such as enhancing crop management and agricultural productivity. Despite their evident benefits, the integration of AI in agriculture brings forth security risks, a concern further exacerbated by the comparatively lower security awareness among agriculture stakeholders. This position paper endeavors to amplify the security consciousness among stakeholders (e.g., end-users such as farmers and governmental bodies) engaged in the implementation of AI systems within the agricultural sector. In our systematic categorization of security threats to AI systems, we delineate three primary avenues of attack: (1) Adversarial Example Attacks, (2) Poisoning Attacks, and (3) Backdoor Attacks. Adversarial example attacks manipulate inputs during the model’s inference phase to induce incorrect predictions. Poisoning attacks corrupt the training data, compromising the model’s availability by indiscriminately degrading its performance on legitimate inputs. Backdoor attacks, typically introduced during the training phase, undermine the model’s integrity, enabling attackers to trigger specific behaviors or outputs through predetermined hidden patterns. An example of compromising AI integrity for malicious purposes is DeepLocker, highlighted by IBM researchers. A detailed examination of attacks in each category is provided, emphasizing their tangible threats to real-world agricultural applications. To illustrate the practical implications, we conduct case studies on specific agricultural applications, focusing on precise irrigation schedules and plant disease detection, utilizing authentic agricultural datasets. Comprehensive countermeasures against each attack type are presented to assist agriculture stakeholders in actively safeguarding their AI applications. Additionally, we address challenges inherent in securing agriculture AI and offer our perspectives on mitigating security threats in this context. This work aims to equip agriculture stakeholders with the knowledge and tools necessary to fortify their AI systems against evolving security challenges. The artifacts of this work are released at https://github.com/garrisongys/Casestudy.</p
A Highly Electrostrictive Salt Cocrystal and the Piezoelectric Nanogenerator Application of Its 3D-Printed Polymer Composite
No full textIonic cocrystals with hydrogen bonding can form exciting materials with enhanced optical and electronic properties. We present a highly moisture-stable ammonium salt cocrystal [CH3C6H4CH(CH3)NH2][CH3C6H4CH(CH3)NH3][PF6] ((p-TEA)(p-TEAH)·PF6) crystallizing in the polar monoclinic C2 space group. The asymmetry in (p-TEA)(p-TEAH)·PF6 was induced by its chiral substituents, while the polar order and structural stability were achieved by using the octahedral PF6- anion and the consequent formation of salt cocrystal. The ferroelectric properties of (p-TEA)(p-TEAH)·PF6 were confirmed through P-E loop measurements. Piezoresponse force microscopy (PFM) enabled the visualization of its domain structure with characteristic “butterfly” and hysteresis loops associated with ferro- and piezoelectric properties. Notably, (p-TEA)(p-TEAH)·PF6 exhibits a large electrostrictive coefficient (Q33) value of 2.02 m4 C-2, higher than those found for ceramic-based materials and comparable to that of polyvinylidene difluoride. Furthermore, the composite films of (p-TEA)(p-TEAH)·PF6 with polycaprolactone (PCL) polymer and its gyroid-shaped 3D-printed composite scaled-up device, 3DP-Gy, were prepared and evaluated for piezoelectric energy-harvesting functionality. A high output voltage of 22.8 V and a power density of 118.5 μW cm-3 have been recorded for the 3DP-Gy device. Remarkably, no loss in voltage outputs was observed for the (p-TEA)(p-TEAH)·PF6 devices even after exposure to 99% relative humidity, showcasing their utility under extremely humid conditions.</p
Digital poesis impulse: A methodology of creative coding with GPT as co-pilot
No full textAny poem can be digitalised, but under what conditions might the poet desire a digital incarnation of their creative output? And for a writer with hobbyist coding skills, might ChatGPT be a suitable partner for creative coding? Faced with three digital poetry commissions and the terror of the blank screen, the author explores questions of poetry and desire, artificial intelligence and authorship, and the tools which enable her digital writing practice. As Irina Paperno (2004) notes, “scholars do not know what to do with diaries” (p. 565). Where the author’s research asks what can be done with journals-as-archives the experimental, multimodal approach of digital poesis breaks open the notion that static containers such as memoir or biography are the best ways into literary archives. The author discovers the coding container as a playful place to enact modes of relationality between text and medium, mother and daughter, archive and archon. Much like Winnicott’s (2005) mother-child play space enables an infant to test the limits of their inner world and external reality, a source-code editor offers unlimited combinatory potential for enacting a relational and material archival response. Through exploring practice-based research, this article tracks the methodology of the three digital poems from ideation to execution and publication, offering exegetical insights along with a detailed accounting of the tools and processes used in the making.</p
A different playbook for the same outcome? Examining Google’s and Meta’s strategic responses to Australia’s News Media Bargaining Code
No full textIn March 2021, Australia enacted the News Media Bargaining Code (NMBC) legislation, which compels Google and Meta to pay for third-party news content on their platforms. To date, Australian newsrooms have made deals with both platforms totalling approximately AUD126.4 million). The 1-year review of the Code has prompted questions about not just the legislation but also the lack of public detail about the deals made between news organisations and the platforms. This article seeks to critically analyse the strategic positions both Google and Facebook took in supporting public interest journalism before and after the introduction of the Code. Using a mixed methodological approach, we find that both platforms differed in their strategic engagement with Australian media organisations before and after the introduction of the NMBC and that the Code, as it stands, risks increasing platform influence in the Australian news market.</p
Efficient Repair of Reed-Solomon Codes
No full textIn this thesis we construct optimal/low repair bandwidth schemes for Reed-Solomon codes both in theoretical and practical scenarios. Our work on improving the repair bandwidth for repairing Reed-Solomon codes can help to speed up the recovery process in data distributed storage systems which is significant for enhancing data security, reducing data storage cost, or ensuring data transmission in the event of hardware failures. The first part of our research (Chapter 4) focuses on the optimal bandwidth repair schemes generated by algebraic constructions, including trace polynomials and subspace polynomials, to repair single and two erasures of full-length Reed-Solomon codes RS(n, k) over coding field . In terms of repairing single erasures, we recall the repair schemes constructed from trace polynomials by Guruswami and Wootters [5, 6], which are the very first proposed schemes for repairing Reed-Solomon codes following the trace repair approach, and providing a convincing illustration for the efficiency of trace repair in repairing Reed-Solomon codes. Next, we review the repair schemes generated from subspace polynomials to repair a failed node of Reed-Solomon codes proposed by Dau and Milenkovich [4, 7] showing the improvement on the range of the codes that can be repaired compared to the trace polynomial repair schemes. The focus then shifts to repair schemes for two erasures generated from subspace polynomials. In this part, we propose one-round repair schemes and multi-round repair schemes for two erasures with two phases (download phase and collaboration phase). The schemes with subspace polynomials offer a significant improvement in repair bandwidth compared to existing methods. More specifically, the subspace polynomial repair schemes can repair each failed node with at most subsymbols in and can obtain this bound with .
The second outcome of our research (Chapter 5) is devoted to repairing Reed-Solomon codes by heuristic algorithms where the repair schemes for Reed-Solomon codes employed in centralized storage systems and decentralized storage systems are proposed. The first goal of this chapter is carrying out a systematic study of Reed-Solomon codes used in centralized storage systems and investigate important aspects of repairing them under the trace repair framework, including which evaluation points to select and how to implement a trace repair scheme efficiently. In particular, we employ different heuristic algorithms to search for lowbandwidth repair schemes for codes of short lengths with typical redundancies and establish three tables of current best repair schemes for (n, k) Reed-Solomon codes over GF (256) with 4 ≤ n ≤ 16 and r = n - k ∈ {2, 3, 4} (Tables 5.1, 5.2, and 5.3). The tables cover most known codes currently used in the centralized-distributed storage industry. The second goal of Chapter 5 is to design compact repair groups that can tolerate as many failures as possible for the Reed-Solomon codes utilized in decentralized storage systems. It turns out that the maximal number of failures can be tolerated equals the size of a minimum hitting set minus one. When the repair groups for each symbol are generated from a single subspace (single seed), we establish a pair of asymptotically tight lower bound and upper bound on the size of such a minimum hitting set. Using Burnside’s Lemma and the Möbius inversion formula, we determine a number of subspaces that together attain the upper bound on the minimum hitting set size when the repair groups are generated from multiple subspaces (multiple seeds).
We consider in Chapter 6, the last part of our research, repairing Reed-Solomon codes in the scenario in which some information of the lost symbol is known (the side information). The side information is represented as a set S of linearly independent combinations of the sub-symbols of the lost symbol. When S = ∅, this reduces to the standard repair problem of repairing a single codeword symbol. When S is a set of sub-symbols of an erased symbol, this becomes the repair problem with partially lost/erased symbol. We first establish that the minimum repair bandwidth depends on |S| and not the content of S and construct a lower bound on the repair bandwidth of a linear repair scheme with side information S. We then consider the well-known subspace-polynomial repair schemes and show that their repair bandwidths can be optimized by choosing the right subspaces. We also demonstrate several parameter regimes where the optimal bandwidths can be achieved for full-length Reed-Solomon codes. In the next part of this chapter, we consider constructing subspaces that can be applied to design the subspace polynomial repair schemes with low/optimal repair bandwidth.</p