Numerical optimization experiments using the hyperbolic smoothing strategy to solve MPCC

In this work we solve Mathematical Programs with Complementarity Constraints using the hyperbolic smoothing strategy. Under this approach, the complementarity condition is relaxed through the use of the hyperbolic smoothing function, involving a positive parameter that can be decreased to zero. An iterative algorithm is implemented in MATLAB language and a set of AMPL problems from MacMPEC database were tested.

Numerical experiments with a modified regularization scheme for mathematical programs with complementarity constraints

On this paper we present a modified regularization scheme for Mathematical Programs with Complementarity Constraints. In the regularized formulations the complementarity condition is replaced by a constraint involving a positive parameter that can be decreased to zero. In our approach both the complementarity condition and the nonnegativity constraints are relaxed. An iterative algorithm is implemented in MATLAB language and a set of AMPL problems from MacMPEC database were tested.

Numerical Uncertainty and Its Implications

Copyright © 2014 António F. Rodrigues, Nuno O. Martins. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. In accordance of the Creative Commons Attribution License all Copyrights © 2014 are reserved for SCIRP and the owner of the intellectual property António F. Rodrigues, Nuno O. Martins. All Copyright © 2014 are guarded by law and by SCIRP as a guardian.

Cálculo flexível e o raciocínio quantitativo aditivo em alunos dos 1.º e 2.º anos

Esta comunicação insere-se no Projeto “Pensamento numérico e cálculo flexível: Aspetos críticos”. Começa por discutir o que se entende por flexibilidade de cálculo e raciocínio quantitativo aditivo, discutindo depois os resultados de entrevistas individuais realizadas com quatro alunos (dois do 1.º ano e dois do 2.º ano) quando lhes foram propostas tarefas onde aqueles aspetos estavam presentes. Trata-se de um estudo exploratório cujo principal objetivo é compreender o raciocínio dos alunos quando resolvem tarefas numéricas envolvendo situações aditivas, e ainda identificar aspetos associados à flexibilidade de cálculo e ao raciocínio quantitativo. Os resultados mostram que, no caso dos alunos do 1.º ano, o seu desempenho parece estar relacionado com o seu desenvolvimento do sentido do número e com as relações que dominam. Para os alunos do 2.º ano, o raciocínio inversivo constituiu um aspeto crítico, que conseguiram mobilizar depois de superadas as dificuldades iniciais. Os resultados sugerem, ainda, que estes alunos concebem a diferença como uma relação invariante numérica.

High Performance Multi-Standard Architecture for DCT Computation in H.264/AVC High Profile and HEVC Codecs

A new high performance architecture for the computation of all the DCT operations adopted in the H.264/AVC and HEVC standards is proposed in this paper. Contrasting to other dedicated transform cores, the presented multi-standard transform architecture is supported on a completely configurable, scalable and unified structure, that is able to compute not only the forward and the inverse 8×8 and 4×4 integer DCTs and the 4×4 and 2×2 Hadamard transforms defined in the H.264/AVC standard, but also the 4×4, 8×8, 16×16 and 32×32 integer transforms adopted in HEVC. Experimental results obtained using a Xilinx Virtex-7 FPGA demonstrated the superior performance and hardware efficiency levels provided by the proposed structure, which outperforms its more prominent related designs by at least 1.8 times. When integrated in a multi-core embedded system, this architecture allows the computation, in real-time, of all the transforms mentioned above for resolutions as high as the 8k Ultra High Definition Television (UHDTV) (7680×4320 @ 30fps).

Desenvolvimento de módulos para planeamento e controlo de execução de missões de veículos aéreos não tripulados

Com a evolução da tecnologia, os UAVs (unmanned aerial vehicles) são cada vez mais utilizados, não só em missões de risco para o ser Humano, mas também noutro tipo de missões, como é o caso de missões de inspeção, vigilância, busca e salvamento. Isto devese ao baixo custo das plataformas assim como à sua enorme fiabilidade e facilidade de operação. Esta dissertação surge da necessidade de aumentar a autonomia dos UAVs do projeto PITVANT (Projeto de Investigação e Tecnologia em Veículos Aéreos Não Tripulados), projeto de investigação colaborativa entre a AFA (Academia da Força Aérea) e a FEUP (Faculdade de Engenharia da Universidade do Porto), relativamente ao planeamento de trajetórias entre dois pontos no espaço, evitando os obstáculos que intersetem o caminho. Para executar o planeamento da trajetória mais curta entre dois pontos, foi implementado o algoritmo de pesquisa A*, por ser um algoritmo de pesquisa de soluções ótimas. A área de pesquisa é decomposta em células regulares e o centro das células são os nós de pesquisa do A*. O tamanho de cada célula é dependente da dinâmica de cada aeronave. Para que as aeronaves não colidam com os obstáculos, foi desenvolvido um método numérico baseado em relações trigonométricas para criar uma margem de segurança em torno de cada obstáculo. Estas margens de segurança são configuráveis, sendo o seu valor por defeito igual ao raio mínimo de curvatura da aeronave à velocidade de cruzeiro. De forma a avaliar a sua escalabilidade, o algoritmo foi avaliado com diferentes números de obstáculos. As métricas utilizadas para avaliação do algoritmo foram o tempo de computação do mesmo e o comprimento do trajeto obtido. Foi ainda comparado o desempenho do algoritmo desenvolvido com um algoritmo já implementado, do tipo fast marching.

Makespan computation for GPU threads running on a single streaming multiprocessor

Graphics processors were originally developed for rendering graphics but have recently evolved towards being an architecture for general-purpose computations. They are also expected to become important parts of embedded systems hardware -- not just for graphics. However, this necessitates the development of appropriate timing analysis techniques which would be required because techniques developed for CPU scheduling are not applicable. The reason is that we are not interested in how long it takes for any given GPU thread to complete, but rather how long it takes for all of them to complete. We therefore develop a simple method for finding an upper bound on the makespan of a group of GPU threads executing the same program and competing for the resources of a single streaming multiprocessor (whose architecture is based on NVIDIA Fermi, with some simplifying assunptions). We then build upon this method to formulate the derivation of the exact worst-case makespan (and corresponding schedule) as an optimization problem. Addressing the issue of tractability, we also present a technique for efficiently computing a safe estimate of the worstcase makespan with minimal pessimism, which may be used when finding an exact value would take too long.

Efficient computation of min and max sensor values in multihop networks

Consider a wireless sensor network (WSN) where a broadcast from a sensor node does not reach all sensor nodes in the network; such networks are often called multihop networks. Sensor nodes take individual sensor readings, however, in many cases, it is relevant to compute aggregated quantities of these readings. In fact, the minimum and maximum of all sensor readings at an instant are often interesting because they indicate abnormal behavior, for example if the maximum temperature is very high then it may be that a fire has broken out. In this context, we propose an algorithm for computing the min or max of sensor readings in a multihop network. This algorithm has the particularly interesting property of having a time complexity that does not depend on the number of sensor nodes; only the network diameter and the range of the value domain of sensor readings matter.

Numerical and experimental analyses of biocomposites reinforced with natural fibres

n the last decades the biocomposites have been widely used in the construction, automobile and aerospace industries. Not only the interface transition zone (ITZ) but also the heterogeneity of natural fibres affects the mechanical behaviour of these composites. This work focuses on the numerical and experimental analyses of a polymeric composite fabricated with epoxy resin and unidirectional sisal and banana fibres. A three-dimensional model was set to analyze the composites using the elastic properties of the individual phases. In addition, a two-dimensional model was set taking into account the effective composite properties obtained by micromechanical models. A tensile testing was performed to validate the numerical analyses and evaluating the interface condition of the constitutive phases.

Numerical and experimental study of tensile strength of single and double-strap repairs

Adhesive bonding as a joining or repair method has a wide application in many industries. Repairs with bonded patches are often carried out to re-establish the stiffness at critical regions or spots of corrosion and/or fatigue cracks. Single and double-strap repairs (SS and DS, respectively) are a viable option for repairing. For the SS repairs, a patch is adhesively-bonded on one of the structure faces. SS repairs are easy to execute, but the load eccentricity leads to peel peak stresses at the overlap edges. DS repairs involve the use of two patches, one on each face of the structure. These are more efficient than SS repairs, due to the doubling of the bonding area and suppression of the transverse deflection of the adherends. Shear stresses also become more uniform as a result of smaller differential straining. The experimental and Finite Element (FE) study presented here for strength prediction and design optimization of bonded repairs includes SS and DS solutions with different values of overlap length (LO). The examined values of LO include 10, 20 and 30 mm. The failure strengths of the SS and DS repairs were compared with FE results by using the Abaqus® FE software. A Cohesive Zone Model (CZM) with a triangular shape in pure tensile and shear modes, including the mixed-mode possibility for crack growth, was used to simulate fracture of the adhesive layer. A good agreement was found between the experiments and the FE simulations on the failure modes, elastic stiffness and strength of the repairs, showing the effectiveness and applicability of the proposed FE technique in predicting strength of bonded repairs. Furthermore, some optimization principles were proposed to repair structures with adhesively-bonded patches that will allow repair designers to effectively design bonded repairs.

Numerical prediction of delamination onset in carbon/epoxy composites drilling

Despite the fact that their physical properties make them an attractive family of materials, composites machining can cause several damage modes such as delamination, fibre pull-out, thermal degradation, and others. Minimization of axial thrust force during drilling reduces the probability of delamination onset, as it has been demonstrated by analytical models based on linear elastic fracture mechanics (LEFM). A finite element model considering solid elements of the ABAQUS® software library and interface elements including a cohesive damage model was developed in order to simulate thrust forces and delamination onset during drilling. Thrust force results for delamination onset are compared with existing analytical models.

A simple approach to numerical modelling of propane combustion in fluidized beds

A mathematical model is proposed for the evolution of temperature, chemical composition, and energy release in bubbles, clouds, and emulsion phase during combustion of gaseous premixtures of air and propane in a bubbling fluidized bed. The analysis begins as the bubbles are formed at the orifices of the distributor, until they explode inside the bed or emerge at the free surface of the bed. The model also considers the freeboard region of the fluidized bed until the propane is thoroughly burned. It is essentially built upon the quasi-global mechanism of Hautman et al. (1981) and the mass and heat transfer equations from the two-phase model of Davidson and Harrison (1963). The focus is not on a new modeling approach, but on combining the classical models of the kinetics and other diffusional aspects to obtain a better insight into the events occurring inside a fluidized bed reactor. Experimental data are obtained to validate the model by testing the combustion of commercial propane, in a laboratory-scale fluidized bed, using four sand particle sizes: 400–500, 315–400, 250–315, and 200–250 µm. The mole fractions of CO2, CO, and O2 in the flue gases and the temperature of the fluidized bed are measured and compared with the numerical results.

Experimental and numerical evaluation of composite repairs on wood beams damaged by cross-graining

An experimental and Finite Element study was performed on the bending behaviour of wood beams of the Pinus Pinaster species repaired with adhesively-bonded carbon–epoxy patches, after sustaining damage by cross-grain failure. This damage is characterized by crack growth at a small angle to the beams longitudinal axis, due to misalignment between the wood fibres and the beam axis. Cross-grain failure can occur in large-scale in a wood member when trees that have grown spirally or with a pronounced taper are cut for lumber. Three patch lengths were tested. The simulations include the possibility of cohesive fracture of the adhesive layer, failure within the wood beam in two propagation planes and patch interlaminar failure, by the use of cohesive zone modelling. The respective cohesive properties were estimated either by an inverse method or from the literature. The comparison with the tests allowed the validation of the proposed methodology, opening a good perspective for the reduction of costs in the design stages of these repairs due to extensive experimentation.

Numerical evaluation of three-dimensional scarf repairs in carbon-epoxy structures

The widespread employment of carbon-epoxy laminates in high responsibility and severely loaded applications introduces an issue regarding their handling after damage. Repair of these structures should be evaluated, instead of their disposal, for cost saving and ecological purposes. Under this perspective, the availability of efficient repair methods is essential to restore the strength of the structure. The development and validation of accurate predictive tools for the repairs behaviour are also extremely important, allowing the reduction of costs and time associated to extensive test programmes. Comparing with strap repairs, scarf repairs have the advantages of a higher efficiency and the absence of aerodynamic disturbance. This work reports on a numerical study of the tensile behaviour of three-dimensional scarf repairs in carbon-epoxy structures, using a ductile adhesive (Araldite® 2015). The finite elements analysis was performed in ABAQUS® and Cohesive Zone Modelling was used for the simulation of damage onset and growth in the adhesive layer. Trapezoidal cohesive laws in each pure mode were used to account for the ductility of the specific adhesive mentioned. A parametric study was performed on the repair width and scarf angle. The use of over-laminating plies covering the repaired region at the outer or both repair surfaces was also tested as an attempt to increase the repairs efficiency. The obtained results allowed the proposal of design principles for repairing composite structures.

Music and evolutionary computation

This paper presents a brief history of the western music: from its genesis to serialism and the Darmstadt school. Also some mathematical aspects of music are then presented and confronted with music as a form of art. The question is, are these two distinct aspects compatible? Can computers be of real help in automatic composition? The more appealing algorithmic approach is evolutionary computation as it offers creativity potential. Therefore, the Evolutionary Algorithms are then introduced and some results of GAs and GPs application to music generation are analysed.