@conference {
	title = {A Modeling, Health IT, Analytics Framework for Healthcare Management and Application to Diabetes II},
	author = {Katsipis, Iakovos M., Baras, John S.},
	year = {2015},
	month = {07/2015},
	abstract = {We develop a framework using modern Model-Based System Engineering methodologies and apply it to Diabetes 2. We include a Controlled Hidden Markov Chain model for diabetes, three diagnostic tests, ten interventions, three types of patients. We develop three methods for computing tradeoffs between cost and health care quality. One is an exhaustive Monte Carlo simulation and the other two use multi-criteria optimization with full and partial state information. The latter obtain similar results at a fraction of the time of the first. We demonstrate the powerful capabilities of such a framework.},
	address = {Nashville, TN},
	booktitle = {INFORMS Healthcare Conference}
}
@conference {
	title = {Non-Linear Flocking Networks with Collision Avoidance},
	author = {Somarakis, Christoforos., Baras, John S.},
	year = {2015},
	month = {07/2015},
	abstract = {We consider a second order non-linear consensus (flocking) network of a finite population of autonomous agents and~prove that the long-term behavior of its solution is towards a common value while the flock remains connected. We elevate the~analysis to a collision avoidance type flocking after taking into consideration repelling forces between agents.},
	address = {Hangzhou, China},
	booktitle = {34th Chinese Control Conference (CCC2015)},
	pages = {pp. 7633-7638}
}
@conference {
	title = {Pose Synchronization of Rigid body Networks with Switching Topologies},
	author = {Deng, Juan., Song, Wenjun., Liu, Zhixin., Baras, John S.},
	year = {2015},
	month = {07/2015},
	abstract = {Coordination control of multiple rigid bodies attracts much attention of researchers due to its wide applications. This~paper presents the pose synchronization problem of the moving rigid bodies whose dynamics is described by the group SE(3).~The case of undirected neighbor graphs with switching interconnection topologies is considered. We design a distributed control~law based on relative rotation matrices and relative positions between the neighboring rigid bodies, and show that the SE(3)~reaches pose synchronization if and only if the neighbor graphs are infinitely jointly connected, which relaxes the theoretical~results in the existing literature.},
	address = {Hangzhou, China},
	booktitle = {34th Chinese Control Conference (CCC2015)},
	pages = {pp. 7639-7644}
}
@conference {
	title = {A Simple Proof of the Continuous Time Linear Consensus Problem with Applications in Non-Linear Flocking Networks},
	author = {Somarakis, Christoforos., Baras, John S.},
	year = {2015},
	month = {07/2015},
	abstract = {We revisit the linear distributed consensus problem~in continuous time, to provide a simple and elegant proof~under very mild assumptions. Our approach is based on a novel~extension of the contraction coefficient that can be adapted to~the continuous time version of the model. We apply our results~in non-linear second order consensus networks of Cucker-Smale type and we obtain new initial conditions for asymptotic~flocking.},
	address = {Linz, Austria},
	booktitle = {European Control Conference (ECC15)},
	pages = {pp. 1546-1553}
}
@conference {
	title = {Optimal Mission Planner with Timed Temporal Logic Constraints},
	author = {Zhou, Yuchen., Maity, Dipankar., Baras, John S.},
	year = {2015},
	month = {07/2015},
	abstract = {In this paper, we present an optimization-based~method for path planning of a mobile robot subject to time~bounded temporal constraints, in a dynamic environment.~Temporal logic (TL) can address very complex task specification~such as safety, coverage, motion sequencing etc. We use metric temporal logic (MTL) to encode the task specifications with timing constraints.We then translate the MTL formulae into mixed~integer linear constraints and solve the associated optimization~problem using a mixed integer linear program solver. This~approach is different from the automata-based methods which generate a finite abstraction of the environment and dynamics,~and use an automata-theoretic approach to formally generate~a path that satisfies the TL specifications. We have applied~our approach on several case studies in complex dynamical~environments subjected to timed temporal specifications.},
	address = {Linz, Austria},
	booktitle = {European Control Conference (ECC15)},
	pages = {pp. 759-764}
}
@conference {
	title = {Security and Trust in a Networked Immersed World: From Components to Systems and Beyond},
	author = {Baras, John S.},
	year = {2015},
	month = {07/2015},
	address = {Oxford, UK},
	organization = {Department of Engineering Science, University of Oxford}
}
@conference {
	title = {Trust in Networks and Networked Systems},
	author = {Baras, John S.},
	year = {2015},
	month = {07/2015},
	address = {Cambridge, UK},
	organization = {Computer Science Department, University of Cambridge}
}
@conference {
	title = {New Results on Stochastic Consensus Networks},
	author = {Somarakis, Christoforos., Baras, John S.},
	year = {2015},
	month = {07/2015},
	abstract = {We revisit the general linear consensus problem and provide new conditions for asymptotic consensus on two types of stochastic versions of the algorithm, in discrete and continuous time. We show that our method unifies a number of proposed models in the literature as well as it extends and generalizes existing results.},
	address = {Maison de la Mutualite, Paris, France},
	booktitle = {2015 SIAM Conference on Control and Its Applications},
	pages = {pp. 115-122}
}
@conference {
	title = {Crowdsourcing with Multi-Dimensional Trust},
	author = {Liu, Xiangyang., He, He., Baras, John S.},
	year = {2015},
	month = {07/2015},
	abstract = {We consider a typical crowdsourcing task that aggregates input from multiple workers as a problem in information fusion. To cope with the issue of noisy and sometimes malicious input from workers, trust is used to model workers{\textquoteright} expertise. In a multi-domain knowledge learning task, however, using scalar-valued trust to model a worker{\textquoteright}s performance is not sufficient to reflect the worker{\textquoteright}s trustworthiness in each of the domains. To address this issue, we propose a probabilistic model to jointly infer multi-dimensional trust of workers, multi-domain properties of questions, and true labels of questions. Our model is very flexible and extensible to incorporate metadata associated with questions. To show that, we further propose two extended models, one of which handles input tasks with real-valued features and the other handles tasks with text features by incorporating topic models. Finally, we evaluate our model on real-world datasets and demonstrate that our model is superior to state-of-the-art and the two extended models have even better performance. In addition, our models can effectively recover trust vectors of workers, which can be very useful in task assignment adaptive to workers{\textquoteright} trust in the future. These results can be applied for fusion of information from multiple data sources like sensors, human input, machine learning results, or a hybrid of them.},
	address = {Washington DC},
	booktitle = {International Conference on Information Fusion (FUSION 2015)},
	pages = {pp. 574-581}
}
@conference {
	title = {Semiring-Based Trust Evaluation for Information Fusion in Social Network Services},
	author = {Gao, Peixin., Baras, John S., Golbeck, Jennifer.},
	year = {2015},
	month = {07/2015},
	abstract = {As online social network services (SNS) are booming~and gaining tremendous popularity, there is a sharply increasing~amount of information exchange and interactions among SNS~users. Taking this advantage, users in SNS make decisions via~collecting and combining information from different sources~(i.e. other users). However, there exists a large variance of~trustworthiness among SNS populations, which is threatening the~quality of the information fusion process. In such circumstances,~trust relationships among users in SNS are very important in~decision making as well as for the success of many SNS-based applications, e.g. recommender systems and ad targeting. An~appropriate trust inference mechanism for trust evaluation is~necessary in extending the knowledge base of trust opinions and~tackle the issue of limited trust information due to link sparsity~in social networks. In this work, we model the trust relationship~among users in SNS as a 2-dimensional vector, and propose a semiring-based model for trust propagation and fusion as the~building block of our trust inference framework. Specifically, in~our approach, both trust and distrust (i.e., positive and negative~trust) are both considered, and opinion conflict resolution is supported by our framework of trust inference.},
	address = {Washington DC},
	booktitle = {International Conference on Information Fusion (FUSION 2015)},
	pages = {pp. 590-596}
}
@conference {
	title = {Simple Distributed Control of Networked Systems: Learning, Direct and Indirect Communications},
	author = {Baras, John S.},
	year = {2015},
	month = {07/2015},
	address = {Paris, France},
	booktitle = {SIAM Conference on Control and its Applications}
}
