413 research outputs found
Identifying facial landmarks, action units and emotions using deep networks
The goal of this thesis it to use deep neural networks, specifically Convolutional Neural Networks (CNNs) to predict facial landmarks, facial action units and emotions and to study the results of intermediate experiments while doing so. Learning the different features of facial images has always been a difficult task and primarily involves using hand-crafted features which would almost definitely ignore some information related to the different dynamics of facial features. We train our network model using the raw facial images and study its effectiveness in predicting facial landmarks, action units and emotions. In this thesis we learnt that CNNs are highly effective in predicting facial landmarks and AUs, mainly because of their ability to learn features from raw images. We also established that feature sets which can effectively outline the different properties of a face are more useful in classifying facial emotions than either images or facial landmarks.Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2018-08-01The student, Namrata Prabhu, accepted the attached license on 2016-07-19 at 23:05.The student, Namrata Prabhu, submitted this Thesis for approval on 2016-07-19 at 23:10.This Thesis was approved for publication on 2016-07-20 at 09:47.DSpace SAF Submission Ingestion Package generated from Vireo submission #10005 on 2016-11-10 at 12:27:17Made available in DSpace on 2016-11-10T18:35:29Z (GMT). No. of bitstreams: 2
PRABHU-THESIS-2016.pdf: 1381465 bytes, checksum: 1de17197c105f3400744a59fee46d58d (MD5)
LICENSE.txt: 4211 bytes, checksum: a1fdcef899567b4d81ebbb2317fe2e9f (MD5)
Previous issue date: 2016-07-20Embargo set by: Seth Robbins for item 95387
Lift date: 2018-11-10T18:35:44Z
Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD systemEmbargo set by: Seth Robbins for item 95387
Lift date: 2018-11-10T18:37:47Z
Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD systemEmbargo set by: Seth Robbins for item 95387
Lift date: 2018-11-10T18:39:22Z
Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD systemEmbargo set by: Seth Robbins for item 95387
Lift date: 2018-11-10T18:43:22Z
Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD systemU of I Only Restriction Lifted for Item 95387 on 2018-11-11T10:15:24Z
Interview
Dr. N. S. Prabhu is well known in the field of English Language Teaching as the author of the book
Second Language Pedagogy, and more importantly, as the person who conceptualized the widely
used approach "task based teaching". He has worked at the British Council and the National
University of Singapore. For most of us, he is the doyen of ELT in Indi
Practical verification of network planes
Formal network verification is a rapidly advancing field of research, encompassing a wide array of verticals such as data plane verification, configuration verification, network software verification etc. More and more real-world networks are deploying network verification as a tool to prevent outages and vulnerabilities. However, the fundamental challenges of scope and scalability make network verification unusable in a significant fraction of real-world networks. In this thesis, we discuss a new generation of verification techniques, algorithms and data structures designed to make network verification more universally applicable. We first present Plankton, a configuration verification platform that combines efficient explicit state model checking with domain-specific optimizations to enhance the scalability of configuration verification. Thanks to a highly effective suite of optimizations including state hashing, partial order reduction, and policy-based pruning, Plankton successfully verifies policies in industrial-scale networks quickly and compactly, at times reaching a 10000× speedup compared to the state of the art. Then, we discuss how the model checking-based technique can be used to verify network dataplanes with software components. We propose Plankton-neo, a tool for checking such dataplanes without the need for faithful middlebox models. Our design is effectively a hybrid, using an explicit-state model checker to explore all network-wide execution paths and event orderings, but executing real software as a subroutine for each device. Plankton-neo incorporates predefined models of specific protocols such as TCP and ICMP, along with a rich collection of policies that can be checked over dataplanes incorporating NFV components. We show that Plankton-neo can detect correctness issues that would be missed both by existing verification and testing approaches, and describe an implementation that can scale to large networks with good performance. Finally, we identify the fundamental challenges for scalable dataplane verification in the real world and propose ways to solve them better than the state of the art. We describe a new data structure for representing symbolic sets of packets for dataplane verification. Our design is inspired by Binary Decision Diagrams, but is able to overcome some specific limitations of BDDs in the context of storing packet sets. We describe a set of benchmark traces for evaluating packet set data structures, and perform an experimental comparison of our proposed data structure with BDDs. The experiments show that we are able to improve the time and memory overhead by significant amounts compared to BDDs.Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2022-05-01The student, Santhosh Prabhu Muraleedhara Prabhu, accepted the attached license on 2020-05-04 at 10:20.The student, Santhosh Prabhu Muraleedhara Prabhu, submitted this Dissertation for approval on 2020-05-04 at 10:34.This Dissertation was approved for publication on 2020-05-05 at 10:50.DSpace SAF Submission Ingestion Package generated from Vireo submission #15155 on 2020-08-25 at 17:42:30Made available in DSpace on 2020-08-27T00:50:16Z (GMT). No. of bitstreams: 3
PRABHUMURALEEDHARAPRABHU-DISSERTATION-2020.pdf: 4825543 bytes, checksum: 57c122b65156dca617505fe0b56e215e (MD5)
LICENSE.txt: 4232 bytes, checksum: ab55e6450f76ea0cd62aee12419b702e (MD5)
PROQUEST_LICENSE.txt: 4578 bytes, checksum: 828cbb8872f2670c0604a5fc126e23e1 (MD5)
Previous issue date: 2020-05-05Embargo set by: Seth Robbins for item 115914
Lift date: 2022-08-27T00:50:22Z
Reason: Author requested closed access (OA after 2yrs) in Vireo ETD systemEmbargo set by: Seth Robbins for item 115914
Lift date: 2022-08-27T00:51:40Z
Reason: Author requested closed access (OA after 2yrs) in Vireo ETD systemAuthor requested closed access (OA after 2yrs) in Vireo ETD systemLimite
"Form of Life" as Transcendental Dhvani Meaning Venkataraman Prabhu
"Meaning" has been an evergreen concept in Indian philosophy and poetics. Traditional Indian philosophical and literary schools have been competing with each other in the conceptual clarification of how one arrives at the meaning of a word and on what basis. This paper is concerned with one such conception of "meaning" called dhvani (suggested meaning), aiming at a philosophical rationale for the concept of dhvani. In discourses pertaining to Indian theories of meaning, dhvani occupies an important place. Often the concept of dhvani is found in poetic and literary discourses. This paper focuses on one important aspect concerning what makes suggested meaning possible. It focuses on the philosophical rationale of how one can understand a suggested meaning. How can a suggested meaning be understood by one and not by another? What are the conditions for the possibility for an individual to understand? To answer these questions, the author follows the philosopher Wittgenstein\u27s notion of "form of life", developing it further to claim that "form of life" is the conditions for the possibility of having a dhvani meaning. Thus this paper aims at exploring the conditions that give rise to the possibility of suggested meanings through the concept of "form of life"
An introduction to granular flow / K. Kesava Rao, Prabhu R. Nott.
engineering bookfair2015Includes bibliographical references (p. 463-482) and index.xxi, 490 pages :This book describes theories for granular flow based on continuum models and alternative discrete models
An assessment of Participatory Forest Management inspired by adaptive collaborative management in Malawi
This chapter begins with a description of Participatory Forest Management (PFM) in Malawi and its legislation and related projects – laying out the similarities between the legislation’s ‘standards and guidelines’ and adaptive collaborative management (ACM). The first author was the lead researcher in the Center for International Forestry Research’s original ACM work in Malawi and has been a consistent advisor to the Government of Malawi. The authors then provide a summary of each of the numerous studies undertaken to assess the efficacy and value of the approach there. Building on these findings, they examine the intended outcomes of PFM, from the standpoints of livelihoods, strengthened forestry institutions, community participation in forest management and ecological health. They summarize by recounting eight lessons that have been learned in the process; and conclude with enthusiasm for the ACM/PFM approach, in recognition that more could still be done to improve it
Ladder Variables in Queueing Theory
In the present survey, we follow the treatment given by Feller (1966). In Sections 2 and 3, we develop the basic results concerning the ladder processes arising from a general one-dimensional random walk. In Section 4, we apply these results to the waiting time in a single-server queue, with details worked out for the two cases where (i) the arrivals are Poisson, and (ii) service times are exponentially distributed. In Section 5, these two systems are again considered, and the concepts of Sections 2 and 3 are used to investigate the number of customers present in each system at certain epochs of time. The discussion of these simple cases reveals the essential features of the theory; a detailed account of the general single-server queue using ladder processes is given by Prabhu (1965b). It is the author\u27s contention that the limiting properties of the queue (for example, the so-called heavy traffic behavior, inequalities for the mean waiting time, and other characteristics) arise as natural consequences of the results presented here, but we shall not discuss them in this paper
We have to look further; interview
At his farewell event Emeritus Professor Prabhu Kandachar displayed more enthusiasm, idealism and optimism than many a politician. The more complex the world becomes, the more work there will be for designers.Industrial Design Engineerin
Reclamation of Dye Affected Soil at Tirupur Region by Using Vermitechnology, South India
Soil from the dye affected area is taken for various analysis. Similarly soil from the fertile land is also taken for analysis in the same region. Most of the soils polluted by heavy metals can be reclaimed using a number of expensive tactics that either remove the contaminants or stabilize them within the soil .To analyze the parameters such as soil pH, temperature, soil fungal, bacterial and actinomycetes population of both the samples. Find out what are the metals present in the soil samples. Apply vermicompost to the dye affected soil for reclamation. Again we should analyze soil pH, temperature, fungal, bacterial and actinomycetes population of both the soil samples .The results are discussed with the literature.----------------------------------------------------------------------------------V. Prabhu, M. Ishwarya, S.R. Kayalvizhi, R. Hariprakash, and V. Balakrishnan*Department of Biotechnology, K.S.Rangasamy College of Technology, Tiruchengode-637 215, Tamilnadu, India*Corresponding Author, Email: [email protected] Please Cite This Article As:  V. Prabhu, M. Ishwarya, S.R. Kayalvizhi, R. Hariprakash, and V. Balakrishnan. 2010. Reclamation of Dye Affected Soil at Tirupur Region by Using Vermitechnology, South India. J. Ecobiotechnol. 2(4):16-21. Â
Review of thermo-physical properties, wetting and heat transfer characteristics of nanofluids and their applicability in industrial quench heat treatment
Abstract The success of quenching process during industrial heat treatment mainly depends on the heat transfer characteristics of the quenching medium. In the case of quenching, the scope for redesigning the system or operational parameters for enhancing the heat transfer is very much limited and the emphasis should be on designing quench media with enhanced heat transfer characteristics. Recent studies on nanofluids have shown that these fluids offer improved wetting and heat transfer characteristics. Further water-based nanofluids are environment friendly as compared to mineral oil quench media. These potential advantages have led to the development of nanofluid-based quench media for heat treatment practices. In this article, thermo-physical properties, wetting and boiling heat transfer characteristics of nanofluids are reviewed and discussed. The unique thermal and heat transfer characteristics of nanofluids would be extremely useful for exploiting them as quench media for industrial heat treatment.</p
- …
