Spelling suggestions: "subject:"check inn"" "subject:"check iin""
391 |
Kroppen i bilden : Hur det icke-verbala gestaltas i fyra bilderböcker från två tidsepoker / The body within the picture : How the non-verbal portraved in four picture books from two erasOlsson, Anna January 2015 (has links)
Syftet med denna studie är att analysera ett begränsat antal bilderböcker från två tidsepoker och undersöka hur det icke-verbala gestaltas i dessa bilderböcker och om det gestaltas olika i de två tidsepokerna. Jag kommer att fokusera mer ingående på konflikter mellan barn, konflikter mellan pedagoger och barn och pedagogers attityder i konflikter och deras sätt att hantera dem. Metoden jag använder mig av i denna studie är en kvalitativ litteraturanalys där jag utgår från Nikolajevas (2000) bok om bilderboksanalys. Tillsammans med relevant litteratur och Howard Garders teori om de sju intelligenserna med fokus på det kroppsliga har jag kommit fram till resultatet att alla böcker oavsett tidsepok via kroppsspråket i böckerna förmedlar att förskolan är något roligt och intressant. Största skillnaden mellan böckerna från de olika tidsepokerna var att i de äldre böckerna visades endast att man inte fick säga emot de vuxna med en tydlig didaktisk underton. I böckerna från 2000-talet gestaltades kroppsspråket så att man förstod det som att barnen hade mer inflytande och behövde inte alltid godta vad de vuxna sa, utan kunde ha mer egen vilja. / The purpose of this study is to analyze a limited number of picture books from two eras and examine how non-verbal portrayed in the picture, and if it is portrayed differently in the two epochs. I will focus in more detail on the conflicts between children, conflicts between educators and children and teachers' attitudes in the conflict and their way of dealing with them. The method I use in this study is a qualitative literature analysis which I assume Nicholas Eve (2000) book on picture analysis. Together with the relevant literature and Howard Gardners theory of the seven intelligences with a focus on the bodily, I have come to the result that all books regardless of era through body language in the books convey to preschool is something fun and interesting. The biggest difference between the books from the different time epochs was that in the older books appeared only that you could not argue with adults with a clear didactic undertone. In the books from the 2000's figure was the body language illustrated in such a way that the reader understands that the children are allowed to have more influence and not necessarily need to accept the opinions and wishes of the adults, since they are entitled to their own opinion and to have their own free will.
|
392 |
民主治理下政務官與事務官互動關係:以「是的,部長(Yes, Minister)」影集之文本分析為例 / The interaction between political appointees and civil servants in democratic governance: A text analysis of the TV series “Yes, Minister.”林俐君, Lin, Li Chun Unknown Date (has links)
隨著民主治理的發展,有效調和民主憲政與文官專業價值,才能夠確保民主政治運作的效能。背景因素使得政務官與事務官間的互動,愈具舉足輕重的角色。從相關研究可以理解,欲直接觀察政務官與事務官細部的互動並不容易,兩者間細部的互動對外界而言始終是一個黑盒子。因此,本研究使用鮮少作為該議題研究主體的影視產品進行分析。選擇英國經典影集「Yes, Minister」,乃因該劇主要以描繪政務官與事務官互動為主,描寫程度相當細膩。藉此旁觀的角度一窺政務官與事務官的互動,確實是個能夠協助深入理解該議題的良好個案。
研究設計的基礎為文本分析法,透過建構分析路徑,分別從兩者本質、選擇偏好、表現作為,以及互動後對政策產出的討論。先將14集研究樣本進行相同路徑的文本化,再將文本化的樣本進行論述與類型化。研究發現事務官的互動技巧,包括行政權力的作為與不作為、可行性評估、影響政務體系與政務官以及納入外部勢力等,目的為提升參與決策的條件,細部列出24項互動技巧;另一方面,政務官則可透過經驗複製、行政學習、媒體與聲望經營與納入外部力量等,目的為提升統治便利性與正當性,細部列出13項互動技巧。兩者的互動呈現出互相制衡的本質,若各自無法有效負責與調和時,易形成雙重價值選擇的壓力。
本研究提出以「鐘擺效果」解釋政務官與事務官的互動,兩者在制衡關係的基礎上,隨著時序性的影響而改變互動模式。基本上的互動如鐘擺式擺盪,進而系統性因素將會因時序性遞減,激發出最適的政策結果。最終提出兩大項建議:首先,從制衡到動態平衡的關係,正視制衡現象的存在、立基於分權制衡上的信任關係、減少彼此錯誤解讀的機會,以及培養持續監督與自省能力;其二,設定政策決策的妥協底線,認知非任務型指標的超然價值,以及試著創造沒有共識的共識。 / In any democratic state’s development, how to effectively reconcile the two values of constitutional democracy and bureaucratic expertise is fundamental to ensure the proper functioning and efficacy of democratic politics. As Taiwan further consolidates its democracy, the interaction between the political appointees and senior civil servants becomes ever more important in achieving a balance of pluralistic values on the one hand, and government’s administrative efficiency, on the other. Yet past research has found that it is not easy to observe directly the details of the interaction between political appointees and civil servants; to the external world, the actual interaction between the two has always been a black box. Therefore, to shed light on that black box, this study analyzes the interaction between appointees and civil servants as depicted in film and television programs. The classic British series, “Yes Minister,” was chosen as the study’s research subject because it portrays the minister-bureaucrat interactive behavior skillfully and poignantly, which allows a deeper understanding of the issue.
The study employs textual analysis as the principal research method. Each of the series’ 14 episodes had been textually reinterpreted by using the same analytical paths, which were constructed by first categorizing the nature, choice preferences, display behaviors, and post-interaction reaction to policy outputs for both political appointees and senior civil servants. The research has found that civil servants, in their pursuit for greater participation in decision-making, exhibit as many as 24 distinct interactive behaviors with their political superiors. Some of these behaviors include administrative action and inaction, call for feasibility assessment, manipulation of the political system, and incorporation of external forces. On the other hand, political appointees, in their effort to achieve political expediency and legitimacy, have 13 behaviors of their own through experience replication, administrative learning, media and reputation management, and inclusion of external forces. Both sets of interactive behaviors are essentially parts of a checks-and-balances system. When responsibilities are unclear and actions cannot be coordinated effectively, the agency then becomes vulnerable to role ambiguity and double value selection problems.
This research proposes a “pendulum effect” to explain the interaction between political appointees and civil servants. Because the appointees and civil servants have a mutual checks and balances relationship, both parties will alter their interactive behavior depending on the timing of events. Essentially, the interaction between the two sides will initially swing freely like a pendulum; subsequently, system factors will cause the pendulum to progressively decrease its swing, ultimately arriving at the most optimal policy result. In conclusion, this study makes two major recommendations. First, both political appointees and civil servants need to understand that they are in a dynamic equilibrium, in which they check and balance each other’s actions. By acknowledging the check and balance nature of their relationship, both minimize the chance of misinterpreting each other, and may develop the healthy capacity of ongoing oversight and self-introspection. Second, both political appointees and civil servants must establish a baseline in any policy negotiation and compromise, recognize the (sometimes) extraordinary value of non-mission-based indicators, and attempt to create a consensus when no consensus exists.
|
393 |
Coding for wireless ad-hoc and sensor networks: unequal error protection and efficient data broadcastingRahnavard, Nazanin 27 August 2007 (has links)
This thesis investigates both theoretical and practical aspects of
the design and analysis of modern error-control coding schemes,
namely low-density parity-check (LDPC) codes and rateless codes for
unequal error protection (UEP). It also studies the application of
modern error-control codes in efficient data dissemination in
wireless ad-hoc and sensor networks.
Two methodologies for the design and analysis of UEP-LDPC codes are
proposed. For these proposed ensembles, density evolution formulas
over the binary erasure channel are derived and used to optimize the
degree distribution of the codes. Furthermore, for the first time,
rateless codes that can provide UEP are developed. In addition to
providing UEP, the proposed codes can be used in applications for
which unequal recovery time is desirable, i.e., when more important
parts of data are required to be recovered faster than less
important parts. Asymptotic behavior of the UEP-rateless codes under
the iterative decoding is investigated. In addition, the performance
of the proposed codes is examined under the maximum-likelihood
decoding, when the codes have short to moderate lengths. Results
show that UEP-rateless codes are able to provide very low error
rates for more important bits with only a subtle loss in the
performance of less important bits. Moreover, it is shown that given
a target bit error rate, different parts of the information symbols
can be decoded after receiving different numbers of encoded symbols.
This implies that information can be recovered in a progressive
manner, which is of interest in many practical applications such as
media-on-demand systems.
This work also explores fundamental research problems related to
applying error-control coding such as rateless coding to the problem
of reliable and energy-efficient broadcasting in multihop wireless
ad-hoc sensor networks. The proposed research touches on the four
very large fields of wireless networking, coding theory, graph
theory, and percolation theory. Based on the level of information
that each node has about the network topology, several reliable and
energy-efficient schemes are proposed, all of which are distributed
and have low complexity of implementation. The first protocol does
not require any information about the network topology. Another
protocol, which is more energy efficient, assumes each node has
local information about the network topology. In addition, this work
proposes a distributed scheme for finding low-cost broadcast trees
in wireless networks. This scheme takes into account various
parameters such as distances between nodes and link losses. This
protocol is then extended to find low-cost multicast trees. Several
schemes are extensively simulated and are compared.
|
394 |
Surface-based Synthesis of 3D Maps for Outdoor Unstructured EnvironmentsMelkumyan, Narek January 2009 (has links)
Doctor of Philosophy(PhD) / This thesis is concerned with the theoretical and practical development of a surface-based mapping algorithm for reliable and robust localization and mapping in prior unknown and unstructured environments. A surface-based map consists of a set of compressed surfaces, processed and represented without geometrical modelling. Each surface in the surface-based map represents an object in the environment. The ability to represent the exact shapes of objects via individual surfaces during the mapping process makes the surface-based mapping algorithm valuable in a number of navigation applications, such as mapping of prior unknown indoor and outdoor unstructured environments, target tracking, path planning and collision avoidance. The ability to unify representations of the same object taken from different viewpoints into a single surface makes the algorithm capable of working in multi-robot mapping applications. A surface-based map of the environment is build incrementally by acquiring the 3D range image of the scene, extracting the objects' surfaces from the 3D range image, aligning the set of extracted surfaces relative to the map and unifying the aligned set of surfaces with surfaces in the map. In the surface unification process the surfaces representing the same object are unified to make a single surface. The thesis introduces the following new methods which are used in the surface-based mapping algorithm: the extraction of surfaces from 3D range images based on a scanned surface continuity check; homogenization of the representation of the non-homogenously sampled surfaces; the alignment of the surface set relative to a large set of surfaces based on surface-based alignment algorithm; evaluating the correspondence between two surfaces based on the overlap area between surfaces; unification of the two surfaces belonging to the same object; and surface unification for a large set of surfaces. The theoretical contributions of this thesis are demonstrated with a series of practical implementations in different outdoor environments.
|
395 |
Efficient Transceiver Techniques for Massive MIMO and Large-Scale GSM-MIMO SystemsLakshmi Narasimha, T January 2015 (has links) (PDF)
Multi-antenna wireless communication systems that employ a large number of antennas have recently stirred a lot of research interest. This is mainly due to the possibility of achieving very high spectral efficiency, power efficiency, and link reliability in such large-scale multiple-input multiple-output (MIMO) systems. An emerging architecture for large-scale multiuser MIMO communications is one where each base station (BS) is equipped with a large number of antennas (tens to hundreds of antennas) and the user terminals are equipped with fewer antennas (one to four antennas) each. The backhaul communication between base stations is also carried out using large number of antennas. Because of the high dimensionality of large-scale MIMO signals, the computational complexity of various transceiver operations can be prohibitively large. Therefore, low complexity techniques that scale well for transceiver signal processing in such large-scale MIMO systems are crucial. The transceiver operations of interest include signal encoding at the transmitter, and channel estimation, detection and decoding at the receiver. This thesis focuses on the design and analysis of novel low-complexity transceiver signal processing schemes for large-scale MIMO systems.
In this thesis, we consider two types of large-scale MIMO systems, namely, massive MIMO systems and generalized spatial modulation MIMO (GSM-MIMO) systems. In massive MIMO, the mapping of information bits to modulation symbols is done using conventional modulation alphabets (e.g., QAM, PSK). In GSM-MIMO, few of the avail-able transmit antennas are activated in a given channel use, and information bits are conveyed through the indices of these active antennas, in addition to the bits conveyed through conventional modulation symbols. We also propose a novel modulation scheme
named as precoder index modulation, where information bits are conveyed through the index of the chosen precoder matrix as well as the modulation symbols transmitted.
Massive MIMO: In this part of the thesis, we propose a novel MIMO receiver which exploits channel hardening that occurs in large-scale MIMO channels. Channel hardening refers to the phenomenon where the off-diagonal terms of HH H become much weaker compared to the diagonal terms as the size of the channel gain matrix H increases. We exploit this phenomenon to devise a low-complexity channel estimation scheme and a message passing algorithm for signal detection at the BS receiver in massive MIMO systems. We refer to the proposed receiver as the channel hardening-exploiting message passing (CHEMP) receiver. The key novelties in the proposed CHEMP receiver are: (i) operation on the matched filtered system model, (ii) Gaussian approximation on the off-diagonal terms of the HH H matrix, and (iii) direct estimation of HH H instead of H and use of this estimate of HH H for detection
The performance and complexity results show that the proposed CHEMP receiver achieves near-optimal performance in large-scale MIMO systems at complexities less than those of linear receivers like minimum mean squared error (MMSE) receiver. We also present a log-likelihood ratio (LLR) analysis that provides an analytical reasoning for this better performance of the CHEMP receiver. Further, the proposed message passing based detection algorithm enables us to combine it with low density parity check (LDPC) decoder to formulate a joint message passing based detector-decoder. For this joint detector-decoder, we design optimized irregular binary LDPC codes specific to the massive MIMO channel and the proposed receiver through EXIT chart matching. The LDPC codes thus obtained are shown to achieve improved coded bit error rate (BER) performance compared to off-the-shelf irregular LDPC codes.
The performance of the CHEMP receiver degrades when the system loading factor (ratio of the number of users to the number of BS antennas) and the modulation alpha-bet size are large. It is of interest to devise receiver algorithms that work well for high system loading factors and modulation alphabet sizes. For this purpose, we propose a low-complexity factor-graph based vector message passing algorithm for signal detection.
This algorithm uses a scalar Gaussian approximation of interference on the basic sys-tem model. The performance results show that this algorithm performs well for large modulation alphabets and high loading factors. We combine this detection algorithm with a non-binary LDPC decoder to obtain a joint detector-decoder, where the field size of the non-binary LDPC code is same as the size of the modulation alphabet. For this joint message passing based detector-decoder, we design optimized non-binary irregular LDPC codes tailored to the massive MIMO channel and the proposed detector.
GSM-MIMO: In this part of the thesis, we consider GSM-MIMO systems in point-to-point as well as multiuser communication settings. GSM-MIMO has the advantage of requiring only fewer transmit radio frequency (RF) chains than the number of transmit antennas. We analyze the capacity of point-to-point GSM-MIMO, and obtain lower and upper bounds on the GSM-MIMO system capacity. We also derive an upper bound on the BER performance of maximum likelihood detection in GSM-MIMO systems. This bound is shown to be tight at moderate to high signal-to-noise ratios.
When the number of transmit and receive antennas are large, the complexity of en-coding and decoding of GSM-MIMO signals can be prohibitively high. To alleviate this problem, we propose a low complexity GSM-MIMO encoding technique that utilizes com-binatorial number system for bits-to-symbol mapping. We also propose a novel layered message passing (LaMP) algorithm for decoding GSM-MIMO signals. Low computational complexity is achieved in the LaMP algorithm by detecting the modulation bits and the antenna index bits in two deferent layers.
We then consider large-scale multiuser GSM-MIMO systems, where multiple users employ GSM at their transmitters to communicate with a BS having a large number of receive antennas. For this system, we develop computationally efficient message passing algorithms for signal detection using vector Gaussian approximation of interference. The performance results of these algorithms show that the GSM-MIMO system outperforms the massive MIMO system by several dBs for the same spectral efficiency.
Precoder index modulation: It is known that the performance of a communication link can be enhanced by exploiting time diversity without reducing the rate of transmission using pseudo random phase preceding (PRPP). In order to further improve the performance of GSM-MIMO, we apply PRPP technique to GSM-MIMO systems. PRPP provides additional diversity advantage at the receiver and further improves the performance of GSM-MIMO systems. For PRPP-GSM systems, we propose methods to simultaneously precode both the antenna index bits and the modulation symbols using rectangular precoder matrices. Finally, we extend the idea of index modulation to pre-coding and propose a new modulation scheme referred to as precoder index modulation (PIM). In PIM, information bits are conveyed through the index of a prehared PRPP matrix, in addition to the information bits conveyed through the modulation symbols. PIM is shown to increase the achieved spectral efficiency, in addition to providing diver-sity advantages.
|
396 |
The non transferable cheque and the liability of the collecting and drawee banksPapadopoulos, John 12 1900 (has links)
The paper is an attempt to deal with the non-transferable cheque. Three
questions have been addressed:
(a) Whether sections 58, 79 and 83 apply to non-transferable cheques;
(b) whether the non-transferability of a cheque implies only that a
cambial transfer is excluded, but transfer by means of a ordinary cession
is still possible;
(c) whether the collecting and drawee banks can be held liable for
damages to the owner of a non-transferable cheque.
(a) It is clear that section 58 does not apply to non-transferable cheques.
After the decision in Eskom, it is also clear that section 79 does apply to
such cheques. Regarding the applicability of section 83 to
non-transferable cheques, there is uncertainty.
(b) Whether the rights arising from a non-transferable cheque can be
transferred by means of an ordinary cession, it is not yet clear.
(c) That a collecting bank can be held delictually liable under the
extended lex Aquilia was decided in lndac Electronics. By way of
analogy, the same applies to a drawee bank acting negligently. / Mercantile Law / LL.M.
|
397 |
Diversité, biogéographie, écologie et conservation des Rubioideae-Rubiaceae en Afrique centrale, Burundi, R.D.Congo, Rwanda / Diversity, biogeography, ecology and conservation of Rubioideae-Rubiaceae in Central Africa, Burundi, D.R.Congo, RwandaNiyongabo, Ferdinand 27 April 2012 (has links)
Cette étude est une contribution à la connaissance de la biodiversité, la distribution géographique et la conservation des Rubioideae (Rubiaceae) d’Afrique centrale (Burundi,R.D.Congo et Rwanda). Le travail est basé sur l’analyse critique des riches collections conservées dans les grands herbaria de Belgique et du Burundi (plus de 10.000 échantillons). Une check-list critique des Rubioideae d’Afrique centrale a été établie; 291 taxons ont été inventoriés et une carte de distribution géographique a été tracée pour chacun, après géoréférencement de toutes<p>les récoltes. Des taxons nouveaux pour le territoire étudié ont été découverts, révélant le caractère incomplet de la ‘World check-list of Rubiaceae’. Des taxons nouveaux pour la science ont été mis en évidence. Une espèce nouvelle (avec deux variétés) a été décrite. Les analyses de distribution ont utilisé deux niveaux de résolution: le système d’information géographique (SIG) pour la production des cartes de la distribution des espèces et le système de maillage pour calculer la densité et l’effort d’échantillonnage. La richesse floristique apparente est fortement biaisée par l’intensité d’échantillonnage. Après correction de ces biais, la diversité reste inégalement répartie.<p>Des régions de plus haute diversité peuvent être expliquées à la fois par des processus déterministes (régions à haute diversité ’habitats), et, probablement aussi par des contingences historiques (refuges). Elles correspondent à des zones de spéciation active ou de moindre extinction. De plus, cette diversité varie selon les phytochories considérées.<p>La distribution des taxons a été utilisée pour tenter de redéfinir sur une base objective des subdivisions phytogéographiques du territoire étudié. L’approche basée sur la similarité floristique et la distribution potentielle a démontré le rôle déterminant des taxons indicateurs et des variables environnementales<p>dans l’établissement d’un système cohérent de phytochories pour l’Afrique centrale. Un nouveau<p>système de trois territoires floristiques défini sur base des Rubioideae est comparativement proche de celui de White (1979, 1983) mais ne comprend pas des zones de transition.<p>Enfin, la caractérisation de l’état de conservation des Rubioideae de la zone d’étude, sur base de la méthodologie de l’UICN, a porté sur cinquante-six taxons (sub-)endémiques d’Afrique centrale. L’évaluation paramétrique a été largement utilisée. Elle est basée sur la détermination de la zone d’occupation (AOO) et de la zone d’occurrence (EOO). La proportion des Rubioideae menacés et coïncide avec celles des autres groupes déjà évalués. Cette analyse a démontré qu’il existe une corrélation entre les taxons menacés et les zones de forte concentration humaine.<p><p><p>This study is a contribution to the knowledge of biodiversity, geographic distribution and conservation of Rubioideae (Rubiaceae), a group of flowering plants in Central Africa (D.R.Congo, Rwanda, Burundi). The work is based on the critical evaluation of the rich herbarium collections conserved in Belgium and Burundi (> 10,000 specimens). A critical check-list of Rubioideae in Central Africa has been produced, comprising 291 taxa. A distribution map has been obtained for each of them. A number of taxa are new to the area, highlighting the gaps of knowledge in the ‘World check-list of Rubiaceae’. Species new to science have been detected, one of which has been formally described (with two varieties) in this study. The analysis of distribution patterns has been performed at two levels of resolution. Grid-maps have been used to analyse patterns of species diversity. Floristic richness appears strongly correlated with<p>sampling effort. After correction for sampling effort, species diversity remains heterogeneous.<p>Regions of higher diversity correspond either to areas of more active speciation, in relation to a high diversity of habitats, or to forest refuges where extinction rates have been lower. Additionally, this diversity varies between the different phytochoria recognized. The distribution of species has been used in an attempt to redefine phytochoria based only on floristic criteria. Floristic similarity, and potential distribution (based on climatic parameters), has shown that phytochoria can be effectively defined and characterized by the method of indicator taxa. Three major<p>phytochoria show a reasonably match with phytochoria previously proposed by White (1979, 1983), but White’s transition zones are not highlighted. Finally, distribution data have been used to critically evaluate the conservation status of 56 taxa, using the methodology and criteria of IUCN. The area of occupancy (AOO) and extent of occurrence (EOO) were calculated and used as main criteria to evaluate the species. A relatively high proportion of taxa appear to be threatened, especially in relation to urbanization and deforestation in the most<p>highly populated parts of the study area. / Doctorat en Sciences / info:eu-repo/semantics/nonPublished
|
398 |
Coverability and expressiveness properties of well-structured transition systemsGeeraerts, Gilles 20 April 2007 (has links)
Ces cinquante dernières annéees, les ordinateurs ont occupé une place toujours plus importante dans notre vie quotidienne. On les retrouve aujourd’hui présents dans de nombreuses applications, sous forme de systèmes enfouis. Ces applications sont parfois critiques, dans la mesure où toute défaillance du système informatique peut avoir des conséquences catastrophiques, tant sur le plan humain que sur le plan économique. <p>Nous pensons par exemple aux systèmes informatiques qui contrôlent les appareils médicaux ou certains systèmes vitaux (comme les freins) des véhicules automobiles. <p>Afin d’assurer la correction de ces systèmes informatiques, différentes techniques de vérification Assistée par Ordinateur ont été proposées, durant les trois dernières <p>décennies principalement. Ces techniques reposent sur un principe commun: donner une description formelle tant du système que de la propriété qu’il doit respecter, et appliquer une méthode automatique pour prouver que le système respecte la propriété. <p>Parmi les principaux modèles aptes à décrire formellement des systèmes informatiques, la classe des systèmes de transition bien structurés [ACJT96, FS01] occupe une place importante, et ce, pour deux raisons essentielles. Tout d’abord, cette classe généralise plusieurs autres classes bien étudiées et utiles de modèles à espace <p>d’états infini, comme les réseaux de Petri [Pet62](et leurs extensions monotones [Cia94, FGRVB06]) ou les systèmes communiquant par canaux FIFO avec pertes [AJ93]. Ensuite, des problèmes intéressants peuvent être résolus algorithmiquement sur cette classe. Parmi ces problèmes, on trouve le probléme de couverture, auquel certaines propriétés intéressantes de sûreté peuvent être réduites. <p>Dans la première partie de cette thèse, nous nous intéressons au problème de couverture. Jusqu’à présent, le seul algorithme général (c’est-à-dire applicable à n’importe quel système bien structuré) pour résoudre ce problème était un algorithme dit en arrière [ACJT96] car il calcule itérativement tous les états potentiellement non-sûrs et vérifie si l’état initial du système en fait partie. Nous proposons Expand, Enlarge and Check, le premier algorithme en avant pour résoudre le problème de couverture, qui calcule les états potentiellement accessibles du système et vérifie si certains d’entre eux sont non-sûrs. Cette approche est plus efficace en pratique, comme le montrent nos expériences. Nous présentons également des techniques permettant d’accroître l’efficacité de notre méthode dans le cas où nous analysons des réseaux de Petri (ou <p>une de leurs extensions monotones), ou bien des systèmes communiquant par canaux FIFO avec pertes. Enfin, nous nous intéressons au calcul de l’ensemble de couverture pour les réseaux de Petri, un objet mathématique permettant notamment de résoudre le problème de couverture. Nous étudions l’algorithme de Karp & Miller [KM69], une solution classique pour calculer cet ensemble. Nous montrons qu’une optimisation de cet algorithme présenté dans [Fin91] est fausse, et nous proposons une autre solution totalement neuve, et plus efficace que la solution de Karp & Miller. <p>Dans la seconde partie de la thèse, nous nous intéressons aux pouvoirs d’expression des systèmes bien structurés, tant en terme de mots infinis que de mots finis. Le pouvoir d’expression d’une classe de systèmes est, en quelque sorte, une mesure de la diversité des comportements que les modèles de cette classe peuvent représenter. En ce qui concerne les mots infinis, nous étudions les pouvoirs d’expression des réseaux de Petri et de deux de leurs extensions (les réseaux de Petri avec arcs non-bloquants et les réseaux de Petri avec arcs de transfert). Nous montrons qu’il existe une hiérarchie stricte entre ces différents pouvoirs d’expression. Nous obtenons également des résultats partiels concernant le pouvoir d’expression des réseaux de Petri avec arcs de réinitialisation. En ce qui concerne les mots finis, nous introduisons la classe des langages bien structurés, qui sont des langages acceptés par des systèmes de transition bien structurés étiquettés, où l’ensemble des états accepteurs est clos par le haut. Nous prouvons trois lemmes de pompage concernant ces langages. Ceux-ci nous permettent de réobtenir facilement des résultats classiques de la littérature, ainsi que plusieurs nouveaux résultats. En particulier, nous prouvons, comme dans le cas des mots infinis, qu’il existe une hiérarchie stricte entre les pouvoirs d’expression des extensions des réseaux de Petri considérées. / Doctorat en sciences, Spécialisation Informatique / info:eu-repo/semantics/nonPublished
|
399 |
Health literacy among newly arrived refugees in Sweden and implications for health and healthcareWångdahl, Josefin January 2017 (has links)
The overall aim of this thesis was to examine the distribution of health literacy (HL) levels in newly arrived Arabic-, Dari-, or Somali-speaking refugees in Sweden. Further aims were to investigate sociodemographic characteristics associated with inadequate HL in this group, and to investigate whether HL levels are associated with experiences of the health examination for asylum seekers (HEA), health seeking behaviour and health. Three quantitative cross-sectional studies, using data from two different surveys, were conducted among Arabic-, Dari-, and Somali-speaking, newly arrived refugees taking part in courses in Swedish for immigrants or civic orientation. In addition, an explorative qualitative study, based on focus group discussions, was performed on Arabic- and Somali-speaking newly arrived refugees who had taken part in an HEA. All data were collected 2013-2016. The quantitative data were analysed using different statistical methods, foremost descriptive statistics and univariate and multivariate binary logistic regression analyses. The qualitative data were analysed using Graneheim and Lundman’s method for latent content analysis. The main findings were that the majority of Arabic-, Dari-, or Somali-speaking refugees in Sweden have limited functional health literacy (FHL) and/or limited comprehensive health literacy (CHL). Having a low education level and/or being born in Somalia were associated with having inadequate FHL, but not with having inadequate CHL. Limited FHL was associated with inadequate CHL. Experiences of poor quality of communication and having benefited little from the HEA were more common among those with limited CHL, as compared to those with higher CHL. Experiences of communication problems and a lack of information related to the HEA were found in the qualitative studies as well. In addition, it was more common that those with limited CHL reported poor general health and impaired psychological well-being, and that they had refrained from seeking healthcare. In conclusion: limited HL is common among newly arrived refugees in Sweden and seems to be of importance for the experience of the HEA, health-seeking behaviour and health. HL needs to be taken into consideration in the work with refugees in order to increase equity in healthcare and health.
|
400 |
Hokejový stadion / Ice Hockey StadiumČech, Martin January 2018 (has links)
Work deals with variant design of steel structure of ice hockey stadium located in Opava. It is a three-aisled hall with shape consists of intersection of ellipse and rectangle with dimensions 70 x 82m. The roof has cylindrical shape with approx. 50 m radius. The building is about 14 m high. Object is divided to three parts – main aisle and two side aisles. The main aisle contains of a rectangle of dimensions 40 x 42 m and two semicircles of radius approx. 20 m. Frames of main aisle are made of arc roof truss connected to steel plate columns. The side aisles with rectangular shape with dimensions 15 x 42 m are connected to main aisle. The structure of side aisle is made of a sloped roof truss. Longitudinal bracing and cross bracing are used to obtain spatial rigidity of the structure. Roof and wall cladding is made of Kingspan sandwich panels.
|
Page generated in 0.2547 seconds