@conference {
	title = {Reachable Set Approach to Collision Avoidance for UAVs},
	author = {Zhou, Yuchen., Baras, John S.},
	year = {2015},
	month = {12/2015},
	abstract = {In this paper, we propose a reachable set based~collision avoidance algorithm for unmanned aerial vehicles~(UAVs). UAVs have been deployed for agriculture research and~management, surveillance and sensor coverage for threat detection~and disaster search and rescue operations. It is essential for~the aircraft to have on-board collision avoidance capability to~guarantee safety. Instead of the traditional approach of collision~avoidance between trajectories, we propose a collision avoidance~scheme based on reachable sets and tubes. We then formulate~the problem as a convex optimization problem seeking suitable~control constraint sets for participating aircraft. We have~applied the approach on a case study of two quadrotors collision~avoidance scenario.},
	address = {Osaka, Japan},
	booktitle = {54th Conference on Control (CDC 2015)},
	pages = {pp. 5947-5952}
}
@conference {
	title = {Distributed Solution of the Economic Dispatch Problem in Smart Grid Power Systems Framework with Delay},
	author = {Somarakis, Christoforos., Baras, John S.},
	year = {2015},
	month = {12/2015},
	abstract = {We consider the Economic Dispatch Problem in~power systems in a smart-grid architecture friendly environment.~The problem is tackled with the use of multiple decentralized~controllers that execute parallel distributed consensus~algorithms. The scenario takes into account the presence of~multiple time-varying communication delays.},
	address = {Osaka, Japan},
	booktitle = {54th Conference on Control (CDC 2015)},
	pages = {pp. 6577-6582}
}
@conference {
	title = {Distributed Nonlinear Programming Methods for Optimization Problems with Inequality Constraints},
	author = {Matei, Ion., Baras, John S.},
	year = {2015},
	month = {12/2015},
	abstract = {In this paper, we consider a distributed optimization problem, where a set of agents interacting and cooperating locally have as common goal the minimization of a function expressed as a sum of (possibly non-convex) differentiable functions. Each function in the sum is associated with an agent and each agent has assigned an inequality constraint, therefore generating an optimization problem with inequality constraints. In this paper, we present a distributed algorithm for solving such a problem~and give local convergence results. Our approach is based on solving (in a centralized manner) an equivalent augmented optimization problem with mixed constraints. The structure of this augmented problem ensures that the resulting algorithm is distributed. The main challenge in proving the convergence results comes from the fact that the local minimizers are no longer regular due to the distributed formulation. We present also an extension of this algorithm that solves a constrained optimization problem, where each agent has both equality and inequality constraints.},
	address = {Osaka, Japan},
	booktitle = {54th Conference on Control (CDC 2015)},
	pages = {pp. 2649-2654}
}
@conference {
	title = {Trust-Aware Crowdsourcing with Domain Knowledge},
	author = {Liu, Xiangyang., Baras, John S.},
	year = {2015},
	month = {12/2015},
	abstract = {The rise of social network and crowdsourcing platforms~makes it convenient to take advantage of the collective~intelligence to estimate true labels of questions of interest.~However, input from workers is often noisy and even malicious.~Trust is used to model workers in order to better~estimate true labels of questions. We observe that questions~are often not independent in real life applications. Instead,~there are logical relations between them. Similarly, workers~that provide answers are not independent of each other~either. Answers given by workers with similar attributes~tend to be correlated. Therefore, we propose a novel unified~graphical model consisting of two layers. The top layer~encodes domain knowledge which allows users to express~logical relations using first-order logic rules and the bottom~layer encodes a traditional crowdsourcing graphical model.~Our model can be seen as a generalized probabilistic soft~logic framework that encodes both logical relations and~probabilistic dependencies. To solve the collective inference~problem efficiently, we have devised a scalable joint inference~algorithm based on the alternating direction method~of multipliers. Finally, we demonstrate that our model is~superior to state-of-the-art by testing it on multiple real-world~datasets.},
	address = {Osaka, Japan},
	booktitle = {54th Conference on Control (CDC 2015)},
	pages = {pp. 2913-2918}
}
@conference {
	title = {Event Based Control for Control Affine Nonlinear Systems: A Lyapunov Function Based Approach},
	author = {Maity, Dipankar., Baras, John S.},
	year = {2015},
	month = {12/2015},
	abstract = {In this paper, we propose an event based control~strategy for control affine nonlinear systems. The proposed~method ensures sufficient reduction in communication by only~invoking a communication when some event has occurred. The~error between the continuous state feedback nonlinear system~and the event based system can be bounded in an invariant~set. The upper bound of this error is derived which can be~controlled by appropriately choosing the parameters for the~event triggering function. This method is then applied to a~networked nonlinear system of inverted pendulum and a nonlinearizable~nonlinear system.},
	address = {Osaka, Japan},
	booktitle = {54th Conference on Control (CDC 2015)},
	pages = {pp. 3767-3772}
}
@conference {
	title = {Bipartite Consensus for Global Trust in Social Network Services},
	author = {Gao, Peixin., Liu, Zhixin., Baras, John S.},
	year = {2015},
	month = {12/2015},
	abstract = {As social network services (SNS) are gaining popularity, establishing trust relationships among users in SNS is necessary for user interaction and decision making. However, the evaluation of global trust values (i.e. reputation) of users suffers from the curse of opinion divergence in the network. In this paper, we consider the scenario of opinion divergence within social networks, and propose a method to reach different global trust values between groups of users with controversial opinions in the network. We model the global trust opinion formation in discrete-time dynamics and introduce bipartite consensus as the approach to establish global trust in such circumstances. Such approach works upon the property of structural balance, and can be extended to more general situations where eventual positivity applies. Via our approach, non-trivial global trust can be reached within the network, which can guide users{\textquoteright} social behaviors, and support many SNS-based applications.},
	address = {San Diego, California},
	booktitle = {IEEE Global Communications Conference (Globecom 2015)}
}
@conference {
	title = {QoS Aware Component-Based Routing in Resource-Constrained Wireless Multi-Hop Networks},
	author = {Paraskevas, Evripidis., Baras, John S.},
	year = {2015},
	month = {11/2015},
	abstract = {With an increasing number of wireless devices available, there is a tremendous need for designing new efficient protocols, which take into account resource constraints and at the same time provide adequate Quality of Service (QoS) performance guarantees (e.g. throughput, latency etc.). Most wireless protocols currently used perform well under specific environmental conditions or in particular applications. In this work, we propose a novel methodology for designing routing protocols for resource-constrained wireless multi-hop networks by separating the protocol into distinct components, which specify particular functionalities. Different QoS requirements can be guaranteed by configuring the different components without the need to modify or develop the protocol from scratch. An initial study for energy-constrained environments indicated that our approach is effective. In our ongoing work we consider adversarial environments and we develop techniques to mitigate network-layer attacks. Finally, we are investigating the design of a decision-theoretic module for dynamic protocol configuration. Keywords- QoS performance, Routing, multi-hop networks},
	address = {San Fransisco, CA},
	booktitle = {23rd IEEE International Conference on Network Protocols (ICNP - PhD Forum )},
	pages = {pp. 476-478}
}
@conference {
	title = {A Rigorous Framework for MBSE and Applications to IoT, WSN and MEMS},
	author = {Baras, John S.},
	year = {2015},
	month = {11/2015},
	address = {Chantilly, Virginia},
	booktitle = {IBM Continuing Education for the Internet of Things Conference}
}
@conference {
	title = {Security and Trust for Networked Cyber Physical Systems (Net-CPS)},
	author = {Baras, John S.},
	year = {2015},
	month = {10/2015},
	address = {Stockholm, Sweden},
	booktitle = {2015 Cyber-Security and Privacy Winter School (2015 CySeP)}
}
@conference {
	title = {Reasoning and Decision Making in Health Care Management of Diabetes Mellitus using as Framework Model Based Systems Engineering},
	author = {Katsipis, Iakovos M., Baras, John S.},
	year = {2015},
	month = {10/2015},
	address = {Washington DC},
	booktitle = {White 2015, The 6th Annual Workshop on Health IT and Economics}
}
@conference {
	title = {Dynamic Co-evolving Sociotechnical Networks},
	author = {Baras, John S.},
	year = {2015},
	month = {10/2015},
	address = {Saudi Arabia},
	booktitle = {KAUST Conference on Human-Machine Networks and Intelligent Infrastructure},
	organization = {King Abdullah University (KAUST)}
}
@conference {
	title = {Security and Trust for Networked Control and Sensor Systems},
	author = {Baras, John S.},
	year = {2015},
	month = {09/2015},
	abstract = {The tremendous explosion of wireless devices and services have created unprecedented advances and are impacting every aspect of life and work. However, many of these advances and resulting expanding markets are critically endangered by weaknesses in security, integrity and trust. We first describe several of these emerging systems and markets including aerospace, automotive, industrial control, factories, power grids and SCADA,~ healthcare, e-commerce, e-payments, social networks over the Web. We then describe various physical layer (e.g. hardware and signal processing) techniques that can be successfully utilized to significantly strengthen the security of wireless devices and networked systems.~ We argue for the need of a {\textquotedblleft}trusted core{\textquotedblright} in wireless networks and for the allocation of part of the security functionality to the physical layer. We next turn into the subject of trust in networked systems and describe a new framework using multiple partially ordered semirings for analyzing reputation and trust dynamics and composite trust. Next we describe our work based on constrained coalitional games towards understanding the role of trust in collaboration and social networks. We describe several specific applications of these methods in securing distributed inference systems, SCADA sensor networks for power grids, wireless network routing protocols, LTE paging systems, wireless handheld devices for healthcare and e-payment systems. We close by describing the need for rigorous frameworks and theories for composable security and outline future research challenges and directions.},
	address = {Ingolstadt, Germany},
	booktitle = {3rd International Symposium for ICS \& SCADA Cyber Security Research 2015}
}
@conference {
	title = {HyperCubeMap: Optimal Social Network Ad Allocation Using Hyperbolic Embedding },
	author = {Miao, Hui., Gao, Peixin., Hajiaghayi, MohammadTaghi., Baras, John S.},
	year = {2015},
	month = {08/2015},
	abstract = {Advertising activity on SNS has grown rapidly and is now a billion dollar business. In the SNS advertising model, the SNS serves as the advertising agent, and takes the advantage of network diffusion to attract advertisers and charges for the cascading impressions. The optimal ad allocation task is to choose the ad allocation plan that maximizes the revenue. Each user has different diffusion ability, limited daily impressions and the advertisers have various bidding prices and budget concerns. A feasible plan that obeys the constraints is difficult to find. The solution of this problem lies in the space of N |Ads|{\texttimes}|User| 0 , which makes direct optimization unattractive. In this paper, we study SNS advertising business models, formulate the SNS ad allocation problem and show their connections with hyperbolic embedding. We develop a new embedding algorithm HYPERCUBEMAP that allows for dimension reduction. Our proposed method reduces the dimensionality of the original problem significantly, runs two to four orders of magnitude faster, and reaches 95\% of the optimum},
	address = {Paris, France},
	booktitle = {The 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2015)},
	pages = {pp. 357-362}
}
@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}
}
@conference {
	title = {Delay-independent convergence for Linear Consensus Networks with Applications to Non-linear Flocking Systems},
	author = {Somarakis, Christoforos., Baras, John S.},
	year = {2015},
	month = {06/2015},
	abstract = {This work studies a class of linear first order and non-linear second order static distributed consensus networks with time-varying multiple propagation delays, in continuous~time. We provide conditions for convergence of to a common constant value, under an increased~connectivity condition. The results are delay-independent in the sense that they hold for~arbitrary bounded delays. Our approach makes use of fundamental concepts from the Non-Negative Matrix Theory in a fairly elementary way.},
	address = {Ann Arbor, MI},
	booktitle = {12th IFAC Workshop on Time Delay Systems (TDS 2015)},
	pages = {pp. 159-164}
}
@conference {
	title = {Event Based Distributed Collaborative Control and the Value of Information},
	author = {Baras, John S.},
	year = {2015},
	month = {06/2015},
	address = {Krakow, Poland},
	booktitle = {First International Conference on Event-Based Control, Communication and Signal Processing}
}
@conference {
	title = {Event Based Control of Linear Systems with Stochastic Perturbations},
	author = {Maity, Dipankar., Baras, John S.},
	year = {2015},
	month = {06/2015},
	abstract = {In this paper, an event-based control strategy for~linear systems under disturbances is presented where the control~input generator generates a control which tries to mimic a state~feedback control between two successive events. The control input~is generated in such a way that the error between the state of~this system and the continuous state feedback system is bounded.~The event generator triggers an event based on this error and the~control input generator modifies its control function in such a way~that it makes sure that the error generated up to this triggering~instance is reduced to zero and thus it does not have any effect on~the future value of the state regardless of the stability of the plant.~It is also shown that under this event triggering mechanism, the~control input generator generates the control in such a way that~this error bound could be made arbitrarily small.~},
	address = {Krakow, Poland},
	booktitle = {1st IEEE International Conference on Event-Based Control, Communication, and Signal Processing (EBCCSP 2015)}
}
@conference {
	title = {Motion Planning in Dynamic Environment with Bounded Time Temporal Logic Specifications},
	author = {Maity, Dipankar., Baras, John S.},
	year = {2015},
	month = {06/2015},
	abstract = {In this paper, we consider the problem of robotic~motion planning that satisfies some bounded time high-level~specifications. Although temporal logic can efficiently express~high-level specifications such as coverage, obstacle avoidance,~temporal ordering of tasks etc., it fails to address~problems~with explicit timing constraints. The inherent limitations of~Linear Temporal Logic (LTL) to address problems with explicit timing constraints have been overcome by translating the~planning problem from the workspace of the robot to a~higher dimensional space called spacetime where the existing~LTL semantics and grammar are sufficient to mathematically~formulate the bounded time high-level specifications. A discrete~path will be generated, that will meet the specifications with all~timing constraints and, at the same time, it will optimize some~cost function. A continuous trajectory satisfying the continuous~dynamics of the robot will be generated from the discrete path~using proper control laws.},
	address = {Torremolinos, Spain},
	booktitle = {23rd Mediterranean Conference on Control and Automoation (MED 2015)},
	pages = {pp. 973-979}
}
@conference {
	title = {Distributed Consensus Networks of Neutral Type},
	author = {Somarakis, Christoforos., Baras, John S.},
	year = {2015},
	month = {06/2015},
	abstract = {We propose and study a network of autonomous agents which evolve their state under a distributed consensus algorithm of non-linear neutral type. We provide sufficient conditions for convergence to a common consensus point, by means of a stability in variation argument and fixed point theory. Our approach provides both an estimation on the rate of convergence and an implicit expression for the consensus point.},
	address = {Torremolinos, Spain},
	booktitle = {23rd Mediterranean Conference on Control and Automoation (MED 2015)},
	pages = {pp. 1087-1092}
}
@conference {
	title = {Distributed Learning for Collaborative Inference and Decision Making in Multi-Agent Systems},
	author = {Baras, John S.},
	year = {2015},
	month = {06/2015},
	address = {Stuttgart, Germany},
	organization = {Institute for Systems Theory and Automatic Control, University of Stuttgart}
}
@conference {
	title = {Trust-Aware Optimal Crowdsourcing With Budget Contraint},
	author = {Liu, Xiangyang., He, He., Baras, John S.},
	year = {2015},
	month = {06/2015},
	abstract = {Crowdsourcing has been extensively used for aggregating data from a large pool of workers. In a real crowdsourcing market, each answer obtained from a worker incurs cost. The cost is associated with both the level of trustworthiness of workers and the difficulty of tasks. Typically, access to expert-level (more trustworthy) workers is more expensive than to average crowd and completion of a challenging task is more costly than a click-away question. In this paper, we address the problem of optimal assignment of heterogeneous tasks to workers of varying trust levels with budget constraint. Specifically, we design a trust-aware task allocation algorithm that takes as inputs the estimated trust of workers and pre-set budget and outputs the optimal assignment of tasks to workers. We derive the bound of total error probability that relates to budget, trustworthiness of crowds, and costs of obtaining labels from crowds naturally. Higher budget, more trustworthy crowds, and less costly jobs result in lower theoretical bound. Our allocation scheme does not depend on the specific design of the trust evaluation component. Therefore, it can be combined with generic trust evaluation algorithms. Our algorithm outperforms state-of-the-art by up to 30\% on real data.},
	address = {London, UK},
	booktitle = {IEEE International Conference on Communications (ICC 2015)},
	pages = {pp. 1176-1181}
}
@conference {
	title = {Modeling the Alzheimer{\textquoteright}s Disease Network},
	author = {Kyrtsos, C Rose., Baras, John S.},
	year = {2015},
	month = {06/2015},
	address = {Antibes - Juan les Pins France},
	booktitle = {1st International Conference on Mathematical NeuroScience (ICMNS 2015)}
}
@conference {
	title = {A Model-Based System Engineering Framework for Healthcare Management with Application to Diabetes Mellitus},
	author = {Katsipis, Iakovos M., Baras, John S.},
	year = {2015},
	month = {05/2015},
	abstract = {We describe a framework for Health Care Management Systems using modern Model-Based Systems Engineering methodologies and apply it to Diabetes Mellitus. We describe the desired architecture of such systems. We include a Controlled Hidden Markov Chain model for diabetes disease progression with three states, three diagnostic tests, ten interventions, three types of patients. We develop three methods for computing tradeoffs between health care cost and health care quality. One is an exhaustive Monte Carlo simulation and the other two use multi-criteria optimization with full and partial disease 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 via examples and problems of practical healthcare significance.},
	address = {Telecom ParsTech, Paris},
	booktitle = {26th International Conference on Software \& Systems Engineering and their Applications}
}
@conference {
	title = {Health Care Management System for Diabetes Mellitus: A Model-Based Systems Engineering Framework},
	author = {Katsipis, Iakovos M., Baras, John S.},
	year = {2015},
	month = {05/2015},
	address = {Boston, Massachusetts},
	booktitle = {Medical Informatics World Conference}
}
@conference {
	title = {Model-Based Systems Engineering for Networked CPS Research and Education},
	author = {Baras, John S.},
	year = {2015},
	month = {04/2015},
	address = {Seattle, WA},
	booktitle = {2015 CPS Summit}
}
@conference {
	title = {A Systems Approach to Model a Micro-Grid Cyber-Physical System in Urban Cities},
	author = {A. I. Yasser, Baras, John S.},
	year = {2015},
	month = {03/2015},
	address = {Pittsburgh, PA},
	booktitle = {10th Carnegie Mellon Conference on the Electricity Industry, Testbeds for Smart Grids and Smart Cities: Means of Learning}
}
@conference {
	title = {Component Based Modeling of Routing Protocols for Mobile Ad Hoc Networks},
	author = {Paraskevas, Evripidis., Baras, John S.},
	year = {2015},
	month = {03/2015},
	abstract = {Routing protocols perform several functionalities and can be considered as complex software systems. The design and performance analysis of these protocols is difficult and complex and most of them are not adaptable to changes of the environment. In this paper, we present a component based methodology for modeling mobile ad hoc routing protocols. Componentization is used for modeling and analysis of complex systems, because it introduces modularity in protocol design and reusability of designed components across protocols of the same class. We define the fundamental components of the routing protocols based on their functionalities and investigate their interactions. More specifically, we present an initial investigation of the influence of the separate components on the performance metrics of the protocol, such as delay, packet delivery ratio and routing overhead. Proactive routing protocols are being examined and we consider OLSR and DSDV as use cases for our methodology. In addition, we propose an adaptive reusable modification in the Routing Metrics component of OLSR that lead to better overall performance in energy constrained environments.},
	address = {Baltimore, MD},
	booktitle = {49th Annual Conference on Information Sciences and Systems}
}
@conference {
	title = {"Privacy Preserving Node Selection: A Physical Layer Approach (Summary)},
	author = {Jain, Shalabh., Baras, John S.},
	year = {2015},
	month = {03/2015},
	abstract = {Distributed monitoring and sensing networks are~ubiquitous in current technological systems. Security and efficiency~of the data aggregation and fusion process are key~determinants in the adoption of these systems. The principal~thesis investigated in this paper is the role of privacy in providing security guarantees for such networks. We demonstrate that two level~hierarchy (or partition) in information fusion networks~can be used to ensure security in several adversarial scenarios.~We propose a privacy preserving physical layer framework to~generate such a hierarchical structure. We illustrate the security~of this framework and its application to low power sensor~networks.},
	address = {Baltimore, MD},
	booktitle = {49th Annual Conference on Information Sciences and Systems},
	pages = {pp. 1-6}
}
@conference {
	title = {Smart Grid Integrated Modeling Hubs Linked to Tradeoff Analysis and Validation},
	author = {Baras, John S.},
	year = {2015},
	month = {03/2015},
	address = {Pittsburgh, PA},
	booktitle = {10th CMU Electricity Conference},
	organization = {Carnegie Mellon University}
}
@conference {
	title = {Trust-Aware Social Recommended System Design},
	author = {Gao, Peixin., Baras, John S., Golbeck, Jennifer.},
	year = {2015},
	month = {02/2015},
	address = {ESEOM Angers, Loire Valley, France},
	booktitle = {1st International Conference on Information Systems Security and Privacy},
	pages = {pp. 19-28}
}
@conference {
	title = {A Framework for Model-Based Systems Engineering for CPS with Emphasis on Design Space Exploration Methods and Tools},
	author = {Baras, John S.},
	year = {2015},
	month = {02/2015},
	address = {Link{\"o}ping, Sweden},
	booktitle = {2015 MODPROD Workshop},
	organization = {Link{\"o}ping University}
}
@conference {
	title = {Distributed Coordination in Heterogeneous Power Grids: A Fresh Model-Based Approach},
	author = {Baras, John S.},
	year = {2015},
	month = {02/2015},
	address = {Pittsburgh, PA},
	booktitle = {9th CMU Electricity Conference},
	organization = {Carnegie Mellon University}
}
