Message from the President of the United State

UANL

Explaining the Great Divergence: Medium and Message on the Eurasian Land Mass, 1700-1850

Between 1700 and 1850, per-capita income doubled in Europe while falling in the rest of Eurasia. Neither geography nor economic institutions can explain this sudden divergence. Here the consequences of differences in communications technology are examined. For the first time, there appeared in Europe a combination of a standardized medium (national vernaculars with a phonetic alphabet) and a non-standardized message (competing religious, political and scientific ideas). The result was an unprecedented fall in the cost of combining ideas and burst of productivity-raising innovation. Elsewhere, decreasing standardization of the medium and increasing standardization of the message blocked innovation.

Report of the Secretary of War: being part of the message and documents communicated to two houses of Congress at the beginning of the secondd session of the forty-sixth Congress.

UANL

Message from the President of the United States to the two Houses of Congress: at the commencement of the first session of the Thirty-ninth Congress, with the reports of the heads of departments and selections from accompanying documents

UANL

Interactive quantum information theory

La théorie de l'information quantique s'est développée à une vitesse fulgurante au cours des vingt dernières années, avec des analogues et extensions des théorèmes de codage de source et de codage sur canal bruité pour la communication unidirectionnelle. Pour la communication interactive, un analogue quantique de la complexité de la communication a été développé, pour lequel les protocoles quantiques peuvent performer exponentiellement mieux que les meilleurs protocoles classiques pour certaines tâches classiques. Cependant, l'information quantique est beaucoup plus sensible au bruit que l'information classique. Il est donc impératif d'utiliser les ressources quantiques à leur plein potentiel. Dans cette thèse, nous étudions les protocoles quantiques interactifs du point de vue de la théorie de l'information et étudions les analogues du codage de source et du codage sur canal bruité. Le cadre considéré est celui de la complexité de la communication: Alice et Bob veulent faire un calcul quantique biparti tout en minimisant la quantité de communication échangée, sans égard au coût des calculs locaux. Nos résultats sont séparés en trois chapitres distincts, qui sont organisés de sorte à ce que chacun puisse être lu indépendamment. Étant donné le rôle central qu'elle occupe dans le contexte de la compression interactive, un chapitre est dédié à l'étude de la tâche de la redistribution d'état quantique. Nous prouvons des bornes inférieures sur les coûts de communication nécessaires dans un contexte interactif. Nous prouvons également des bornes atteignables avec un seul message, dans un contexte d'usage unique. Dans un chapitre subséquent, nous définissons une nouvelle notion de complexité de l'information quantique. Celle-ci caractérise la quantité d'information, plutôt que de communication, qu'Alice et Bob doivent échanger pour calculer une tâche bipartie. Nous prouvons beaucoup de propriétés structurelles pour cette quantité, et nous lui donnons une interprétation opérationnelle en tant que complexité de la communication quantique amortie. Dans le cas particulier d'entrées classiques, nous donnons une autre caractérisation permettant de quantifier le coût encouru par un protocole quantique qui oublie de l'information classique. Deux applications sont présentées: le premier résultat général de somme directe pour la complexité de la communication quantique à plus d'une ronde, ainsi qu'une borne optimale, à un terme polylogarithmique près, pour la complexité de la communication quantique avec un nombre de rondes limité pour la fonction « ensembles disjoints ». Dans un chapitre final, nous initions l'étude de la capacité interactive quantique pour les canaux bruités. Étant donné que les techniques pour distribuer de l'intrication sont bien étudiées, nous nous concentrons sur un modèle avec intrication préalable parfaite et communication classique bruitée. Nous démontrons que dans le cadre plus ardu des erreurs adversarielles, nous pouvons tolérer un taux d'erreur maximal de une demie moins epsilon, avec epsilon plus grand que zéro arbitrairement petit, et ce avec un taux de communication positif. Il s'ensuit que les canaux avec bruit aléatoire ayant une capacité positive pour la transmission unidirectionnelle ont une capacité positive pour la communication interactive quantique. Nous concluons avec une discussion de nos résultats et des directions futures pour ce programme de recherche sur une théorie de l'information quantique interactive.

Comparison of Electromagnetic Band Gap and Split-Ring Resonator Microstrip Lines as Stop Band Structures

In this paper, microstrip lines magnetically coupled to splitring resonators (SRRs) are conquved to electromagnetic bundgup (EBG) nr,rrostrip lines in terns q/ their stop-heard penjbrnmrnce and dimensions. In bath types o/ trunsmis•siou lines, signal propagation is inhibited in it certain jequency bwuL For EBG microstrip lines, the central frequency of such a forbidden band is determined by the period of the structure, whereas in SRR-hased microstrip lines the position of the frequency gap depends on the quasi-static resonant frequency of the rings. The main relevant conrributiun of this paper is to provide a tuning procedure to control the gap width in SRR microstrip lines, and to show that by using SRRs, device dimensions ale much smaller than those required by EBGs in order to obtain similar stop-banal performance. This has been demonstrated by fill-wave electromagnetic simulations and experimentally verified from the characterization ql two fabricated microstrip lines: one with rectangular SRRs etched on the upper substrate side, and the other with a periodic perturbation cf'strip width. For similar rejection and 1-(;H,. gap width centered at 4.5 Gllz, it has been found that the SRR microstrip line is•,fve times shorter. In addition, no ripple is appreciable in the allowed band for the .SRR-hared structure, whereas due to dispersion, certain mismatch is expected in the EBG prototype. Due to the high-frequency selectivity, controllable gap width, and small dimensions, it is believed that SRR coupled to planar transmission lines can have an actual impact on the design of stop-band filters compatible with planar technology, and can be an alternative to present solutions based on distributed approaches or EBG

Use of Novel Algorithms MAJE4 and MACJER-320 for Achieving Confidentiality and Message Authentication in SSL & TLS

Extensive use of the Internet coupled with the marvelous growth in e-commerce and m-commerce has created a huge demand for information security. The Secure Socket Layer (SSL) protocol is the most widely used security protocol in the Internet which meets this demand. It provides protection against eaves droppings, tampering and forgery. The cryptographic algorithms RC4 and HMAC have been in use for achieving security services like confidentiality and authentication in the SSL. But recent attacks against RC4 and HMAC have raised questions in the confidence on these algorithms. Hence two novel cryptographic algorithms MAJE4 and MACJER-320 have been proposed as substitutes for them. The focus of this work is to demonstrate the performance of these new algorithms and suggest them as dependable alternatives to satisfy the need of security services in SSL. The performance evaluation has been done by using practical implementation method.

Use of Novel Algorithms MAJE4 and MACJER-320 for Achieving Confidentiality and Message Authentication in SSL & TLS.

Extensive use of the Internet coupled with the marvelous growth in e-commerce and m-commerce has created a huge demand for information security. The Secure Socket Layer (SSL) protocol is the most widely used security protocol in the Internet which meets this demand. It provides protection against eaves droppings, tampering and forgery. The cryptographic algorithms RC4 and HMAC have been in use for achieving security services like confidentiality and authentication in the SSL. But recent attacks against RC4 and HMAC have raised questions in the confidence on these algorithms. Hence two novel cryptographic algorithms MAJE4 and MACJER-320 have been proposed as substitutes for them. The focus of this work is to demonstrate the performance of these new algorithms and suggest them as dependable alternatives to satisfy the need of security services in SSL. The performance evaluation has been done by using practical implementation method.

Message Integrity in the World Wide Web: Use of Nested Hash Function and a Fast Stream Cipher

The focus of this work is to provide authentication and confidentiality of messages in a swift and cost effective manner to suit the fast growing Internet applications. A nested hash function with lower computational and storage demands is designed with a view to providing authentication as also to encrypt the message as well as the hash code using a fast stream cipher MAJE4 with a variable key size of 128-bit or 256-bit for achieving confidentiality. Both nested Hash function and MAJE4 stream cipher algorithm use primitive computational operators commonly found in microprocessors; this makes the method simple and fast to implement both in hardware and software. Since the memory requirement is less, it can be used for handheld devices for security purposes.

Design of an Edge -coupled dual -ring Split-ring resonator

Electric permittivity and magnetic permeability control electromagnetic wave propagation th rough materials. I n naturally occu rring materials, these are positive. Artificial materials exhi b iting negative material properties have been reported : they are referred to as metamaterials. This paper concentrates on a ring-type split-ring resonator (SRR) exhibiting negative magnetic permeability. The design and synthesis of the SRR using the genetic-algorithm approach is explained in detail. A user-friendly g raphical user i nterface (G U I ) for an SRR optim izer and estimator using MATLAB TM is also presented

The Media is the Message?!

Diese Arbeit beschäftigt sich mit der grafischen Gestaltung von Mathematiklehrwerken und der damit verbundenen Wirkungen auf die SchülerInnen. Es wurde untersucht, welche Art von Gestaltungsaspekten in Schulbüchern eine positive Auswirkung auf die Lernmotivation hat. Im theoretischen Teil dieser Arbeit wird zunächst erläutert, wie der menschliche Wahrnehmungsapparat nach theoretischen Erkenntnissen aus der Wahrnehmungspsychologie visuelle Elemente wie Farbe und Form verarbeitet. Anhand gestaltpsychologischer und motivationspsychologischer Theorien werden mögliche Einflüsse und in diesem Zusammenhang bedeutungsvolle Aspekte aufgezeigt. Einzelne Funktionen und Wirkungsaspekte der einzelnen Medienbausteine wie Bild, Typografie und Bild-Text-Kombinationen werden anhand von Beispielen aus Mathematiklehrwerken dargestellt. Ein Exkurs über den vermehrten Einfluss der neuen Medien bei Kindern und Jugendlichen verdeutlicht, welche visuellen Medienerfahrungen Kinder und Jugendliche bei der Betrachtung eines Schulbuches mitbringen. Anschließend werden die erarbeiteten theoretischen Grundlagen in einer praktischen Arbeit genutzt. Eine exemplarisch ausgewählte Seite eines Mathematiklehrwerks werde unter verschiedenen gestalterischen Gesichtspunkten umgestaltet, so dass mehreren Varianten entstehen. Diese Entwürfe werden in einer qualitativen Studie mit einzelnen SchülerInnen diskutiert. Die Ergebnisse der aufgezeichneten Interviews wurden durch die Auswertungsmethode des zirkulären Dekonstruierens auf die aufgeworfenen Forschungsfragen untersucht und ausgewertet.

A Concurrent Smalltalk Compiler for the Message-Driven Processor

This thesis describes Optimist, an optimizing compiler for the Concurrent Smalltalk language developed by the Concurrent VLSI Architecture Group. Optimist compiles Concurrent Smalltalk to the assembly language of the Message-Driven Processor (MDP). The compiler includes numerous optimization techniques such as dead code elimination, dataflow analysis, constant folding, move elimination, concurrency analysis, duplicate code merging, tail forwarding, use of register variables, as well as various MDP-specific optimizations in the code generator. The MDP presents some unique challenges and opportunities for compilation. Due to the MDP's small memory size, it is critical that the size of the generated code be as small as possible. The MDP is an inherently concurrent processor with efficient mechanisms for sending and receiving messages; the compiler takes advantage of these mechanisms. The MDP's tagged architecture allows very efficient support of object-oriented languages such as Concurrent Smalltalk. The initial goals for the MDP were to have the MDP execute about twenty instructions per method and contain 4096 words of memory. This compiler shows that these goals are too optimistic -- most methods are longer, both in terms of code size and running time. Thus, the memory size of the MDP should be increased.

Concurrent Aggregates (CA): An Object-Oriented Language for Fine-Grained Message-Passing Machines

Fine-grained parallel machines have the potential for very high speed computation. To program massively-concurrent MIMD machines, programmers need tools for managing complexity. These tools should not restrict program concurrency. Concurrent Aggregates (CA) provides multiple-access data abstraction tools, Aggregates, which can be used to implement abstractions with virtually unlimited potential for concurrency. Such tools allow programmers to modularize programs without reducing concurrency. I describe the design, motivation, implementation and evaluation of Concurrent Aggregates. CA has been used to construct a number of application programs. Multi-access data abstractions are found to be useful in constructing highly concurrent programs.

Asymptotically Zero Energy Computing Using Split-Level Charge Recovery Logic

The dynamic power requirement of CMOS circuits is rapidly becoming a major concern in the design of personal information systems and large computers. In this work we present a number of new CMOS logic families, Charge Recovery Logic (CRL) as well as the much improved Split-Level Charge Recovery Logic (SCRL), within which the transfer of charge between the nodes occurs quasistatically. Operating quasistatically, these logic families have an energy dissipation that drops linearly with operating frequency, i.e., their power consumption drops quadratically with operating frequency as opposed to the linear drop of conventional CMOS. The circuit techniques in these new families rely on constructing an explicitly reversible pipelined logic gate, where the information necessary to recover the energy used to compute a value is provided by computing its logical inverse. Information necessary to uncompute the inverse is available from the subsequent inverse logic stage. We demonstrate the low energy operation of SCRL by presenting the results from the testing of the first fully quasistatic 8 x 8 multiplier chip (SCRL-1) employing SCRL circuit techniques.

Concurrent Smalltalk on the Message-Driven Processor

Concurrent Smalltalk is the primary language used for programming the J- Machine, a MIMD message-passing computer containing thousands of 36-bit processors connected by a very low latency network. This thesis describes in detail Concurrent Smalltalk and its implementation on the J-Machine, including the Optimist II global optimizing compiler and Cosmos fine-grain parallel operating system. Quantitative and qualitative results are presented.