cryptanalysis of some signature schemes with message recovery

IEEE Computer Society

message from the workshop chairs the first international workshop on program debugging in china (iwpdc 2010)

National Laboratory for Parallel and Distributed Processing; The University of Hong Kong

Message-Driven Processor Architecture: Verson 11

The Message-Driven Processor is a node of a large-scale multiprocessor being developed by the Concurrent VLSI Architecture Group. It is intended to support fine-grained, message passing, parallel computation. It contains several novel architectural features, such as a low-latency network interface, extensive type-checking hardware, and on-chip memory that can be used as an associative lookup table. This document is a programmer's guide to the MDP. It describes the processor's register architecture, instruction set, and the data types supported by the processor. It also details the MDP's message sending and exception handling facilities.

JUSTEIS: JISC Usage Surveys: Trends in Electronic Information Services Final report 2003/2004 Cycle Five

Urquhart, C., Spink, S., Thomas, R., Yeoman, A., Durbin, J., Turner, J., Fenton, R. & Armstrong, C. (2004). JUSTEIS: JISC Usage Surveys: Trends in Electronic Information Services Final report 2003/2004 Cycle Five. Aberystwyth: Department of Information Studies, University of Wales Aberystwyth. Sponsorship: JISC

Whose News? Copyright and the Dissemination of News on the Internet

International Review of Law, Computers & Technology, Volume 17, Issue 2 July 2003 , pages 163 - 174 RAE2008

?Minorities with a Message?: The Beveridge Report on Broadcasting (1949?1951) and Wales

Medhurst, J. (2008). 'Minorities with a Message': the Beveridge Report on Broadcasting (1949-51) and Wales. Twentieth Century British History. 19(2), pp.217-233. RAE2008

Japanese women speak : a message from the Christian women of Japan to the Christian women of America / by Michi Kawai, Ochimi Kubushiro ; cover design and frontispiece by the Japanese artist Rokuyåo.

http://www.archive.org/details/japanesewomenspe032256mbp

Demand-based Document Dissemination for the World-Wide Web

We analyzed the logs of our departmental HTTP server http://cs-www.bu.edu as well as the logs of the more popular Rolling Stones HTTP server http://www.stones.com. These servers have very different purposes; the former caters primarily to local clients, whereas the latter caters exclusively to remote clients all over the world. In both cases, our analysis showed that remote HTTP accesses were confined to a very small subset of documents. Using a validated analytical model of server popularity and file access profiles, we show that by disseminating the most popular documents on servers (proxies) closer to the clients, network traffic could be reduced considerably, while server loads are balanced. We argue that this process could be generalized so as to provide for an automated demand-based duplication of documents. We believe that such server-based information dissemination protocols will be more effective at reducing both network bandwidth and document retrieval times than client-based caching protocols [2].

The Mycobacterium tuberculosis HBHA, role in extrapulmonary dissemination and immunity in mice and man

info:eu-repo/semantics/nonPublished

Heparin-binding hemagglutinin, from an extrapulmonary dissemination factor to a powerful diagnostic and protective antigen against tuberculosis.

Interactions of Mycobacterium tuberculosis with macrophages have long been recognized to be crucial to the pathogenesis of tuberculosis. The role of non-phagocytic cells is less well known. We have discovered a M. tuberculosis surface protein that interacts specifically with non-phagocytic cells, expresses hemagglutination activity and binds to sulfated glycoconjugates. It is therefore called heparin-binding hemagglutinin (HBHA). HBHA-deficient M. tuberculosis mutant strains are significantly impaired in their ability to disseminate from the lungs to other tissues, suggesting that the interaction with non-phagocytic cells, such as pulmonary epithelial cells, may play an important role in the extrapulmonary dissemination of the tubercle bacillus, one of the key steps that may lead to latency. Latently infected human individuals mount a strong T cell response to HBHA, whereas patients with active disease do not, suggesting that HBHA is a good marker for the immunodiagnosis of latent tuberculosis, and that HBHA-specific Th1 responses may contribute to protective immunity against active tuberculosis. Strong HBHA-mediated immuno-protection was shown in mouse challenge models. HBHA is a methylated protein and its antigenicity in latently infected subjects, as well as its protective immunogenicity strongly depends on the methylation pattern of HBHA. In both mice and man, the HBHA-specific IFN-gamma was produced by both the CD4(+) and the CD8(+) T cells. Furthermore, the HBHA-specific CD8(+) T cells expressed bactericidal and cytotoxic activities to mycobacteria-infected macrophages. This latter activity is most likely perforin mediated. Together, these observations strongly support the potential of methylated HBHA as an important component in future, acellular vaccines against tuberculosis.

Automatic parallel code generation for message passing on distributed memory systems

The availability of a very accurate dependence graph for a scalar code is the basis for the automatic generation of an efficient parallel implementation. The strategy for this task which is encapsulated in a comprehensive data partitioning code generation algorithm is described. This algorithm involves the data partition, calculation of assignment ranges for partitioned arrays, addition of a comprehensive set of execution control masks, altering loop limits, addition and optimisation of communications for all data. In this context, the development and implementation of strategies to merge communications wherever possible has proved an important feature in producing efficient parallel implementations for numerical mesh based codes. The code generation strategies described here are embedded within the Computer Aided Parallelisation tools (CAPTools) software as a key part of a toolkit for automating as much as possible of the parallelisation process for mesh based numerical codes. The algorithms used enables parallelisation of real computational mechanics codes with only minor user interaction and without any prior manual customisation of the serial code to suit the parallelisation tool.

CAPLib - A 'thin layer' message passing library to support computational mechanics codes on distributed memory parallel systems

The Computer Aided Parallelisation Tools (CAPTools) [Ierotheou, C, Johnson SP, Cross M, Leggett PF, Computer aided parallelisation tools (CAPTools)-conceptual overview and performance on the parallelisation of structured mesh codes, Parallel Computing, 1996;22:163±195] is a set of interactive tools aimed to provide automatic parallelisation of serial FORTRAN Computational Mechanics (CM) programs. CAPTools analyses the user's serial code and then through stages of array partitioning, mask and communication calculation, generates parallel SPMD (Single Program Multiple Data) messages passing FORTRAN. The parallel code generated by CAPTools contains calls to a collection of routines that form the CAPTools communications Library (CAPLib). The library provides a portable layer and user friendly abstraction over the underlying parallel environment. CAPLib contains optimised message passing routines for data exchange between parallel processes and other utility routines for parallel execution control, initialisation and debugging. By compiling and linking with different implementations of the library, the user is able to run on many different parallel environments. Even with today's parallel systems the concept of a single version of a parallel application code is more of an aspiration than a reality. However for CM codes the data partitioning SPMD paradigm requires a relatively small set of message-passing communication calls. This set can be implemented as an intermediate `thin layer' library of message-passing calls that enables the parallel code (especially that generated automatically by a parallelisation tool such as CAPTools) to be as generic as possible. CAPLib is just such a `thin layer' message passing library that supports parallel CM codes, by mapping generic calls onto machine specific libraries (such as CRAY SHMEM) and portable general purpose libraries (such as PVM an MPI). This paper describe CAPLib together with its three perceived advantages over other routes: - as a high level abstraction, it is both easy to understand (especially when generated automatically by tools) and to implement by hand, for the CM community (who are not generally parallel computing specialists); - the one parallel version of the application code is truly generic and portable; - the parallel application can readily utilise whatever message passing libraries on a given machine yield optimum performance.