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.

Task partitioning and priority assignment for distributed hard real-time systems

In this paper, we propose the Distributed using Optimal Priority Assignment (DOPA) heuristic that finds a feasible partitioning and priority assignment for distributed applications based on the linear transactional model. DOPA partitions the tasks and messages in the distributed system, and makes use of the Optimal Priority Assignment (OPA) algorithm known as Audsley’s algorithm, to find the priorities for that partition. The experimental results show how the use of the OPA algorithm increases in average the number of schedulable tasks and messages in a distributed system when compared to the use of Deadline Monotonic (DM) usually favoured in other works. Afterwards, we extend these results to the assignment of Parallel/Distributed applications and present a second heuristic named Parallel-DOPA (P-DOPA). In that case, we show how the partitioning process can be simplified by using the Distributed Stretch Transformation (DST), a parallel transaction transformation algorithm introduced in [1].

NCRF 9 – locações: implicações fiscais e de auditoria

Dissertação apresentada ao Instituto Superior de Contabilidade e Administração do Porto para a obtenção do Grau de Mestre em Auditoria ORIENTAÇÃO: DR. JOÃO COSTA

Soluções de melhoria de desempenho acústico na Reabilitação de Edifícios

O presente relatório enquadra-se no âmbito do estágio curricular referente ao Mestrado em Engenharia Civil – Ramo de Construções, do Instituto Superior de Engenharia do Porto. Este relatório tem como objetivo apresentar e descrever de forma sucinta as atividades desenvolvidas na empresa Porto Vivo, SRU – Sociedade de Reabilitação Urbana da Baixa Portuense, S.A., no período compreendido entre 3 de Dezembro de 2012 e 3 de Julho de 2013. O estágio realizou-se por diferentes etapas, sendo numa fase inicial mais relacionada com a pesquisa bibliográfica e enquadramento da temática da reabilitação urbana em Portugal, tendo em seguida estudado e acompanhado o projeto de obras em curso. Esta etapa consistiu, principalmente, no acompanhamento de projetos e obras de reabilitação urbana, no âmbito da atividade da Porto Vivo, SRU, desempenhando inúmeras atividades tais como: contato com técnicos responsáveis pela elaboração dos Documentos Estratégicos, análise dos projetos em curso, acompanhamento de obras de reabilitação urbana, apoio à elaboração de relatórios de acompanhamento das obras, participado em reuniões de obra com empreiteiros e projetistas, elaborado o registo fotográfico de obras particulares e executado o levantamento do edificado. A primeira parte deste relatório enquadra o tema da Reabilitação Urbana, no seu conceito mais lato descrevendo os principais incentivos e programas de apoio inerentes. Refere-se, ainda, à descrição da empresa Porto Vivo, SRU e às atividades aí desenvolvidas. Numa segunda parte do relatório, é descrito o estudo de caso relativo ao desempenho acústico de soluções construtivas no âmbito da reabilitação do património edificado. Por último, uma reflexão final de todo o período de estágio e apreciação global das atividades desenvolvidas e da sua importância na formação pessoal e profissional.

Ampliação e reabilitação de edifícios

O presente relatório encontra-se no âmbito do estágio curricular referente ao Mestrado de Engenharia Civil do Instituto Superior de Engenharia do Porto. Este decorreu entre janeiro e julho de 2013 tendo como objetivo principal a realização de um projeto de Reabilitação e Ampliação de uma Escola Primária localizada na freguesia Seixo de Manhoses, no concelho Vila Flor, destinada a um Centro integrado de valorização de recursos. A preferência pela realização de um estágio curricular deveu-se ao facto de ser possível a aplicação direta dos conhecimentos que foram sendo adquiridos durante o curso e pela possibilidade de, ao longo do estágio, serem apreendidos mais conhecimentos que pudessem vir a ser úteis aquando da entrada do estagiário no mercado de trabalho. O estágio decorreu na Associação de Municípios da Terra Quente Transmontana, em Mirandela, e durante o período do mesmo, o estagiário foi participando de forma indirecta em outros projetos que vinham a ser desenvolvidos por esta entidade. Antes do inicio do referido projeto, foram efetuadas visitas ao local de implantação do edifício, de modo a serem esclarecidos alguns aspetos importantes na realização do projecto por parte do estagiário e com vista a tentar encontrar a solução que mais se adequava ao caso em estudo. Durante o estágio, com o intuito de ver os seus objetivos serem cumpridos, o estagiário fosse inserindo na equipa de projeto e nas várias atividades que foram sendo desenvolvidas (acompanhamento de outros projetos, visita a obras inserido na equipa de fiscalização, frequência de ações de formação).

Performance Model for MRC Receivers with Adaptive Modulation and Coding in Rayleigh Fading Correlated Channels with Imperfect CSIT

RTUWO Advances in Wireless and Optical Communications 2015 (RTUWO 2015). 5-6 Nov Riga, Latvia.

Tendências de recompensas em empresas portuguesas

Esta dissertação tem como objetivo central conhecer os sistemas de recompensas em empresas portuguesas. Primeiramente é realizada uma abordagem aos conceitos subjacentes ao sistema de recompensas e, simultaneamente é exposta teoria sobre o tipo de recompensas mais utilizadas e como estas diferem consoante o cargo/função. Foi aplicado um inquérito por questionário a uma amostra de 144 empresas localizadas por todo o país. Foram testadas hipóteses de estudo capazes de permitir caraterizar o sistema de recompensas desenvolvido nas empresas em estudo. Os resultados do estudo permitem concluir que: 1) os sistemas de recompensas baseados na antiguidade estão atualmente em desuso, ao contrário dos sistemas de recompensas baseados na função/cargo, no desempenho e nas competências; 2) o principal objetivo do sistema de recompensas das empresas do estudo é a motivação dos colaboradores; 3) a conjugação das recompensas monetárias e não monetárias são as mais valorizadas pelas empresas; 4) predomina a compensação variável nos sistemas de recompensas das empresas bem como os incentivos mistos (individuais e de grupo); 5) predominam os incentivos de curto-prazo no sistema de recompensas; 6) o bónus anual é o incentivo mais utilizado; 7) os benefícios e alguns dos incentivos tendem a ser maiores à medida que se sobe na hierarquia funcional da empresa; 8) o benefício predominante é a atribuição de telemóvel e o seguro de saúde; 9) as formas de reconhecimento mais comuns são os prémios de desempenho, o feedback contínuo, as promoções e as placas comemorativas; 10) a maioria dos inquiridos acredita que as oportunidades de desenvolvimento de carreira é uma importante medida para a retenção dos colaboradores; 11) as oportunidades de desenvolvimento são mais utilizadas pelas empresas de maior dimensão e; 12) os benefícios sociais são considerados a componente mais importante para garantir a retenção dos colaboradores. Com base nestes resultados, na parte final da dissertação são apresentadas algumas implicações teóricas e práticas, algumas limitações do estudo, bem como pistas para investigações futuras.

A study on security grade assignment model for mobile users in urban computing

The relation between the information/knowledge expression and the physical expression can be involved as one of items for an ambient intelligent computing [2],[3]. Moreover, because there are so many contexts around user/spaces during a user movement, all appplcation which are using AmI for users are based on the relation between user devices and environments. In these situations, it is possible that the AmI may output the wrong result from unreliable contexts by attackers. Recently, establishing a server have been utilizes, so finding secure contexts and make contexts of higher security level for save communication have been given importance. Attackers try to put their devices on the expected path of all users in order to obtain users informationillegally or they may try to broadcast their SPAMS to users. This paper is an extensionof [11] which studies the Security Grade Assignment Model (SGAM) to set Cyber-Society Organization (CSO).

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.

Convex optimization framework for intermediate deadline assignment in soft and hard real-time distributed systems

It is generally challenging to determine end-to-end delays of applications for maximizing the aggregate system utility subject to timing constraints. Many practical approaches suggest the use of intermediate deadline of tasks in order to control and upper-bound their end-to-end delays. This paper proposes a unified framework for different time-sensitive, global optimization problems, and solves them in a distributed manner using Lagrangian duality. The framework uses global viewpoints to assign intermediate deadlines, taking resource contention among tasks into consideration. For soft real-time tasks, the proposed framework effectively addresses the deadline assignment problem while maximizing the aggregate quality of service. For hard real-time tasks, we show that existing heuristic solutions to the deadline assignment problem can be incorporated into the proposed framework, enriching their mathematical interpretation.

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

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning real-time tasks on a heterogeneous multiprocessor platform comprising two different types of processors — such a platform is referred to as two-type platform. We present two linearithmic timecomplexity algorithms, SA and SA-P, each providing the follow- ing guarantee. For a given two-type platform and a given task set, if there exists a feasible task-to-processor-type assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type, then (i) using SA, it is guaranteed to find such a feasible task-to- processor-type assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding 2 a feasible task-to-processor assignment where tasks are not allowed to migrate between processors but given a platform in which processors are 1+α/times faster, where 0<α≤1. The parameter α is a property of the task set — it is the maximum utilization of any task which is less than or equal to 1.

Provably good scheduling of sporadic tasks with resource sharing on a two-type heterogeneous multiprocessor platform

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform where a task may request at most one of |R| shared resources. There are m1 processors of type-1 and m2 processors of type-2. Tasks may migrate only when requesting or releasing resources. We present a new algorithm, FF-3C-vpr, which offers a guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that only allows tasks to migrate when requesting or releasing a resource, then FF-3Cvpr also meets deadlines if given processors 4+6*ceil(|R|/min(m1,m2)) times as fast. As far as we know, it is the first result for resource sharing on heterogeneous platforms with provable performance.

A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform and (re-)prove its performance guarantee but for a stronger adversary.We conjecture that if a task set can be scheduled to meet deadlines on a heterogeneous multiprocessor platform by an optimal task assignment scheme that allows task migrations then LP-EE meets deadlines as well with no migrations if given processors twice as fast. We illustrate this with an example.