https://cis.temple.edu/~latecki/Courses/RobotFall08/Talks/LinearProgramming.pdf
3 man-hours for finishing while a pair of cross-country skis requires 2 man-hours for cutting, 2 man-hours for shaping and 1 man-hour for finishing. Each day the company has available 140 man-hours for cutting, 120 man-hours for shaping and 150 man-hours for finishing. How many pairs of each type of ski should the company manufacture each day in order to maximize profit if a pair of downhill ...
https://cis.temple.edu/~latecki/Courses/CIS601-04/ProjectPapers/shapeRepPR04.pdf
Abstract More and more images have been generated in digital form around the world. There is a growing interest in 1nding images in large collections or from remote databases. In order to 1nd an image, the image has to be described or represented by certain features. Shape is an important visual feature of an image. Searching for images using shape features has attracted much attention. There ...
https://cis.temple.edu/~latecki/Courses/CIS166-05/Lectures/graph.ppt
Topics in enumeration; principle of inclusion and exclusion, Partial orders and lattices. Algorithmic complexity; recurrence relations, Graph theory.
https://cis.temple.edu/~tug29203/21spring-3329/lectures/ch4a.pdf
Chapter 4 Network Layer: The Data Plane A note on the use of these Powerpoint slides:
https://cis.temple.edu/~wu/teaching/Spring2020_CIS5644_Distributed_Computing/distributed-computing-2020-notes-1.pdf
A distributed system is collection of independent computers that appear to the users of the system as single computer.
https://ronlevygroup.cst.temple.edu/courses/2020_spring/chem5412/lectures/fep_lab_manual.pdf
The receptor protein we investigate here is called factor Xa (fXa), an important drug target in the thrombosis pathway. Several ligand molecules, or inhibitors, can bind to Factor Xa. These ligands could serve as anticoagulants that block the activity of clotting factor Xa and prevents blood clots developing or getting worse. In the lab, we compare the binding affinities of two ligands, XLC ...
https://cis.temple.edu/~latecki/Courses/CIS166-Spring09/Lectures/ch10.1.ppt
Section 10.1 Definition: Tournament Trees A Family Tree Ancestor Tree Forest Theorem Rooted Trees Rooted Trees m-ary trees Ordered Rooted Tree Properties of Trees Properties of Trees Properties of Trees Proof We know n = mi+1 (previous theorem) and n = l+i, n – no. vertices i – no. internal vertices l – no. leaves For example, i = (n-1)/m Properties of Trees Properties of Trees ...