International Telemetering Conference Proceedings / October 28-31, 1996 / Town and Country Hotel and Convention Center, San Diego, California / White Sands Missile Range (WSMR) is developing a new transportable telemetry system that consolidates various telemetry data collection functions currently being performed by separate instrumentation. The new system will provide higher data rate handling capability, reduced labor requirements, and more efficient operations support which will result in a reduction of mission support costs. Seven new systems are planned for procurement through Requirements Contracts. They will replace current mobile systems which are over 25 years old on a one-on-one basis. Regulation allows for a sixty-five percent overage on the contract and WSMR plans to make this contract available for use by other Major Range Test Facility Bases (MRTFBs). Separate line items in the contracts make it possible to vary the design to meet a specific system configuration. This paper describes both current and replacement mobile telemetry system

Approved for public release, distribution is unlimited / The Surface Combat Systems Center (SCSC), Wallops Island, Virginia is a combination of personnel, geography, airspace, and technology located on a barrier island off Virginia's Eastern Shore. First opened in 1985 as a US Navy, AEGIS Land-Based Test Site (LBTS), SCSC has grown to include the Ship Self Defense (SSD), and DD(X) combat system facilities to the site. SCSC is chartered to support computer program development, life cycle and in-service engineering, team training, and research, development, test, and evaluation services while adapting to evolution of US Naval combatants and emerging requirements. The purpose of this document is to present an analysis of existing US Navy shipboard and land-based organization business practices and apply them to the existing SCSC command organization. The objective is to combine US Navy transformation concepts and SCSC planning concepts to provide the documentation needed to support the development of new strategic business plans for the command. The goal is to provide a long-term strategy to transform SCSC into the US Navy's East Coast Weapons Range Facility or otherwise named, the Wallops Island Test and Evaluation Range Facility (WITERF), while maintaining its synergy as a LBTS for research, development, testing and evaluation of naval combat systems. / Civilian, United States Navy

Legal aspects of the fight against tax evasion The aim of this thesis is an analysis of selected institutes fighting against tax evasion. Furthermore, an analysis of reasons for their implementation, their purpose and the problems associated with them. Also the current impact of tools that have been part of Czech law for long is reviewed. The thesis is divided into 8 chapters. The first chapter deals with basic concepts, such as a tax, its functions and principles. The second chapter discusses what is tax evasion, the issue of defying what is still considered a tax evasion and what not, and also highlights the socio- economic origin of tax evasion. Furthermore, the chapter summarizes effective and necessary tools in fight against tax evasion in the European Union, which provides the legal framework in tax laws for the Czech Republic. Finally, this chapter is an overview of the effects of cooperation and active battle against tax evasion within the European Union. In following chapters, various mechanisms are analysed. The first is an inspection report, a new tool introduce on 1/1/2016. This chapter also describe problems of carousel fraud and the analysis of the constitutional complaint filed related to this institute. Other instruments are the reverse charge and the concept of liability. These two...

Les schématisations de termes permettent de représenter des ensembles infinis de termes ayant une structure similaire de manière finie et compacte. Dans ce travail, nous étudions certains aspects liés à l'utilisation des schématisations de termes en déduction automatique, plus particulièrement dans les méthodes de démonstration de théorèmes du premier ordre par saturation. Après une brève étude comparée des formalismes de schématisation existants, nous nous concentrons plus particulièrement sur les termes avec exposants entiers (ou I-termes). Dans un premier temps, nous proposons une nouvelle approche permettant de détecter automatiquement des régularités dans les espaces de recherche. Cette détection des régularités peut avoir plusieurs applications, notamment la découverte de lemmes nécessaires à la terminaison dans certaines preuves inductives. Nous présentons DS3, un outil qui implémente ces idées. Nous comparons notre approche avec d'autres techniques de généralisation de termes. Notre approche diffère complètement des techniques existantes car d'une part, elle est complètement indépendante de la procédure de preuve utilisée et d'autre part, elle utilise des techniques de généralisation inductive et non déductives. Nous discutons également les avantages et les inconvénients liés à l'utilisation de notre méthode et donnons des éléments informels de comparaison avec les approches existantes. Nous nous intéressons ensuite aux aspects théoriques de l'utilisation des I-termes en démonstration automatique. Nous démontrons que l'extension aux I-termes du calcul de résolution ordonnée est réfutationnellement complète, que l'extension du calcul de superposition n'est pas réfutationnellement complète et nous proposons une nouvelle règle d'inférence pour restaurer la complétude réfutationnelle. Nous proposons ensuite un algorithme d'indexation (pour une sous-classe) des I-termes, utile pour le traitement des règles de simplification et d'élimination de la redondance. Finalement nous présentons DEI, un démonstrateur automatique de théorèmes capable de gérer directement des formules contenant des I-termes. Nous évaluons les performances de ce logiciel sur un ensemble de benchmarks. / Term schematisations allow one to represent infinite sets of terms having a similar structure by a finite and compact form. In this work we study some issues related to the use of term schematisation in automated deduction, in particular in saturation-based first-order theorem proving. After a brief comparative study of existing schematisation formalisms, we focus on terms with integer exponents (or I-terms). We first propose a new approach allowing to automatically detect regularities (obviously not always) on search spaces. This is motivated by our aim at extending current theorem provers with qualitative improvements. For instance, detecting regularities permits to discover lemmata which is mandatory for terminating in some kinds of inductive proofs. We present DS3, a tool which implements these ideas. Our approach departs from existing techniques since on one hand it is completely independent of the proof procedure used and on the other hand it uses inductive generalization techniques instead of deductive ones. We discuss advantages and disadvantages of our method and we give some informal elements of comparison with similar approaches. Next we tackle some theoretical aspects of the use of I-terms in automated deduction. We prove that the direct extension of the ordered resolution calculus is refutationally complete. We provide an example showing that a direct extension of the superposition calculus is not refutationally complete and we propose a new inference rule to restore refutational completeness. We then propose an indexing algorithm for (a subclass of) I-terms. This algorithm is an extension of the perfect discrimination trees that are are employed by many efficient theorem provers to implement redundancy elimination rules. Finally we present DEI, a theorem prover with built-in capabilities to handle formulae containing I-terms. This theorem-prover is an extension of the E-prover developed by S. Schulz. We evaluate the performances of this software on a set of benchmarks.

Made available in DSpace on 2016-03-15T19:33:57Z (GMT). No. of bitstreams: 1 Ana Cristina Magalhaes Fontes.pdf: 1430927 bytes, checksum: ae2dda16429c8bcf00a5e06f2be3bda1 (MD5) Previous issue date: 2013-08-23 / The present study analyzes the role of the labor courts in Brazil regarding gender equality, to verify to what extent the social demands for equality are reflected in labor suits, and the results of these cases. For this purpose, the role of women in the world of work and the question of gender equality are examined from the perspective of gender awareness, with analysis of the forms of discrimination in the workplace. Finally, an analysis of court decisions in labor suits based on issues of gender equality is undertaken to note the difficulties faced and the results attained, to enable reaching conclusions on the role that can be played by the labor courts in promoting gender equality. / O presente estudo tem por objeto a análise do papel da Justiça do Trabalho relativamente à igualdade de gênero, de forma a verificar se as demandas sociais a ela relativas se transformam em litígios trabalhistas e, em caso positivo, qual tem sido o resultado destes. Para tanto, apresenta proposta de reflexão acerca do papel da mulher no mundo do trabalho, com base na teoria da divisão sexual do trabalho e relacionando a questão de igualdade de gênero sob a perspectiva da consciência de gênero, analisando, ainda, formas de discriminação no ambiente laboral. Por fim, propõe-se a analisar, mediante a realização de pesquisa jurisprudencial, a existência de reclamações trabalhistas com fundamento em igualdade de gênero, bem como as dificuldades e os resultados alcançados por estas, examinando a existência ou não de um papel a ser desempenhado pela Justiça do Trabalho na promoção da igualdade de gênero.

The goal of General Game Playing (GGP) is to develop a system, that is able to automatically play previously unseen games well, solely by being given the rules of the game. In contrast to traditional game playing programs, a general game player cannot be given game specific knowledge. Instead, the program has to discover this knowledge and use it for effectively playing the game well without human intervention. In this thesis, we present a such a program and general methods that solve a variety of knowledge discovery problems in GGP. Our main contributions are methods for the automatic construction of heuristic evaluation functions, the automated discovery of game structures, a system for proving properties of games, and symmetry detection and exploitation for general games.

Made available in DSpace on 2014-12-17T15:48:07Z (GMT). No. of bitstreams: 1 AntonioAOVS.pdf: 849695 bytes, checksum: 575cdb368ae14f3aad606763ebea7114 (MD5) Previous issue date: 2004-10-13 / The widespread growth in the use of smart cards (by banks, transport services, and cell phones, etc) has brought an important fact that must be addressed: the need of tools that can be used to verify such cards, so to guarantee the correctness of their software. As the vast majority of cards that are being developed nowadays use the JavaCard technology as they software layer, the use of the Java Modeling Language (JML) to specify their programs appear as a natural solution. JML is a formal language tailored to Java. It has been inspired by methodologies from Larch and Eiffel, and has been widely adopted as the de facto language when dealing with specification of any Java related program. Various tools that make use of JML have already been developed, covering a wide range of functionalities, such as run time and static checking. But the tools existent so far for static checking are not fully automated, and, those that are, do not offer an adequate level of soundness and completeness. Our objective is to contribute to a series of techniques, that can be used to accomplish a fully automated and confident verification of JavaCard applets. In this work we present the first steps to this. With the use of a software platform comprised by Krakatoa, Why and haRVey, we developed a set of techniques to reduce the size of the theory necessary to verify the specifications. Such techniques have yielded very good results, with gains of almost 100% in all tested cases, and has proved as a valuable technique to be used, not only in this, but in most real world problems related to automatic verification / O grande crescimento do uso de smart cards (por bancos, companhias de transporte, celulares, etc) trouxe um fato importante, que deve ser considerado: a necessidade de ferramentas que possam ser usadas para verificar os cart?es, para que se possa garantir a corretude de seu software. Como a grande maioria dos cart?es desenvolvidos hoje em dia usa a tecnologia JavaCard em sua camada de software, o uso da Java Modeling Language (JML) para especificar os programas aparece como uma solu?ao natural. JML ? uma linguagem de especifica??o formal ligada ao Java. Ela foi inspirada pelas metodologias de Larch e Eiffel, e foi largamente adotada como a linguagem de facto em se tratando da especifica??o de qualquer programa relacionado ? Java. V?rias ferramentas que fazem uso de JML j? foram desenvolvidas, cobrindo uma grande gama de funcionalidades, entre elas, a verifica??o em tempo de execu??o e est?tica. Mas as ferramentas existentes at? o momento para a verifica??o est?tica n?o s?o totalmente automatizadas, e, aquelas que s?o, n?o oferecem um n?vel adequado de completude e seguran?a. Nosso objetivo ? contribuir com uma s?rie de t?cnicas, que podem ser usadas para alcan?ar uma verifica??o completamente autom?tica e segura para applets JavaCard. Nesse trabalho n?s apresentamos os primeiros passos nessa dire??o. Com o uso de uma plataforma de software composta pelo Krakatoa, Why e haRVey, n?s desenvolvemos um conjunto de t?cnicas para reduzir o tamanho da teoria necess?ria para verificar as especifica??es. Tais t?cnicas deram resultados muito bons, com ganhos de quase 100% em todos os testes que realizamos, e se provou como uma t?cnica que deve ser sempre considerAda, n?o somente nesse, mas na maioria dos problemas reais relacionado com verifica??o autom?tica

In classical propositional logic (CPL) logical reasoning is formalised as logical entailment and can be computed by means of tableau and resolution proof procedures. Unfortunately CPL is not expressive enough and using first order logic (FOL) does not solve the problem either since proof procedures for these logics are not decidable. Modal propositional logics (MPL) on the other hand are both decidable and more expressive than CPL. It therefore seems reasonable to apply tableau and resolution proof systems to MPL in order to compute logical entailment in MPL. Although some of the principles in CPL are present in MPL, there are complexities in MPL that are not present in CPL. Tableau and resolution proof systems which address these issues and others will be surveyed here. In particular the work of Abadi & Manna (1986), Chan (1987), del Cerro & Herzig (1988), Fitting (1983, 1990) and Gore (1995) will be reviewed. / Computing / M. Sc. (Computer Science)

In this dissertation a formalisation of nonmonotonic reasoning, namely Default logic, is discussed. A proof theory for default logic and a variant of Default logic - Prioritised Default logic - is presented. We also pursue an investigation into the relationship between default reasoning and making inferences in a neural network. The inference problem shifts from the logical problem in Default logic to the optimisation problem in neural networks, in which maximum consistency is aimed at The inference is realised as an adaptation process that identifies and resolves conflicts between existing knowledge about the relevant world and external information. Knowledge and data are transformed into constraint equations and the nodes in the network represent propositions and constraint equations. The violation of constraints is formulated in terms of an energy function. The Hopfield network is shown to be suitable for modelling optimisation problems and default reasoning. / Computer Science / M.Sc. (Computer Science)

CAPES / Este trabalho apresenta um estudo sobre os Números Primos que passa por resultados básicos, como a infinitude dos números primos e o Teorema Fundamental da Aritmética, e resultados mais sofisticados, como o Teorema de Wilson e a consequente função geradora de primos. Além dos resultados teóricos apresenta-se uma interpretação geométrica para os números primos. Essa interpretação e aplicada na ilustração de alguns dos resultados relacionados a primos abordados no ensino básico. Atividades envolvendo a interpretação geométrica apresentada são sugeridas no capítulo final. / This work presents a study about Prime Numbers, since basic results, like the prime number’s infinity and the Arithmetic Fundamental Theorem, to more sophisticated results, as Wilson’s Theorem and it’s consequent Prime generating function. Further the theoretical results we present a prime’s geometric interpretation. This interpretation is applied to illustrate some results related to primes, which appears in basic education. Activities about this geometric interpretation are suggested in the final chapter.