994 resultados para Active Pixel Sensor
Resumo:
Two series of new diorganotin(IV) cycloalkylhydroxamate complexes with different ring sizes (cyclopropyl, cyclobutyl, cyclopentyl and cyclohexyl), formulated as the mononuclear [R2Sn(HL)(2)] (1:2) (a, R=Bu-n and Ph) and the polymeric [R2SnL](n) (1:1) (b, R=Bu-n) compounds, were prepared and fully characterized. Single crystal X-ray diffraction for [(Bu2Sn)-Bu-n{C5H9C(O)NHO}(2)] (3a) discloses the cis geometry and strong intermolecular NH center dot center dot center dot O interactions. The in vitro cytotoxic activities of the complexes were evaluated against HL-60, Bel-7402, BGC-823 and KB human tumour cell lines, the greater activity concerning [(Bu2Sn)-Bu-n(HL)(2)] [HL=C3H5C(O)NHO (1a), C6H11C(O)NHO (4a)] towards BGC-823. The complexes undergo, by cyclic voltammetry and controlled-potential electrolysis, one irreversible overall two-electron cathodic process at a reduction potential that does not appear to correlate with the antitumour activity. The electrochemical behaviour of [R2Sn(C5H9C(O)NHO)(2)] [R=Bu-n (3a), Ph (7a)] was also investigated using density functional theory (DFT) methods, showing that the ultimate complex structure and the mechanism of its formation are R dependent: for the aromatic (R = Ph) complex, the initial reduction step is centred on the phenyl ligands and at the metal, being followed by a second reduction with Sn-O and Sn-C ruptures, whereas for the alkyl (R=Bu-n) complex the first reduction step is centred on one of the hydroxamate ligands and is followed by a second reduction with Sn-O bond cleavages and preservation of the alkyl ligands. In both cases, the final complexes are highly coordinative unsaturated Sn-II species with the cis geometry, features that can be of biological significance.
Resumo:
This paper addresses the problem of optimal positioning of surface bonded piezoelectric patches in sandwich plates with viscoelastic core and laminated face layers. The objective is to maximize a set of modal loss factors for a given frequency range using multiobjective topology optimization. Active damping is introduced through co-located negative velocity feedback control. The multiobjective topology optimization problem is solved using the Direct MultiSearch Method. An application to a simply supported sandwich plate is presented with results for the maximization of the first six modal loss factors. The influence of the finite element mesh is analyzed and the results are, to some extent, compared with those obtained using alternative single objective optimization.
Resumo:
Journal of Applied Physics, Vol. 96, nº3
Resumo:
The economic development of a region depends on the speed that people and goods can travel. The reduction of people and goods travel time can be achieved by planning smooth road layouts, which are obtained by crossing natural obstacles such as hills, by tunneling at great depths, and allowing the reduction of the road alignment length. The stress state in rock masses at such depths, either because of the overburden or due to the tectonic conditions of the rock mass induces high convergences of the tunnel walls. These high convergence values are incompatible with the supports structural performance installed in the excavation stabilization. In this article it is intended to evaluate and analyze some of the solutions already implemented in several similar geological and geotechnical situations, in order to establish a methodological principle for the design of the tunnels included in a highway section under construction in the region influenced by the Himalayas, in the state of Himachal Pradesh (India) and referenced by "four laning of Kiratpur to Ner Chowk section".
Resumo:
Introdução: O Active Straight Leg Raise (ASLR) tem sido sugerido como um indicador clínico da estabilidade lombopélvica. Estratégias passivas e ativas podem contribuir para aumentar esta estabilidade, assim como programas de exercício baseados nas mesmas estratégias ativas. Objetivos: Comparar os efeitos imediatos da compressão pélvica manual (CP), do drawing-in (DI) e do bracing abdominal (BA) durante o ASLR em indivíduos com e sem dor lombopélvica crónica e inespecífica, e avaliar o efeito prolongado das manobras de estabilização ativas através dos programas de exercícios de controlo motor, Pilates e McGill. Métodos: Estudo transversal, com uma amostra de 111 voluntários, 52 sem dor lombopélvica (NLPPG) e 59 com dor lombopélvica (LPPG), e estudo experimental, formado pelo LPPG dividido em 19 no grupo controlo (GC), 20 no grupo pilates (GP) e 20 no grupo mcgill (GMg). Foi avaliado o ASLR padrão, o ASLR com CP, o ASLR com DI e ASLR com BA. Os participantes foram avaliados antes e após as 8 semanas de implementação dos programas exercícios de McGill e Richardson, apenas aos respetivos grupos. Resultados: O LPPG apresentou significativamente maior score no ASLR comparativamente ao NLPPG (z=-9,361; p<0,001). Apesar do BA ter apresentado scores inferiores às restantes estratégias (p<0,001), todas elas foram capazes de diminuir o score do ASLR (p<0,001). Após a aplicação dos programas de exercícios, verificou-se que o GP (p<0,001) e o GMg (p<0,001) apresentaram scores significativamente menores no ASLR, relativamente ao GC. No GP e no GMg verificou-se uma diminuição do score do ASLR (Z=-4,028; p<0,001; Z=-4,179; p<0,001, respetivamente). Além disso, GMg apresentou uma tendência para apresentar menores scores do ASLR comparativamente ao GP. Conclusão: Qualquer uma destas manobras de estabilização quando adicionada ao ASLR pode aumentar a estabilidade lombopélvica, especialmente o BA. Os exercícios de Pilates e de McGill permitiram melhorar os scores do ASLR.
Resumo:
Schedule for vaccination against HBV infection has usually been based on three separate injections of 20 meg of the vaccine by intramuscular route. One of the main shortcomings to its use in large scale programs has been its high cost. Ninety out of 300 health workers were submitted to three injections of 2 meg of plasma-derived vaccine (PDV) by intradermal (ID) route on days 0, 30, and 180. Anti-HBs was detected in 74 (82.2%) after the second dose and in 80 (88.9%) after the third dose, a non-significant difference. However, levels above 10 times the cut-off were observed in 29 (32.2%) and 77 (85.5%), respectively (p < 0.001). The results showed that a low-dose schedule is effective when used in health workers and should be tried with other risk groups.
Resumo:
This paper describes the environmental monitoring / regatta beacon buoy under development at the Laboratory of Autonomous Systems (LSA) of the Polytechnic Institute of Porto. On the one hand, environmentalmonitoring of open water bodies in real or deferred time is essential to assess and make sensible decisions and, on the other hand, the broadcast in real time of position, water and wind related parameters allows autonomous boats to optimise their regatta performance. This proposal, rather than restraining the boats autonomy, fosters the development of intelligent behaviour by allowing the boats to focus on regatta strategy and tactics. The Nautical and Telemetric Application (NAUTA) buoy is a dual mode reconfigurable system that includes communications, control, data logging, sensing, storage and power subsystems. In environmental monitoring mode, the buoy gathers and stores data from several underwater and above water sensors and, in regatta mode, the buoy becomes an active course mark for the autonomous sailing boats in the vicinity. During a race, the buoy broadcasts its position, together with the wind and the water current local conditions, allowing autonomous boats to navigate towards and round the mark successfully. This project started with the specification of the requirements of the dual mode operation, followed by the design and building of the buoy structure. The research is currently focussed on the development of the modular, reconfigurable, open source-based control system. The NAUTA buoy is innovative, extensible and optimises the on board platform resources.
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 Electrotécnica e de Computadores
Resumo:
Nowadays the incredible grow of mobile devices market led to the need for location-aware applications. However, sometimes person location is difficult to obtain, since most of these devices only have a GPS (Global Positioning System) chip to retrieve location. In order to suppress this limitation and to provide location everywhere (even where a structured environment doesn’t exist) a wearable inertial navigation system is proposed, which is a convenient way to track people in situations where other localization systems fail. The system combines pedestrian dead reckoning with GPS, using widely available, low-cost and low-power hardware components. The system innovation is the information fusion and the use of probabilistic methods to learn persons gait behavior to correct, in real-time, the drift errors given by the sensors.
Resumo:
Nowadays there is an increase of location-aware mobile applications. However, these applications only retrieve location with a mobile device's GPS chip. This means that in indoor or in more dense environments these applications don't work properly. To provide location information everywhere a pedestrian Inertial Navigation System (INS) is typically used, but these systems can have a large estimation error since, in order to turn the system wearable, they use low-cost and low-power sensors. In this work a pedestrian INS is proposed, where force sensors were included to combine with the accelerometer data in order to have a better detection of the stance phase of the human gait cycle, which leads to improvements in location estimation. Besides sensor fusion an information fusion architecture is proposed, based on the information from GPS and several inertial units placed on the pedestrian body, that will be used to learn the pedestrian gait behavior to correct, in real-time, the inertial sensors errors, thus improving location estimation.
Resumo:
Hyperspectral imaging has become one of the main topics in remote sensing applications, which comprise hundreds of spectral bands at different (almost contiguous) wavelength channels over the same area generating large data volumes comprising several GBs per flight. This high spectral resolution can be used for object detection and for discriminate between different objects based on their spectral characteristics. One of the main problems involved in hyperspectral analysis is the presence of mixed pixels, which arise when the spacial resolution of the sensor is not able to separate spectrally distinct materials. Spectral unmixing is one of the most important task for hyperspectral data exploitation. However, the unmixing algorithms can be computationally very expensive, and even high power consuming, which compromises the use in applications under on-board constraints. In recent years, graphics processing units (GPUs) have evolved into highly parallel and programmable systems. Specifically, several hyperspectral imaging algorithms have shown to be able to benefit from this hardware taking advantage of the extremely high floating-point processing performance, compact size, huge memory bandwidth, and relatively low cost of these units, which make them appealing for onboard data processing. In this paper, we propose a parallel implementation of an augmented Lagragian based method for unsupervised hyperspectral linear unmixing on GPUs using CUDA. The method called simplex identification via split augmented Lagrangian (SISAL) aims to identify the endmembers of a scene, i.e., is able to unmix hyperspectral data sets in which the pure pixel assumption is violated. The efficient implementation of SISAL method presented in this work exploits the GPU architecture at low level, using shared memory and coalesced accesses to memory.
Resumo:
This paper addresses the estimation of surfaces from a set of 3D points using the unified framework described in [1]. This framework proposes the use of competitive learning for curve estimation, i.e., a set of points is defined on a deformable curve and they all compete to represent the available data. This paper extends the use of the unified framework to surface estimation. It o shown that competitive learning performes better than snakes, improving the model performance in the presence of concavities and allowing to desciminate close surfaces. The proposed model is evaluated in this paper using syntheticdata and medical images (MRI and ultrasound images).
Resumo:
A one-pot template reaction of sodium 2-(2-(dicyanomethylene) hydrazinyl) benzenesulfonate (NaHL1) with water and manganese(II) acetate tetrahydrate led to the mononuclear complex [Mn(H2O)(6)](HL1a)(2)center dot 4H(2)O (1), where (HL1a) -= 2-(SO3-)C6H4(NH)=N=C(C N) (CONH2) is the carboxamide species derived from nucleophilic attack of water on a cyano group of (HL1) . The copper tetramer [Cu-4(H2O)(10)(-) (1 kappa N: kappa O-2: kappa O, 2 kappa N: k(O)-L-2)(2)]center dot 2H(2)O (2) was obtained from reaction of Cu(NO3)(2)center dot 2.5H(2)O with sodium 5-(2( 4,4-dimethyl-2,6-dioxocyclohexylidene) hydrazinyl)-4-hydroxybenzene-1,3-disulfonate (Na2H2L2). Both complexes were characterized by elemental analysis, IR spectroscopy, ESI-MS and single crystal X-ray diffraction. They exhibit a high catalytic activity for the solvent-and additive-free microwave (MW) assisted oxidation of primary and secondary alcohols with tert-butylhydroperoxide, leading to yields of the oxidized products up to 85.5% and TOFs up to 1.90 x 103 h(-1) after 1 h under low power (5-10 W) MW irradiation. Moreover, the heterogeneous catalysts are easily recovered and reused, at least for three consecutive cycles, maintaining 89% of the initial activity and a high selectivity.
Resumo:
The development of high spatial resolution airborne and spaceborne sensors has improved the capability of ground-based data collection in the fields of agriculture, geography, geology, mineral identification, detection [2, 3], and classification [4–8]. The signal read by the sensor from a given spatial element of resolution and at a given spectral band is a mixing of components originated by the constituent substances, termed endmembers, located at that element of resolution. This chapter addresses hyperspectral unmixing, which is the decomposition of the pixel spectra into a collection of constituent spectra, or spectral signatures, and their corresponding fractional abundances indicating the proportion of each endmember present in the pixel [9, 10]. Depending on the mixing scales at each pixel, the observed mixture is either linear or nonlinear [11, 12]. The linear mixing model holds when the mixing scale is macroscopic [13]. The nonlinear model holds when the mixing scale is microscopic (i.e., intimate mixtures) [14, 15]. The linear model assumes negligible interaction among distinct endmembers [16, 17]. The nonlinear model assumes that incident solar radiation is scattered by the scene through multiple bounces involving several endmembers [18]. Under the linear mixing model and assuming that the number of endmembers and their spectral signatures are known, hyperspectral unmixing is a linear problem, which can be addressed, for example, under the maximum likelihood setup [19], the constrained least-squares approach [20], the spectral signature matching [21], the spectral angle mapper [22], and the subspace projection methods [20, 23, 24]. Orthogonal subspace projection [23] reduces the data dimensionality, suppresses undesired spectral signatures, and detects the presence of a spectral signature of interest. The basic concept is to project each pixel onto a subspace that is orthogonal to the undesired signatures. As shown in Settle [19], the orthogonal subspace projection technique is equivalent to the maximum likelihood estimator. This projection technique was extended by three unconstrained least-squares approaches [24] (signature space orthogonal projection, oblique subspace projection, target signature space orthogonal projection). Other works using maximum a posteriori probability (MAP) framework [25] and projection pursuit [26, 27] have also been applied to hyperspectral data. In most cases the number of endmembers and their signatures are not known. Independent component analysis (ICA) is an unsupervised source separation process that has been applied with success to blind source separation, to feature extraction, and to unsupervised recognition [28, 29]. ICA consists in finding a linear decomposition of observed data yielding statistically independent components. Given that hyperspectral data are, in given circumstances, linear mixtures, ICA comes to mind as a possible tool to unmix this class of data. In fact, the application of ICA to hyperspectral data has been proposed in reference 30, where endmember signatures are treated as sources and the mixing matrix is composed by the abundance fractions, and in references 9, 25, and 31–38, where sources are the abundance fractions of each endmember. In the first approach, we face two problems: (1) The number of samples are limited to the number of channels and (2) the process of pixel selection, playing the role of mixed sources, is not straightforward. In the second approach, ICA is based on the assumption of mutually independent sources, which is not the case of hyperspectral data, since the sum of the abundance fractions is constant, implying dependence among abundances. This dependence compromises ICA applicability to hyperspectral images. In addition, hyperspectral data are immersed in noise, which degrades the ICA performance. IFA [39] was introduced as a method for recovering independent hidden sources from their observed noisy mixtures. IFA implements two steps. First, source densities and noise covariance are estimated from the observed data by maximum likelihood. Second, sources are reconstructed by an optimal nonlinear estimator. Although IFA is a well-suited technique to unmix independent sources under noisy observations, the dependence among abundance fractions in hyperspectral imagery compromises, as in the ICA case, the IFA performance. Considering the linear mixing model, hyperspectral observations are in a simplex whose vertices correspond to the endmembers. Several approaches [40–43] have exploited this geometric feature of hyperspectral mixtures [42]. Minimum volume transform (MVT) algorithm [43] determines the simplex of minimum volume containing the data. The MVT-type approaches are complex from the computational point of view. Usually, these algorithms first find the convex hull defined by the observed data and then fit a minimum volume simplex to it. Aiming at a lower computational complexity, some algorithms such as the vertex component analysis (VCA) [44], the pixel purity index (PPI) [42], and the N-FINDR [45] still find the minimum volume simplex containing the data cloud, but they assume the presence in the data of at least one pure pixel of each endmember. 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. Hyperspectral sensors collects spatial images over many narrow contiguous bands, yielding large amounts of data. For this reason, very often, the processing of hyperspectral data, included unmixing, is preceded by a dimensionality reduction step to reduce computational complexity and to improve the signal-to-noise ratio (SNR). Principal component analysis (PCA) [46], maximum noise fraction (MNF) [47], and singular value decomposition (SVD) [48] are three well-known projection techniques widely used in remote sensing in general and in unmixing in particular. The newly introduced method [49] exploits the structure of hyperspectral mixtures, namely the fact that spectral vectors are nonnegative. The computational complexity associated with these techniques is an obstacle to real-time implementations. To overcome this problem, band selection [50] and non-statistical [51] algorithms have been introduced. This chapter addresses hyperspectral data source dependence and its impact on ICA and IFA performances. The study consider simulated and real data and is based on mutual information minimization. Hyperspectral observations are described by a generative model. This model takes into account the degradation mechanisms normally found in hyperspectral applications—namely, signature variability [52–54], abundance constraints, topography modulation, and system noise. The computation of mutual information is based on fitting mixtures of Gaussians (MOG) to data. The MOG parameters (number of components, means, covariances, and weights) are inferred using the minimum description length (MDL) based algorithm [55]. We study the behavior of the mutual information as a function of the unmixing matrix. The conclusion is that the unmixing matrix minimizing the mutual information might be very far from the true one. Nevertheless, some abundance fractions might be well separated, mainly in the presence of strong signature variability, a large number of endmembers, and high SNR. We end this chapter by sketching a new methodology to blindly unmix hyperspectral data, where abundance fractions are modeled as a mixture of Dirichlet sources. This model enforces positivity and constant sum sources (full additivity) constraints. The mixing matrix is inferred by an expectation-maximization (EM)-type algorithm. This approach is in the vein of references 39 and 56, replacing independent sources represented by MOG with mixture of Dirichlet sources. Compared with the geometric-based approaches, the advantage of this model is that there is no need to have pure pixels in the observations. The chapter is organized as follows. Section 6.2 presents a spectral radiance model and formulates the spectral unmixing as a linear problem accounting for abundance constraints, signature variability, topography modulation, and system noise. Section 6.3 presents a brief resume of ICA and IFA algorithms. Section 6.4 illustrates the performance of IFA and of some well-known ICA algorithms with experimental data. Section 6.5 studies the ICA and IFA limitations in unmixing hyperspectral data. Section 6.6 presents results of ICA based on real data. Section 6.7 describes the new blind unmixing scheme and some illustrative examples. Section 6.8 concludes with some remarks.