Study of cutting forces on machinability properties of gray cast iron using new ceramics cutting tools

During gray cast iron cutting, the great rate of mechanical energy from cutting forces is converted into heat. Considerable heat is generated, principally in three areas: the shear zone, rake face and at the clearance side of the cutting edge. Excessive heat will cause undesirable high temperature in the tool which leads to softening of the tool and its accelerated wear and breakage. Nowadays the advanced ceramics are widely used in cutting tools. In this paper a composition special of Si3N4 was sintering, characterized, cut and ground to make SNGN120408 and applyed in machining gray cast iron with hardness equal 205 HB in dry cutting conditions by using digital controlled computer lathe. The tool performance was analysed in function of cutting forces, flank wear, temperature and roughness. Therefore metal removing process is carried out for three different cutting speeds (300 m/min, 600 m/min, and 800 m/min), while a cutting depth of 1 mm and a feed rate of 0.33 mm/rev are kept constant. As a result of the experiments, the lowest main cutting force, which depends on cutting speed, is obtained as 264 N at 600 m/min while the highest main cutting force is recorded as 294 N at 300 m/min.

A tool to simplify the management of homogeneous and heterogeneous grids

To simplify computer management, several system administrators are adopting advanced techniques to manage software configuration on grids, but the tight coupling between hardware and software makes every PC an individual managed entity, lowering the scalability and increasing the costs to manage hundreds or thousands of PCs. This paper discusses the feasibility of a distributed virtual machine environment, named Flexlab: a new approach for computer management that combines virtualization and distributed system architectures as the basis of a management system. Flexlab is able to extend the coverage of a computer management solution beyond client operating system limitations and also offers a convenient hardware abstraction, decoupling software and hardware, simplifying computer management. The results obtained in this work indicate that FlexLab is able to overcome the limitations imposed by the coupling between software and hardware, simplifying the management of homogeneous and heterogeneous grids. © 2009 IEEE.

The swing-by effect in the Vesta-Magnya case. Single and multiple encounters.

It was verified that the asteroid Magnya has some physical and chemical characteristics similar to the bodies from Vesta family. However, astronomical observations revealed that Magnya is distant from these bodies. In the present work, we assumed that Magnya originated from Vesta and we try to justify its current distant orbital location taking into account the effects of close encounters between Magnya and Vesta. The methodology adopted involved an analytical approach considering the technique of the gravity assisted maneuver, also known as swing-by. We found that the energy variation achieved through a single swing-by between Vesta and Magnya are very small when compared to the variation that would be required to change the orbit of Magnya. The effects of multiple close encounters were also considered and discussed. We concluded that the possibility of multiple encounters is limited, and therefore, that Magnya should suffer other perturbations (such as resonances, collisions or close encounters with other bodies, for instance) that would provide the supposed change in its orbit.

A new microcontrolled structural health monitoring system based on the electromechanical impedance principle

This article presents a new method to detect damage in structures based on the electromechanical impedance principle. The system follows the variations in the output voltage of piezoelectric transducers and does not compute the impedance itself. The proposed system is portable, autonomous, versatile, and could efficiently replace commercial instruments in different structural health monitoring applications. The identification of damage is performed by simply comparing the variations of root mean square voltage from response signals of piezoelectric transducers, such as lead zirconate titanate patches bonded to the structure, obtained for different frequencies of the excitation signal. The proposed system is not limited by the sampling rate of analog-to-digital converters, dispenses Fourier transform algorithms, and does not require a computer for processing, operating autonomously. A low-cost prototype based on microcontroller and digital synthesizer was built, and experiments were carried out on an aluminum structure and excellent results have been obtained. © The Author(s) 2012.

Análise de eventos de segurança em redes de computadores utilizando detecção de novidade

Pós-graduação em Ciência da Computação - IBILCE

Higher identities for the ternary commutator

We use computer algebra to study polynomial identities for the trilinear operation [a, b, c] = abc - acb - bac + bca + cab - cba in the free associative algebra. It is known that [a, b, c] satisfies the alternating property in degree 3, no new identities in degree 5, a multilinear identity in degree 7 which alternates in 6 arguments, and no new identities in degree 9. We use the representation theory of the symmetric group to demonstrate the existence of new identities in degree 11. The only irreducible representations of dimension <400 with new identities correspond to partitions 2(5), 1 and 2(4), 1(3) and have dimensions 132 and 165. We construct an explicit new multilinear identity for partition 2(5), 1 and we demonstrate the existence of a new non-multilinear identity in which the underlying variables are permutations of a(2)b(2)c(2)d(2)e(2) f.

Malcev dialgebras

We apply Kolesnikov's algorithm to obtain a variety of nonassociative algebras defined by right anticommutativity and a "noncommutative" version of the Malcev identity. We use computer algebra to verify that these identities are equivalent to the identities of degree up to 4 satisfied by the dicommutator in every alternative dialgebra. We extend these computations to show that any special identity for Malcev dialgebras must have degree at least 7. Finally, we introduce a trilinear operation which makes any Malcev dialgebra into a Leibniz triple system.

A subpixel edge detector applied to aortic dissection detection

[EN] The aortic dissection is a disease that can cause a deadly situation, even with a correct treatment. It consists in a rupture of a layer of the aortic artery wall, causing a blood flow inside this rupture, called dissection. The aim of this paper is to contribute to its diagnosis, detecting the dissection edges inside the aorta. A subpixel accuracy edge detector based on the hypothesis of partial volume effect is used, where the intensity of an edge pixel is the sum of the contribution of each color weighted by its relative area inside the pixel. The method uses a floating window centred on the edge pixel and computes the edge features. The accuracy of our method is evaluated on synthetic images of different hickness and noise levels, obtaining an edge detection with a maximal mean error lower than 16 percent of a pixel.

Temporal constraints in large optical flow estimation

[EN] The aim of this work is to propose a model for computing the optical flow in a sequence of images. We introduce a new temporal regularizer that is suitable for large displacements. We propose to decouple the spatial and temporal regularizations to avoid an incongruous formulation. For the spatial regularization we use the Nagel-Enkelmann operator and a newly designed temporal regularization. Our model is based on an energy functional that yields a partial differential equation (PDE). This PDE is embedded into a multipyramidal strategy to recover large displacements. A gradient descent technique is applied at each scale to reach the minimum.

3D reconstruction from a vascular tree model

[EN] In this paper, we present a vascular tree model made with synthetic materials and which allows us to obtain images to make a 3D reconstruction.We have used PVC tubes of several diameters and lengths that will let us evaluate the accuracy of our 3D reconstruction. In order to calibrate the camera we have used a corner detector. Also we have used Optical Flow techniques to follow the points through the images going and going back. We describe two general techniques to extract a sequence of corresponding points from multiple views of an object. The resulting sequence of points will be used later to reconstruct a set of 3D points representing the object surfaces on the scene. We have made the 3D reconstruction choosing by chance a couple of images and we have calculated the projection error. After several repetitions, we have found the best 3D location for the point.

Automatic initialization for facial analysis in interactive robotics

[EN]This paper focuses on four different initialization methods for determining the initial shape for the AAM algorithm and their particular performance in two different classification tasks with respect to either the facial expression DaFEx database and to the real world data obtained from a robot’s point of view.

Zu den chemischen Eigenschaften von Rutherfordium, Dubnium und Seaborgium

Die künstlichen Elemente Rutherfordium, Dubnium und Seaborgium werden an Schwerionenbeschleunigern erzeugt. Ihre chemische Untersuchung erfolgt mit computergesteuerten Apparaturen, z.B. ARCA (Automated Rapid Chemistry Apparatus). Ziel der Untersuchungen ist die Einordnung derElemente ins Periodensystem. Im einzelnen beschreibt die vorliegende Arbeit Experimente zur Fluorid- und Chlorid-Komplexierung von Rutherfordium und Dubnium, zum ionischen Zustand von Seaborgium in Nitratlösungen, zur Komplexierung von Seaborgium mit alpha-HIB sowie Vorexperimente zur Reduktion von Seaborgium.

Ein, zwei Punkte zu Nichtkommutativer Geometrie und Quantenfeldtheorie auf diskreten Räumen

Über viele Jahre hinweg wurden wieder und wieder Argumente angeführt, die diskreten Räumen gegenüber kontinuierlichen Räumen eine fundamentalere Rolle zusprechen. Unser Zugangzur diskreten Welt wird durch neuere Überlegungen der Nichtkommutativen Geometrie (NKG) bestimmt. Seit ca. 15Jahren gibt es Anstrengungen und auch Fortschritte, Physikmit Hilfe von Nichtkommutativer Geometrie besser zuverstehen. Nur eine von vielen Möglichkeiten ist dieReformulierung des Standardmodells derElementarteilchenphysik. Unter anderem gelingt es, auch denHiggs-Mechanismus geometrisch zu beschreiben. Das Higgs-Feld wird in der NKG in Form eines Zusammenhangs auf einer zweielementigen Menge beschrieben. In der Arbeit werden verschiedene Ziele erreicht:Quantisierung einer nulldimensionalen ,,Raum-Zeit'', konsistente Diskretisierungf'ur Modelle im nichtkommutativen Rahmen.Yang-Mills-Theorien auf einem Punkt mit deformiertemHiggs-Potenzial. Erweiterung auf eine ,,echte''Zwei-Punkte-Raum-Zeit, Abzählen von Feynman-Graphen in einer nulldimensionalen Theorie, Feynman-Regeln. Eine besondere Rolle werden Termini, die in derQuantenfeldtheorie ihren Ursprung haben, gewidmet. In diesemRahmen werden Begriffe frei von Komplikationen diskutiert,die durch etwaige Divergenzen oder Schwierigkeitentechnischer Natur verursacht werden könnten.Eichfixierungen, Geistbeiträge, Slavnov-Taylor-Identität undRenormierung. Iteratives Lösungsverfahren derDyson-Schwinger-Gleichung mit Computeralgebra-Unterstützung,die Renormierungsprozedur berücksichtigt.

Hypersurfaces with many singularities

1. Teil: Bekannte Konstruktionen. Die vorliegende Arbeit gibt zunächst einen ausführlichen Überblick über die bisherigen Entwicklungen auf dem klassischen Gebiet der Hyperflächen mit vielen Singularitäten. Die maximale Anzahl mu^n(d) von Singularitäten auf einer Hyperfläche vom Grad d im P^n(C) ist nur in sehr wenigen Fällen bekannt, im P^3(C) beispielsweise nur für d<=6. Abgesehen von solchen Ausnahmen existieren nur obere und untere Schranken. 2. Teil: Neue Konstruktionen. Für kleine Grade d ist es oft möglich, bessere Resultate zu erhalten als jene, die durch allgemeine Schranken gegeben sind. In dieser Arbeit beschreiben wir einige algorithmische Ansätze hierfür, von denen einer Computer Algebra in Charakteristik 0 benutzt. Unsere anderen algorithmischen Methoden basieren auf einer Suche über endlichen Körpern. Das Liften der so experimentell gefundenen Hyperflächen durch Ausnutzung ihrer Geometrie oder Arithmetik liefert beispielsweise eine Fläche vom Grad 7 mit $99$ reellen gewöhnlichen Doppelpunkten und eine Fläche vom Grad 9 mit 226 gewöhnlichen Doppelpunkten. Diese Konstruktionen liefern die ersten unteren Schranken für mu^3(d) für ungeraden Grad d>5, die die allgemeine Schranke übertreffen. Unser Algorithmus hat außerdem das Potential, auf viele weitere Probleme der algebraischen Geometrie angewendet zu werden. Neben diesen algorithmischen Methoden beschreiben wir eine Konstruktion von Hyperflächen vom Grad d im P^n mit vielen A_j-Singularitäten, j>=2. Diese Beispiele, deren Existenz wir mit Hilfe der Theorie der Dessins d'Enfants beweisen, übertreffen die bekannten unteren Schranken in den meisten Fällen und ergeben insbesondere neue asymptotische untere Schranken für j>=2, n>=3. 3. Teil: Visualisierung. Wir beschließen unsere Arbeit mit einer Anwendung unserer neuen Visualisierungs-Software surfex, die die Stärken mehrerer existierender Programme bündelt, auf die Konstruktion affiner Gleichungen aller 45 topologischen Typen reeller kubischer Flächen.