Soliton-type and other travelling wave solutions for an improved class of nonlinear sixth-order Boussinesq equations

An improved class of nonlinear bidirectional Boussinesq equations of sixth order using a wave surface elevation formulation is derived. Exact travelling wave solutions for the proposed class of nonlinear evolution equations are deduced. A new exact travelling wave solution is found which is the uniform limit of a geometric series. The ratio of this series is proportional to a classical soliton-type solution of the form of the square of a hyperbolic secant function. This happens for some values of the wave propagation velocity. However, there are other values of this velocity which display this new type of soliton, but the classical soliton structure vanishes in some regions of the domain. Exact solutions of the form of the square of the classical soliton are also deduced. In some cases, we find that the ratio between the amplitude of this wave and the amplitude of the classical soliton is equal to 35/36. It is shown that different families of travelling wave solutions are associated with different values of the parameters introduced in the improved equations.

Vertex component analysis: a geometric-based approach to unmix hyperspectral data

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.

Comparing clustering solutions: the use of adjusted paired indices

In the present paper we compare clustering solutions using indices of paired agreement. We propose a new method - IADJUST - to correct indices of paired agreement, excluding agreement by chance. This new method overcomes previous limitations known in the literature as it permits the correction of any index. We illustrate its use in external clustering validation, to measure the accordance between clusters and an a priori known structure. The adjusted indices are intended to provide a realistic measure of clustering performance that excludes agreement by chance with ground truth. We use simulated data sets, under a range of scenarios - considering diverse numbers of clusters, clusters overlaps and balances - to discuss the pertinence and the precision of our proposal. Precision is established based on comparisons with the analytical approach for correction specific indices that can be corrected in this way are used for this purpose. The pertinence of the proposed correction is discussed when making a detailed comparison between the performance of two classical clustering approaches, namely Expectation-Maximization (EM) and K-Means (KM) algorithms. Eight indices of paired agreement are studied and new corrected indices are obtained.

Desenvolvimento do Filme Plástico Paper Like

A indústria de transformação de material plástico contribui de forma relevante para o desenvolvimento da economia mundial. Com o objetivo de desenvolvimento dessa indústria, a empresa Pentaplast S. A., situada em Água Longa, Santo Tirso, desenvolve a conceção de novos produtos para novas aplicações. Esta empresa para continuar na posição de destaque que possui, tem que conduzir a sua existência na melhoria contínua e atualização fase ao mercado. Na indústria termoformadora existe uma procura constante de novos materiais, visto ser um mercado muito competitivo. Neste contexto, o presente trabalho tem como objetivo desenvolver um filme plástico com o aspeto de papel para a indústria termoformadora, criando desta forma um impacto no consumidor para a preocupação ambiental. De forma a encontrar soluções para o problema mencionado, conduziu-se ao estudo e desenvolvimento de um novo produto – Paper Like, sendo este, um produto reciclável e adotado às necessidades da termoformação. Para isso, desenvolveu-se o projeto utilizando o processo de termolaminação, com a adição de um aditivo na camada externa, permitindo incorporar ao filme plástico, o aspeto e textura de papel. Foram testados, separadamente, dois aditivos, X e Y, base PET e PE, respetivamente, com diferentes percentagens de incorporação. O aditivo X foi desenvolvido especialmente para este projeto, tendo como base politereftalato de etileno, no entanto com a sua incorporação não se obteve os resultados esperados, somente dava um aspeto mate ao filme extrudidos. O aditivo Y, já existe no mercado mas nunca utilizado em extrusão plana, tem como base polietileno e a sua incorporação permitiu obter um filme com aspeto de papel, comprovando-se a sua compatibilidade com pigmentos, os quais dão diversas cores aos filmes, permitindo assim competir com os filmes tradicionais. Infelizmente a termolaminação do filme com o aditivo Y não foi possível, o que inviabiliza a selagem da embalagem.

Investigation on AUTOSAR-Compliant Solutions for Many-Core Architectures

As of today, AUTOSAR is the de facto standard in the automotive industry, providing a common software architec- ture and development process for automotive applications. While this standard is originally written for singlecore operated Elec- tronic Control Units (ECU), new guidelines and recommendations have been added recently to provide support for multicore archi- tectures. This update came as a response to the steady increase of the number and complexity of the software functions embedded in modern vehicles, which call for the computing power of multicore execution environments. In this paper, we enumerate and analyze the design options and the challenges of porting AUTOSAR-based automotive applications onto multicore platforms. In particular, we investigate those options when considering the emerging many- core architectures that provide a more scalable environment than the traditional multicore systems. Such platforms are suitable to enable massive parallel execution, and their design is more suitable for partitioning and isolating the software components.

Dimensionamento de lajes aligeiradas betonadas "in situ"

A conjuntura económica da construção não se encontra numa fase de prosperidade, existindo a necessidade de criar soluções construtivas que permitam a redução de custos dos materiais a nível de obra. As lajes de betão armado, devido à sua grande área de implantação, possuem uma parcela importante no orçamento final de qualquer obra de edifícios correntes. Sabendo das possibilidades de aligeiramento de lajes, torna-se necessária a realização de um estudo pormenorizado e comparativo entre soluções de aligeiramento. O desenvolvimento deste relatório reflete todo o trabalho efetuado durante a realização de um estágio curricular desenvolvido na empresa FercaNorte – Estruturas, Lajes e Cofragens, Lda. e foca-se num dimensionamento e estudo comparativo de soluções de lajes fungiformes aligeiradas, aplicadas a dois casos de estudo e também num dimensionamento e estudo comparativo de soluções de lajes aligeiradas unidirecionais mas apenas aplicadas a um caso de estudo. No primeiro caso de estudo, laje fungiforme com um vão de 6 metros nas duas direções, são dimensionadas e comparadas quatro soluções: laje fungiforme maciça; laje fungiforme aligeirada com blocos elipsoides perdidos dispostos de forma ortogonal e envolvidos totalmente por betão; laje fungiforme aligeirada com blocos elipsoides perdidos dispostos em formato de favo de mel e envolvidos totalmente por betão; e laje fungiforme nervurada com moldes recuperáveis. No segundo caso de estudo, laje fungiforme com um vão de 7,04 metros nas duas direções, são dimensionadas e comparadas cinco soluções: laje fungiforme maciça, laje fungiforme aligeirada com blocos cúbicos perdidos dispostos de forma ortogonal e envolvidos totalmente por betão; laje fungiforme aligeirada, com blocos elipsoides perdidos dispostos de forma ortogonal e envolvidos totalmente por betão; laje fungiforme aligeirada com blocos elipsoides perdidos dispostos em formato de favo de mel e envolvidos totalmente por betão; e laje fungiforme nervurada com moldes recuperáveis. No terceiro caso de estudo, laje unidirecional com um vão de 8 metros apoiada em vigas com vão de 5 metros, são dimensionadas e comparadas três soluções: laje maciça; laje aligeirada com perfis tubulares com secção transversal reta oval; e laje nervurada com moldes recuperáveis. No final é apresentada uma estimativa orçamental para cada solução analisada nos três casos de estudo abordados.

Unusual Solutions for Catheter Placement in Haemodialysis Patients

Background: Although vascular access is essential for adequate haemodialysis delivery, the systematic use of a patient's venous patrimony may eventually lead to exhaustion of suitable sites for placement of a new vascular access. Case Report: We present two cases of such patients. In the first one we inserted a 55cm catheter through the left external iliac vein, and a 40cm translumbar catheter was placed in the second one. Both interventions were performed percutaneously under radiological guidance. Both patients were anticoagulated after the procedure. Conclusion: Unusual sites for haemodialysis catheter placement may be life saving in selected situations and offer safe and viable alternatives for adequate haemodialysis delivery.

Time diversity solutions to cope with lost packets

A dissertation submitted to Departamento de Engenharia Electrotécnica of Faculdade de Ciências e Tecnologia of Universidade Nova de Lisboa in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Engenharia Electrotécnica e de Computadores

A communication strategy for Continente: Practical, low priced and healthy eating solutions

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics

Smart & Simple Business Solutions (SSBS)

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics

Preparation and characterization of microfiltration flat polymeric membranes for biomedical applications

Dissertation presented to Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa for obtaining the master degree in Membrane Engineering

Lor’s - Women personal rain protection solutions

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics