
|
Brown Bag Seminar Series Call for Proposals OverviewThe New York State Center for Information Forensics and Assurance (CIFA) is a partnership of the University at Albany, SUNY, New York State Office of Cyber Security and Critical Infrastructure Coordination, and the New York State Police. It's mission is research and education to better enable practitioners to address real problems in information forensics and assurance, especially in the area of public protection. Specifically, CIFA: Targets the public sector workforce in an effort to build knowledge resources and practical skills within state and local government.Develops and deploys courseware for academic and professional education programs in related disciplines.Provides a home for multidisciplinary researchers and practitioners developing workable approaches to emerging information forensics and assurance issues and effective methods to facilitate learning and dissemination of these approaches.CIFA's operations emulate that of a teaching hospital where educational cases based on real problems provide learning opportunities for students and practitioners to hone their skills under the guidance of seasoned experts. In addition, problems for which there are no known solutions will be the subject of research (problem-based learning), which takes place in the Educational Research and Learning Laboratory. As problems are solved, they will be developed into new cases as the basis for future student learning experiences. In its first year of operation CIFA: Received grants of almost $1 million from the National Science Foundation, the US Department of Justice, and the US Department of Education to create the curricular materials and infrastructure needed to begin operations.Gained certification by the National Security Agency's Committee on National Security Systems under the Training Standards for Information Systems Security Professionals and Senior Systems Managers.Developed course materials and one-credit course modules in Security Fundaments, Incident Handling, Computer Forensics, Security Risk Assessment, and Security Policies. These will be made available as distance learning modules through CIFA's partnership with the Center for Education and Research in Information Assurance and Security (CERIAS) at Purdue University.Developed a partnership with other institutions of higher education to address information forensics and assurance educational issues regionally.Designed and initiated construction of its Collaborative Research and Educational Research and Learning Laboratories.DefinitionsInformation AssuranceProtection and defense of information and information systems by ensuring their availability, integrity, authentication, confidentiality, and non-repudiation, and providing for their restoration by incorporating protection, detection, and reaction capabilities.Information ForensicsThe collection of digital evidence that remains after an event or attack and its appropriate handling to secure the chain of evidence in an investigation.Information Systems SecurityProtection and defense of information systems against unauthorized access to or modification of information whether in storage, processing or transit, and against the denial of service to authorized users, including those measures necessary to detect, document, and counter such threats.LeadershipGeorge Berg, Co-Director
|
NSA CertificationThrough CIFA's efforts, UAlbany's educational programs have been certified by the National Security Agency's Committee on National Security Systems (CNSS) in the following areas. |
|
Information Forensics and Assurance is an inter-disciplinary area of study, and it is expected that more such fruitful collaborations will blossom under the umbrella of CIFA. There is a long history of collaborations in research between CIFA affiliates. While most collaborations in the past have been within the disciplines (for example primarily between Computer Scientists, such as Bloniarz-Rosenkrantz, Ravi-Rosenkrantz, Narendran-Rosenkrantz, Ravi-Rosenkrantz, Narendran-Chaiken, Chaiken-Murray), since the 1980s, cross-disciplinary collaborations have developed in teams spannin g colleges within the university. Examples of such collaborations includethose between Ravi and Rosenkrantz (Computer Science) and Tayi (Management Science & Information Systems, School of Business), and those between Ravi and Rosenkrantz (Computer Science), Sanjay Goel (Management Science & Information Systems, School of Business) and Gangolly (Accounting & Law, School of Business). The list below provides a partial list of publications where at least two CIFA affiliates are authors.
Barrett, C. L., Hunt, H. B. III, Marathe, M. V., Ravi, S. S., Rosenkrantz, D. J., and Stearns, R. E., "Analysis Problems for Sequential Dynamical Systems and Communicating State Machines", Proc. 26th Intl. Symp. On Mathematical Foundations of Computer Science (MFCS 2001), Lecture Notes in Computer Science, Vol. 2136, Springer-Verlag, Edited by J. Sgall, A. Pultr and P. Kolman, Marianske Lazne, Czech Republic, Aug. 2001, pp. 159-172.
Barrett, C., Hunt, H. B. III, Marathe, M. V., Ravi, S. S., Rosenkrantz, D. J., Stearns, R. E., and Tosic, P., "Garden of Eden and Fixed Point Configurations in Sequential Dynamical Systems," Discrete Mathematics and Theoretical Computer Science, Special issue - Proc. Intl. Conf. on Discrete Models: Combinatorics, Computation and Geometry (DM-CCG 2001), Paris, France, July 2001, 95-110.
Barrett, C., Hunt, H. B. III, Marathe, M. V., Ravi, S. S., Rosenkrantz, D. J., and Stearns, R. E., "Reachability Problems for Sequential Dynamical Systems with Threshold Functions", Theoretical Computer Science, 295, 1- 3, Feb. 2003, 41-64.
Chaiken, S., N.V. Murray and E. Rosenthal. ``An Application of P4-Free Graphs in Theorem Proving.'' In Combinatorial Mathematics: Proceedings of the Third International Conference, New York, June 1985. In Annals of The New York Academy of Sciences, Vol. 555. New York, 1989, 106-121.
Chakravarty, S., H. B. Hunt III, S. S. Ravi and D. J. Rosenkrantz, The Complexity of Test Generation for PLAs and Monotone Combinationali Circuits, IEEE Transactions on Computers, Vol. 38, No. 6, June 1989, pp. 865-869.
Chakravarty, S., Hunt, H. B. III, Ravi, S. S., and Rosenkrantz, D. J., "On the Complexity of Generating Minimum Test Sets for PLAs and Monotone Combinational Circuits," IEEE Trans. Computers, 38, 6, June 1989, 865- 869.
Chundi, P., Narasimhan, R., Rosenkrantz, D. J., and Ravi, S. S., "Active Client Primary-Backup Protocols (Brief Announcement)," Presented at the 1995 Pacific Rim International Symposium on Fault-Tolerant Systems (PRFTS'95), Newport Beach, CA, Dec. 1995, 172-177.
Chundi, P., Narasimhan, R., Rosenkrantz, D. J., and Ravi, S. S., "Using Active Clients to Minimize Replication in Primary-Backup Protocols," Proc. Fifteenth Annual IEEE International Phoenix Conference on Computers and Communications (IPCCC'96), Phoenix, AZ, March 1996, 96-102.
Chundi, P., Rosenkrantz, D. J., and Ravi, S. S., "Deferred Updates and Data Placement in Distributed Databases," Proc. Twelfth International Conference on Data Engineering (ICDE'96), New Orleans, LA, Feb. 1996, 469-476.
Chundi, P., Rosenkrantz, D. J., and Ravi, S. S., "Multi-Site Distributed Database Transactions Utilizing Deferred Update," Proc. 1997 ACM Symposium on Applied Computing (SAC'97), San Jose, CA, Feb.-March 1997, 118-122.
Gangolly, J. and G. Tayi. An Optimization Model for Data Validation in Audit Sampling, Modelling & Simulation: Proceedings of the Sixteenth Annual Pittsburgh Conference vol. 16, part 5, 1985. Pp.1733-5.
Gangolly, J., D. Kapur, D.J. Rosenkrantz and H. Zhang. "Sufficient Completeness, Ground-Reducibility and Their Complexity," Acta Informatica 28 (1991) 311-350.
Gangolly, J., H. B. Hunt, III and D. J. Rosenkrantz. "On the Computational Complexity of Algebra on Lattices," SIAM Journal on Computing, vol. 16, no. 1 (February 1987), pp. 129-148.
Gangolly, J., H. B. Hunt, III and D. J. Rosenkrantz. J. "Algebraic Structures with Hard Equivalence and Minimization Problems," Assoc. Comput. Mach., vol. 31, no. 4 (October 1984), pp. 879-904.
Gangolly, J., H.B. Hunt, III and D.J. Rosenkrantz. "On the Complexity of Algebra on Lattices (Extended Abstract)," Seventeenth Annual Conference on Information Sciences and Systems, Baltimore, Maryland, March 1983, pp. 328 - 333.
Gangolly, J., J.C. Hidalgo and S.D. Chaiken. "Computation of Signal Delays in RC Networks," (with) presented at the Fifth NASA Symposium on VLSI Design, Albuquerque, NM, Nov. 1993.
Gangolly, J., S. S. Ravi. "An W(n log n) Lower Bound for Decomposing a Set of Points into Chains," Information Processing Letters, vol. 31, no. 6 (June, 1989), pp. 319-322.
Gangolly, J., S.S. Ravi, D.J. Rosenkrantz, and G. Tayi. Temporal Reconstruction of Authoritative Text in Legal, Accounting, and Regulatory Domains Designing the Digital Government of the 21st Century: A Multidisciplinary Workshop, NSF/Center Center for Technology in Government (Background Papers), October 1998.
Goel, S and J. Gangolly. Model For Trust Among Peers in Electronic Multiparty Transactions, 2003 AMCIS Conference.
Goel, S., Belardo, S., and Iwan, L. "A Resilient Network that Can Operate Under Duress: To Support Communication between Government Agencies during Crisis Situations", Hawaii International Conference on System Sciences, Hawaii, 2004.
Goel, S., Gangolly J., Ravi, S.S., and Rosenkrantz, D. "Models of Services in a Peer-to-Peer Environment", Working Paper, 2004.
Gu, D. C., D. J. Rosenkrantz and S. S. Ravi, Construction of Check Sets for Algorithm-Based Fault Tolerance, IEEE Transactions on Computers, Vol. 43, No. 6, June 1994, pp. 641-650.
Gu, D., Rosenkrantz, D. J., and Ravi, S. S., "Construction and Analysis of Fault-Secure Multiprocessor Schedules," Proc. Twenty-First Intl. Symp. On Fault-Tolerant Computing, Montreal, Canada, June 1991, 120-127.
Gu, D., Rosenkrantz, D. J., and Ravi, S. S., "Construction of Check Sets for Algorithm-Based Fault Tolerance," IEEE Trans. Computers, 43, 6, June 1994, 641-650.
Gu, D., Rosenkrantz, D. J., and Ravi, S. S., "Design and Analysis of Test Schemes for Algorithm-Based Fault Tolerance," Proc. Twentieth Intl. Symp. On Fault-Tolerant Computing, Newcastle Upon Tyne, U.K., June 1990, 106-113.
Hunt, H. B. III, Marathe, M. V., Radhakrishnan, V., Ravi, S. S., Rosenkrantz, D. J., and Stearns, R. E., "A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs," Proc. Second Annual European Symp. on Algorithms (ESA '94), J. Van Leeuwen (Ed.), Utrecht, The Netherlands, Sept. 1994, Lecture Notes in Computer Science, Vol. 855, Springer-Verlag, Berlin, 1995, 424-435.
Hunt, H. B. III, Marathe, M. V., Radhakrishnan, V., Ravi, S. S., Rosenkrantz, D. J., and Stearns, R. E., "NC-Approximation Schemes for NP- and PSPACE- Hard Problems for Geometric Graphs," Journal of Algorithms, 26, 2, Feb. 1998, 238-274.
Hunt, H. B. III, Marathe, M. V., Radhakrishnan, V., Ravi, S. S., Rosenkrantz, D. J., and Stearns, R. E., "Parallel Approximation Schemes for a Class of Planar and Near Planar Combinatorial Optimization Problems," Information and Computation, 173, 1, Feb. 2002, 40-63.
Hunt, H. B. III, Rosenkrantz, D. J., and Bloniarz, P. A., "On the Computational Complexity of Algebra on Lattices 1," SIAM J. Computing, 16, 1, Feb. 1987, 129-148.
Kapur, D., Narendran, P., Rosenkrantz, D. J., and Zhang, H., "Sufficient- Completeness, Ground-Reducibility and Their Complexity," Acta Informatica, 28, 4, April 1991, 311-350.
Krumke, S. O., Marathe, M. V., Noltemeier, H., Radhakrishnan, V., Ravi, S. S., and Rosenkrantz, D. J., "Compact Location Problems," Theoretical Computer Science, 181, 2, July 1997, 379-404.
Marathe, M. V., Brue, H., Hunt, H. B. III, Ravi, S. S., and Rosenkrantz, D. J., "Simple Heuristics for Unit Disk Graphs," Networks, 25, 2, March 1995, 59-68.
Marathe, M. V., R. Ravi, R. Sundaram, S. S. Ravi, D. J. Rosenkrantz and H. B. Hunt III, Bicriteria Network Design Problems, Journal of Algorithms, Vol. 28, No. 1, July 1998, pp. 142-171.
Marathe, M. V., Ravi, R., Sundaram, R., Ravi, S. S., Rosenkrantz, D. J., and Hunt, H. B. III, "Bicriteria Network Design Problems," Proc. Twenty- Second Intl. Colloquium on Automata, Languages, and Programming (ICALP)
Marathe, M. V., Ravi, R., Sundaram, R., Ravi, S. S., Rosenkrantz, D. J., and Hunt, H. B. III, "Bicriteria Network Design Problems," Journal of Algorithms, 28, 1, July 1998, 142-171.
Narasimhan, R., D. J. Rosenkrantz and S. S. Ravi, Using Data Flow Information to Obtain Efficient Check Sets for Algorithm-Based Fault Tolerance, International Journal of Parallel Programming, Vol. 27, No. 4, Aug. 1999, pp. 289-323.
Narasimhan, R., Rosenkrantz, D. J., and Ravi, S. S., "A Canonical Computational Model for ABFT Systems," Proc. SPIE Symp. on Advanced Signal Processing: Algorithms, Architectures, and Implementations V, San Diego, CA, July 1994.
Narasimhan, R., Rosenkrantz, D. J., and Ravi, S. S., "Early Comparison and Decision Strategies for Datapaths that Recover from Transient Faults," IEEE Trans. on Circuits and Systems - Part I: Fundamental Theory and Applications, 44, 5, May 1997, 435-438.
Narasimhan, R., Rosenkrantz, D. J., and Ravi, S. S., "Using Data Flow Information to Obtain Efficient Check Sets for Algorithm-Based Fault Tolerance," Intl. J. Parallel Programming, 27, 4, Aug. 1999, 289-323.
Radhakrishnan, V., Krumke, S. O., Marathe, M. V., Rosenkrantz, D. J., and Ravi, S. S., "Compact Location Problems," Foundations of Software Technology and Theoretical Computer Science, Proc. Thirteenth Conf. (FST&TCS '93), R. K. Shyamasundar (Ed.), Bombay, India, Dec. 1993, Lecture Notes in Computer Science, Vol. 761, Springer-Verlag, Berlin, 1993, 238-247.
Ravi, R., M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz and H. B. Hunt III, Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems, Algorithmica, Vol. 31, No. 1, May 2001, pp. 58-78.
Ravi, R., Marathe, M. V., Ravi, S. S., Rosenkrantz, D. J., and Hunt, H. B. III, "Many Birds With One Stone: Multi-Objective Approximation Algorithms," Proc. Twenty-Fifth Annual ACM Symp. on the Theory of Computing (STOC '93), San Diego, CA, May 1993, 438-447.
Ravi, R., Marathe, M. V., Ravi, S. S., Rosenkrantz, D. J., and Hunt, H. B. III, "Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems", Algorithmica, 31, 1, May 2001, 58-78.
Ravi, R., R. Sundaram, M. V. Marathe, D. J. Rosenkrantz and S. S. Ravi, Spanning Trees Short or Small, SIAM Journal on Discrete Mathematics, Vol. 9, No. 2, May 1996, pp. 178-200.
Ravi, R., Sundaram, R. Marathe, M. V., Rosenkrantz, D. J., and Ravi, S. S., "Spanning Trees Short or Small," Proc. Fifth Annual ACM-SIAM Symp. On Discrete Algorithms (SODA '94), Arlington, VA, Jan. 1994, 546-555.
Ravi, R., Sundaram, R. Marathe, M. V., Rosenkrantz, D. J., and Ravi, S. S., "Spanning Trees - Short or Small," SIAM Journal on Discrete Mathematics, 9, 2, May 1996, 178-200.
Ravi, S. S., D. J. Rosenkrantz and G. K. Tayi, Heuristic and Special Case Algorithms for Dispersion Problems, Operations Research, Vol. 42, No. 2, March-April 1994, pp. 299-310.
Ravi, S. S., Rosenkrantz, D. J., and Tayi, G. K., "Facility Dispersion Problems: Heuristics and Special Cases," in Algorithms and Data Structures, Proc. 2nd Workshop, WADS '91, F. Dehne, J.-R. Sack, N. Santoro (Eds.), Ottawa, Canada, Aug. 1991, Lecture Notes in Computer Science, Vol. 519, Springer-Verlag, Berlin, 1991, 355-366.
Rosenkrantz, D. J., and Ravi, S. S., "Improved Bounds for Algorithm- Based Fault Tolerance," IEEE Trans. Computers, 42, 5, May 1993, 630- 635.
Rosenkrantz, D. J., and Ravi., S. S., "Improved Upper Bounds for Algorithm- Based Fault-Tolerance (Extended Abstract)," Proc. Twenty-Sixth Annual Allerton Conf. On Comunication, Control, and Computing, Sept. 1988, 388-397.
Rosenkrantz, D. J., Gu, D., and Ravi, S. S., "Fault Tolerance Via Output- Guaranteed Schedules," Proc. Second IASTED Intl. Conf. on Reliability, Quality Control and Risk Assessment, Cambridge, MA, Oct. 1993, 121- 124.
Rosenkrantz, D. J., Tayi, G. K., and Ravi, S. S., "Inspection Problems Arising in the Transportation of Hazardous Materials," Proc. Eighth International Conference on Computing and Information (ICCI'96), June 1996, Waterloo, Ontario, Canada, 155-169.
Rosenkrantz, D. J., Yu, L., and Ravi, S. S., "Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times", Algorithmica, 30, 1, Jan. 2001, 83-100.
Shamsunder, R., Rosenkrantz, D. J., and Ravi, S. S., "Exploiting Data Flow Information in Algorithm-Based Fault Tolerance," Proc. Twenty-Third Annual Intl. Symp. on Fault-Tolerant Computing (FTCS '93), Toulouse, France, June 1993, 280-289.
Shukla, S. K., Hunt, H, B. III, Rosenkrantz, D. J., Ravi, S. S., and Stearns, R. E., "I/O Automata Based Verification of Finite State Distributed Systems: Complexity Issues (Brief Announcement)," Proc. Fifteenth Annual ACM Symposium on Principles of Distributed Computing (PODC '96), Philadelphia, PA, May 1996, 122.
Shukla, S. K., Rosenkrantz, D. J., and Ravi, S. S., "Developing Self- Stabilizing Coloring Algorithms via Systematic Randomization," Proc. First Intl. Workshop on Parallel Processing (IWPP '94), Bangalore, India, Dec. 1994, 668-673.
Shukla, S. K., Rosenkrantz, D. J., and Ravi, S. S., "Observations on Self- Stabilizing Graph Algorithms for Anonymous Networks," Proc. Second Workshop on Self-Stabilizing Systems (WSS '95), Las Vegas, NV, May 1995, 7.1-7.15.
Tam, K., S. Goel, and J. Gangolly. On the design of an XML-Schema based application for business reporting: An XBRL Schema Derivative, International Journal of Digital Accounting Research, (2002).
Tam, K., S. Goel, and J. Gangolly. On the design of an XML-Schema based application for business reporting: An XBRL Schema Derivative, Research Symposium of the Artificial Intelligence/Emerging Technologies Section of the American Accounting Association, August, 2001.
Tayi G. and J. Gangolly. Regional Planning and Location of Undesirable Facilities: Some Mathematical Models, Modelling & Simulation: Proceedings of the Fifteenth Annual Pittsburgh Conference vo.15, part3, 1984. pp.1219-20.
Tayi, G. and J. Gangolly. Strategies for Reliability Testing based on Process Cost Data, Modelling & Simulation: Proceedings of the Fourteenth Annual Pittsburgh Conference vol. 14, part 3, 1983. pp.1090-1
Tayi, G. K., Rosenkrantz, D. J., and Ravi, S. S., "Heuristics for Capacitated Dispersion Problems", INFORMS Spring 1996 Meeting, presentation, May 1996, Washington, D.C.
Tayi, G. K., Rosenkrantz, D. J., and Ravi, S. S., "Local Base Station Assignment with Time Intervals in Mobile Computing Environments," European Journal of Operational Research, 157, 2, Sept. 2004, 267-285.
Tayi, G. K., Rosenkrantz, D. J., and Ravi, S. S., "Optimization Models for Data Access in Mobile Computing Environments," Proc. Fifth Intl. Conf. On Telecommunications Systems, Modelling and Analysis, Nashville, TN, March 1997.
Tayi, G. K., Rosenkrantz, D. J., and Ravi, S. S., "Path Problems in Networks with Vector-Valued Edge Weights", Networks, 34, 8, Aug. 1999, 19-35.