Banca en el internet

Los cajeros electrónicos y la implementación de servicios por medio telefónico fueron los primeros instrumentos que hicieron que fuera viable para el usuario beneficiarse de atención sin tener que acudir a las instalaciones de la institución financiera

Laughing in the mechanism : du choix du silence comme élément autobiographique dans le poème ''Agrippa'' de William Gibson (1992)

Le silence est une composante fondamentale de la création artistique, aussi bien dans le domaine musical qu’au cinéma. La notion de silence atteint toutefois un espace limite dans le domaine littéraire, comme le note Gilles Deleuze en évoquant le « silence dans les mots », la « limite asyntaxique » qui n’est pas « extérieure au langage » dans la poésie d’Antonin Artaud ; cette même notion devenant plus problématique encore dans le domaine de l’autobiographie, traditionnellement informative. Nous posons tout d’abord la question de savoir comment l’auteur, se racontant lui-même, sa vie, son parcours, peut choisir de ne donner à lire qu’un silence plus ou moins long, et sembler ainsi renoncer à sa tâche, pour ensuite étudier le poème « Agrippa—A Book of the Dead » (1992) de l’écrivain américain William Gibson (né en 1948). Inspiré par la découverte d’un album de photos appartenant à son père, l’auteur y évoque les souvenirs de son enfance en Virginie. La singularité d’« Agrippa » réside surtout dans les mécanismes mis en oeuvre lors de sa lecture : à l’origine seulement disponible sur disquette, un programme d’ « encryption » ou « bombe logique » efface le texte au fur et à mesure que l’ordinateur le déchiffre, afin de n’être lu qu’une fois seulement, laissant la place au vide, au silence. Nous proposons ici d’étudier le poème « Agrippa » en démontrant comment la disparition progressive du texte a, dans le travail d’écriture de Gibson, une portée originale. L’objectif de l’étude est de montrer que Gibson se sert du poème pour proposer une révolution littéraire où l’art « quitte le cadre », où « le mot écrit quitte la page » de façon concrète et effective pour soumettre au lecteur un questionnement, esthétique, philosophique, voire théologique fécond – Maurice Blanchot arguant que Dieu communique « seulement par son silence ».

ASYM20: a program for force constant and normal coordinate calculations, with a critical review of the theory involved

The theory of harmonic force constant refinement calculations is reviewed, and a general-purpose program for force constant and normal coordinate calculations is described. The program, called ASYM20. is available through Quantum Chemistry Program Exchange. It will work on molecules of any symmetry containing up to 20 atoms and will produce results on a series of isotopomers as desired. The vibrational secular equations are solved in either nonredundant valence internal coordinates or symmetry coordinates. As well as calculating the (harmonic) vibrational wavenumbers and normal coordinates, the program will calculate centrifugal distortion constants, Coriolis zeta constants, harmonic contributions to the α′s. root-mean-square amplitudes of vibration, and other quantities related to gas electron-diffraction studies and thermodynamic properties. The program will work in either a predict mode, in which it calculates results from an input force field, or in a refine mode, in which it refines an input force field by least squares to fit observed data on the quantities mentioned above. Predicate values of the force constants may be included in the data set for a least-squares refinement. The program is written in FORTRAN for use on a PC or a mainframe computer. Operation is mainly controlled by steering indices in the input data file, but some interactive control is also implemented.

Coargumenthood and the processing of reflexives

We report three eye-movement experiments and an antecedent choice task investigating the interpretation of reflexives in different syntactic contexts. This included contexts in which the reflexive and a local antecedent were coarguments of the same verbal predicate (John heard that the soldier had injured himself), and also so-called picture noun phrases, either with a possessor (John heard about the soldier’s picture of himself) or without (John heard that the soldier had a picture of himself). While results from the antecedent choice task indicated that comprehenders would choose a nonlocal antecedent (‘John’ above) for reflexives in either type of picture noun phrase, the eye-movement experiments suggested that participants preferred to initially interpret the reflexive in each context as referring to the local antecedent (‘the soldier’), as indexed by longer reading times when it mismatched in gender with the reflexive. We also observed a difference in the time-course of this effect. While it was observed during first-pass processing at the reflexive for coargument reflexives and those in picture noun phrases with a possessor, it was comparatively delayed for reflexives in possessorless picture noun phrases. These results suggest that locality constraints are more strongly weighted cues to retrieval than gender agreement for both coargument reflexives and those inside picture noun phrases. We interpret the observed time-course differences as indexing the relative ease of accessing the local antecedent in different syntactic contexts.

Heaps and Chains: Is the Chaining Argument for parity a sorites?

I argue that the Ruth Chang’s Chaining Argument for her parity view of value incomparability trades illicitly on the vagueness of the predicate ‘is comparable with’. Chang is alert to this danger and argues that the predicate is not vague, but this defense does not succeed. The Chaining Argument also faces a dilemma. The predicate is either vague or precise. If it is vague, then the argument is most plausibly a sorites. If it is precise, then the argument is either question begging or dialectically ineffective. I argue that no chaining-type argument can succeed.

Borderline cases and the collapsing principle

John Broome has argued that value incommensurability is vagueness, by appeal to a controversial ‘collapsing principle’ about comparative indeterminacy. I offer a new counterexample to the collapsing principle. That principle allows us to derive an outright contradiction from the claim that some object is a borderline case of some predicate. But if there are no borderline cases, then the principle is empty. The collapsing principle is either false or empty.

The chaotic frequency hopping signals for MIMO radar

In multiple-input multiple-output (MIMO) radar systems, the transmitters emit orthogonal waveforms to increase the spatial resolution. New frequency hopping (FH) codes based on chaotic sequences are proposed. The chaotic sequences have the characteristics of good encryption, anti-jamming properties and anti-intercept capabilities. The main idea of chaotic FH is based on queuing theory. According to the sensitivity to initial condition, these sequences can achieve good Hamming auto-correlation while also preserving good average correlation. Simulation results show that the proposed FH signals can achieve lower autocorrelation side lobe level and peak cross-correlation level with the increasing of iterations. Compared to the LFM signals, this sequence has higher range-doppler resolution.

Perfective marking in L2 Mandarin: agreement with inherent lexical aspect or the derived Sentential Aspectual class?

This study evaluates the differing claims of the Aspect Hypothesis (Anderson & Shirai 1996) and the Sentential Aspect Hypothesis (Sharma & Deo 2009) for perfective marking by L1 English learners of Mandarin. The AH predicts a narrow focus on inherent lexical aspect (the verb and predicate) in determining the use of the perfective marker le, whilst the SAH suggests that – subject to L1 influence – perfective marking agrees with the final derived aspectual class of the sentence. To test these claims data were collected using a controlled le-insertion task, combined with oral corpus data. The results show that learners’ perfective marking patterns with the sentential aspectual class and not inherent lexical aspect (where these differ), and that overall the sentential aspectual class better predicts learners’ assignment of perfective marking than lexical aspect.

FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ`S ATTRACTOR

A novel cryptography method based on the Lorenz`s attractor chaotic system is presented. The proposed algorithm is secure and fast, making it practical for general use. We introduce the chaotic operation mode, which provides an interaction among the password, message and a chaotic system. It ensures that the algorithm yields a secure codification, even if the nature of the chaotic system is known. The algorithm has been implemented in two versions: one sequential and slow and the other, parallel and fast. Our algorithm assures the integrity of the ciphertext (we know if it has been altered, which is not assured by traditional algorithms) and consequently its authenticity. Numerical experiments are presented, discussed and show the behavior of the method in terms of security and performance. The fast version of the algorithm has a performance comparable to AES, a popular cryptography program used commercially nowadays, but it is more secure, which makes it immediately suitable for general purpose cryptography applications. An internet page has been set up, which enables the readers to test the algorithm and also to try to break into the cipher.

Vikten av säkra nätverk

The purpose of this thesis is to show how to use vulnerability testing to identify and search for security flaws in networks of computers. The goal is partly to give a casual description of different types of methods of vulnerability testing and partly to present the method and results from a vulnerability test. A document containing the results of the vulnerability test will be handed over and a solution to the found high risk vulnerabilities. The goal is also to carry out and present this work as a form of a scholarly work.The problem was to show how to perform vulnerability tests and identify vulnerabilities in the organization's network and systems. Programs would be run under controlled circumstances in a way that they did not burden the network. Vulnerability tests were conducted sequentially, when data from the survey was needed to continue the scan.A survey of the network was done and data in the form of operating system, among other things, were collected in the tables. A number of systems were selected from the tables and were scanned with Nessus. The result was a table across the network and a table of found vulnerabilities. The table of vulnerabilities has helped the organization to prevent these vulnerabilities by updating the affected computers. Also a wireless network with WEP encryption, which is insecure, has been detected and decrypted.

Ne videt, ne znat – det direkta objektets kasus vid två negerade ryska verb

This essay examines the case of the direct object in Russian sentences with the negated verbs не видеть and не знать. For each verb, 50 contexts were downloaded from the newspaper corpus of the Russian National Corpus and analysed with respect to the semantic properties of the direct object and the negated verb. The theories and concepts used for the analysis have been outlined in Padutjeva, 2006. The analysis of не видеть suggests that the main difference between the genitive and the ac-cusative case is to be found in the notion of non-existence or absence implicated by the verb’s semantics. In utterances with не видеть as a predicate, this notion is always present and is expressed by the genitive case. The speaker may also choose to ignore it by using the accusa-tive and thus emphasize some other aspect of the described situation. The examined properties of reference, definiteness and denotative status of the direct object seem to play a secondary role for how case is used. Their influence is to delimit the meaning of the objective genitive to either non-existence or absence. No similar conclusions could be drawn from the examination of не знать. The reason for this is that the concept of private sphere, used by Padutjeva to explain the use of objective geni-tive with this verb, could not be properly established during the analysis. Just as the notion of absence is crucial for the understanding of the objective genitive when it occurs with не видеть, the concept private sphere seems to be the key to understand it when it occurs with не знать.

Searching for Invariants Using Temporal Resolution

In this paper, we show how the clausal temporal resolution technique developed for temporal logic provides an effective method for searching for invariants, and so is suitable for mechanising a wide class of temporal problems. We demonstrate that this scheme of searching for invariants can be also applied to a class of multi-predicate induction problems represented by mutually recursive definitions. Completeness of the approach, examples of the application of the scheme, and overview of the implementation are described.

Soft IP para criptografia usando o algoritmo Rijndael e implementação em lógica programável

A criptografia assumiu papel de destaque no cotidiano das pessoas, em virtude da necessidade de segurança em inúmeras transações eletrônicas. Em determinadas áreas, a utilização de hardware dedicado à tarefa de criptografia apresenta vantagens em relação à implementação em software, devido principalmente ao ganho de desempenho. Recentemente, o National Institute of Standards and Technology (NIST) publicou o novo padrão norte-americano de criptografia simétrica, chamado de Advanced Encryption Standard (AES). Após um período de aproximadamente 3 anos, no qual várias alternativas foram analisadas, adotou-se o algoritmo Rijndael. Assim, este trabalho apresenta um Soft IP do padrão AES, codificado em VHDL, visando a implementação em FPGA Altera. Todo o projeto foi construído com funções e bibliotecas genéricas, a fim de permitir a posterior implementação sobre outras tecnologias. Foram geradas duas versões: uma priorizando desempenho e outra priorizando a área ocupada nos componentes. Para cada uma das versões, produziu-se um circuito para encriptar e outro para decriptar. O desempenho alcançado em termos de velocidade de processamento superou todos os outros trabalhos publicados na área, sobre a mesma tecnologia. São apresentados os detalhes de implementação, arquiteturas envolvidas e decisões de projeto, bem como todos os resultados. A dissertação contém ainda conceitos básicos de criptografia e uma descrição do algoritmo Rijndael.

Implementação e análise de desempenho dos protocolos de criptografia neural e Diffie-Hellman em sistemas RFID utilizando uma plataforma embarcada

RFID (Radio Frequency Identification) identifies object by using the radio frequency which is a non-contact automatic identification technique. This technology has shown its powerful practical value and potential in the field of manufacturing, retailing, logistics and hospital automation. Unfortunately, the key problem that impacts the application of RFID system is the security of the information. Recently, researchers have demonstrated solutions to security threats in RFID technology. Among these solutions are several key management protocols. This master dissertations presents a performance evaluation of Neural Cryptography and Diffie-Hellman protocols in RFID systems. For this, we measure the processing time inherent in these protocols. The tests was developed on FPGA (Field-Programmable Gate Array) platform with Nios IIr embedded processor. The research methodology is based on the aggregation of knowledge to development of new RFID systems through a comparative analysis between these two protocols. The main contributions of this work are: performance evaluation of protocols (Diffie-Hellman encryption and Neural) on embedded platform and a survey on RFID security threats. According to the results the Diffie-Hellman key agreement protocol is more suitable for RFID systems