Neural-network approach to modeling liquid crystals in complex confinement

Finding the structure of a confined liquid crystal is a difficult task since both the density and order parameter profiles are nonuniform. Starting from a microscopic model and density-functional theory, one has to either (i) solve a nonlinear, integral Euler-Lagrange equation, or (ii) perform a direct multidimensional free energy minimization. The traditional implementations of both approaches are computationally expensive and plagued with convergence problems. Here, as an alternative, we introduce an unsupervised variant of the multilayer perceptron (MLP) artificial neural network for minimizing the free energy of a fluid of hard nonspherical particles confined between planar substrates of variable penetrability. We then test our algorithm by comparing its results for the structure (density-orientation profiles) and equilibrium free energy with those obtained by standard iterative solution of the Euler-Lagrange equations and with Monte Carlo simulation results. Very good agreement is found and the MLP method proves competitively fast, flexible, and refinable. Furthermore, it can be readily generalized to the richer experimental patterned-substrate geometries that are now experimentally realizable but very problematic to conventional theoretical treatments.

Prática de ensino supervisionada II: a sequência didática como estratégia para escrita de textos no 1º ano de escolaridade

Relatório de Estágio apresentado à Escola Superior de Educação de Lisboa para obtenção de grau de mestre em Ensino do 1º e 2º CEB

Relatório de estágio: mestrado em ensino da música

Resumo I - O projecto “Piano e outros Instrumentos/orquestra” consiste na implementação do formato Piano e Orquestra em complemento às aulas individuais e aos ensaios de conjunto. O trabalho foi dirigido a um grupo de três alunos com idades de 9, 12 e 16 anos, do curso de Iniciação, Básico e Secundário da EMNSC (Escola de Música de Nossa Senhora do Cabo). Foram criados momentos distintos em cada fase. Estimulou-se o desenvolvimento de competências musicais e de estratégias metacognitivas visando a evolução dos alunos e a eficácia na realização do estudo individual. O Projecto foi criado com o objectivo de desenvolver as competências musicais, a motivação para realização do estudo individual e de grupo, o espírito e a audição crítica, o controlo dos factores psicológicos, a ansiedade, o aumento da autoconfiança, a aprendizagem, a melhoria da atitude positiva no momento da execução pública e o incremento do interesse pelas actividades relacionadas com a prática musical. A realização deste projecto visou analisar o grau de motivação, o desenvolvimento e a aquisição de competências musicais dos alunos de piano que frequentaram semanalmente aulas individuais, aulas extra de preparação, ensaios com Orquestra “Da Capo”, ensaios com a Orquestra Maior, duos com violoncelo e com canto. Um dos objectivos era comparar o grau de motivação e desenvolvimento dos alunos quando estudam obras nas aulas individuais que constituem o programa curricular e, por outro lado, quando o fazem em peças seleccionadas especificamente para este Projecto. Esta experiência visou proporcionar um conhecimento nos diversos domínios da música, uma visão diferente da funcionalidade do piano em conjunto com os outros instrumentos, a descoberta das sonoridades do piano contrastante e ao mesmo tempo, integrante com outros instrumentos, as formas de funcionamento dos instrumentos de corda, de sopro, dos assuntos relacionados com a afinação e pretendendo-se assim apurar o sentido de fazer parte integrante de um todo.

Modernização da linha da Beira Baixa: troço Covilhã - Guarda

Trabalho de Projeto para obtenção do grau de Mestre em Engenharia Civil na Área de Especialização em Vias de Comunicação e Transportes

Por uma família participativa: estratégias e propostas de atividade para o envolvimento parental

Relatório da Prática Profissional Supervisionada Mestrado em Educação Pré-Escolar

Crianças mais autónomas são crianças mais felizes: O Educador de Infância na promoção de autonomia

Relatório da Prática Profissional Supervisionada Mestrado em Educação Pré-Escolar

A new MILP based approach for unit commitment in power production planning

This paper presents a complete, quadratic programming formulation of the standard thermal unit commitment problem in power generation planning, together with a novel iterative optimisation algorithm for its solution. The algorithm, based on a mixed-integer formulation of the problem, considers piecewise linear approximations of the quadratic fuel cost function that are dynamically updated in an iterative way, converging to the optimum; this avoids the requirement of resorting to quadratic programming, making the solution process much quicker. From extensive computational tests on a broad set of benchmark instances of this problem, the algorithm was found to be flexible and capable of easily incorporating different problem constraints. Indeed, it is able to tackle ramp constraints, which although very important in practice were rarely considered in previous publications. Most importantly, optimal solutions were obtained for several well-known benchmark instances, including instances of practical relevance, that are not yet known to have been solved to optimality. Computational experiments and their results showed that the method proposed is both simple and extremely effective.

Thermodynamic pathway for the formation of SnSe and SnSe2 polycrystalline thin films by selenization of metal precursors

In this work, tin selenide thin films (SnSex) were grown on soda lime glass substrates by selenization of dc magnetron sputtered Sn metallic precursors. Selenization was performed at maximum temperatures in the range 300 °C to 570 °C. The thickness and the composition of the films were analysed using step profilometry and energy dispersive spectroscopy, respectively. The films were structurally and optically investigated by X-ray diffraction, Raman spectroscopy and optical transmittance and reflectance measurements. X-Ray diffraction patterns suggest that for temperatures between 300 °C and 470 °C, the films are composed of the hexagonal-SnSe2 phase. By increasing the temperature, the films selenized at maximum temperatures of 530 °C and 570 °C show orthorhombic-SnSe as the dominant phase with a preferential crystal orientation along the (400) crystallographic plane. Raman scattering analysis allowed the assignment of peaks at 119 cm−1 and 185 cm−1 to the hexagonal-SnSe2 phase and those at 108 cm−1, 130 cm−1 and 150 cm−1 to the orthorhombic-SnSe phase. All samples presented traces of condensed amorphous Se with a characteristic Raman peak located at 255 cm−1. From optical measurements, the estimated band gap energies for hexagonal-SnSe2 were close to 0.9 eV and 1.7 eV for indirect forbidden and direct transitions, respectively. The samples with the dominant orthorhombic-SnSe phase presented estimated band gap energies of 0.95 eV and 1.15 eV for indirect allowed and direct allowed transitions, respectively.

A study of ternary Cu2SnS3 and Cu3SnS4 thin films prepared by sulfurizing stacked metal precursors

Thin films of Cu2SnS3 and Cu3SnS4 were grown by sulfurization of dc magnetron sputtered Sn–Cu metallic precursors in a S2 atmosphere. Different maximum sulfurization temperatures were tested which allowed the study of the Cu2SnS3 phase changes. For a temperature of 350 ◦C the films were composed of tetragonal (I -42m) Cu2SnS3. The films sulfurized at a maximum temperature of 400 ◦C presented a cubic (F-43m) Cu2SnS3 phase. On increasing the temperature up to 520 ◦C, the Sn content of the layer decreased and orthorhombic (Pmn21) Cu3SnS4 was formed. The phase identification and structural analysis were performed using x-ray diffraction (XRD) and electron backscattered diffraction (EBSD) analysis. Raman scattering analysis was also performed and a comparison with XRD and EBSD data allowed the assignment of peaks at 336 and 351 cm−1 for tetragonal Cu2SnS3, 303 and 355 cm−1 for cubic Cu2SnS3, and 318, 348 and 295 cm−1 for the Cu3SnS4 phase. Compositional analysis was done using energy dispersive spectroscopy and induced coupled plasma analysis. Scanning electron microscopy was used to study the morphology of the layers. Transmittance and reflectance measurements permitted the estimation of absorbance and band gap. These ternary compounds present a high absorbance value close to 104 cm−1. The estimated band gap energy was 1.35 eV for tetragonal (I -42m) Cu2SnS3, 0.96 eV for cubic (F-43m) Cu2SnS3 and 1.60 eV for orthorhombic (Pmn21) Cu3SnS4. A hot point probe was used for the determination of semiconductor conductivity type. The results show that all the samples are p-type semiconductors. A four-point probe was used to obtain the resistivity of these samples. The resistivities for tetragonal Cu2SnS3, cubic Cu2SnS3 and orthorhombic (Pmn21) Cu3SnS4 are 4.59 × 10−2 cm, 1.26 × 10−2 cm, 7.40 × 10−4 cm, respectively.

From task scheduling in single processor environments to message scheduling in a PROFIBUS fieldbus network

In this paper we survey the most relevant results for the prioritybased schedulability analysis of real-time tasks, both for the fixed and dynamic priority assignment schemes. We give emphasis to the worst-case response time analysis in non-preemptive contexts, which is fundamental for the communication schedulability analysis. We define an architecture to support priority-based scheduling of messages at the application process level of a specific fieldbus communication network, the PROFIBUS. The proposed architecture improves the worst-case messages’ response time, overcoming the limitation of the first-come-first-served (FCFS) PROFIBUS queue implementations.

Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors

A preliminary version of this paper appeared in Proceedings of the 31st IEEE Real-Time Systems Symposium, 2010, pp. 239–248.

Non pre-emptive scheduling of messages on SMTV token-passing networks

Fieldbus communication networks aim to interconnect sensors, actuators and controllers within distributed computer-controlled systems. Therefore, they constitute the foundation upon which real-time applications are to be implemented. A specific class of fieldbus communication networks is based on a simplified version of token-passing protocols, where each station may transfer, at most, a single message per token visit (SMTV). In this paper, we establish an analogy between non-preemptive task scheduling in single processors and the scheduling of messages on SMTV token-passing networks. Moreover, we clearly show that concepts such as blocking and interference in non-preemptive task scheduling have their counterparts in the scheduling of messages on SMTV token-passing networks. Based on this task/message scheduling analogy, we provide pre-run-time schedulability conditions for supporting real-time messages with SMTV token-passing networks. We provide both utilisation-based and response time tests to perform the pre-run-time schedulability analysis of real-time messages on SMTV token-passing networks, considering RM/DM (rate monotonic/deadline monotonic) and EDF (earliest deadline first) priority assignment schemes

A PTAS for assigning sporadic tasks on two-type heterogeneous multiprocessors

Consider the problem of determining a task-toprocessor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct kinds of processors. We propose a polynomialtime approximation scheme (PTAS) for this problem. It offers the following guarantee: for a given task set and a given platform, if there exists a feasible task-to-processor assignment, then given an input parameter, ϵ, our PTAS succeeds, in polynomial time, in finding such a feasible task-to-processor assignment on a platform in which each processor is 1+3ϵ times faster. In the simulations, our PTAS outperforms the state-of-the-art PTAS [1] and also for the vast majority of task sets, it requires significantly smaller processor speedup than (its upper bound of) 1+3ϵ for successfully determining a feasible task-to-processor assignment.

Real-time scheduling with resource sharing on uniform multiprocessors

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a uniform multiprocessor platform where each task may access at most one of |R| shared resources and at most once by each job of that task. The resources have to be accessed in a mutually exclusive manner. We propose an algorithm, GIS-vpr, which offers the guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that allows a task to migrate only when it accesses or releases a resource, then our algorithm also meets the deadlines with the same restriction on the task migration, if given processors 4 + 6|R| times as fast. The proposed algorithm, by design, limits the number of migrations per job to at most two. To the best of our knowledge, this is the first result for resource sharing on uniform multiprocessors with proven performance guarantee.

Extending fixed task-priority schedulability by interference limitation

While the earliest deadline first algorithm is known to be optimal as a uniprocessor scheduling policy, the implementation comes at a cost in terms of complexity. Fixed taskpriority algorithms on the other hand have lower complexity but higher likelihood of task sets being declared unschedulable, when compared to earliest deadline first (EDF). Various attempts have been undertaken to increase the chances of proving a task set schedulable with similar low complexity. In some cases, this was achieved by modifying applications to limit preemptions, at the cost of flexibility. In this work, we explore several variants of a concept to limit interference by locking down the ready queue at certain instances. The aim is to increase the prospects of schedulability of a given task system, without compromising on complexity or flexibility, when compared to the regular fixed task-priority algorithm. As a final contribution, a new preemption threshold assignment algorithm is provided which is less complex and more straightforward than the previous method available in the literature.