98 research outputs found
Window of Palestine: Performance number 7.
No full textThe "Window of Palestine" episode at Unitec offered a poignant exploration of Palestinian experiences through the lens of architecture, art, and storytelling. Held in the Event Kitchen at Te Puna, this performance transformed the space into a platform for cultural exchange and dialogue. Through a captivating blend of poetry, music, and theatrical elements, the performance illuminated the resilience and struggles of the Palestinian people. Unitec has responded proactively by adopting Te Noho Kotahitanga and welcoming the 'Window of Palestine' performance in the Eid Celebration, demonstrating a commitment to fostering cultural understanding and inclusivity.
ROLES: Sameh Shamout was author director main perfromer and singer & Abigail Spence was co-author
Signatures, rights, networks: Iranian feminism in the transnational sphere
No full textMy dissertation explores how Iranian feminists are mobilizing new discourses and
creating dynamic transnational networks, enabled in part by cyber and print cultures. I
investigate the ways in which Iranian feminist praxis consequently disrupts and reframes
the putative opposition between secularism and Islam, and the multiple binaries
assembled through this opposition—democratic versus authoritarian; liberatory versus
oppressive; egalitarian versus patriarchal; and modern versus backwards. Within a multimethodological and interdisciplinary framework, I examine three sites of Iranian feminist activism. I consider the One Million Signatures Campaign, a grassroots feminist
movement that emerged in Iran in 2006, which utilizes Islamic human rights discourses
and grassroots, democratic practices to engage the state in reforming family law. I also
investigate the transnational network structure of the campaign, reflecting on the
particular praxis offered by campaigners in the Iranian diaspora. Finally, I examine the
writings and reception of Nobel Peace Prize winner Shirin Ebadi. As a Muslim, feminist and human rights activist, Ebadi emphasizes the compatibility of Islam with human
rights, thereby disrupting discourses that counterpoise them. Considered together, these three sites of Iranian feminism destabilize Western hegemony over Iran, consolidated through discourses which pit “superior” liberal democracies over “backward” Islamic nations. This oppositional staging gains purchase through geopolitical relations of power, including some iterations of global feminism,
which deploy neocolonial saving and rescue narratives in the name of women’s human
rights. Concomitantly, transnational feminist theory, which has destabilized the
normative authority of Western hegemony and global feminism, can also often reify the
very power relations it seeks to critique. By emphasizing the dangers, limits, and
dilemmas of transnational feminist work, transnational feminist theory can neglect
critical feminist projects on the ground, effectively writing some women out of history.
My dissertation considers how Iranian feminists in Iran and the diaspora challenge these various modes of epistemic silencing. Through a close examination of the praxis of Iranian feminists, reflected primarily through the narratives of the activists themselves,
my dissertation contributes to feminist theories of agency and helps revitalize
transnational feminist studies.Ph. D.Includes bibliographical referencesIncludes vitaby Catherine Zehra Same
Multiprocessor sparse SVD algorithms and applications
No full textIn this thesis, we develop four numerical methods for computing the singular value decomposition (SVD) of large sparse matrices on a multiprocessor architecture. We particularly consider the SVD of unstructured sparse matrices in which the number of rows may be substantially larger or smaller than the number of columns. On vector machines, considerable progress has been made over the past 10 years in developing robust algorithms for the solution of the sparse symmetric eigenvalue problem using Lanczos (with or without re-orthogonalization) and subspace iteration methods. Our intent is to extend and refine this knowledge for computing the sparse singular value decomposition on a parallel computer. We emphasize Lanczos, block-Lanczos, subspace iteration, and trace minimization methods for determining several of the largest (or smallest) singular triplets (singular values and corresponding left- and right-singular vectors) for sparse matrices arising from certain practical applications. The target architectures for implementations of such methods include the Alliant FX/80 and the Cray-2S/4128. This algorithmic research is particularly motivated by recent information-retrieval techniques in which high-rank approximations to large sparse term-document matrices are needed, and by nonlinear inverse problems arising from seismic reflection tomography applications.Made available in DSpace on 2011-05-07T12:11:32Z (GMT). No. of bitstreams: 2
license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5)
9124383.pdf: 5313211 bytes, checksum: ecc0ac80fa1376a1bd7b9790cbdc300c (MD5)
Previous issue date: 1991Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding ([email protected]) on 2011-05-07T14:37:53Z
Item is restricted indefinitely.Restriction data tranferred 2014-07-01T11:15:39-05:00
Original Data
Group with Access UIUC Users [automated]
Release Date: none
Reason: ETDs are only available to UIUC Users without author permissionETDs are only available to UIUC Users without author permissionU of I Onl
PARASPICE: A parallel direct circuit simulator for shared-memory multiprocessors
No full textA general approach to parallelizing direct method circuit simulation has been developed via novel algorithms. The approach extracts parallel tasks at the algorithmic level for the three most compute-intensive modules: device model evaluation (LOAD), direct solution of sparse linear systems (SOLVE), and local truncation error estimation (TRUNC), which account for at least 95 percent of the total job time. Therefore, it is suitable for a wide range of shared-memory multiprocessors. The implementation of the approach in SPICE2 resulted in a portable parallel direct circuit simulator, PARASPICE. The superior performance of PARASPICE is demonstrated on an eight-CE Alliant FX/80 using a number of benchmark circuits.The success of PARASPICE lies particularly in the SOLVE module, where the solution of a sequence of structurally identical sparse matrices are required. In this dissertation, a class of new algorithms has been systematically developed via a unified model for parallel sparse matrix computation. This model, which explores the parallelism issue in the pivoting schemes, extracts parallel tasks from the solution procedure by exploiting the sparse structure of the matrix. These algorithms have been implemented in DSPACK, a software package for the direct solution of general sparse matrices. Experiments with DSPACK on the Boeing-Harwell collection of benchmark matrices have shown high overall speedup. DSPACK has been successfully used as a workbench to design parallel sparse solvers for circuit simulation.Made available in DSpace on 2011-05-07T11:53:02Z (GMT). No. of bitstreams: 2
license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5)
9026359.pdf: 6667995 bytes, checksum: 08fa58b3ec72f76b16b65cfc32962d3e (MD5)
Previous issue date: 1990Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding ([email protected]) on 2011-05-07T14:33:47Z
Item is restricted indefinitely.Restriction data tranferred 2014-07-01T11:12:37-05:00
Original Data
Group with Access UIUC Users [automated]
Release Date: none
Reason: ETDs are only available to UIUC Users without author permissionETDs are only available to UIUC Users without author permissionU of I Onl
Numerical Study for Progressive Failure of High Rise Stepped Steel Building
No full textAbstract: Progressive collapse of a structure happens when one or more primary members are suddenly lost due to an unfortunate accident such as a gas explosion, bomb attack, fire, or overloaded. Building irregularity is one aspect that might aggravate the damage caused by gradual failure. The progressive failure of high rise stepped frames was investigated using 3-dimensional modelling and the finite element approach in this paper. The steel structure has 30 stories and rigid moment-resisting steel frames. Abaqus software is used to perform nonlinear dynamic analysis in accordance with GSA criteria. The results of Abaqus model are verified with an experimental data and good agreement is achieved. The structural behaviour of the building under sudden column loss was studied in detail using this model for several scenarios of column removal.
Keywords: Progressive failure; Nonlinear dynamic analysis; High rise steel building; Finite element; Column removal.
Title: Numerical Study for Progressive Failure of High Rise Stepped Steel Building
Author: Mohamed Basel Emara, Sameh Moustafa Gaawan, Mahmoud Shahat Mahmoud, Mohamed Mohamed Yahia
International Journal of Civil and Structural Engineering Research
ISSN 2348-7607 (Online)
Vol. 10, Issue 1, April 2022 - September 2022
Page No: 110-118
Research Publish Journals
Website: www.researchpublish.com
Published date: 20-June-2022
DOI: https://doi.org/10.5281/zenodo.6670584
Paper Download Link (Source)
https://www.researchpublish.com/papers/numerical-study-for-progressive-failure-of-high-rise-stepped-steel-buildingInternational Journal of Civil and Structural Engineering Research, ISSN 2348-7607 (Online), Research Publish Journals (Publisher), Website: www.researchpublish.co
Some new results for solving linear systems arising from computational fluid dynamics problems
No full textIn this thesis, we consider the numerical solution of four kinds of linear systems: saddle-point problems, Stokes problems, symmetric systems (positive definite or indefinite), and unsymmetric systems. These systems are related, and all of them arise from the numerical solution of partial differential equations. For saddle-point problems, we introduce a class of expansion methods based on a new solution representation of the general problem. Many difficult computations involved in Uzawa and projection type methods for saddle-point problems are avoided in our approach. For the Stokes problems, by introducing a new variable, we split the linear system into several smaller systems according to its sparse structure. This new variable is then updated so that the split systems eventually produce the solution of the original problem. For symmetric systems that are indefinite and do not have a special sparse structure like saddle-point problems, we propose a class of nested iterative methods to handle them. We study how the convergence rate of the outer iteration is related to the convergence rate of the inner iterations. For symmetric positive definite systems, we propose a class of nested preconditioners and analyze properties of these preconditioners. Some necessary and sufficient conditions for the optimality of these nested preconditioners are established. Finally, for unsymmetric systems, we generalize the concept of spectral equivalence for symmetric positive definite systems to these general systems. We also study some properties of spectrally equivalent matrices and consider their applications for constructing efficient iterative methods.Made available in DSpace on 2011-05-07T14:09:03Z (GMT). No. of bitstreams: 2
license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5)
9236525.pdf: 3694502 bytes, checksum: c7e58fe147f183df843b753f32e789e6 (MD5)
Previous issue date: 1992Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding ([email protected]) on 2011-05-07T15:03:30Z
Item is restricted indefinitely.Restriction data tranferred 2014-07-01T11:30:16-05:00
Original Data
Group with Access UIUC Users [automated]
Release Date: none
Reason: ETDs are only available to UIUC Users without author permissionETDs are only available to UIUC Users without author permissionU of I Onl
Operator splitting methods for the Navier-Stokes equations
No full textThe properties of two algorithms for the solution of the incompressible Navier-Stokes equations are examined. These algorithms are representative of the two prevalent splitting philosophies used to split the Navier-Stokes equations. The properties of the algorithms are determined by Fourier analysis of a model problem. It is shown that splittings resulting in Stokes subproblems have desirable dissipative properties which are lacking in the velocity-pressure splittings.Algorithms for solving subproblems resulting from the splitting of the Navier-Stokes equations are introduced and compared to existing methods. The new methods are based on a splitting of the Stokes matrix and subsequent orthogonal projection of the intermediate velocity onto a divergence free subspace. Algorithms based on several splittings are examined and compared to the conjugate gradient Uzawa algorithm. The split matrix scheme is accelerated by application of a Krylov subspace outer iteration. The accelerated scheme uses the conjugate gradient method if the iteration matrix is symmetric and positive definite and the Gmres algorithm if not. The accelerated scheme performed as well as or better than the Uzawa scheme.The nonlinear subproblem is preconditioned via an approximate Jacobian secant method. In this technique the secant method is accelerated by the application of a nonlinear Krylov method to the nonlinear system of equations which result in the application of Newtons method. The number of function evaluations required to solve the nonlinear system was greatly reduced by the application of the preconditioner.Made available in DSpace on 2011-05-07T13:39:31Z (GMT). No. of bitstreams: 2
license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5)
9236591.pdf: 4055361 bytes, checksum: d33be13e646df193de63b04f19f386b1 (MD5)
Previous issue date: 1992Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding ([email protected]) on 2011-05-07T14:57:33Z
Item is restricted indefinitely.Restriction data tranferred 2014-07-01T11:27:00-05:00
Original Data
Group with Access UIUC Users [automated]
Release Date: none
Reason: ETDs are only available to UIUC Users without author permissionETDs are only available to UIUC Users without author permissionU of I Onl
Author Correction: AGREE-S: AGREE II extension for surgical interventions: appraisal instrument (Surgical Endoscopy, (2022), 36, 8, (5547-5558), 10.1007/s00464-022-09354-z)
No full textThis article was updated to correct Alessandro Montedori’s name. Collaborative authorship: The GAP Consortium: Yasser Sami Abdel Dayem, Luca Bertolaccini, Pablo Alonso- Coello, Elie Akl, Manish Chand, John J. Como, Gert J. de Borst, Salomone Di Saverio, Sameh Emile, Bang Wool Eom, Ramon Gorter, George Hanna, Kaisa Immonen, Quirino Lai, Nicolaas Lumen, Joseph L. Mathew, Alessandro Montendori, Martin Moya, Gianluca Pellino, Alvaro Sanabria, Athanasios Saratzis, Neil Smart, Dimitrios Stefanidis, Giovanni Zaninotto
Author Correction: AGREE-S: AGREE II extension for surgical interventions: appraisal instrument (Surgical Endoscopy, (2022), 36, 8, (5547-5558), 10.1007/s00464-022-09354-z)
No full textThis article was updated to correct Alessandro Montedori’s name. Collaborative authorship: The GAP Consortium: Yasser Sami Abdel Dayem, Luca Bertolaccini, Pablo Alonso- Coello, Elie Akl, Manish Chand, John J. Como, Gert J. de Borst, Salomone Di Saverio, Sameh Emile, Bang Wool Eom, Ramon Gorter, George Hanna, Kaisa Immonen, Quirino Lai, Nicolaas Lumen, Joseph L. Mathew, Alessandro Montendori, Martin Moya, Gianluca Pellino, Alvaro Sanabria, Athanasios Saratzis, Neil Smart, Dimitrios Stefanidis, Giovanni Zaninotto
- …
