4,315 research outputs found
Midcourse maneuver operations program
Midcourse Maneuver Operations Program /MMOP/ computes the required velocity change to correct a spacecraft trajectory. The program establishes the existence of maneuvers which satisfy spacecraft constraints, explores alternate trajectories in the event that some out-of-tolerance condition forces a change in plans, and codes the maneuvers into commands
Agrarian Commonwealth or Entrepôt of the Orient? Competing Conceptions of Canada and the BC Terms of Union Debate of 1871
Much of the historiography of British Columbia’s 1871 entry into Confederation has concentrated on the motives of British Columbians in seeking union with Canada. This article examines the discussion of the province’s Terms of Union in the Canadian parliament and in the eastern Canadian press, and recasts the debate as a conflict between two competing visions of Canada’s economic future. Proponents of the admission of British Columbia believed access to the Pacific would transform the new Dominion into a commercial superpower. Opponents of the Terms looked upon distant, mountainous, and sparsely populated British Columbia as a liability, a region and a community that, unlike the Prairie West, could never conform to the agrarian ideal that underpinned their conception of Canada. A reconsideration of the Terms of Union debate in eastern Canada suggests a broader conception of what constitutes Canada’s founding debates, and supports the work of other scholars who have identified an agrarian-commercial cleavage as a defining feature of nineteenth-century Canadian politics.Une grande partie de l’historiographie sur l’entrée de la Colombie-Britannique au sein de la Confédération en 1871 porte sur les motifs qui ont guidé la population de la Colombie-Britannique à vouloir s’unir au Canada. Cet article traite du débat entourant les conditions d’adhésion de la province, qui a eu lieu au Parlement du Canada et dans la presse canadienne de l’Est. Il reformule la question et la présente comme un conflit entre deux visions contradictoires de l’avenir économique du Canada. Les partisans de l’adhésion de la Colombie-Britannique croient que l’accès au Pacifique transformerait le nouveau dominion en une superpuissance commerciale. Quant aux opposants, ils voient cette Colombie-Britannique éloignée, montagneuse et peu densément peuplée comme un boulet, une région et une collectivité qui, contrairement à la Prairie de l’Ouest, ne pourront jamais se conformer à l’idéal agraire que sous-tend leur conception du Canada. Un nouvel examen du débat sur les conditions d’adhésion qui ont eu lieu dans l’Est du Canada mène à une conception élargie de ce que sont les débats fondateurs du Canada. Cette vision rencontre les travaux d’autres chercheurs qui confèrent à la division agraire-commerciale un rôle déterminant de la politique canadienne du XIXe siecle
The novel adaptor protein Tks4 (SH3PXD2B) is required for functional podosome formation.
Metastatic cancer cells have the ability to both degrade and migrate through the extracellular matrix (ECM). Invasiveness can be correlated with the presence of dynamic actin-rich membrane structures called podosomes or invadopodia. We showed previously that the adaptor protein tyrosine kinase substrate with five Src homology 3 domains (Tks5)/Fish is required for podosome/invadopodia formation, degradation of ECM, and cancer cell invasion in vivo and in vitro. Here, we describe Tks4, a novel protein that is closely related to Tks5. This protein contains an amino-terminal Phox homology domain, four SH3 domains, and several proline-rich motifs. In Src-transformed fibroblasts, Tks4 is tyrosine phosphorylated and predominantly localized to rosettes of podosomes. We used both short hairpin RNA knockdown and mouse embryo fibroblasts lacking Tks4 to investigate its role in podosome formation. We found that lack of Tks4 resulted in incomplete podosome formation and inhibited ECM degradation. Both phenotypes were rescued by reintroduction of Tks4, whereas only podosome formation, but not ECM degradation, was rescued by overexpression of Tks5. The tyrosine phosphorylation sites of Tks4 were required for efficient rescue. Furthermore, in the absence of Tks4, membrane type-1 matrix metalloproteinase (MT1-MMP) was not recruited to the incomplete podosomes. These findings suggest that Tks4 and Tks5 have overlapping, but not identical, functions, and implicate Tks4 in MT1-MMP recruitment and ECM degradation.Peer reviewe
Non-malleable encryption: simpler, shorter, stronger
In a seminal paper, Dolev et al. [15] introduced the notion of non-malleable encryption (NM-CPA). This notion is very intriguing since it suffices for many applications of chosen-ciphertext secure encryption (IND-CCA), and, yet, can be generically built from semantically secure (IND-CPA) encryption, as was shown in the seminal works by Pass et al. [29] and by Choi et al. [9], the latter of which provided a black-box construction. In this paper we investigate three questions related to NM-CPA security: 1. Can the rate of the construction by Choi et al. of NM-CPA from IND-CPA be improved? 2. Is it possible to achieve multi-bit NM-CPA security more efficiently from a single-bit NM-CPA scheme than from IND-CPA? 3. Is there a notion stronger than NM-CPA that has natural applications and can be achieved from IND-CPA security? We answer all three questions in the positive. First, we improve the rate in the scheme of Choi et al. by a factor O(λ), where λ is the security parameter. Still, encrypting a message of size O(λ) would require ciphertext and keys of size O(λ2) times that of the IND-CPA scheme, even in our improved scheme. Therefore, we show a more efficient domain extension technique for building a λ-bit NM-CPA scheme from a single-bit NM-CPA scheme with keys and ciphertext of size O(λ) times that of the NM-CPA one-bit scheme. To achieve our goal, we define and construct a novel type of continuous non-malleable code (NMC), called secret-state NMC, as we show that standard continuous NMCs are not enough for the natural “encode-then-encrypt-bit-by-bit” approach to work. Finally, we introduce a new security notion for public-key encryption that we dub non-malleability under (chosen-ciphertext) self-destruct attacks (NM-SDA). After showing that NM-SDA is a strict strengthening of NM-CPA and allows for more applications, we nevertheless show that both of our results—(faster) construction from IND-CPA and domain extension from one-bit scheme—also hold for our stronger NM-SDA security. In particular, the notions of IND-CPA, NM-CPA, and NM-SDA security are all equivalent, lying (plausibly, strictly?) below IND-CCA securit
Secret-Sharing for NP
A computational secret-sharing scheme is a method that enables a dealer, that
has a secret, to distribute this secret among a set of parties such that a
"qualified" subset of parties can efficiently reconstruct the secret while any
"unqualified" subset of parties cannot efficiently learn anything about the
secret. The collection of "qualified" subsets is defined by a Boolean function.
It has been a major open problem to understand which (monotone) functions can
be realized by a computational secret-sharing schemes. Yao suggested a method
for secret-sharing for any function that has a polynomial-size monotone circuit
(a class which is strictly smaller than the class of monotone functions in P).
Around 1990 Rudich raised the possibility of obtaining secret-sharing for all
monotone functions in NP: In order to reconstruct the secret a set of parties
must be "qualified" and provide a witness attesting to this fact.
Recently, Garg et al. (STOC 2013) put forward the concept of witness
encryption, where the goal is to encrypt a message relative to a statement "x
in L" for a language L in NP such that anyone holding a witness to the
statement can decrypt the message, however, if x is not in L, then it is
computationally hard to decrypt. Garg et al. showed how to construct several
cryptographic primitives from witness encryption and gave a candidate
construction.
One can show that computational secret-sharing implies witness encryption for
the same language. Our main result is the converse: we give a construction of a
computational secret-sharing scheme for any monotone function in NP assuming
witness encryption for NP and one-way functions. As a consequence we get a
completeness theorem for secret-sharing: computational secret-sharing scheme
for any single monotone NP-complete function implies a computational
secret-sharing scheme for every monotone function in NP
The novel adaptor protein Tks4 (SH3PXD2B) is required for functional podosome formation.
Metastatic cancer cells have the ability to both degrade and migrate through the extracellular matrix (ECM). Invasiveness can be correlated with the presence of dynamic actin-rich membrane structures called podosomes or invadopodia. We showed previously that the adaptor protein tyrosine kinase substrate with five Src homology 3 domains (Tks5)/Fish is required for podosome/invadopodia formation, degradation of ECM, and cancer cell invasion in vivo and in vitro. Here, we describe Tks4, a novel protein that is closely related to Tks5. This protein contains an amino-terminal Phox homology domain, four SH3 domains, and several proline-rich motifs. In Src-transformed fibroblasts, Tks4 is tyrosine phosphorylated and predominantly localized to rosettes of podosomes. We used both short hairpin RNA knockdown and mouse embryo fibroblasts lacking Tks4 to investigate its role in podosome formation. We found that lack of Tks4 resulted in incomplete podosome formation and inhibited ECM degradation. Both phenotypes were rescued by reintroduction of Tks4, whereas only podosome formation, but not ECM degradation, was rescued by overexpression of Tks5. The tyrosine phosphorylation sites of Tks4 were required for efficient rescue. Furthermore, in the absence of Tks4, membrane type-1 matrix metalloproteinase (MT1-MMP) was not recruited to the incomplete podosomes. These findings suggest that Tks4 and Tks5 have overlapping, but not identical, functions, and implicate Tks4 in MT1-MMP recruitment and ECM degradation.Peer reviewe
Recommended from our members
Brief behavioural activation for adolescent depression: working with complexity and risk
Given the long-term negative outcomes associated with depression in adolescence, there is a pressing need to develop brief, evidence based treatments that are accessible to more young people experiencing low mood. Behavioural Activation (BA) is an effective treatment for adult depression, however little research has focused on the use of BA with depressed adolescents, particularly with briefer forms of BA. In this article we outline an adaptation of brief Behavioral Activation Treatment of Depression (BATD) designed for adolescents and delivered in eight sessions (Brief BA). This case example illustrates how a structured, brief intervention was useful for a depressed young person with a number of complicating and risk factors
Revisiting Deniability in Quantum Key Exchange via Covert Communication and Entanglement Distillation
We revisit the notion of deniability in quantum key exchange (QKE), a topic
that remains largely unexplored. In the only work on this subject by Donald
Beaver, it is argued that QKE is not necessarily deniable due to an
eavesdropping attack that limits key equivocation. We provide more insight into
the nature of this attack and how it extends to other constructions such as QKE
obtained from uncloneable encryption. We then adopt the framework for quantum
authenticated key exchange, developed by Mosca et al., and extend it to
introduce the notion of coercer-deniable QKE, formalized in terms of the
indistinguishability of real and fake coercer views. Next, we apply results
from a recent work by Arrazola and Scarani on covert quantum communication to
establish a connection between covert QKE and deniability. We propose DC-QKE, a
simple deniable covert QKE protocol, and prove its deniability via a reduction
to the security of covert QKE. Finally, we consider how entanglement
distillation can be used to enable information-theoretically deniable protocols
for QKE and tasks beyond key exchange.Comment: 16 pages, published in the proceedings of NordSec 201
Implementation of routine outcome measurement in child and adolescent mental health services in the United Kingdom: a critical perspective
The aim of this commentary is to provide an overview of clinical outcome measures that are currently recommended for use in UK Child and Adolescent Mental Health Services (CAMHS), focusing on measures that are applicable across a wide range of conditions with established validity and reliability, or innovative in their design. We also provide an overview of the barriers and drivers to the use of Routine Outcome Measurement (ROM) in clinical practice
A glimpse into the differential topology and geometry of optimal transport
This note exposes the differential topology and geometry underlying some of
the basic phenomena of optimal transportation. It surveys basic questions
concerning Monge maps and Kantorovich measures: existence and regularity of the
former, uniqueness of the latter, and estimates for the dimension of its
support, as well as the associated linear programming duality. It shows the
answers to these questions concern the differential geometry and topology of
the chosen transportation cost. It also establishes new connections --- some
heuristic and others rigorous --- based on the properties of the
cross-difference of this cost, and its Taylor expansion at the diagonal.Comment: 27 page
- …
