61. JSU Department Of Computer Science set architecture, memory hierarchy, interfacing and communication, and pipelining. CSC 403 (3) computer science Seminar Prerequisite Senior level with 15 http://ebony.jsums.edu/~csc/ugrad_cdescrip2.html

Computer Science Department Home Information Undergraduate Objectives Curriculum Course Descriptions Graduate Objectives Curriculum Course Descriptions People Faculty Staff Organizations ACM Links JSU Homepage Graduate School Engineering Dept GIS ... SciVis Undergraduate Course Descriptions CSC 115 (3) Digital Computer Principles Subject matter consists of word processing, spreadsheet, database, graphics, computing, data processing, the organization of a computer, input and output devices, number systems, internal data representation and an introduction to a high-level programming language. (F, S, Sum) CSC 117 (3) FORTRAN Prerequisite: CSC 115 or Equivalent. Topics include definition of language syntax and semantics, structured programming, sub-programs and basic algorithm design. Students are required to write several programs and to achieve successful computer execution of them. Credit not allowed as a Computer Science Elective for the Computer Science Degree. (S) CSC 118 (3) Programming Fundamentals Prerequisite: Math 118 or Equivalent, CSC 115 or Equivalent. Co-requisite CSCL 118 This is the first course in the computer science programming sequence and is required of all computer science majors. Course objectives include: introduction to problem solving methods and algorithm development; definition of language syntax and semantics of a high level programming language (Java); and developing the ability to design, code, debug, document, and successfully execute programs. Topics include objects and classes, data types, applets and graphics, decision statements, iteration, methods, testing and debugging, arrays, sorting and searching, inheritance, interfaces and polymorphism. (F, S)

62. Lawrence Academics Computer Science Courses processor organization that illustrate microprogramming, pipelining, parallelism, and reduced instruction sets. 6 units. Prerequisite computer science 270 or http://www.lawrence.edu/academics/cmsc/cdescriptions.shtml

Academics Courses of Study Cooperative degree programs Pre-professional study ... The Lawrence faculty Top level links About Lawrence Student Life Academics Conservatory Library Special Programs Athletics Prospectives Current Students Alumni Parents Visitors Computer Science Courses CMSC 100 Exploring Computer Science An overview of computer science as a broadly based discipline. Emphasis on development of skills in algorithmic thinking, implemented in a subset of a suitable programming language. Brief coverage of selected advanced topics from computer science, applications of computing in other disciplines, and impacts of computing on society. 6 units. Not intended as preparation for Computer Science 250 or 270. Enrollment limit: 24 per section. CMSC 150 Introduction to Computer Science An introduction to computer programming for potential mathematics/computer science majors and other students with a strong interest in computing. Topics include elementary programming constructs, design and implementation of algorithms, and object-oriented programming. Introductory instruction in the Java language. 6 units. Enrollment limit: 24 per section. CMSC 170 Special Topics in Computer Languages Essential programming techniques in a specified language. Offered only on a write-for-credit S/U basis. 3 units. Prerequisite: Computer Science 100 or 150.

63. COMPUTER SCIENCE TECHNICAL REPORT ABSTRACTS CS98-127 computer science Department School of computer science, Carnegie Mellon list ranking, dictionaries, balanced trees, treaps, pipelining, set operations http://reports-archive.adm.cs.cmu.edu/anon/1998/abstracts/98-127.html

CMU-CS-98-127 Computer Science Department School of Computer Science, Carnegie Mellon University CMU-CS-98-127 Experiments with Parallel Pointer-Based Algorithms Margaret Reid-Miller May 1998 Ph.D. Thesis Unavailable Electronically Keywords: PRAM, algorithms, list ranking, dictionaries, balanced trees, treaps, pipelining, set operations, pointer-based implementation The algorithms as implemented, however, do not have optimal depth (parallel time). This dissertation shows how to reduce the depth of the tree algorithms to make them optimal by using pipelining. Pipelining has been used previously, but the method used here allows for asynchronous execution and for pipeline delays that are data dependent and dynamic. Rather than making the coding more difficult, the method lets the user write the algorithms using futures (a parallel language construct) and leaves the management of the pipelining to an efficient runtime system. To determine the runtime of algorithms, I first analyze the algorithms in a language-based cost model in terms of work and depth of the computations, and then show universal bounds for implementing the language on various machines. 100 pages Return to: SCS Technical Report Collection School of Computer Science homepage This page maintained by reports@cs.cmu.edu

64. EECS | Graduate | Computer Science Qualifiers PAGEamp Comprehensives CS Graduate Program Core Requirements and computer science Qualifiers. Page Topics 1. computer Performance pp. 6989 3. pipelining pp. http://www.eecs.lehigh.edu/graduate/cs-qualifiers.html

OLD EECS site This site is now obslete. See the ECE and CSE department pages. Upcoming Events Undergraduate Graduate Research ... Miscellaneous You should visit the new ECE or CSE department's web pages. CS Graduate Program Core Requirements and Computer Science Qualifiers Page Topics: Qualifiers General Information Comprehensives (general information) CS Graduate "comprehensives" MS in CS Core requirements ... Old CS Graduate Qualifier reading lists Preface: The fundamental concepts of a qualifier is as a test of the student's ability to reason in a limited area of research; comprehensives are to ensure the students have a suitable breadth of knowledge. The qualifier should be taken as soon as possible while the comprehensives should be completed before a student graduates. Qualifiers General Information: Any group of 3 faculty may propose a "qualifier" area. To do so they must provide, by the end of the fall term, a reading list that defined at most 300 pages of material for which the student is responsible. The faculty may also provide a few "questions" to help the students focus while reading the material. The associated faculty then make up and administer the qualifier. The qualifiers will be offered in mid/late January. If a student does not pass the initial attempt, a second attempt may be made at a time mutually agreeable to the examination committee and the student. (It is expected to be within a few weeks). In all cases the qualifier must be completed before the end of the spring term. (The additional time is intended to allow students who had an off day to recover.) The same timing requirements apply to part-time Ph.D.'s as well.

65. Publications About 'macro-pipelining' Processing, volume 1123 of Lecture Notes in computer science, pages 459462, August 1996. Springer Verlag. Keywords macro-pipelining, HPF, communication http://graal.ens-lyon.fr/~desprez/FILES/RESEARCH/publis/all/Keyword/MACRO-PIPELI

BACK TO INDEX Publications about 'macro-pipelining' Thesis F. Desprez Procédures de base pour le calcul scientifique sur machines parallèles à mémoire distribuée . PhD thesis, Institut National Polytechnique de Grenoble, January 1994. Note: En français. Keywords: parallel linear algebra reconfiguration macro-pipelining application ... F. Desprez and B. Tourancheau LOCCS: Low Overhead Communication and Computation Subroutines Future Generation Computer Systems Keywords: macro-pipelining bibtex-entry Conference's articles F. Desprez and S. Domas Efficient Pipelining of Level 3 BLAS Routines . In 4th international meeting VECPAR 2000 , volume 3, Porto, pages 675-688, June 2000. Keywords: macro-pipelining parallel linear algebra bibtex-entry F. Chaussumier ... F. Desprez , and M. Loi Efficient Load-Balancing and Communication Overlap in Parallel Shear-Warp Algorithm on a Cluster of PCs . In P. Amestoy, P. Berger, M. Daydé, I. Duff, V. Frayssé, L. Giraud, and D. Ruiz, editors, Proceedings of EuroPAR'99 , number 1685 of Lecture Notes in Computer Science, Toulouse, pages 570-577, 1999. Springer Verlag. [ PDF Keywords: macro-pipelining communication overlap load-balancing volume rendering ... F. Desprez

66. Publications Of Year 1996 462}, publisher = {Springer Verlag}, series = {Lecture Notes in computer science}, year = 1996 , month = AUG, KEYWORD = {macropipelining, HPF, communication http://graal.ens-lyon.fr/~desprez/FILES/RESEARCH/publis/all/Year/1996.complete.h

BACK TO INDEX Publications of year 1996 Articles in journal or book's chapters A. Darte F. Desprez J.C. Mignot , and Y. Robert TransTool: A Restructuring Tool for the Parallelization of Applications Using High Performance Fortran Journal of the Brazilian Computer Society , 3(2):5-15, November 1996. [ PDF Keywords: HPF environment automatic parallelization F. Desprez and S. Ubéda Le parallélisme dans l'industrie: rève ou réalité? Technique et Science Informatique Conference's articles T. Brandes S. Chaumette M.-C. Counilh ... J.C. Mignot , and J. Roman HPFIT: A Set of Integrated Tools for the Parallelization of Applications Using High Performance Fortran: Part II: Data Structures Visualization and HPF Extensions for Irregular Problems . In J. Dongarra and B. Tourancheau, editors, Third Workshop on Environments and Tools for Parallel Scientific Computing , Faverges, August 1996. SIAM. [ PDF Keywords: environment HPF T. Brandes S. Chaumette ... J.C. Mignot , and J. Roman HPFIT: A Set of Integrated Tools for the Parallelization of Applications Using High Performance Fortran: Part I: HPFIT and the TransTOOL Environment . In J. Dongarra and B. Tourancheau, editors

67. 2003-04 Bulletin - Nicholls State University CPU design and organization, parallel and vector computers, pipelining, RlSCs, interconnection Students are required to take the computer science ETS Field Test http://www.nicholls.edu/acad/bulletin/Courses/coicmps.html

68. COMPUTER SCIENCE computer architecture, instruction set design, processor implementation techniques, pipelining, parallel processing CSC 475 Internship in computer science 3 cr http://www.lsus.edu/catalogs/catalog9899/catcsc.htm

COMPUTER SCIENCE CSC 101: Introduction to the Internet 3 cr. Introduction to the fundamentals of the Internet as well as the fundamentals of data communications. Students will learn to use the Internet for research and communication, including publishing materials on the World Wide Web. Three hours of lecture. CSC 105: Introduction to Computer-based Multimedia 3 cr. Introduction to the fundamentals of computer-based multimedia technologies and to the use of authoring applications and tools for creating and manipulating multimedia content. One application area covered will be the creation of internet Web pages. Three hours of lecture. CSC 111: Introduction to Computing 3 cr. A survey of computing terminology and computing applications. Hands on activities using an integrated software package for word processing, spreadsheets and database management. Introduction to the Internet with applications. Three hours of lecture. CSC 112: Structured Programming 3 cr. Prerequisites: Credit for or registration in MATH 121 as well as computer literacy equivalent to CSC 111. Problem solving and algorithm development using a specific high-level computer programming language. The design, coding, debugging and documenting of programs using techniques of good programming style. Three hours of lecture.

69. Course List - OSU Online Catalog in the design of instruction set architecture, processor, pipelining and memory PREREQ Graduate standing in computer science or instructor approval required. http://catalog.oregonstate.edu/CourseList.aspx?level=grad&subjectcode=CS

70. Undergraduate Catalog: Computer Science And Engineering - SMU with an opportunity to apply their computer science and software control, algorithms for computer arithmetic, microprocessors, and pipelining. http://www.smu.edu/catalogs/undergrad/seas/cse.asp

Enrollment Services Home Right To Know and Other Legal Disclosures Get Hard Copies of the Catalogs About This Document ... Ask the Web Coordinator School of Engineering Computer Science and Engineering Professor El-Rewini, Chair Professors: M. Dunham, El-Rewini, Matula, Szygenda; Associate Professors: J. Dunham, Nair, Thornton, Tian; Assistant Professors: Kocan, Seidel; Lecturers: Coyle, D. Evans, Etchison; Adjunct Faculty: Bralick, Frailey, Kapoor, Mohamed, Moore, Oshana, Ozbirn, Pfister, Riccomi, Russo, Singh, Stepoway, Zhang. Have a thorough understanding of personal and professional ethics. Can effectively communicate engineering problems and solutions, both in an oral and written format. Have demonstrated the ability to apply mathematical knowledge to software/architectural design problems. This includes a basic mathematical background in discrete math, differential and integral calculus, and probability and statistics. Have demonstrated the ability to apply scientic knowledge.

71. Computer Science Level 3 Courses and control; pipelining, handling and pipeline hazards; Memory that typically arise in computer applications and simulations, science, engineering and http://www.cs.adelaide.edu.au/for/future/education/level3/

72. COMPUTER SCIENCE Fundamentals of computer design; instruction set design, basic processor implementation techniques; pipelining; memory hierarchy Topics in computer science. http://www.uncc.edu/gradmiss/catalog/ComputerScience.htm

Computer Science Computer Science Kennedy Bldg 201 http://www.cs.uncc.edu Degree M.S. Coordinator Dr. Zbigniew W. Ras Graduate Faculty C. Michael Allen, Professor Keh-Hsun Chen, Associate Professor Teresa Dahlberg, Assistant Professor Essam El-Kwae, Assistant Professor Jianping Fan, Assistant Professor Junsheng Long, Associate Professor Zbigniew Michalewicz, Professor Taghi Mostafavi, Associate Professor Kayvan Najarian, Assistant Professor Zbigniew Ras, Professor Min Shin, Assistant Professor K.R. Subramanian, Associate Professor Barry Wilkinson, Professor Xintao Wu, Assistant Professor Jing Xiao, Associate Professor Adjuncts Lech Banachowski, Professor Alicja Wieczorkowska, Assistant Professor Program of Study The objective of the computer science program leading to the Master of Science degree is to provide advanced skills and knowledge in the planning, design, implementation, testing and management of computer systems. These skills are necessary for dealing with the problems encountered in business, industry, and governmental computer applications; for holding administrative or engineering positions requiring the planning and implementation of computer systems; for teaching computer science; and/or further study in computer science, in particular, for doctoral study. The primary areas of interest are: biomedical information processing, computer networks and communication, computational intelligence, decision support systems, geometric reasoning, modeling and computation, graphics, multi-media and visualization, image processing and computer vision, intelligent information systems, knowledge discovery and data mining, parallel and distributed computing, robotic systems, and software engineering.

73. Computer Science, Fall Term 1990 LS&A Course Guide CS 470. (3). (Excl). pipelining and operation overlapping, SIMD and MIMD architectures. 574/EECS 574. Theoretical computer science I. CS 476. (4). (Excl). http://www.lsa.umich.edu/saa/publications/courseguide/fall/archive/fall90.cg/Com

Courses in Computer Science (Division 353) 181/EECS 181. Introduction to Computer Systems. Credit is granted for only one course among CS 181, Engin. 103, and Engin. 104. (4). (NS). Introduces students to computers. Focuses on software, hardware, and social impact of computers. Elementary programming concepts, software packages and applications, word processing, data communications, information management, input-output, data entry, computer hardware components and storage devices, microcomputers, and ethics in computing. Programming assignments using a personal computer. Term paper required. [Cost:2] [WL:1] 216/EECS 216. Circuit Analysis. Prior or concurrent enrollment in Math. 216. (4). (Excl). Resistive circuit elements; mesh and node analysis, network theorems; network graphs and independence; energy storage elements; one- and two-time-constant circuits; phasors and a.c. steady-state analysis; complex frequency and network functions; frequency response and resonance. Lecture and laboratory. 270/EECS 270. Introduction to Logic Design.

74. Towards Efficient Fine-grain Software Pipelining Dataflow software pipelining A case study. ACAPS Design Note 06, School of computer science, McGill University, Montreal, Que., Feb. 1989. http://portal.acm.org/citation.cfm?id=255177&dl=ACM&coll=portal&CFID=11111111&CF

75. Large-grain Pipelining On Hypercube Multiprocessors not use largegrain pipelining also shows that large-grain pipelining is an Technical Report, UIUCDCS-R-86-1303, Department of computer science, University of http://portal.acm.org/citation.cfm?id=63119&jmp=abstract&dl=portal&dl=ACM&CFID=1

76. KSU Department Of Computer Science: Steps To Completing A Degree performance modeling and evaluation, computer design principles, instruction set design, pipelining and instructionlevel Area 4 Theoretical computer science. http://www.cs.kent.edu/programs/grad/completing.html?Sub=Areas

77. Rice Course Schedule, Spring 2000: Computer Science (COMP) 2000 Microprocessor architecture, including the memory hierarchy, pipelining, I/O 1064 Varman, Peter *CURRENT ENR 0 COMP 390 computer science PROJECTS Credits http://www.rice.edu/projects/courses/2000spring/COMP.html

Rice Course Schedule, Spring 2000 Computer Science (COMP) Rice Course Schedule as of 03/24/2000. This schedule is maintained by the Office of the Registrar ( reg@rice.edu Additional information about Rice courses is available on the Rice Academic Information page. See also: Building Codes Registration Information NOTE: Course web pages are available for some COMP courses. * DISTRIBUTION COURSE: GROUP III Introduction to computer organization, operating systems, programming languages, artificial intelligence, and programming. Not intended for science-engineering students. May not be taken for credit after any other programming course. 001 T 07:00PM-10:00PM DH*1064 Sachs, Eric *CURRENT ENR: COMP 200 ELEMENTS OF COMPUTER SCIENCE Credits 3.00 Spring 2000 * DISTRIBUTION COURSE: GROUP III A broad introduction to the major topics of computer science, including algorithms, mathematical models of computation, machine organization and design, programming languages, communication, and artificial intelligence. 001 MWF 11:00AM-11:50AM DH*1075 Barland, Ian *CURRENT ENR: COMP 210 INTRO PRINCIPLES SCI.COMPUTING Credits 4.00 Spring 2000

78. Take Computer Science Courses Classes - Columbia University Summer Session, New I. 3 points Course Fee $5 Prerequisites computer science W3139 or W3131 Implementations of basic computer under various clocking assumptions. pipelining. http://www.ce.columbia.edu/summer/compsci.cfm

Summer Home Courses Program Information Financing ... View Another Department Summer Session Computer Science Summer 2004 Departmental Representative: Prof. Jonathan Gross, 450 Computer Science Telephone: 212-939-7000 E-mail: gross@cs.columbia.edu Departmental Contact: Anamika Singh, 450 Computer Science Telephone: 212-854-8112 E-mail: anamika@cs.columbia.edu Persons who wish to enroll in noncredit information technology courses should apply to one of the Information Technology Programs. Computer Science S1001Q. Introduction to computers. 3 points Course Fee: $5 Intended primarily for students in the humanities and not available to engineering students. General introduction to computer science, including the design of algorithms and computer hardware, as well as hands-on experience with applications such as spreadsheets, databases, and the Web. Introductory programming in Java. Dates Offered Section Days and Time Instructor July 6 - August 13 Makeup Date: July 16 Sec. 1 get call number and location MW 5:40-8:50 p.m. M. Locasto

79. Some Computer Science Issues In Ubiquitous Computing Some computer science Issues in. Ubiquitous Computing. Mark Weiser. March 23, 1993 to appear in CACM, July 1993 Lyon 93. One key approach is to reduce the clocking frequency of their chips by http://nano.xerox.com/hypertext/weiser/UbiCACM.html

Ubiquitous Computing Some Computer Science Issues in Ubiquitous Computing Mark Weiser March 23, 1993 [to appear in CACM, July 1993] Ubiquitous computing is the method of enhancing computer use by making many computers available throughout the physical environment, but making them effectively invisible to the user. Since we started this work at Xerox PARC in 1988, a number of researchers around the world have begun to work in the ubiquitous computing framework. This paper explains what is new and different about the computer science in ubiquitous computing. It starts with a brief overview of ubiquitous computing, and then elaborates through a series of examples drawn from various subdisciplines of computer science: hardware components (e.g. chips), network protocols, interaction substrates (e.g. software for screens and pens), applications, privacy, and computational methods. Ubiquitous computing offers a framework for new and exciting research across the spectrum of computer science. The idea of ubiquitous computing first arose from contemplating the place of today's computer in actual activities of everyday life. In particular, anthropological studies of work life [Suchman 1985, Lave 1991] teach us that people primarily work in a world of shared situations and unexamined technological skills. However the computer today is isolated and isolating from the overall situation, and fails to get out of the way of the work. In other words, rather than being a tool through which we work, and so which disappears from our awareness, the computer too often remains the focus of attention. And this is true throughout the domain of personal computing as currently implemented and discussed for the future, whether one thinks of PC's, palmtops, or dynabooks. The characterization of the future computer as the "intimate computer" [Kay 1991], or "rather like a human assistant" [Tesler 1991] makes this attention to the machine itself particularly apparent.

80. CS 61C Spring 2004 : Machine Structures M, Single CPU Design Control II (pdf, pdf6up, ppt), Lab13 Pipeline (txt), PROJ3 The only prerequisite is that you have taken computer science 61B, or at least http://www-inst.eecs.berkeley.edu/~cs61c/

Machine Structures. Spring 2004, UC Berkeley CS61C Spring 2004 MWF 1-2pm, 2050 VLSB News Calendar Schedule Staff ... PRS Timely Announcements The final exam has been graded, EPA! points calculated, and grades sent to Sproul. They should appear by the end of this week. Thanks for a great semester! Statistics to come... (We pushed grades up by 7 points after it was all done) [Old News] Lecture, Reading, and Quiz Calendar Homeworks (HW) are graded on correctness and are due on Mondays at 11.59pm (except HW0, due in discussion, and HW1, due on Wednesday 2004-01-28) Labs are to be completed during your 2-hour lab time! (unless your TA explicitly offers 'delayed-checkoff') Reading quizzes are due at 11am before lecture and are graded on effort Wk Date Lecture Topic Reading Lab / Project Homework / Exam 01-19 M Holiday Lab1: Simple C and Number Rep. ( html pdf 01-21 W Course Intro ( pdf pdf-6up ppt 01-23 F Number Representation pdf pdf-6up ppt 01-26 M Introduction to C ( pdf pdf-6up ppt Quiz ... html Due HW1 Soln 01-28 W C pointers, arrays, strings pdf pdf-6up ppt Quiz 01-30 F C structures, scanf, malloc (

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

Page 4     61-80 of 87    Back | 1  | 2  | 3  | 4  | 5  | Next 20