“…Entre 1826 y 1830 Phillip Parker King comandó una expedición por el litoral sureño de América, al mando de las naves Adventurey Beagle, en la cual estuvo acompañado por Robert Fitz Roy. …”
Acceso restringido con credenciales UPSA

Tabla de Contenidos: “…XVII) LUGARES DE MEMORIA -- M -- MANIFESTACIÓN EN PARÍS A FAVOR DE LA INDEPENDENCIA DE ARGELIA -- MAQUIS (VÉASE «GUERRILLA») MARCAS DE LA MEMORIA, PROYECTO -- MARCHAS DEL SILENCIO EN URUGUAY -- MATERNALISMO (VÉASE «FAMILISMO» Y «BIOLOGISMO MEMORIAL») MAYO DEL 68 -- MEMORIA -- MEMORIA ANTIFASCISTA -- MEMORIA DE LOS CAMPOS -- MEMORIA COLECTIVA -- MEMORIA COMPLETA -- MEMORIA CULTURAL -- MEMORIA EJEMPLAR Y LITERAL -- MEMORIA GLOBITAL -- MEMORIA DE LAS GUERRAS -- MEMORIA HISTÓRICA -- MEMORIA JUSTA -- MEMORIA MULTIDIRECCIONAL -- MEMORIA NACIONAL…”

Tabla de Contenidos: “…4.1.1 Data Types -- 4.1.2 Scheduling -- 4.1.3 Stacks -- 4.1.4 System Calls -- 4.1.5 Handling Interrupts -- 4.1.6 Multithreading -- 4.1.7 Thread-Based vs Event-Based Programming -- 4.1.8 Memory Allocation -- 4.2 Nonfunctional Aspects -- 4.2.1 Separation of Concern -- 4.2.2 System Overhead -- 4.2.3 Portability -- 4.2.4 Dynamic Reprogramming -- 4.3 Prototypes -- 4.3.1 TinyOS -- 4.3.2 SOS -- 4.3.3 Contiki -- 4.3.4 LiteOS -- 4.4 Evaluation -- Exercises -- References -- Part Two: BASIC ARCHITECTURAL FRAMEWORK -- 5 Physical Layer -- 5.1 Basic Components -- 5.2 Source Encoding -- 5.2.1 The Efficiency of a Source Encoder -- 5.2.2 Pulse Code Modulation and Delta Modulation -- 5.3 Channel Encoding -- 5.3.1 Types of Channels -- 5.3.2 Information Transmission over a Channel -- 5.3.3 Error Recognition and Correction -- 5.4 Modulation -- 5.4.1 Modulation Types -- 5.4.2 Quadratic Amplitude Modulation -- 5.4.3 Summary Signal Propagation -- 5.5 Signal Propagation -- Exercises -- References -- 6 Medium Access Control -- 6.1 Overview -- 6.1.1 Contention-Free Medium Access -- 6.1.2 Contention-Based Medium Access -- 6.2 Wireless MAC Protocols -- 6.2.1 Carrier Sense Multiple Access -- 6.2.2 Multiple Access with Collision Avoidance (MACA) and MACAW -- 6.2.3 MACA By Invitation -- 6.2.4 IEEE 802.11 -- 6.2.5 IEEE 802.15.4 and ZigBee -- 6.3 Characteristics of MAC Protocols in Sensor Networks -- 6.3.1 Energy Efficiency -- 6.3.2 Scalability -- 6.3.3 Adaptability -- 6.3.4 Low Latency and Predictability -- 6.3.5 Reliability -- 6.4 Contention-Free MAC Protocols -- 6.4.1 Characteristics -- 6.4.2 Traffic-Adaptive Medium Access -- 6.4.3 Y-MAC -- 6.4.4 DESYNC-TDMA -- 6.4.5 Low-Energy Adaptive Clustering Hierarchy -- 6.4.6 Lightweight Medium Access Control -- 6.5 Contention-Based MAC Protocols -- 6.5.1 Power Aware Multi-Access with Signaling -- 6.5.2 Sensor MAC -- 6.5.3 Timeout MAC…”

Tabla de Contenidos: “…Descriptivo y no descriptivo -- 5.2.3. Literal y figurado -- 5.3. El lugar actual de la disciplina semántica en el aula -- 5.4. …”

Tabla de Contenidos: “…3.8 Basic Data Type -- 3.9 Derived Data Type -- (1) Pointers -- (2) Functions -- (3) Arrays -- (4) References -- 3.10 User-Defined Data Type -- (1) Structure and Classes -- (2) Union -- (3) Enumarated Data Type -- 3.11 The void Data Type -- 3.12 Type Modifiers -- 3.13 Wrapping Around -- 3.14 Typecasting -- (1) Explicit Typecasting -- (2) Implicit Type Conversion -- 3.15 Constants -- (1) Literal Constant -- (2) Symbolic Constant -- 3.16 Constant Pointers -- (1) Constant Pointer -- (2) Pointer to Constant -- (3) Pointer and Variable both Constants -- 3.17 Operators in C and C++ -- 3.18 Precedence of Operators in C++ -- Precedence of * and [ ] Operators -- 3.19 Referencing (&) and Dereferencing (*) Operators -- Referencing Operator (&) -- Principles for Declaring Reference Variable -- Dereferencing Operator (*) -- Difference Between & and * Operator -- 3.20 Scope Access Operator -- 3.21 Memory Management Operators -- 3.22 Comma Operator -- 3.23 Comma in Place of Curly Braces -- Summary -- Exercises -- Chapter 4: Control Structures -- 4.1 Introduction -- 4.2 Decision-Making Statements -- 4.3 The if-else Statement -- 4.4 The Nested if-else Statement -- The if-else-if Ladder Statement -- 4.5 The jump Statement -- 4.6 The goto Statement -- 4.7 The break Statement -- 4.8 The continue Statement -- 4.9 The switch case Statement -- 4.10 The Nested switch()case Statement -- 4.11 Loops in C/C++ -- 4.12 The for Loop -- 4.13 Nested for Loops -- 4.14 The while Loop -- 4.15 The do-while Loop -- Summary -- Exercises -- Chapter 5: Functions in C++ -- 5.1 Introduction -- 5.2 The main () Function in C and C++ -- 5.3 Parts of Function -- (1) Function Prototypes -- (2) Function Definition -- (3) Function Call -- (4) Actual and Formal Arguments -- (5) The return Statement -- 5.4 Passing Arguments -- (1) Pass by Value -- (2) Pass by Address -- (3) Passsing by Reference…”

Tabla de Contenidos: “…-- Puzzleprinzip Nr. 10: Intuition ist ein zweischneidiges Schwert -- 14.4 Ein letztes Puzzleteil -- 14.5 Weitere Informationsquellen zu diesem Thema -- Kapitel 15: Das Spielen erfolgt über das Interface -- 15.1 Zwischen Yin und Yang -- 15.2 Analyse -- 15.3 Die Schleife der Interaktion -- Das ist »echt fett« -- Urtümlichkeit -- 15.4 Informationskanäle -- Modi -- Weitere Interface-Tipps -- 15.5 Weitere Informationsquellen zu diesem Thema -- Kapitel 16: Erlebnisse werden an Interessenkurven gemessen -- 16.1 Meine erste Lupe -- 16.2 Interessenkurven -- 16.3 Muster im Muster -- 16.4 Wie misst man das Interesse? …”

Tabla de Contenidos: “…4.6.3 General Diagram Features -- 4.6.3.1 Views -- 4.6.3.2 Diagram Frame and Header -- 4.6.3.3 Diagram Kind -- 4.6.3.4 Namespace -- 4.6.3.5 Comments -- 4.6.3.6 Constraints -- 5 Questions for Chapter 4 -- Answers for Chapter 4 -- 6 Objects and Classes -- 6.1 Finding Objects and Classes -- 6.1.1 Attributes -- 6.1.2 Operations -- 6.1.3 Referring to a Member Feature -- 6.1.4 Static Features -- 6.2 Types -- 6.2.1 Class Versus Datatype -- 6.2.2 Primitive Types -- 6.2.3 Enumerations -- 6.2.4 DataTypes -- 6.2.4.1 Abstraction -- 6.3 Modifiers -- 6.3.1 Derived Properties -- 6.3.2 Default Value -- 6.3.2.1 Default Values for Attributes/Properties -- 6.3.2.2 Default Values for Arguments/Parameters -- 6.3.3 Protecting from Change -- 6.3.3.1 ReadOnly -- 6.3.3.2 Queries -- 6.3.4 Parameter Direction -- 6.4 Assigning Value -- 6.4.1 Literals -- 6.4.2 Instance Specifications -- 6.4.3 Expressions -- 7 Questions for Chapter 6 -- Answers for Chapter 6 -- 8 Packages and Namespaces -- 8.1 Package Notation -- 8.1.1 Packages and Their Contents -- 8.1.2 Diagrams of Packages -- 8.1.3 Uniform Resource Identifiers -- 8.2 Packages and Visibility -- 8.2.1 Package Member Visibility -- 8.2.2 Inner and Outer Names -- 8.2.3 Namespaces and Distinguishable Names -- 8.3 Packages and Their Contents -- 8.3.1 Package Dependencies -- 8.3.2 Specific Elements from Other Packages -- 8.3.2.1 Package Import -- 8.3.2.2 Element Import -- 8.3.2.3 Comparison of Package vs Element Import -- 8.3.2.4 Access -- 8.3.2.5 Package Dependencies and Cycles -- 8.3.2.6 Package Merge -- 8.4 Package Stereotypes -- 8.4.1 Packages and Models -- 8.4.2 Miscellaneous Stereotypes of Packages -- 8.4.2.1 ModelLibrary -- 8.4.2.2 Framework -- 8.4.2.3 Profiles -- 8.4.2.4 Diagrams -- 9 Questions for Chapter 8 -- Answers for Chapter 8 -- 10 Finishing the Static Model -- 10.1 Multiplicity…”

Tabla de Contenidos: “…7.1.3 Sequences -- 7 .1.4 Permutations -- 7.2 Induction -- 7.2.1 The Sum of Odd Numbers -- 7 .2.2 Subset Counting Revisited -- 7 .2.3 More Induction Proofs -- 7 .2.4 Counting Regions -- 7.3 Counting Subsets -- 7.3.1 The Number of Ordered Subsets -- 7 .3.2 The Number of Subsets of a Given Size -- 7 .3.3 The Binomial Theorem -- 7 .3.4 Distributing Presents -- 7 .3.5 Anagrams -- 7 .3.6 Distribution of Money -- 7.4 Pascal's Triangle -- 7 .4.1 Identities in the Pascal Triangle -- 7.4.2 A Bird's- Eye View at the Pascal Triangle -- 7.5 Combinatorial Probability -- 7.5.1 Events and Probabilities -- 7 .5.2 Independent Repetition of an Experiment -- 7 .5.3 The Law of Large Numbers -- 7.6 Fibonacci Numbers -- 7.6.1 Fibonacci's Exercise -- 7 .6.2 Lots of Identities -- 7 .6.3 A Formula for the Fibonacci Numbers -- 7.7 Integers, Divisors, and Primes -- 7. 7.1 Divisibility of Integers -- 7.7.2 Primes and Their History -- 7.7.3 Factorization into Primes -- 7.7.4 Fermat's "Little" Theorem -- 7.7.5 The Euclidean Algorithm -- 7. 7.6 Primality Test -- Chapter 8: Combinatorics -- 8.1 The Pigeonhole Principle -- 8.2 Strong Pigeonholes -- 8.2.1 Pigeonhole Principle Examples: Weighing Balls -- 8.3 Dilworth's Theorem -- 8.4 Problems -- 8.5 Sets of the Same Size: Bijections -- 8.6 Finite Sets -- 8.7 Inclusion-Exclusion -- 8.8 lnfinite Sets -- 8.9 Schroder-Bcrnstein Theorem -- 8.10 Countable Sets -- 8.11 The Continuum -- 8.12 Diagonal Argwnents -- 8.12.1 A Paradox -- 8.13 Set Theory Revisited -- 8.13.1 Bijections, Injections, Surjections -- 8.13.2 Finite Cardinality -- 8.14 Functions and Permutations -- 8.14.1 Surjection, Injection, Bijection -- 8.14.2 Permutation -- Chapter 9: Automata -- 9.1 Introduction -- 9.1.1 Abstraction -- 9.2 Decision Problems vs Functions -- 9.2.1 Strings -- 9.2.2 Operations on Strings -- 9.2.3 Operations on Sets…”