INFS3450 – Quantitative Analysis for Information Systems Professionals

Robert Morris University - Computer & Information Systems

Formal Structures: Practical Application Examples

 

Topic 1

Introduction

1.1

 

Topic 2

Logic

2.1

Processor design: use of Boolean algebra and combinatorial circuits; see Demonstration WinLogiLab, by Charles Hacker, Electronics and Signal Processing Group, Griffith University, Gold Coast, Queensland, Australia: http://www.gu.edu.au/school/eng/mmt/WinLLab.html [2005 Web Version 3.8].

2.2

Fluid chip does binary logic, by Kimberly Patch, Technology Research News, October 6/13, 2004: http://trnmag.com/Stories/2004/100604/Fluid_chip_does_binary_logic_100604.html

2.3

An application of Prolog was demonstrated at the 2003 Fall Symposium of the American Medical Informatics Association (AMIA) in Washington, DC, by a team from the University of Health Informatics and Technology of Tyrol (UMIT or Universität für Medizinische Informatik und Technik Tirol (Institut für Medizinische Wissensrepräsentation und Visualisierung = Institute for Medical Knowledge Representation and Visualization)), Innsbruck, Austria: “Mereotopological Reasoning in Anatomy.” Carsten Pantow of UMIT provided the RMU C&IS program with demonstration Prolog code.

2.4

Simplification of Circuits: see http://www.allaboutcircuits.com/vol_4/chpt_7/6.html See also WinBoolean and WinEspresso modules of Demonstration WinLogiLab, by Charles Hacker, Electronics and Signal Processing Group, Griffith University, Gold Coast, Queensland, Australia: http://www.gu.edu.au/school/eng/mmt/WinLLab.html [2005 Web Version 3.8]. See also Michael Keppler, Technische Universität Ilmenau, Karnaugh animation: http://www-ihs.theoinf.tu-ilmenau.de/~sane/projekte/karnaugh/embed_karnaugh.html See Dr.-Ing. Heinz-Dietrich Wuttke, Dr.-Ing. Karsten Henke, TU-Ilmenau, Interaktive Arbeitsblätter zur Vorlesung: Schaltsystem: http://www-ihs.theoinf.tu-ilmenau.de/~sane/skript_new/node24.html#SECTION00040000000000000000

2.5

NAND Flash Memory vs. NOR Flash Memory: see http://www.linuxdevices.com/articles/AT4422361427.html

Topic 3

Sets

3.1

Graphic design: application of set operations – Adobe ® After Effects ® 5.5 Mask Mode – used in RMU COMM3430 Motion Graphics.

3.2

Venn diagrams in the representation of wireless protocols; see Andrew S. Tanenbaum, Computer Networks, 4th ed. (Prentice Hall, 2003) for MACA and Bluetooth examples.

3.3

Set operations: Use of intersection in the semi-join in distributed databases: Roger Schrag, “Speeding Up Queries” at http://www.dbspecialists.com/presentations/semijoins.html

Topic 4

Sequences and Strings

4.1

Programming: manipulation of strings within the context of a particular language: C, C++, C#, Visual BASIC, Perl, Caché ObjectScript, M/MUMPS, etc. Appropriate searching will lead to language-specific treatments of strings and sequences.

Topic 5

Number Systems and Representation of Numbers

5.1

Number representation and concepts involved in scientific notation: floating point representation. See site dealing with IEEE 754-1985 standard relating to floating point operation - Pittsburgh Supercomputing Center page on floating point arithmetic: http://www.psc.edu/general/software/packages/ieee/ieee.html - note provision for double precision

5.2

u Practice with Scientific Notation: Electromagnetic Spectrum (INFS3230, INFS4410): Wavelengths and frequencies, Hyperphysics module (by C. R. Nave), Department of Physics and Astronomy, Georgia State University: http://hyperphysics.phy-astr.gsu.edu/hbase/ems1.html

5.3

u Binary Numbers in Internet Subnetting.
Mobrien.com “net tools” and “scripts and hacker tools” - subnet calculations: http://library.mobrien.com/net.shtml  ; see other tools at this site: http://library.mobrien.com/index.shtml - thanks to Amber Angel-Hajos
See also IP CIDR Calculator at: http://www.subnet-calculator.com/supernet/supernetting.php . Classless Inter-Domain Routing (CIDR) in Internet technology. Pacific Bell Classless Inter-Domain Routing (CIDR) Overview at: http://public.pacbell.net/dedicated/cidr.html See also “TCP/IP Guide” at http://www.tcpipguide.com/free/t_IPClasslessAddressingClasslessInterDomainRoutingCI.htm and Hewlett Packard (HP) “CIDR Classless Inter-Domain Routing” at http://docs.hp.com/en/B2355-90748/ch06s10.html

Topic 6

Relations, Functions, and Operators

6.1

Programming: functions as examples of the ordering used in prefix notation.

6.2

Partial Order for TCP in the Internet: see RFC 1693, “An Extension to TCP : Partial Order Service,” at http://tools.ietf.org/html/rfc1693 or http://www.apps.ietf.org/rfc/rfc1693.html 

One motivating application for a partial order service is the emerging area of multimedia communications. Multimedia traffic is often characterized either by periodic, synchronized parallel streams of information (e.g., combined audio-video), or by structured image streams (e.g., displays of multiple overlapping and nonoverlapping windows). These applications have a high degree of tolerance for less-than-fully-ordered data transport as well as data loss. Thus they are ideal candidates for using a partial order, partial reliability service. In general, any application which communicates parallel and/or independent data structures may potentially be able to profit from a partial order service.

A second application that could benefit from a partial order service involves remote or distributed databases. Imagine the case where a database user transmitting queries to a remote server expects objects (or records) to be returned in some order, although not necessarily total order. For example a user writing an SQL data query might specify this with the "order by" clause. There exist today a great number of commercial implementations of distributed databases which utilize - and thus are penalized by - an ordered delivery service.

See also: Amer, P., Chassot, C., Connolly, T., and M. Diaz, "Partial Order Transport Service for Multimedia pplications: Unreliable Service", Proc. INET '93, San Francisco, August 1993.

6.3

Partial Order in Collaboration, from The 2006 International Symposium on Collaborative Technologies and Systems (CTS 2006): http://www.engr.udayton.edu/faculty/wsmari/cts06/ttcts06.html

Topic 7

Counting, Randomization, Permutations, and Combinations

7.1

Generating test data: Edward Rosenbaum, page on shareware programs for name permutation generation at http://erosenbaum.netfirms.com/ Consider the usefulness of name permutation generation in generating test data.

7.2

John C. Pezzullo, a page on random number generation for statistical purposes at http://members.aol.com/johnp71/javastat.html and link to page covering random number generation. See also http://www.statistics.com/content/javastat.html

7.3

Ion Saliu’s page on permutations, combinations, and related topics at http://www.saliu.com/permutations.html This page has a focus on lottery and gambling issues.

7.4

Knot theory (topology, combinatorics): http://www.freelearning.com/knots/ and http://www.c3.lanl.gov/mega-math/gloss/knots/knots.html and http://www.mapleapps.com/categories/mathematics/Knot%20theory/html/Knots.htm . Note applications in genetics and analysis of DNA: http://www.freelearning.com/knots/today.htm

Topic 8

Relational Database Concepts

8.1

Functional dependencies in database design:

Topic 9

Algorithms and Recursion

9.1

Algorithmic program checking in Aλgovista, Christian Collberg, Computer Science, University of Arizona, and Todd A. Proebsting, Microsoft Research, at http://www.cs.arizona.edu/~collberg/Research/AlgoVista/index.html . Described in Collberg, Christian, Kobourov, Stephen G., and Westbrook, Suzanne, “Algovista: an Algorithmic Search Tool in an Educational Setting,” Proceedings of 35th ACM SIGCSE Symposium, Norfolk, VA, 2004, pp. 462-466.

9.2

Application of Lindenmeyer Systems (L-Systems), See Lindenmeyer Systems and biological growth simulation, Texas A&M University, at http://acadia2000.tamu.edu/exhibit/DME/2000_49/moss1.htm

Java Lindenmeyer Systems, by T. Fischer, at http://jlsystem.sourceforge.net/

L-Systems Explorer, by James Matthews, at http://www.generation5.org/content/2002/lse.asp

Topic 10

Codes, Encryption, and Compression

10.1

Security – RSA demo by Richard Holowczak, Computer Information Systems Program, Zicklin School of Business, Baruch College, CUNY, New York, NY: http://cisnet.baruch.cuny.edu/holowczak/classes/9444/rsademo/

10.2

Security - about public key encryption: Stephen Levy, Crypto : how the code rebels beat the government-- saving privacy in the digital age (Viking Penguin, 2002). RMU Libraries
005.8 L668c 2002 : See also http://mosaic.echonyc.com/~steven/crypto.html and review "Crypto: Three Decades in Review" by Declan McCullagh in Wired (2001): http://www.wired.com/news/politics/0,1283,41071,00.html

10.3

Security – examples of use of set theory and graph theory in Dakshi Agrawal and Dogan Kesdogan, “Measuring Anonymity: The Disclosure Attack,” IEEE Security & Privacy 1, 6 (November/December 2003): 27-34.

10.4

Huffman coding, compression in Data Mining – Sushita Mitra and Tinku Acharya, Data Mining: Multimedia, Soft Computing, and Bioinformatics (Wiley, 20043), §3.6.2. Huffman coding. pp. 100ff.

10.5

Walsh Code Generator (CDMA), IS-95A; see http://www.mathworks.com/access/helpdesk/help/toolbox/cdma/is95awalshcodegenerator.html ; for definition see: http://www.answers.com/topic/walsh-code

Topic 11

Graphs, Trees, and Networks

11.1

Routing information protocols: Open Shortest Path First (OSPF), see: Douglas E. Comer, Computer Networks and Internets with Internet Applications, 3rd ed. (Prentice Hall, 2001)

11.2

Spanning trees in Internet multicast routing: see Andrew S. Tanenbaum, Computer Networks, 4th ed. (Prentice Hall, 2003); and: http://ntrg.cs.tcd.ie/undergrad/4ba2/multicast/eoghan/ (Network Telecommunications and Research Group, Department of Computer Science, Trinity College Dublin)
Spanning Tree Protocol in IEEE 802.1D: see Jerry FitzGerald and Alan Dennis, Business Data Communications and Networking, 8th ed. (Wiley, 2005); and: http://www.javvin.com/protocolSTP.html (Javvin Company).

11.3

Graph theory in network design: Stephen H. Wildstrom, “A Better Web Through Higher Math,” Business Week Online, January 22, 2002; see http://www.businessweek.com/bwdaily/dnflash/jan2002/nf20020122_8839.htm

11.4

Deadlock detection and resolution: resource allocation graphs and graph reduction; see William Stallings, Operating Systems, Internals and Design Principles, 4th ed. (Prentice Hall, 2001); Ida M. Flynn and Ann McIver McHoes, Understanding Operating Systems, 3rd ed. (Brooks/Cole, 2001); and Richard C. Holt, “Some Deadlock Properties of Computer Systems,” Computing Surveys 4, 3 (September 1972): 179-196.

11.5

Weighted graphs: Maximum Transmission Units (MTUs) in networks; see Douglas E. Comer, Computer Networks and Internets with Internet Applications, 3rd ed. (Prentice Hall, 2001) and also MTUs and the TCP Protocol in §6.5.3, Andrew S. Tanenbaum, Computer Networks, 4th ed. (Prentice Hall, 2003).

11.6

Programming: INFS3140/INFS3141 Students: apply graph and tree concepts and terminology to local and global arrays in ISO M and Caché ObjectScript – see Array Diagrams (with notes on the $DATA function) and the $ORDER Function . Note pre-order traversal using the $QUERY function.

11.7

Databases: Hasse diagrams in determining the order of creating tables, loading data, and dropping tables; see Valerie J. Harvey, Brian Harris, E. Gregory Holdan, Mark M. Maxwell, David F. Wood, eds., Discrete Mathematics Applications for Information Systems Professionals (Pearson, 2003).

11.8

Graph Coloring and Cell Phones: Joseph Malkevitch, Mathematics and Computing Department, York College (CUNY), Jamaica, New York, optimal cell configurations, maximizing call capacity of a frequency band: http://www.york.cuny.edu/~malk/tidbits/tidbit-cellphone.html Colorful Mathematics, Part IV, American Mathematical Society (AMS), mathematical models for cell phone technology: http://www.ams.org/featurecolumn/archive/colorapp5.html

11.9

Security: subgraph isomorphism in intelligence analysis: Thayne Coffman, Seth Greenblatt, and Sherry Marcus, “Graph-Based Technologies for Intelligence Analysis,” CACM 47, 3 (March 2004): 45-47.

11.10

Social Network Analysis: "Identifying and Analyzing Social Networks in an Organization Through the Use of Email Communication Logs, " D.Sc. Field Project, RMU, by Andrew Huggins, 2006. See also: Bartczak, S., Mills, R., Petersen, G., and Yee, J., Automatic Generation of social network data from electronic-mail communications, Air Force Institute of Technology, http://www.dodccrp.org/events/2005/10th/CD/papers/207.pdf .

11.11

Decision Tree Classifiers - Sushita Mitra and Tinku Acharya, Data Mining: Multimedia, Soft Computing, and Bioinformatics (Wiley, 20043), §5.2, pp. 184ff.

11.12

PERT Charts (Networks), see “PERT,” Internet Center for Management and Business Administration, Inc., at http://www.netmba.com/operations/project/pert/

Topic 12

Automata and Pattern Matching

12.1

Finite state diagrams in documenting operating system concepts: see William Stallings, Operating Systems, Internals and Design Principles, 4th ed. (Prentice Hall, 2001)

12.2

Petri nets in enterprise process modeling: Nikunj P. Dalal, Manjunath Kamath, William J. Kolarik, and Eswar Sivaraman, “Toward an Integrated Framework for Modeling Enterprise Processes,” CACM 47, 3 (March 2004): 83-87.

12.3

Linear-Order String Matching Algorithms in Data Mining - Sushita Mitra and Tinku Acharya, Data Mining: Multimedia, Soft Computing, and Bioinformatics (Wiley, 20043), §4.2, pp. 150ff. String Matching with finite automata, §4.3 String matching in Bioinformatics,

12.4

State Diagrams – LabView State Chart Module: http://digital.ni.com/demo.nsf/websearch/4CFCBE4EBE1CBCAE8625700C007A43B4?OpenDocument&node=10447_US

Topic 13

Documentation of Computer Languages

13.1

BNF examples.

Topic 14

Summary

 

RMU C&IS INFS3450A – 2011-09-19 - Contact: Valerie J. H, Powell, RT(R), PhD: Powell@rmu.edu .