SURFACE ALLOYING OF MILD STEEL BY LASER MELTING OF AN ELECTROLESS NICKEL DEPOSIT CONTAINING CHROMIUM CARBIDES

It is possible to realize surface alloys by laser melting an electroless nickel layer containing chromium carbide particles predeposited on a mild steel substrate. By this way the surface alloy is expected to have not only a high nickel content but also an important chromium content in order to improve the corrosion resistance. The presence of chromium in solid solution results from the dissolution or melting of the carbide particles. Typical laser solidification microstructures are obtained. Dendrites consist of an austenitic Fe-Ni-Cr solid solution and interdendritic regions are constituted by an eutectic mixture containing the same austenitic solid solution and complex Fe, Ni, Cr carbides and phosphides. In comparison with a surface alloy obtained by laser melting of an electroless nickel layer without carbide particles, the corrosion resistance was slightly improved in saline aqueous solutions. The limited effect was due to the fact that the final chromium content in the present experimental conditions was not as high as that initially expected.     

Nonholonomic Mobile Manipulators: Kinematics, Velocities and Redundancies

We consider nonholonomic mobile manipulators built from an n _a joint robotic arm and a nonholonomic mobile platform with two independently driven wheels. Actually, there is no efficient kinematic formalism for these systems which are generally characterized by their high number of actuators. So, kinematic modelling is presented with particular emphasis on redundancy. Whereas kinematic redundancy is well known in the holonomic case, it is pointed out that it is necessary to define velocity redundancy in the case of nonholonomic systems. Reduced velocity kinematics based on quasi-velocities are shown to provide an efficient formalism. Two examples of mobile manipulators are presented. Finally, reduced velocity kinematics and velocity redundancy are shown to be adequate tools in order to realize operational task while optimizing criteria such as manipulability.     

Modeling of submicrometer gate GaAs field effect transistors

Before describing the mainFet modelings today available, the main technological evolutions ofMesfet andTegfet are summarized. It is brought some information on the various physical effects that occur in the devices and that must be taken into account in the models. It is shown that the different kinds of modelings (Monte Carlo, two dimensional, one dimensional) constitute a continuous chain, where the different elements appear strictly complementary. Finally, the present situation concerning modeling ofMesfet andTegfet will be presented.     

A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing

In this paper, we propose a metaheuristic for solving an original scheduling problem with auxiliary resources in a photolithography workshop of a semiconductor plant. The photolithography workshop is often a bottleneck, and improving scheduling decisions in this workshop can help to improve indicators of the whole plant. Two optimization criteria are separately considered: the weighted flow time (to minimize) and the number of products that are processed (to maximize). After stating the problem and giving some properties on the solution space, we show how these properties help us to efficiently solve the problem with the proposed memetic algorithm, which has been implemented and tested on large generated instances. Numerical experiments show that good solutions are obtained within a reasonable computational time.     

Synthesis methods of array antenna excitation laws

Standard numerical optimization methods become very computational time consuming when dealing with synthesis of array antenna excitation laws, especially when number of elements exceeds a few tenths. Array antenna designer needs a fast and efficient synthesis tool, since the design phase implies several reoptimizations within the definition phase, in order to satisfy tradeoffs on antagonistic requirements : performances, size, cost,… We propose the use of an efficient, from the computational time point of view, and secured, from the convergence point of view, synthesis method illustrated by two examples. The optimized solution satisfies a sta-tionarity condition, which leads to steady solutions in frequency but also with regard to errors (manufacturing, …). Based on analytical calculus performed before any numerical resolution and together with the use of fast Fourier transform algorithms, this method leads to reduced optimization times (in the order of a minute) for arrays of some tenths up to some hundred feeds, computations being performed on a pc. Two theoretical applications are presented and for each of them a computed example is also shown; moreover possible extensions are considered.     

Characterization of renal tumours based on Raman spectra classification

In this study, we propose to evaluate the potential of Raman spectroscopy (RS) to assess renal tumours at surgery. Different classes of Raman renal spectra acquired during a clinical protocol are discriminated using support vector machines classifiers. The influence on the classification scores of various preprocessing steps generally involved in RS are also investigated and evaluated in the particular context of renal tumour characterization. Encouraging results show the interest of RS to evaluate kidney cancer and suggest the potential of this technique as a surgical assistance during partial nephrectomy.     

On Camera Calibration with Linear Programming and Loop Constraint Linearization

A technique for calibrating a network of perspective cameras based on their graph of trifocal tensors is presented. After estimating a set of reliable epipolar geometries, a parameterization of the graph of trifocal tensors is proposed in which each trifocal tensor is linearly encoded by a 4-vector. The strength of this parameterization is that the homographies relating two adjacent trifocal tensors, as well as the projection matrices depend linearly on the parameters. Two methods for estimating these parameters in a global way taking into account loops in the graph are developed. Both methods are based on sequential linear programming: the first relies on a locally linear approximation of the polynomials involved in the loop constraints whereas the second uses alternating minimization. Both methods have the advantage of being non-incremental and of uniformly distributing the error across all the cameras. Experiments carried out on several real data sets demonstrate the accuracy of the proposed approach and its efficiency in distributing errors over the whole set of cameras.     

An end‐to‐end alternative to TCP PEPs: Initial Spreading,a TCP fast start‐up mechanism

While Transmission Control Protocol (TCP) Performance Enhancing Proxy (PEP) solutions have long been undisputed to solve the inherent satellite problems, the improvement of the regular end‐to‐end TCP congestion avoidance algorithms and the recent emphasis on the PEPs drawbacks have opened the question of the PEPs sustainability. Nevertheless, with a vast majority of Internet connections shorter than ten segments, TCP PEPs continue to be required to counter the poor efficiency of the end‐to‐end TCP start‐up mechanisms. To reduce the PEPs dependency, designing a new fast start‐up TCP mechanism is therefore a major concern. But, while enlarging the Initial Window (IW) up to ten segments is, without any doubt, the fastest solution to deal with a short‐lived connection in an uncongested network, numerous researchers are concerned about the impact of the large initial burst on an already congested network. Based on traffic observations and real experiments, Initial Spreading has been designed to remove those concerns whatever the load and type of networks. It offers performance similar to a large IW in uncongested network and outperforms existing end‐to‐end solutions in congested networks. In this paper, we show that Initial Spreading, taking care of the satellite specificities, is an efficient end‐to‐end alternative to the TCP PEPs. Copyright © 2015 John Wiley & Sons, Ltd.