RDA et RCAA2 : un survol des différences entre les deux codes

Communication présentée au Premier Congrès des milieux documentaires du Québec le 12 novembre 2009, Palais des congrès de Montréal. Comprend une annexe comportant un exemple d'élément RDA, des exemples de notices RCAA2 et RDA en MARC 21 ainsi qu'une bibliographie.

Codes de conduite et droit d'association : une étude exploratoire du secteur du textile

Avec la globalisation de l’économie, l’entreprise traditionnelle est devenue un réseau global de producteurs liés par des contrats. À la suite de certains abus commis par les entreprises multinationales, notamment en ce qui concerne les droits fondamentaux des travailleurs, les entreprises et la société civile ont développé des mécanismes de régulation privés dont les codes de conduite privés. La présente étude cherche à déterminer quels pouvaient être les véritables destinataires des codes de conduite : les travailleurs du pays d’origine de l’entreprise (généralement situés dans un pays développé) ou les travailleurs des pays de production (généralement situés dans des pays en développement). À cette fin, le mémoire compare le contenu des codes de conduite de Nike, de Gap et de Levi-Strauss sur ce sujet avec les observations de l’Organisation internationale du travail pour les travailleurs des États-Unis, de l’Inde et du Bangladesh. Certains écarts entre les protections accordées par les codes et les besoins des travailleurs sont ainsi identifiés. Dans la dernière partie du mémoire, la question d’étude est élargie afin d’examiner si les codes ne seraient pas destinés à des personnes autres que les travailleurs, soient les consommateurs, les actionnaires ou l’entreprise elle-même.

Algebraic Geometric Codes and their relation to Cryptography using Elliptic Curves

Communication is the process of transmitting data across channel. Whenever data is transmitted across a channel, errors are likely to occur. Coding theory is a stream of science that deals with finding efficient ways to encode and decode data, so that any likely errors can be detected and corrected. There are many methods to achieve coding and decoding. One among them is Algebraic Geometric Codes that can be constructed from curves. Cryptography is the science ol‘ security of transmitting messages from a sender to a receiver. The objective is to encrypt message in such a way that an eavesdropper would not be able to read it. A eryptosystem is a set of algorithms for encrypting and decrypting for the purpose of the process of encryption and decryption. Public key eryptosystem such as RSA and DSS are traditionally being prel‘en‘ec| for the purpose of secure communication through the channel. llowever Elliptic Curve eryptosystem have become a viable altemative since they provide greater security and also because of their usage of key of smaller length compared to other existing crypto systems. Elliptic curve cryptography is based on group of points on an elliptic curve over a finite field. This thesis deals with Algebraic Geometric codes and their relation to Cryptography using elliptic curves. Here Goppa codes are used and the curves used are elliptic curve over a finite field. We are relating Algebraic Geometric code to Cryptography by developing a cryptographic algorithm, which includes the process of encryption and decryption of messages. We are making use of fundamental properties of Elliptic curve cryptography for generating the algorithm and is used here to relate both.

Learning Linear, Sparse, Factorial Codes

In previous work (Olshausen & Field 1996), an algorithm was described for learning linear sparse codes which, when trained on natural images, produces a set of basis functions that are spatially localized, oriented, and bandpass (i.e., wavelet-like). This note shows how the algorithm may be interpreted within a maximum-likelihood framework. Several useful insights emerge from this connection: it makes explicit the relation to statistical independence (i.e., factorial coding), it shows a formal relationship to the algorithm of Bell and Sejnowski (1995), and it suggests how to adapt parameters that were previously fixed.

GROUP SD COLLECTION ZIP

The collection of items for Group SD's coursework assignment.

e-Research Methods Theme 1 Introduction ZIP

Source files for theme 1

e-Research Methods Theme 2 Getting Started... ZIP

Source files for theme 2

e-Research Methods Theme 3 Literature Review ZIP

Source files for theme 3

e-Research Methods Theme 4 Choosing Your Research Topic ZIP

Source files for theme 4

e-Research Methods Theme 5 Project Management ZIP

Source files for theme 5

e-Research Methods Theme 6 Collecting Data ZIP

Source files for theme 6

e-Research Methods Theme 7 Data Analysis ZIP

Source files for theme 7

e-Research Methods Theme 8 Writing Research Proposal ZIP

Source files for theme 8

E-Research Methods Zip files

Download these if you want to run your own, modufued version of erm