Abstract

Ontology, as a philosophical discipline of the study of reality, has gained traction in recent times and is appropriated into computer science giving rise to a new discipline called ‘Ontology Engineering’. One of the main goals of ontology engineering, is how to specify meaning to a computer. But that question takes us back to the foundational issue of what meaning is, and how does one go about studying it so that one can specify it to a computer as explicitly and as accurately as possible. The answer to this question lies in ‘Formal Ontology’. Formal ontology is the study of forms of entities in reality as opposed to their contents. The term was first coined by Edmund Husserl who envisioned it as the ‘eidetic science of the object as such’ i.e., the study of all those features of an object insofar as they make it what it is i.e., an object. But what the forms of entities in reality are, and how to study them is still anopen issue. The notion of a formal ontology so far has been mainly understood as the application offormal logic, particularly First-Order Logic (FOL) and its variants, to ontology. But since FOL is based on propositional form which is primarily a syntactic form, and does not have any semantics of its own, it requires something outside itself to give semantics to it. One needs to look at various conceptions of reality to provide such semantics. We look at three such conceptions of reality: (1) as sets of entities (2) as parts and wholes, and (3) as states of affairs (SOAs), and claim that the SOA-conception of reality is the most apt candidate to study reality formally and, in turn, to do formal ontology. But we also show that the propositional form, and in turn, FOL, is incapable of capturing the structure of SOAs. Though there had been various attempts to overcome the problems of classical logic like FOL by construction of new and alternative logics, almost all these logics still swear by the fundamental notion of the subject-predicate form ( propositional form ) which is fundamentally a sentential or linguistic or logical form as opposed to an entitative or extra-linguistic or ontological form. Hence these logics are also incapable of capturing the structure of SOAs. In fact, there has been so far no proper ontological form which captures the structure of SOAs, in toto . We propose a non-propositional, non-set-theoretic, onto-logical form , called punctuator to capture the structure of SOAs in toto , and in turn to do formal ontology. We then consider Vaiśeṣika, the foundational ontology in Indian analytic tradition, and present a formalized version of it - Neo-Vaiśeṣika Formal Ontology (NVFO) - using only punctuators to give an instance of a formal ontology as construed above. NVFO was founded by Singh (2002, 2003, 2008) and later refined and extended by Navjyoti Singh and Rajesh Tavva (Tavva & Singh, 2015). Notwithstanding our appeal to take recourse to formal ontology to specify meaning to a computer explicitly, we also propose a novel idea called generative ontology to make the specification of this meaning to a computer as accurate as possible. In a generative ontology, a potentially infinite number of complex ontological structures (SOAs/punctuators) can be generated from a finite number of atomic (or irreducible) ontological structures (SOAs/punctuators). This becomes possible because the form of punctuator is recursive in nature. A punctuator is a boundary (a non-entity) which brings two entities together in some relational context R which, itself, is further composed of chains of entities (and punctuators between them), hence making the structure of a punctuator complex as well as recursive. Because of this complexity of a punctuator as a web of entities and punctuators between them, the structure of a punctuator can be best understood as a graph (as composed of nodes and edges). Graph grammars, being a natural extension of string as well as tree grammars, are highly expressive and powerful enough to capture the generative structure of a wide variety of scenarios - both simple and complex. Unfortunately, this power is not leveraged by many. Most of the graph grammars available hitherto are either toy grammars or limited to addressing highly specialized problems. The current thesis presents a domain-independent grammar i.e., a grammar for reality, as theorized in Vaiśeṣika. We contend that Vaiśeṣika ontology, given that it implicitly exhibits the ontological structure of a punctuator, is one such ontology which can be generated from some basic alphabet of punctuators. Hence it is not only a formal ontology but also a generative ontology. Given the fact that most of the existing foundational ontologies (those which deal not with a particular domain of reality but with entire reality as such) are not generated but manually constructed, the idea of a generative ontology becomes significant because of its capacity to impar

Abstract

The domain of cultural mapping deals with capturing and representing knowledge regarding diverse tangible (physical artifacts, architectural landmarks, etc.) and intangible aspects of cultural heritage (language, performing arts, social practices, rituals, festive events etc.) which involve hybrid data sets from incompatible sources with different terminologies and representational schemas. Access to desired information is constrained by different terminologies for same concepts and difficulties in querying across data sets. Documentation and representation of knowledge in the domains of tangible and intangible cultural heritage along with the need for preservation of perishable data emphasize the need for specialized cataloging metadata. Semantic web can be used to ease interoperability and allow information exchange among different agents dealing with cultural aspects of a region or a community. Furthermore, the complex schema integration problem in this domain can be addressed efficiently by use of formal ontologies which provide universal schema to represent data from heterogeneous sources. One such widely accepted formal ontology to facilitate the integration, mediation, interchange of heterogeneous cultural heritage Information is CIDOC-CRM. We propose and implement an extension of CIDOC CRM ontology for the purpose of cultural mapping of villages of India. With help of four different case studies, we discuss how the framework provides an approach by which diverse cultural network semantics operating at the granularity of villages in India can be described independently of cultural data sources and in turn provide a schema allowing cultural data exchange among information systems and users. As part of one of the case studies we employ the model for construction of an open, interconnected semantic knowledge graph capturing and representing the cultural information for all the villages of India and at the same time preserving the unique cultural reality of each individual village. Building upon the Census of India data mapped to the ontological extension, we further implement different pipelines with help of custom built tools and applications to import information from subject matter experts (experts on local culture of the village), surveys and descriptive textual data to populate the semantic knowledge graph. The knowledge representation of intangible cultural heritage is highlighted through a case study and another use case of the model described is representation of the history of a village in terms of a graph of events influencing each other. The thesis also provides a critical analysis of domain of cultural mapping highlighting the generic intellectual and pragmatic challenges faced while representing cultural knowledge.

Abstract

Various philosophers including Bertrand Russell and Ludwig Wittgenstein have shared the view that extra-linguistic reality and its nature are somehow linked with language. Given that language is a medium of capturing the objective truth around us, it is possible that the formal logic of language could also be inspired by how the world around us operates. Reality as we understand it, is a series of continuous interactions between objects. These interactions are loosely referred to us by as events. With constant rise in content generated every day, it has become arduous task to keep track of all the events happening in the real world. A major challenge information access tasks face is that they have to deal with colossal amounts of unstructured data, i.e., data whose format loosely implies its meaning described in a human understandable language. This makes understanding event mentions in text a key problem in Natural Language Processing. Event detection is an important Natural Language Processing and Information Retrieval problem, that has been extended to multiple domains and is now being tackled for languages other than English.In this thesis, we address the problem of event detection in Hindi. Hindi, like many other languages is an object-centric language that grounds a metaphysical system in objects, with sentence constructions mainly describing the properties (state) of a noun or the interaction between these nouns. If we were to use Hindi to define the nature of being, real world events would be formally captured as a series of interactions between nouns. We are further motivated by the fact that, in the past few years, the doctrine that actions are events has become an essential, and sometimes an unargued part of the received view in the philosophy of action, despite the efforts of a few philosophers to undermine the consensus. This task is an important one given the constant rise in volume of Hindi data being produced and consumed. A recent report shows that Hindi content consumption on the web is growing at a rate of 94% per year as compared to English’s 19%1 . Given a low resource language like Hindi, with abundance in unstructured text, we believe leveraging systems to automatically detect events in unstructured texts can enable significant advances in the performance of various information access tasks. The task of event detection in Hindi is relatively unexplored, partly because of syntactic features such as relative free word order and nature of verb adjuncts and partly due to the lack of structured data in Hindi. These properties of Hindi, increase the number of options available for expressing structured information, hence significantly complicating how chunks of text can be semantically interpreted.From the perspective of extracting latent information, defining events as semantico-syntactic objects allows for extracting relations between both events and entities, that are not explicitly mentioned. The extracted event information can then be readily consumed by downstream tasks such as Question Answering, Summarization and Knowledge Graph generation. The initial work presented in this thesis is directed towards tackling two major challenges. The primary being understanding how event mentions are captured in Hindi. This task, motivated by the interesting property of Hindi, where the syntax of the sentence is influenced by the event-semantics, becomes a compelling one. The observations of our studies are captured and formulated as two documents (annotation guidelines and annotation specifications) that allow accurate identification of event mentions in Hindi text. The second challenge we tackle is that of automating the task of event mention detection in Hindi texts. In order to kickstart exploration in the domain of machine learning approaches, we build and publish the largest event annotated dataset for Hindi. Our research sheds lights on the various possible methods to automate event detection in Hindi texts and compares the impact of techniques built on top of and without hand-crafted features. Machine learning techniques for automated event-detection have advanced fairly owing to the current rise in introduction and adoption of sophisticated neural architectures. However, these architectures are plagued by biases in opportunistically collected data sets for major languages. As a result of this, there is little to no progress in development of resources and solutions for low resource languages. Driven by this motivation, the final part of work attempts to tackle this by introducing an architecture, the MultiLingual Sequence Tagger (M-LiST) capable of training on a combination of four monolingual datasets and attaining state of the art performance for open domain event detection on the in three languages and current best performance for one of the languages.

Abstract

Stroke is the leading cause of severe chronic disability and the second cause of death worldwide with 15 million new cases and 50 million stroke survivors. The poststroke chronic disability may be ameliorated with early neuro rehabilitation where non-invasive brain stimulation (NIBS) techniques can be used as an adjuvant treatment to hasten the effects. However, the heterogeneity in the lesioned brain will require individualized NIBS intervention where innovative neuroimaging technologies of portable electroencephalography (EEGlabel) and functionalnear-infrared spectroscopy (fNIRS) can be leveraged for Brain State Dependent Electrotherapy (BSDE). In this thesis, we first present a theoretical model and a computational approach based on excitation–inhibition (E–I) balance hypothesis to objectively quantify the poststroke individual brain state using online fNIRS–EEG joint imaging. One of the key events that occurs following Stroke is the imbalance in local E–I (that is the ratio of Glutamate/GABA), which may be targeted with NIBS using a computational pipeline that includes individual “forward models” to predict current flow patterns through the lesioned brain or brain target region. Next, we give a proof of concept for our approach by using The Virtual Brain platform, which allows for individual, subject-specific models of the brain. We set up a pipeline that simulates tDCS on a realistic head model, and incorporated these electric field effects into the large scale brain network model to produce cortical activity. Using the pipeline set up, we investigate the effects of tDCS and E-I parameters on cortical activity, and validate it with experimental findings.

Abstract

The Standard Model of particle physics has been a successful theory in explaining the constituents of matter and the forces governing them (except gravity). However, some theoretical and experimental observations suggest that it’s not a complete theory of nature. Some measurements in B meson decays (such as the ratios R D , R D ∗ and R k ) and the value of muon anomalous magnetic moment, a μ deviate significantly from the Standard Model predictions. These anomalies can be explained through some Beyond Standard Model theories which predict the existence of a hypothesized particle called leptoquark. Leptoquarks can have O(TeV) masses and large couplings to third generation quarks. In this dissertation, we study single and pair-produced scalar leptoquarks, with left and right-handed couplings, that decay to top quarks and muons in 13 TeV proton-proton collisions at the LHC. We utilize HEPTopTagger to detect top quarks in the Monte Carlo event samples generated from Madgraph and passed on to Pythia for showering. Delphes is used to simulate detector effects. To discriminate our signal from the Standard Model background, we apply cuts on various physical quantities and calculate the 5σ discovery reach of the High Luminosity LHC (HL-LHC) at 3000 f b −1 . We find that the HL-LHC discovery reach at 5σ significance for the left-handed scenario is about 2 TeV. For the right-handed scenario, the discovery reach at 5σ is around 1.75 TeV. In the first chapter, we introduce the subject of high energy physics. In chapter two, we give a brief introduction to quantum field theory, the Standard Model of particle physics and some Beyond Standard Model (BSM) theories. Chapter three gives an overview of the experimental setup for our study. In chapter four, we introduce leptoquarks and describe some of its previous searches. Chapter five deals with the analysis of our study. In chapter six, we present the results and conclusions of the study

Abstract

In the recent times there has been a rapid growth in telecommunication industry. This leads to the demands of larger bandwidth and faster signal processing. However due to the limitations of electronic devices it is becoming increasingly difficult to cater to this ever increasing demand of bandwidth. It was later discovered that signal processing in optical devices is faster as compared to it’s electronic counterparts. This advantage of optical devices over electronic ones has attracted large number of researchers to study, understand and develop various all-optical devices. It is where the semiconductor ring laser provides a viable alternative as a key element to various faster optical devices. In this thesis we first introduce all-optical switching devices such as schmitt trigger and delta sigma modulator which are crucial part of signal processing. The effects of designer oriented parameters on various specifications like switching time, sampling speed and input amplitude are also studied and analyzed later on. The only parameters which can be readily varied externally are considered because those are the parameters a designer can tune. Such an analysis is essential for optimization of BDSM’S parameters and getting the desired sampling rate. In the last chapter an all-optical proteretic device is introduced which works in just opposite fash- ion to hysteretic devices and can enable us to sample signals at even higher speeds of modulation as compared to conventional scmhitt trigger. The reason for proteretic switch being faster is that it avoids delayed transition as found in conventional hysteretic switch. Lastly a novel method of modulation in the form of all-optical hysteretic proteretic switch is introduced. Rate equations of semiconductor ring laser is mathematically modeled in MATLAB.

Abstract

Web services are facing a constant threat from ever-increasing novel attacks. Attackers are continually coming up with new and unseen attacks whenever a vulnerability is found. Also, as the at- tackers have access to massive Botnets, these attacks are initiated immediately, before the interested party patches the vulnerability, to cause a denial of service on the targeted service. In this context, anomaly-based network intrusion detection techniques are valuable to protect the web services against these unknown attacks. Anomaly detection algorithms have gained significance to counter these unknown attacks, although they have high false alarms rates. As these algorithms can be effective on unknown attacks, web services can leverage them to defend against botnets. These algorithms need to be applied on the traffic which is handled by the scalable web services, in effect, there is a need for developing an intrusion detection system which is scalable with the web service it is protecting and also validate the alarms raised by these algorithms. Network-based anomaly detection is a well-mined area of research, with many projects that have produced algorithms to detect suspicious and anomalous activities. In this thesis, a bot detection architecture named BotD is proposed; this architecture provides a framework to plugin existing anomaly detection algorithms and the newer ones as they evolve. These installed algorithms analyze the incoming traffic and raise anomaly alarms when suspicious activity is detected. The architecture validates these alarms and takes appropriate actions. If the alarm validation turns out to be positive, the architecture marks the clients with such traffic patterns as bots and drops the traffic coming from them subsequently. In the case of false alarms, feedback is given to the algorithms to improve themselves. Moreover, BotD provides an interface for algorithm developers to monitor various metrics related to the algorithms plugged-in and takes care of scaling itself with the incoming traffic. Furthermore, in the thesis, we propose a network orchestration algorithm, used to transfer state across hosts using the SDN control layer. This proposed orchestration algorithm is used in this architecture to transfer plugged-in algorithms’ state efficiently across nodes while scaling. Finally, a simulation of the architecture is presented as a proof of concept for the proposed architecture.

Abstract

The construction of buildings is attained using force based design based on existing code provisions. Force based design has limitations as it only takes into account peak acceleration but not frequency content and duration of ground motion. A more reliable technique under consideration is energy based design which takes into account frequency content as well as duration of ground motion. Therefore it is essential to study the relation between different structure as well as earthquake characteristics with energy. In this study two types of structure, long period and short period, is considered because of the major difference in their response to earthquake. Therefore behavior of long and short time period structures is studied in terms of energy and damage induced when subjected to dynamic earthquake ground motion. Structures were modeled considering single degree of freedom following appropriate assumptions. A tool has been developed to study the behavior for long and short time period structures using MATLAB. Elastoplastic model was assumed for the nonlinear response. Response was calculated by solving dynamic equilibrium equations using Newmark’s step by step integration scheme. The tool developed is capable of performing time history analysis for getting response and this response was used to calculate imparted energy, hysteretic energy etc. over time duration of ground motion. Hysteretic energy is responsible for any damage induced in the structure because it accumulates only when the structure goes into non- linear region

Abstract

High power lasers are attractive sources for several applications. Because of good beam quality at all power level, distributed thermal loading, etc fiber lasers are gaining popularity in Directed Energy applications. There is a continued interest in scaling laser systems up to power levels suitable enough for DE systems. Beam combining systems for high average-power lasers began in the late 1960s and early 1970s. Early systems [1, 2] propagated the beams using heavy-water-cooled copper optics and open beam trains with commercial fans to provide fresh air. They have evolved in the intervening 40- plus years to include highly sophisticated gimbaled control systems with extremely high-reflectance uncooled optics and adaptive optics to compensate for less-than-ideal laser beams and for atmospheric distortions. Due to the limitations put by thermo optic effects gain saturation and scattering noise, laser beams cannot be amplified indefinitely. An alternative approach to building high power lasers is to use arrays of relatively lower power lasers. However, this approach requires that the beams from the array elements be combined to have the propagation characteristics of a single beam. Beam combining of laser arrays with high efficiency and good beam quality for power and radiance (brightness) scaling is a long-standing problem in laser technology. Semiconductor and fiber gain elements have attractive attributes for beam-combined sys- tems because of their ease in building in array formats, their high efficiency, and the ability to get near-diffraction-limited beams from individual elements. Beam brightness at the source is of limited importance when considering realistic DE propagation scenarios in turbulent atmospheres. Incoherent combination of the high-quality beams from fiber lasers can generate directional beams that are getting serious consideration for use as laser DE systems. For spatial beam combination where the laser beams propagate through the atmosphere, the atmo- spheric turbulence, pointing errors like platform jitter and boresight error play an important role in the performance of the combination technique. Different models of atmospheric turbulence have been explored. A functional implementation of the HAP model is shown in this thesis. Several architectures of the beam director for incoherent beam combination has been proposed. In these architectures, each of the beams are focused and targeted at a fixed point in space. Equations for inclined beam is derived using transformation rotation and the beam focusing equations have been modified to model real beams with non-ideal divergence. We have analyzed the criticality of the effect of atmospheric turbulence, beam wander, residual mechanical jitter and boresight error on the intensity and spot-size of incoherently combined laser beams.

Abstract

In the past decades, there have been multiple terrorist threats in the world and there is a lack of understanding of the effect of such dynamic loading on buildings. In order to understand the effect of blast loading, study of the dynamic behavior of structures is important. Current country codes do not provide proper guidelines to build a structure to mitigate the effects of such terrorist threats. Therefore, making it essential to study the behavior of structures subjected to impulsive loading. Reinforced walls are one of the first structural elements which are exposed to the loading in case of such events. Thus they become crucial to mitigate the effects of explosions. As part of this research, out of plane behavior of a vertical reinforced wall was studied when subjected to dynamic blast loading. Single degree of freedom system and finite element method were used to carry out numerical modeling of the reinforced wall with appropriate loading and structural approximations. As a part of this study, a tool was developed to implement the finite element method for a reinforced wall in MATLAB. 3D modeling of reinforced wall is done using 20-noded or 8-noded hexahedral elements. Rayleigh damping is used to calculate Damping matrix. The dynamic equilibrium equations are solved using Gaussian quadrature and Newmark’s direct integration scheme. The tool was used to analyze the behavior of reinforced walls under varying percentage steel, damping ratio, standoff distance, reinforcement diameter, charge weight, etc.