<?xml version="1.0" encoding="utf-8" ?>
<rss version="2.0">
<channel>
<title>Departmental Papers (CIS)</title>
<copyright>Copyright (c) 2012 University of Pennsylvania All rights reserved.</copyright>
<link>http://repository.upenn.edu/cis_papers</link>
<description>Recent documents in Departmental Papers (CIS)</description>
<language>en-us</language>
<lastBuildDate>Sat, 21 Jan 2012 01:44:02 PST</lastBuildDate>
<ttl>3600</ttl>


	
		
	







<item>
<title>Challenges in the Regulatory Approval of Medical Cyber-Physical Systems</title>
<link>http://repository.upenn.edu/cis_papers/481</link>
<guid isPermaLink="true">http://repository.upenn.edu/cis_papers/481</guid>
<pubDate>Thu, 19 Jan 2012 09:28:13 PST</pubDate>
<description>
	<![CDATA[
	<p>We are considering the challenges that regulators face in approving modern medical devices, which are software intensive and increasingly network enabled. We then consider assurance cases, which o  er the means of organizing the evidence into a coherent argument demonstrating the level of assurance provided by a system, and discuss research directions that promise to make construction and evaluation of assurance cases easier and more precise. Finally, we discuss some recent trends that will further complicate the regulatory approval of medical cyber-physical systems.</p>

	]]>
</description>

<author>Oleg Sokolsky et al.</author>


</item>






<item>
<title>Assurance Cases in Model-Driven Development of the Pacemaker Software</title>
<link>http://repository.upenn.edu/cis_papers/480</link>
<guid isPermaLink="true">http://repository.upenn.edu/cis_papers/480</guid>
<pubDate>Tue, 08 Nov 2011 10:46:33 PST</pubDate>
<description>
	<![CDATA[
	<p>We discuss the construction of an assurance case for the pace-maker software. The software is developed following a model-based technique that combined formal modeling of the system, systematic code generation from the formal model, and measurement of timing behavior of the implementation. We show how the structure of the assurance case reflects our development approach.</p>

	]]>
</description>

<author>Eunkyoung Jee et al.</author>


</item>






<item>
<title>Multilingual Vandalism Detection using Language-Independent &amp; Ex Post Facto Evidence</title>
<link>http://repository.upenn.edu/cis_papers/479</link>
<guid isPermaLink="true">http://repository.upenn.edu/cis_papers/479</guid>
<pubDate>Wed, 05 Oct 2011 11:41:42 PDT</pubDate>
<description>
	<![CDATA[
	<p>There is much literature on Wikipedia vandalism detection. However, this writing addresses two facets given little treatment to date. First, prior efforts emphasize zero-delay detection, classifying edits the moment they are made. If classification can be delayed (e.g., compiling offline distributions), it is possible to leverage ex post facto evidence. This work describes/evaluates several features of this type, which we find to be overwhelmingly strong vandalism indicators.</p>
<p>Second, English Wikipedia has been the primary test-bed for research. Yet, Wikipedia has 200+ language editions and use of localized features impairs portability. This work implements an extensive set of language-independent indicators and evaluates them using three corpora (German, English, Spanish). The work then extends to include language-specific signals. Quantifying their performance benefit, we find that such features can moderately increase classifier accuracy, but significant effort and language fluency are required to capture this utility.</p>
<p>Aside from these novel aspects, this effort also broadly addresses the task, implementing 65 total features. Evaluation produces 0.840 PR-AUC on the zero-delay task and 0.906 PR-AUC with ex post facto evidence (averaging languages). Performance matches the state-of-the-art (English), sets novel baselines (German, Spanish), and is validated by a first-place finish over the 2011 PAN-CLEF test set.</p>

	]]>
</description>

<author>Andrew G. West et al.</author>


</item>






<item>
<title>What Wikipedia Deletes: Characterizing Dangerous Collaborative Content</title>
<link>http://repository.upenn.edu/cis_papers/478</link>
<guid isPermaLink="true">http://repository.upenn.edu/cis_papers/478</guid>
<pubDate>Wed, 05 Oct 2011 11:41:31 PDT</pubDate>
<description>
	<![CDATA[
	<p>Collaborative environments, such as Wikipedia, often have low barriers-to-entry in order to encourage participation. This accessibility is frequently abused (e.g., vandalism and spam). However, certain inappropriate behaviors are more threatening than others. In this work, we study contributions which are not simply ``undone'' -- but *deleted* from revision histories and public view. Such treatment is generally reserved for edits which: (1) present a legal liability to the host (e.g., copyright issues, defamation), or (2) present privacy threats to individuals (i.e., contact information).</p>
<p>Herein, we analyze one year of Wikipedia's public deletion log and use brute-force strategies to learn about privately handled redactions. This permits insight about the prevalence of deletion, the reasons that induce it, and the extent of end-user exposure to dangerous content. While Wikipedia's approach is generally quite reactive, we find that copyright issues prove most problematic of those behaviors studied.</p>

	]]>
</description>

<author>Andrew G. West et al.</author>


</item>






<item>
<title>Autonomous Link Spam Detection in Purely Collaborative Environments</title>
<link>http://repository.upenn.edu/cis_papers/477</link>
<guid isPermaLink="true">http://repository.upenn.edu/cis_papers/477</guid>
<pubDate>Wed, 05 Oct 2011 11:41:16 PDT</pubDate>
<description>
	<![CDATA[
	<p>Collaborative models (e.g., wikis) are an increasingly prevalent Web technology. However, the open-access that defines such systems can also be utilized for nefarious purposes. In particular, this paper examines the use of collaborative functionality to add inappropriate hyperlinks to destinations outside the host environment (i.e., link spam). The collaborative encyclopedia, Wikipedia, is the basis for our analysis.</p>
<p>Recent research has exposed vulnerabilities in Wikipedia's link spam mitigation, finding that human editors are latent and dwindling in quantity. To this end, we propose and develop an autonomous classifier for link additions. Such a system presents unique challenges. For example, low barriers-to-entry invite a diversity of spam types, not just those with economic motivations. Moreover, issues can arise with how a link is presented (regardless of the destination).</p>
<p>In this work, a spam corpus is extracted from over 235,000 link additions to English Wikipedia. From this, 40+ features are codified and analyzed. These indicators are computed using "wiki" metadata, landing site analysis, and external data sources. The resulting classifier attains 64% recall at 0.5% false-positives (ROC-AUC=0.97). Such performance could enable egregious link additions to be blocked automatically with low false-positive rates, while prioritizing the remainder for human inspection. Finally, a live Wikipedia implementation of the technique has been developed.</p>

	]]>
</description>

<author>Andrew G. West et al.</author>


</item>






<item>
<title>Compositional Analysis of Real-Time Embedded Systems</title>
<link>http://repository.upenn.edu/cis_papers/476</link>
<guid isPermaLink="true">http://repository.upenn.edu/cis_papers/476</guid>
<pubDate>Tue, 13 Sep 2011 12:58:49 PDT</pubDate>
<description>
	<![CDATA[
	<p>This tutorial is concerned with various aspects of component-based design and compositional analysis of real-time embedded systems. It will first give an overview of component-based frameworks and their underlying principles. It will then go in-depth into abstraction methods for real-time components and techniques for computing their optimal interfaces, for both systems implemented on uniprocessor and multiprocessor platforms, as well as extensions to multi-mode systems. Besides theoretical aspects, the tutorial will also present an implementation of the compositional analysis framework on Xen virtualization and a demonstration of the CARTS toolset with several examples seeing the techniques in action. It will also include two case studies highlighting the utility of the framework, including the ARINC-653 avionics software and a smart-phone application. We will conclude the tutorial with a number of open challenges and research opportunities in this domain.</p>

	]]>
</description>

<author>Linh T.X. Phan et al.</author>


</item>






<item>
<title>Safety-Assured Development of the GPCA Infusion Pump Software</title>
<link>http://repository.upenn.edu/cis_papers/475</link>
<guid isPermaLink="true">http://repository.upenn.edu/cis_papers/475</guid>
<pubDate>Sat, 10 Sep 2011 06:37:14 PDT</pubDate>
<description>
	<![CDATA[
	<p>This paper presents our effort of using model-driven engineering to establish a safety-assured implementation of Patient-Controlled Analgesic (PCA) infusion pump software based on the generic PCA reference model provided by the U.S. Food and Drug Administration (FDA). The reference model was first translated into a network of timed automata using the UPPAAL tool. Its safety properties were then assured according to the set of generic safety requirements also provided by the FDA. Once the safety of the reference model was established, we applied the TIMES tool to automatically generate platform-independent code as its preliminary implementation. The code was then equipped with auxiliary facilities to interface with pump hardware and deployed onto a real PCA pump. Experiments show that the code worked correctly and effectively with the real pump. To assure that the code does not introduce any violation of the safety requirements, we also developed a testbed to check the consistency between the reference model and the code through conformance testing. Challenges encountered and lessons learned during our work are also discussed in this paper.</p>

	]]>
</description>

<author>BaekGyu Kim et al.</author>


</item>






<item>
<title>Biomedical Devices and Systems Security</title>
<link>http://repository.upenn.edu/cis_papers/474</link>
<guid isPermaLink="true">http://repository.upenn.edu/cis_papers/474</guid>
<pubDate>Wed, 07 Sep 2011 14:27:38 PDT</pubDate>
<description>
	<![CDATA[
	<p>Medical devices have been changing in revolutionary ways in recent years. One is in their form-factor. Increasing miniaturization of medical devices has made them wearable, light-weight, and ubiquitous; they are available for continuous care and not restricted to clinical settings. Further, devices are increasingly becoming connected to external entities through both wired and wireless channels. These two developments have tremendous potential to make healthcare accessible to everyone and reduce costs. However, they also provide increased opportunity for technology savvy criminals to exploit them for fun and profit. Consequently, it is essential to consider medical device security issues.</p>
<p>In this paper, we focused on the challenges involved in securing networked medical devices. We provide an overview of a generic networked medical device system model, a comprehensive attack and adversary model, and describe some of the challenges present in building security solutions to manage the attacks. Finally, we provide an overview of two areas of research that we believe will be crucial for making medical device system security solutions more viable in the long run: forensic data logging, and building security assurance cases.</p>

	]]>
</description>

<author>David Arney et al.</author>


</item>






<item>
<title>Video Quality Driven Buffer Sizing via Frame Drops</title>
<link>http://repository.upenn.edu/cis_papers/473</link>
<guid isPermaLink="true">http://repository.upenn.edu/cis_papers/473</guid>
<pubDate>Wed, 07 Sep 2011 14:27:25 PDT</pubDate>
<description>
	<![CDATA[
	<p><strong><strong> </strong></strong></p>
<p>We study the impact of video frame drops in buffer constrained multiprocessor system-on-chip (MPSoC) platforms. Since on-chip buffer memory occupies a significant amount of silicon area, accurate buffer sizing has attracted a lot of research interest lately. However, all previous work studied this problem with the underlying assumption that no video frame drops can be tolerated. In reality, multimedia applications can often tolerate some frame drops without significantly deteriorating their output quality. Although system simulations can be used to perform video quality driven buffer sizing, they are time consuming. In this paper, we first demonstrate a dual-buffer management scheme to drop only the less significant frames. Based on this scheme, we then propose a formal framework to evaluate the buffer size vs. video quality trade-offs, which in turn will help a system designer to perform quality driven buffer sizing. In particular, we mathematically characterize the maximum numbers of frame drops for various buffer sizes and evaluate how they affect the worst-case PSNR value of the decoded video. We evaluate our proposed framework with an MPEG-2 decoder and compare the obtained results with that of a cycle-accurate simulator. Our evaluations show that for an acceptable quality of 30 dB, it is possible to reduce the buffer size by upto 28.6% which amounts to 25.88 megabits.</p>

	]]>
</description>

<author>Deepak Gangadharan et al.</author>


</item>






<item>
<title>Towards a Compositional Multi-Modal Framework for Adaptive Cyber-Physical Systems</title>
<link>http://repository.upenn.edu/cis_papers/472</link>
<guid isPermaLink="true">http://repository.upenn.edu/cis_papers/472</guid>
<pubDate>Wed, 07 Sep 2011 14:27:12 PDT</pubDate>
<description>
	<![CDATA[
	<p><strong><strong> </strong></strong></p>
<p>Among the key characteristics of cyber-physical systems are the ability to adapt to changes during operation, the multidimensional complexity of multi-functionality and the underlying heterogeneous distributed architecture, as well as resource use efficiency. In this paper, we propose a compositional multi-modal approach to modeling, analyzing, and designing such systems. We introduce a general framework for modeling and compositional analysis of multi-mode systems on a distributed architecture that facilitates adaptivity, efficient use of resources, and incremental integration. We present some preliminary results, and we describe some of the remaining challenges and future directions.</p>

	]]>
</description>

<author>Linh T.X. Phan et al.</author>


</item>






<item>
<title>ToMaTo: A Trustworthy Code Mashup Development Tool</title>
<link>http://repository.upenn.edu/cis_papers/471</link>
<guid isPermaLink="true">http://repository.upenn.edu/cis_papers/471</guid>
<pubDate>Wed, 07 Sep 2011 14:26:59 PDT</pubDate>
<description>
	<![CDATA[
	<p>Recent years have seen the emergence of a new programming paradigm for Web applications that emphasizes the reuse of external content, the mashup. Although the mashup paradigm enables the creation of innovative Web applications with emergent features, its openness introduces trust problems. These trust issues are particularly prominent in JavaScript code mashup - a type of mashup that integrated external Javascript libraries to achieve function and software reuse. With JavaScript code mashup, external libraries are usually given full privileges to manipulate data of the mashup application and executing arbitrary code. This imposes considerable risk on the mashup developers and the end users.  <br><br>One major causes for these trust problems is that the mashup developers tend to focus on the functional aspects of the application and implicitly trust the external code libraries to satisfy security, privacy and other non-functional requirements. In this paper, we present ToMaTo, a development tool that combines a novel trust policy language and a static code analysis engine to examine whether the external libraries satisfy the non-functional requirements. ToMaTo gives the mashup developers three essential capabilities for building trustworthy JavaScript code mashup: (1) to specify trust policy, (2) to assess policy adherence, and (3) to handle policy violation. The contributions of the paper are: (1) a description of JavaScript code mashup and its trust issues, and (2) a development tool (ToMaTo) for building trustworthy JavaScript code mashup.</p>

	]]>
</description>

<author>Jian Chang et al.</author>


</item>






<item>
<title>Link Spamming Wikipedia for Profit</title>
<link>http://repository.upenn.edu/cis_papers/470</link>
<guid isPermaLink="true">http://repository.upenn.edu/cis_papers/470</guid>
<pubDate>Wed, 07 Sep 2011 12:23:10 PDT</pubDate>
<description>
	<![CDATA[
	<p>Collaborative functionality is an increasingly prevalent web technology. To encourage participation, these systems usually have low barriers-to-entry and permissive privileges. Unsurprisingly, ill-intentioned users try to leverage these characteristics for nefarious purposes. In this work, a particular abuse is examined -- link spamming -- the addition of promotional or otherwise inappropriate hyperlinks.</p>
<p>Our analysis focuses on the "wiki" model and the collaborative encyclopedia, Wikipedia, in particular. A principal goal of spammers is to maximize *exposure*, the quantity of people who view a link. Creating and analyzing the first Wikipedia link spam corpus, we find that existing spam strategies perform quite poorly in this regard. The status quo spamming model relies on link persistence to accumulate exposures, a strategy that fails given the diligence of the Wikipedia community. Instead, we propose a model that exploits the latency inherent in human anti-spam enforcement.</p>
<p>Statistical estimation suggests our novel model would produce significantly more link exposures than status quo techniques. More critically, the strategy could prove economically viable for perpetrators, incentivizing its exploitation. To this end, we address mitigation strategies.</p>

	]]>
</description>

<author>Andrew G. West et al.</author>


</item>






<item>
<title>Towards the Effective Temporal Association Mining of Spam Blacklists</title>
<link>http://repository.upenn.edu/cis_papers/469</link>
<guid isPermaLink="true">http://repository.upenn.edu/cis_papers/469</guid>
<pubDate>Wed, 07 Sep 2011 12:22:57 PDT</pubDate>
<description>
	<![CDATA[
	<p>IP blacklists are a well-regarded anti-spam mechanism that capture global spamming patterns. These properties make such lists a practical ground-truth by which to study email spam behaviors. Observing one blacklist for nearly a year-and-a-half, we collected data on roughly *half a billion* listing events. In this paper, that data serves two purposes.</p>
<p>First, we conduct a measurement study on the dynamics of blacklists and email spam at-large. The magnitude/duration of the data enables scrutiny of long-term trends, at scale. Further, these statistics help parameterize our second task: the mining of blacklist history for temporal association rules. That is, we search for IP addresses with correlated histories. Strong correlations would suggest group members are not independent entities and likely share botnet membership.</p>
<p>Unfortunately, we find that statistically significant groupings are rare. This result is reinforced when rules are evaluated in terms of their ability to: (1) identify shared botnet members, using ground-truth from botnet infiltrations and sinkholes, and (2) predict future blacklisting events. In both cases, performance improvements over a control classifier are nominal. This outcome forces us to re-examine the appropriateness of blacklist data for this task, and suggest refinements to our mining model that may allow it to better capture the dynamics by which botnets operate.</p>

	]]>
</description>

<author>Andrew G. West et al.</author>


</item>






<item>
<title>GSA: A Framework for Rapid Prototyping of Smart Alarm Systems</title>
<link>http://repository.upenn.edu/cis_papers/468</link>
<guid isPermaLink="true">http://repository.upenn.edu/cis_papers/468</guid>
<pubDate>Tue, 30 Aug 2011 09:21:06 PDT</pubDate>
<description>
	<![CDATA[
	<p>We describe the Generic Smart Alarm, an architectural framework for the development of decision support modules for a variety of clinical applications. The need to quickly process patient vital signs and detect patient health events arises in many clinical scenarios, from clinical decision support to tele-health systems to home-care applications. The events detected during monitoring can be used as caregiver alarms, as triggers for further downstream processing or logging, or as discrete inputs to decision support systems or physiological closed-loop applications.</p>
<p>We believe that all of these scenarios are similar, and share a common framework of design. In attempting to solve a particular instance of the problem, that of device alarm fatigue due to numerous false alarms, we devised a modular system based around this framework. This modular design allows us to easily customize the framework to address the specific needs of the various applications, and at the same time enables us to perform checking of consistency of the system.</p>
<p>In the paper we discuss potential specific clinical applications of a generic smart alarm framework, present the proposed architecture of such a framework, and motivate the benefits of a generic framework for the development of new smart alarm or clinical decision support systems.</p>

	]]>
</description>

<author>Andrew King et al.</author>


</item>






<item>
<title>Virtual Training via Vibrotactile Arrays</title>
<link>http://repository.upenn.edu/cis_papers/467</link>
<guid isPermaLink="true">http://repository.upenn.edu/cis_papers/467</guid>
<pubDate>Wed, 15 Jun 2011 08:39:14 PDT</pubDate>
<description>
	<![CDATA[
	<p>What is often missing from many virtual worlds and training simulations is a physical sense of the confinement and constraint of the virtual environment. We present a method for providing localized cutaneous vibratory feedback to the user’s right arm. We created a sleeve of tactors linked to a real-time human model; the tactors activate to apply sensation to the corresponding body area. The hypothesis is that vibrotactile feedback to body areas provides the wearer sufficient guidance to assume correct body configurations and ascertain the existence and physical realism of access paths. We present the results of human subject experiments that study both explicit and implicit training of skills using vibrotactile arrays. Implicitly, collision awareness is achieved by activating the appropriate tactor when a body part collides with the scene; thus, the user will attempt to correct his or her body configuration. Explicitly, we use the tactors to guide the body into the proper configuration. The results of human subject experiments clearly show that the use of full arm vibrotactile feedback improves performance over purely visual feedback for navigating the virtual environment, as well as allowing easy acquisition of new skills. These results validate the empirical performance of this concept.</p>

	]]>
</description>

<author>Aaron Bloomfield et al.</author>


</item>






<item>
<title>Lessons Learned from a PLTL-CS Program</title>
<link>http://repository.upenn.edu/cis_papers/466</link>
<guid isPermaLink="true">http://repository.upenn.edu/cis_papers/466</guid>
<pubDate>Mon, 06 Jun 2011 11:58:53 PDT</pubDate>
<description>
	<![CDATA[
	<p>The Peer-Led Team Learning (PLTL) approach has previously been shown to be effective in recruiting and retaining students, particularly under-represented students, in undergraduate introductory CS courses. In PLTL, small groups of students are led by an undergraduate peer and work together to solve problems related to CS. At Columbia University, the Columbia Emerging Scholars Program has used PLTL in an effort to increase enrollment in CS courses beyond the introductory level, and to increase the number of students who select Computer Science as their major, by demonstrating that CS is necessarily a collaborative activity that focuses more on problem solving and algorithmic thinking than on programming. Over the past five semesters, 68 students have completed the program, and preliminary results indicate that this program has had a positive effect on increasing participation in the major.</p>
<p>This paper discusses our experiences of building and expanding the Columbia Emerging Scholars program, and addresses such topics as recruiting, training, scheduling, student behavior, and evaluation. We expect that this paper will provide a valuable set of lessons learned to other educators who seek to launch or grow a PLTL program at their institution as well.</p>

	]]>
</description>

<author>Christian Murphy et al.</author>


</item>






<item>
<title>CCGbank: A Corpus of CCG Derivations and Dependency Structures Extracted from the Penn Treebank</title>
<link>http://repository.upenn.edu/cis_papers/465</link>
<guid isPermaLink="true">http://repository.upenn.edu/cis_papers/465</guid>
<pubDate>Thu, 02 Jun 2011 09:33:05 PDT</pubDate>
<description>
	<![CDATA[
	<p>This article presents an algorithm for translating the Penn Treebank into a corpus of Combinatory Categorial Grammar (CCG) derivations augmented with local and long-range word–word dependencies. The resulting corpus,CCGbank,includes 99.4% of the sentences in the Penn Treebank. It is available from the Linguistic Data Consortium,and has been used to train widecoverage statistical parsers that obtain state-of-the-art rates of dependency recovery.<br><br> In order to obtain linguistically adequate CCG analyses,and to eliminate noise and inconsistencies in the original annotation,an extensive analysis of the constructions and annotations in the Penn Treebank was called for,and a substantial number of changes to the Treebank were necessary. We discuss the implications of our findings for the extraction of other linguistically expressive grammars from the Treebank,and for the design of future treebanks.</p>

	]]>
</description>

<author>Julia Hockenmaier et al.</author>


</item>






<item>
<title>On Effective Testing of Health Care Simulation Software</title>
<link>http://repository.upenn.edu/cis_papers/464</link>
<guid isPermaLink="true">http://repository.upenn.edu/cis_papers/464</guid>
<pubDate>Sat, 07 May 2011 19:45:29 PDT</pubDate>
<description>
	<![CDATA[
	<p>Health care professionals rely on software to simulate anatomical and physiological elements of the human body for purposes of training, prototyping, and decision making. Software can also be used to simulate medical processes and protocols to measure cost effectiveness and resource utilization. Whereas much of the software engineering research into simulation software focuses on validation (determining that the simulation accurately models real-world activity), to date there has been little investigation into the testing of simulation software itself, that is, the ability to effectively search for errors in the implementation. This is particularly challenging because often there is no test oracle to indicate whether the results of the simulation are correct. In this paper, we present an approach to systematically testing simulation software in the absence of test oracles, and evaluate the effectiveness of the technique.</p>

	]]>
</description>

<author>Christian Murphy et al.</author>


</item>






<item>
<title>Removing Abstraction Overhead in the Composition of Hierarchical Real-Time System</title>
<link>http://repository.upenn.edu/cis_papers/463</link>
<guid isPermaLink="true">http://repository.upenn.edu/cis_papers/463</guid>
<pubDate>Sat, 07 May 2011 19:45:23 PDT</pubDate>
<description>
	<![CDATA[
	<p>The hierarchical real-time scheduling framework is a widely accepted model to facilitate the design and analysis of the increasingly complex real-time systems. Interface abstraction and composition are the key issues in the hierarchical scheduling framework analysis. Schedulability is essential to guarantee that the timing requirements of all components are satisfied. In order for the design to be resource efficient, the composition must be bandwidth optimal. Associativity is desirable for open systems in which components may be added or deleted at run time. Previous techniques on compositional scheduling are either not resource efficient in some aspects, or cannot achieve optimality and associativity at the same time. In this paper, several important properties regarding the periodic resource model are identified. Based on those properties, we propose a novel interface abstraction and composition framework which achieves schedulability, optimality, and associativity. Our approach eliminates abstraction overhead in the composition.</p>

	]]>
</description>

<author>Sanjian Chen et al.</author>


</item>






<item>
<title>Reputation-based Networked Control with Data-Corrupting Channels</title>
<link>http://repository.upenn.edu/cis_papers/462</link>
<guid isPermaLink="true">http://repository.upenn.edu/cis_papers/462</guid>
<pubDate>Tue, 03 May 2011 08:58:43 PDT</pubDate>
<description>
	<![CDATA[
	<p>We examine the problem of reliable networked control when the communication channel between the controller and the actuator periodically drops packets and is faulty <em>i.e., </em>corrupts/alters data. We first examine the use of a standard triple modular redundancy scheme (where the control input is sent via three independent channels) with majority voting to achieve mean square stability. While such a scheme is able to tolerate a single faulty channel when there are no packet drops, we show that the presence of lossy channels prevents a simple majority-voting approach from stabilizing the system. Moreover, the number of redundant channels that are required in order to maintain stability under majority voting increases with the probability of packet drops. We then propose the use of a reputation management scheme to overcome this problem, where each channel is assigned a reputation score that predicts its potential accuracy based on its past behavior. The reputation system builds on the majority voting scheme and improves the overall probability of applying correct (stabilizing) inputs to the system. Finally, we provide analytical conditions on the probabilities of packet drops and corrupted control inputs under which mean square stability can be maintained, generalizing existing results on stabilization under packet drops.</p>

	]]>
</description>

<author>Shreyas Sundaram et al.</author>


</item>





</channel>
</rss>

