Notes, summaries, assignments, exams, and problems

Logística Inversa (Conceptos Fundamentales)

Definición y Propósito

• Gestión de productos devueltos
• Control de costes
• Recuperación de valor
• Reducción de residuos
• Apoyo a la sostenibilidad

Principales Causas de Devolución

• Daños durante el transporte
• Defectos de fabricación
• Errores de envío
• Producto incorrecto
• Faltantes de piezas
• Insatisfacción del cliente

Fases del Proceso Básico

• Recolección
• Transporte inverso
• Inspección
• Clasificación
• Toma de decisiones
• Destino final
• Trazabilidad

Opciones de Destino Final

• Reutilización
• Reparación
• Reacondicionamiento (Refurbish)
• Reciclaje
• Disposición final (última opción)

Costes Asociados a la Logística Inversa

• Transporte
• Manipulación
• Inspección
• Reparación
• Reempaquetado
• Almacenamiento
• Reciclaje
• Cumplimiento legal

Factores Clave

!!!!GENERAL!!!! a mod b = a - b * floor(a/b) x dBm = 10^(x/10) mW 10log(10 (mW) ) = 10 dB
!!PHY 2!! VARIABLES: P_r = Receiving power (W/mW) P_T = Sending power (W/ mW) G_T = Sending antenna gain G_R = Receiving Antenna Gain H_T = Sending antenna height (m) H_R = Receiving Antenna height (m) d = transmission distance (m) λ = c/f = wavelength (m) f = frequency (Hz) c = Speed of light = 3 * 10^8 (m/s) d_break = break point distance (m) N_T = number of transmitting antennas N_R = number of receiving antennas v = velocity (m/s)
Free space Path Loss (Friis Equation): P_R = P_T * G_T * G_R * (λ / (4πd))^2 unit antenna gain is 1. (IF isotropic antenna (theory) P_R = P_T * (c / (4πdf))^2 )
P_r / P_t = Total Path loss (db) TWO RAY: Time between

lim x->0 sinx/x = 1 | H.A.: compare degrees | V.A.: denom = 0 | Continuous if: f(a), lim, equal

DERIVATIVES: (x^n)'=nx^(n-1), (e^x)'=e^x, (a^x)'=a^x ln a, (lnx)'=1/x | (uv)'=u'v+uv', (u/v)'=(u'v-uv')/v^2 |chain: (f(g(x)))'=f'(g(x))g'(x)

TRIG DERIVATIVES: (sin)'=cos, (cos)'=-sin, (tan)'=sec^2 | (sec)'=sec·tan, (csc)'=-csc·cot, (cot)'=-csc^2

CRITICAL POINTS:f'=0 or DNE ⇒ crit pt | f'>0 inc | f'<0 dec | f''>0 conc up | f''<0 conc down | inflec = f'' signchange

INTEGRATION: ∫x^n dx = x^(n+1)/(n+1)+C | ∫e^x dx = e^x+C | ∫a^x dx = a^x/ln a+C | ∫1/x dx = ln|x|+C | ∫sin x dx

= -cos x+C | ∫cos x dx = sin x+C

FTC: Part 1: d/dx ∫_a^x f(t) dt = f(x) | Part 2: ∫_a^b f(x) dx = F(b)-F(a)

AREA & VOLUME: A = ∫_a^b (top - bot)... Continue reading "5 hr 20 min 20 sec corresponds to a longitude difference of" »

Building Java GUI Applications with AWT

Creating GUI applications using Abstract Window Toolkit (AWT) involves setting up a top-level container, adding components, arranging them with a Layout Manager, and making the container visible.

Steps to Create an AWT Application

1. Choose a Top-Level Container

The application needs a primary window to hold all components. The most common choice is the Frame class, which provides a title bar, borders, and window controls.

import java.awt.*;

// Class extends Frame to be the application window itself
public class AWTExample extends Frame {
    // Constructor and other methods
}

2. Initialize the Container (The Frame)

Inside the constructor, you set up the basic properties of the window:

• Title: Set the window

Direct DNA Transfer: Vectorless Gene Introduction

The term direct or vectorless transfer of DNA is used when foreign DNA is introduced directly into the host genome, bypassing biological vectors.

Key Direct Gene Transfer Methods

1. Electroporation

   Electroporation involves using high field strength electrical impulses to reversibly permeabilize cell membranes, allowing the uptake of DNA. This technique can be used for the delivery of DNA into intact plant cells and protoplasts. Nowadays, intact cells, callus cultures, and immature embryos can be used with suitable pre- and post-electroporation treatments. Electroporation has been successfully employed for producing transgenic plants of many cereals, such as rice, wheat, and maize.

2. Particle Bombardment

English Vowel and Diphthong Phonetics

a — Low back, unrounded, lax

Examples: pot, car.

• Positions: initial — olive; middle — cottage.
• R-colored (/+r/) examples: swap — swab; knot — nod; bock — bog; cop — cob; barr — barred.

c — Mid-low back, rounded, tense

Examples: fall, raw.

• Positions: initial — office; middle — form; final — law.
• R-colored (/+r/) examples: course; dross — draws; source — sores; court — chord; cost — caused; brought — broad.

O — Diphthong, mid to high, rounded, tense

Examples: post, coal.

• Positions: initial — ocean; middle — most; final — low.
• Word pairs / examples: lope — lobe; doss — doze; oat — owed; host — hosed; loayn — loathe.

u — High back, rounded, lax

Examples: put, look.

• Positions:

Core Database Concepts and Relational Algebra

Question 1: Cartesian Product Size

Question 1: S is a relation instance. If S has 6 tuples, how many tuples are there in the result of the following SQL query?

SELECT * FROM S S1, S S2;

Answer: 36 (Calculated as 6 * 6, representing the Cartesian product of S with itself.)

Question 2: Maximum Tuples and Primary Keys

Question 2: Let R(A, B, C, D) be a relation, where (A, B, C) is the Primary Key (PK) of R, and attribute D cannot be NULL. Assume A's domain has 5 different values, B's domain has 2, C has 4, and D has 3. What is the maximum number of tuples that can be in an instance of R?

Answer: 40 (Calculated as 5 * 2 * 4. The maximum number of tuples is determined by the product of the domain sizes of the... Continue reading "Database Fundamentals: SQL Queries and Relational Concepts" »

CPU Fundamentals and Timing

Clock Cycles and Frequency

A clock that oscillates 1 million times per second (1 MHz) produces a clock cycle of 1 microsecond (1 μs), which equals 10^-6 seconds per cycle.

Instruction Execution Pipeline

The steps for executing a machine instruction are:

1. Fetch the instruction.
2. Decode the instruction.
3. Fetch the operand (if any).
4. Execute the instruction.
5. Store the result or output.

Cache Memory Operations

Cache memory is a small, fast memory used to temporarily store frequently accessed data or instructions to speed up CPU operations.

• A cache hit occurs when the CPU finds the required data in cache memory.
• A cache miss occurs when the data is not found and must be fetched from main memory.

Assembly Language Basics

General-Purpose

Assembly Language Fundamentals: Key Concepts and Definitions

1. Clock Frequency and Cycle Time

A clock that oscillates 1 million times per second (1 MHz) produces a clock cycle duration of $10^{-6}$ seconds (1 microsecond).

2. General-Purpose Registers (8-bit, 16-bit, and 32-bit Access)

The general-purpose registers that can be accessed in 8 bits, 16 bits, and 32 bits are: EAX, EBX, ECX, and EDX.

3. Purpose of EAX and ECX Registers

These registers serve specific roles in CPU operations:

• EAX – Accumulator: Automatically used by multiplication and division instructions. It is often referred to as the extended accumulator register.
• ECX – Loop Counter: The CPU automatically uses ECX as a counter for loop instructions.

4. Reserved Words and Identifiers