- Cada instrucción de un programa opera sobre datos. El método de especificar los datos a operar se llama direccionamiento.
- El EJE tiene los siguientes tipos de direccionamiento: direccionamiento inmediato, direccionamiento directo, direccionamiento indirecto, direccionamiento implícito y direccionamiento acumulador.
- Las instrucciones que son usadas para transferir el control de programa de una memoria a otra son agrupadas bajo este encabezado.
This document provides an overview of artificial neural networks (ANNs). It discusses ANN basics such as their structure being inspired by biological neural networks in the brain. The document covers different types of ANNs including feedforward and feedback networks. It also discusses ANN properties like learning strategies, applications, advantages like handling noisy data, and disadvantages like requiring training. The conclusion states that ANNs are flexible and suited for real-time systems due to their parallel architecture.
Seminar on detecting fake accounts in social media using machine learningParvathi Sanil Nair
The document discusses research on detecting fake identities using machine learning on social media platforms. It begins with an abstract stating that little research has been done to detect fake human accounts specifically. The research applies machine learning models to attributes of fake accounts in hopes of advancing detection. It then outlines the contents which include introduction, related work on spam detection, research on detecting fake identities, research results, and conclusions. Key points are that identity deception is a major problem on social media, and while models can detect bot accounts, they are less successful at detecting fake human accounts using only profile attributes without behavioral data. The random forest model achieved the best results with an F1 score of 49.75% for detecting fake human accounts.
Introduction to AIoT & TinyML - with ArduinoAndri Yadi
On last March 21, 2020, we participated in worldwide Arduino Day 2020 and organized the online event for Bandung, Indonesia. This is the deck I delivered for my talk and demo.
The document discusses nano computing, which uses devices that are extremely small, around 100 nm in size. It describes different types of nano computers including electronic, mechanical, chemical, and quantum. It explains how nano computing works by storing data using atomic quantum states or spin. The advantages are high performance, low power usage, and smaller devices. Challenges include the high costs and difficulties of manufacturing at the nano scale. The future of nano computing could include new memory technologies and standards to utilize the new systems.
Self-organizing networks can perform unsupervised clustering by mapping high-dimensional input patterns into a smaller number of clusters in output space through competitive learning. Fixed weight competitive networks like Maxnet, Mexican Hat net, and Hamming net use competitive learning with fixed weights. Maxnet uses winner-take-all competition to select the neuron whose weights best match the input. Mexican Hat net has both excitatory and inhibitory connections between neurons to enhance contrast. Hamming net determines which exemplar vector most closely matches the input using the Hamming distance measure.
Physical Layer Numericals - Data Communication & NetworkingDrishti Bhalla
This document contains solutions to 29 questions related to digital communication concepts like channel capacity, bit rate, bandwidth, signal-to-noise ratio, modulation techniques, and error detection. The questions cover topics such as calculating bit rate from bandwidth and SNR, determining maximum data rate using Shannon's formula, and computing bandwidth requirements for different modulation schemes.
Mac protocols for ad hoc wireless networks Divya Tiwari
The document discusses MAC protocols for ad hoc wireless networks. It addresses key issues in designing MAC protocols including limited bandwidth, quality of service support, synchronization, hidden and exposed terminal problems, error-prone shared channels, distributed coordination without centralized control, and node mobility. Common MAC protocol classifications and examples are also presented, such as contention-based protocols, sender-initiated versus receiver-initiated protocols, and protocols using techniques like reservation, scheduling, and directional antennas.
The document discusses the security mechanisms in GSM cellular networks. It describes how GSM uses encryption algorithms (A3, A5, A8) and a challenge-response mechanism involving a random number (RAND) and signed response (SRES) to authenticate users. While the A5 stream cipher has an effective key length of 40 bits, this provides adequate security for conversations given their short lifespan of weeks. GSM networks are the most secure cellular standard due to using encryption, temporary IDs, and digital signaling compared to analog networks.
This document provides an overview of artificial neural networks (ANNs). It discusses ANN basics such as their structure being inspired by biological neural networks in the brain. The document covers different types of ANNs including feedforward and feedback networks. It also discusses ANN properties like learning strategies, applications, advantages like handling noisy data, and disadvantages like requiring training. The conclusion states that ANNs are flexible and suited for real-time systems due to their parallel architecture.
Seminar on detecting fake accounts in social media using machine learningParvathi Sanil Nair
The document discusses research on detecting fake identities using machine learning on social media platforms. It begins with an abstract stating that little research has been done to detect fake human accounts specifically. The research applies machine learning models to attributes of fake accounts in hopes of advancing detection. It then outlines the contents which include introduction, related work on spam detection, research on detecting fake identities, research results, and conclusions. Key points are that identity deception is a major problem on social media, and while models can detect bot accounts, they are less successful at detecting fake human accounts using only profile attributes without behavioral data. The random forest model achieved the best results with an F1 score of 49.75% for detecting fake human accounts.
Introduction to AIoT & TinyML - with ArduinoAndri Yadi
On last March 21, 2020, we participated in worldwide Arduino Day 2020 and organized the online event for Bandung, Indonesia. This is the deck I delivered for my talk and demo.
The document discusses nano computing, which uses devices that are extremely small, around 100 nm in size. It describes different types of nano computers including electronic, mechanical, chemical, and quantum. It explains how nano computing works by storing data using atomic quantum states or spin. The advantages are high performance, low power usage, and smaller devices. Challenges include the high costs and difficulties of manufacturing at the nano scale. The future of nano computing could include new memory technologies and standards to utilize the new systems.
Self-organizing networks can perform unsupervised clustering by mapping high-dimensional input patterns into a smaller number of clusters in output space through competitive learning. Fixed weight competitive networks like Maxnet, Mexican Hat net, and Hamming net use competitive learning with fixed weights. Maxnet uses winner-take-all competition to select the neuron whose weights best match the input. Mexican Hat net has both excitatory and inhibitory connections between neurons to enhance contrast. Hamming net determines which exemplar vector most closely matches the input using the Hamming distance measure.
Physical Layer Numericals - Data Communication & NetworkingDrishti Bhalla
This document contains solutions to 29 questions related to digital communication concepts like channel capacity, bit rate, bandwidth, signal-to-noise ratio, modulation techniques, and error detection. The questions cover topics such as calculating bit rate from bandwidth and SNR, determining maximum data rate using Shannon's formula, and computing bandwidth requirements for different modulation schemes.
Mac protocols for ad hoc wireless networks Divya Tiwari
The document discusses MAC protocols for ad hoc wireless networks. It addresses key issues in designing MAC protocols including limited bandwidth, quality of service support, synchronization, hidden and exposed terminal problems, error-prone shared channels, distributed coordination without centralized control, and node mobility. Common MAC protocol classifications and examples are also presented, such as contention-based protocols, sender-initiated versus receiver-initiated protocols, and protocols using techniques like reservation, scheduling, and directional antennas.
The document discusses the security mechanisms in GSM cellular networks. It describes how GSM uses encryption algorithms (A3, A5, A8) and a challenge-response mechanism involving a random number (RAND) and signed response (SRES) to authenticate users. While the A5 stream cipher has an effective key length of 40 bits, this provides adequate security for conversations given their short lifespan of weeks. GSM networks are the most secure cellular standard due to using encryption, temporary IDs, and digital signaling compared to analog networks.
SOLUTION MANUAL OF COMMUNICATION NETWORKS BY ALBERTO LEON GARCIA & INDRA WIDJAJAvtunotesbysree
The document provides solutions to chapter 1 problems from the textbook "Communication Networks" by Alberto Leon Garcia and Indra Widjaja.
The solutions describe the procedures involved in mailing a letter and sending an email. They are both connectionless services. Procedures for making a telephone call and providing personal communication services are also described. Setting up telephone calls is connection-oriented. Requirements for interactive online games over connection-oriented and connectionless networks are discussed. Networks must support real-time delivery of commands and responses for interactive games and applications.
The document discusses key concepts related to physical layer signals in data communication systems. It covers topics such as analog versus digital signals, signal characteristics like frequency and phase, signal impairments including attenuation and noise, and limits on data transmission rates based on channel bandwidth and signal-to-noise ratio. Examples are provided to illustrate concepts like calculating bandwidth, attenuation in decibels, and transmission rate limits. The document contains diagrams to supplement the explanatory text.
The document outlines a syllabus for an Internet of Things Technology course. It includes 5 modules that will be covered over the semester. Evaluation will consist of 3 internal assessments weighted at 30%, 40%, and 30% respectively, covering different portions of the syllabus. Students must attain a minimum of 85% attendance and assignments will be due before each internal assessment. The class website and online testing platform are also indicated.
Here is a MATLAB program to implement logic functions using a McCulloch-Pitts neuron:
% McCulloch-Pitts neuron for logic functions
% Inputs
x1 = 1;
x2 = 0;
% Weights
w1 = 1;
w2 = 1;
% Threshold
theta = 2;
% Net input
net = x1*w1 + x2*w2;
% Activation function
if net >= theta
y = 1;
else
y = 0;
end
% Output
disp(y)
This implements a basic AND logic gate using a McCulloch-Pitts neuron.
Neuromorphic computing is an emerging interdisciplinary field that takes inspiration from biology to design hardware models of neural systems. Specifically, it uses very-large-scale integrated circuits containing analog electronic circuits to mimic the neurobiological architectures in the nervous system, as conceived by Carver Mead in the late 1980s. Two examples are Neurogrid, a mixed-analog-digital multichip system emulating a million neurons and billion connections using subthreshold analog logic, and IBM's TrueNorth, which contains 16 neuromorphic cores and is completely digital. Both aim to achieve the scale and low power operation of the biological brain through novel computing architectures.
The document discusses neural networks and their applications. It provides an outline of topics including neural network concepts, types of neural networks, and a case study on predicting time series. Some key points include:
- Neural networks are modeled after the human brain and consist of interconnected nodes that can learn from training data.
- Common neural network types include perceptrons, linear networks, backpropagation networks and self-organizing maps.
- Neural networks can be used for applications in various domains such as aerospace, banking, manufacturing, and more.
This document provides an overview of selected topics in computer science, including artificial intelligence, robotics, machine learning, and the internet of things. It will cover these topics through a series of sessions, discussing introductions and basic concepts for each. The first session introduces AI and compares it to machine learning. Subsequent sessions will cover robotics and its types, applications of machine learning, and laws of robotics. Students will work on individual or group projects related to these topics.
1) Artificial neural networks (ANNs) are processing systems inspired by biological neural networks, consisting of interconnected nodes that process information via algorithms or hardware components. ANNs can accurately model functions like visual processing in the retina.
2) ANNs are useful for problems like facial recognition that are difficult to solve with algorithms due to their ability to learn from examples in a way similar to the human brain.
3) ANNs have many applications, including pattern recognition, modeling complex relationships in large datasets, and real-time systems due to their parallel architecture.
The document discusses a seminar presentation on mind reading computers. It begins with an introduction on how people express mental states through facial expressions and gestures. It then discusses what mind reading is, how it works using sensors to measure blood oxygen levels in the brain, and the process which involves facial detection and emotional classification techniques. Applications are discussed including using it to help paralyzed people communicate and potential issues around privacy breaches. It concludes that research is underway to allow computers to respond to brain activity.
This document discusses quantum cryptography. It begins with an introduction to traditional cryptography and then defines quantum cryptography as exploiting quantum mechanical properties like the Heisenberg uncertainty principle and quantum entanglement for cryptographic tasks. It explains how quantum cryptography works by having Alice and Bob send polarized photons in randomly chosen bases and discarding mismatched bases to generate a secret key. It also covers applications like secure online voting and satellite communications, as well as limitations such as short maximum distances and inability to multiplex quantum channels.
The document discusses neural networks and their applications. It provides an overview of neural networks, including their history and how they are modeled after biological neurons. Supervised learning is described as training neural networks using labeled input-output pairs. Specific neural network concepts like the perceptron, backpropagation, and convolutional neural networks are explained. Applications mentioned include mobile computing, forecasting, character recognition, data mining, and image recognition. Both merits like flexibility and demerits like requiring large processing are noted.
This document discusses smart fabrics and textiles that can sense and respond to environmental stimuli. It provides examples of smart fabrics like Gore-Tex that are waterproof and breathable, as well as microencapsulated fabrics that can release substances like antibacterial agents in response to heat, pressure or other triggers. The document also discusses using smart textiles for medical purposes like wound dressings and how they may help regulate body temperature and odor. It describes early experiments creating touch interfaces and circuits using conductive metallic yarns woven into fabrics.
Power Management in Wireless Sensor NetworkBhavik Panchal
This document discusses power management techniques for sensor networks. It notes that sensor nodes are battery-powered and must operate for months to years on limited power. It describes the key components of sensor nodes that consume power, including the microcontroller, radio, sensors, and DC-DC converter. The document outlines various power management approaches that can optimize energy usage at the node, network, and protocol levels, such as putting components into low-power sleep modes, efficient routing protocols, and energy-aware software. The goal is to significantly extend the lifetime of battery-powered sensor networks.
A handover is the process of transferring a cellular call or data session from one cell site to another without disconnecting as the user moves between different cells. There are different types of handovers including intra-cell handovers which change channels within the same cell, inter-cell handovers which transfer between different cells, hard handovers which instantly terminate the existing connection to establish a new one, and soft handovers which connect to the new channel before disconnecting the existing connection to provide a smoother transition.
Credit card fraud detection through machine learningdataalcott
This document discusses using machine learning algorithms for credit card fraud detection. It proposes using principal component analysis for feature selection followed by logistic regression and decision tree models. It finds that logistic regression has higher accuracy at 79.91% compared to 71.41% for decision tree. The proposed approach aims to better handle imbalanced data and reduce fraudulent transactions. Future work could implement the approach in Python and produce experimental results.
This document discusses the implementation of fast multiplier architectures for convolution applications in signal processing. It examines Vedic multipliers, column bypass multipliers, and multipliers using compressors. Circuit diagrams and simulation results are presented for 4-bit, 8-bit, and 16-bit multipliers. Synthesis results on a Xilinx FPGA show the resource utilization and performance of each multiplier type. Applications of these multipliers include convolution, DSP processors, and fast Fourier transforms.
The document discusses optimizing IP for use in Internet of Things networks. It covers several key topics:
- The advantages of using IP, including its open standards, versatility, ubiquity, scalability, manageability, and role in enabling innovation.
- The need to optimize IP for constrained IoT nodes with limited resources, as well as challenges around unreliable connectivity, power consumption, and bandwidth constraints.
- Classifying IoT nodes based on their constraints and whether they use a full IP stack, optimized IP stack, or non-IP stack with gateways for connectivity.
- Considerations for the IP adoption model of replacing non-IP layers versus the adaptation model of implementing application gateways between IP and
The document discusses Adaline and Madaline artificial neural networks. It provides information on:
- Adaline networks, which are simple perceptrons that accomplish classification by modifying weights to minimize mean square error. Adaline uses the Widrow-Hoff learning rule.
- Madaline networks, which combine multiple Adalines and can solve non-separable problems. Madaline rule training algorithms include Madaline Rule I, II, and III.
- Madaline Rule I modifies weights leading into hidden nodes to decrease error on each input. Madaline Rule II modifies weights layer-by-layer using a trial-and-error approach.
- Applications of Adaline include noise cancellation, echo cancellation, and medical
The 8255A Programmable Peripheral Interface chip has two main modes of operation - I/O mode and Bit Set-Reset mode. In I/O mode, the ports work as programmable I/O ports and can be configured in three sub-modes (Mode 0, 1, and 2) using a Control Word Register. Mode 1 uses handshaking signals to coordinate data transfer between ports. Mode 2 allows bi-directional communication on a single bus. In Bit Set-Reset mode, individual bits of port C can be set or reset using the Control Word Register.
The document compares the 8085, 8086, and 80286 microprocessors. It discusses their features such as address lines, data lines, register size, memory capacity, pin configuration, power requirements, and frequency. The 8086 and 80286 have more advanced addressing modes than the 8085, including real and protected virtual addressing modes. The document also examines the register organization, pin outs, and operating modes of each microprocessor.
SOLUTION MANUAL OF COMMUNICATION NETWORKS BY ALBERTO LEON GARCIA & INDRA WIDJAJAvtunotesbysree
The document provides solutions to chapter 1 problems from the textbook "Communication Networks" by Alberto Leon Garcia and Indra Widjaja.
The solutions describe the procedures involved in mailing a letter and sending an email. They are both connectionless services. Procedures for making a telephone call and providing personal communication services are also described. Setting up telephone calls is connection-oriented. Requirements for interactive online games over connection-oriented and connectionless networks are discussed. Networks must support real-time delivery of commands and responses for interactive games and applications.
The document discusses key concepts related to physical layer signals in data communication systems. It covers topics such as analog versus digital signals, signal characteristics like frequency and phase, signal impairments including attenuation and noise, and limits on data transmission rates based on channel bandwidth and signal-to-noise ratio. Examples are provided to illustrate concepts like calculating bandwidth, attenuation in decibels, and transmission rate limits. The document contains diagrams to supplement the explanatory text.
The document outlines a syllabus for an Internet of Things Technology course. It includes 5 modules that will be covered over the semester. Evaluation will consist of 3 internal assessments weighted at 30%, 40%, and 30% respectively, covering different portions of the syllabus. Students must attain a minimum of 85% attendance and assignments will be due before each internal assessment. The class website and online testing platform are also indicated.
Here is a MATLAB program to implement logic functions using a McCulloch-Pitts neuron:
% McCulloch-Pitts neuron for logic functions
% Inputs
x1 = 1;
x2 = 0;
% Weights
w1 = 1;
w2 = 1;
% Threshold
theta = 2;
% Net input
net = x1*w1 + x2*w2;
% Activation function
if net >= theta
y = 1;
else
y = 0;
end
% Output
disp(y)
This implements a basic AND logic gate using a McCulloch-Pitts neuron.
Neuromorphic computing is an emerging interdisciplinary field that takes inspiration from biology to design hardware models of neural systems. Specifically, it uses very-large-scale integrated circuits containing analog electronic circuits to mimic the neurobiological architectures in the nervous system, as conceived by Carver Mead in the late 1980s. Two examples are Neurogrid, a mixed-analog-digital multichip system emulating a million neurons and billion connections using subthreshold analog logic, and IBM's TrueNorth, which contains 16 neuromorphic cores and is completely digital. Both aim to achieve the scale and low power operation of the biological brain through novel computing architectures.
The document discusses neural networks and their applications. It provides an outline of topics including neural network concepts, types of neural networks, and a case study on predicting time series. Some key points include:
- Neural networks are modeled after the human brain and consist of interconnected nodes that can learn from training data.
- Common neural network types include perceptrons, linear networks, backpropagation networks and self-organizing maps.
- Neural networks can be used for applications in various domains such as aerospace, banking, manufacturing, and more.
This document provides an overview of selected topics in computer science, including artificial intelligence, robotics, machine learning, and the internet of things. It will cover these topics through a series of sessions, discussing introductions and basic concepts for each. The first session introduces AI and compares it to machine learning. Subsequent sessions will cover robotics and its types, applications of machine learning, and laws of robotics. Students will work on individual or group projects related to these topics.
1) Artificial neural networks (ANNs) are processing systems inspired by biological neural networks, consisting of interconnected nodes that process information via algorithms or hardware components. ANNs can accurately model functions like visual processing in the retina.
2) ANNs are useful for problems like facial recognition that are difficult to solve with algorithms due to their ability to learn from examples in a way similar to the human brain.
3) ANNs have many applications, including pattern recognition, modeling complex relationships in large datasets, and real-time systems due to their parallel architecture.
The document discusses a seminar presentation on mind reading computers. It begins with an introduction on how people express mental states through facial expressions and gestures. It then discusses what mind reading is, how it works using sensors to measure blood oxygen levels in the brain, and the process which involves facial detection and emotional classification techniques. Applications are discussed including using it to help paralyzed people communicate and potential issues around privacy breaches. It concludes that research is underway to allow computers to respond to brain activity.
This document discusses quantum cryptography. It begins with an introduction to traditional cryptography and then defines quantum cryptography as exploiting quantum mechanical properties like the Heisenberg uncertainty principle and quantum entanglement for cryptographic tasks. It explains how quantum cryptography works by having Alice and Bob send polarized photons in randomly chosen bases and discarding mismatched bases to generate a secret key. It also covers applications like secure online voting and satellite communications, as well as limitations such as short maximum distances and inability to multiplex quantum channels.
The document discusses neural networks and their applications. It provides an overview of neural networks, including their history and how they are modeled after biological neurons. Supervised learning is described as training neural networks using labeled input-output pairs. Specific neural network concepts like the perceptron, backpropagation, and convolutional neural networks are explained. Applications mentioned include mobile computing, forecasting, character recognition, data mining, and image recognition. Both merits like flexibility and demerits like requiring large processing are noted.
This document discusses smart fabrics and textiles that can sense and respond to environmental stimuli. It provides examples of smart fabrics like Gore-Tex that are waterproof and breathable, as well as microencapsulated fabrics that can release substances like antibacterial agents in response to heat, pressure or other triggers. The document also discusses using smart textiles for medical purposes like wound dressings and how they may help regulate body temperature and odor. It describes early experiments creating touch interfaces and circuits using conductive metallic yarns woven into fabrics.
Power Management in Wireless Sensor NetworkBhavik Panchal
This document discusses power management techniques for sensor networks. It notes that sensor nodes are battery-powered and must operate for months to years on limited power. It describes the key components of sensor nodes that consume power, including the microcontroller, radio, sensors, and DC-DC converter. The document outlines various power management approaches that can optimize energy usage at the node, network, and protocol levels, such as putting components into low-power sleep modes, efficient routing protocols, and energy-aware software. The goal is to significantly extend the lifetime of battery-powered sensor networks.
A handover is the process of transferring a cellular call or data session from one cell site to another without disconnecting as the user moves between different cells. There are different types of handovers including intra-cell handovers which change channels within the same cell, inter-cell handovers which transfer between different cells, hard handovers which instantly terminate the existing connection to establish a new one, and soft handovers which connect to the new channel before disconnecting the existing connection to provide a smoother transition.
Credit card fraud detection through machine learningdataalcott
This document discusses using machine learning algorithms for credit card fraud detection. It proposes using principal component analysis for feature selection followed by logistic regression and decision tree models. It finds that logistic regression has higher accuracy at 79.91% compared to 71.41% for decision tree. The proposed approach aims to better handle imbalanced data and reduce fraudulent transactions. Future work could implement the approach in Python and produce experimental results.
This document discusses the implementation of fast multiplier architectures for convolution applications in signal processing. It examines Vedic multipliers, column bypass multipliers, and multipliers using compressors. Circuit diagrams and simulation results are presented for 4-bit, 8-bit, and 16-bit multipliers. Synthesis results on a Xilinx FPGA show the resource utilization and performance of each multiplier type. Applications of these multipliers include convolution, DSP processors, and fast Fourier transforms.
The document discusses optimizing IP for use in Internet of Things networks. It covers several key topics:
- The advantages of using IP, including its open standards, versatility, ubiquity, scalability, manageability, and role in enabling innovation.
- The need to optimize IP for constrained IoT nodes with limited resources, as well as challenges around unreliable connectivity, power consumption, and bandwidth constraints.
- Classifying IoT nodes based on their constraints and whether they use a full IP stack, optimized IP stack, or non-IP stack with gateways for connectivity.
- Considerations for the IP adoption model of replacing non-IP layers versus the adaptation model of implementing application gateways between IP and
The document discusses Adaline and Madaline artificial neural networks. It provides information on:
- Adaline networks, which are simple perceptrons that accomplish classification by modifying weights to minimize mean square error. Adaline uses the Widrow-Hoff learning rule.
- Madaline networks, which combine multiple Adalines and can solve non-separable problems. Madaline rule training algorithms include Madaline Rule I, II, and III.
- Madaline Rule I modifies weights leading into hidden nodes to decrease error on each input. Madaline Rule II modifies weights layer-by-layer using a trial-and-error approach.
- Applications of Adaline include noise cancellation, echo cancellation, and medical
The 8255A Programmable Peripheral Interface chip has two main modes of operation - I/O mode and Bit Set-Reset mode. In I/O mode, the ports work as programmable I/O ports and can be configured in three sub-modes (Mode 0, 1, and 2) using a Control Word Register. Mode 1 uses handshaking signals to coordinate data transfer between ports. Mode 2 allows bi-directional communication on a single bus. In Bit Set-Reset mode, individual bits of port C can be set or reset using the Control Word Register.
The document compares the 8085, 8086, and 80286 microprocessors. It discusses their features such as address lines, data lines, register size, memory capacity, pin configuration, power requirements, and frequency. The 8086 and 80286 have more advanced addressing modes than the 8085, including real and protected virtual addressing modes. The document also examines the register organization, pin outs, and operating modes of each microprocessor.
The document discusses the different addressing modes of the 8085 microprocessor. There are four addressing modes: immediate addressing where data is present in the instruction, register addressing where data is provided through registers, direct addressing used to accept data from outside devices, and indirect addressing where the processor calculates an effective address from which to obtain the actual data address.
The document discusses the different addressing modes used by the Intel 8085 microprocessor. It describes 5 addressing modes: direct, register, register indirect, immediate, and implicit. Direct addressing specifies the operand address in the instruction itself. Register addressing uses processor registers as the operand. Register indirect addressing specifies the operand address using a register pair. Immediate addressing encodes the operand within the instruction. Implicit addressing has fixed source and destination registers, so no operands are needed.
The document discusses the addressing modes of the 8085 microprocessor. It defines an addressing mode as the way operands are specified in an instruction. It then describes the five addressing modes of the 8085: immediate, register, direct, register indirect, and implied. Immediate mode embeds the data in the instruction. Register mode uses register-stored data. Direct mode specifies the data address in the instruction. Register indirect mode uses a register pair containing the data address. Implied mode uses the opcode to determine the implied operand.
The document discusses the addressing modes used by the Intel 8085 microprocessor. It explains that an instruction specifies an operation along with the source and destination addresses. The Intel 8085 supports 5 addressing modes: direct, register, register indirect, immediate, and implicit. Each mode is defined by how the source or destination operand address is specified in the instruction.
The document discusses the different addressing modes of the 8086 processor. There are 7 addressing modes: immediate, implicit, direct, register, register indirect, based indexed, and register relative. Each mode describes how an instruction specifies the location of operands. For example, immediate mode provides the data in the instruction itself, while register indirect uses a register containing the address of the data.
Addressing mode & data transfer instruction of 8085Chinmayee samal
The document discusses addressing modes and data transfer instructions of the 8085 microprocessor. It defines addressing modes as the various ways of specifying operands in an instruction. The 8085 supports direct, register, indirect, immediate, and implied addressing modes. It then explains each data transfer instruction in detail, including MOV, MVI, LDA, LHLD, STA, XCHG, PUSH and POP. The instructions are used to move data between registers and memory in the microprocessor.
The document provides information about microprocessors and the 8085 microprocessor. It defines key terms like microprocessor, ALU, registers, control unit, bus, machine cycle, T-state, instruction cycle, fetch cycle, execute cycle, flags, memory mapping, opcode fetch, interrupts, polling, and interrupt types. It describes the basic units and operations of a microprocessor, bus types, the instruction execution process, and interrupt handling. It also discusses I/O techniques, 8085 pins and signals, addressing modes, and differences between memory mapped and I/O mapped I/O.
The document describes a microprocessor, which is an integrated circuit that contains the logic circuitry of a central processing unit on a single chip. It discusses the main components of a microprocessor, including the arithmetic logic unit, register array, control unit, and how they function together. It provides examples of applications for microprocessors across various fields like electronics, mechanical, electrical, medical, computers, and domestic devices. It also includes detailed diagrams and explanations of the architecture, bus structure, registers, flags, and pin descriptions of the specific 8085 microprocessor.
The document discusses the different addressing modes of the 8086 processor. It describes 6 main addressing modes - register, immediate, memory, port, relative, and implied. The memory addressing mode has several sub-types including direct, register indirect, based, indexed, based indexed, and string addressing modes which specify how the effective address of the memory operand is calculated using segment registers and offsets.
The document discusses different addressing modes used in computer instructions. It explains that the addressing mode specifies how the operands are chosen during program execution. Some key addressing modes are direct, indirect, register, register indirect, and relative addressing. The addressing mode determines the effective address, which is the actual memory location of the operand.
The document discusses the different addressing modes of the 8086 processor. It explains that addressing modes refer to the different ways a processor can access data. It then describes the 8 addressing modes of the 8086 - immediate, direct, register, register indirect, indexed, register relative, based indexed, and relative based indexed. For each mode, it provides an example of how the MOV instruction is used with that addressing mode and how the physical address is calculated.
The document discusses the microprocessor 8085. It covers the following topics over 5 weeks: basic concepts of microprocessors, the architecture of the 8085, addressing modes and instruction set, interrupts, and peripherals. The 8085 is an 8-bit microprocessor that uses 246 bit patterns to form its 74 instruction set. An assembly language uses mnemonics like "INR A" to represent instructions, making programs easier for humans to understand compared to machine language.
This document discusses various addressing modes of the 8051 microcontroller. It begins by defining an addressing mode as the method of specifying the source and destination of operands in an instruction. It then lists the 8 addressing modes supported by the 8051: register, direct, indirect, immediate, relative, absolute, indexed, and long. Examples are provided for each mode. The document also compares microprocessors and microcontrollers, and discusses the differences between the 8085, 8086, and 8051 microchips. Finally, it poses questions about addressing modes and instruction types to continue the tutorial.
The document provides an overview of assembly language programming for the 8085 microprocessor. It discusses the 8085 programming model including registers, flags, and addressing modes. It also describes the instruction set categories and provides examples of common instruction types like data transfer, arithmetic, logical, and branching instructions. Sample assembly language programs are shown to add two numbers and handle results larger than 8 bits.
1. El documento discute el resumen de un texto sobre la protección de los consumidores y la información fundamental y de alto nivel que ofrecen los resúmenes concisos de 3 oraciones o menos.
2. Se proporcionan ejemplos de resúmenes cortos de un párrafo cada uno sobre temas como la protección del consumidor, información financiera y servicios médicos.
3. Los resúmenes capturan la idea principal de cada párrafo de manera concisa en 3 oraciones o menos sin incluir detalles específicos.
Este documento proporciona información sobre el diagnóstico y tratamiento de los trastornos de ansiedad, incluyendo los trastornos de pánico y agorafobia. Explica que los grupos de autoayuda pueden ser útiles para las personas que padecen estos trastornos y ofrece orientación sobre diferentes opciones terapéuticas.
El documento describe las funciones y responsabilidades de un nuevo director de una agencia militar, incluyendo supervisar las operaciones militares, garantizar la seguridad nacional y mejorar la capacidad de defensa del país.
A Paradigm Shift for Integrated Solid Waste Management - A Case Study of DelhiSahil Singh Kapoor
El documento describe los desafíos del manejo integrado de residuos sólidos en India, incluyendo la rápida urbanización y el crecimiento exponencial de la generación de desechos que ha sobrepasado la capacidad de los sitios de relleno sanitario existentes. Se requieren tecnologías descentralizadas para minimizar los desechos y aprovechar el potencial de los residuos como recurso. Un enfoque integrado que considere las variaciones regionales y factores socioeconómicos puede ayudar a abordar este desafío cre
El documento habla sobre la necesidad de resumir documentos de forma concisa en 3 oraciones o menos para ofrecer la información clave. Explica que un buen resumen debe identificar la idea principal y los detalles más importantes de manera breve y clara.
El documento describe varios resúmenes de documentos en 3 oraciones o menos. Resume la información sobre un documento que habla sobre la generación de resúmenes automáticos de textos mediante el aprendizaje profundo y las redes neuronales recurrentes. Explica que el modelo puede generar resúmenes concisos que capturan la información clave del documento original en pocas oraciones.
Este documento discute tres puntos principales: 1) La importancia de resumir documentos de manera concisa para ofrecer la información clave, 2) Cómo los resúmenes deben identificar las ideas fundamentales y de alto nivel, 3) La necesidad de comenzar resúmenes con una oración introductoria.
1. El documento describe un proyecto de investigación que analiza el impacto de la inteligencia artificial en el futuro del trabajo.
2. El estudio examina cómo la automatización podría afectar diferentes ocupaciones y sectores económicos, y desarrolla escenarios sobre cómo podrían cambiar los puestos de trabajo.
3. El objetivo final es comprender mejor cómo la inteligencia artificial transformará el mundo laboral y qué habilidades serán más demandadas, a fin de guiar las políticas educativas y de capacitación laboral.
1. El documento describe un proyecto de investigación que analiza el impacto de la inteligencia artificial en el futuro del trabajo.
2. El estudio examina cómo la automatización podría afectar diferentes ocupaciones y sectores económicos, y desarrolla escenarios sobre cómo podrían cambiar los puestos de trabajo.
3. El objetivo final es comprender mejor cómo la inteligencia artificial transformará el mundo laboral y qué habilidades serán más demandadas, a fin de guiar las políticas públicas y la educación para preparar a la fuerza laboral.
1. El documento describe un proyecto de investigación que analiza el impacto de la inteligencia artificial en el futuro del trabajo.
2. El estudio examina cómo la automatización podría afectar diferentes ocupaciones y sectores económicos, y busca comprender mejor cómo podrían cambiar los requisitos laborales.
3. El objetivo final es generar recomendaciones de políticas públicas para facilitar la transición laboral y asegurar que los beneficios de la tecnología se distribuyan de manera justa.
1. El documento describe un proyecto de investigación que analiza el impacto de la inteligencia artificial en el futuro del trabajo.
2. El estudio examina cómo la automatización podría afectar diferentes ocupaciones y sectores económicos, y busca comprender mejor cómo podrían cambiar los requisitos laborales.
3. El objetivo final es generar recomendaciones de políticas públicas para apoyar a los trabajadores a lo largo de la transición hacia trabajos del futuro.
1. El documento describe un proyecto de investigación que analiza el impacto de la inteligencia artificial en el futuro del trabajo.
2. El estudio examina cómo la automatización podría afectar diferentes ocupaciones y sectores económicos, y busca comprender mejor cómo podrían cambiar los requisitos laborales.
3. El objetivo final es generar recomendaciones de políticas públicas para facilitar la transición laboral y asegurar que los beneficios de la tecnología se distribuyan de manera justa.
1. El documento describe un proyecto de investigación que analiza el impacto de la inteligencia artificial en el futuro del trabajo.
2. El estudio examina cómo la automatización podría afectar diferentes ocupaciones y sectores económicos, y busca comprender mejor cómo podrían cambiar los requisitos laborales.
3. El objetivo final es generar recomendaciones de políticas públicas para apoyar a los trabajadores a lo largo de la transición hacia trabajos del futuro.
El documento describe los desafíos de la inteligencia artificial y la automatización para el futuro del trabajo. Discuten tres puntos principales: 1) la IA y la automatización eliminarán muchos puestos de trabajo tradicionales, 2) se crearán nuevos tipos de empleos que requerirán nuevas habilidades, y 3) se necesitarán políticas y programas de capacitación para ayudar a los trabajadores afectados a adaptarse a los cambios.
1. El documento describe varios grupos étnicos que utilizan sustancias psicoactivas como parte de sus prácticas culturales y religiosas, incluidas plantas de los géneros Salvia y Peganum.
2. Estas sustancias se usan tradicionalmente para fines espirituales, medicinales y rituales, pero su uso plantea complejidades debido a las diferencias entre las culturas étnicas y las leyes y políticas.
3. Se discuten varios enfoques para abordar el uso cultural de sustancias controladas, incluid
Inteligencia Emocional Daniel Goleman Kairos DG1 Ccesa007.pdfDemetrio Ccesa Rayme
1. El documento describe una reunión en la que se discutieron varios temas relacionados con el desarrollo económico y social de una región.
2. Se debatieron cuestiones como la creación de empleo, la educación, la infraestructura y el apoyo a pequeñas empresas.
3. Los participantes acordaron medidas para impulsar el crecimiento económico de forma sostenible e inclusiva.
1. El documento describe una reunión en la que se discutieron varios temas relacionados con el desarrollo económico y social de una región.
2. Se debatieron cuestiones como la creación de empleo, la educación, la infraestructura y el apoyo a pequeñas empresas.
3. Los participantes acordaron medidas para impulsar el crecimiento económico de forma sostenible e inclusiva.
Este documento presenta un programa de habitación especializado para 2017. El programa está disponible en 33 estados y ofrece cobertura de responsabilidad general de $1 millón a $3 millones con agregados anuales de $2 millón a $4 millón. También incluye una división de vivienda con programas especiales en instalaciones residenciales.
Similar a 8085 instruction set and addressing modes (20)
The instruction set of the 8086 microprocessor can be classified into several groups, including data transfer instructions, arithmetic instructions, and processor control instructions. The data transfer instructions include general purpose instructions to move bytes or words between registers and memory locations. Common instructions are MOV, PUSH, POP, and XCHG. The arithmetic instructions perform operations like addition, subtraction, and comparison and affect the processor's flags. Common instructions are ADD, SUB, INC, and CMP. The 8086 instruction set also includes instructions for bit manipulation, string operations, and transferring program execution.
The 8086 microprocessor was Intel's first 16-bit microprocessor released in 1978. It had a 16-bit data bus and 20-bit address bus, allowing it to access up to 1 megabyte of memory. The 8086's CPU was divided into two units - the Bus Interface Unit which handled external bus operations, and the Execution Unit which decoded instructions and performed computations. It had four general purpose 16-bit registers, four 16-bit segment registers, and other registers including the instruction pointer and flag register.
Interrupts on 8086 microprocessor by vijay kumar.kVijay Kumar
The document discusses interrupts in microprocessors. It defines an interrupt as a signal used to halt normal program execution and divert processing to an interrupt service routine (ISR). There are three main types of interrupts: hardware interrupts from external signals, software interrupts from an INT instruction, and error interrupts from issues like divide-by-zero. When an interrupt occurs, the processor pushes registers onto the stack, loads the ISR address from the interrupt vector table, executes the ISR, then pops registers and returns to the main program. Interrupts provide efficient handling of asynchronous events compared to polling.
Assembly language represents machine-level instructions in a symbolic and more understandable form. It provides knowledge of how a processor executes instructions and accesses data. While requiring less memory and execution time, assembly language allows hardware-specific tasks and is suitable for time-critical jobs. The processor executes programs by fetching, decoding, and executing instructions, accessing data through memory addresses. It stores multi-byte data in reverse order and uses absolute or segment addresses.
The instruction loads the contents of the accumulator into the memory location pointed to by the register pair and loads the contents of the next memory location into the register pair. It specifies the box border address and the high border address in the third and fourth bytes. The contents of the i and j registers are not affected. This is a two-byte instruction, the second byte specifies the box border address and the third byte specifies the high border address.
8085 microprocessor Architecture and pin description Vijay Kumar
The document provides information about the Intel 8085 microprocessor, which was an 8-bit microprocessor introduced in 1976. It has 16 address lines and 8 data lines, allowing it to access 64KB of memory. It provides registers like the accumulator, flag register, and general purpose registers. It operates at a clock frequency of 3MHz and requires a +5V power supply. The 8085 has features like interrupts, serial I/O lines, and the ability to interface with external devices. It was available in a 40-pin DIP package.
8085 microprocessor Architecture and Pin description Vijay Kumar
The 8085 microprocessor is an 8-bit CPU introduced in 1976. It has 16 address lines allowing access to 64KB of memory. It has 8 data lines that are multiplexed with the lower 8 address lines, requiring external hardware to separate them. The 8085 has registers including an accumulator, flag register, and 6 general purpose registers. It supports interrupts and direct memory access. The document provides details on the 8085 architecture, instruction set, pinouts, and bus structure.
This document summarizes the instruction set of the 8086 processor. It includes data transfer, logical, shift/rotate, arithmetic, transfer, string, loop control, subroutine/interrupt, flag manipulation, and inactive state instructions. The instruction set supports operations on bytes, words, and double words including loading, storing, comparing, exchanging, and arithmetic/logical operations on data and addresses in registers and memory.
Input devices bring information into a computer system and allow users to communicate with it. Common input devices include keyboards, mice, scanners, digital cameras, microphones, and touch screens. Output devices display or present information from the computer to users. Common output devices are monitors, printers, speakers, and plotters, which allow users to see, hear, and print computer data and graphics. Together, input and output devices enable two-way interaction between users and computer systems.
Microprocessors evolution introduction to microprocessorVijay Kumar
This document provides an introduction to microprocessors, including definitions of basic terms, classifications of microprocessors, memory units, input and output devices, and how technology has improved microprocessors over generations. It discusses the origin of microprocessors and how they have evolved from 4-bit processors in the first generation to 64-bit processors today. The document also summarizes different types of microprocessors like general purpose, microcontrollers, and special purpose processors.
This document discusses different types of computer memory. It describes primary or main memory, which includes random access memory (RAM) and read only memory (ROM). RAM is further divided into static RAM and dynamic RAM. ROM includes programmable ROM, erasable programmable ROM, and electrically erasable programmable ROM. The document also discusses cache memory, secondary memory, magnetic and optical storage media, and the memory hierarchy in computing.
Computer memory can be divided into internal and external memory. Internal memory includes cache and main memory, while external memory includes magnetic disks and optical disks. Memory types include RAM, ROM, SRAM, DRAM, PROM, EPROM, and EEPROM. RAM is volatile and used for main memory, while ROM is non-volatile and used to store permanent instructions. Cache memory is very fast memory between the CPU and main memory used to store frequently accessed data and instructions from main memory. Virtual memory allows programs to exceed physical memory size by storing unused portions on external memory.
The microprocessor has enabled incredible technological advancements over the past 40 years. It is found in millions of devices but often goes unrecognized for its contributions. Examples of early devices that benefited from microprocessors include calculators in the early 1970s, home computers and laptops in the late 1970s and 1980s, arcade games in the 1980s, and smartphones in the 1990s. More recent devices such as tablets, MP3 players, digital signs, Ultrabooks, and many more rely on increasingly powerful microprocessors.
Origin of Microprocessor and Classification of Microprocessor Vijay Kumar
This Presentation have information about the topics are
Microprocessors evolution,
Introduction to 8085,
Basic terms,
Types of Processors,
Microprocessor Based System,
Origin of Microprocessor,
Classification of Microprocessor,
Memory,
Input and Output Devices and
Technological Improvements on Microprocessor.
Embedded System Real Time Operating System (ERTS) I unit by vijayVijay Kumar
The document discusses embedded systems and provides examples. It defines embedded systems as electronic systems designed to perform specific functions and consisting of both hardware and software. A key early example was the Apollo Guidance Computer, which automatically controlled the Apollo spacecraft. The document also outlines common applications of embedded systems, components like sensors and microcontrollers, and functions like data processing and control.
Microcontroller (8051) by K. Vijay KumarVijay Kumar
The document provides an overview of microprocessors and microcontrollers. It discusses why they are needed in modern devices and some key components like the CPU, memory, I/O ports, and timers. The document then compares microprocessors and microcontrollers, noting that microcontrollers have these components integrated onto a single chip, making them well-suited for applications where cost, power and space are priorities. It also provides details on the 8051 microcontroller, including its memory architecture, I/O ports, and special function registers.
The document discusses the 8051 microcontroller. It begins by explaining why we need to learn about microprocessors and microcontrollers, noting that many modern devices are controlled by them. It then covers the basic components of a microprocessor/controller including the CPU, I/O, memory, timers, and interrupts. The rest of the document provides details on the 8051 microcontroller, including its architecture, memory structure, registers, ports and other features. It compares microprocessors and microcontrollers, and discusses how to choose between different microcontroller options for embedded systems.
The document provides information on various communication interfaces used in embedded and real-time systems, including RS-232, RS-422, RS-485, USB, and infrared. It discusses the need for standard communication interfaces in embedded systems to exchange data with other devices or networks. It then describes several serial communication standards and protocols, highlighting their features, limitations, and how they enable communication between embedded devices.
Embedded real time-systems communicationVijay Kumar
The document discusses communication interfaces for embedded systems. It provides reasons why embedded systems require communication interfaces, such as to send data to a host for analysis or to communicate with other embedded systems. Common interface standards discussed include RS-232, which defines serial communication electrical characteristics and connectors, and RS-422, which uses balanced differential signaling for longer transmission distances. A UART (Universal Asynchronous Receiver/Transmitter) is used to convert between parallel and serial formats and works with these standards, sometimes requiring a level shifter to meet voltage requirements. Limitations of RS-232 include high power consumption and limited noise immunity/distance due to single-ended signaling.
8086 Interrupts & With DOS and BIOS by vijayVijay Kumar
This document discusses interrupts in microprocessors and provides examples of their use. It defines an interrupt as an event that temporarily halts normal program execution to service another event, like an I/O device requiring attention. Interrupts provide an alternative to polling that allows a CPU to serve multiple devices simultaneously. The document then gives examples of using interrupts to control a robot's movement in response to sensors as compared to polling, and provides overviews of DOS and BIOS interrupts for I/O functions like reading keyboards, displaying to screens, and communicating with serial ports.
Presentación Aislante térmico.pdf Transferencia de calorGerardoBracho3
Las aletas de transferencia de calor, también conocidas como superficies extendidas, son prolongaciones metálicas que se adhieren a una superficie sólida para aumentar su área superficial y, en consecuencia, mejorar la tasa de transferencia de calor entre la superficie y el fluido circundante.
ESPERAMOS QUE ESTA INFOGRAFÍA SEA UNA HERRAMIENTA ÚTIL Y EDUCATIVA QUE INSPIRE A MÁS PERSONAS A ADENTRARSE EN EL APASIONANTE CAMPO DE LA INGENIERÍA CIVIŁ. ¡ACOMPAÑANOS EN ESTE VIAJE DE APRENDIZAJE Y DESCUBRIMIENTO
2. r r § ¥ ¥ £ ¤ s t r ¥ ¡ ¢
x
E 6 % U ! # $ % ' $ ! ( ( 2 ) S % ( 5 % ) Q ) # $ ( ( S % ) $ ( ) 3 ) $ ) 7
x
Q $ ( 3 ( 2 # S ' ! 2 U ! 5 $ 3 ) $ ) $ ( 0 ( S % ) $ 3 0 U $ ! # $ % ' $ ! ( ! # ' ) 1 1 3
@ 3 3 % # # ! 5 7
x
) # $ 2 ( 1 1 ( 4 ! 5 3 ! 2 2 % $ $ U S # ( 2 ) 3 3 % # # ! 5 7
8
7 F Q Q 3 ! ) $ @ 3 3 % # # ! 5
a 7 9 ! % ' $ @ 3 3 % # # ! 5
d
7 A 5 ! # $ % @ 3 3 % # # ! 5
c 7 A 5 ! # $ % F 3 ! % ' $ @ 3 3 % # # ! 5
7 F Q S 1 ! 3 @ 3 3 % # # ! 5
8
7 F Q Q 3 ! ) $ @ 3 3 % # # ! 5 P
x
F ! Q Q 3 ! ) $ ) 3 3 % # # ! 5 Q ( 3 Y $ 3 ) $ ) ! # # S ' ! 2 ! 3 ! $ ! # $ % ' $ ! ( ! $ # 1 2 7
3 ) $ ) 4 ! 1 1 0 ) S ) % $ ( 2 $ S % ( 5 % ) Q ! # $ % ' $ ! ( 7
x
E h 7 X b F ` Y
d
E V i X ( 6 $ 3 ) $ )
d
E V 5 ! 6 ! $ ! # $ % ' $ ! ( $ ( ` % 5 ! # $ % u e h F
C q Y a v V 7
a 7 9 ! % ' $ @ 3 3 % # # ! 5 P
x
F 3 ! % ' $ ) 3 3 % # # ! 5 Q ( 3 Y $ ) 3 3 % # # ( 2 $ 3 ) $ ) ! # # S ' ! 2 ! 3 ! $ ! # $ % ' $ ! ( 7
3 ) $ ) 4 ! 1 1 0 ! Q Q ( % U 7 F $ ! # ) 3 3 % # # ! 5 Q ( 3 Y $ S % ( 5 % ) Q ! # $ % ' $ ! ( # ) 3 3 ) $ )
' ) 0 # $ ( % 3 ! 3 ! 2 2 % $ Q Q ( % U 7
x
E h 7 e 9 @
8
V i e ( ) 3 $ 3 ) $ ) ) 6 ) ! 1 ) 0 1 ! Q Q ( % U 1 ( ' ) $ ! (
8
V ! $ (
) ' ' Q 1 ) $ ( % u C V e 9
d
V
d
7 A 5 ! # $ % @ 3 3 % # # ! 5 P
x
F % 5 ! # $ % ) 3 3 % # # ! 5 Q ( 3 Y $ ! # $ % ' $ ! ( # S ' ! 2 ! # $ ) Q ( 2 $ % 5 ! # $ % !
4 ! ' $ 3 ) $ ) ! # ) 6 ) ! 1 ) 0 1 7
x
E h 7 X I b @ Y ` i X ( 6 $ ' ( $ $ ( 2 ` % 5 ! # $ % $ ( @ % 5 ! # $ % u C q V e u @ 9 9 H 7
c 7 A 5 ! # $ % F 3 ! % ' $ @ 3 3 % # # ! 5 P
x
F % 5 ! # $ % ! 3 ! % ' $ ) 3 3 % # # ! 5 Q ( 3 Y $ ! # $ % ' $ ! ( # S ' ! 2 ! # $ ) Q ( 2 $
% 5 ! # $ % ! 4 ! ' $ ) 3 3 % # # ( 2 $ 3 ) $ ) ! # ) 6 ) ! 1 ) 0 1 7 V % $ 3 ) $ ) 4 ! 1 1 0 !
Q Q ( % U ) 3 $ ) 3 3 % # # 4 ! 1 1 0 ! $ % 5 ! # $ % S ) ! % 7
x
E h 7 X I b @ Y X i Q Q ( % U 3 ) $ ) ) 3 3 % # # 3 0 U V e S ) ! % ! # Q ( 6 3 $ ( @ % 5 ! # $ % 7
e 9 @ h ` 7
7 F Q S 1 ! 3 @ 3 3 % # # ! 5 P
x
F ! Q S 1 ! 3 ) 3 3 % # # ! 5 Q ( 3 Y $ ! # $ % ' $ ! ( ! $ # 1 2 # S ' ! 2 ! # $ 3 ) $ ) $ ( 0 ( S % ) $ 3 7
x
E h 7 H X @ i H ( Q S 1 Q $ $ ' ( $ $ ( 2 ) ' ' Q 1 ) $ ( % u A @ e
3. I S ' ( 3 I S % ) 3
E W S 1 ) ) $ ! ( ( 2
F # $ % ' $ ! (
9 # ' % ! S $ ! (
X I b
A 3 Y A #
X Y A #
A 3 Y X
w x y € ‚ x ƒ
„
x … ‚ † ‡ ˆ ‰
„ ‘
x
’
‡
„ ‘ “ ” • ‘ “
x
”
ˆ ‰
’
– —
“ „ “ ” „ ‘
‚ … †
‘ “
x
”
† x y
“
‡
„ ‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
„
x … ‚ † ‡
‚ ‡ ˜
“ „ ‘
‡ ‚
“ ” ‘
x
‘
—
‡
’
‡
„ ‘ “ ” • ‘ “
x
”
‚ ‡ ˜
“ „ ‘
‡ ‚ ™
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
„
x … ‚ † ‡ ‚ ‡ ˜
“ „ ‘
‡ ‚
•
‚ ‡
”
x
‘ • d ‘
‡ ‚ ‡
’ e f
x
”
‡ x
‘
—
‡ x y ‡ ‚
• ”
’
„ “ „
•
ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
” g “ ‘ „ d
x †
• ‘ “
x
” “ „ „
y ‡ †
“
“
‡
’ h
€
‘
—
‡
† x
” ‘
‡
” ‘ „
x
‘
—
‡ i j ‚ ‡ ˜
“ „ ‘
‡ ‚
„
e
E W ) Q S 1 P X I b ` Y H ( % X I b ` Y X
X b F
A 3 Y 3 ) $ )
X Y 3 ) $ )
k
x l ‡
“
ƒ ƒ ‡
’
“ • ‘
‡ m n
h
“ ‘
– —
‡ m n
h
“ ‘
’
• ‘ • “ „ „ ‘
x ‚ ‡
’
“ ” ‘
—
‡
’
‡
„ ‘ “ ” • ‘ “
x
”
‚ ‡ ˜
“ „ ‘
‡ ‚ x ‚
ƒ ‡ ƒ x ‚ €
e f
‘
—
‡ x y ‡ ‚
• ”
’
“ „ •
ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
” g “ ‘ „
d
x †
• ‘ “
x
” “ „ „
y ‡ †
“
“
‡
’ h
€
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡ i j
‚ ‡ ˜
“ „ ‘
‡ ‚
„
e
E W ) Q S 1 P X b F ` Y v V ( % X b F X Y v V
e 9 @
8 o
i 0 ! $
) 3 3 % # #
j x
•
’
•
† † … ƒ …
d • ‘
x ‚
– —
‡ † x
” ‘
‡
” ‘ „
x
•
ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
” g „
y ‡ †
“
“
‡
’ h
€
• p q
n
h
“ ‘ •
’ ’
‚ ‡
„ „ “ ” ‘
—
‡ x y ‡ ‚
• ”
’
g •
‚ ‡ † x y
“
‡
’
‘
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
e
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
„
x … ‚ † ‡
•
‚ ‡
”
x
‘ • d ‘
‡ ‚ ‡
’ e
E W ) Q S 1 P e 9 @ a
d
c V
e 9 @ h
` r 9 A 5 7
S ) ! %
j x
•
’
•
† † … ƒ …
d • ‘
x ‚
“ ”
’
“
‚ ‡ †
‘
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
’
‡
„ “
˜
” • ‘
‡
’
‚ ‡ ˜
“ „ ‘
‡ ‚ y
• “
‚ y x
“ ” ‘ ‘
x
•
ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
”
e
– —
“ „ “ ” „ ‘
‚ … †
‘ “
x
”
† x y
“
‡
„ ‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
• ‘
ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
” “ ” ‘
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
e
– —
‡
† x
” ‘
‡
” ‘ „
x ‡
“ ‘
—
‡ ‚
‘
—
‡ ‚ ‡ ˜
“ „ ‘
‡ ‚ y
• “
‚ x ‚
‘
—
‡ ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
” •
‚ ‡
”
x
‘ • d ‘
‡ ‚ ‡
’ e
E W ) Q S 1 P e 9 @ h `
e h F
A 5 7 S ) ! % Y
8 o
i 0 ! $ 3 ) $ )
j x
•
’
‚ ‡ ˜
“ „ ‘
‡ ‚ y
• “
‚
“
ƒ ƒ ‡
’
“ • ‘
‡
– —
‡
“ ” „ ‘
‚ … †
‘ “
x
” d
x
•
’
„ p q
n
h
“ ‘
’
• ‘ • “ ” ‘
—
‡ ‚ ‡ ˜
“ „ ‘
‡ ‚ y
• “
‚
’
‡
„ “
˜
” • ‘
‡
’
“ ” ‘
—
‡ x y ‡ ‚
• ”
’ e
s W ) Q S 1 P e h F V Y a
d
c V ( % e h F V Y h t u
e V e 9
8 o
i 0 ! $
) 3 3 % # #
j x
•
’
i
• ”
’
j
‚ ‡ ˜
“ „ ‘
‡ ‚
„
’
“
‚ ‡ †
‘
– —
‡
“ ” „ ‘
‚ … †
‘ “
x
”
† x y
“
‡
„ ‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡ ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
”
y x
“ ” ‘
‡
’
x …
‘
h
€
‘
—
‡
p q
n
h
“ ‘ •
’ ’
‚ ‡
„ „ “ ” ‘
x ‚ ‡ ˜
“ „ ‘
‡ ‚
j
• ”
’
† x y
“
‡
„ ‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
”
‡ v
‘
ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
”
“ ” ‘
x ‚ ‡ ˜
“ „ ‘
‡ ‚ i
e
– —
‡ † x
” ‘
‡
” ‘ „
x
„
x … ‚ † ‡ ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
” „ •
‚ ‡
”
x
‘ • d ‘
‡ ‚ ‡
’ e
E W ) Q S 1 P e V e 9 a c V
4. C @
8 o
i 0 ! $
) 3 3 % # #
p q
n
h
“ ‘ •
’ ’
‚ ‡
„ „
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
•
‚ ‡ † x y
“
‡
’
“ ” ‘
x
‘
—
‡
ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
” „
y ‡ †
“
“
‡
’ h
€
‘
—
‡ x y ‡ ‚
• ”
’ e
– —
“ „ “ „ • w
n
h
€
‘
‡
“ ” „ ‘
‚ … †
‘ “
x
” g ‘
—
‡
„
‡ † x
”
’ h
€
‘
‡
„
y ‡ †
“
“
‡
„ ‘
—
‡
d
x x n
x ‚
’
‡ ‚
•
’ ’
‚ ‡
„ „ • ”
’
‘
—
‡
‘
—
“
‚
’ h
€
‘
‡
„
y ‡ †
“
“
‡
„ ‘
—
‡
—
“
˜
—
n
x ‚
’
‡ ‚
•
’ ’
‚ ‡
„ „
e
E W ) Q S 1 P C @ c
d
V
C @ h A 5 7 S ) ! % y
‘
x ‚ ‡
•
† † … ƒ …
d • ‘
x ‚
“ ”
’
“
‚ ‡ †
‘
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
•
‚ ‡ † x y
“
‡
’
“ ” ‘
x
‘
—
‡
ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
” „
y ‡ †
“
“
‡
’ h
€
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
x y ‡ ‚
• ”
’
ˆ ‚ ‡ ˜
“ „ ‘
‡ ‚ y
• “
‚
e
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
•
‚ ‡
”
x
‘ • d ‘
‡ ‚ ‡
’ e
E W ) Q S 1 P C @ h `
C V e 9
8 o
i 0 ! $
) 3 3 % # #
y
‘
x ‚ ‡ i
• ”
’
j
‚ ‡ ˜
“ „ ‘
‡ ‚
„
’
“
‚ ‡ †
‘
– —
‡ † x
” ‘
‡
” ‘ „
x ‚ ‡ ˜
“ „ ‘
‡ ‚ j
•
‚ ‡
„ ‘
x ‚ ‡
’
“ ” ‘
x
‘
—
‡ ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
” „
y ‡ †
“
“
‡
’ h
€
‘
—
‡
p q
n
h
“ ‘ •
’ ’
‚ ‡
„ „ “ ” ‘
—
‡ x y ‡ ‚
• ”
’
• ”
’
‘
—
‡ † x
” ‘
‡
” ‘ „
x i ‚ ‡ ˜
“ „ ‘
‡ ‚
•
‚ ‡
„ ‘
x ‚ ‡
’
“ ” ‘
x
‘
—
‡
”
‡ v
‘
ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
”
h
€
“ ”
† ‚ ‡ ƒ ‡
” ‘ “ ”
˜
‘
—
‡ x y ‡ ‚
• ”
’ e
– —
‡
† x
” ‘
‡
” ‘ „
x ‚ ‡ ˜
“ „ ‘
‡ ‚
„
i j
•
‚ ‡
”
x
‘ • d ‘
‡ ‚ ‡
’ e
– —
“ „ “ „ • w
n
h
€
‘
‡
“ ” „ ‘
‚ … †
‘ “
x
” g ‘
—
‡
„
‡ † x
”
’ h
€
‘
‡
„
y ‡ †
“
“
‡
„ ‘
—
‡
d
x x n
x ‚
’
‡ ‚
•
’ ’
‚ ‡
„ „ • ”
’
‘
—
‡
‘
—
“
‚
’ h
€
‘
‡
„
y ‡ †
“
“
‡
„ ‘
—
‡
—
“
˜
—
n
x ‚
’
‡ ‚
•
’ ’
‚ ‡
„ „
e
E W ) Q S 1 P C V e 9 a c v V
h H V f (
s
v †
—
• ”
˜ ‡ i
• ”
’
j
x
“ ‘
— z
• ”
’
s
– —
‡ † x
” ‘
‡
” ‘ „
x ‚ ‡ ˜
“ „ ‘
‡ ‚ i
•
‚ ‡ ‡ v †
—
• ”
˜ ‡
’
x
“ ‘
—
‘
—
‡
† x
” ‘
‡
” ‘ „
x ‚ ‡ ˜
“ „ ‘
‡ ‚
z
g • ”
’
‘
—
‡ † x
” ‘
‡
” ‘ „
x ‚ ‡ ˜
“ „ ‘
‡ ‚ j
•
‚ ‡ ‡ v †
—
• ”
˜ ‡
’
x
“ ‘
—
‘
—
‡ † x
” ‘
‡
” ‘ „
x ‚ ‡ ˜
“ „ ‘
‡ ‚
s
e
E W ) Q S 1 P h H V f
C q V e (
w x y € i
• ”
’
j
‚ ‡ ˜
“ „ ‘
‡ ‚
„ ‘
x
‘
—
‡
„ ‘ •
† {
y x
“ ” ‘
‡ ‚
– —
‡
“ ” „ ‘
‚ … †
‘ “
x
” d
x
•
’
„ ‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡ i
• ”
’
j
‚ ‡ ˜
“ „ ‘
‡ ‚
„ “ ” ‘
x
‘
—
‡
„ ‘ •
† { y x
“ ” ‘
‡ ‚ ‚ ‡ ˜
“ „ ‘
‡ ‚
g ‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡ i ‚ ‡ ˜
“ „ ‘
‡ ‚
y ‚ x l
“
’
‡
‘
—
‡
—
“
˜
—
n x ‚
’
‡ ‚
•
’ ’
‚ ‡
„ „ • ”
’
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
j ‚ ‡ ˜
“ „ ‘
‡ ‚ y ‚ x l
“
’
‡
‘
—
‡
d
x x n x ‚
’
‡ ‚
•
’ ’
‚ ‡
„ „
e
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡ i
• ”
’
j ‚ ‡ ˜
“ „ ‘
‡ ‚
„ •
‚ ‡
”
x
‘ • d ‘
‡ ‚ ‡
’ e
E W ) Q S 1 P C q V e
h V e (
s
v †
—
• ”
˜ ‡ i
• ”
’
j
x
“ ‘
—
‘
x y x
„ ‘ •
† {
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡ j ‚ ‡ ˜
“ „ ‘
‡ ‚
•
‚ ‡ ‡ v †
—
• ”
˜ ‡
’
x
“ ‘
—
‘
—
‡
„ ‘ •
† {
d
x †
• ‘ “
x
”
y x
“ ” ‘
‡
’
x …
‘
h
€
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
„ ‘ •
† {
y x
“ ” ‘
‡ ‚ ‚ ‡ ˜
“ „ ‘
‡ ‚
e
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡ i ‚ ‡ ˜
“ „ ‘
‡ ‚
•
‚ ‡
‡ v †
—
• ”
˜ ‡
’
x
“ ‘
—
‘
—
‡
”
‡ v
‘ „ ‘ •
† {
d
x †
• ‘ “
x
”
ˆ
y | }
p
™
—
x x ‡ l ‡ ‚
g ‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
„ ‘ •
† { y x
“ ” ‘
‡ ‚ ‚ ‡ ˜
“ „ ‘
‡ ‚
•
‚ ‡
”
x
‘ • d ‘
‡ ‚ ‡
’ e
5. E W ) Q S 1 P h V e
q G C V A 5 7 S ) ! % |
…
„
—
‚ ‡ ˜
“ „ ‘
‡ ‚ y
• “
‚
x
” ‘
x
„ ‘ •
† {
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡ ‚ ‡ ˜
“ „ ‘
‡ ‚ y
• “
‚
’
‡
„ “
˜
” • ‘
‡
’
“ ” ‘
—
‡
x y ‡ ‚
• ”
’
•
‚ ‡ † x y
“
‡
’
x
” ‘
x
‘
—
‡
„ ‘ •
† {
“ ” ‘
—
‡ x
d d
x x
“ ”
˜
„
‡ ~ … ‡
”
† ‡
e
– —
‡
„ ‘ •
† { y x
“ ” ‘
‡ ‚ ‚ ‡ ˜
“ „ ‘
‡ ‚
“ „
’
‡ † ‚ ‡ ƒ ‡
” ‘
‡
’
• ”
’
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
—
“
˜
—
x ‚
’
‡ ‚ ‚ ‡ ˜
“ „ ‘
‡ ‚ ˆ
g
z
g
i
g €
•
‚ ‡ † x y
“
‡
’
“ ” ‘
x
‘
—
• ‘ d
x †
• ‘ “
x
”
e
– —
‡
„ ‘ •
† { y x
“ ” ‘
‡ ‚ ‚ ‡ ˜
“ „ ‘
‡ ‚
“ „
’
‡ † ‚ ‡ ƒ ‡
” ‘
‡
’
•
˜
• “ ” • ”
’
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
d
x x n x ‚
’
‡ ‚
‚ ‡ ˜
“ „ ‘
‡ ‚ ˆ w
g
s
g
j
g
d •
˜
„ •
‚ ‡ † x y
“
‡
’
‘
x
‘
—
• ‘ d
x †
• ‘ “
x
”
e
E W ) Q S 1 P q G C V ` ( % q G C V @
q I q A 5 7 S ) ! % |
x y x
„ ‘ •
† {
‘
x
‚ ‡ ˜
“ „ ‘
‡ ‚ y
• “
‚
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡ ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
”
y x
“ ” ‘
‡
’
x …
‘
h
€
‘
—
‡
„ ‘ •
† { y x
“ ” ‘
‡ ‚ ‚ ‡ ˜
“ „ ‘
‡ ‚
•
‚ ‡ † x y
“
‡
’
‘
x
‘
—
‡
d
x x n x ‚
’
‡ ‚
‚ ‡ ˜
“ „ ‘
‡ ‚ ˆ w
g
s
g
j
g „ ‘ • ‘
…
„
d •
˜
„
x
‘
—
‡ x y ‡ ‚
• ”
’ e
– —
‡
„ ‘ •
† {
y x
“ ” ‘
‡ ‚
“ „ “ ”
† ‚ ‡ ƒ ‡
” ‘
‡
’ h
€
p • ”
’
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
• ‘
ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
” •
‚ ‡ † x y
“
‡
’
‘
x
‘
—
‡
—
“
˜
—
n x ‚
’
‡ ‚ ‚ ‡ ˜
“ „ ‘
‡ ‚
ˆ
g
z
g
i
g €
x
‘
—
‡ x y ‡ ‚
• ”
’ e
– —
‡
„ ‘ •
† { y x
“ ” ‘
‡ ‚ ‚ ‡ ˜
“ „ ‘
‡ ‚
“ „ •
˜
• “ ” “ ”
† ‚ ‡ ƒ ‡
” ‘
‡
’ h
€
p
e
E W ) Q S 1 P q I q V ( % q I q @
I G
i 0 ! $ S ( % $
) 3 3 % # #
…
‘
y …
‘
’
• ‘ •
‚ x ƒ
•
† † … ƒ …
d • ‘
x ‚
‘
x
•
y x ‚
‘
x
“ ‘
—
m n
h
“ ‘
•
’ ’
‚ ‡
„ „
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
•
‚ ‡ † x y
“
‡
’
“ ” ‘
x
‘
—
‡
f ‚
y x ‚
‘ „
y ‡ †
“
“
‡
’ h
€
‘
—
‡ x y ‡ ‚
• ”
’ e
E W ) Q S 1 P I G D V
F B
i 0 ! $ S ( % $
) 3 3 % # #
f
”
y …
‘
’
• ‘ • ‘
x
•
† † … ƒ …
d • ‘
x ‚ ‚ x ƒ
•
y x ‚
‘
x
“ ‘
—
m n
h
“ ‘
•
’ ’
‚ ‡
„ „
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
“ ”
y …
‘
y x ‚
‘
’
‡
„ “
˜
” • ‘
‡
’
“ ” ‘
—
‡
x y ‡ ‚
• ”
’
•
‚ ‡ ‚ ‡
•
’
• ”
’
d
x
•
’
‡
’
“ ” ‘
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
e
E W ) Q S 1 P F B H V
I S ' ( 3 I S % ) 3
E W S 1 ) ) $ ! ( ( 2
F # $ % ' $ ! (
9 # ' % ! S $ ! (
@ 9 9
A
X
€
’ ’
‚ ‡ ˜
“ „ ‘
‡ ‚ x ‚
ƒ ‡ ƒ x ‚ €
g ‘
x
•
† † … ƒ …
d • ‘
x ‚
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡ x y ‡ ‚
• ”
’
ˆ ‚ ‡ ˜
“ „ ‘
‡ ‚ x ‚ ƒ ‡ ƒ x ‚ €
•
‚ ‡
•
’ ’
‡
’
‘
x
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
• ”
’
‘
—
‡ ‚ ‡
„
…
d ‘ “ „
„ ‘
x ‚ ‡
’
“ ” ‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
e f
‘
—
‡ x y ‡ ‚
• ”
’
“ „ •
ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
” g “ ‘ „ d
x †
• ‘ “
x
” “ „ „
y ‡ †
“
“
‡
’ h
€
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
i j ‚ ‡ ˜
“ „ ‘
‡ ‚
„
e
€ d d
d •
˜
„ •
‚ ‡ ƒ x
’
“
“
‡
’
‘
x ‚ ‡
d
‡ †
‘ ‘
—
‡ ‚ ‡
„
…
d ‘
x
‘
—
‡
•
’ ’
“ ‘ “
x
”
e
E W ) Q S 1 P @ 9 9 ` ( % @ 9 9 X
@ 9 H
A
€
’ ’
‚ ‡ ˜
“ „ ‘
‡ ‚
‘
x
•
† † … ƒ …
d • ‘
x ‚ x
“ ‘
—
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡ x y ‡ ‚
• ”
’
ˆ ‚ ‡ ˜
“ „ ‘
‡ ‚ x ‚ ƒ ‡ ƒ x ‚ €
• ”
’
k
‘
—
‡ w
•
‚ ‚ €
d •
˜
•
‚ ‡
•
’ ’
‡
’
‘
x
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
6. X
†
•
‚ ‚ €
•
† † … ƒ …
d • ‘
x ‚
• ”
’
‘
—
‡ ‚ ‡
„
…
d ‘ “ „ „ ‘
x ‚ ‡
’
“ ” ‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
e f
‘
—
‡ x y ‡ ‚
• ”
’
“ „ •
ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
” g “ ‘ „ d
x †
• ‘ “
x
” “ „ „
y ‡ †
“
“
‡
’
h
€
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡ i j ‚ ‡ ˜
“ „ ‘
‡ ‚
„
e
€ d d
d •
˜
„ •
‚ ‡ ƒ x
’
“
“
‡
’
‘
x ‚ ‡
d
‡ †
‘ ‘
—
‡ ‚ ‡
„
…
d ‘
x
‘
—
‡
•
’ ’
“ ‘ “
x
”
e
E W ) Q S 1 P @ 9 H ` ( % @ 9 H X
@ 9 F i 0 ! $ 3 ) $ )
€
’ ’
“
ƒ ƒ ‡
’
“ • ‘
‡
‘
x
•
† † … ƒ …
d • ‘
x ‚
– —
‡ m n
h
“ ‘
’
• ‘ •
ˆ x y ‡ ‚
• ”
’
“ „ •
’ ’
‡
’
‘
x
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
• ”
’
‘
—
‡ ‚ ‡
„
…
d ‘ “ „ „ ‘
x ‚ ‡
’
“ ” ‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
e
€ d d
d •
˜
„ •
‚ ‡ ƒ x
’
“
“
‡
’
‘
x ‚ ‡
d
‡ †
‘ ‘
—
‡ ‚ ‡
„
…
d ‘
x
‘
—
‡
•
’ ’
“ ‘ “
x
”
e
E W ) Q S 1 P @ 9 F c V
@ H F i 0 ! $ 3 ) $ )
€
’ ’
“
ƒ ƒ ‡
’
“ • ‘
‡
‘
x
•
† † … ƒ …
d • ‘
x ‚ x
“ ‘
—
†
•
‚ ‚ €
– —
‡ m n
h
“ ‘
’
• ‘ •
ˆ x y ‡ ‚
• ”
’
• ”
’
‘
—
‡ w
•
‚ ‚ €
d •
˜
•
‚ ‡
•
’ ’
‡
’
‘
x
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
• ”
’
‘
—
‡ ‚ ‡
„
…
d ‘ “ „ „ ‘
x ‚ ‡
’
“ ”
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
e
€ d d
d •
˜
„ •
‚ ‡ ƒ x
’
“
“
‡
’
‘
x ‚ ‡
d
‡ †
‘ ‘
—
‡
‚ ‡
„
…
d ‘
x
‘
—
‡
•
’ ’
“ ‘ “
x
”
e
E W ) Q S 1 P @ H F c V
e h F
A 5 7 S ) ! % Y
8 o
i 0 ! $ 3 ) $ )
j x
•
’
‚ ‡ ˜
“ „ ‘
‡ ‚ y
• “
‚
“
ƒ ƒ ‡
’
“ • ‘
‡
– —
‡
“ ” „ ‘
‚ … †
‘ “
x
” d
x
•
’
„ p q
n
h
“ ‘
’
• ‘ • “ ” ‘
—
‡ ‚ ‡ ˜
“ „ ‘
‡ ‚ y
• “
‚
’
‡
„ “
˜
” • ‘
‡
’
“ ” ‘
—
‡ x y ‡ ‚
• ”
’ e
s W ) Q S 1 P e h F V Y a
d
c V ( % e h F V Y h t u
9 @ 9 A 5 7 S ) ! %
€
’ ’
‚ ‡ ˜
“ „ ‘
‡ ‚ y
• “
‚
‘
x i
• ”
’
j
‚ ‡ ˜
“ „ ‘
‡ ‚
„
– —
‡
p q
n
h
“ ‘
† x
” ‘
‡
” ‘ „
x
‘
—
‡
„
y ‡ †
“
“
‡
’
‚ ‡ ˜
“ „ ‘
‡ ‚ y
• “
‚
•
‚ ‡
•
’ ’
‡
’
‘
x
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡ i j ‚ ‡ ˜
“ „ ‘
‡ ‚
• ”
’
‘
—
‡
„
… ƒ
“ „
„ ‘
x ‚ ‡
’
“ ” ‘
—
‡ i j ‚ ‡ ˜
“ „ ‘
‡ ‚
e
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
„
x … ‚ † ‡
‚ ‡ ˜
“ „ ‘
‡ ‚ y
• “
‚
•
‚ ‡
”
x
‘ • d ‘
‡ ‚ ‡
’ e f
‘
—
‡ ‚ ‡
„
…
d ‘ “ „ d •
‚ ˜ ‡ ‚
‘
—
• ” p q
h
“ ‘ „ g ‘
—
‡ w ƒ
d •
˜
“ „ „
‡
‘
e „
x x
‘
—
‡ ‚
d •
˜
„ •
‚ ‡
•
‡ †
‘
‡
’ e
E W ) Q S 1 P 9 @ 9 V
C G `
A
X
y
…
h
‘
‚
•
†
‘
‚ ‡ ˜
“ „ ‘
‡ ‚
x ‚ ƒ ‡ ƒ x ‚ € ‚ x ƒ
•
† † … ƒ …
d • ‘
x ‚
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡ x y ‡ ‚
• ”
’
ˆ ‚ ‡ ˜
“ „ ‘
‡ ‚ x ‚ ƒ ‡ ƒ x ‚ €
•
‚ ‡
„
…
h
‘
‚
•
†
‘
‡
’
‚ x ƒ
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
g • ”
’
‘
—
‡
‚ ‡
„
…
d ‘ “ „ „ ‘
x ‚ ‡
’
“ ” ‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
e f
‘
—
‡ x y ‡ ‚
• ”
’
“ „ •
ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
” g “ ‘ „ d
x †
• ‘ “
x
” “ „ „
y ‡ †
“
“
‡
’ h
€
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡ i j ‚ ‡ ˜
“ „ ‘
‡ ‚
„
e
€ d d
d •
˜
„ •
‚ ‡ ƒ x
’
“
“
‡
’
‘
x ‚ ‡
d
‡ †
‘ ‘
—
‡
‚ ‡
„
…
d ‘
x
‘
—
‡
„
…
h
‘
‚
•
†
‘ “
x
”
e
E W ) Q S 1 P C G ` ` ( % C G ` X
C ` `
A
X
y
…
h
‘
‚
•
†
‘ „
x … ‚ † ‡
• ”
’ h
x ‚ ‚ x x ‚ x ƒ
•
† † … ƒ …
d • ‘
x ‚
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡ x y ‡ ‚
• ”
’
ˆ ‚ ‡ ˜
“ „ ‘
‡ ‚ x ‚ ƒ ‡ ƒ x ‚ €
• ”
’
k
‘
—
‡ x ‚ ‚ x x
d •
˜
•
‚ ‡
„
…
h
‘
‚
•
†
‘
‡
’
‚ x ƒ
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
• ”
’
‘
—
‡ ‚ ‡
„
…
d ‘ “ „
y
d •
† ‡
’
“ ” ‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
e f
‘
—
‡ x y ‡ ‚
• ”
’
“ „ •
ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
” g “ ‘ „ d
x †
• ‘ “
x
” “ „ „
y ‡ †
“
“
‡
’
h
€
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡ i j ‚ ‡ ˜
“ „ ‘
‡ ‚
„
e
€ d d
d •
˜
„ •
‚ ‡ ƒ x
’
“
“
‡
’
‘
x ‚ ‡
d
‡ †
‘ ‘
—
‡ ‚ ‡
„
…
d ‘
x
‘
—
‡
„
…
h
‘
‚
•
†
‘ “
x
”
e
E W ) Q S 1 P C ` ` ` ( % C ` ` X
7. C G F i 0 ! $ 3 ) $ )
y
…
h
‘
‚
•
†
‘
“
ƒ ƒ ‡
’
“ • ‘
‡ ‚ x ƒ
•
† † … ƒ …
d • ‘
x ‚
– —
‡ m n
h
“ ‘
’
• ‘ •
ˆ x y ‡ ‚
• ”
’
“ „ „
…
h
‘
‚
•
†
‘
‡
’
‚ x ƒ
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
• ”
’
‘
—
‡ ‚ ‡
„
…
d ‘ “ „ „ ‘
x ‚ ‡
’
“ ” ‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
e
€ d d
d •
˜
„ •
‚ ‡ ƒ x
’
“
“
‡
’
‘
x ‚ ‡
d
‡ †
‘ ‘
—
‡ ‚ ‡
„
…
d ‘
x
‘
—
‡
„
…
h
‘
‚
•
†
‘ “
x
”
e
E W ) Q S 1 P C G F c V
C ` F i 0 ! $ 3 ) $ )
y
…
h
‘
‚
•
†
‘
“
ƒ ƒ ‡
’
“ • ‘
‡ ‚ x ƒ
•
† † … ƒ …
d • ‘
x ‚ x
“ ‘
—
h
x ‚ ‚ x x
– —
‡ † x
” ‘
‡
” ‘ „
x ‚ ‡ ˜
“ „ ‘
‡ ‚ i
•
‚ ‡ ‡ v †
—
• ”
˜ ‡
’
x
“ ‘
—
‘
—
‡
† x
” ‘
‡
” ‘ „
x ‚ ‡ ˜
“ „ ‘
‡ ‚
z
g • ”
’
‘
—
‡ † x
” ‘
‡
” ‘ „
x ‚ ‡ ˜
“ „ ‘
‡ ‚ j
•
‚ ‡
‡ v †
—
• ”
˜ ‡
’
x
“ ‘
—
‘
—
‡ † x
” ‘
‡
” ‘ „
x ‚ ‡ ˜
“ „ ‘
‡ ‚
s
e
E W ) Q S 1 P h H V f
F B A
A
X
f
”
† ‚ ‡ ƒ ‡
” ‘
‚ ‡ ˜
“ „ ‘
‡ ‚
x ‚ ƒ ‡ ƒ x ‚ €
h
€
p
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
’
‡
„ “
˜
” • ‘
‡
’
‚ ‡ ˜
“ „ ‘
‡ ‚ x ‚ ƒ ‡ ƒ x ‚ €
•
‚ ‡
“ ”
† ‚ ‡ ƒ ‡
” ‘
‡
’ h
€
p • ”
’
‘
—
‡ ‚ ‡
„
…
d ‘ “ „ „ ‘
x ‚ ‡
’
“ ” ‘
—
‡
„ •
ƒ ‡
y
d •
† ‡
e f
‘
—
‡ x y ‡ ‚
• ”
’
“ „ •
ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
” g “ ‘ „ d
x †
• ‘ “
x
” “ „
„
y ‡ †
“
“
‡
’ h
€
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡ i j ‚ ‡ ˜
“ „ ‘
‡ ‚
„
e
E W ) Q S 1 P F B A ` ( % F B A X
F B h A
f
”
† ‚ ‡ ƒ ‡
” ‘
‚ ‡ ˜
“ „ ‘
‡ ‚
y
• “
‚
h
€
p
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
’
‡
„ “
˜
” • ‘
‡
’
‚ ‡ ˜
“ „ ‘
‡ ‚ y
• “
‚
•
‚ ‡
“ ”
† ‚ ‡ ƒ ‡
” ‘
‡
’ h
€
p • ”
’
‘
—
‡ ‚ ‡
„
…
d ‘ “ „ „ ‘
x ‚ ‡
’
“ ” ‘
—
‡
„ •
ƒ ‡
y
d •
† ‡
e
E W ) Q S 1 P F B h V
9 H A
A
X
z
‡ † ‚ ‡ ƒ ‡
” ‘
‚ ‡ ˜
“ „ ‘
‡ ‚ x ‚
ƒ ‡ ƒ x ‚ €
h
€
p
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
’
‡
„ “
˜
” • ‘
‡
’
‚ ‡ ˜
“ „ ‘
‡ ‚ x ‚ ƒ ‡ ƒ x ‚ €
•
‚ ‡
k
’
‡ † ‚ ‡ ƒ ‡
” ‘
‡
’ h
€
p • ”
’
‘
—
‡ ‚ ‡
„
…
d ‘ “ „ „ ‘
x ‚ ‡
’
“ ” ‘
—
‡
„ •
ƒ ‡
y
d •
† ‡
e f
‘
—
‡ x y ‡ ‚
• ”
’
“ „ •
ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
” g “ ‘ „ d
x †
• ‘ “
x
” “ „
„
y ‡ †
“
“
‡
’ h
€
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡ i j ‚ ‡ ˜
“ „ ‘
‡ ‚
„
e
E W ) Q S 1 P 9 H A ` ( % 9 H A X
9 H h A
z
‡ † ‚ ‡ ƒ ‡
” ‘
‚ ‡ ˜
“ „ ‘
‡ ‚ y
• “
‚
h
€
p
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
’
‡
„ “
˜
” • ‘
‡
’
‚ ‡ ˜
“ „ ‘
‡ ‚ y
• “
‚
•
‚ ‡
’
‡ † ‚ ‡ ƒ ‡
” ‘
‡
’ h
€
p • ”
’
‘
—
‡ ‚ ‡
„
…
d ‘ “ „ „ ‘
x ‚ ‡
’
“ ” ‘
—
‡
„ •
ƒ ‡
y
d •
† ‡
e
E W ) Q S 1 P 9 H h V
9 @ @ (
z
‡ †
“
ƒ
• d •
’ …
…
„ ‘
•
† † … ƒ …
d • ‘
x ‚
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
•
‚ ‡ †
—
• ”
˜ ‡
’
‚ x ƒ
•
h
“ ” •
‚ € l
• d
… ‡
‘
x
‘
x x † n
h
“ ‘
h
“ ” •
‚ € † x
’
‡
’ ’
‡ †
“
ƒ
• d
ˆ w
z
’
“
˜
“ ‘ „
e
– —
“ „ “ „ ‘
—
‡ x
” d
€
“ ” „ ‘
‚ … †
‘ “
x
” ‘
—
• ‘
…
„
‡
„ ‘
—
‡
•
… v
“ d “ •
‚ €
d •
˜
‘
x y ‡ ‚ x ‚ ƒ
‘
—
‡
h
“ ” •
‚ €
‘
x w
z
† x
”
l ‡ ‚
„ “
x
” g • ”
’
‘
—
‡
† x
”
l ‡ ‚
„ “
x
”
y ‚ x † ‡
’
… ‚ ‡
“ „
’
‡
„
† ‚
“
h
‡
’ h
‡
d
x x
e
y
g ‡ g €
w
g
|
g
w ƒ
d •
˜
„ •
‚ ‡
• d ‘
‡ ‚ ‡
’
‘
x ‚ ‡
d
‡ †
‘ ‘
—
‡ ‚ ‡
„
…
d ‘ „
x
‘
—
‡ x y ‡ ‚
• ‘ “
x
”
e
f
‘
—
‡ l
• d
… ‡ x
‘
—
‡
d
x x n x ‚
’
‡ ‚ † n
h
“ ‘ „ “ ” ‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
“ „
˜ ‚ ‡
• ‘
‡ ‚
‘
—
• ” ˆ
x ‚
“
€
w
d •
˜
“ „ „
‡
‘ g ‘
—
‡
“ ” „ ‘
‚ … †
‘ “
x
” •
’ ’
„ q ‘
x
‘
—
‡
d
x x n x ‚
’
‡ ‚ x … ‚
h
“ ‘ „
e
8. f
‘
—
‡ l
• d
… ‡ x
‘
—
‡
—
“
˜
—
n x ‚
’
‡ ‚ † n
h
“ ‘ „ “ ” ‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
“ „
˜ ‚ ‡
• ‘
‡ ‚
‘
—
• ” ˆ
x ‚
“
‘
—
‡ w
•
‚ ‚ €
d •
˜
“ „ „
‡
‘ g ‘
—
‡
“ ” „ ‘
‚ … †
‘ “
x
”
•
’ ’
„ q ‘
x
‘
—
‡
—
“
˜
—
n x ‚
’
‡ ‚ x … ‚
h
“ ‘ „
e
E W ) Q S 1 P 9 @ @
I S ' ( 3 I S % ) 3
E W S 1 ) ) $ ! ( ( 2
F # $ % ' $ ! (
9 # ' % ! S $ ! (
p X q
8 o
i 0 ! $
) 3 3 % # #
‰
… ƒ y
…
”
† x
”
’
“ ‘ “
x
” • d d
€
– —
‡ y ‚ x ˜ ‚
•
ƒ
„
‡ ~ … ‡
”
† ‡
“ „
‘
‚
• ” „
‡ ‚ ‚ ‡
’
‘
x
‘
—
‡ ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
”
„
y ‡ †
“
“
‡
’ h
€
‘
—
‡
p q
n
h
“ ‘ •
’ ’
‚ ‡
„ „
˜
“
l ‡
” “ ” ‘
—
‡ x y ‡ ‚
• ”
’ e
E W ) Q S 1 P p X q a
d
c V ( % p X q
h t u
y † x
’
‡
z
‡
„
† ‚
“
y
‘ “
x
” Š
d •
˜
y
‘ • ‘
…
„
p H p Q S ( H ) % % U H t ‹
8
p B H
p Q S ( (
H ) % % U
H t ‹
p q
p Q S (
S ( # ! $ ! 6
C ‹
p X p Q S ( Q ! # C ‹
8
p u p Q S ( Œ % ( u ‹
8
p B u p Q S ( ( Œ % ( u ‹
p q E
p Q S ( S ) % ! $ U
6
q ‹
8
p q I
p Q S ( S ) % ! $ U
( 3 3
q ‹
8 o
i 0 ! $
) 3 3 % # #
‰
… ƒ y
† x
”
’
“ ‘ “
x
” • d d
€
– —
‡ y ‚ x ˜ ‚
•
ƒ
„
‡ ~ … ‡
”
† ‡
“ „
‘
‚
• ” „
‡ ‚ ‚ ‡
’
‘
x
‘
—
‡ ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
”
„
y ‡ †
“
“
‡
’ h
€
‘
—
‡
p q
n
h
“ ‘ •
’ ’
‚ ‡
„ „
˜
“
l ‡
” “ ” ‘
—
‡ x y ‡ ‚
• ”
’ h
• „
‡
’
x
” ‘
—
‡
„
y ‡ †
“
“
‡
’
d •
˜ x
‘
—
‡
| y
• „
’
‡
„
† ‚
“
h
‡
’ h
‡
d
x x
e
E W ) Q S 1 P p u a
d
c V ( % p u h t u
y † x
’
‡
z
‡
„
† ‚
“
y
‘ “
x
”
Š
d •
˜
y
‘ • ‘
…
„
H H H ) 1 1 ( H ) % % U H t ‹
8
H B H
H ) 1 1 ( (
H ) % % U
H t ‹
8 o
i 0 ! $
) 3 3 % # #
Ž
”
† x
”
’
“ ‘ “
x
” • d
„
…
h
‚ x …
‘ “ ”
‡ †
• d d
– —
‡ y ‚ x ˜ ‚
•
ƒ
„
‡ ~ … ‡
”
† ‡
“ „
‘
‚
• ” „
‡ ‚ ‚ ‡
’
‘
x
‘
—
‡ ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
”
„
y ‡ †
“
“
‡
’ h
€
‘
—
‡
p q
n
h
“ ‘ •
’ ’
‚ ‡
„ „
˜
“
l ‡
” “ ” ‘
—
‡ x y ‡ ‚
• ”
’ e
‡ x ‚ ‡
‘
—
‡
‘
‚
• ” „
‡ ‚
g ‘
—
‡
•
’ ’
‚ ‡
„ „
x
‘
—
‡
”
‡ v
‘
“ ” „ ‘
‚ … †
‘ “
x
” •
‘
‡ ‚ w
€
j j ˆ
‘
—
‡
† x
” ‘
‡
” ‘ „
x
‘
—
‡ y ‚ x ˜ ‚
•
ƒ † x …
” ‘
‡ ‚
“ „
9. H q H ) 1 1 ( S ( # ! $ ! 6 C ‹
H X H ) 1 1 ( Q ! # C ‹
8
H u H ) 1 1 ( Œ % ( u ‹
8
H B u H ) 1 1 ( ( Œ % ( u ‹
H q E
H ) 1 1 ( S ) % ! $ U
6
q ‹
8
H q I
H ) 1 1 ( S ) % ! $ U
( 3 3
q ‹
y …
„
—
‡
’
x
” ‘
x
‘
—
‡
„ ‘ •
† {
e
E W ) Q S 1 P H @ e e a
d
c V ( %
H @ e e h t u
A E (
‰ ‡
‘
… ‚
”
‚ x ƒ
„
…
h
‚ x …
‘ “ ”
‡
…
”
† x
”
’
“ ‘ “
x
” • d d
€
– —
‡ y ‚ x ˜ ‚
•
ƒ
„
‡ ~ … ‡
”
† ‡
“ „
‘
‚
• ” „
‡ ‚ ‚ ‡
’
‚ x ƒ
‘
—
‡
„
…
h
‚ x …
‘ “ ”
‡
‘
x
‘
—
‡ †
• d d “ ”
˜ y ‚ x ˜ ‚
•
ƒ
e
– —
‡
‘
x x
h
€
‘
‡
„
‚ x ƒ
‘
—
‡
‘
x y x
‘
—
‡
„ ‘ •
† {
•
‚ ‡ † x y
“
‡
’
“ ” ‘
x
‘
—
‡ y ‚ x ˜ ‚
•
ƒ † x …
” ‘
‡ ‚
g • ”
’
y ‚ x ˜ ‚
•
ƒ ‡ v ‡ † …
‘ “
x
”
h
‡ ˜
“ ” „ • ‘ ‘
—
‡
”
‡ x
•
’ ’
‚ ‡
„ „
e
E W ) Q S 1 P A E
y † x
’
‡
z
‡
„
† ‚
“
y
‘ “
x
” Š
d •
˜
y
‘ • ‘
…
„
A H A $ % ( H ) % % U H t ‹
8
A B H
A $ % ( (
H ) % % U
H t ‹
A q
A $ % (
S ( # ! $ ! 6
C ‹
A X A $ % ( Q ! # C ‹
8
A u A $ % ( Œ % ( u ‹
8
A B u
A $ % ( (
Œ % (
u ‹
A q E
A $ % ( S ) % ! $ U
6
q ‹
8
A q I
A $ % ( S ) % ! $ U
( 3 3
q ‹
(
‰ ‡
‘
… ‚
”
‚ x ƒ
„
…
h
‚ x …
‘ “ ”
‡
† x
”
’
“ ‘ “
x
” • d d
€
– —
‡ y ‚ x ˜ ‚
•
ƒ
„
‡ ~ … ‡
”
† ‡
“ „
‘
‚
• ” „
‡ ‚ ‚ ‡
’
‚ x ƒ
‘
—
‡
„
…
h
‚ x …
‘ “ ”
‡
‘
x
‘
—
‡ †
• d d “ ”
˜ y ‚ x ˜ ‚
•
ƒ
h
• „
‡
’
x
” ‘
—
‡
„
y ‡ †
“
“
‡
’
d •
˜ x
‘
—
‡
| y
• „
’
‡
„
† ‚
“
h
‡
’ h
‡
d
x x
e
– —
‡
‘
x x
h
€
‘
‡
„
‚ x ƒ
‘
—
‡
‘
x y x
‘
—
‡
„ ‘ •
† {
•
‚ ‡ † x y
“
‡
’
“ ” ‘
x
‘
—
‡ y ‚ x ˜ ‚
•
ƒ † x …
” ‘
‡ ‚
g • ”
’
y ‚ x ˜ ‚
•
ƒ ‡ v ‡ † …
‘ “
x
”
h
‡ ˜
“ ” „ • ‘ ‘
—
‡
”
‡ x
•
’ ’
‚ ‡
„ „
e
E W ) Q S 1 P A u
q H V e (
j x
•
’
y ‚ x ˜ ‚
•
ƒ
† x …
” ‘
‡ ‚ x
“ ‘
—
i j
† x
” ‘
‡
” ‘ „
– —
‡ † x
” ‘
‡
” ‘ „
x ‚ ‡ ˜
“ „ ‘
‡ ‚
„
i
• ”
’
j
•
‚ ‡ † x y
“
‡
’
“ ” ‘
x
‘
—
‡ y ‚ x ˜ ‚
•
ƒ
† x …
” ‘
‡ ‚
e
– —
‡ † x
” ‘
‡
” ‘ „
x i
•
‚ ‡
y
d •
† ‡
’
• „ ‘
—
‡
—
“
˜
—
n x ‚
’
‡ ‚
h
€
‘
‡
• ”
’
‘
—
‡ † x
” ‘
‡
” ‘ „
x j
• „ ‘
—
‡
d
x x n x ‚
’
‡ ‚
h
€
‘
‡
e
s
v
•
ƒ y
d
‡
|
w i j
10. A C
i v
‰ ‡
„ ‘ •
‚
‘
– —
‡ ‰
y
–
“ ” „ ‘
‚ … †
‘ “
x
” “ „
‡ ~ …
“
l
• d
‡
” ‘
‘
x
• p
n
h
€
‘
‡ †
• d d “ ” „ ‘
‚ … †
‘ “
x
” ‘
x x
”
‡ x
‡
“
˜
—
‘
ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
” „
’
‡ y ‡
”
’
“ ”
˜
… y x
” ‘
—
‡
”
… ƒ
h
‡ ‚
e
– —
‡
“ ” „ ‘
‚ … †
‘ “
x
” „
•
‚ ‡ ˜ ‡
”
‡ ‚
• d d
€ …
„
‡
’
“ ”
† x
”
…
…
”
†
‘ “
x
”
x
“ ‘
—
“ ” ‘
‡ ‚ ‚ … y
‘ „ • ”
’
“ ” „
‡ ‚
‘
‡
’
…
„ “ ”
˜
‡ v
‘
‡ ‚
” • d
—
•
‚
’
x
•
‚ ‡
e
i x x ‡ l ‡ ‚
‘
—
‡
„
‡
†
• ”
h
‡ …
„
‡
’
• „ „
x
‘
x
•
‚ ‡
“ ” „ ‘
‚ … †
‘ “
x
” „
“ ” •
y ‚ x ˜ ‚
•
ƒ
‘
x
‘
‚
• ” „
‡ ‚ y ‚ x ˜ ‚
•
ƒ
‡ v ‡ † …
‘ “
x
” ‘
x x
”
‡ x
‘
—
‡ ‡
“
˜
—
‘
d
x †
• ‘ “
x
” „
e
– —
‡
•
’ ’
‚ ‡
„ „
‡
„ •
‚ ‡
f
” „ ‘
‚ … †
‘ “
x
”
‰ ‡
„ ‘ •
‚
‘
€
’ ’
‚ ‡
„ „
A C V
A C
8
V
A C a
8
V
A C
d
8
V
A C c a V
A C a V
A C
o
d
V
A C v
d
V
– —
‡ m m ‘
—
• „
x … ‚
•
’ ’
“ ‘ “
x
” • d
“ ” ‘
‡ ‚ ‚ … y
‘ „ • ”
’
‘
—
‡
„
‡
“ ” ‘
‡ ‚ ‚ … y
‘ „
˜ ‡
”
‡ ‚
• ‘
‡ ‰
y
–
“ ” „ ‘
‚ … †
‘ “
x
” „
“ ” ‘
‡ ‚
” • d d
€
• ”
’
‘
—
…
„
’
x
”
x
‘
‚ ‡ ~ …
“
‚ ‡
• ”
€ ‡ v
‘
‡ ‚
” • d
—
•
‚
’
x
•
‚ ‡
e
– —
‡
„
‡
“ ” „ ‘
‚ … †
‘ “
x
” „ • ”
’
‘
—
‡
“
‚ ‰ ‡
„ ‘ •
‚
‘
•
’ ’
‚ ‡
„ „
‡
„ •
‚ ‡
f
” ‘
‡ ‚ ‚ … y
‘
‰ ‡
„ ‘ •
‚
‘
€
’ ’
‚ ‡
„ „
A @ q a c V
A C 7 a H V
A C
o
7
d
c V
A C v 7
d
H V
11. I S ' ( 3 I S % ) 3
E W S 1 ) ) $ ! ( ( 2
F # $ % ' $ ! (
9 # ' % ! S $ ! (
H X q
A
X
w x ƒ y
•
‚ ‡ ‚ ‡ ˜
“ „ ‘
‡ ‚
x ‚ ƒ ‡ ƒ x ‚ € x
“ ‘
—
•
† † … ƒ …
d • ‘
x ‚
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡ x y ‡ ‚
• ”
’
ˆ ‚ ‡ ˜
“ „ ‘
‡ ‚ x ‚ ƒ ‡ ƒ x ‚ €
•
‚ ‡
k
† x ƒ y
•
‚ ‡
’
x
“ ‘
—
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
e
x
‘
—
† x
” ‘
‡
” ‘ „ •
‚ ‡ y ‚ ‡
„
‡ ‚ l ‡
’ e
– —
‡ ‚ ‡
„
…
d ‘
x
‘
—
‡ † x ƒ y
•
‚
“ „
x
” “ „
„
—
x x
”
h
€
„
‡
‘ ‘ “ ”
˜
‘
—
‡
d •
˜
„
x
‘
—
‡
| y
• „
x
d d
x x
„
“
ˆ
€ ’
ˆ ‚ ‡ ˜
‚
ƒ ‡ ƒ
†
•
‚ ‚ €
d •
˜
“ „ „
‡
‘
“
ˆ
€ “
ˆ ‚ ‡ ˜
‚
ƒ ‡ ƒ
” ‡ ‚ x
d •
˜
“ „ „
‡
‘
“
ˆ
€ •
ˆ ‚ ‡ ˜
‚
ƒ ‡ ƒ
†
•
‚ ‚ €
• ”
’
” ‡ ‚ x
d •
˜
„ •
‚ ‡ ‚ ‡
„
‡
‘
E W ) Q S 1 P H X q ` ( % H X q X
H q F
i 0 ! $
3 ) $ )
w x ƒ y
•
‚ ‡
“
ƒ ƒ ‡
’
“ • ‘
‡ x
“ ‘
—
•
† † … ƒ …
d • ‘
x ‚
– —
‡
„
‡ † x
”
’ h
€
‘
‡ ˆ m n
h
“ ‘
’
• ‘ • “ „
† x ƒ y
•
‚ ‡
’
x
“ ‘
—
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
e
– —
‡ l
• d
… ‡
„
h
‡
“ ”
˜ † x ƒ y
•
‚ ‡
’
‚ ‡ ƒ
• “ ”
…
”
†
—
• ”
˜ ‡
’ e
– —
‡ ‚ ‡
„
…
d ‘
x
‘
—
‡ † x ƒ y
•
‚
“ „
x
” “ „ „
—
x x
”
h
€
„
‡
‘ ‘ “ ”
˜
‘
—
‡
d •
˜
„
x
‘
—
‡
| y
• „
x
d d
x x
„
“
ˆ
€ ’
’
• ‘ •
†
•
‚ ‚ €
d •
˜
“ „ „
‡
‘
“
ˆ
€ “
’
• ‘ •
” ‡ ‚ x
d •
˜
“ „ „
‡
‘
“
ˆ
€ •
’
• ‘ •
†
•
‚ ‚ €
• ”
’
” ‡ ‚ x
d •
˜
„ •
‚ ‡ ‚ ‡
„
‡
‘
E W ) Q S 1 P H q F – V
@ B @
A
X
j x ˜
“
†
• d €
„
z
‚ ‡ ˜
“ „ ‘
‡ ‚ x ‚
ƒ ‡ ƒ x ‚ € x
“ ‘
—
•
† † … ƒ …
d • ‘
x ‚
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
•
‚ ‡
d
x ˜
“
†
• d d
€
€
„
z
‡
’
x
“ ‘
—
k
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡ x y ‡ ‚
• ”
’
ˆ ‚ ‡ ˜
“ „ ‘
‡ ‚ x ‚ ƒ ‡ ƒ x ‚ €
g • ”
’
‘
—
‡ ‚ ‡
„
…
d ‘ “ „
y
d •
† ‡
’
“ ” ‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
e f
‘
—
‡ x y ‡ ‚
• ”
’
“ „ •
ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
” g “ ‘ „ •
’ ’
‚ ‡
„ „ “ „ „
y ‡ †
“
“
‡
’ h
€
‘
—
‡ † x
” ‘
‡
” ‘ „
x
i j ‚ ‡ ˜
“ „ ‘
‡ ‚
„
e
y
g ‡ g
|
•
‚ ‡ ƒ x
’
“
“
‡
’
‘
x ‚ ‡
d
‡ †
‘ ‘
—
‡ ‚ ‡
„
…
d ‘
x
‘
—
‡
x y ‡ ‚
• ‘ “
x
”
e
w ƒ
“ „
‚ ‡
„
‡
‘
e
€
w
“ „ „
‡
‘
e
E W ) Q S 1 P @ B @ ` ( % @ B @ X
@ B F
i 0 ! $
3 ) $ )
j x ˜
“
†
• d €
„
z
“
ƒ ƒ ‡
’
“ • ‘
‡ x
“ ‘
—
•
† † … ƒ …
d • ‘
x ‚
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
•
‚ ‡
d
x ˜
“
†
• d d
€
€
„
z
‡
’
x
“ ‘
—
‘
—
‡
m n
h
“ ‘
’
• ‘ •
ˆ x y ‡ ‚
• ”
’
• ”
’
‘
—
‡ ‚ ‡
„
…
d ‘ “ „
y
d •
† ‡
’
“ ” ‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
e
y
g ‡ g
|
•
‚ ‡ ƒ x
’
“
“
‡
’
‘
x ‚ ‡
d
‡ †
‘ ‘
—
‡ ‚ ‡
„
…
d ‘
x
‘
—
‡
x y ‡ ‚
• ‘ “
x
”
e
w ƒ
“ „
‚ ‡
„
‡
‘
e
€
w
“ „ „
‡
‘
e
E W ) Q S 1 P @ B F
o
V
h A @
A
X
s
v †
d
…
„ “
l ‡ ‰
‚ ‡ ˜
“ „ ‘
‡ ‚ x ‚
ƒ ‡ ƒ x ‚ € x
“ ‘
—
•
† † … ƒ …
d • ‘
x ‚
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
•
‚ ‡
s
v †
d
…
„ “
l ‡ ‰ ‡
’
x
“ ‘
—
k
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡ x y ‡ ‚
• ”
’
ˆ ‚ ‡ ˜
“ „ ‘
‡ ‚ x ‚ ƒ ‡ ƒ x ‚ €
g • ”
’
‘
—
‡ ‚ ‡
„
…
d ‘ “ „
y
d •
† ‡
’
“ ” ‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
e f
‘
—
‡ x y ‡ ‚
• ”
’
“ „ •
ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
” g “ ‘ „ •
’ ’
‚ ‡
„ „ “ „ „
y ‡ †
“
“
‡
’ h
€
‘
—
‡ † x
” ‘
‡
” ‘ „
x
i j ‚ ‡ ˜
“ „ ‘
‡ ‚
„
e
y
g ‡ g
|
•
‚ ‡ ƒ x
’
“
“
‡
’
‘
x ‚ ‡
d
‡ †
‘ ‘
—
‡ ‚ ‡
„
…
d ‘
x
‘
—
‡
12. x y ‡ ‚
• ‘ “
x
”
e
w ƒ
• ”
’
€
w
•
‚ ‡ ‚ ‡
„
‡
‘
e
E W ) Q S 1 P h A @ ` ( % h A @ X
h A F
i 0 ! $
3 ) $ )
s
v †
d
…
„ “
l ‡ ‰
“
ƒ ƒ ‡
’
“ • ‘
‡ x
“ ‘
—
•
† † … ƒ …
d • ‘
x ‚
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
•
‚ ‡
s
v †
d
…
„ “
l ‡ ‰ ‡
’
x
“ ‘
—
‘
—
‡ m n
h
“ ‘
’
• ‘ •
ˆ x y ‡ ‚
• ”
’
• ”
’
‘
—
‡ ‚ ‡
„
…
d ‘ “ „
y
d •
† ‡
’
“ ” ‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
e
y
g ‡ g
|
•
‚ ‡ ƒ x
’
“
“
‡
’
‘
x ‚ ‡
d
‡ †
‘ ‘
—
‡ ‚ ‡
„
…
d ‘
x
‘
—
‡
x y ‡ ‚
• ‘ “
x
”
e
w ƒ
• ”
’
€
w
•
‚ ‡ ‚ ‡
„
‡
‘
e
E W ) Q S 1 P h A F
o
V
I A @
A
X
j x ˜
“
†
• d
‰
‚ ‡ ˜
“ „ ‘
‡ ‚ x ‚
ƒ ‡ ƒ x ‚ € x
“ ‘
—
•
† † … ƒ …
d • ‘
x ‚
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
•
‚ ‡
d
x ˜
“
†
• d d
€ ‰ ‡
’
x
“ ‘
— k
‘
—
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡ x y ‡ ‚
• ”
’
ˆ ‚ ‡ ˜
“ „ ‘
‡ ‚ x ‚ ƒ ‡ ƒ x ‚ €
g • ”
’
‘
—
‡
‚ ‡
„
…
d ‘ “ „
y
d •
† ‡
’
“ ” ‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
e f
‘
—
‡ x y ‡ ‚
• ”
’
“ „ •
ƒ ‡ ƒ x ‚ €
d
x †
• ‘ “
x
” g “ ‘ „ •
’ ’
‚ ‡
„ „ “ „ „
y ‡ †
“
“
‡
’ h
€
‘
—
‡ † x
” ‘
‡
” ‘ „
x
i j ‚ ‡ ˜
“ „ ‘
‡ ‚
„
e
y
g ‡ g
|
•
‚ ‡ ƒ x
’
“
“
‡
’
‘
x ‚ ‡
d
‡ †
‘ ‘
—
‡ ‚ ‡
„
…
d ‘
x
‘
—
‡
x y ‡ ‚
• ‘ “
x
”
e
w ƒ
• ”
’
€
w
•
‚ ‡ ‚ ‡
„
‡
‘
e
E W ) Q S 1 P I A @ ` ( % I A @ X
I A F
i 0 ! $
3 ) $ )
j x ˜
“
†
• d
‰
“
ƒ ƒ ‡
’
“ • ‘
‡ x
“ ‘
—
•
† † … ƒ …
d • ‘
x ‚
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
•
‚ ‡
d
x ˜
“
†
• d d
€ ‰ ‡
’
x
“ ‘
—
‘
—
‡ m n
h
“ ‘
’
• ‘ •
ˆ x y ‡ ‚
• ”
’
• ”
’
‘
—
‡ ‚ ‡
„
…
d ‘ “ „
y
d •
† ‡
’
“ ” ‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
e
y
g ‡ g
|
•
‚ ‡ ƒ x
’
“
“
‡
’
‘
x ‚ ‡
d
‡ †
‘ ‘
—
‡ ‚ ‡
„
…
d ‘
x
‘
—
‡
x y ‡ ‚
• ‘ “
x
”
e
w ƒ
• ”
’
€
w
•
‚ ‡ ‚ ‡
„
‡
‘
e
E W ) Q S 1 P I A F
o
V
A e H (
‰ x
‘ • ‘
‡
•
† † … ƒ …
d • ‘
x ‚
d
‡
‘
s
•
†
—
h
“ ” •
‚ €
h
“ ‘
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
“ „
‚ x
‘ • ‘
‡
’
d
‡
‘
h
€ x
”
‡
y x
„ “ ‘ “
x
”
e
“ ‘
z —
“ „
y
d •
† ‡
’
“ ” ‘
—
‡ y x
„ “ ‘ “
x
”
x
z
• „
x ‡
d d • „ “ ”
‘
—
‡ w
•
‚ ‚ €
d •
˜
e
w ƒ
“ „
ƒ x
’
“
“
‡
’
•
† † x ‚
’
“ ”
˜
‘
x
h
“ ‘
z —
e
y
g ‡ g
|
g
€
w
•
‚ ‡
”
x
‘ •
‡ †
‘
‡
’ e
E W ) Q S 1 P A e H
A A H (
‰ x
‘ • ‘
‡
•
† † … ƒ …
d • ‘
x ‚ ‚
“
˜
—
‘
s
•
†
—
h
“ ” •
‚ €
h
“ ‘
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
“ „
‚ x
‘ • ‘
‡
’
‚
“
˜
—
‘
h
€ x
”
‡
y x
„ “ ‘ “
x
”
e
“ ‘
z
“ „
y
d •
† ‡
’
“ ” ‘
—
‡ y x
„ “ ‘ “
x
”
x
z —
• „
x ‡
d d • „ “ ”
‘
—
‡ w
•
‚ ‚ €
d •
˜
e
w ƒ
“ „
ƒ x
’
“
“
‡
’
•
† † x ‚
’
“ ”
˜
‘
x
h
“ ‘
z
e
y
g ‡ g
|
g
€
w
•
‚ ‡
”
x
‘ •
‡ †
‘
‡
’ e
E W ) Q S 1 P A A H
A @ e (
‰ x
‘ • ‘
‡
•
† † … ƒ …
d • ‘
x ‚
d
‡
‘
‘
—
‚ x … ˜
—
†
•
‚ ‚ €
s
•
†
—
h
“ ” •
‚ €
h
“ ‘
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
“ „
‚ x
‘ • ‘
‡
’
d
‡
‘
h
€ x
”
‡
y x
„ “ ‘ “
x
” ‘
—
‚ x … ˜
—
‘
—
‡ w
•
‚ ‚ €
d •
˜
e
“ ‘
z —
“ „
y
d •
† ‡
’
“ ” ‘
—
‡
w
•
‚ ‚ €
d •
˜
g • ”
’
‘
—
‡ w
•
‚ ‚ €
d •
˜
“ „
y
d •
† ‡
’
“ ” ‘
—
‡
d
‡
• „ ‘
„ “
˜
” “
“
†
• ” ‘
y x
„ “ ‘ “
x
”
z
e
w ƒ
“ „
ƒ x
’
“
“
‡
’
•
† † x ‚
’
“ ”
˜
‘
x
h
“ ‘
z —
e
y
g ‡ g
|
g €
w
•
‚ ‡
”
x
‘ •
‡ †
‘
‡
’ e
E W ) Q S 1 P A @ e
A @ A (
‰ x
‘ • ‘
‡
•
† † … ƒ …
d • ‘
x ‚ ‚
“
˜
—
‘
s
•
†
—
h
“ ” •
‚ €
h
“ ‘
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
“ „
‚ x
‘ • ‘
‡
’
‚
“
˜
—
‘
h
€ x
”
‡
y x
„ “ ‘ “
x
” ‘
—
‚ x … ˜
—
‘
—
‡ w
•
‚ ‚ €
d •
˜
e
“ ‘
z
“ „
y
d •
† ‡
’
“ ” ‘
—
‡
13. ‘
—
‚ x … ˜
—
†
•
‚ ‚ € w
•
‚ ‚ €
d •
˜
g • ”
’
‘
—
‡ w
•
‚ ‚ €
d •
˜
“ „
y
d •
† ‡
’
“ ” ‘
—
‡ ƒ x
„ ‘
„ “
˜
” “
“
†
• ” ‘
y x
„ “ ‘ “
x
”
z —
e
w ƒ
“ „
ƒ x
’
“
“
‡
’
•
† † x ‚
’
“ ”
˜
‘
x
h
“ ‘
z
e
y
g ‡ g
|
g €
w
•
‚ ‡
”
x
‘ •
‡ †
‘
‡
’ e
E W ) Q S 1 P A @ A
H X @ (
w x ƒ y
d
‡ ƒ ‡
” ‘
•
† † … ƒ …
d • ‘
x ‚
– —
‡ † x
” ‘
‡
” ‘ „
x
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚
•
‚ ‡ † x ƒ y
d
‡ ƒ ‡
” ‘
‡
’ e „
x
d •
˜
„ •
‚ ‡
•
‡ †
‘
‡
’ e
E W ) Q S 1 P H X @
H X H (
w x ƒ y
d
‡ ƒ ‡
” ‘
†
•
‚ ‚ €
– —
‡ w
•
‚ ‚ €
d •
˜
“ „
† x ƒ y
d
‡ ƒ ‡
” ‘
‡
’ e „
x x
‘
—
‡ ‚
d •
˜
„ •
‚ ‡
•
‡ †
‘
‡
’ e
E W ) Q S 1 P H X H
C H (
y
‡
‘
w
•
‚ ‚ €
y
‡
‘
w
•
‚ ‚ €
E W ) Q S 1 P C H
I S ' ( 3 I S % ) 3
E W S 1 ) ) $ ! (
( 2
F # $ % ' $ ! (
9 # ' % ! S $ ! (
B I q
(
„
x
x y ‡ ‚
• ‘ “
x
”
„
x x y ‡ ‚
• ‘ “
x
” “ „
y ‡ ‚ x ‚ ƒ ‡
’ e
– —
‡
“ ” „ ‘
‚ … †
‘ “
x
” “ „
‡
‘
†
—
‡
’
• ”
’ ’
‡ † x
’
‡
’ e
i x x ‡ l ‡ ‚
”
x x y ‡ ‚
• ‘ “
x
” “ „
‡ v ‡ † …
‘
‡
’ e
E W ) Q S 1 P B I q
V e (
i
• d ‘ • ”
’
‡
” ‘
‡ ‚ x
• “ ‘
„ ‘ • ‘
‡
– —
‡ w
|
Ž
“ ” “ „
—
‡
„
‡ v ‡ † …
‘ “ ”
˜
‘
—
‡ † … ‚ ‚ ‡
” ‘ “ ” „ ‘
‚ … †
‘ “
x
” • ”
’
—
• d ‘ „ • ”
€ … ‚
‘
—
‡ ‚
‡ v ‡ † …
‘ “
x
”
e
€ ” “ ” ‘
‡ ‚ ‚ … y
‘
x ‚ ‚ ‡
„
‡
‘ “ „ ”
‡ † ‡
„ „ •
‚ €
‘
x ‡ v
“ ‘
‚ x ƒ
‘
—
‡
—
• d ‘ „ ‘ • ‘
‡
e
E W ) Q S 1 P V e
9 F (
z
“ „ •
h
d
‡
“ ” ‘
‡ ‚ ‚ … y
‘ „
– —
‡
“ ” ‘
‡ ‚ ‚ … y
‘
‡
” •
h
d
‡
d “
y n
d
x y
“ „
‚ ‡
„
‡
‘ • ”
’
• d d ‘
—
‡
“ ” ‘
‡ ‚ ‚ … y
‘ „
‡ v † ‡ y
‘ ‘
—
‡
–
‰
€
|
•
‚ ‡
’
“ „ •
h
d
‡
’ e „
x
d •
˜
„ •
‚ ‡
•
‡ †
‘
‡
’ e
E W ) Q S 1 P 9 F
E F (
s
” •
h
d
‡
“ ” ‘
‡ ‚ ‚ … y
‘ „
– —
‡
“ ” ‘
‡ ‚ ‚ … y
‘
‡
” •
h
d
‡
d “
y n
d
x y
“ „ „
‡
‘ • ”
’
• d d “ ” ‘
‡ ‚ ‚ … y
‘ „ •
‚ ‡ ‡
” •
h
d
‡
’ e „
x
d •
˜
„
•
‚ ‡
•
‡ †
‘
‡
’ e
€
‘
‡ ‚
• „
€
„ ‘
‡ ƒ ‚ ‡
„
‡
‘
x ‚
‘
—
‡
•
† {
”
x x
d
‡
’
˜ ‡ ƒ ‡
” ‘
x
• ” “ ” ‘
‡ ‚ ‚ … y
‘ g
‘
—
‡
“ ” ‘
‡ ‚ ‚ … y
‘
‡
” •
h
d
‡
d “
y
d
x y
“ „
‚ ‡
„
‡
‘ g ‘
—
…
„
’
“ „ •
h
d “ ”
˜
‘
—
‡
“ ” ‘
‡ ‚ ‚ … y
‘ „
e
– —
“ „
“ ” „ ‘
‚ … †
‘ “
x
” “ „
”
‡ † ‡
„ „ •
‚ €
‘
x ‚ ‡ ‡
” •
h
d
‡
‘
—
‡
“ ” ‘
‡ ‚ ‚ … y
‘ „
ˆ ‡ v † ‡ y
‘
–
‰
€
|
e
E W ) Q S 1 P E F
14. A F X (
‰ ‡
•
’
“ ” ‘
‡ ‚ ‚ … y
‘
ƒ
• „
– —
“ „ “ „ •
ƒ …
d ‘ “
y … ‚ y x
„
‡
“ ” „ ‘
‚ … †
‘ “
x
”
…
„
‡
’
‘
x ‚ ‡
•
’
‘
—
‡
„ ‘ • ‘
…
„
x
“ ” ‘
‡ ‚ ‚ … y
‘ „
—
e
‘
g
q
e
‘
g
‘
e
‘
• ”
’
‚ ‡
•
’
„
‡ ‚
“ • d
’
• ‘ • “ ”
y …
‘
h
“ ‘
e
– —
‡
“ ” „ ‘
‚ … †
‘ “
x
” d
x
•
’
„
‡
“
˜
—
‘
h
“ ‘ „ “ ”
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚ x
“ ‘
—
‘
—
‡ x
d d
x x
“ ”
˜
“ ” ‘
‡ ‚ y ‚ ‡
‘ • ‘ “
x
” „
e
E W ) Q S 1 P A F X
C F X (
y
‡
‘ “ ” ‘
‡ ‚ ‚ … y
‘
ƒ
• „
{
– —
“ „ “ „ •
ƒ …
d ‘ “
y … ‚ y x
„
‡
“ ” „ ‘
‚ … †
‘ “
x
” • ”
’
…
„
‡
’
‘
x
“
ƒ y
d
‡ ƒ ‡
” ‘ ‘
—
‡ m m ‘
“ ” ‘
‡ ‚ ‚ … y
‘ „
—
e
‘
g q
e
‘
g
‘
e
‘
g • ”
’
„
‡ ‚
“ • d
’
• ‘ •
x …
‘
y …
‘
e
– —
‡
“ ” „ ‘
‚ … †
‘ “
x
” “ ” ‘
‡ ‚ y ‚ ‡
‘ „
‘
—
‡
•
† † … ƒ …
d • ‘
x ‚ † x
” ‘
‡
” ‘ „ • „
x
d d
x x
„
e
E W ) Q S 1 P C F X