57 research outputs found

    Corrections After defence

    No full text
    Dissertation after corrections<br

    Multivariate Correlation Analysis for Supervised Feature Selection in High-Dimensional Data

    No full text
    The main theme of this dissertation focuses on multivariate correlation analysis on different data types and we identify and define various research gaps in the same. For the defined research gaps we develop novel techniques that address relevance of features to the target and redundancy of features amidst themselves. Our techniques aim at handling homogeneous data, i.e., only continuous or categorical features, mixed data, i.e., continuous and categorical features, and time serie

    ThesisFinalSubmitted

    No full text
    Thesis doccument<br

    Data_AppliedDataScience

    No full text
    Data for MANTIS-Bosch collaboration paper submitted for ECML-PKDD 2018.</div

    Discovering mentorship information from author collaboration networks

    No full text
    Researchers are assessed from a researcher-centric perspective - by quantifying a researcher's contribution to the field. Citation and publication counts are some typical examples. We propose a student-centric measure to assess researchers on their mentoring abilities. Our approach quantifies benefits bestowed by researchers upon their students by characterizing the publication dynamics of research advisor-student interactions in author collaboration networks. We show that our measures could help aspiring students identify research advisors with proven mentoring skills. Our measures also help in stratification of researchers with similar ranks based on typical indices like publication and citation counts while being independent of their direct influences

    Circuit complexity in interacting QFTs and RG flows

    No full text
    We consider circuit complexity in certain interacting scalar quantum field theories, mainly focusing on the phi(4) theory. We work out the circuit complexity for evolving from a nearly Gaussian unentangled reference state to the entangled ground state of the theory. Our approach uses Nielsen's geometric method, which translates into working out the geodesic equation arising from a certain cost functional. We present a general method, making use of integral transforms, to do the required lattice sums analytically and give explicit expressions for the d = 2, 3 cases. Our method enables a study of circuit complexity in the epsilon expansion for the Wilson-Fisher fixed point. We find that with increasing dimensionality the circuit depth increases in the presence of the phi(4) interaction eventually causing the perturbative calculation to breakdown. We discuss how circuit complexity relates with the renormalization group

    Temporal sequencing of concepts in a function knowledge base

    No full text
    The author studies the involvement of time in the execution of function concepts. He proposes a directed graph model, temporal graph, to reflect the execution sequence of these concepts and shows how it can be embedded in a function knowledge base. He defines the cohesiveness coefficient of a concept on the basis of this temporal graph. Further, he states a necessary and sufficient condition for detecting simultaneous execution of concepts in a given set of objects

    Graph Extraction and Demand Profiling Applications for Transportation Network Research

    No full text
    AbstractDynamic transportation algorithms possess applications in disaster planning an emergency response. Two important prerequisites to build and test dynamic transportation network vulnerability assessment algorithms are (i) map extraction tools and (ii) an accurate network demand profile to test algorithms on these maps. This paper describes the tools built to enable dynamic transportation network vulnerability assessment algorithms, including a discussion of the architecture of the software applications developed to extract maps and collect dynamic network demand data using a smartphone app

    Study of connectionless service for ATM networks and an implementation of the LAN emulation service for ATM

    No full text
    This project studies various approaches that provide connectionless service over Asynchronous Transfer Mode (ATM) networks that are pre-dominantly connection oriented. The two fundamentally different ways of running existing network layer protocols across an Asynchronous Transfer Mode network are examined. The "LAN Emulation" approach of emulating connectionless protocols over connection oriented ATM network is implemented in this project. The project implementation aims at seamlessly interconnecting Local Area Network (LAN) traffic over connection oriented Asynchronous Transfer Mode networks. This project details the implementation and design of the LAN Emulation protocol to emulate the characteristics of a LAN over ATM networks. This project explains the operation of the LAN Emulation protocol and also details the development and target environment in which the LAN Emulation protocol is implemented and executed. It discusses test configurations and the equipment used in performing the tests. This project provides test results and points out the limitations of the LAN Emulation protocol specification and existing implementations. Through this implementation, the author believes that although LAN Emulation protocol has its limitations, it is a very good technique to emulate LAN services over ATM networks.California State University, Northridge. Department of Computer Science.Includes bibliographical references (leaves 52-53
    corecore