@conference {
	title = {Thoughts Towards {\textquotedblleft}Science of Fingerprints},
	author = {Baras, John S.},
	year = {2011},
	month = {11/2011},
	address = {Salt Lake City, Utah},
	booktitle = {ARO Workshop on Fingerprinting}
}
@conference {
	title = {Factor Join Trees in Systems Exploration},
	author = {Yang, Shahan., Baras, John S.},
	year = {2011},
	month = {11/2011},
	abstract = {The interaction of connected components creates complexity impeding the analysis of large systems. Thorough exploration, appearing as formal verification, optimization or constraint satisfaction typically has a complexity that is either a high order polynomial or an exponential function of system size. However, for a large class of systems the essential complexity is linear in system size and exponential in treewidth which makes the previous notion of exponential complexity in system size an accidental overestimate.

In this paper, we demonstrate how this reduced complexity can be achieved using summary propagation on factor graphs. We describe summary propagation in terms of operations belonging to a commutative semiring-weighted relational algebra. We show how by appropriate selection of the commutative semiring, the same solution applies to propositional satisfiability, inference on Bayesian networks and a mixed integer linear optimization problem motivated by the power restoration problem for distributed, autonomous networks. This solution leads to a non-iterative distributed algorithm that operates on local data.

While weighted relational algebraic operators are used as the basic means of calculation, the algorithm presented works only on factor graphs that are trees. This requires the calculation of a non-unique structure called a join tree, which can be trivially generated from a unique structure called a cliqueseparator graph, which can be computed in linear time from a SysML Parametric Diagram description of the system for chordal systems1 . Interesting artifacts arise from this structural analysis which may be interpreted as interfaces and components. The framework also contains mathematical artifacts that may be interpreted as hierarchy and abstraction. We develop a tool to assist in the structural analysis described and implementations of the described algorithms.},
	address = {Paris, France},
	booktitle = {23rd International Conference on Software and Systems Engineering and their Applications (ICSSEA 2011)},
	pages = {pp. 1-12}
}
@conference {
	title = {Performance Evaluation of Single Channel Virtual-Circuit Medium Access Protocols for MANETs},
	author = {Perumal, Senni., Baras, John S.},
	year = {2011},
	month = {11/2011},
	abstract = {In this paper, we develop and evaluate models for estimating various performance metrics for unicast traffic using a single frequency channel virtual-circuit Medium Access Control (MAC) protocol in mobile wireless ad-hoc networks. Time is divided into periodic frames with a portion reserved for control traffic and the rest divided into timeslots for data traffic. In order to avoid interference between neighboring links, the virtualcircuit MAC protocol uses a set of reservation rules to assign timeslots to links. One such virtual-circuit MAC protocol is the hard scheduling mode of the reservation based Unifying Slot Assignment Protocol (USAP) with the number of frequency channels in a frame set to one. USAP uses a set of generic reservation rules to avoid interference between neighboring links. We model the performance of a single frequency channel virtualcircuit MAC protocol using reduced load loss network models that couple the physical, MAC, and routing layers effects. The blocking probability of a call at a particular link is calculated by considering cliques of neighboring interfering links that cannot transmit simultaneously. These neighboring interfering links and the conflict graph are calculated using the virtualcircuit reservation rules. We compare our results with simulation and show good match for large networks across various offered loads.},
	address = {Baltimore, Maryland},
	booktitle = {Milcom 2011},
	pages = {pp. 926-931},
	organization = {Baltimore Convention Center}
}
@conference {
	title = {Communication Network Challenges for Collaborative Vehicles},
	author = {Chen, Hua., Hovareshti, Pedram., Baras, John S.},
	year = {2011},
	month = {11/2011},
	abstract = {Networked systems of autonomous mobile agents have emerged in a variety of applications such as collaborative robotics, unmanned aerial/ground vehicles, mobile sensor networks and disaster relief operations. These agents utilize wireless communications for distributed computing, control and decision-making. Due to their limitations on energy supply, design and implementation of efficient distributed algorithms are crucial for these systems. This paper reviews different design aspects of networks of collaborative vehicles. We survey existing methods of addressing physical (PHY) and medium access control (MAC) layer, routing, and geometric connectivity issues for such networks and show limitations of these designs that address only single layer issues. We argue that a system engineering framework is needed for the design of such systems.},
	address = {Pacific Grove CA},
	booktitle = {Asilomar Conference on Signals, Systems, and Computers},
	pages = {pp. 1472-1476}
}
