AdvOL Student Seminars and Defences
Joe Guan, January 23, 2018, 15:30-16:00, ITB 201
Speaker:   Joe Guan

Title:  Geometric Aspects of Combinatorial Optimization
AdvOL Optimization Seminars
Antoine Deza, January 23, 2018, 16:30-17:30, ITB 201
Speaker:   Antoine Deza
Department of Computing and Software
McMaster University

Title:  On lattice polytopes, convex matroid optimization, and degree sequences of hypergraphs
Fields Institute Industrial Optimization Seminar, January 16, 2018
Speakers:   Paul Ayers (McMaster University)
Jeffrey Kelly (Industrial Algorithms)

On the first Tuesday of each month, the Industrial Optimization Seminar is held at the Fields Institute. See the seminar series website for further information.
Home arrow Seminars arrow Invited seminars arrow Ridha Khedri, April 20, 2015, 16:30-17:30, ITB 201
Friday, 23 February 2018
Main Menu
Internal pages
Latest Theses
File Icon Novel Stochastic Programming Formulations for Assemble-to-Order Systems
File Icon Computational Determination of the Largest Lattice Polytope Diameter
File Icon Computational Framework for the Generalized Berge Sorting Conjecture
Latest Reports
Visitors by region
Totals Top 20
 60 % Unknown
 14 % Commercial
 9 % networks
 6 % Canada
 3 % Germany
 2 % Russia
 2 % China
 < 1.0 % Brazil
 < 1.0 % Educational
 < 1.0 % United Kingdom
 < 1.0 % Ukraine
 < 1.0 % Poland
 < 1.0 % 
 < 1.0 % Italy
 < 1.0 % France
 < 1.0 % Netherlands
 < 1.0 % Japan
 < 1.0 % India
 < 1.0 % Australia
 < 1.0 % Organization

Visitors: 5342593
Ridha Khedri, April 20, 2015, 16:30-17:30, ITB 201
Speaker:   Ridha Khedri
Department of Computing and Software
Faculty of Engineering
McMaster University

Title:   Covert Channels: A close look at one of the necessary conditions for their existence

Software systems contain paths for information transmission that were not intended by their designers. These paths utilize the systems' resources, environment, or established legitimate communication channels. They are called covert channels and can be used as paths to leak out confidential information to unauthorized recipients. To the unwary user, these channels may transport information as if by magic, despite the vigilance of monitors. Because of this, covert channels pose a significant threat to information security. In a system of communicating agents, if there exists a covert channel, then two conditions are satisfied: Constraint on Communication and Potential for Communication. In this talk, we discuss the potential for communication condition. We present a mathematical framework for communication and concurrency called Communicating Concurrent Kleene Algebra (C2KA). C2KA extends the work of Tony Hoare et al. on Concurrent Kleene algebra with the notion of stimuli. Then, we use C2KA to propose a formulation of the potential for communication condition. We discuss the preservation of the potential for communication after the modification of an agent on a communication path.
< Prev   Next >
McMaster University
McMaster University
Faculty of Engineering
Faculty of Engineering
Faculty of Science
Faculty of Science
Computing & Software
Computing & Software
Comput. Eng. & Sci.

School Website >>>

Latest Publications
Publication Downloads
Error cannot find GD extension