Innovative manufacturing process for hybrid pultruded products based on cork and polymeric pre-shapes

Pultruded products are being targeted by a growing demand due to its excellent mechanical properties and low chemical reactivity, ensuring a low level of maintenance operations and allowing an easier assembly operation process than equivalent steel bars. In order to improve the mechanical drawing process and solve some acoustic and thermal insulation problems, pultruded pipes of glass fibre reinforced plastics (GFRF) can be filled with special products that increase their performance regarding the issues previously referred. The great challenge of this work was drawing a new equipment able to produce pultruded pipes filled with cork or polymeric pre-shaped bars as a continuous process. The project was carried out successfully and the new equipment was built and integrated in the pultrusion equipment already existing, allowing to obtain news products with higher added-value in the market, covering some needs previously identified in the field of civil construction.

Eco-efficiency approaches towards a sustainable composite materials manufacturing industry’

In this study the potential eco-efficiency performance of a pultrusion manufacturing company was assessed. Indicators values and eco-efficiency ratios were estimated taking into account the implementation of new proceedings and procedures in the production process of glass fibre reinforced polymers (GFRP) pultrusion profiles. Two different approaches were foreseen: 1)Adoption of a new heating system for pultrusion die in the manufacturing process, more effective and with minor heat losses; and 2) Recycling approach, with partial waste reuse of scrap material derived from manufacturing, cutting and assembly processes of GFRP profiles. These features lead to significant improvements on the sequent assessed eco-efficiency ratios of the present case study, yielding to a more sustainable product and manufacturing process of pultruded GFRP profiles.

How to reduce energy consumption on pultrusion

The global warming due to high CO2 emission in the last years has made energy saving a global problem nowadays. However, manufacturing processes such as pultrusion necessarily needs heat for curing the resin. Then, the only option available is to apply all efforts to make the process even more efficient. Different heating systems have been used on pultrusion, however, the most widely used are the planar resistances. The main objective of this study is to develop another heating system and compares it with the former one. Thermography was used in spite of define the temperature profile along the die. FEA (finite element analysis) allows to understand how many energy is spend with the initial heating system. After this first approach, changes were done on the die in order to test the new heating system and to check possible quality problems on the product. Thus, this work allows to conclude that with the new heating system a significant reduction in the setup time is now possible and an energy reduction of about 57% was achieved.

Optimization of the Pultrusion process

Manufacturing processes need permanently to innovate and optimize because any can be susceptible to continuous improvement. Innovation and commitment to the development of these new solutions resulting from existing expertise and the continuing need to increase productivity, flexibility and ensuring the necessary quality of the manufactured products. To increase flexibility, it is necessary to significantly reduce set-up times and lead time in order to ensure the delivery of products ever faster. This objective can be achieved through a normalization of the pultrusion line elements. Implicitly, there is an increase of productivity by this way. This work is intended to optimize the pultrusion process of structural profiles. We consider all elements of the system from the storehouse of the fibers (rack) to the pultrusion die. Particular attention was devoted to (a) the guidance system of the fibers and webs, (b) the resin container where the fibers are impregnated, (c) standard plates positioning of the fibers towards the entrance to the spinneret and also (d) reviewed the whole process of assembling and fixing the die as well as its the heating system. With the implementation of these new systems was achieved a significant saving of time set-up and were clearly reduced the unit costs of production. Quality assurance was also increased.

Occupational risk in a glass manufacturing industry unit

Risk assessment is one of the main pillars of the framework directive and other directives in respect of health and safety. It is also the basis of an effective management of safety and health as it is essential to reduce work-related accidents and occupational diseases. To survey the hazards eventually present in the workplaces the usual procedures are i) gathering information about tasks/activities, employees, equipment, legislation and standards; ii) observation of the tasks and; iii) quantification of respective risks through the most adequate risk assessment among the methodologies available. From this preliminary evaluation of a welding plant and, from the different measurable parameters, noise was considered the most critical. This paper focus not only the usual way of risk assessment for noise but also another approach that may allow us to identify the technique with which a weld is being performed.

Run-time defragmentation for dynamically reconfigurable hardware

Reconfigurable computing experienced a considerable expansion in the last few years, due in part to the fast run-time partial reconfiguration features offered by recent SRAM-based Field Programmable Gate Arrays (FPGAs), which allowed the implementation in real-time of dynamic resource allocation strategies, with multiple independent functions from different applications sharing the same logic resources in the space and temporal domains. However, when the sequence of reconfigurations to be performed is not predictable, the efficient management of the logic space available becomes the greatest challenge posed to these systems. Resource allocation decisions have to be made concurrently with system operation, taking into account function priorities and optimizing the space currently available. As a consequence of the unpredictability of this allocation procedure, the logic space becomes fragmented, with many small areas of free resources failing to satisfy most requests and so remaining unused. A rearrangement of the currently running functions is therefore necessary, so as to obtain enough contiguous space to implement incoming functions, avoiding the spreading of their components and the resulting degradation of system performance. A novel active relocation procedure for Configurable Logic Blocks (CLBs) is herein presented, able to carry out online rearrangements, defragmenting the available FPGA resources without disturbing functions currently running.

Comparative analysis of time-frequency methods estimating the time-varying microstructure of sleep EEG spindles

Proceedings of the Information Technology Applications in Biomedicine, Ioannina - Epirus, Greece, October 26-28, 2006

Potential dementia biomarkers based on the time-varying microstructure of sleep EEG spindles

Proceedings of the 29th Annual International Conference of the IEEE EMBS Cité Internationale, Lyon, France August 23-26, 2007

MASS CONSERVATION ENHANCEMENT OF FREE BOUNDARY FLOWS IN COMPOSITES MANUFACTURING

Undesirable void formation during the injection phase of the liquid composite molding process can be understood as a consequence of the non-uniformity of the flow front progression, caused by the dual porosity of the fiber perform. Therefore the best examination of the void formation physics can be provided by a mesolevel analysis, where the characteristic dimension is given by the fiber tow diameter. In mesolevel analysis, liquid impregnation along two different scales; inside fiber tows and within the spaces between them; must be considered and the coupling between these flow regimes must be addressed. In such case, it is extremely important to account correctly for the surface tension effects, which can be modeled as capillary pressure applied at the flow front. When continues Galerkin method is used, exploiting elements with velocity components and pressure as nodal variables, strong numerical implementation of such boundary conditions leads to ill-posing of the problem, in terms of the weak classical as well as stabilized formulation. As a consequence, there is an error in mass conservation accumulated especially along the free flow front. This article presents a numerical procedure, which was formulated and implemented in the existing Free Boundary Program in order to significantly reduce this error.

Mass Conservation Enhancement of Free Boundary Mesolevel Flows during LCM Processes of Composites Manufacturing

Undesirable void formation during the injection phase of the liquid composite moulding process can be understood as a consequence of the non-uniformity of the flow front progression, caused by the dual porosity of the fibre perform. Therefore the best examination of the void formation physics can be provided by a mesolevel analysis, where the characteristic dimension is given by the fibre tow diameter. In mesolevel analysis, liquid impregnation along two different scales; inside fibre tows and within the open spaces between them; must be considered and the coupling between these flow regimes must be addressed. In such case, it is extremely important to account correctly for the surface tension effects, which can be modelled as capillary pressure applied at the flow front. Numerical implementation of such boundary conditions leads to ill-posing of the problem, in terms of the weak classical as well as stabilized formulation. As a consequence, there is an error in mass conservation accumulated especially along the free flow front. This contribution presents a numerical procedure, which was formulated and implemented in the existing Free Boundary Program in order to significantly reduce this error.

Real Time Internet DGPS Service

The accuracy of the Navigation Satellite Timing and Ranging (NAVSTAR) Global Positioning System (GPS) measurements is insufficient for many outdoor navigation tasks. As a result, in the late nineties, a new methodology – the Differential GPS (DGPS) – was developed. The differential approach is based on the calculation and dissemination of the range errors of the GPS satellites received. GPS/DGPS receivers correlate the broadcasted GPS data with the DGPS corrections, granting users increased accuracy. DGPS data can be disseminated using terrestrial radio beacons, satellites and, more recently, the Internet. Our goal is to provide mobile platforms within our campus with DGPS data for precise outdoor navigation. To achieve this objective, we designed and implemented a three-tier client/server distributed system that establishes Internet links with remote DGPS sources and performs campus-wide dissemination of the obtained data. The Internet links are established between data servers connected to remote DGPS sources and the client, which is the data input module of the campus-wide DGPS data provider. The campus DGPS data provider allows the establishment of both Intranet and wireless links within the campus. This distributed system is expected to provide adequate support for accurate (submetric) outdoor navigation tasks.

Multi-agent system for distributed manufacturing scheduling with genetic algorithms and tabu search

Computerized scheduling methods and computerized scheduling systems according to exemplary embodiments. A computerized scheduling method may be stored in a memory and executed on one or more processors. The method may include defining a main multi-machine scheduling problem as a plurality of single machine scheduling problems; independently solving the plurality of single machine scheduling problems thereby calculating a plurality of near optimal single machine scheduling problem solutions; integrating the plurality of near optimal single machine scheduling problem solutions into a main multi-machine scheduling problem solution; and outputting the main multi-machine scheduling problem solution.

Multiple Linear Regression and Artificial Neural Networks to Predict Time and Efficiency of Soil Vapor Extraction

The prediction of the time and the efficiency of the remediation of contaminated soils using soil vapor extraction remain a difficult challenge to the scientific community and consultants. This work reports the development of multiple linear regression and artificial neural network models to predict the remediation time and efficiency of soil vapor extractions performed in soils contaminated separately with benzene, toluene, ethylbenzene, xylene, trichloroethylene, and perchloroethylene. The results demonstrated that the artificial neural network approach presents better performances when compared with multiple linear regression models. The artificial neural network model allowed an accurate prediction of remediation time and efficiency based on only soil and pollutants characteristics, and consequently allowing a simple and quick previous evaluation of the process viability.

Real-time scheduling with resource sharing on heterogeneous multiprocessors

Consider the problem of scheduling a task set τ of implicit-deadline sporadic tasks to meet all deadlines on a t-type heterogeneous multiprocessor platform where tasks may access multiple shared resources. The multiprocessor platform has m k processors of type-k, where k∈{1,2,…,t}. The execution time of a task depends on the type of processor on which it executes. The set of shared resources is denoted by R. For each task τ i , there is a resource set R i ⊆R such that for each job of τ i , during one phase of its execution, the job requests to hold the resource set R i exclusively with the interpretation that (i) the job makes a single request to hold all the resources in the resource set R i and (ii) at all times, when a job of τ i holds R i , no other job holds any resource in R i . Each job of task τ i may request the resource set R i at most once during its execution. A job is allowed to migrate when it requests a resource set and when it releases the resource set but a job is not allowed to migrate at other times. Our goal is to design a scheduling algorithm for this problem and prove its performance. We propose an algorithm, LP-EE-vpr, which offers the guarantee that if an implicit-deadline sporadic task set is schedulable on a t-type heterogeneous multiprocessor platform by an optimal scheduling algorithm that allows a job to migrate only when it requests or releases a resource set, then our algorithm also meets the deadlines with the same restriction on job migration, if given processors 4×(1+MAXP×⌈|P|×MAXPmin{m1,m2,…,mt}⌉) times as fast. (Here MAXP and |P| are computed based on the resource sets that tasks request.) For the special case that each task requests at most one resource, the bound of LP-EE-vpr collapses to 4×(1+⌈|R|min{m1,m2,…,mt}⌉). To the best of our knowledge, LP-EE-vpr is the first algorithm with proven performance guarantee for real-time scheduling of sporadic tasks with resource sharing on t-type heterogeneous multiprocessors.

Efficient schedulability tests for real-time embedded systems with urgent routines

Task scheduling is one of the key mechanisms to ensure timeliness in embedded real-time systems. Such systems have often the need to execute not only application tasks but also some urgent routines (e.g. error-detection actions, consistency checkers, interrupt handlers) with minimum latency. Although fixed-priority schedulers such as Rate-Monotonic (RM) are in line with this need, they usually make a low processor utilization available to the system. Moreover, this availability usually decreases with the number of considered tasks. If dynamic-priority schedulers such as Earliest Deadline First (EDF) are applied instead, high system utilization can be guaranteed but the minimum latency for executing urgent routines may not be ensured. In this paper we describe a scheduling model according to which urgent routines are executed at the highest priority level and all other system tasks are scheduled by EDF. We show that the guaranteed processor utilization for the assumed scheduling model is at least as high as the one provided by RM for two tasks, namely 2(2√−1). Seven polynomial time tests for checking the system timeliness are derived and proved correct. The proposed tests are compared against each other and to an exact but exponential running time test.