Transformations induced in bulk amorphous silica by ultrafast laser direct writingTransformations induced in bulk amorphous silica by ultrafast laser direct writing

Agências Financiadoras: Fundação para a Ciência e a Tecnologia - PTDC/FIS/102127/2008 e PTDC/FIS/102127/2008 e SFRH/BPD/78871/2011; Spanish Ministerio de Ciencia e Innovacion - FUNCOAT-CSD2008-00023-CONSOLIDER; Instituto Superior Técnico;

New insights on integer-programming models for the kidney exchange problem

In recent years several countries have set up policies that allow exchange of kidneys between two or more incompatible patient–donor pairs. These policies lead to what is commonly known as kidney exchange programs. The underlying optimization problems can be formulated as integer programming models. Previously proposed models for kidney exchange programs have exponential numbers of constraints or variables, which makes them fairly difficult to solve when the problem size is large. In this work we propose two compact formulations for the problem, explain how these formulations can be adapted to address some problem variants, and provide results on the dominance of some models over others. Finally we present a systematic comparison between our models and two previously proposed ones via thorough computational analysis. Results show that compact formulations have advantages over non-compact ones when the problem size is large.

The capacity exchange protocol

This paper proposes a new strategy to integrate shared resources and precedence constraints among real-time tasks, assuming no precise information on critical sections and computation times is available. The concept of bandwidth inheritance is combined with a capacity sharing and stealing mechanism to efficiently exchange bandwidth among tasks to minimise the degree of deviation from the ideal system’s behaviour caused by inter-application blocking. The proposed Capacity Exchange Protocol (CXP) is simpler than other proposed solutions for sharing resources in open real-time systems since it does not attempt to return the inherited capacity in the same exact amount to blocked servers. This loss of optimality is worth the reduced complexity as the protocol’s behaviour nevertheless tends to be fair and outperforms the previous solutions in highly dynamic scenarios as demonstrated by extensive simulations. A formal analysis of CXP is presented and the conditions under which it is possible to guarantee hard real-time tasks are discussed.

Fixed point transformations in the adaptive control of fractional-order MIMO systems

Though the formal mathematical idea of introducing noninteger order derivatives can be traced from the 17th century in a letter by L’Hospital in which he asked Leibniz what the meaning of D n y if n = 1/2 would be in 1695 [1], it was better outlined only in the 19th century [2, 3, 4]. Due to the lack of clear physical interpretation their first applications in physics appeared only later, in the 20th century, in connection with visco-elastic phenomena [5, 6]. The topic later obtained quite general attention [7, 8, 9], and also found new applications in material science [10], analysis of earth-quake signals [11], control of robots [12], and in the description of diffusion [13], etc.

Application of robust fixed point transformations for technological operation of robots

A robot’s drive has to exert appropriate driving forces that can keep its arm and end effector at the proper position, velocity and acceleration, and simultaneously has to compensate for the effects of the contact forces arising between the tool and the workpiece depending on the needs of the actual technological operation. Balancing the effects of a priori unknown external disturbance forces and the inaccuracies of the available dynamic model of the robot is also important. Technological tasks requiring well prescribed end effector trajectories and contact forces simultaneously are challenging control problems that can be tackled in various manners.

Surface morphology and phase transformations of femtosecond laser-processed saphire

The morphological and structural modifications induced in sapphire by surface treatment with femtosecond laser radiation were studied. Single-crystal sapphire wafers cut parallel to the (0 1 2) planes were treated with 560 fs, 1030 nm wavelength laser radiation using wide ranges of pulse energy and repetition rate. Self-ordered periodic structures with an average spatial periodicity of similar to 300 nm were observed for fluences slightly higher than the ablation threshold. For higher fluences the interaction was more disruptive and extensive fracture, exfoliation, and ejection of ablation debris occurred. Four types of particles were found in the ablation debris: (a) spherical nanoparticles about 50 nm in diameter; (b) composite particles between 150 and 400 nm in size; (c) rounded resolidified particles about 100-500 nm in size; and (d) angular particles presenting a lamellar structure and deformation twins. The study of those particles by selected area electron diffraction showed that the spherical nanoparticles and the composite particles are amorphous, while the resolidified droplets and the angular particles, present a crystalline a-alumina structure, the same of the original material. Taking into consideration the existing ablation theories, it is proposed that the spherical nanoparticles are directly emitted from the surface in the ablation plume, while resolidified droplets are emitted as a result of the ablation process, in the liquid phase, in the low intensity regime, and by exfoliation, in the high intensity regime. Nanoparticle clusters are formed by nanoparticle coalescence in the cooling ablation plume. (C) 2013 Elsevier B.V. All rights reserved.

On the ranks of certain monoids of transformations that preserve a uniform partition

The rank of a semigroup, an important and relevant concept in Semigroup Theory, is the cardinality of a least-size generating set. Semigroups of transformations that preserve or reverse the order or the orientation as well as semigroups of transformations preserving an equivalence relation have been widely studied over the past decades by many authors. The purpose of this article is to compute the ranks of the monoid

The cardinal of various monoids of transformations that preserve a uniform partition

In this paper we give formulas for the number of elements of the monoids ORm x n of all full transformations on it finite chain with tun elements that preserve it uniform m-partition and preserve or reverse the orientation and for its submonoids ODm x n of all order-preserving or order-reversing elements, OPm x n of all orientation-preserving elements, O-m x n of all order-preserving elements, O-m x n(+) of all extensive order-preserving elements and O-m x n(-) of all co-extensive order-preserving elements.

Evidences for direct magnetic patterning via diffusive transformations using femtosecond laser interferometry

The application of femtosecond laser interferometry to direct patterning of thin-film magnetic alloys is demonstrated. The formation of stripe gratings with submicron periodicities is achieved in Fe1-xVx (x=18-34wt. %) layers, with a difference in magnetic moments up to Delta mu/mu similar to 20 between adjacent stripes but without any significant development of the topographical relief (<1% of the film thickness). The produced gratings exhibit a robust effect of their anisotropy shape on magnetization curves in the film plane. The obtained data witness ultrafast diffusive transformations associated with the process of spinodal decomposition and demonstrate an opportunity for producing magnetic nanostructures with engineered properties upon this basis.

Congruences on monoids of transformations preserving the orientation on a finite chain

Journal of Algebra, 321 (2009), p. 743–757

Congruences on monoids of order-preserving or order-reversing transformations on a finite chain

Glasgow Mathematical Journal, nº 47 (2005), pg. 413-424

An integer programming framework for sequencing cutting patterns based on interval graph completion

We derived a framework in integer programming, based on the properties of a linear ordering of the vertices in interval graphs, that acts as an edge completion model for obtaining interval graphs. This model can be applied to problems of sequencing cutting patterns, namely the minimization of open stacks problem (MOSP). By making small modifications in the objective function and using only some of the inequalities, the MOSP model is applied to another pattern sequencing problem that aims to minimize, not only the number of stacks, but also the order spread (the minimization of the stack occupation problem), and the model is tested.

An integer programming model for the minimum interval graph completion problem

The minimum interval graph completion problem consists of, given a graph G = ( V, E ), finding a supergraph H = ( V, E ∪ F ) that is an interval graph, while adding the least number of edges |F| . We present an integer programming formulation for solving the minimum interval graph completion problem recurring to a characteri- zation of interval graphs that produces a linear ordering of the maximal cliques of the solution graph.

Minimization of open orders using interval graphs

In this paper we address an order processing optimization problem known as the Minimization of Open Stacks Problem (MOSP). This problem consists in finding the best sequence for manufacturing the different products required by costumers, in a setting where only one product can be made at a time. The objective is to minimize the maximum number of incomplete orders from costumers that are being processed simultaneously. We present an integer programming model, based on the existence of a perfect elimination order in interval graphs, which finds an optimal sequence for the costumers orders. Among other economic advantages, manufacturing the products in this optimal sequence reduces the amount of space needed to store incomplete orders.

Presentations for some monoids of injective partial transformations on a finite chain.

Communications in Algebra, 33 (2005), p. 587-604