Orientador: Ricardo de Oliveira Anido / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação / Made available in DSpace on 2018-08-16T15:08:23Z (GMT). No. of bitstreams: 1 Amorim_VicenteJosePeixotode_M.pdf: 4964887 bytes, checksum: bfab031069f938f7f502f1bc4f0d5d13 (MD5) Previous issue date: 2010 / Resumo: O estudo crítico apresentado discute o problema de ordenação de mensagens, típico da área de sistemas distribuídos, contextualizado em um ambiente de comunicação Bluetooth. Por ainda serem poucos os trabalhos com tal foco na bibliografia atual, este provê uma visão geral do comportamento de uma classe específica de protocolos distribuídos, quando executados no ambiente citado. Partindo desse contexto, o trabalho utiliza uma análise comparativa de alguns dos diversos algoritmos existentes, como forma de se obter informações sobre determinadas variáveis, e se caracterizar o melhor a ser utilizado em um ambiente de comunicação sem-fio com restrições de tempo real (real time). Ao se demonstrar a viabilidade de utilização deste(s) dentro de um ambiente de comunicação Bluetooth (com características real time), automaticamente surgem novas oportunidades de aplicações, principalmente para redes móveis onde a topologia predominante é ad- hoc, ou ainda, qualquer outro tipo de aplicação em que seja necessário se garantir a entrega em ordem das informações compartilhadas dentro de um limite de tempo. Como resultado desta análise, propõe-se um protocolo para o problema de ordenação total de mensagens aplicado a redes Bluetooth, onde se garante que, no ambiente de comunicação, todas as informações trocadas pelos nós (sites) serão enviadas e recebidas na mesma ordem. / Abstract: The presented work discuss the messages ordering problem, a common subject associated to distributed systems area which was here contextualized against Bluetooth network environment. The main target of this work is focused on distributed algorithms not so commonly considered until now, specially when they are applied to this related environment. As a way to obtain enough information about some systems variables and behavior, a comparative analysis was made between the already proposed protocols and algorithms. It generates a large set of information that makes possible to identify the better approach to be aplied at real time environments. Once the protocol viability is demonstrated, a large set of new applications can arise, specifically to this case: mobile applications using Bluetooth networks. This is mainly due to the mobile ad-hoc network topology which allows the use of distributed applications. However, it can also bring another class of problems as message ordering, which must ensure that all network shared data will keep a local and global sending order. / Mestrado / Computação Distribuída / Mestre em Ciência da Computação

Un stable (ou ensemble indépendant) est un ensemble de sommets qui sont deux à deux non adjacents. De nombreux résultats classiques en optimisation combinatoire portent sur le nombre de stabilité (défini comme la plus grande taille d'un stable), et les stables se classent certainement parmi les structures les plus simples et fondamentales en théorie des graphes.<p><p>La thèse est divisée en deux parties, toutes deux liées à la notion de stables dans un graphe. Dans la première partie, nous étudions un problème de coloration de graphes, c'est à dire de partition en stables, où le but est de minimiser l'entropie de la partition. C'est une variante du problème classique de minimiser le nombre de couleurs utilisées. Nous considérons aussi une généralisation du problème aux couvertures d'ensembles. Ces deux problèmes sont appelés respectivement minimum entropy coloring et minimum entropy set cover, et sont motivés par diverses applications en théorie de l'information et en bioinformatique. Nous obtenons entre autres une caractérisation précise de la complexité de minimum entropy set cover :le problème peut être approximé à une constante lg e (environ 1.44) près, et il est NP-difficile de faire strictement mieux. Des résultats analogues sont prouvés concernant la complexité de minimum entropy coloring.<p><p>Dans la deuxième partie de la thèse, nous considérons les graphes dont le nombre de stabilité augmente dès qu'une arête est enlevée. Ces graphes sont dit être "alpha-critiques", et jouent un rôle important dans de nombreux domaines, comme la théorie extrémale des graphes ou la combinatoire polyédrique. Nous revisitons d'une part la théorie des graphes alpha-critiques, donnant à cette occasion de nouvelles démonstrations plus simples pour certains théorèmes centraux. D'autre part, nous étudions certaines facettes du polytope des ordres totaux qui peuvent être vues comme une généralisation de la notion de graphe alpha-critique. Nous étendons de nombreux résultats de la théorie des graphes alpha-critiques à cette famille de facettes.<p> / Doctorat en Sciences / info:eu-repo/semantics/nonPublished

This thesis focuses on the relationships between agency, Information and Communication Technologies (ICT) and people with disability (in various ages). The aim has been to create an understanding by describing and analysing, and as such, to develop knowledge of how people with disabilities experience agency, ICT, and disability in their everyday lives. The frame of reference is inspired by disability studies, feminist studies and science and technologies studies (STS). The empirical material was collected in, Norrbotten (Sweden’s northernmost region) and Muscat (the capital area of the Sultanate of Oman) by an autobiographical account, audio-visual material, drawings, interviews, observations, and reading of textual documents. The thesis consists of six papers. The main findings outline that agency, ICT, disability, and gender are part of intra-actions between material entities (such as bodies, technologies, etc.) and practices. The thesis also explores that disability in Sweden and Oman are understood in a variety of ways. Additionally, it presents that the combination of the notions of interference with situated knowledges can contribute with alternative methodological insights about the interference of disability, gender, ICT, the participants’ and researchers’ experiences and understandings to make accountable knowledge claims. Moreover, the thesis presents that material entities (bodies and technologies) and practices are part of different modes of ordering disability which bear effects on the lives of people with disabilities. It additionally disentangles that materialities such as the Internet intra-act with other material entities (for instance, bodies) and practices which enact various forms of agency which bear effects on the everyday lives of people with disability and their ways to participate. Finally, the thesis outlines some implications that an intra-acting understanding of the use of Internet can contribute with in research which focuses on disability, participation, and agency.

This thesis presents a study of stochastic models of continuous review of inventory systems of perishable and non-perishable products, as well as inventory systems operating in random environment. It contains five chapters. The first chapter is introductory in nature, containing the motivation for the study and the techniques required for the analysis of respective models described in the remaining chapters. Chapter 2 provides a model of perishable product inventory system operating in a random environment. For the sake of simplicity, the stochastic environment is considered to alternate randomly over time between two states 0 and 1 according to an alternating renewal process. When the environment is in state k, the items in inventory have a perishable rate ìk, the demand rate is ëk and the replenishment cost is CRk. The performance of various measures of the system evolution are obtained, assuming instantaneous replenishment at the epoch of the first demand after the stock-out and associating a Markov renewal process with the inventory level. In Chapter 3, a continuous review single product perishable inventory model is considered. Items deteriorate in two phases and then perish. Independent demands occur at constant rates for items in phase I and in phase II. Demand that occurs for an item in phase I during its stock-out period is satisfied by an item in phase II with some probability. However a demand for an item in phase II occurring during its stock-out period is lost. The reordering policy is an adjustable (S,s) policy with the lead-time following an arbitrary distribution. Identifying the stochastic process as a renewal process, the probability distribution of the inventory level at any arbitrary instant of time is obtained. The expressions for the mean stationary rates of demands lost, demands substituted, perished units and scrapped units are also derived. A numerical example is considered to highlight the results obtained. Chapter 4 is a study of a two-commodity inventory system under continuous review. The maximum storage capacity for the i-th item is Si (i=1, 2). The demand points for each commodity are assumed to form an independent Poisson process, with unit demand for one item and bulk demand for the other. The order level is fixed as si for the i-th commodity (i=1, 2) and the ordering policy is to place an order for Qi (= Si – si , i = 1,2) items for the i-the commodity when both the inventory levels are less than or equal to their respective reorder levels. The lead-time is assumed to be exponential. The joint probability distribution for both commodities is obtained in both transient and steady state cases. Various measures of systems performance and the total expected cost rate in the steady state are derived. The results are illustrated with numerical examples. Chapter 5 provides an analysis of a continuous review of two-product system with two types of demands and with individual (S,s) ordering policy. The lead-time distribution of product 1 is arbitrary and that of product 2 exponential. Two types of demands occur at constant rates either for both products or for product 2 alone. Expressions for the stationary distribution of the inventory level are obtained by identifying the underlying stochastic processes as a semi-regenerative process. The mean stationary rates of the lost demands, the demands that are satisfied and the number of reorders are obtained and these measures are used to provide an expression for the cost rate. The main objective of this thesis is to improve the state of art of continuous review inventory systems. The salient features of the thesis are summarized below: <ul>(a) Consideration of</ul> <ul>(i) The impact of the stochastic environment on inventory systems;</ul> <ul>(ii) The interactions existing among the products in multi-product systems;</ul> <ul>(iii) Individual and joint-ordering policies;</ul> <ul>(b) Discussion of inventory systems with perishable products; </ul> <ul>(c) Effective use of the regeneration point technique to derive expressions for various system measures;</ul> <ul>(d) Illustration of the various results by extensive numerical work;</ul> <ul>(e) Relevant optimization problems</ul> / Thesis (PhD (Industrial Engineering))--University of Pretoria, 2006. / Industrial and Systems Engineering / unrestricted

Cette thèse propose une étude quantitative de la variation de l'ordre des constituants en persan avec un intérêt particulier pour l'ordre relatif entre le COD et le COI étant donné son rôle crucial dans les analyses de la structure du SV. Afin de remédier à une lacune empirique dont souffre l’étude de la syntaxe du persan, notre premier objectif est d’évaluer, à partir de données empiriques robustes, l’hypothèse largement admise selon laquelle il existe un ordre relatif canonique dichotomique entre les compléments verbaux, dépendant du marquage différentiel de l'objet (MDO). Notre second objectif, relatif à la linguistique générale et à la typologie, est de contribuer aux débats controversés sur les préférences translinguistiques de l'ordre des mots en étudiant, dans une langue SOV à structure mixte, les effets des facteurs tels que le poids (ou la longueur relative). Les résultats de nos études de corpus et de nos expériences montrent l’inadéquation du critère MDO pour expliquer l’ordre relatif entre le COD et le COI. Cette conclusion nous conduit à réfuter également l’hypothèse de la position syntaxique double de l’objet au profit d’une structure plate pour le SV. De plus, nos données révèlent une préférence « long-avant-court » subordonnée aux facteurs contribuant à la saillance, tels que la définitude, l'animéité et le rôle grammatical. Nous arguons que cette préférence échappe, en partie ou totalement, aux modèles du traitement se fondant sur la distance entre la tête et ses dépendants, alors qu’elle est compatible avec l'hypothèse selon laquelle dans les langues SOV l'accessibilité conceptuelle des constituants longs favorise leur production plus en amont dans la phrase. / This thesis proposes a quantitative study of word order variations in Persian, focusing on the relative order between the direct object (DO) and the indirect object (IO). The latter plays a crucial role in the theoretical analyses of the VP, which in the absence of quantitative studies lack solid empirical underpinning. My first goal is to contribute to the study of Persian syntax by providing reliable data in order to evaluate the prevailing hypothesis according to which there exists a dual canonical relative order between the two objects triggered by the Differential Object marking (DOM). My second goal is to contribute to the ongoing debates on word order preferences in general linguistics and typology by bringing in data on an SOV language with mixed head-direction. To this end, I study the effect of factors such as grammatical weight (or relative length), which are claimed to influence the linear order across languages. First, the results of our corpus and experimental studies show that the DOM account of the relative order between the DO and the IO is flawed. Based on this conclusion, I also reject the two object positions hypothesis and plead for a flat structure view of the VP. Second, our data reveal a “long-before-short” preference, which is shown to depend on the effect of salience-enhancing factors such as definiteness, animacy and the grammatical role. I argue that while this preference is, either totally or partially, incompatible with the predictions of processing-oriented dependency-based models, it can be accounted for by production models assuming that the greater conceptual accessibility of longer constituents favors their early position in SOV languages.

This study presents an analysis of the processes of representation and translation involved in the practice of the Validation des Acquis de l’Expérience (VAE), or Recognition of Prior Experiential Learning, in a French University. This analysis is based on a qualitative research using semi-structured interviews with VAE candidates, advisers and academic staff, and recorded interactions between candidates and their advisers, and the validation juries. The research was at first influenced by the life history and educational biographies perspective (Josso 2001; Dominicé 2002; Pineau 2002), which privileged a dialogic approach. This has led to the decision to let the candidates tell their story of ordering struggle, where the resistance, dissidence and controversies circulate within and around the VAE ‘object’. This study is interested in the ordering modes enacted through the VAE and their relational effects with subjectivities. The analysis draws on Callon’s (1986) four moments of translation, as a way to give an initial frame of reference for the research. It presents the actors’ voices in a sequence of accounts, disrupted by the researcher’s running commentaries. It also focusses on the role the portfolio plays in ‘ordering’ the heterogeneous elements of the candidates’ lives, subjecting them to a form of ‘disciplinary writing’ through ‘technologies of the self’, whereby subjectivities are mobilised into specific modes of ordering. It analyses how the VAE becomes a stabilized network (Star 1991), insisting on speaking with a unitary voice, erasing the multiplicity of selves and the messy realities of the candidates’ lives, until the heterogeneous elements of the network escape again. Finally the study seeks to investigate further the recognition of heterogeneity, the possibility of multiplicity of cultures and agencies, multiple identities.

Power dissipated during scan testing is becoming increasingly important for today’s very complex sequential circuits. It is shown that the power dissipated during test mode operation is in general higher than the power dissipated during functional mode operation, the test mode average power may sometimes go upto 3x and the peak power may sometimes go upto 30x of normal mode operation. The power dissipated during the scan operation is primarily due to the switching activity that arises in scan cells during the shift and capture operation. The switching in scan cells propagates to the combinational block of the circuit during scan operation, which in turn creates many transition in the circuit and hence it causes higher dynamic power dissipation. The excessive average power dissipated during scan operation causes circuit damage due to higher temperature and the excessive peak power causes yield loss due to IR-drop and cross talk. The higher peak power also causes the thermal related issue if it last for sufficiently large number of cycles. Hence, to avoid all these issues it is very important to reduce the peak power during scan testing. Further, in case of multi-module SoC testing the reduction in peak power facilitates in reducing the test application time by scheduling many test sessions parallelly. In this dissertation we have addressed all the above stated issues. We have proposed three different techniques to deal with the excessive peak power dissipation problem during test. The first solution proposes an efficient graph theoretic methodology for test vector reordering to achieve minimum peak power supported by the given test vector set. Three graph theoretic problems are formulated and corresponding algorithms to solve the problems are proposed. The proposed methodology also minimizes average power for the given minimum peak power. Further, a lower bound on minimum achievable peak power for a given test set is defined. The results on several benchmarks show that the proposed methodology is able to reduce peak power significantly. To address the peak power problem during scan test-cycle (the cycle between launch and capture pulse) we have proposed a scan chain reordering technique. A new formulation for scan chain reordering as TSP (Traveling Sales Person) problem and a solution is proposed. The experimental results show that the proposed methodology is able to minimize considerable amount of peak power compared to the earlier proposals. The capture power (power dissipated during capture cycle) problem in testing multi chip module (MCM) is also addressed. We have proposed a methodology to schedule the test set to reduce capture power. The scheduling algorithm consist of reordering of test vector and insertion of idle cycle to prevent capture cycle coincidence of scheduled cores. The experimental results show the significant reduction in capture power without increase in test application time.

The thesis is focused on mapping of selected on-line services in hospitals in Czech Re-public according to their availability. In the next step logistic regression model will be used, which will measure a range of particular on-line services according to their legal form, majority ownership, region in which health organization is located, to education achieved and gender of hospital director and lastly in accordance with the size of hospital from the viewpoint of bed capacity. This thesis will provide comprehensive overview of availability of on-line services in Czech hospitals and determine which factors significantly decreasing or increasing chance of their occurrence on hospital websites.

The younger generation is often expected to be part of changes in management gender distribution, concepts of leadership and gender power relations. Parallel with this, there are ongoing gender segregation processes within the organisations resulting in the dominance of men among managers. The aim of this thesis is to describe and understand the transition from staff to management, and in particular how gender is done in this process. The perspective on organisation and gender adopted is social constructionist. Thestudy was carried out in a large Swedish banking company between 2000 and 2005. Analysis was drawn up in order to successively answer four research questions: 1) in what way is the management sourcing process designed and how are candidates for management evaluated?, 2) how do management candidates look upon their career opportunities?, 3) how is gender done in the sourcing of new managers?, and 4) how is gender done in the careers of future managers? The empirical material consists of observations of a management development programme for potential managers, statements on management sourcing and careers, and document material. The statements come from interviews with 11 staff members, six women and five men, identified as potential managers, as well as seven people working with HR at the bank. The 11 management candidates were interviewed three times during a two-year period. The thesis develops knowledge on how gender and management are done in situations characterised by a balanced gender distribution and simultaneous male dominance. The management development programme serves as a hub for those working with sourcing new managers through its importance in identifying, developing and evaluating candidates for management. The evaluation of women and men among management candidates shows that potential is linked to women and men in different ways and that women and men are evaluated on the basis of different expectations on them as managers. Career is almost exclusively conceived as linear hierarchical movements. Nevertheless, the hierarchical view of career is confirmed almost entirely in the way men orient themselves. The career themes of the men express expectations on having a career. The experiences of the women are diverse. But even among those who have experienced encouragement to develop, this is not reflected in expectations on the future. Instead, the hope expressed is one of being allowed to continue a career. The different empowerment of the women and men express the gender power relations in the organisation and the norm of men as managers, which both men and women relate to. Two aspects are involved in the doing of gender in management sourcing and careers: construction of gender and gender ordering. Firstly, gender is constructed and ordered in the sourcing of new managers through the gendering of potential, resulting in different opportunities for women and men in organisations. Secondly, gender is constructed and ordered in careers, where careers may be understood as gendered, i.e. where expectations are created in men and hopes in women. The result is different empowerment in women and men. And thirdly, the results point to a complexity in relation to change. Gender equality initiatives and radical practices in combination with individualism and gender neutrality both put gender hierarchy into question and preserve it. Management sourcing involves several practices where the doing of gender is integrated in different ways, both conscious through gender equality initiatives, and sub-conscious through individualised and gender-neutral ideology. Thus, change requires greater consciousness and new practice. / <p>QC 20100728</p>

Les méthodes de Monte Carlo par chaînes de Markov (MCMC) utilisent généralement des chaînes de Markov réversibles. Jusqu’à récemment, une grande partie de la recherche théorique sur les chaînes de Markov concernait ce type de chaînes, notamment les théorèmes de Peskun (1973) et de Tierney (1998) qui permettent d’ordonner les variances asymptotiques de deux estimateurs issus de chaînes réversibles différentes. Dans ce mémoire nous analysons des algorithmes simulants des chaînes qui ne respectent pas cette condition. Nous parlons alors de chaînes non réversibles. Expérimentalement, ces chaînes produisent souvent des estimateurs avec une variance asymptotique plus faible et/ou une convergence plus rapide. Nous présentons deux algorithmes, soit l’algorithme de marche aléatoire guidée (GRW) par Gustafson (1998) et l’algorithme de discrete bouncy particle sampler (DBPS) par Sherlock et Thiery (2017). Pour ces deux algorithmes, nous comparons expérimentalement la variance asymptotique d’un estimateur avec la variance asymptotique en utilisant l’algorithme de Metropolis-Hastings. Récemment, un cadre théorique a été introduit par Andrieu et Livingstone (2019) pour ordonner les variances asymptotiques d’une certaine classe de chaînes non réversibles. Nous présentons leur analyse de GRW. De plus, nous montrons que le DBPS est inclus dans ce cadre théorique. Nous démontrons que la variance asymptotique d’un estimateur peut théoriquement diminuer en ajoutant des propositions à cet algorithme. Finalement, nous proposons deux modifications au DBPS. Tout au long du mémoire, nous serons intéressés par des chaînes issues de propositions déterministes. Nous montrons comment construire l’algorithme du delayed rejection avec des fonctions déterministes et son équivalent dans le cadre de Andrieu et Livingstone (2019). / Markov chain Monte Carlo (MCMC) methods commonly use chains that respect the detailed balance condition. These chains are called reversible. Most of the theory developed for MCMC evolves around those particular chains. Peskun (1973) and Tierney (1998) provided useful theorems on the ordering of the asymptotic variances for two estimators produced by two different reversible chains. In this thesis, we are interested in non-reversible chains, which are chains that don’t respect the detailed balance condition. We present algorithms that simulate non-reversible chains, mainly the Guided Random Walk (GRW) by Gustafson (1998) and the Discrete Bouncy Particle Sampler (DBPS) by Sherlock and Thiery (2017). For both algorithms, we compare the asymptotic variance of estimators with the ones produced by the Metropolis- Hastings algorithm. We present a recent theoretical framework introduced by Andrieu and Livingstone (2019) and their analysis of the GRW. We then show that the DBPS is part of this framework and present an analysis on the asymptotic variance of estimators. Their main theorem can provide an ordering of the asymptotic variances of two estimators resulting from nonreversible chains. We show that an estimator could have a lower asymptotic variance by adding propositions to the DBPS. We then present empirical results of a modified DBPS. Through the thesis we will mostly be interested in chains that are produced by deterministic proposals. We show a general construction of the delayed rejection algorithm using deterministic proposals and one possible equivalent for non-reversible chains.