877 resultados para Geometric Brownian Motion
Resumo:
The mechanisms of speech production are complex and have been raising attention from researchers of both medical and computer vision fields. In the speech production mechanism, the articulator’s study is a complex issue, since they have a high level of freedom along this process, namely the tongue, which instigates a problem in its control and observation. In this work it is automatically characterized the tongues shape during the articulation of the oral vowels of Portuguese European by using statistical modeling on MR-images. A point distribution model is built from a set of images collected during artificially sustained articulations of Portuguese European sounds, which can extract the main characteristics of the motion of the tongue. The model built in this work allows under standing more clearly the dynamic speech events involved during sustained articulations. The tongue shape model built can also be useful for speech rehabilitation purposes, specifically to recognize the compensatory movements of the articulators during speech production.
Resumo:
Purpose - To verify the results of a diaphragmatic breathing technique (DBT) on diaphragmatic range of motion in healthy subjects. Methods - A total of 51 healthy subjects (10 male; 41 female), mean age 20 years old and a body mass index (BMI) ranging from 15.6 to 34.9 kg/m2, were enrolled in this study. Diaphragmatic range of motion was assessed by M-mode ultrasound imaging. Measurements were made before and after the DBT implementation in a standard protocol, based on 3 seconds of inspiration starting from a maximum expiration. Differences between assessments were analyzed by descriptive statistics and t-test (p < 0.05). Results - Mean value range of motion before DBT was 55.3 ± 13.4 mm and after DBT was 63.8 ± 13.2 mm showing a significant improvement of 8.5 ± 14.7 mm (p < 0.001). A strong correlation between the slope and the range of motion was found (r = 0.71, p < 0.001). Conclusions - Based on ultrasound measurements, it has been proved that DBT really contributes to a higher diaphragmatic range of motion. Future studies are needed in order to understand the influence of protocol parameters (e.g. inspiration time). Clinical implications - In the contest of evidence-based practice in physiotherapy, it has been showed by objective measurements that DBT improves the diaphragm range of motion, translating into a more efficient ventilatory function and thus can be used in clinical setting. To our knowledge this is the first study to assess the effects of DBT on range of motion of diaphragm muscle with ultrasound imaging.
Resumo:
Objective: The purpose of this study was to investigate effects of different manual techniques on cervical ranges of 17 motion and pressure pain sensitivity in subjects with latent trigger point of the upper trapezius muscle. 18 Methods: One hundred seventeen volunteers, with a unilateral latent trigger point on upper trapezius due to computer 19 work, were randomly divided into 5 groups: ischemic compression (IC) group (n = 24); passive stretching group (n = 20 23); muscle energy technique group (n = 23); and 2 control groups, wait-and-see group (n = 25) and placebo group 21 (n = 22). Cervical spine range of movement was measured using a cervical range of motion instrument as well as 22 pressure pain sensitivity by means of an algometer and a visual analog scale. Outcomes were assessed pretreatment, 23 immediately, and 24 hours after the intervention and 1 week later by a blind researcher. A 4 × 5 mixed repeated- 24 measures analysis of variance was used to examine the effects of the intervention and Cohen d coefficient was used. 25 Results: A group-by-time interaction was detected in all variables (P b .01), except contralateral rotation. The 26 immediate effect sizes of the contralateral flexion, ipsilateral rotation, and pressure pain threshold were large for 3 27 experimental groups. Nevertheless, after 24 hours and 1 week, only IC group maintained the effect size. 28 Conclusions: Manual techniques on upper trapezius with latent trigger point seemed to improve the cervical range of 29 motion and the pressure pain sensitivity. These effects persist after 1 week in the IC group. (J Manipulative Physiol 301 Ther 2013;xx:1-10)
Resumo:
Kinematic redundancy occurs when a manipulator possesses more degrees of freedom than those required to execute a given task. Several kinematic techniques for redundant manipulators control the gripper through the pseudo-inverse of the Jacobian, but lead to a kind of chaotic inner motion with unpredictable arm configurations. Such algorithms are not easy to adapt to optimization schemes and, moreover, often there are multiple optimization objectives that can conflict between them. Unlike single optimization, where one attempts to find the best solution, in multi-objective optimization there is no single solution that is optimum with respect to all indices. Therefore, trajectory planning of redundant robots remains an important area of research and more efficient optimization algorithms are needed. This paper presents a new technique to solve the inverse kinematics of redundant manipulators, using a multi-objective genetic algorithm. This scheme combines the closed-loop pseudo-inverse method with a multi-objective genetic algorithm to control the joint positions. Simulations for manipulators with three or four rotational joints, considering the optimization of two objectives in a workspace without and with obstacles are developed. The results reveal that it is possible to choose several solutions from the Pareto optimal front according to the importance of each individual objective.
Resumo:
Diaphragm is the principal inspiratory muscle. Different techniques have been used to assess diaphragm motion. Among them, M-mode ultrasound has gain particular interest since it is non-invasive and accessible. However it is operator-dependent and no objective acquisition protocol has been established. Purpose: to establish a reliable method for the assessment of the diaphragmatic motion via the M-mode ultrasound.
Resumo:
Dynamical systems theory is used here as a theoretical language and tool to design a distributed control architecture for a team of two mobile robots that must transport a long object and simultaneously avoid obstacles. In this approach the level of modeling is at the level of behaviors. A “dynamics” of behavior is defined over a state space of behavioral variables (heading direction and path velocity). The environment is also modeled in these terms by representing task constraints as attractors (i.e. asymptotically stable states) or reppelers (i.e. unstable states) of behavioral dynamics. For each robot attractors and repellers are combined into a vector field that governs the behavior. The resulting dynamical systems that generate the behavior of the robots may be nonlinear. By design the systems are tuned so that the behavioral variables are always very close to one attractor. Thus the behavior of each robot is controled by a time series of asymptotically stable states. Computer simulations support the validity of our dynamic model architectures.
Resumo:
The trajectory planning of redundant robots through the pseudoinverse control leads to undesirable drift in the joint space. This paper presents a new technique to solve the inverse kinematics problem of redundant manipulators, which uses a fractional differential of order α to control the joint positions. Two performance measures are defined to examine the strength and weakness of the proposed method. The positional error index measures the precision of the manipulator's end-effector at the target position. The repeatability performance index is adopted to evaluate if the joint positions are repetitive when the manipulator execute repetitive trajectories in the operational workspace. Redundant and hyper-redundant planar manipulators reveal that it is possible to choose in a large range of possible values of α in order to get repetitive trajectories in the joint space.
Resumo:
The trajectory planning of redundant robots is an important area of research and efficient optimization algorithms are needed. The pseudoinverse control is not repeatable, causing drift in joint space which is undesirable for physical control. This paper presents a new technique that combines the closed-loop pseudoinverse method with genetic algorithms, leading to an optimization criterion for repeatable control of redundant manipulators, and avoiding the joint angle drift problem. Computer simulations performed based on redundant and hyper-redundant planar manipulators show that, when the end-effector traces a closed path in the workspace, the robot returns to its initial configuration. The solution is repeatable for a workspace with and without obstacles in the sense that, after executing several cycles, the initial and final states of the manipulator are very close.
Resumo:
Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do grau de Mestre em Engenharia Biomédica. A presente dissertação foi desenvolvida no Erasmus Medical Center em Roterdão, Holanda
Resumo:
Motor dysfunction is consistently reported but understudied in schizophrenia. It has been hypothesized that this abnormality may reflect a neuro-developmental disorder underlying this illness. The main goal of this study was to analyze movement patterns used by participants with schizophrenia and healthy controls during overarm throwing performance, using a markerless motion capture system. Thirteen schizophrenia patients and 16 healthy control patients performed the overarm throwing task in a markerless motion capture system. Participants were also examined for the presence of motor neurological soft signs (mNSS) using the Brief Motor Scale. Schizophrenia patients demonstrated a less developed movement pattern with low individualization of components compared to healthy controls. The schizophrenia group also displayed a higher incidence of mNSS. The presence of a less mature movement pattern can be an indicator of neuro-immaturity and a marker for atypical neurological development in schizophrenia. Our findings support the understanding of motor dysfunction as an intrinsic part of the disorder of schizophrenia.
Resumo:
Hyperspectral remote sensing exploits the electromagnetic scattering patterns of the different materials at specific wavelengths [2, 3]. Hyperspectral sensors have been developed to sample the scattered portion of the electromagnetic spectrum extending from the visible region through the near-infrared and mid-infrared, in hundreds of narrow contiguous bands [4, 5]. The number and variety of potential civilian and military applications of hyperspectral remote sensing is enormous [6, 7]. Very often, the resolution cell corresponding to a single pixel in an image contains several substances (endmembers) [4]. In this situation, the scattered energy is a mixing of the endmember spectra. A challenging task underlying many hyperspectral imagery applications is then decomposing a mixed pixel into a collection of reflectance spectra, called endmember signatures, and the corresponding abundance fractions [8–10]. Depending on the mixing scales at each pixel, the observed mixture is either linear or nonlinear [11, 12]. Linear mixing model holds approximately when the mixing scale is macroscopic [13] and there is negligible interaction among distinct endmembers [3, 14]. If, however, the mixing scale is microscopic (or intimate mixtures) [15, 16] and the incident solar radiation is scattered by the scene through multiple bounces involving several endmembers [17], the linear model is no longer accurate. Linear spectral unmixing has been intensively researched in the last years [9, 10, 12, 18–21]. It considers that a mixed pixel is a linear combination of endmember signatures weighted by the correspondent abundance fractions. Under this model, and assuming that the number of substances and their reflectance spectra are known, hyperspectral unmixing is a linear problem for which many solutions have been proposed (e.g., maximum likelihood estimation [8], spectral signature matching [22], spectral angle mapper [23], subspace projection methods [24,25], and constrained least squares [26]). In most cases, the number of substances and their reflectances are not known and, then, hyperspectral unmixing falls into the class of blind source separation problems [27]. Independent component analysis (ICA) has recently been proposed as a tool to blindly unmix hyperspectral data [28–31]. ICA is based on the assumption of mutually independent sources (abundance fractions), which is not the case of hyperspectral data, since the sum of abundance fractions is constant, implying statistical dependence among them. This dependence compromises ICA applicability to hyperspectral images as shown in Refs. [21, 32]. In fact, ICA finds the endmember signatures by multiplying the spectral vectors with an unmixing matrix, which minimizes the mutual information among sources. If sources are independent, ICA provides the correct unmixing, since the minimum of the mutual information is obtained only when sources are independent. This is no longer true for dependent abundance fractions. Nevertheless, some endmembers may be approximately unmixed. These aspects are addressed in Ref. [33]. Under the linear mixing model, the observations from a scene are in a simplex whose vertices correspond to the endmembers. Several approaches [34–36] have exploited this geometric feature of hyperspectral mixtures [35]. Minimum volume transform (MVT) algorithm [36] determines the simplex of minimum volume containing the data. The method presented in Ref. [37] is also of MVT type but, by introducing the notion of bundles, it takes into account the endmember variability usually present in hyperspectral mixtures. The MVT type approaches are complex from the computational point of view. Usually, these algorithms find in the first place the convex hull defined by the observed data and then fit a minimum volume simplex to it. For example, the gift wrapping algorithm [38] computes the convex hull of n data points in a d-dimensional space with a computational complexity of O(nbd=2cþ1), where bxc is the highest integer lower or equal than x and n is the number of samples. The complexity of the method presented in Ref. [37] is even higher, since the temperature of the simulated annealing algorithm used shall follow a log( ) law [39] to assure convergence (in probability) to the desired solution. Aiming at a lower computational complexity, some algorithms such as the pixel purity index (PPI) [35] and the N-FINDR [40] still find the minimum volume simplex containing the data cloud, but they assume the presence of at least one pure pixel of each endmember in the data. This is a strong requisite that may not hold in some data sets. In any case, these algorithms find the set of most pure pixels in the data. PPI algorithm uses the minimum noise fraction (MNF) [41] as a preprocessing step to reduce dimensionality and to improve the signal-to-noise ratio (SNR). The algorithm then projects every spectral vector onto skewers (large number of random vectors) [35, 42,43]. The points corresponding to extremes, for each skewer direction, are stored. A cumulative account records the number of times each pixel (i.e., a given spectral vector) is found to be an extreme. The pixels with the highest scores are the purest ones. N-FINDR algorithm [40] is based on the fact that in p spectral dimensions, the p-volume defined by a simplex formed by the purest pixels is larger than any other volume defined by any other combination of pixels. This algorithm finds the set of pixels defining the largest volume by inflating a simplex inside the data. ORA SIS [44, 45] is a hyperspectral framework developed by the U.S. Naval Research Laboratory consisting of several algorithms organized in six modules: exemplar selector, adaptative learner, demixer, knowledge base or spectral library, and spatial postrocessor. The first step consists in flat-fielding the spectra. Next, the exemplar selection module is used to select spectral vectors that best represent the smaller convex cone containing the data. The other pixels are rejected when the spectral angle distance (SAD) is less than a given thresh old. The procedure finds the basis for a subspace of a lower dimension using a modified Gram–Schmidt orthogonalizati on. The selected vectors are then projected onto this subspace and a simplex is found by an MV T pro cess. ORA SIS is oriented to real-time target detection from uncrewed air vehicles using hyperspectral data [46]. In this chapter we develop a new algorithm to unmix linear mixtures of endmember spectra. First, the algorithm determines the number of endmembers and the signal subspace using a newly developed concept [47, 48]. Second, the algorithm extracts the most pure pixels present in the data. Unlike other methods, this algorithm is completely automatic and unsupervised. To estimate the number of endmembers and the signal subspace in hyperspectral linear mixtures, the proposed scheme begins by estimating sign al and noise correlation matrices. The latter is based on multiple regression theory. The signal subspace is then identified by selectin g the set of signal eigenvalue s that best represents the data, in the least-square sense [48,49 ], we note, however, that VCA works with projected and with unprojected data. The extraction of the end members exploits two facts: (1) the endmembers are the vertices of a simplex and (2) the affine transformation of a simplex is also a simplex. As PPI and N-FIND R algorithms, VCA also assumes the presence of pure pixels in the data. The algorithm iteratively projects data on to a direction orthogonal to the subspace spanned by the endmembers already determined. The new end member signature corresponds to the extreme of the projection. The algorithm iterates until all end members are exhausted. VCA performs much better than PPI and better than or comparable to N-FI NDR; yet it has a computational complexity between on e and two orders of magnitude lower than N-FINDR. The chapter is structure d as follows. Section 19.2 describes the fundamentals of the proposed method. Section 19.3 and Section 19.4 evaluate the proposed algorithm using simulated and real data, respectively. Section 19.5 presents some concluding remarks.
Resumo:
The concepts and instruments required for the teaching and learning of geometric optics are introduced in the didactic processwithout a proper didactic transposition. This claim is secured by the ample evidence of both wide- and deep-rooted alternative concepts on the topic. Didactic transposition is a theory that comes from a reflection on the teaching and learning process in mathematics but has been used in other disciplinary fields. It will be used in this work in order to clear up the main obstacles in the teachinglearning process of geometric optics. We proceed to argue that since Newton’s approach to optics, in his Book I of Opticks, is independent of the corpuscular or undulatory nature of light, it is the most suitable for a constructivist learning environment. However, Newton’s theory must be subject to a proper didactic transposition to help overcome the referred alternative concepts. Then is described our didactic transposition in order to create knowledge to be taught using a dialogical process between students’ previous knowledge, history of optics and the desired outcomes on geometrical optics in an elementary pre-service teacher training course. Finally, we use the scheme-facet structure of knowledge both to analyse and discuss our results as well as to illuminate shortcomings that must be addressed in our next stage of the inquiry.
Resumo:
O projeto “À Descoberta das Ilhas” surge das lacunas de atenção e motivação por parte das crianças na realização de exercícios na terapia ocupacional, aliadas a uma subjetividade na análise do seu progresso. Direcionado para crianças com dificuldades de integração bilateral motora, com idades compreendidas entre os cinco e nove anos, este projeto tem como base um jogo 3D para as plataformas Windows, Mac OS X e Linux, controlado com os movimentos dos membros superiores através do dispositivo Leap Motion. Através do controlo de um avião, a criança descobre várias ilhas e desbloqueia componentes do mesmo, alcançando os diversos bónus e checkpoints ao longo de cada percurso. Ao terapeuta são apresentados gráficos com dados obtidos pelo dispositivo aquando do momento lúdico da criança que permitem acompanhar a sua evolução a cada nível. O sucesso no cumprimento dos objetivos do projeto permitiu confirmar a utilidade da aplicação na intervenção e avaliação do público-alvo.
Resumo:
A indústria automóvel exige, em geral, elevados índices de produtividade e qualidade. Para corresponder às exigências deste tipo de indústria, são requeridos métodos avançados de produção, tentando eliminar ao máximo operações que não gerem valor acrescentado e que possam introduzir problemas no processo de garantia da qualidade. A maquinagem por arranque de apara é um processo utilizado de forma intensiva na indústria automóvel. No entanto, enquanto em componentes críticos como o motor, os processos estão já altamente otimizados, o mesmo não se verifica na maior parte dos sistemas periféricos, normalmente realizados por empresas mais pequenas que gravitam em torno dos principais fornecedores da cadeia de produção de automóveis. Os sistemas responsáveis pela movimentação dos limpa pára-brisas e elevação dos vidros, entre outros, encontram-se neste grupo. Este trabalho visa essencialmente otimizar o processo de maquinagem de componentes periféricos de automóveis, sujeitos a diferentes operações em vários planos. No entanto, e tal como em muitas outras situações relacionadas com a variedade de versões existentes na indústria automóvel relativamente a cada sistema, pretende-se que o processo seja suficientemente versátil para poder ser aplicado em vários componentes de uma mesma família de produtos, necessitando de um número de ajustes o mais baixo possível. O estudo passou por uma análise profunda das similaridades geométricas dos diferentes componentes, análise dos planos de maquinagem de cada componente, operações envolvidas, elencagem da necessidade específica de ferramentas, elaboração de gabaritos de fabrico e apresentação da solução final, a qual passa pela introdução de um 4º eixo e do seu controlo através do sistema CNC já existente, assim como pela elaboração de novos programas.
Resumo:
The seismic assessment of the local failure modes in existing masonry buildings is currently based on the identification of the so-called local mechanisms, often associated with the out-of-plane wall behavior, whose stability is evaluated by static force-based approaches and, more recently, by some displacement-based proposals. Local mechanisms consist of kinematic chains of masonry portions, often regarded as rigid bodies, with geometric nonlinearity and concentrated nonlinearity in predefined contact regions (unilateral no-tension behavior, possible sliding with friction). In this work, the dynamic behavior of local mechanisms is simulated through multi-body dynamics, to obtain the nonlinear response with efficient time history analyses that directly take into account the characteristics of the ground motion. The amplification/filtering effects of the structure are considered within the input motion. The proposed approach is validated with experimental results of two full-scale shaking-table tests on stone masonry buildings: a sacco-stone masonry façade tested at Laboratório Nacional de Engenharia Civil and a two-storey double-leaf masonry building tested at European Centre for Training and Research in Earthquake Engineering (EUCENTRE).