591 research outputs found
Synthesis of Fault-Tolerant Concurrent Programs (Extended Abstract)
No full text) Anish ARORA 1 Department of Computer Science The Ohio State University [email protected] Paul C. ATTIE 2 School of Computer Science Florida International University [email protected] E. Allen EMERSON 3 Department of Computer Sciences The University of Texas at Austin [email protected] Abstract Methods for mechanically synthesizing concurrent programs from temporal logic specifications obviate the need to manually construct a program and compose a proof of its correctness [EC82, MW84, PR89, PR89b, AM94]. A serious drawback of extant synthesis methods, however, is that they produce concurrent programs for models of computation that are often unrealistic. In particular, these methods assume completely fault-free operation, i.e., the programs they produce are fault-intolerant. In this paper, we show how to mechanically synthesize fault-tolerant concurrent programs for various fault classes. We illustrate our method by synthesizing fault-tolerant solutions to the mutual..
Synthesis of Fault-Tolerant Concurrent Programs
No full text) Paul C. ATTIE z School of Computer Science Florida International University [email protected] Anish ARORA x Department of Computer Sciences The Ohio State University [email protected] E. Allen EMERSON -- Department of Computer Sciences The University of Texas at Austin [email protected] Abstract Methods for mechanically synthesizing concurrent programs from temporal logic specifications have been proposed (cf. [EC82, MW84, PR89, PR89b, AM94]). An important advantage of these synthesis methods is that they obviate the need to manually construct a program and compose a proof of its correctness. A serious drawback of these methods in practice, however, is that they produce concurrent programs for models of computation that are often unrealistic. In particular, all extant synthesis methods assume completely fault-free operation, i.e., the programs they produce are fault-intolerant. In this paper, we show how to mechanically synthesize fault-tolerant concurrent program..
Micro-power Pulsed-Doppler Radar Clutter and Displacement Source Classification Dataset
No full textThis is the official dataset for the ACM BuildSys 2019 publication One Size Does Not Fit All: Multi-Scale, Cascaded RNNs for Radar Classification.
The training code for MSC-RNN can be found at https://github.com/dhruboroy29/MSCRNN
Kindly cite this work as:
@article{roy2019one,
title={One Size Does Not Fit All: Multi-Scale, Cascaded RNNs for Radar Classification},
author={Roy, Dhrubojyoti and Srivastava, Sangeeta and Kusupati, Aditya and Jain, Pranshu and Varma, Manik and Arora, Anish},
journal={arXiv preprint arXiv:1909.03082},
year={2019}
}
</pre
Detectors and Correctors: A Theory of Fault-Tolerance Components
No full textIn this paper, we show that two types of tolerance components, namely detectors and correctors, appear in a rich class of fault-tolerant systems. This class includes systems designed using the wellknown techniques of encapsulation and refinement, as well as systems designed using extant fault-tolerance methods such as replication and the state-machine approach. Our demonstration is via a theory of detectors and correctors, which characterizes the particular role of these components in achieving various types of fault-tolerance. Based on this theory and on our experience with using these components in designs, we suggest that detectors and correctors provide a powerful basis for efficient, component-based design of fault-tolerance. Keywords : Composition, Fault environment, Tolerance components, Tolerance design 1 A preliminary version of this paper appeared as [6]. Email: fanish,[email protected] ; Web: http://www.cis.ohio-state.edu/f~ anish,~kulkarni g; Tel: +1-614-292-18..
Planar Maximum Matching: Towards a Parallel Algorithm
No full textPerfect matchings in planar graphs have been extensively studied and understood in the context of parallel complexity [P W Kastelyn, 1967; Vijay Vazirani, 1988; Meena Mahajan and Kasturi R. Varadarajan, 2000; Datta et al., 2010; Nima Anari and Vijay V. Vazirani, 2017]. However, corresponding results for maximum matchings have been elusive. We partly bridge this gap by proving:
1) An SPL upper bound for planar bipartite maximum matching search.
2) Planar maximum matching search reduces to planar maximum matching decision.
3) Planar maximum matching count reduces to planar bipartite maximum matching count and planar maximum matching decision.
The first bound improves on the known [Thanh Minh Hoang, 2010] bound of L^{C_=L} and is adaptable to any special bipartite graph class with non-zero circulation such as bounded genus graphs, K_{3,3}-free graphs and K_5-free graphs. Our bounds and reductions non-trivially combine techniques like the Gallai-Edmonds decomposition [L. Lovász and M.D. Plummer, 1986], deterministic isolation [Datta et al., 2010; Samir Datta et al., 2012; Rahul Arora et al., 2016], and the recent breakthroughs in the parallel search for planar perfect matchings [Nima Anari and Vijay V. Vazirani, 2017; Piotr Sankowski, 2018]
Ideas for rent: an overview of markets for technology
No full textThis article surveys some of the recent literature on technology markets, and summarizes its main issues and insights. We structure our analysis in three parts: the supply and demand of technology; the factors that condition the formation and growth of technology markets; industry structure and dynamic issues. In addition, we summarize some of the studies that have tried to document the size and growth of these markets. We find that the literature has focused mainly on the supply of technology, but several other aspects of these markets remain under-studied, including the demand for external technology, the role of uncertainty in technology markets, and the dynamic interaction between industry structure and the market for technology. Understanding these will illuminate whether markets for technology will continue to grow or remained confined to pockets of the economy. Copyright 2010 The Author 2010. Published by Oxford University Press on behalf of Associazione ICC. All rights reserved., Oxford University Press.
Metrics for analytics and visualization of big data with applications to activity recognition
No full textActivity recognition systems detect the hidden actions of an agent from sensor measurements made on the agents' actions and the environmental conditions. For such systems, metrics are important for both performance evaluation and visualization purposes. In this thesis, such metrics are developed and illustrated. For human activity recognition datasets, a reporting structure is described to visualize the metrics in a systematic manner. The other contribution of this thesis is to describe a visualization tool for estimating the orientation (attitude) of a rigid body from streaming motion sensor (accelerometer and gyroscope) data. A feedback particle filter (FPF) is implemented algorithmically to solve the estimation problem.Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2018-05-01The student, Rohan Arora, accepted the attached license on 2016-04-25 at 10:47.The student, Rohan Arora, submitted this Thesis for approval on 2016-04-25 at 10:48.This Thesis was approved for publication on 2016-04-27 at 15:05.DSpace SAF Submission Ingestion Package generated from Vireo submission #9459 on 2016-07-07 at 14:17:57Made available in DSpace on 2016-07-07T21:18:02Z (GMT). No. of bitstreams: 2
ARORA-THESIS-2016.pdf: 2048739 bytes, checksum: f76095ae5ef05e4ce14c6b05ab503f5d (MD5)
LICENSE.txt: 4208 bytes, checksum: e5888a1be6c205bee6e88396c3d3da15 (MD5)
Previous issue date: 2016-04-27Embargo set by: Seth Robbins for item 93308
Lift date: 2018-07-07T21:18:16Z
Reason: Author requested closed access (OA after 2yrs) in Vireo ETD systemLimited Restriction Lifted for Item 93308 on 2018-07-08T09:15:30Z
- …
