Characterization and classification of tumor lesions using computerized fractal-based texture analysis and support vector machines in digital mammograms

Objective: This paper presents a detailed study of fractal-based methods for texture characterization of mammographic mass lesions and architectural distortion. The purpose of this study is to explore the use of fractal and lacunarity analysis for the characterization and classification of both tumor lesions and normal breast parenchyma in mammography. Materials and methods: We conducted comparative evaluations of five popular fractal dimension estimation methods for the characterization of the texture of mass lesions and architectural distortion. We applied the concept of lacunarity to the description of the spatial distribution of the pixel intensities in mammographic images. These methods were tested with a set of 57 breast masses and 60 normal breast parenchyma (dataset1), and with another set of 19 architectural distortions and 41 normal breast parenchyma (dataset2). Support vector machines (SVM) were used as a pattern classification method for tumor classification. Results: Experimental results showed that the fractal dimension of region of interest (ROIs) depicting mass lesions and architectural distortion was statistically significantly lower than that of normal breast parenchyma for all five methods. Receiver operating characteristic (ROC) analysis showed that fractional Brownian motion (FBM) method generated the highest area under ROC curve (A z = 0.839 for dataset1, 0.828 for dataset2, respectively) among five methods for both datasets. Lacunarity analysis showed that the ROIs depicting mass lesions and architectural distortion had higher lacunarities than those of ROIs depicting normal breast parenchyma. The combination of FBM fractal dimension and lacunarity yielded the highest A z value (0.903 and 0.875, respectively) than those based on single feature alone for both given datasets. The application of the SVM improved the performance of the fractal-based features in differentiating tumor lesions from normal breast parenchyma by generating higher A z value. Conclusion: FBM texture model is the most appropriate model for characterizing mammographic images due to self-affinity assumption of the method being a better approximation. Lacunarity is an effective counterpart measure of the fractal dimension in texture feature extraction in mammographic images. The classification results obtained in this work suggest that the SVM is an effective method with great potential for classification in mammographic image analysis.

The new localism, anti-political development machines, and the role of planning consultants: lessons from London's South Bank

This paper draws on a study of the politics of development planning in London’s South Bank to examine wider trends in the governance of contemporary cities. It assesses the impacts and outcomes of so-called new localist reforms and argues that we are witnessing two principal trends. First, governance processes are increasingly dominated by anti-democratic development machines, characterized by new assemblages of public- and private-sector experts. These machines reflect and reproduce a type of development politics in which there is a greater emphasis on a pragmatic realism and a politics of delivery. Second, the presence of these machines is having a significant impact on the politics of planning. Democratic engagement is not seen as the basis for new forms of localism and community control. Instead, it is presented as a potentially disruptive force that needs to be managed by a new breed of skilled private-sector consultant. The paper examines these wider shifts in urban politics before focusing on the connections between emerging development machines and local residential and business communities. It ends by highlighting some of the wider implications of change for democratic modes of engagement and nodes of resistance in urban politics.

On the cutting stock problem under stochastic demand

This paper addresses the one-dimensional cutting stock problem when demand is a random variable. The problem is formulated as a two-stage stochastic nonlinear program with recourse. The first stage decision variables are the number of objects to be cut according to a cutting pattern. The second stage decision variables are the number of holding or backordering items due to the decisions made in the first stage. The problem`s objective is to minimize the total expected cost incurred in both stages, due to waste and holding or backordering penalties. A Simplex-based method with column generation is proposed for solving a linear relaxation of the resulting optimization problem. The proposed method is evaluated by using two well-known measures of uncertainty effects in stochastic programming: the value of stochastic solution-VSS-and the expected value of perfect information-EVPI. The optimal two-stage solution is shown to be more effective than the alternative wait-and-see and expected value approaches, even under small variations in the parameters of the problem.

Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths

This paper deals with the classical one-dimensional integer cutting stock problem, which consists of cutting a set of available stock lengths in order to produce smaller ordered items. This process is carried out in order to optimize a given objective function (e.g., minimizing waste). Our study deals with a case in which there are several stock lengths available in limited quantities. Moreover, we have focused on problems of low demand. Some heuristic methods are proposed in order to obtain an integer solution and compared with others. The heuristic methods are empirically analyzed by solving a set of randomly generated instances and a set of instances from the literature. Concerning the latter. most of the optimal solutions of these instances are known, therefore it was possible to compare the solutions. The proposed methods presented very small objective function value gaps. (C) 2008 Elsevier Ltd. All rights reserved.

A Lagrangian relaxation approach to a coupled lot-sizing and cutting stock problem

Industrial production processes involving both lot-sizing and cutting stock problems are common in many industrial settings. However, they are usually treated in a separate way, which could lead to costly production plans. In this paper, a coupled mathematical model is formulated and a heuristic method based on Lagrangian relaxation is proposed. Computational results prove its effectiveness. (C) 2009 Elsevier B.V. All rights reserved.

Checking Completeness of Tests for Finite State Machines

In testing from a Finite State Machine (FSM), the generation of test suites which guarantee full fault detection, known as complete test suites, has been a long-standing research topic. In this paper, we present conditions that are sufficient for a test suite to be complete. We demonstrate that the existing conditions are special cases of the proposed ones. An algorithm that checks whether a given test suite is complete is given. The experimental results show that the algorithm can be used for relatively large FSMs and test suites.

Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm - for staged patterns - also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms. (c) 2007 Elsevier B.V. All rights reserved.

Activity of Ricinus communis (Euphorbiaceae) and ricinine against the leaf-cutting ant Atta sexdens rubropilosa (Hymenoptera : Formicidae) and the symbiotic fungus Leucoagaricus gongylophorus

The focus of this study was the identification of compounds from plant extracts for use in crop protection. This paper reports on the toxic activity of fractions of leaf extracts of Ricinus communis L (Euphorbiaceae) and isolated active compounds in the leaf-cutting ant Atta sexdens rubropilosa Forel and its symbiotic fungus Leucoagaricus gongylophorus (Singer) Moller. The main compounds responsible for activity against the fungus and ant in leaf extracts of R communis were found to be fatty acids for the former and ricinine for the ants. (C) 2004 Society of Chemical Industry.

Preliminary studies on the effects of d-limonene to workers of the leaf-cutting ant Atta sexdens rubropilosa and its implications for control

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

Nest Digging by Leaf-Cutting Ants: Effect of Group Size and Functional Structures.

Leaf-cutting ant workers dig underground chambers, for housing their symbiotic fungus, interconnected by a vast quantity of tunnels whose function is to permit the entrance of food (leaves), gaseous exchanges, andmovement of workers, offspring, and the queen. Digging is a task executed by a group of workers, but little is known about the group effect and group-constructed functional structures. Thus, we analyzed the structures formed by worker groups (5, 10, 20, and 40 individuals) of the leaf-cutting ant, Atta sexdens rubropilosa, for 2 days of excavation. The digging arena was the same for the 4 groups, with each group corresponding to a different density. Our results verified a pattern of tunneling by the workers, but no chamber was constructed. The group effect is well known, since the 40-worker group dug significantly more than the groups of 5, 10, and 20. These groups did not differ statistically from each other. Analysis of load/worker verified that workers of the smallest group carried the greatest load. Our paper demonstrates the group effect on the digging of nests, namely, that excavation is proportional to group size, but without emergence of a functional structure such as a chamber.

An Intelligent System for Petroleum Well Drilling Cutting Analysis

Cutting analysis is a important and crucial task task to detect and prevent problems during the petroleum well drilling process. Several studies have been developed for drilling inspection, but none of them takes care about analysing the generated cutting at the vibrating shale shakers. Here we proposed a system to analyse the cutting's concentration at the vibrating shale shakers, which can indicate problems during the petroleum well drilling process, such that the collapse of the well borehole walls. Cutting's images are acquired and sent to the data analysis module, which has as the main goal to extract features and to classify frames according to one of three previously classes of cutting's volume. A collection of supervised classifiers were applied in order to allow comparisons about their accuracy and efficiency. We used the Optimum-Path Forest (OPF), Artificial Neural Network using Multi layer Perceptrons (ANN-MLP), Support Vector Machines (SVM) and a Bayesian Classifier (BC) for this task. The first one outperformed all the remaining classifiers. Recall that we are also the first to introduce the OPF classifier in this field of knowledge. Very good results show the robustness of the proposed system, which can be also integrated with other commonly system (Mud-Logging) in order to improve the last one's efficiency.

Evaluation of the thermal damages in inlet engine valves varying the grinding wheels and the cutting fluids

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

Cutting forces in turning of gray cast iron using silicon nitride based cutting tool

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

Vibration Attenuation in Rotating Machines Using Smart Spring Mechanism

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Si3N4 ceramic cutting tool sintered with CeO2 and Al2O3 additives with AlCrN coating

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