The Roots of Neurofibromas in Neurofibromatosis 1 — A Question of Multipotency, Differentiation and Hiding

Neurofibromatosis type 1 (NF1) is an autosomal dominant cancer predisposition syndrome that affects about 1 in 3500 individuals worldwide. NF1 is caused by mutations in the NF1 gene that encodes the tumor suppressor protein neurofibromin, an inactivator of the Ras oncogene. The hallmarks of NF1 include pigmentary lesions of the skin, Lisch nodules of the iris and cutaneous neurofibromas. Cutaneous neurofibromas are benign tumors composed of all the cell types of normal peripheral nerve. The traditional view of neurofibroma development has been that cutaneous neurofibromas arise from the disruption of the small nerve tributaries of the skin and subsequent proliferation of the resident cells. The second hit mutation in the NF1 gene has been considered as a prerequisite for neurofibroma development. The second hit is detectable in a subpopulation of primary Schwann cells cultured from neurofibromas. This thesis challenges the traditional concept of neurofibroma development. The results show that cutaneous neurofibromas are intimately associated with hair follicular structures and contain multipotent precursor cells (NFPs), suggesting that neurofibromas may arise from the multipotent cells which reside in hair follicles. Furthermore, this study presents that neurofibroma-derived Schwann cells that harbor bi-allelic inactivation in the NF1 gene express HLA class II genes and may act as nonprofessional antigen presenting cells. The CD4- and FoxP3-positive cells detected in cutaneous neurofibromas suggest that these cells may represent regulatory T cells (Tregs) which interact with HLA II –positive cells and aid the tumor cells in hiding from the immune system and are thus mediators of immune tolerance. This thesis also investigated neurofibroma development in the oral cavity and the use of different biomarkers to characterize cellular differentiation in neurofibromas. The results revealed that oral neurofibromas are not rare, but they usually appear as solitary lesions contrary to multiple cutaneous neurofibromas and present high heterogeneity within and between tumors. The use of class III beta-tubulin as a marker for neuronal differentiation led to an unexpected finding showing that multiple cell types express class III beta-tubulin during mitosis. The increased understanding of the multipotency of tumor cells, cellular differentiation and ability to hide from immune system will aid in the development of future treatments. Specifically, targeting Tregs in NF1 patients could provide a novel therapeutic approach to interfere with the development of neurofibromas.

HIDING IN PLAIN SIGHT- Sustainable Physical Activity Program Development and Evaluation for Youth with Special Needs: An Evaluative Case Study

The purpose of my research was to contribute to the improvement and sustainability of the Special Needs Activity Program, and develop program implementation strategies that had practical outcomes. I conducted an evaluative case study of S.N.A.P in order to determine what a quality adapted physical activity (APA) program is, why S.N.A.P is considered a quality APA program, and what institutional policies and practices exist to support it. Data was collected via interviews, questionnaires, and observations. Data analysis involved inductive and deductive methods, and a SWOTAR evaluation. Results indicate that quality APA programs include: ‘people’, ‘environment’, and ‘expectations’; there are benefits of experiential learning; activity stations that promote creativity are valuable; several stakeholders do not know the details about S.N.A.P but recognize its value; the institution values what S.N.A.P provides, yet, there is nothing being done to sustain it. Future research should investigate the feasibility of implementing S.N.A.P in various contexts.

Strategy-proofness makes the difference: deferred-acceptance with responsive priorities

In college admissions and student placements at public schools, the admission decision can be thought of as assigning indivisible objects with capacity constraints to a set of students such that each student receives at most one object and monetary compensations are not allowed. In these important market design problems, the agent-proposing deferred-acceptance (DA-)mechanism with responsive strict priorities performs well and economists have successfully implemented DA-mechanisms or slight variants thereof. We show that almost all real-life mechanisms used in such environments - including the large classes of priority mechanisms and linear programming mechanisms - satisfy a set of simple and intuitive properties. Once we add strategy-proofness to these properties, DA-mechanisms are the only ones surviving. In market design problems that are based on weak priorities (like school choice), generally multiple tie-breaking (MTB)procedures are used and then a mechanism is implemented with the obtained strict priorities. By adding stability with respect to the weak priorities, we establish the first normative foundation for MTB-DA-mechanisms that are used in NYC.

Strategy-proofness and essentially single-valued cores revisited

We consider general allocation problems with indivisibilities where agents' preferences possibly exhibit externalities. In such contexts many different core notions were proposed. One is the gamma-core whereby blocking is only allowed via allocations where the non-blocking agents receive their endowment. We show that if there exists an allocation rule satisfying ‘individual rationality’, ‘efficiency’, and ‘strategy-proofness’, then for any problem for which the gamma-core is non-empty, the allocation rule must choose a gamma-core allocation and all agents are indifferent between all allocations in the gamma-core. We apply our result to housing markets, coalition formation and networks.

Object allocation via deferred-acceptance: strategy-proofness and comparative statics

We study the problem of assigning indivisible and heterogenous objects (e.g., houses, jobs, offices, school or university admissions etc.) to agents. Each agent receives at most one object and monetary compensations are not possible. We consider mechanisms satisfying a set of basic properties (unavailable-type-invariance, individual-rationality, weak non-wastefulness, or truncation-invariance). In the house allocation problem, where at most one copy of each object is available, deferred-acceptance (DA)-mechanisms allocate objects based on exogenously fixed objects' priorities over agents and the agent-proposing deferred-acceptance-algorithm. For house allocation we show that DA-mechanisms are characterized by our basic properties and (i) strategy-proofness and population-monotonicity or (ii) strategy-proofness and resource-monotonicity. Once we allow for multiple identical copies of objects, on the one hand the first characterization breaks down and there are unstable mechanisms satisfying our basic properties and (i) strategy-proofness and population-monotonicity. On the other hand, our basic properties and (ii) strategy-proofness and resource-monotonicity characterize (the most general) class of DA-mechanisms based on objects' fixed choice functions that are acceptant, monotonic, substitutable, and consistent. These choice functions are used by objects to reject agents in the agent-proposing deferred-acceptance-algorithm. Therefore, in the general model resource-monotonicity is the «stronger» comparative statics requirement because it characterizes (together with our basic requirements and strategy-proofness) choice-based DA-mechanisms whereas population-monotonicity (together with our basic properties and strategy-proofness) does not.

Hiding Pictures in MS Word 2010 documents

If scrolling through your Word file is a bit slow due to there being a lot of images in the file, then temporarily turn off the images and show placeholders in their stead. For best viewing Download the video.

Hiding pictures in MS Word 2011 documents

If scrolling through your Word 2011 file is a bit slow due to there being a lot of images in the file, then temporarily turn off the images and show placeholders in the their stead. For best viewing Download the video.

Hiding routing information

This is the original "onion routing" paper, it explains in the details how onions are built and work. This is optional reading, although I strongly advise you to read the Introduction and section 3 "Onions"

ROP Gadgets hiding techniques in Open Source Projects

Today there are many techniques that allows to exploit vulnerabilities of an application; there are also many techniques that are designed to stop these exploit attacks. This thesis wants to highlight how a specific type of attack, based on a technique called Return Oriented Programming (ROP), can be easily applied to binaries with particular characteristics. A new method that allows the injection of "useful" code in an Open Source projects without arousing suspicions is presented; this is possible because of the harmless aspects of the injected code. This useful code facilitate a ROP attack against an executable that contains vulnerable bugs. The injection process can be visualized in environment where an user can contribute with own code to a particular Open Source project. This thesis also highlights how current software protections are not correctly applied to Open Source project, thus enabling the proposed approach.

Concurrent library abstraction without information hiding

The commonly accepted approach to specifying libraries of concurrent algorithms is a library abstraction. Its idea is to relate a library to another one that abstracts away from details of its implementation and is simpler to reason about. A library abstraction relation has to validate the Abstraction Theorem: while proving a property of the client of the concurrent library, the library can be soundly replaced with its abstract implementation. Typically a library abstraction relation, such as linearizability, assumes a complete information hiding between a library and its client, which disallows them to communicate by means of shared memory. However, such way of communication may be used in a program, and correctness of interactions on a shared memory depends on the implicit contract between the library and the client. In this work we approach library abstraction without any assumptions about information hiding. To be able to formulate the contract between components of the program, we augment machine states of the program with two abstract states, views, of the client and the library. It enables formalising the contract with the internal safety, which requires components to preserve each other's views whenever their command is executed. We define the library a a correspondence between possible uses of a concrete and an abstract library. For our library abstraction relation and traces of a program, components of which follow their contract, we prove an Abstraction Theorem. RESUMEN. La técnica más aceptada actualmente para la especificación de librerías de algoritmos concurrentes es la abstracción de librerías (library abstraction). La idea subyacente es relacionar la librería original con otra que abstrae los detalles de implementación y conóon que describa dicha abstracción de librerías debe validar el Teorema de Abstracción: durante la prueba de la validez de una propiedad del cliente de la librería concurrente, el reemplazo de esta última por su implementación abstracta es lógicamente correcto. Usualmente, una relación de abstracción de librerías como la linearizabilidad (linearizability), tiene como premisa el ocultamiento de información entre el cliente y la librería (information hiding), es decir, que no se les permite comunicarse mediante la memoria compartida. Sin embargo, dicha comunicación ocurre en la práctica y la correctitud de estas interacciones en una memoria compartida depende de un contrato implícito entre la librería y el cliente. En este trabajo, se propone un nueva definición del concepto de abtracción de librerías que no presupone un ocultamiento de información entre la librería y el cliente. Con el fin de establecer un contrato entre diferentes componentes de un programa, extendemos la máquina de estados subyacente con dos estados abstractos que representan las vistas del cliente y la librería. Esto permite la formalización de la propiedad de seguridad interna (internal safety), que requiere que cada componente preserva la vista del otro durante la ejecuci on de un comando. Consecuentemente, se define la relación de abstracción de librerías mediante una correspondencia entre los usos posibles de una librería abstracta y una concreta. Finalmente, se prueba el Teorema de Abstracción para la relación de abstracción de librerías propuesta, para cualquier traza de un programa y cualquier componente que satisface los contratos apropiados.

The remnant found; or, The place of Israels̓ hiding discovered. Being a summary of proofs, showing that the Jews of Daghistan of the Caspian Sea are the remnant of the Ten Tribes.: The result of personal investigation during a missionary tour of eight months in Georgia, by permission of the Russian government in the years 1837 and 1838.

With this is bound his An appealon behalf of Jews scattered in India, Persia and Arabia. London, 1840.

Captain Ted; a boy's adventures among hiding slackers in the great Georgia swamp,

Mode of access: Internet.

The open secret: Hiding and revealing sexuality in the roman de moeurs (1880-1905)

Beginning with the sole literary text that does figure at any length in the first volume of Foucault's history--Diderot's Les Bijoux indiscrets, which dates from 1748--Cryle examines some semiotic routines involved in that telling of secrets, and to understand more about scientia sexualis through its literary development. He tries to show that narratives of the time tended to gather the mysterious, the unknown, and the generally inscrutable in the same functional place, holding them close to a thematics of the sexual. And returns to eighteenth-century texts from time to time in order to mark this as a fundamental shift in the literary constitution of sexual knowledge.