Implementação do algoritmo (RTM) para processamento sísmico em arquiteturas não convencionais

With the growth of energy consumption worldwide, conventional reservoirs, the reservoirs called "easy exploration and production" are not meeting the global energy demand. This has led many researchers to develop projects that will address these needs, companies in the oil sector has invested in techniques that helping in locating and drilling wells. One of the techniques employed in oil exploration process is the reverse time migration (RTM), in English, Reverse Time Migration, which is a method of seismic imaging that produces excellent image of the subsurface. It is algorithm based in calculation on the wave equation. RTM is considered one of the most advanced seismic imaging techniques. The economic value of the oil reserves that require RTM to be localized is very high, this means that the development of these algorithms becomes a competitive differentiator for companies seismic processing. But, it requires great computational power, that it still somehow harms its practical success. The objective of this work is to explore the implementation of this algorithm in unconventional architectures, specifically GPUs using the CUDA by making an analysis of the difficulties in developing the same, as well as the performance of the algorithm in the sequential and parallel version

Projeto, construção e análise de um prototipo vibracional em escala de bancada aplicável ao tratamento de água de produção de petróleo bruto, mediante inovadora operação híbrida de adsorção e auto-flotação

A self-flotator vibrational prototype electromechanical drive for treatment of oil and water emulsion or like emulsion is presented and evaluated. Oil production and refining to obtain derivatives is carried out under arrangements technically referred to as on-shore and off-shore, ie, on the continent and in the sea. In Brazil 80 % of the petroleum production is taken at sea and area of deployment and it cost scale are worrisome. It is associated, oily water production on a large scale, carrier 95% of the potential pollutant of activity whose final destination is the environment medium, terrestrial or maritime. Although diversified set of techniques and water treatment systems are in use or research, we propose an innovative system that operates in a sustainable way without chemical additives, for the good of the ecosystem. Labyrinth adsor-bent is used in metal spirals, and laboratory scale flow. Equipment and process patents are claimed. Treatments were performed at different flow rates and bands often monitored with control systems, some built, other bought for this purpose. Measurements of the levels of oil and grease (OGC) of efluents treaty remained within the range of legal framework under test conditions. Adsorbents were weighed before and after treatment for obtaining oil impregna-tion, the performance goal of vibratory action and treatment as a whole. Treatment technolo-gies in course are referenced, to compare performance, qualitatively and quantitatively. The vibration energy consumption is faced with and without conventional flotation and self-flotation. There are good prospects for the proposed, especially in reducing the residence time, by capillary action system. The impregnation dimensionless parameter was created and confronted with consecrated dimensionless parameters, on the vibrational version, such as Weber number and Froude number in quadratic form, referred to as vibrational criticality. Re-sults suggest limits to the vibration intensity

Períodos de interferência das plantas daninhas em algodoeiro de fibra colorida ‘BRS Safira’

This study aimed to determine the late-season presence of weeds in reddish brown cotton (cultivar BRS Safira) and the critical times for removing weeds. The experiment was carried out in the area of Empresa Brasileira de Pesquisa Agropecuária (EMBRAPA) in Missao Velha-CE, Brazil, located at 7 degrees 42'07" S latitude and 39 degrees 24'18" WGr. longitude, during the 2007/2008 season. The treatments consisted of two control groups: weed-free crop during the initial period after crop emergency, and crop kept with weeds during initial period after plant emergency. Both consisted, 0; 20; 40; 60; 80 e 120 days after crop emergency (DAE), the weed community was evaluated by two phytosociological indices (relative dominance and relative importance). Regression analysis was performed as the model of sigmoidal Boltzman, using data from productivity separately within each type of competition, to identify the critical periods of competition, considering 2; 5 and 10% reduction in yield. The community of weeds was composed by 21 species, standing out among them: Richardia grandiflora, Amaranthus deflexus, Eleusine indica, Merremia aegyptia, Eragrotis pilosa, Cenchrus echinatus and Waltheria indica. Considering 2; 5 and 10% reduction in yield fiber as acceptable, the critical period before weed interference were, respectively, 8; 14 and 20 DAE. The critical period of weed interference, for those same levels of losses, were respectively, 100; 82 and 60 days.

Group Sequential Communication (GSC): Especificação e Análise de Desempenho de umMecanismo de Comunicação de Tempo Real Compatível ao Padrão IEEE 802.11/11e Aplicado à Automação Industrial

This thesis proposes the specification and performance analysis of a real-time communication mechanism for IEEE 802.11/11e standard. This approach is called Group Sequential Communication (GSC). The GSC has a better performance for dealing with small data packets when compared to the HCCA mechanism by adopting a decentralized medium access control using a publish/subscribe communication scheme. The main objective of the thesis is the HCCA overhead reduction of the Polling, ACK and QoS Null frames exchanged between the Hybrid Coordinator and the polled stations. The GSC eliminates the polling scheme used by HCCA scheduling algorithm by using a Virtual Token Passing procedure among members of the real-time group to whom a high-priority and sequential access to communication medium is granted. In order to improve the reliability of the mechanism proposed into a noisy channel, it is presented an error recovery scheme called second chance algorithm. This scheme is based on block acknowledgment strategy where there is a possibility of retransmitting when missing real-time messages. Thus, the GSC mechanism maintains the real-time traffic across many IEEE 802.11/11e devices, optimized bandwidth usage and minimal delay variation for data packets in the wireless network. For validation purpose of the communication scheme, the GSC and HCCA mechanisms have been implemented in network simulation software developed in C/C++ and their performance results were compared. The experiments show the efficiency of the GSC mechanism, especially in industrial communication scenarios.

Algoritmo SOM com estrutura hierárquica e dinâmica aplicado a compressão de imagens

ln this work the implementation of the SOM (Self Organizing Maps) algorithm or Kohonen neural network is presented in the form of hierarchical structures, applied to the compression of images. The main objective of this approach is to develop an Hierarchical SOM algorithm with static structure and another one with dynamic structure to generate codebooks (books of codes) in the process of the image Vector Quantization (VQ), reducing the time of processing and obtaining a good rate of compression of images with a minimum degradation of the quality in relation to the original image. Both self-organizing neural networks developed here, were denominated HSOM, for static case, and DHSOM, for the dynamic case. ln the first form, the hierarchical structure is previously defined and in the later this structure grows in an automatic way in agreement with heuristic rules that explore the data of the training group without use of external parameters. For the network, the heuristic mIes determine the dynamics of growth, the pruning of ramifications criteria, the flexibility and the size of children maps. The LBO (Linde-Buzo-Oray) algorithm or K-means, one ofthe more used algorithms to develop codebook for Vector Quantization, was used together with the algorithm of Kohonen in its basic form, that is, not hierarchical, as a reference to compare the performance of the algorithms here proposed. A performance analysis between the two hierarchical structures is also accomplished in this work. The efficiency of the proposed processing is verified by the reduction in the complexity computational compared to the traditional algorithms, as well as, through the quantitative analysis of the images reconstructed in function of the parameters: (PSNR) peak signal-to-noise ratio and (MSE) medium squared error

Modelagem aplicada à análise de desempenho do provedor de serviços de uma rede de automação hospitalar ieee 802.3/pm-ah de tempo real

The incorporate of industrial automation in the medical are requires mechanisms to safety and efficient establishment of communication between biomedical devices. One solution to this problem is the MP-HA (Multicycles Protocol to Hospital Automation) that down a segmented network by beds coordinated by an element called Service Provider. The goal of this work is to model this Service Provider and to do performance analysis of the activities executed by in establishment and maintenance of hospital networks

Enumeração de espectro de distâncias de esquemas de modulação codificada em treliça empregando codificação turbo

In this work, a performance analysis of transmission schemes employing turbo trellis coded modulation. In general, the performance analysis of such schemes is guided by evaluating the error probability of these schemes. The exact evaluation of this probability is very complex and inefficient from the computational point of view, a widely used alternative is the use of union bound of error probability, because of its easy implementation and computational produce bounds that converge quickly. Since it is the union bound, it should use to expurge some elements of distance spectrum to obtain a tight bound. The main contribution of this work is that the listing proposal is carried out from the puncturing at the level of symbol rather than bit-level as in most works of literature. The main reason for using the symbol level puncturing lies in the fact that the enummerating function of the turbo scheme is obtained directly from complex sequences of signals through the trellis and not indirectly from the binary sequences that require further binary to complex mapping, as proposed by previous works. Thus, algorithms can be applied through matrix from the adjacency matrix, which is obtained by calculating the distances of the complex sequences of the trellis. This work also presents two matrix algorithms for state reduction and the evaluation of the transfer function of this. The results presented in comparisons of the bounds obtained using the proposed technique with some turbo codes of the literature corroborate the proposition of this paper that the expurgated bounds obtained are quite tight and matrix algorithms are easily implemented in any programming software language

Análise de desempenho na rede metropolitana de saúde da Universidade Federal do Rio Grande do Norte : um dimensionamento aplicado a telemedicina e a telessaúde utilizando QoS baseado no padrão IEEE 802.1Q

It s notorious the advance of computer networks in recent decades, whether in relation to transmission rates, the number of interconnected devices or the existing applications. In parallel, it s also visible this progress in various sectors of the automation, such as: industrial, commercial and residential. In one of its branches, we find the hospital networks, which can make the use of a range of services, ranging from the simple registration of patients to a surgery by a robot under the supervision of a physician. In the context of both worlds, appear the applications in Telemedicine and Telehealth, which work with the transfer in real time of high resolution images, sound, video and patient data. Then comes a problem, since the computer networks, originally developed for the transfer of less complex data, is now being used by a service that involves high transfer rates and needs requirements for quality of service (QoS) offered by the network . Thus, this work aims to do the analysis and comparison of performance of a network when subjected to this type of application, for two different situations: the first without the use of QoS policies, and the second with the application of such policies, using as scenario for testing, the Metropolitan Health Network of the Federal University of Rio Grande do Norte (UFRN)

Estimação de Fasores para Proteção de Sistemas Elétricos Baseada em Mínimos Quadrados e Morfologia Matemática

This work proposes a new technique for phasor estimation applied in microprocessor numerical relays for distance protection of transmission lines, based on the recursive least squares method and called least squares modified random walking. The phasor estimation methods have compromised their performance, mainly due to the DC exponential decaying component present in fault currents. In order to reduce the influence of the DC component, a Morphological Filter (FM) was added to the method of least squares and previously applied to the process of phasor estimation. The presented method is implemented in MATLABr and its performance is compared to one-cycle Fourier technique and conventional phasor estimation, which was also based on least squares algorithm. The methods based on least squares technique used for comparison with the proposed method were: forgetting factor recursive, covariance resetting and random walking. The techniques performance analysis were carried out by means of signals synthetic and signals provided of simulations on the Alternative Transient Program (ATP). When compared to other phasor estimation methods, the proposed method showed satisfactory results, when it comes to the estimation speed, the steady state oscillation and the overshoot. Then, the presented method performance was analyzed by means of variations in the fault parameters (resistance, distance, angle of incidence and type of fault). Through this study, the results did not showed significant variations in method performance. Besides, the apparent impedance trajectory and estimated distance of the fault were analysed, and the presented method showed better results in comparison to one-cycle Fourier algorithm

Implementação paralela escalável e eficiente do algoritmo simplex padrão em arquitetura multicore

This work presents a scalable and efficient parallel implementation of the Standard Simplex algorithm in the multicore architecture to solve large scale linear programming problems. We present a general scheme explaining how each step of the standard Simplex algorithm was parallelized, indicating some important points of the parallel implementation. Performance analysis were conducted by comparing the sequential time using the Simplex tableau and the Simplex of the CPLEXR IBM. The experiments were executed on a shared memory machine with 24 cores. The scalability analysis was performed with problems of different dimensions, finding evidence that our parallel standard Simplex algorithm has a better parallel efficiency for problems with more variables than constraints. In comparison with CPLEXR , the proposed parallel algorithm achieved a efficiency of up to 16 times better

Mapeamento geoambiental do campo de dunas Pirangi-Potengi com ênfase a San Vale e Lagoinha Natal/RN: um instrumento de apoio ao planejamento ambiental

The city of Natal-RN is constructed on dune areas with wavy relives softly waved and green areas that help to keep a pleasant climate, amongst these is distinguished field Pirangi-Potengi the dune with the areas of San Vale and Lagoinha. These environments are being substituted gradual for property and other workmanships of engineering on behalf of the urban expansion. This study the elaboration of a geoambiental mapping of Field had as objective generality Pirangi-Potengi the Dune with emphasis the San Vale and Lagoinha in Natal-RN. The done mapping had as objective specific to elaborate a vegetation map, a map of registers in cadastre of ambient problems to dunes, a map of flooding susceptibility, a map of vulnerability to the underground water contamination and a map of use and occupation of the ground. Of the carried through analysis, the area in study reveals sufficiently degraded, remaining only few green areas and dunares, as well as, the vulnerable presence of areas of vulnerability in floods and areas the contamination of the water-bearing one. The gotten results allow to affirm that this type of mapping, is of great importance for analysis and evaluation of the environment of the city

On developing efficient applications using conservative distributed simulation paradigm

This paper aims to present, using a set of guidelines, how to apply the conservative distributed simulation paradigm (CMB protocol) to develop efficient applications. Using these guidelines, even a user with little experience on distributed simulation and computer architecture can have good performance on distributed simulations using conservative synchronization protocols for parallel processes.The set of guidelines is focus on a specific application domain, the performance evaluation of computer systems, considering models with coarse granularity and few logical processes and running over two platforms: parallel (high performance communication environment) and distributed (low performance communication environment).

Retificação da alumina com rebolo diamantado utilizando-se diferentes métodos de lubri-refrigeração

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

O problema biobjetivo da árvore geradora quadrática em adjacência de arestas

The Quadratic Minimum Spanning Tree Problem (QMST) is a version of the Minimum Spanning Tree Problem in which, besides the traditional linear costs, there is a quadratic structure of costs. This quadratic structure models interaction effects between pairs of edges. Linear and quadratic costs are added up to constitute the total cost of the spanning tree, which must be minimized. When these interactions are restricted to adjacent edges, the problem is named Adjacent Only Quadratic Minimum Spanning Tree (AQMST). AQMST and QMST are NP-hard problems that model several problems of transport and distribution networks design. In general, AQMST arises as a more suitable model for real problems. Although, in literature, linear and quadratic costs are added, in real applications, they may be conflicting. In this case, it may be interesting to consider these costs separately. In this sense, Multiobjective Optimization provides a more realistic model for QMST and AQMST. A review of the state-of-the-art, so far, was not able to find papers regarding these problems under a biobjective point of view. Thus, the objective of this Thesis is the development of exact and heuristic algorithms for the Biobjective Adjacent Only Quadratic Spanning Tree Problem (bi-AQST). In order to do so, as theoretical foundation, other NP-hard problems directly related to bi-AQST are discussed: the QMST and AQMST problems. Bracktracking and branch-and-bound exact algorithms are proposed to the target problem of this investigation. The heuristic algorithms developed are: Pareto Local Search, Tabu Search with ejection chain, Transgenetic Algorithm, NSGA-II and a hybridization of the two last-mentioned proposals called NSTA. The proposed algorithms are compared to each other through performance analysis regarding computational experiments with instances adapted from the QMST literature. With regard to exact algorithms, the analysis considers, in particular, the execution time. In case of the heuristic algorithms, besides execution time, the quality of the generated approximation sets is evaluated. Quality indicators are used to assess such information. Appropriate statistical tools are used to measure the performance of exact and heuristic algorithms. Considering the set of instances adopted as well as the criteria of execution time and quality of the generated approximation set, the experiments showed that the Tabu Search with ejection chain approach obtained the best results and the transgenetic algorithm ranked second. The PLS algorithm obtained good quality solutions, but at a very high computational time compared to the other (meta)heuristics, getting the third place. NSTA and NSGA-II algorithms got the last positions

Um ambiente multi-middleware para desenvolvimento de aplicações distribuídas

This work presents a proposal of a multi-middleware environment to develop distributed applications, which abstracts different underlying middleware platforms. This work describes: (i) the reference architecture designed for the environment, (ii) an implementation which aims to validate the specified architecture integrating CORBA and EJB, (iii) a case study illustrating the use of the environment, (iv) a performance analysis. The proposed environment allows interoperability on middleware platforms, allowing the reuse of components of different kinds of middleware platforms in a transparency away to the developer and without major losses in performance. Also in the implementation we developed an Eclipse plugin which allows developers gain greater productivity at developing distributed applications using the proposed environment