• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1066
  • 903
  • 214
  • 146
  • 88
  • 62
  • 48
  • 43
  • 26
  • 17
  • 12
  • 10
  • 9
  • 9
  • 8
  • Tagged with
  • 2998
  • 664
  • 427
  • 401
  • 367
  • 365
  • 357
  • 335
  • 299
  • 282
  • 261
  • 247
  • 238
  • 230
  • 221
  • 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.
61

Analýza souborového systému pomocí Verifying C Compiler / Analysis of a File System Using the Verifying C Compiler

Škorvaga, David January 2015 (has links)
Title: Analysis of a File System Using the Verifying C Compiler Author: Bc. David Škorvaga Department: Department of Distributed and Dependable Systems Supervisor: RNDr. Jan Kofroň, Ph.D. Abstract: Formal verification is a way to improve reliability of software systems. One approach of formal verification is focused on proving correctness of annotat- ed source code of an established programming language. Verifying C Compiler (VCC) is a verifier for concurrent C that accepts an annotated code in C language and automatically verifies its correctness with respect to the given annotation. There have been successful attempts to verify some critical systems, including the operating system kernel. Another critical part of operating system is its file system. In the thesis, we choose FatFs file system, a simple device-independent implementation of the FAT file system. We specify a part of it using the VCC annotation and successfully verify its correctness. Keywords: Formal Verification, File System, VCC
62

An HPSG-based Formal Grammar of a Core Fragment of Georgian Implemented in TRALE / An HPSG-based Formal Grammar of a Core Fragment of Georgian Implemented in TRALE

Abzianidze, Lasha January 2011 (has links)
Georgian is remarkably different from Indo-European languages. The language has several linguistic phenomena that are challenging both from theoretical and computational points of view. In addition, it is low- resourced and insufficiently studied from the computational point of view. In the thesis, we model morphology and syntax of a core fragment of the language in a formal grammar. Namely, the formal grammar is written in the HPSG framework - one of the most powerful grammar frameworks nowadays. We also implement the grammar in TRALE - a grammar implementation platform, which is faithful to "hand-written" HPSG-based grammars. Note that this is the first application of HPSG to Georgian.
63

Exploring formal and informal arrangements for care of orphans : a study in the Maseru District of Lesotho.

Makape, Sylvia Makananelo 02 March 2009 (has links)
This study explores both formal and informal arrangements for care of orphans in the Maseru district of Lesotho. The study adopted a qualitative approach using both in-depth interviews and documentary research as the primary methods of data collection. The research findings show that care of orphans in Lesotho is predominantly in the hands of non-governmental and church based organisations. The government’s role is limited to the provision of technical support, including the formulation of policies and laws and some welfare grant provision in the form of free primary education. Care of orphans in the communities is undertaken not only by the extended family members of orphans, but also non-relation community members. It is clear however that while such informal arrangements might provide care and protection to orphan, many are struggling in the face of extreme hardship and poverty. A crisis of social reproduction is therefore increasingly apparent in Lesotho.
64

[en] FOMAL ANALYSIS OF PROTOCOLS AND DISTRIBUTED ALGORITHMS: A BASED-LANGUAGE APPROACH / [pt] ANÁLISE FORMAL DE PROTOCOLOS E ALGORITMOS DISTRIBUÍDOS: UMA ABORDAGEM BASEADA EM LINGUAGEM

CARLOS BAZILIO MARTINS 03 April 2006 (has links)
[pt] Neste trabalho propomos uma arquitetura para a verificação formal de protocolos e algoritmos distribuídos. Esta pode ser vista como uma camada mais abstrata sobre o processo tradicional de verificação formal, onde temos a especificação e propriedade a serem verificadas, o verificador e o resultado retornado por este. O objetivo é simplificar o processo de especificação e verificação formal de protocolos e algoritmos distribuídos através de um ambiente mais dedicado. A parte principal desta arquitetura é a linguagem de especificação LEP, que contém construções de domínio-especifíco para simplificar a especificação destes sistemas. Outra característica desta linguagem é separar as especificações da topologia e do protocolo propriamente dito. Acreditamos que esta separação é válida pois torna mais clara a intenção das partes e ainda permite, por exemplo, o reuso de uma topologia entre diferentes especificações de protocolos. Assim, visamos oferecer uma linguagem cujos exemplos de especificações devem se assemelhar às descrições de algoritmos encontradas nos livros didáticos. Além disso, de forma a se ter a entrada e a saída dos verificadores formais de forma a obter a saída no nível de abstração de LEP. / [en] In this work we propose an architecture for the formal verification of protocols and distribued algoritms. This can be see as a more abstract layer over the ordinary process of formal verification, where we have just the specification of the protocol and properties to be verified, and the formal tool. Our goal is to simplifu the specification and formal verification of protocols and distributed algorithms through a dedicated environment. The core of the architecture is its input specification language (Lep), which provides domain-specific constructions for simplifying the specification of those systems. With LEP the specification of the protocol and the specification of the topology to be referred to protocol are given separetely. We feel that this division improves the legibility of both and allows the reuse of the specification of a topology among distinct protocols. Using this approach we try to offer a language whose specifications should be similar to the descriptions of the algorithms found on the didactic books. Moreover, in order to have the input and output of the architecture compatible, we also propose a way of processing the result of the formal verification tool. Then we could have the result on the abstract level of LEP.
65

Reasoning about free speech

Vidor, Vinicius Costa January 2018 (has links)
No one seems to be against freedom of speech. We have profound disagreements, nonetheless, about what people should be allowed to say. Superficially, these disagreements seem to be independent of our own personal views on larger moral issues such as the desirability of state neutrality and the possibility of promoting certain views of the good life. This perception, however, misrepresents the deeper connections that one's views on free speech have with one's interpretation of political morality; connections which shape the very way in which one reasons about free speech. In order to understand these connections, it is important to be conscious of the rich and complex history of the very notion of freedom of speech. While sometimes represented as a modern ideal, the very fabric of the modern view on free speech is the result of earlier social practices and of competing moral claims. To understand how we think about free speech today it is not enough to look into our own world. Some aspects can only be made vivid by revisiting the history of this notion. But not only that. Aside from reconstructing the history of the modern notion of freedom of speech, we also have to grasp the place of liberalism in shaping our views on these matters. Questions of paternalism, neutrality, and the good life, and of liberalism's relationship to these ideas, are all important in defining what it means to have free speech. Any articulation of free speech which disregards these points would be missing an important aspect of the discussions surrounding what we should be allowed to say. To reason about free speech, we need to go beyond the normal justifications for the freedom of speech. Truth, democracy, and autonomy are the familiar reasons for defending freedom of speech, but they are not the defining aspects of one's free speech reasoning. For that, we need to look elsewhere. This is what the argument in the thesis is set to do: to explore and explain how our free speech reasoning is shaped by historical experiences and by the gradual evolution of a certain view of the moral world. By engaging in a reconstruction of the different forms of reasoning on these issues, the argument sets out a systematic account of the competing ways of reasoning about free speech. The argument has four parts. In Part One, I set out the history of the social practices and moral claims which gave birth to the modern idea of freedom of speech and claim that they are still an integral part of what it means to have free speech. Part One shows how some of the normative positions (liberties, claim-rights, and immunities) which are thought to be part of the freedom of speech were the result of certain historical experiences. Then, in Part Two, I introduce some key theoretical distinctions with regard to liberalism, which provide the argumentative platform for the rest of the thesis. In developing the distinction among different strands of the liberal tradition, the variable role and meanings of principles of neutrality is of particular significance. Part Three then goes on to connect the different strands of the liberal tradition with the justifications for valuing freedom of speech, showing how opposing versions of the arguments for a defense of free speech reflect underlying assumptions about political morality. Finally, Part Four explores the three core aspects of the modern view on free speech: the formalization of moral reasoning, the role of a set of individual rights in the identification of neutral reasons, and the place of one's view on political morality in the delimitation of the meaning of the freedom of speech. It is not the purpose of the argument to defend one particular form of reasoning over the others, but to examine the different argumentative resources that are available within competing strands of the contemporary debate. Put simply, this thesis seeks to show that - and the ways in which - our free speech reasoning is fundamentally shaped by our deeper views about political morality.
66

Circuit Debugging with Error Trace Compaction and Maximum Satisfiability

Chen, Yibin 13 January 2010 (has links)
Improving the performance and functionality of contemporary debugging tools is essential to alleviate the debugging task. This dissertation aims at narrowing the gap between current capabilities of debugging tools and industry requirements by improving two important debugging techniques: error trace compaction and automated debugging. Error trace compaction leverages incremental SAT and heuristics to reduce the number of clock cycles required to observe a failure in an error trace. The technique presented reduces the length of the error trace to a minimum while improving performance by 8× compared to a previous technique. The second contribution uses maximum satisfiability to enhance the functionality and performance of automated debuggers. The method proposed can identify where in the design the bug is located and when in the error trace the bug is excited. Compared to a competitive SAT-based approach, our formulation produces problems that are 80% smaller and that can be solved 4.5x faster.
67

Circuit Debugging with Error Trace Compaction and Maximum Satisfiability

Chen, Yibin 13 January 2010 (has links)
Improving the performance and functionality of contemporary debugging tools is essential to alleviate the debugging task. This dissertation aims at narrowing the gap between current capabilities of debugging tools and industry requirements by improving two important debugging techniques: error trace compaction and automated debugging. Error trace compaction leverages incremental SAT and heuristics to reduce the number of clock cycles required to observe a failure in an error trace. The technique presented reduces the length of the error trace to a minimum while improving performance by 8× compared to a previous technique. The second contribution uses maximum satisfiability to enhance the functionality and performance of automated debuggers. The method proposed can identify where in the design the bug is located and when in the error trace the bug is excited. Compared to a competitive SAT-based approach, our formulation produces problems that are 80% smaller and that can be solved 4.5x faster.
68

The Impacts of Formal and Informal Loans on Small and Medium Enterprises' Performance in Urban Areas, Cambodia

NGOUN, Sethykun 28 March 2012 (has links)
No description available.
69

The adjustment of the Kaohsiung district change-from the New Institution Economics viewpoint

lee, Chiung-Hui 27 January 2003 (has links)
Based on the latest concepts of economics, this study is aimed at the adjustment of the Kaohsiung district change. At the same time, it analyzes the change system on the basis of formal limitation, informal limitation and administration. Kaohsiung City Government was established on Nov. 8 1944. Continuing using under Japanese settlement, Kaohsiung city was separated by districts. There were many Lis under a district. A Li is the basic organization. Kaohsiung city was raised to a special municipality on July 1 1979, edited by Yencheng, Gushan, Zuoying, Nanzih, Sanmin,, Sinsing, Cianjin, Lingya, Cianjhen, Cijin and Siaogang District. Because of the development of economy, the population of Kaohsiung was increased quickly. Due to geographical, economic, and historical factors, the population gap among districts will not be filled up. The adjustment of the district change has to be done without delay. This adjustment has to consider the political fair principle to raise administration efficiency and allotment of district resources reasonably. As the city government, he could not bring up a suitable adjustable project without the research of distribution of population and vision of area development. But this project has to get an approval from the city council to execute. However, councilmen just focus on their personal interests. They seldom play a role faithfully in the city council. This is the reason why the system could not be changed smoothly. The adjustment of district change has a great influence on reducing the finance of city government, strengthening the service for people and distributing the district resource. Kaohsiung city government has to proceed to this project speedily. What is the best public policy? It depends. Through the process of communication, conviction, debate and negotiation, getting the approval from the city council, we could promote all social benefits
70

Deformation Theory of Non-Commutative Formal Groups in Positive Characteristic

Leitner, Frederick Carl January 2005 (has links)
We discuss the deformation theory of non-commutative formal groups G in positive characteristic. Under a geometric assumption on G, we produce a commutative formal group H whose distribution bialgebra has a certain skewed Poisson structure. This structure gives first order deformation data which integrates to the distribution bialgebra of G.

Page generated in 0.0649 seconds