@conference {
	title = {Solving Optimal Neural Layout by Gibbs Sampling},
	author = {Jiang, Tao., Xu, Peng., Abshire, Pamela A., Baras, John S.},
	year = {2005},
	month = {07/2005},
	abstract = {Neural systems of organisms derive their functionality largely from the numerous and intricate connections between individual components. These connections are costly and have been refined via evolutionary pressure that acts to maximize their functionality while minimizing the associated cost. This tradeoff can be formulated as a constrained optimization problem. In this paper, we use simulated annealing, implemented through Gibbs sampling, to investigate the minimal cost placement of individual components in neural systems. We show that given the constraints and the presumed cost function associated with the neural interconnections, we can find the configuration corresponding to the minimal cost. We restrict the mechanisms considered to those involving incremental improvement through local interactions since real neural systems are likely to be subject to such constraints. By adjusting the cost function and comparing with the actual configuration in neural systems, we can infer the actual cost function associated with the connections used by nature. This provides a powerful tool to biologists for investigating the configurations of neural systems.},
	address = {Salt Lake City, Utah},
	booktitle = {8th Joint Conference on Information Sciences 2005 (JCIS 2005 in conjunction with the 7th International Conference on Computational Intelligence and Natural Computation 2005, CINC)},
	pages = {pp. 424-427}
}
@conference {
	title = {Cooperation, Trust and Games in Wireless Networks},
	author = {Baras, John S., Jiang, Tao.},
	year = {2005},
	month = {06/2005},
	abstract = {As an important concept in network security, trust is interpreted as a set of relations among agents participating in the network activities. Trust relations are based on the previous behavior of an agent within a protocol. Trust establishment in distributed and resource-constraint networks, such as mobile ad hoc networks (MANETs), sensor networks and ubiquitous computing systems, is much more difficult but more crucial than in traditional hierarchical architectures, such as the Internet and base station- or access point-centered wireless LANs. Generally, this type of distributed networks have neither pre-established infrastructures, nor centralized control servers or trusted third parties (TTP). The trust information or evidence used to evaluate trustworthiness is provided by peers, i.e. the agents that form the network. Furthermore, resources (power, bandwidth, computation etc.) are normally limited because of the wireless and ad hoc environment, so the trust evaluation procedure should only rely on local information. Schemes that depend only on local interaction also have the desired emergent property that enables fast reaction to network member changes, topology changes and security changes that frequently happen in mobile networks. Therefore, the essential and unique properties of trust management in this new paradigm of wireless networking, as opposed to traditional centralized approaches are: uncertainty and incompleteness of trust evidence, trust value is between -1 and 1; locality in trust information exchange; distributed computation.},
	address = {Berkeley, CA},
	booktitle = {.Symposium on Systems, Control and Networks}
}
@conference {
	title = {Autonomous Trust Establishment},
	author = {Jiang, Tao., Baras, John S.},
	year = {2005},
	month = {03/2005},
	abstract = {Trust establishment in networks is the essential foundation for follow-on security mechanisms, such as key management and secure transmission. In this paper, we concentrate on self-organized, distributed and resource-constraint networks which pose formidable challenges on trust establishment due to lack of infrastructure and centralized servers. We model our trust establishment strategy as a local voting scheme and discuss its long run behavior. More specifically, we investigate the dynamic evolution of trust within the network, i.e. how trust spreads among nodes, via analyzing its convergence behavior. By theoretical analysis based on graph theory, we also find the conditions under which trust spreads to a maximum set of nodes and parameters that speed up or slow down this transition.},
	address = {Lisbon, Portugal},
	booktitle = {2nd International Network Optimization Conference},
	pages = {pp. 1-8}
}
