Wavelet-based algorithm to the evaluation of contrasted hepatocellular carcinoma in CT-images after transarterial chemoembolization

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

A Modified Branch and Bound Algorithm to Solve the Transmission Expansion Planning Problem

In this paper a novel Branch and Bound (B&B) algorithm to solve the transmission expansion planning which is a non-convex mixed integer nonlinear programming problem (MINLP) is presented. Based on defining the options of the separating variables and makes a search in breadth, we call this algorithm a B&BML algorithm. The proposed algorithm is implemented in AMPL and an open source Ipopt solver is used to solve the nonlinear programming (NLP) problems of all candidates in the B&B tree. Strategies have been developed to address the problem of non-linearity and non-convexity of the search region. The proposed algorithm is applied to the problem of long-term transmission expansion planning modeled as an MINLP problem. The proposed algorithm has carried out on five commonly used test systems such as Garver 6-Bus, IEEE 24-Bus, 46-Bus South Brazilian test systems, Bolivian 57-Bus, and Colombian 93-Bus. Results show that the proposed methodology not only can find the best known solution but it also yields a large reduction between 24% to 77.6% in the number of NLP problems regarding to the size of the systems.

Transmission Expansion Planning Via a Constructive Heuristic Algorithm in Restructured Electricity Industry

The transmission expansion planning problem in modern power systems is a large-scale, mixed-integer, nonlinear and non-convex problem. this paper presents a new mathematical model and a constructive heuristic algorithm (CHA) for solving transmission expansion planning problem under new environment of electricity restructuring. CHA finds an acceptable solution in an iterative process, where in each step a circuit is chosen using a sensitivity index and added to the system. The proposed model consider multiple generation scenarios therefore the methodology finds high quality solution in which it allows the power system operate adequacy in an environment with multiple generators scenarios. Case studies and simulation results using test systems show possibility of using Constructive heuristic algorithm in an open access system.

Utilização de 5S, Kanban e Layout para a melhoria do controle de estoque em um varejo de materiais para construção

Many small businesses suffer from a lack of control of goods stored. This lack of control affects other areas of the company as purchase, that can’t buy material in an advanced and accurated way. It also affects services provided by the company, especially when it is a store because for sell something it is necessary to have the material in the right time. Futhermore, the business isn’t able to identify obsolete items in stock, theft and vandalism, loss or damage to materials. All of these disorders can be converted into financial losses that make much difference to a small business that needs to remain competitive in the market facing the giants while generating a profit that allows it to invest in their growth. Therefore, any unnecessary expense is exceedingly harmful and any savings already differentiates it from other companies of similar size. This study deals with the application of production engineering tools as 5S, kanban and layout in a building materials retail to tackle problems that prevent this company to have a stock organized and accurated. Finally, we recorded gains that the company reached with the implementation of part of the solution proposed

Projeto de arquitetura de interiores, utilizando critérios de sustentabilidade ambiental: reformulação do layout das secretarias da prefeitura municipal de Bauru

Tendo como foco o estudo da área interna do edifício da Prefeitura Municipal de Bauru, o trabalho em questão visa o desenvolvimento de um projeto de interiores utilizando requisitos da arquitetura corporativa, e critérios de sustentabilidade para a escolha de materiais. Será considerada ainda a eficiência energética na utilização de condicionamento de ar e iluminação, assim como a otimização dos espaços de permanência e fluxo de pessoas

Análise doprojeto de expansãode um armazém por meio da elaboração de um layout e análise de investimento: estudo de caso em uma fábrica do setor alimentício

The proper management of materials storage is essential to supply the needs of production and reduce the inventory costs. Moreover, an effective layout contributes to improve the productivity and reduce the operational costs of a warehouse. This way, the purpose of this study was: to propose an expansion project to the warehouse of a factory in the food sector, suggesting a layout that best fit their needs and to verify its economic feasibility. To achieve this goal, it was applied methods such as ABC curve, spaghetti diagram and concepts of economics engineering to the analysis of investment in the project. The results showed that the second layout model was better than the first, supporting the storage capacity required by the company and presenting an internal movement more efficient. However, with the investment analysis, it was found that it was not feasible, given the conditions of the company, investing in the expansion of the warehouse

Improvements in the score matrix calculation method using parallel score estimating algorithm

The increasing amount of sequences stored in genomic databases has become unfeasible to the sequential analysis. Then, the parallel computing brought its power to the Bioinformatics through parallel algorithms to align and analyze the sequences, providing improvements mainly in the running time of these algorithms. In many situations, the parallel strategy contributes to reducing the computational complexity of the big problems. This work shows some results obtained by an implementation of a parallel score estimating technique for the score matrix calculation stage, which is the first stage of a progressive multiple sequence alignment. The performance and quality of the parallel score estimating are compared with the results of a dynamic programming approach also implemented in parallel. This comparison shows a significant reduction of running time. Moreover, the quality of the final alignment, using the new strategy, is analyzed and compared with the quality of the approach with dynamic programming.

Optimizing urban traffic flow using genetic algorithm with petri net analysis as fitness function

This paper describes a new methodology adopted for urban traffic stream optimization. By using Petri net analysis as fitness function of a Genetic Algorithm, an entire urban road network is controlled in real time. With the advent of new technologies that have been published, particularly focusing on communications among vehicles and roads infrastructures, we consider that vehicles can provide their positions and their destinations to a central server so that it is able to calculate the best route for one of them. Our tests concentrate on comparisons between the proposed approach and other algorithms that are currently used for the same purpose, being possible to conclude that our algorithm optimizes traffic in a relevant manner.

MR-Radix: a multi-relational data mining algorithm

Background: Once multi-relational approach has emerged as an alternative for analyzing structured data such as relational databases, since they allow applying data mining in multiple tables directly, thus avoiding expensive joining operations and semantic losses, this work proposes an algorithm with multi-relational approach. Methods: Aiming to compare traditional approach performance and multi-relational for mining association rules, this paper discusses an empirical study between PatriciaMine - an traditional algorithm - and its corresponding multi-relational proposed, MR-Radix. Results: This work showed advantages of the multi-relational approach in performance over several tables, which avoids the high cost for joining operations from multiple tables and semantic losses. The performance provided by the algorithm MR-Radix shows faster than PatriciaMine, despite handling complex multi-relational patterns. The utilized memory indicates a more conservative growth curve for MR-Radix than PatriciaMine, which shows the increase in demand of frequent items in MR-Radix does not result in a significant growth of utilized memory like in PatriciaMine. Conclusion: The comparative study between PatriciaMine and MR-Radix confirmed efficacy of the multi-relational approach in data mining process both in terms of execution time and in relation to memory usage. Besides that, the multi-relational proposed algorithm, unlike other algorithms of this approach, is efficient for use in large relational databases.

Planejamento e controle da produção: reestruturação no layout de apertadeiras eletrônicas em uma linha de produção do ramo de autopeças

In industrial plants, there is a department responsible for planning the use of productive resources to find the best possible way to set out plans in strategic, tactical and operational levels. This department is known as PCP or PPCP, which means Planning and Production Control and Planning, Programming and Production Control, respectively. This work presents the use of some of the tools from this department, in particular the Aggregate Production Planning, to propose a new layout of electronic nutrunners for an auto parts industry output line. Through some process indicators analyzes, was identified some productivity losses. The higher loss rate occurred by the electronic nutrunners breaking, and so this work was focused in these devices. Some premises were adopted for the use of electronic nut runners, setting an ideal cycle time for the operation of the production line and making calculations to define the minimum amount of electronic nutrunners to find the production demand without damaging the equipment. With this work we observed that a relevant factor for the constant breaks of electronic nutrunners is because these are working with overload, in other words, the amount of installed equipment is not enough to supply the demand without failures

Proposta de melhoria do layout de um armazém de vidros automotivos

This work was based on a case study of improvement of the warehouse layout of a multinational automotive glass sector, located in the State of Sao Paulo. The aim was to propose a layout template to be more effective and besides optimizing production would also promote an increase in warehouse packaging capacity for metal containers containing glasses, thus reducing operating costs. To achieve the desired purpose, it was developed two layout proposals and to this end inventory management tools have been used, such as ABC curve and the Spaghetti Diagram, and other concepts of Packaging Engineering and Logistics. By the end of this work, it was obtained as a result, a project in which it was possible to rearrange the packages according the demand, and the developed changes became the most efficient layout both in storage capacity as well as in the internal drive

Reconfiguration of radial electric power distribution system via a scatter search algorithm

In this paper, to solve the reconfiguration problem of radial distribution systems a scatter search, which is a metaheuristic-based algorithm, is proposed. In the codification process of this algorithm a structure called node-depth representation is used. It then, via the operators and from the electrical power system point of view, results finding only radial topologies. In order to show the effectiveness, usefulness, and the efficiency of the proposed method, a commonly used test system, 135-bus, and a practical system, a part of Sao Paulo state's distribution network, 7052 bus, are conducted. Results confirm the efficiency of the proposed algorithm that can find high quality solutions satisfying all the physical and operational constraints of the problem.

Multiobjective Genetic Algorithm applied to dengue control

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

A self-learning simulated annealing algorithm for global optimizations of electromagnetic devices

A self-learning simulated annealing algorithm is developed by combining the characteristics of simulated annealing and domain elimination methods. The algorithm is validated by using a standard mathematical function and by optimizing the end region of a practical power transformer. The numerical results show that the CPU time required by the proposed method is about one third of that using conventional simulated annealing algorithm.

Deteccão de complexos QRS em eletrocardiogramas baseada na decomposição em valores singulares em multirresolução

Pós-graduação em Engenharia Elétrica - FEIS