Experimental study on micro EDM-drilling of Ti6Al4V using helical electrode

There is a growing interest in the machining of micro-holes with high aspect-ratio in difficult-to-machine alloys for the aerospace industry. Processes based on electro discharge machining (EDM) and developed for the manufacture of both micro-electrode and micro-hole are actually used, but most of them involve micro-EDM machines. In this work, the influence of EDM parameters on material removal rate, electrode wear, machining time and micro-hole quality when machining Ti6Al4V is studied. Due to an inefficient removal of debris when increasing hole depth, a new strategy based on the use of helical-shaped electrodes has been proposed. The influence of helix angle and flute depth with respect to process performance has been addressed. Main results include 37% reduction in machining times (hole diameter 800 μm) when using electrode helix angle of 45° and flute-depth of 50 μm, and an additional 19% with flute-depth of 150 μm. Holes of 661 μm diameter and as much as 6.81 mm depth, which yields in aspect ratio of 10:1, have successfully been machined in Ti6Al4V.     

Bayesian classification for the selection of in vitro human embryos using morphological and clinical data

In vitro fertilization (IVF) is a medically assisted reproduction technique that enables infertile couples to achieve successful pregnancy. Given the uncertainty of the treatment, we propose an intelligent decision support system based on supervised classification by Bayesian classifiers to aid to the selection of the most promising embryos that will form the batch to be transferred to the woman's uterus. The aim of the supervised classification system is to improve overall success rate of each IVF treatment in which a batch of embryos is transferred each time, where the success is achieved when implantation (i.e. pregnancy) is obtained. Due to ethical reasons, different legislative restrictions apply in every country on this technique. In Spain, legislation allows a maximum of three embryos to form each transfer batch. As a result, clinicians prefer to select the embryos by non-invasive embryo examination based on simple methods and observation focused on morphology and dynamics of embryo development after fertilization. This paper proposes the application of Bayesian classifiers to this embryo selection problem in order to provide a decision support system that allows a more accurate selection than with the actual procedures which fully rely on the expertise and experience of embryologists. For this, we propose to take into consideration a reduced subset of feature variables related to embryo morphology and clinical data of patients, and from this data to induce Bayesian classification models. Results obtained applying a filter technique to choose the subset of variables, and the performance of Bayesian classifiers using them, are presented.     

Cutting process in glass peripheral milling

Peripheral glass milling for trimmings of several devices and touch panels is studied with measuring cutting forces and observing surface damages. Peripheral millings were performed to cut the end faces of 1 mm thick glass plates. In order to discuss the typical cutting force in glass milling, the cutting forces were compared with those of 0.45% carbon steel (AISI 1045) at high feed rates in a large radial depth of cut. The differences of the cutting force in glass milling from that of metal milling are: (1) the change in the cutting force does not correspond to the uncut chip thickness; and (2) the maximum cutting force does not change with the feed rate. A model is proposed to predict the cutting forces in glass millings, which are performed in ductile, ductile/brittle complex and brittle modes. The cutting force depends on the uncut chip thickness in a ductile mode. In a brittle mode, the mean value of the cutting force does not change though the vibration component becomes large. Because the uncut chip thickness changes with the dynamic displacement of the cutting edge, the cutting process is performed in a ductile/brittle complex mode when the cutting mode changes in ductile–brittle transition. The critical uncut chip thickness at the transition from a ductile to a ductile/brittle complex mode and that of the transition from a ductile/brittle complex to brittle mode are determined in the rate of the cutting force change. The force model is verified by the cutting forces in up- and down-cutting milling operations. Then, the surface finishing and crack propagation in up- and down-cutting millings were analyzed to define the cutter path in glass trimming. Cracks propagate to the surface to be finally finished in down-cutting; while cracks propagate to the chip to be removed in up-cutting. The cutter path in up-cutting milling should be selected to finish the fine surfaces.     

Inexact graph matching by means of estimation of distribution algorithms

Estimation of distribution algorithms (EDAs) are a quite recent topic in optimization techniques. They combine two technical disciplines of soft computing methodologies: probabilistic reasoning and evolutionary computing. Several algorithms and approaches have already been proposed by different authors, but up to now there are very few papers showing their potential and comparing them to other evolutionary computational methods and algorithms such as genetic algorithms (GAs). This paper focuses on the problem of inexact graph matching which is NP-hard and requires techniques to find an approximate acceptable solution. This problem arises when a nonbijective correspondence is searched between two graphs. A typical instance of this problem corresponds to the case where graphs are used for structural pattern recognition in images. EDA algorithms are well suited for this type of problems.

This paper proposes to use EDA algorithms as a new approach for inexact graph matching. Also, two adaptations of the EDA approach to problems with constraints are described as two techniques to control the generation of individuals, and the performance of EDAs for inexact graph matching is compared with the one of GAs.