Search

The CYber DEfenSe Trainer (CYDEST) is a virtualized training platform for network defense and computer forensics. It uses virtual machines to provide tactical level exercises for personnel such as network administrators, first responders, and digital forensics investigators. CYDEST incorporates a number of features to reduce instructor workload and to improve training realism, including: (1) automated assessment of trainee performance, (2) automated attacks that respond dynamically to the student's actions, (3) a full fidelity training environment, (4) an unrestricted user interface incorporating real tools, and (5) continuous, remote accessibility via the Web.

The following topics are covered in viewgraph form: (1) the Penelope Project; (2) the logic of an experimental automatic guidance control system for a 737; (3) Larch/Ada specification; (4) some failures of informal description; (5) description of mode changes caused by switches; (6) intuitive description of window status (chosen vs. current); (7) design of the code; (8) and specifying the code.

ATC-NY and Cornell University are developing SCorES, a mathematically based tool to support the development of demonstrably correct distributed Systems. SCorES extends to distributed and hybrid systems a paradigm for program development that has been successful in the world of sequential programming-employing methods that are declarative (rather than operational) and constructive. Declarative methods permit systems to be specified, analyzed, developed, and verified at a conceptual level congenial to human designers. Constructive methods permit automatic code synthesis. Incorporating these methods within the NuPrl environment provides powerful automated support for specifying, developing, verifying, and synthesizing real-time distributed systems at a high level of abstraction. This report describes two things: a prototype that supports automatic code generation from proofs in a domain-specific logic of distributed systems (one that does not model real-time); an extension of that logic to the domain of hybrid systems, which may contain variables that vary continuously in real time. We demonstrate the code generator by deriving a verifiably correct leader election protocol; and we demonstrate the logic of hybrid systems by applying it to a mutual exclusion algorithm that generalizes Fischer's protocol to distributed systems.

Long term use of immunosuppressants impacts the cardiovascular system and increases the risk of infection and malignancy. To effectively reduce immunosuppression in a transplant recipient a tool is needed to directly monitor the level of immune function. The Cylex® Immune Cell Function Assay, approved by the FDA for the assessment of cell-mediated immunity, shows promise as an objective measure of a transplant recipient's immune function. In a blinded retrospective study, the immune function was compared to clinical courses and histological examinations of biopsies of 20 small bowel transplant recipients during periods of immunosuppressant tapering. Eight patients with no major adverse events or changes of immunosuppressive therapy had moderate to low immune function and were categorized as immunologically and clinically stable. Twelve patients displaying strong immune responses were immunologically and clinically volatile requiring addition of steroids and or OKT3. Results validate the clinical utility of the Cylex Immune Cell Function Assay as an objective tool for assessing immune function. By evaluating immune function, physicians now can identify those patients who are candidates for minimization of immunosuppressant therapy, manage the timing and rate of immunosuppressant weaning and be forewarned of increased patient risk.

Cada vez mais o tempo acaba sendo o diferencial de uma empresa para outra. As empresas, para serem bem sucedidas, precisam da informação certa, no momento certo e para as pessoas certas. Os dados outrora considerados importantes para a sobrevivência das empresas hoje precisam estar em formato de informações para serem utilizados. Essa é a função das ferramentas de “Business Intelligence”, cuja finalidade é modelar os dados para obter informações, de forma que diferencie as ações das empresas e essas consigam ser mais promissoras que as demais. “Business Intelligence” é um processo de coleta, análise e distribuição de dados para melhorar a decisão de negócios, que leva a informação a um número bem maior de usuários dentro da corporação. Existem vários tipos de ferramentas que se propõe a essa finalidade. Esse trabalho tem como objetivo comparar ferramentas através do estudo das técnicas de modelagem dimensional, fundamentais nos projetos de estruturas informacionais, suporte a “Data Warehouses”, “Data Marts”, “Data Mining” e outros, bem como o mercado, suas vantagens e desvantagens e a arquitetura tecnológica utilizada por estes produtos. Assim sendo, foram selecionados os conjuntos de ferramentas de “Business Intelligence” das empresas Microsoft Corporation e Oracle Corporation, visto as suas magnitudes no mundo da informática.

This rationale provides a careful, but informal, account of the meanings of Larch/Ada specifications. It also describes the simplifying assumptions under which proofs in the Penelope verification environment imply that an Ada program satisfies its Larch/Ada specification. The account is intended to be adequate to the needs of a Penelope or Larch/Ada user, and to serve as an introduction for mathematically motivated readers who wish to consult other documents detailing the mathematics of Penelope.

A study of the Jewish theme in Russian culture, this analyzes not only Jewish characters in literature, but also the often anti-Semitic attitudes of the writers and their readers. The author draws on insights from linguistics and psychoanalysis to supplement his literary criticism.

The Kondo-Addison theorem says that every set A of reals contains a real which is implicit (for short, Imp). Any real which is Imp is constructible, and it is the main purpose of this note to show that a close examination of the usual Kondo-Addison argument allows us to compute (in terms of the ordinals associated with A by the classical representation theorem) where in the constructible hierarchy an element of A ∩ Imp must occur. This result is related to a basis theorem of Barwise and Fisher [1] and is accompanied by a strong counterexample which shows that certain tepid improvements of their theorem (and, a fortiori, of the main theorem in this note) are impossible. As a final flourish, the ‘classifying ordinals’ used to compute the locations of the singletons are themselves characterized using an idea from [1].

Assume projective determinacy. For any real α \alpha , let λ 3 α = sup { ξ | ξ \lambda _3^\alpha = \sup \{ \xi |\xi is the type of a prewellordering of the reals which is Δ 3 1 \Delta _3^1 in α } \alpha \} . Then, C 3 {\mathcal {C}_3} , the largest countable Π 3 1 \Pi _3^1 set of reals, is equal to { α | ∀ β ( λ 3 α ⩽ λ 3 β ⇒ α \{ \alpha |\forall \beta (\lambda _3^\alpha \leqslant \lambda _3^\beta \Rightarrow \alpha is Δ 3 1 \Delta _3^1 in β ) } \beta )\} . This result, which is true for all odd levels and generalizes a previously known characterization of C 1 {\mathcal {C}_1} , answers a question of Kechris.

Publisher Summary This chapter studies analytical wellorderings in the real line by answering in ZF and some of its extensions. The chapter explores the order types and the relationship between the position of a real in some wellordering and its analytical definability. The chapter discusses models of analysis. The language of analysis is a two-sorted language with variables for reals and natural numbers. For each finite sequence “s” of sorts, there are countably many relation symbols with arguments “s.” The chapter explains that a model is completely determined by its domain of reals, and the relation symbols will, by some natural correspondence, be interpreted as the recursive subsets of the appropriate product space.