[1] S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press, 2004. [2] Carlos Fernandez-Granda, Lecture Notes of “Optimization-based Data Analysis”, available at http: //www.cims.nyu.edu/~cfgranda/pages/OBDA_spring16/notes.html, 2016. [3] Carlos Fernandez-Granda, Lecture Notes of DSGA1002, available at http://www.cims.nyu.edu/ ~cfgranda/pages/DSGA1002_fall15/notes.html, 201...

This document is the author deposited version. You are advised to consult the publisher's version if you wish to cite from it. Published version SAYED, Muhammad, DIAZ GARCIA,, Jose Carlos and ALBOUL, Lyuba (2016). Texture recognition using force sensitive resistors. In: ALBOUL, Lyuba, DAMIAN, Dana and AITKEN, Jonathan M., (eds.) Towards autonomous robotic systems, 17th Annual Conference, TAROS ...

1. S. GiNDiKrN, 'Analysis on homogeneous domains', Russian Math. Surveys 19 (1964) 1-89. 2. M. KOECHER, 'An elementary approach to bounded symmetric domains', Lecture Notes, Rice University, 1969. 3. O. Loos, 'Bounded symmetric domains and Jordan pairs', Lecture Notes, University of California, Irvine, 1977. 4. A. UNTERBERGER and H. UPMEIER, Pseudodifferential analysis on symmetric cones (CRC-P...

This paper presents a seminal work in preparing lecture notes in epistemology of computer science and computer ethics through an open source personal wiki system engine. Our course of epistemology of computer science and computer ethics aims at making graduate students think about the fundamentals of the discipline as a science and as a profession, so we encourage a 'learning by doing' approach...

Introduction. These notes are an account of a day-long lecture workshop presented by Simon Thomas of Rutgers University at the University of Ohio at Athens on November 17, 2007, as part of the Appalachian Set Theory series. The workshop served as an intensive introduction to the emerging theory of countable Borel equivalence relations. These notes have been compiled from the lecture slides by S...

These are lecture notes from the first two lectures in Fall 2016, focusing on technical material we saw for secret sharing (including a proof by reduction using the hybrid proof technique). The notes do not include the general introduction to the course and modern crypto, as well as some discussion and motivation for secret sharing. Also not covered here is Shamir’s secret sharing, which we saw...

These are abridged lecture notes from the Spring 2017 course offering of “Principles of Data Analytics” that I offer at Iowa State University annually. This graduate level course offers an introduction to a variety of data analysis techniques, particularly those relevant for electrical and computer engineers, from an algorithmic perspective. Topics include techniques for classification, visuali...

These are lecture notes from a minicourse given at Louvain-laNeuve in May 2007. There is a high, but not perfect, correlation between the contents of these notes and the subjects covered in the minicourse. Note that since these are lecture notes and not an article, many proofs are not included, while those that are included are only sketches, which are particularly brief when the proofs have al...

Citation for published version: Bundy, A, van Harmelen, F, Smaill, A & Ireland, A 1990, Extensions to the Rippling-Out Tactic for Guiding Inductive Proofs. in 10th International Conference on Automated Deduction: Kaiserslautern, FRG, July 24–27, 1990 Proceedings. vol. Lecture Notes in Artificial Intelligence No. 449, Lecture Notes in Computer Science, vol. 449, Springer-Verlag GmbH, pp. 132-146...

This set of lecture notes presents a pedantic derivation of the connection between the Â-genus of spacetime’s loop space and the genus one partition function of the N = 1/2 sigma model. It concludes with some remarks on possible generalizations of the Âgenus which follow naturally from the ‘stringy’ point-of-view but have yet to be explored mathematically. This set of lecture notes is geared to...