14 Pages

Networking

Course: CS 313, Fall 2009
School: Texas A&M
Rating:
 
 
 
 
 

Word Count: 2519

Document Preview

Introduction CPSC-313: to Computer Systems Networking Programming Network Programming Network Programming as Programming across Machine Boundaries The Sockets API Reliable Communication Channels: TCP Dangerous at any Speed; connectionless communication and UDP Server Design Reading: R&R, Ch 18 Naming in a Networked Environment Reminder: Naming within a single address space? addresses, duh!...

Register Now

Unformatted Document Excerpt

Coursehero >> Texas >> Texas A&M >> CS 313

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Introduction CPSC-313: to Computer Systems Networking Programming Network Programming Network Programming as Programming across Machine Boundaries The Sockets API Reliable Communication Channels: TCP Dangerous at any Speed; connectionless communication and UDP Server Design Reading: R&R, Ch 18 Naming in a Networked Environment Reminder: Naming within a single address space? addresses, duh! Naming across address spaces? file descriptors filenames (use file system as name space) keys New: Naming across machine boundaries? CPSC-313: Introduction to Computer Systems Networking Programming Naming in a Networked Environment (II) what? how? who? where? sshd telnet server HTTP 1.1 TCP UDP httpd web server lpd printer server hostX.cs.tamu.edu 128.144.xxx.yyy Protocols for a Networked Environment HTTP 1.1 application layer UDP TCP sshd telnet server httpd web server lpd printer server transport layer hostX.cs.tamu.edu 128.144.xxx.yyy network layer link layer physical layer CPSC-313: Introduction to Computer Systems Networking Programming The Socket API What does an API need to support? [Comer&Stevens] allocate local resources (buffers) specify local and remote communication endpoints initiate a connection wait for an incoming connection send or receive data determine when data arrives generate urgent data handle incoming urgent data terminate a connection gracefully handle connection termination from the remote site abort communication handle error conditions or a connection abort release local resources when communication finishes Existing TCP/IP APIs: Berkeley Socket API aka socket API, socket interface, sockets adapted by Linux and others Windows Sockets System V Unix TLI (Transport Layer Interface) Specifying a Protocol Interface Reality Check: All networks today are based on TCP/IP. How to define a network API, then?! Approach 1: Define functions that specifically support TCP/IP communication. e.g. makeTCPconnection(int32 host, int16 portno); Approach 2: Define functions that support network communication in general, and use parameters to handle TCP/IP as a special case. The socket API provides generalized functions that support network communication using many possible protocols. The programmer specifies the type of service required rather than the name of a specific network protocol. CPSC-313: Introduction to Computer Systems Networking Programming Sockets and File Descriptors #include <sys/socket.h> int socket(int family, int type, int protocol) /* creates communication endpoint and returns file descriptor. */ internal data structure for file 0 internal data structure for file 1 internal data structure for file 2 internal data structure for file 3 family: AF_INET service: SOCK_STREAM local IP: remote IP: local port: remote port: ... file descriptor table [0] [1] [2] [3] [4] newsocket 4 user space kernel space Create new Socket Descriptor: int newsocket; newsocket = socket(AF_INET, SOCK_STREAM, 0); TCP? UDP?!! Connection-oriented Style (SOCK_STREAM) of communication Implemented in TCP/IP as the Transport Control Protocol (TCP). TCP provides full reliability: verifies that data arrives, with automatic retransmission computes checksums to detect corruption uses sequence numbers to guarantee ordering of received packets automatically eliminates duplicated packets provides flow control (ensures that sender does not send more packets than the receiver can handle) informs sender if network becomes inoperable for any reason TCP protects network resources: provides congestion control (throttles transmission when it detects that network is congested) What is the cost of all this?! Connection establishment overhead. CPSC-313: Introduction to Computer Systems Networking Programming TCP? UDP?!! Connectionless Style (SOCK_DGRAM) of communication Implemented in TCP/IP as the User Datagram Protocol (UDP). UDP provides no guarantee about reliable delivery: packets can be lost, duplicated, delayed, or delivered out of order UDP works well if the underlying network works well, e.g. local network In practice, programmers use UDP only when: 1. The application requires that UDP must be used. (The application has been designed to handle reliability and delivery errors.) 2. The application relies on hardware broadcast or multicast for delivery. 3. Application runs in reliable, local environment, and overhead for reliability is unnecessary. The Sockets Local Address #include <sys/socket.h> int socket(int family, int type, int protocol) /* creates communication endpoint and returns file descriptor. */ internal data structure for file 0 internal data structure for file 1 internal data structure for file 2 internal data structure for file 3 family: AF_INET service: SOCK_STREAM local IP: remote IP: local port: remote port: ... file descriptor table [0] [1] [2] [3] [4] newsocket 4 user space kernel space Create new Socket Descriptor: int newsocket; newsocket = socket(AF_INET, SOCK_STREAM, 0); CPSC-313: Introduction to Computer Systems Networking Programming Defining the Sockets Local Address (server) #include <sys/socket.h> int bind( int socket, const struct sockaddr * address, socketlen_t address_len); /* associates socket file descriptor with communication endpoint address. */ Generalized socket address: (address family, endpoint address in that family) Examples: Address family AF_UNIX has named pipes. Endpoint address of named pipes? Socket Addresses in AF_INET? struct sockaddr_in { u_char sin_len; u_short sin_family; u_short sin_port; struct in_addr sin_addr; char }; struct to hold an address */ total length */ type of address */ protocol port number */ IP address (declared to be*/ u_long in some systems) */ sin_zero[8]; /* unused (set to zero) */ /* /* /* /* /* Host vs. Network Byte Order Big-endian vs. Little-endian. Network representation requires big-endian. Portability?! #include <arpa/inet.h> uint32_t uint32_t uint16_t uint16_t htonl(uint32_t ntohl(uint32_t htons(uint16_t ntohs(uint16_t hostlong); netlong); hostshort); netshort); Associate port 8652 with a socket: struct sockaddr_in server; int sock = socket(AF_INET, SOCK_STREAM, 0); server.sin_family = AF_INET; server.sin_addr.s_addr = htonl(INADDR_ANY); server.sin_port = htons((short)8652); bind(sock, &server, sizeof(server)); CPSC-313: Introduction to Computer Systems Networking Programming Prepare to Accept Incoming Connections #include <sys/socket.h> (server) int listen(int socket, int backlog); /* specify willingness to accept incoming connections at given socket, with given queue limit. Connections are then accepted with accept(). */ When request for connection from client comes in, both client and server execute hand-shake procedure to set up the connection. When server is busy, two things can happen Connection request is queued (as long as backlog not exceeded) or Connection request is refused (client receives ECONNREFUSED error) Handle Incoming Connections #include <sys/socket.h> (server) int accept(int socket, struct sockaddr * address, socklen_t * address_len); /* Accept a connection on a socket. Create a new socket with same properties of socket and return new file descriptor. */ Extract first connection request on queue of pending connections. Create new socket with same properties of given socket. Returns new file descriptor for the socket. Blocks caller if no pending connections are present in queue. New socket may not be used to accept more connections. Original socket socket remains open. Argument address (result parameter) is filled in with the address of connecting entity. Argument address_len (value-result parameter) initially contains length of space pointed to by address. On return it contains length of actual length of space. CPSC-313: Introduction to Computer Systems Networking Programming In the meantime, at the Clients End #include <sys/socket.h> int connect(int socket, struct sockaddr * address, socklen_t address_len); /* Initiate a connection on a socket. Structure address specifies the other endpoint of the connection. */ Note difference between SOCK_DGRAM and SOCK_STREAM sockets: (client) For SOCK_STREAM sockets, connect attempts to establish connection with other socket. Generally, stream sockets may connect only once. For SOCK_DGRAM sockets, connect specifies the peer with which to associate socket. Datagram sockets may dissolve association by connecting to invalid address, such as null address. For address, fill in family, address, and port number. Connection Establishment: Summary client socket() server socket() bind() listen() connect() read() / write() close() accept() read() / write() close() CPSC-313: Introduction to Computer Systems Networking Programming Addressing: IP Address vs. Dotted vs. Name Internet Address Dot Notation #include <arpa/inet.h> in_addr_t inet_addr(char * cp); /* return IP address from dot notation.*/ char * inet_ntoa(struct in); in_addr /* return dot notation from IP address */ Internal conversion 128.10.2.3 IP Address (IPv4) <some 32 bit number> Host name resolution using Domain Name Service (DNS) Host Name #include <netdb.h> merlin.cs.purdue.edu struct hostent * gethostbyname(char * name); struct hostent * gethostbyaddr(void * addr, socklen_t len, int type); /* return info about names and addresses */ Host Names and IP Addresses Host Information: #include <netdb.h> struct hostent { char * h_name; char ** h_aliases; int h_addrtype; int h_length; char ** h_addr_list; } /* /* /* /* /* canonical name of alias list */ host address type length of address list of addresses host */ */ */ */ Example: Translate a host name into IP address for use in connect() call: struct hostent * hp; struct sockaddr_in the_server; if ((hp = gethostbyname(www.cs.tamu.edu)) == NULL) fprintf(stderr, Failed to resolve host name\n); else memcpy((char*)&the_server.sin_addr.s_addr, hp->h_addr_list[0], hp->h_length); CPSC-313: Introduction to Computer Systems Networking Programming Example TCP Client: DAYTIME client [Comer] #define LINELEN 128 /* forward */ int connectTCP(const char * host, const char * service); /* main program */ int main(argc, char * argv) { char * host = localhost;/* use local host if none supplied */ char * service = daytime; /* default service port */ if (argc > 1) host = argv[1]; if (argc > 2) service = argv[2]; int s = connectTCP(host, service); while ( (int n = read(s, buf, LINELEN)) > 0) { buf[n] = \0; /* ensure null terminated */ (void) fputs(buf, stdout); } } Example TCP Client: (cont) #define LINELEN 128 /* forward */struct sockaddr_in sin; /* Internet endpoint address */ memset(&sin, 0, sizeof(sin)); int connectTCP(const char * host, const char * service); sin.sin_family = AF_INET; int connectTCP(const char * host , const char * service) { /* main program Map service name to port number */ */ /* int main(argc, char * argv) {* pse = getservbyname(service, tcp) ) if (struct servent char * hostelse if localhost;/* htons((unsigned short)atoi(service))) */ 0) = ((sin.sin_port = use local host if none supplied == char * service errexit(cant get <%s> service entry\n, service); = daytime; /* default service port */ if (argc > 1) host = argv[1]; if (struct hostent * phe = gethostbyname(host) ) if (argc > 2) service = argv[2]; phe->h_addr, phe->h_length); memcpy(&sin.sin_addr, int s = connectTCP(host, service); host entry\n, host); errexit(cant get <%s> /* Map host name to IP address, allowing for dotted decimal */ else if ( (sin.sin_addr.s_addr = inet_addr(host)) == INADDR_NONE ) sin.sin_port = pse->s_port; } /* Allocate socket */ while ( (int n = read(s, buf, LINELEN)) > 0) { int s = socket(AF_INET, SOCK_STREAM, 0); buf[n] = if (s < 0) errexit(cant create socket: terminated */ \0; /* ensure null %s\n, strerror(errno)); (void) fputs(buf, stdout); } /* Connect the socket */ if (connect(s, (struct sockaddr *)&sin, sizeof(sin)) < 0) errexit(cant connect to %s.%s: %s\n, host, service, strerror(errno)); return s; } CPSC-313: Introduction to Computer Systems Networking Programming Server Software Design: Issues [Comer] Concurrent vs. Iterative Servers: The term concurrent server refers to whether the server permits multiple requests to proceed concurrently, not to whether the underlying implementation uses multiple, concurrent threads of execution. Iterative server implementations are easier to build and understand, but may result in poor performance because they make clients wait for service. Connection-Oriented vs. Connectionless Access: Connection-oriented (TCP, typically) servers are easier to implement, but have resources bound to connections. Reliable communication over UDP is not easy! Stateful vs. Stateless Servers: How much information should the server maintain about clients? (What if clients crash, and server does not know?) Example: Iterative, Connection-Oriented Server int passiveTCPsock(const char * service, int backlog) { server socket() bind() listen() accept() read() / write() close() struct sockaddr_in sin; /* Internet endpoint address */ memset(&sin, 0, sizeof(sin)); /* Zero out address */ sin.sin_family = AF_INET; sin.sin_addr.s_addr = INADDR_ANY; /* Map service name to port number */ if (struct servent * pse = getservbyname(service, tcp) ) sin.sin_port = pse->s_port; else if ((sin.sin_port = htons((unsigned short)atoi(service))) == 0) errexit(cant get <%s> service entry\n, service); /* Allocate socket */ int s = socket(AF_INET, SOCK_STREAM, 0); if (s < 0) errexit(cant create socket: %s\n, strerror(errno)); /* Bind the socket */ if (bind(s, (struct sockaddr *)&sin, sizeof(sin)) < 0) errexit(cant bind to \n); /* Listen on socket */ if (listen(s, backlog) < 0) errexit(cant listen on \n) return s; } CPSC-313: Introduction to Computer Systems Networking Programming Example: Iterative, Connection-Oriented Server server socket() bind() listen() accept() read() / write() close() } } int main(int argc, char * argv[]) { char * service = daytime; /* service name or port number */ int m_sock, s_sock; /* master and slave socket */ service = argv[1]; int m_sock = passiveTCPsock(service, 32); for (;;) { s_sock = accept(m_sock,(struct sockaddr*)&fsin, sizeof(fsin)); if (s_sock < 0) errexit(accept failed: %s\n, strerror(errno)); time_t ...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Texas A&M - CS - 313
CPSC-313: Introduction to Computer SystemsPOSIX IPCPOSIX Inter-Process Communication (IPC) Message Queues Shared Memory Semaphores Reading: R&amp;R, Ch 15POSIX IPC: Overviewprimitive POSIX function description create or access control send/re
Texas A&M - CS - 313
CPSC-313: Introduction to Computer SystemsUNIX Special FilesUNIX Special Files Pipes Named Pipes Special Files and Devices Reading: R&amp;R, Ch 6Pipesfildes[1]#include &lt;unistd.h&gt; int pipe(int fildes[2]); /* fildes[0] for reading, fildes[1] f
Texas A&M - CS - 313
CPSC 313 Introduction to Computer Systems Homework 1 (Due Date: Check CSNET)1. [1] Which of the following instructions should be priviledged? (a) Set value of a timer. (b) Read the clock. (c) Clear memory. (d) Turn o interrupts. (e) Switch from user
Texas A&M - CS - 313
CPSC-313: Introduction to Computer SystemsProcess Synchronization: Critical Sections, Semaphores, MonitorsSynchronization: Critical Sections &amp; Semaphores Why? How? Examples Software solutions Hardware-supported solutions What? The Critical S
Texas A&M - CS - 313
CPSC-313: Introduction to Computer SystemsSecuritySecurity Overview Security Goals The Attack Space Security Mechanisms Introduction to Cryptography Authentication Authorization Confidentiality Case StudiesSecurity TodayCPSC-313: Int
Texas A&M - CS - 313
CPSC 313 Introduction to Computer SystemsSpring 2008Homework 2 (HARD Due Date: Midnight, Friday, March 7, 2008)1. [2] What are asynchronous, deferred, and disabled cancellation in pthreads? What makes them different? 2. Give a pseudo-code imple
Texas A&M - CS - 313
CPSC 313 Introduction to Computer SystemsSpring 2008Homework 4 (HARD Due Date: Midnight, Friday, April 25, 2008)1. When the Domain Name System resolves a machine name, it returns a set of one or more IP addresses. Explain why. 2. Explain how th
Texas A&M - CS - 313
CPSC 313 Introduction to Computer SystemsSpring 2008Homework 3 (HARD Due Date: Midnight, Wednesday, March 26, 2008)1. [2] Suppose a system uses 1KB blocks and 16-bit addresses. What is the largest possible le size for this le system for the fol
Texas A&M - CS - 313
CPSC 313 Introduction to Computer SystemsSpring 2008Homework 1 (HARD Due Date: Midnight, Thursday, Feb 14, 2008)1. [1] Which of the following instructions should be priviledged? (a) Set value of a timer. (b) Read the clock. (c) Clear memory. (d
Texas A&M - CS - 663
CPSC-663: Real-Time Systems Real-Time CommunicationReal-Time Communication Integrated Services: Integration of variety of services with different requirements (real-time and non-real-time) Trafc (workload) characterization Scheduling mechanisms
Texas A&M - CS - 663
CPSC 663 Real-Time Systems Homework 2 (Due November 8th, 2001)Fall 2001Keep your answers short! 1. 7.1 in J.Liu's book. 2. 7.6 (a), (b), and (c) in J.Liu's book. 3. 7.14 in J.Liu's book. 4. 7.16 in J.Liu's book.1
Texas A&M - CS - 663
&amp;~o.&quot;c,Ac,(. 1E's.sCD AJ&quot;~ L NJ R.,.s v '7~ ,., .s D.~ YS7'&amp;&quot;7 &quot;011&quot; : L~j~oC-E&quot;S 10-1. ~ ~ rv ~~(.).Se1.l.-+u .&quot; 2&quot;'&quot; A'8 &quot;. .se-.a-LER~, 41 IAt6wn.u,~o~ A- ~O&amp;-A-9~oc.'~&quot;D~.A: ~. ~FS . '&quot;.'1,' &quot;'&quot; c ...Sen. .ES~&quot;c
Texas A&M - CS - 663
CPSC-663: Real-Time SystemsReal-Time Communication Integrated Services: Integration of variety of services with different requirements (real-time and non-real-time) Traffic (workload) characterization Scheduling mechanisms Admission control / Acce
Texas A&M - CS - 663
CPSC 663 Real-Time Systems Homework 3 (Due Date: December 4, 2003)Fall 2003Note: This is the promised extension of the preliminary version of HW3 posted earlier. (The homework is due at the beginning of class. In this fashion, we can discuss solu
Texas A&M - CS - 663
CPSC-663: Real-Time SystemsPriority-Driven Scheduling 1Resource Access Control in Real-Time Systems Resources, Resource Access, and How Things Can Go Wrong: The Mars Pathfinder Incident Resources, Critical Sections, Blocking Priority Inversion,
Texas A&M - CS - 663
CPSC-663: Real-Time SystemsCachesCaches in Real-Time Systems[Xavier Vera, Bjorn Lisper, Jingling Xue, &quot;Data Caches in Multitasking Hard Real-Time Systems&quot;, RTSS 2003.]Schedulability AnalysisWCETSimple Platforms(memory performance)WCMP
Texas A&M - CS - 420
OverviewFoundations of AI Related academic disciplines Philosophy Mathematics Psychology Cognitive Science Linguistics Neuroscience2 History of AI Hard Problems Current Trends 1Philosophy of Mind Mathematics Al
Texas A&M - CS - 420
CPSC 420-502: Project 2, Perceptron and BackpropagationYoonsuck Choe Department of Computer Science Texas A&amp;M University1Overview3PerceptronYou will implement perceptron learning from scratch (see section 3 for details), and train it on AN
Texas A&M - CS - 625
Midterm Review: OverviewLectures 14 Clarifications contribute Disciplines with ties to AI: think about how they did and would AI basics What are the hard problems in AI? Why are they hard? Search as a problem solving strategy
Texas A&M - CS - 420
OverviewMultilayer Feed-Forward NetworksOutputOiMultilayer feed-forward networksGradient descent searchWji Hidden aj Wkj Input IkBackpropagation learning ruleEvaluation of backpropagationApplications of backpropagation1
Texas A&M - CS - 420
Overviewfunction Best-First-Search (problem, Eval-Fn) Queueing-Fn return General-Search(problem, Queueing-Fn)Best First Search Best-first search Heuristic function Greedy search Designing good heuristics The queuing functi
Texas A&M - CS - 420
OverviewREAD: keyboard input from userREAD: User InputSome more LISP stuff: user input, trace, cons, more setf, etc.Symbolic Differentiation: does it need intelligence?&gt;(read) hello HELLOExpression SimplicationProgramming A
Texas A&M - CS - 420
Overview IndependenceIn Belief Networks, the joint probability is given as follows:Joint Probability Distribution Under ConditionalConstructing a belief networkKnowledge engineering This is derived from the two following equations:
Texas A&M - CS - 420
Overview 1How the Brain Differs from ComputersDensely connected. Massively parallel. Highly nonlinear and noisy. Asynchronous: no central clock. Fault tolerant. Highly adaptable. Creative. Nervous system review (cont'd) Simpl
Texas A&M - CS - 625
Announcement Resolving Two Clauses: Revisited Midterm exam: Friday 10/18 in class! Resolving two clausesandwith the most general unier !:OverviewThis is basically:Resolvents 1. Find the most general unier
Texas A&M - CS - 420
OverviewBayesian Updating: Example We want to calculate :Combining multiple evidence: Bayesian updating &amp; Problem is thatHowever, we can make these assumptions (Conditional Independence of
Texas A&M - CS - 420
OverviewAnnouncementGCL is actually available in:Announcement: GCL and other Lisp interpreter options./pub/www/faculty/daugher/gcl/gclFinish up leftovers from last lecture. On some older machines, it may be found in:Unix basics.
Texas A&M - CS - 420
Announcements Overview Midterm: 10/16 (Wed), in class. Wrap up of propositional logic Resolution in propositional logic: exercise Predicate calculus (First-order logic) Midterm Review: 10/11 (Fri), in class. Project due: 10/21 (Mon
Texas A&M - CS - 420
OverviewMidterm Exam Date SurveyMidterm exam date surveySuLISP and emacs tips (read it yourself)Game playingSa 5 12 19 26Minimax 10/7: 10/14: 10/21: Midsemester Grades Due6 13 20 27October Mo Tu We 1 2 7 8 9 14 15 16 21 22 2
Texas A&M - CS - 420
OverviewDomain express some knowledge.Representing relations in predicate calculusA Domain is a section of the world about which we wish to Interpretation in predicate calculus domain.The totality of the objects in the part of th
Texas A&M - CS - 420
Emacs SummaryOverviewM-x : [Alt]-[x] or [ESC] then [x], C-x: [CTRL]-[x] M-x shell (run shell within emacs)Complexity of C-p ( ), C-n ( ), C-b (), C-f ()details Hill-climbing revisited Hill-climbing strategy Simul
Texas A&M - CS - 625
OverviewInductive Learningapproximates the function pure inductive inference, or induction.Announcement Final exam: 12/16/2002 10:30am-12:30pm.The functionTerm Project Due: 12/16/2002 10:30am.1Inductive Learning and BiasNo
Texas A&M - CS - 420
Overview CompressionOutputAnother Application of Backpropagation: ImageMore on backpropOi WjiSelf-organizing mapsHidden ajWkj Input Ikunits. 3. the hidden layer forms the compressed representation.1 2Image compression 1. target
Texas A&M - CS - 625
E 1 D 465 465 432 1 D 432 465 465 87 87 9@ 9@ 4 EA B 4 3A B 6 C 6 CaRussell &amp; Norvig. Resolvents Factors SubstitutionA EUnification in LISPUnification algorithmis a new Skolem constant, and3 487 87 9@ 9@ A FB A 43B 46B 6
Texas A&M - CS - 420
Overview AnsweringApplication of the Theorem Prover: QuestionApplication of theorem proving: question answeringUncertaintyDecision theory example resolution.Probability basicsConditional probability This is called Answer Extraction.Axio
Texas A&M - CS - 420
Overview 1Search Problems: Denition 2Search problems: denition 6 72Example: 8-puzzle45General search Search = initial state, operators, goal statesEvaluation of search strategiesInitial State: description of
Texas A&M - CEG - 453
Instructions for Programming TUTOR EPROMsThe TUTOR code will be programmed into two 2764 EPROM chips from files which reside in the EPROM directory of the hard disk on the PC nearest the TA office door. The files are named TUTOR.EVN and TUTOR.ODD, a
Texas A&M - CEG - 453
CEG 453/653: Design of computing systems Spring 2000 Time: TTh 7:00-8:15 PM Room: 406 Russ Engineering Center Instructor: Ricardo Gutierrez-Osuna Office: 401 Russ Engineering Center Phone: 775-5120 Email: rgutier@cs.wright.edu Office Hours: TBA Teach
Texas A&M - CEG - 499
Low-Cost E Series Multifunction I/O 200 kS/s, 12-Bit, 16 Analog Inputs6023E/6024E/6025E Families6023E/6024E/6025E Families6023E Family PCI-6023E 6024E Family PCI-6024E 6025E Family PCI-6025E PXI-6025E Analog Inputs 16 single-ended, 8 differentia
Texas A&M - CPSC - 483
The Engineering Presentation-Some Ideas on How to Approach and Present ItRONALD C. ROSENBURGAbstract-Achieving a successful presentation begins with the consideration of three things: what to say, how to say it, and how to conduct the presentation
Texas A&M - CPSC - 689
Audio-Visual Integration in Multimodal CommunicationTSUHAN CHEN, MEMBER, IEEE, AND RAM R. RAO Invited PaperIn this paper, we review recent research that examines audiovisual integration in multimodal communication. The topics include bimodality in
Texas A&M - CS - 790
Lecture 10: Density estimation IIg g g g g gParzen windows Smooth kernels Bandwidth selection for univariate data Multivariate density estimation Product kernels Nave Bayes classifierIntroduction to Pattern Recognition Ricardo Gutierrez-Osuna Wri
Texas A&M - CPSC - 614
!&quot;#$Loop: L.D ADD.D S.D L.D ADD.D S.D L.D ADD.D S.D L.D ADD.D S.D DADDIU BNE%&amp;'F0, 0(R1) F4, F0, F2 F4, 0(R1) F6, -8(R1) F8, F6, F2 F8, -8(R1) F10, -16(R1) F12, F10, F2 F12, -16(R1) F14, -24(R1) F16, F14, F2 F16, -24(R1) R1, R1, # -32 R1, R
Texas A&M - CPSC - 321
Texas A&amp;M University College of Engineering Computer Science Department CPSC 321:501506 Computer Architecture Spring Semester 2004 Project 2 Implementing MIPSLite Processor in Verilog Due Date: Monday, 04-12-2004, at 23:59:59, via turnin. Work in gro
Texas A&M - CHEM - 462
Class 1.2 Electron Congurations, Periodic Properties, &amp; the Periodic TableWednesday, Sept. 1 CHEM 462 T. HughbanksAnnouncementsIf I do not have your correct e-mail address, please e-mail me: trh@mail.chem.tamu.edu 1st homework set is posted:http
Texas A&M - CHEM - 462
Introduction; Atomic Structure IMonday, Aug. 30 CHEM 462 T. HughbanksCHEM 462Class 1.1About gradesGrading criteria for this course are outlined in the syllabus and on the course web site. Aside from being ~25% of the total grade, homeworks sho
Texas A&M - CHEM - 462
Selections from Chapters 9 &amp; 16The transition metals (IV)CHEM 462 Monday, November 22 T. HughbanksJahn-Teller DistortionsJahn-Teller Theorem: Nonlinear Molecules in orbitally degenerate states are inherently unstable with respect to distortion.
Texas A&M - CHEM - 462
Chapter 10The sp-block elements (III)CHEM 462 Fri.-Mon. Nov 12,15 T. HughbanksGroup 13 ElementsElectropositive character of elements still very important Atomic congurations ns2 np1 Bonding in the elements is much stronger and p orbital partici
Texas A&M - CS - 689
IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS,VOL. 1,NO. 4,OCTOBER-DECEMBER 2004159An ON 2 Algorithm for Discovering Optimal Boolean Pattern Pairs Hideo Bannai, Heikki Hyyro, Ayumi Shinohara, Masayuki Takeda, Kenta Naka
Texas A&M - CPSC - 629
r p Rc7Ty5bl5&amp;TXev u p u y u p w 7$fVllR7x7uTcxwyvy&amp;xRc7bfvT7qjl7 w u p p yw y4jx7uxy&quot;c77Rn&quot;l7vRVy&amp;cV c l7bcjl7&quot;c7Rv7lcVx7uvRxV7l7yRxllR7cVfc 7 w w p p w y u p u yw p u p
UNC - COMP - 110
Comp 110-002 - Assignment 6: Structured Objects and GraphicsDate Assigned: Wed Oct 17, 2007 Completion Date: Fri Oct 26 (midnight) Early Submission Date: Wed Oct 24, 2007 (midnight)In this assignment, you will gain first-hand experience with graphi
UNC - COMP - 110
Comp 110-002 - Assignment 3: Temperature SpreadsheetDate Assigned: Fri Sep 14, 2007 Completion Date: Fri Sep 21, 2007 (midnight) Early Submission Date: Wed Sep 19, 2007 (midnight)In this assignment, you will create spreadsheet versions of the tempe
UNC - COMP - 110
Comp 110-002 - Assignment 5: Style &amp; ExpressionsDate Assigned: Fri Sep 28, 2007 Completion Date: Fri Oct 5, 2007 (midnight) Early Submission Date: Wed Oct 3, 2007 (midnight) Part 4 bonus: 4 pointsIn this assignment, you will learn how to avoid code
UNC - COMP - 110
Comp 110-002 - Assignment 4: Alternative Implementations andInterfacesDate Assigned: Fri Sep 21, 2007 Completion Date: Fri Sep 28, 2007 (midnight) Early Submission Date: Wed Sep 26, 2007 (midnight)In this assignment, you will create two implementat
UNC - COMP - 110
COMP 110 Prasun Dewan110. Main and Console InputIt is time, finally, to remove the training wheels of ObjectEditor and try to write a complete Java program. This means we must ourselves write a main method that implements the user-interface rather
UNC - COMP - 114
COMP 110 Prasun Dewan110. Main and Console InputIt is time, finally, to remove the training wheels of ObjectEditor and try to write a complete Java program. This means we must ourselves write a main method that implements the user-interface rather
UNC - COMP - 110
Comp 110-002 - Assignment 1: Writing a Temperature ConverterDate Assigned: Fri Aug 24, 2007 Completion Date: Fri Aug 31, 2007 Wed Sep 5, 2007 (midnight) Early Submission Date: Wed Sep 3, 2007 (midnight)In this assignment, you will use a bare-bone e
UNC - COMP - 110
COMP 110RECITATION 1 DELIVERABLEInstructor: Sasa JunuzovicAGENDAThe goal for the deliverable is to explore the ObjectEditorComp110 program that you have compiled Go through all the possible options and try them! Focus on the options available
UNC - COMP - 110
COMP 110RECITATION 1 JAVA INSTALLATIONInstructor: Sasa JunuzovicAGENDAQuestions Announcements Software Installation Bare-bone environmentRunning the First Java Program2ANNOUNCEMENTSHonor Code PledgeCheck Assignments on Blackbo
UNC - COMP - 110
Comp 110-002 - Assignment 7: Main and Console InputDate Assigned: Fri Nov 2, 2007 Completion Date: Mon Nov 12 (midnight) Early Submission Date: Fri Nov 9, 2007 (midnight)In this assignment, you will learn about main, console input, if statements, a