Intraocular lenses (IOLs) provide distance and near refraction and are becoming the standard for cataract surgery. Multifocal glasses increase the variability of toe clearance in older adults navigating stairs and increase fall risk; however, little is known about the biomechanics of stair navigation in individuals with multifocal IOLs. This study compared clearance while ascending and descending stairs in individuals with monofocal versus multifocal IOLs. Eight participants with multifocal IOLs (4 men, 4 women; mean age = 66.5 yr, standard deviation [SD] = 6.26) and fifteen male participants with monofocal IOLs (mean age = 69.9 yr, SD = 6.9) underwent vision and mobility testing. Motion analysis recorded kinematic and custom software-calculated clearances in three-dimensional space. No significant differences were found between groups on minimum clearance or variability. Clearance differed for ascending versus descending stairs: the first step onto the stair had the greatest toe clearance during ascent, whereas the final step to the floor had the greatest heel clearance during descent. This preliminary study indicates that multifocal IOLs have similar biomechanic characteristics to monofocal IOLs. Given that step characteristics are related to fall risk, we can speculate that multifocal IOLs carry no additional fall risk.

Estudamos a otimização do método SOR clássico, para a resolução de um sistema linear Ax = b, com A não-singular, a partir dos resultados de Young [55, 57] e Varga [50, 51] para matrizes de blocos p-cíclicas consistentemente ordenadas. Num primeiro nível, a otimização refere-se à escolha do parâmetro de relaxação do SOR que produz a maior velocidade de convergência, e, num segundo nível, à escolha da p-ciclicidade que apresenta o melhor desempenho com os valores ótimos do parâmetro, e damos ênfase ao caso 2-cíclico. Além disso, descrevemos a otimização do parâmetro em três generalizações: a) num relaxamento das condições sobre o espectro da matriz de Jacobi associada a A; b) no método SOR para matrizes singulares; c) num novo método SOR, que substitui a decomposição A = D - L - U, onde D, L e U são a diagonal de A, a parte triangular inferior estrita de A e a parte triangular superior estrita de A, pela A = D - P - Q, onde P pertence a uma classe de matrizes constru ída a partir das matrizes-escada. Descrevemos também a aplicação do caso singular às cadeias de Markov, comentamos a computação paralela aplicada ao SOR, e apresentamos diversas simulações relativas à otimização desse método. / We study the optimization of the classic SOR method for solving a linear system Ax = b, where A is a nonsingular p-cyclic consistently ordered block matrix, based on the discoveries of Young [55, 57] and Varga [50, 51]. In a first levei, the optimization refers to the choice of the SOR relaxation parameter, which produces the greatest convergence speed and, in a second levei, to the p-cyclicity that presents the best performance with the optimal parameter values and emphasize the 2- cyclic case. Moreover we describe three SOR generalizations concerning optimization: a) by weakening the conditions on the spectrum of Jacobi matrix associated with A; b) by considering the SOR method for singular matrices; c) by approaching a new SOR, that replaces the splitting A = D - L - U, where O, L and U are the diagonal of A, the strict lower triangular part of A and the strict upper triangular part of A. respectively, by this one A = D - P - Q, where P is a stair matrix or a matrix even more general than a stair matrix. We also describe the application of the singular case to Markov chains, discuss parallel computing applied to SOR method, and present severa! simulations regarding the optimization of that method.

Estudamos a otimização do método SOR clássico, para a resolução de um sistema linear Ax = b, com A não-singular, a partir dos resultados de Young [55, 57] e Varga [50, 51] para matrizes de blocos p-cíclicas consistentemente ordenadas. Num primeiro nível, a otimização refere-se à escolha do parâmetro de relaxação do SOR que produz a maior velocidade de convergência, e, num segundo nível, à escolha da p-ciclicidade que apresenta o melhor desempenho com os valores ótimos do parâmetro, e damos ênfase ao caso 2-cíclico. Além disso, descrevemos a otimização do parâmetro em três generalizações: a) num relaxamento das condições sobre o espectro da matriz de Jacobi associada a A; b) no método SOR para matrizes singulares; c) num novo método SOR, que substitui a decomposição A = D - L - U, onde D, L e U são a diagonal de A, a parte triangular inferior estrita de A e a parte triangular superior estrita de A, pela A = D - P - Q, onde P pertence a uma classe de matrizes constru ída a partir das matrizes-escada. Descrevemos também a aplicação do caso singular às cadeias de Markov, comentamos a computação paralela aplicada ao SOR, e apresentamos diversas simulações relativas à otimização desse método. / We study the optimization of the classic SOR method for solving a linear system Ax = b, where A is a nonsingular p-cyclic consistently ordered block matrix, based on the discoveries of Young [55, 57] and Varga [50, 51]. In a first levei, the optimization refers to the choice of the SOR relaxation parameter, which produces the greatest convergence speed and, in a second levei, to the p-cyclicity that presents the best performance with the optimal parameter values and emphasize the 2- cyclic case. Moreover we describe three SOR generalizations concerning optimization: a) by weakening the conditions on the spectrum of Jacobi matrix associated with A; b) by considering the SOR method for singular matrices; c) by approaching a new SOR, that replaces the splitting A = D - L - U, where O, L and U are the diagonal of A, the strict lower triangular part of A and the strict upper triangular part of A. respectively, by this one A = D - P - Q, where P is a stair matrix or a matrix even more general than a stair matrix. We also describe the application of the singular case to Markov chains, discuss parallel computing applied to SOR method, and present severa! simulations regarding the optimization of that method.

Estudamos a otimização do método SOR clássico, para a resolução de um sistema linear Ax = b, com A não-singular, a partir dos resultados de Young [55, 57] e Varga [50, 51] para matrizes de blocos p-cíclicas consistentemente ordenadas. Num primeiro nível, a otimização refere-se à escolha do parâmetro de relaxação do SOR que produz a maior velocidade de convergência, e, num segundo nível, à escolha da p-ciclicidade que apresenta o melhor desempenho com os valores ótimos do parâmetro, e damos ênfase ao caso 2-cíclico. Além disso, descrevemos a otimização do parâmetro em três generalizações: a) num relaxamento das condições sobre o espectro da matriz de Jacobi associada a A; b) no método SOR para matrizes singulares; c) num novo método SOR, que substitui a decomposição A = D - L - U, onde D, L e U são a diagonal de A, a parte triangular inferior estrita de A e a parte triangular superior estrita de A, pela A = D - P - Q, onde P pertence a uma classe de matrizes constru ída a partir das matrizes-escada. Descrevemos também a aplicação do caso singular às cadeias de Markov, comentamos a computação paralela aplicada ao SOR, e apresentamos diversas simulações relativas à otimização desse método. / We study the optimization of the classic SOR method for solving a linear system Ax = b, where A is a nonsingular p-cyclic consistently ordered block matrix, based on the discoveries of Young [55, 57] and Varga [50, 51]. In a first levei, the optimization refers to the choice of the SOR relaxation parameter, which produces the greatest convergence speed and, in a second levei, to the p-cyclicity that presents the best performance with the optimal parameter values and emphasize the 2- cyclic case. Moreover we describe three SOR generalizations concerning optimization: a) by weakening the conditions on the spectrum of Jacobi matrix associated with A; b) by considering the SOR method for singular matrices; c) by approaching a new SOR, that replaces the splitting A = D - L - U, where O, L and U are the diagonal of A, the strict lower triangular part of A and the strict upper triangular part of A. respectively, by this one A = D - P - Q, where P is a stair matrix or a matrix even more general than a stair matrix. We also describe the application of the singular case to Markov chains, discuss parallel computing applied to SOR method, and present severa! simulations regarding the optimization of that method.

This thesis explores an alternate typology for a residential high rise in the Hudson Square neighborhood in Manhattan. The units that make up the building are organized with stairs and corridors placed along the interior perimeter of the unit which both bound the central floor space and expose it, creating a layered vertical circulation space around a central, permeable core. The collective organization of units within the building recapitulate their interior organization to form the building object creating a whole that is governed by the same organizational rules as the parts. The building is created as an object in the city meant to frame the duality between transparency and reflection, between lines and surfaces and ultimately between exhibition and anonymity. / Master of Architecture

Diploma thesis is focused on the construction of a two-storey, partly basement, family reinforced concrete house. The ARCHICAD 22 program was used to design this object, the SCIA 21.0 program was used for the model and the subsequent calculation of internal forces. In addition to the static calculation, the work includes reinforcement drawings and drawings of the shape of selected monolithic parts made in AutoCAD 2021. Reinforced concrete elements are assessed in accordance with ČSN EN 1992-1-1.

No description available.

The project deals with the lower part of the construction of a residential building. The parking spaces are situated in three underground floors. The five floors occur in the over-ground part of the building. The building is based on the secant walls of Milan around the perimeter. Internal walls and columns are supported with micropiles. In this project are designed base plate, external walls and stairs. Static system and the calculation of the internal forces was carried out in Scia Engineer 2012 Student version.

This diploma thesis deal with of the design of selected parts of a monolithic reinforced concrete building. Static solution includes an assessment of slab in local supports, calculation of columns, beam, stair and footing. The building will be used as an multifunctional building. In this thesis was developed a static calculation, reinforcement drawings and shape drawings.

The aim of the diploma thesis is static solution of selected parts of the residental house with formwork drawings and reinforcement drawings of designed structures included. Project describes the design and assessment of the monolitic slab structure, precast stair flights, basement loadbearing wall and retaining wall. For calculation of the internal forces was used software Scia Engineer.