• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 129
  • 44
  • 30
  • 25
  • 14
  • 13
  • 10
  • 8
  • 6
  • 4
  • 4
  • 3
  • 3
  • 2
  • 2
  • Tagged with
  • 288
  • 75
  • 46
  • 33
  • 31
  • 30
  • 26
  • 22
  • 22
  • 20
  • 19
  • 17
  • 15
  • 14
  • 14
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
161

From qualitative to quantitative program analysis : permissive enforcement of secure information flow / Approches qualitatives et quantitatives d'analyse de programmes : mise en oeuvre permissive de flux d’information sécurisés

Assaf, Mounir 06 May 2015 (has links)
De nos jours, les ordinateurs sont omniprésents. Tous ces ordinateurs stockent et manipulent de l'information, parfois sensible, d'où l'intérêt de protéger et de confiner la dissémination de cette information. Les mécanismes de contrôle de flux d'information permettent justement d'analyser des programmes manipulant de l'information sensible, afin de prévenir les fuites d'information. Les contributions de cette thèse incluent des techniques d'analyse de programmes pour le contrôle de flux d'information tant qualitatif que quantitatif. Les techniques d'analyse qualitatives permettent la détection et la prévention des fuites d'information. Les techniques quantitatives permettent d'estimer ces fuites afin de décider si elles sont négligeables. / Computers have become widespread nowadays. All these computers store and process information. Often, some of this information is sensitive; hence the need to confine and control its dissemination. An important field in computer science, that is concerned about analysing programs in order to confine and control the release of sensitive information, is the information flow control field. The contributions of this thesis include program analysis techniques for qualitative and quantitative information flow control. Qualitative techniques aim at detecting and preventing information leaks. Quantitative techniques go beyong the detection of information leaks, by estimating the leakage in order to decide whether it is negligeable.
162

Bases de Hilbert / Hilbert Basis

Marcelo Hashimoto 28 February 2007 (has links)
Muitas relações min-max em otimização combinatória podem ser demonstradas através de total dual integralidade de sistemas lineares. O conceito algébrico de bases de Hilbert foi originalmente introduzido com o objetivo de melhor compreender a estrutura geral dos sistemas totalmente dual integrais. Resultados apresentados posteriormente mostraram que bases de Hilbert também são relevantes para a otimização combinatória em geral e para a caracterização de certas classes de objetos discretos. Entre tais resultados, foram provadas, a partir dessas bases, versões do teorema de Carathéodory para programação inteira. Nesta dissertação, estudamos aspectos estruturais e computacionais de bases de Hilbert e relações destas com programação inteira e otimização combinatória. Em particular, consideramos versões inteiras do teorema de Carathéodory e conjecturas relacionadas. / There are several min-max relations in combinatorial optimization that can be proved through total dual integrality of linear systems. The algebraic concept of Hilbert basis was originally introduced with the objective of better understanding the general structure of totally dual integral systems. Some results that were proved later have shown that Hilbert basis are also relevant to combinatorial optimization in a general manner and to characterize certain classes of discrete objects. Among such results, there are versions of Carathéodory\'s theorem for integer programming that were proved through those basis. In this dissertation, we study structural and computational aspects of Hilbert basis and their relations to integer programming and combinatorial optimization. In particular, we consider integer versions of Carathéodory\'s theorem and related conjectures.
163

Varumärken på den digitala vårdmarknaden : En kvantitativ studie om hur de digitala vårdgivarnas varumärken i Sverige uppfattas av konsumenterna

Nilsson, Adam, Huang, Mingshi January 2021 (has links)
Digital healthcare is a relatively new market which brings along some challenges. The transfer from a traditional physical healthcare with its natural trustworthiness and reliability for the consumers to a digital space is a major challenge. Along with the fact that the new market comes with a lot of competition that forces the digital caregivers to distinguish themselves with their brands. Since the market for digital healthcare is relatively new there is a gap in the knowledge regarding how consumers perceive the brands of the digital caregivers, which is the basis of the purpose of this study.  The purpose of this study is to map how consumers perceive the brands in the market of digital healthcare. To answer the purpose the study uses a deductive approach including theories about customer-based brand equity, brand personality and brand attitude. Through a quantitative method with a cross-sectional design and a survey, data has been collected to be analyzed with the theories to answer the research questions and purpose of the study. The digital caregivers that are included in the study is Kry, Doktor.se, Min Doktor, Doktor24 and 1177 Vårdguiden.The conclusions that could be drawn based on the analysis was that the brands who succeeded the most in creating brand awareness were also the brands that were perceived in a more positive light by the consumers. The analysis also showed that some of the digital caregivers brands had not yet been able to build the brand awareness that can lead to a more positive perception and therefore was perceived in a neutral and negative manner. 1177 Vårdguiden differentiated itself in most aspects in relation to the private digital caregivers since they already had an established brand prior to the birth of the digital healthcare market. / Den digitala vårdmarknaden är relativt ny och för med sig en mängd utmaningar. Flytten från den traditionella fysiska vården innebär utmaningar med att bygga upp det förtroende och den tillit hos konsumenterna som funnits naturligt i det fysiska mötet, till det digitala. En konkurrensutsatt marknad tvingar också de digitala vårdgivarna att utmärka sig genom sitt varumärke och genom att marknaden för digitala vårdgivare är relativt ny, så finns det ett tomrum i kunskapen om hur konsumenter ser på och uppfattar de digitala vårdgivarnas varumärken och det är också grunden till studiens syfte. Syftet med studien var att kartlägga konsumenternas uppfattning om varumärken inom den digitala vårdmarknaden. För att svara på syftet har studien haft ett deduktivt angreppssätt med teorier om konsumentbaserat varumärkeskapital, varumärkespersonlighet och varumärkesattityd. Genom en kvantitativ metod med tvärsnittsdesign och en enkätstudie har data samlats in för att analyseras med hjälp av teorierna för att svara på syftet. De digitala vårdgivare som undersöks i denna studie var Kry, Doktor.se, Min Doktor, Doktor24 och 1177 Vårdguiden. De slutsatser som kunde dras baserat på analysen var att de varumärken som lyckats bäst med att skapa en varumärkeskännedom var också de varumärken som uppfattas mer positivt hos konsumenterna. Det kunde också utrönas att vissa digitala vårdgivares varumärken ännu inte lyckats bygga upp den varumärkeskännedom som kan leda till en mer positiv uppfattning och därför uppfattades både neutralt och negativt hos konsumenterna. 1177 Vårdguiden skiljde sig i de flesta aspekter gentemot de privata digitala vårdgivarna då de redan innan den digitala vårdmarknadens uppkomst har haft ett etablerat varumärke.
164

Hledání nejkratší cesty pomocí mravenčích kolonií - Java implementace / Ant Colony Optimization Algorithms for Shortest Path Problems - Java implementation

Dostál, Marek January 2014 (has links)
This diploma thesis deals with ant colony optimization for shortest path problems. In the theoretical part it describes Ant Colony Optimization. In the practical part ant colony optimization algorithms are selected for the design and implementation of shortest path problems in the Java.
165

Studies on mathematical structures of network optimization problems / ネットワーク最適化問題の数学的構造に関する研究 / ネットワーク サイテキカ モンダイ ノ スウガクテキ コウゾウ ニカンスル ケンキュウ

渡辺 扇之介, Sennosuke Watanabe 20 September 2013 (has links)
本論文は,様々なネットワーク最適化問題の数学的構造について様々な観点から調べたものである.主たる結果はネットワーク最適化問題の代表例である最大流問題に,関するいくつかの結果と,Min-Plus代数に値をもつ行列の固有値と固有ベクトルに関する特徴づけに関する結果からなっている. / 博士(理学) / Doctor of Philosophy in Science / 同志社大学 / Doshisha University
166

Machine Learning Uplink Power Control in Single Input Multiple Output Cell-free Networks

Tai, Yiyang January 2020 (has links)
This thesis considers the uplink of cell-free single input multiple output systems, in which the access points employ matched-filter reception. In this setting, our objectiveis to develop a scalable uplink power control scheme that relies only on large-scale channel gain estimates and is robust to changes in the environment. Specifically, we formulate the problem as max-min and max-product signal-to-interference ratio optimization tasks, which can be solved by geometric programming. Next, we study the performance of supervised and unsupervised learning approaches employing a feed-forward neural network. We find that both approaches perform close to the optimum achieved by geometric programming, while the unsupervised scheme avoids the pre-computation of training data that supervised learning would necessitate for every system or environment modification. / Den här avhandlingen tar hänsyn till upplänken till cellfria multipla utgångssystem med en enda ingång, där åtkomstpunkterna använder matchad filtermottagning. I den här inställningen är vårt mål att utveckla ett skalbart styrsystem för upplänkskraft som endast förlitar sig på storskaliga uppskattningar av kanalökningar och är robusta för förändringar i miljön. Specifikt formulerar vi problemet som maxmin och max-produkt signal-till-störningsförhållande optimeringsuppgifter, som kan lösas genom geometrisk programmering. Därefter studerar vi resultatet av övervakade och okontrollerade inlärningsmetoder som använder ett framåtriktat neuralt nätverk. Vi finner att båda metoderna fungerar nära det optimala som uppnås genom geometrisk programmering, medan det övervakade schemat undviker förberäkningen av träningsdata som övervakat inlärning skulle kräva för varje system- eller miljöändring.
167

The complexity and expressive power of valued constraints

Zivny, Stanislav January 2009 (has links)
This thesis is a detailed examination of the expressive power of valued constraints and related complexity questions. The valued constraint satisfaction problem (VCSP) is a generalisation of the constraint satisfaction problem which allows to describe a variety of combinatorial optimisation problems. Although most results are stated in this framework, they can be interpreted equivalently in the framework of, for instance, pseudo-Boolean polynomials, Gibbs energy minimisation, or Markov Random Fields. We take a result of Cohen, Cooper and Jeavons that characterises the expressive power of valued constraint in terms of certain algebraic properties, and extend this result by showing yet another connection between the expressive power of valued constraints and linear programming. We prove a decidability result for fractional clones. We consider various classes of valued constraints and the associated cost functions with respect to the question of which of these classes can be expressed using only cost functions of bounded arities. We identify the first known example of an infinite chain of classes of constraints with strictly increasing expressive power. We present a full classification of various classes of constraints with respect to this problem. We study submodular constraints and cost functions. Submodular functions play a key role in combinatorial optimisation and are often considered to be a discrete analogue of convex functions. It has previously been an open problem whether all Boolean submodular cost functions can be decomposed into a sum of binary submodular cost functions over a possibly larger set of variables. This problem has been considered within several different contexts in computer science, including computer vision, artificial intelligence, and pseudo-Boolean optimisation. Using a connection between the expressive power of valued constraints and certain algebraic properties of cost functions, we answer this question negatively. Our results have several corollaries. First, we characterise precisely which submodular polynomials of degree 4 can be expressed by quadratic submodular polynomials. Next, we identify a novel class of submodular functions of arbitrary arities that can be expressed by binary submodular functions, and therefore minimised efficiently using a so-called expressibility reduction to the (s,t)-Min-Cut problem. More importantly, our results imply limitations on this kind of reduction and establish for the first time that it cannot be used in general to minimise arbitrary submodular functions. Finally, we refute a conjecture of Promislow and Young on the structure of the extreme rays of the cone of Boolean submodular functions.
168

中國人民政治協商會議的利益整合功能. / Chinese people's political consultative conference in interest aggregation / Zhongguo ren min zheng zhi xie shang hui yi de li yi zheng he gong neng.

January 2003 (has links)
李浩然. / "2003年7月". / 論文(哲學碩士)--香港中文大學, 2003. / 參考文獻 (leaves 709-712). / 附中英文摘要. / "2003 nian 7 yue". / Li Haoran. / Lun wen (zhe xue shuo shi)--Xianggang Zhong wen da xue, 2003. / Can kao wen xian (leaves 709-712). / Fu Zhong Ying wen zhai yao. / 論文摘要(中文) --- p.i / 論文摘要(英文) --- p.iii / 謝辭 --- p.v / 目錄 --- p.vi / 列表 --- p.viii / 圖像 --- p.ix / 總論 / Chapter 第一章 --- 研究題目 --- p.1 / Chapter 第二章 --- 相關概念的定義 --- p.15 / 人民政治協商會議的成員構成 / Chapter 第三章 --- 政協委員的組成 --- p.35 / Chapter 第四章 --- 人民政治協商會議常務委員:政治精英研究 --- p.88 / 人民政治協商會議的功能和權力 / Chapter 第五章 --- 人民政治協商會議做了些什麼? --- p.113 / Chapter 第六章 --- 人民政治協商會議的權力基礎 --- p.129 / 人民政治協商會議與中國社會的關係 / Chapter 第七章 --- 第八屆和第九屆政協委員的構成與今日中國社會的分層格局 --- p.144 / Chapter 第八章 --- 人民政治協商會議的作用和位置 --- p.170 / 結論 / Chapter 第九章 --- 人民政治協商會議應該更好地發揮作用 --- p.180 / 附錄:中國人民政治協商會議第一屆至第十屆全國委員會委員名錄 --- p.195 / 參考材料 --- p.698
169

The essence of civil-military relations in post-Deng China: explaining the 1996 Taiwan straits crisis.

January 1998 (has links)
by Chau Ho Wai. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1998. / Includes bibliographical references (leaves 134-140). / Abstract also in Chinese. / ACKNOWLEDGMENTS --- p.iv / LIST OF TABLES --- p.v / ABBREVIATIONS --- p.vi / CHAPTER / Chapter ONE --- INTRODUCTION --- p.1 / Chapter 1.1 --- The Question: How the civil-military relations evolved during the post-Deng era? / Chapter 1.2 --- The Case of the 1996 Taiwan Straits Crisis / Chapter 1.3 --- Framework: Allison's Model of Decision-Making / Chapter 1.4 --- Data and Organization / Chapter TWO --- LITERATURE REVIEW --- p.11 / Chapter 2.1 --- Non-Communist Regimes / Chapter 2.2 --- Communist Regimes / Chapter 2.3 --- Post-Communist World / Chapter 2.4 --- Military Politics in China / Chapter THREE --- INSTITUTIONAL DEVELOPMENT OF PLA: FROM DENG TO POST-DENG ERA --- p.34 / Chapter 3.1 --- PLA in the Deng Era / Chapter 3.2 --- PLA in the Post-Deng Era / Chapter 3.3 --- "Professionalization, Differentiation and Institutionalization" / Chapter FOUR --- ORGANIZATIONAL INTERESTS OF PLA IN THE TAIWAN STRAITS CRISIS --- p.64 / Chapter 4.1 --- The War Games and the Policy Handle / Chapter 4.2 --- Employing the Organizational Process Model / Chapter 4.3 --- Organizational Interests and Demands of the PLA / Chapter 4.4 --- Information Processing of the PLA / Chapter 4.5 --- Resource Acquisitions of the PLA / Chapter FIVE --- BRINGING THE PLA INTERESTS INTO GOVERNMENTAL POLITICS --- p.100 / Chapter 5.1 --- Employing the Governmental Politics Model / Chapter 5.2 --- Perspectives of Jiang Zemin and PLA on the Taiwan Question / Chapter 5.3 --- Political Pulls and Hauls in the Taiwan Straits Crisis / Chapter 5.4 --- Legitimacy and Leadership Succession / Chapter SIX --- CONCLUSION --- p.126 / Chapter 6.1 --- Summary of Findings / Chapter 6.2 --- Prospects of Future Research / BIBLIOGRAPHY --- p.134
170

The Role of the Chinese News Media in the 1989 Pro-democracy Movement

Liao, Mei 01 January 1994 (has links)
This thesis examines the role of the Chinese news media in the 1989 pro-democracy movement. The three functions of this thesis are: 1) to provide evidence of changes in the pro-democracy movement; 2) to identify corresponding changes in the press coverage of the movement; 3) to examine what relationship exists between changes in the movement and changes in the press coverage of the movement.

Page generated in 0.0265 seconds