6,194 research outputs found
Insertion Detection System Employing Neural Network MLP and Detection Trees Using Different Techniques
by addressing intruder attacks, network security experts work to maintain services available at all times. The Intrusion Detection System (IDS) is one of the available mechanisms for detecting and classifying any abnormal behavior. As a result, the IDS must always be up to date with the most recent intruder attack signatures to maintain the confidentiality, integrity, and availability of the services. This paper shows how the NSL-KDD dataset may be used to test and evaluate various Machine Learning techniques. It focuses mostly on the NLS-KDD pre-processing step to create an acceptable and balanced experimental data set to improve accuracy and minimize false positives. For this study, the approaches J48 and MLP were employed. The Decision Trees classifier has been demonstrated to have the highest accuracy rate for detecting and categorizing all NSL-KDD dataset attacks
Ordinal numbers: Not superlatives, but modifiers of superlatives
The few existing accounts of the semantics of ordinal numbers attribute to them all or almost all of the semantic properties of superlatives. This work discusses a construction problematic for existing theories of ordinals: the ordinal superlative construction (e.g. Joel climbed the third highest mountain). Existing theories give ordinals and superlatives such similar semantics that they struggle to explain how an ordinal and a superlative could join together and form a complex modifier. As an alternative, I propose a semantics according to which ordinals are exceptive modifiers of superlatives. For example, the n-th highest mountain is the mountain that, with n - 1 exceptions, is the highest. When an ordinal does not co-occur with an overt superlative (e.g. the second train), I posit a covert superlative adjective that represents the contextual ordering. Not only does this approach account for the ordinal superlative construction, but it lends itself to a principled explanation of differences between ordinals and superlatives with respect to plurality
Cyclic proof systems for modal fixpoint logics
This thesis is about cyclic and ill-founded proof systems for modal fixpoint logics, with and without explicit fixpoint quantifiers.Cyclic and ill-founded proof-theory allow proofs with infinite branches or paths, as long as they satisfy some correctness conditions ensuring the validity of the conclusion. In this dissertation we design a few cyclic and ill-founded systems: a cyclic one for the weak Grzegorczyk modal logic K4Grz, based on our explanation of the phenomenon of cyclic companionship; and ill-founded and cyclic ones for the full computation tree logic CTL* and the intuitionistic linear-time temporal logic iLTL. All systems are cut-free, and the cyclic ones for K4Grz and iLTL have fully finitary correctness conditions.Lastly, we use a cyclic system for the modal mu-calculus to obtain a proof of the uniform interpolation property for the logic which differs from the original, automata-based one
Reality Engineering and social kinds
Conceptual Engineering is a new and interesting trend in Philosophy. However, it is not free from problems. The most relevant issue is that, at least following a Cappelen-like account, we are forced to commit to the controversial metaphysical view that the world has a linguistic structure. Under such view, a modification in the semantics of a term implies a modification in nature of the thing which is referred by that word. I propose to explore the implications of the reversal of such principle, thereby committing to the idea that a modification in the nature of things implies a modification of the semantics of the terms that refer to them, and not the other way around. Following this new principle, I am interested in developing an alternative account to Conceptual Engineering, which I call (following Greenough) Reality Engineering.
In this dissertation, I will focus on the analysis of two major points about Reality Engineering, trying to define what it is about and how to perform it. I will argue that Reality Engineering has kinds as its scope and I will restrict the focus of the present enquiry to social kinds only. I will proceed by providing a taxonomy of the most popular views about the metaphysics of social kinds, since in order to modify something properly, first we have to be clear on what that something is. Out of this taxonomy, I will generate two general theories on social kinds. The first one is what we can call a Top-down view, and it says that a social kind is generated via the acceptance of constitutive rules by some group of authorities and the successful application of those rules in ordinary practice. The second one is what we can call a Bottom-up view, according to which social kinds are nothing but the reification of social external norms, where social external norms are to be intended as the set of attitudes/behaviours/treatments/practices that people who are not members of the kind have towards the members of such kind (trivially, if the kind in question, like money, does not include people as its members, then everyone is external to such kind). After presenting these two views, I will explore the possibility of engineering kinds within them, focusing on some case studies and examples. I will highlight various ways in which social kinds can be defective and propose solutions for all kinds of defectiveness.
In conclusion, I will briefly discuss how typical worries concerning Conceptual Engineering projects translate to my framework, focusing on the problems of Feasibility and Control
On Wondering: The Epistemology of A Questioning Attitude
An emerging trend in contemporary epistemology departs from the traditional preoccupation with the nature of knowledge, belief, evidence, justification, and the problems of skepticism. This trend focuses instead on the nature of inquiry itself and especially on the role of questions and questioning attitudes that arise in and define that activity. Naturally, this emerging trend calls for a philosophical exploration of the nature of questioning attitudes like curiosity and wondering, and of the various epistemological considerations pertaining to them. Consequently, this project primarily addresses two questions: what does it mean to wonder? And what is required to wonder well?
The project is thus both descriptive and normative, aiming to pin down the place that wondering has in our ontology of epistemologically significant mental states and to determine what kinds of prescriptive norms it is subject to in the course of rational inquiry
Deep Clustering for Data Cleaning and Integration
Deep Learning (DL) techniques now constitute the state-of-theart for important problems in areas such as text and image processing, and there have been impactful results that deploy DL in several data management tasks. Deep Clustering (DC) has recently emerged as a sub-discipline of DL, in which data representations are learned in tandem with clustering, with a view to automatically identifying the features of the data that lead to improved clustering results. While DC has been used to good effect in several domains, particularly in image processing, the potential of DC for data management tasks remains unexplored. In this paper, we address this gap by investigating the suitability of DC for data cleaning and integration tasks, specifically schema inference, entity resolution and domain discovery, from the perspective of tables, rows and columns, respectively. In this setting, we compare and contrast several DC and non-DC clustering algorithms using standard benchmarks. The results show, among other things, that the most effective DC algorithms consistently outperform non-DC clustering algorithms for data integration tasks. Experiments also show consistently strong performance compared with state-of-the-art bespoke algorithms for each of the data integration tasks
Fragments and frame classes:Towards a uniform proof theory for modal fixed point logics
This thesis studies the proof theory of modal fixed point logics. In particular, we construct proof systems for various fragments of the modal mu-calculus, interpreted over various classes of frames. With an emphasis on uniform constructions and general results, we aim to bring the relatively underdeveloped proof theory of modal fixed point logics closer to the well-established proof theory of basic modal logic. We employ two main approaches. First, we seek to generalise existing methods for basic modal logic to accommodate fragments of the modal mu-calculus. We use this approach for obtaining Hilbert-style proof systems. Secondly, we adapt existing proof systems for the modal mu-calculus to various classes of frames. This approach yields proof systems which are non-well-founded, or cyclic.The thesis starts with an introduction and some mathematical preliminaries. In Chapter 3 we give hypersequent calculi for modal logic with the master modality, building on work by Ori Lahav. This is followed by an Intermezzo, where we present an abstract framework for cyclic proofs, in which we give sufficient conditions for establishing the bounded proof property. In Chapter 4 we generalise existing work on Hilbert-style proof systems for PDL to the level of the continuous modal mu-calculus. Chapter 5 contains a novel cyclic proof system for the alternation-free two-way modal mu-calculus. Finally, in Chapter 6, we present a cyclic proof system for Guarded Kleene Algebra with Tests and take a first step towards using it to establish the completeness of an algebraic counterpart
Polynomial time and dependent types
We combine dependent types with linear type systems that soundly and completely capture polynomial time computation. We explore two systems for capturing polynomial time: one system that disallows construction of iterable data, and one, based on the LFPL system of Martin Hofmann, that controls construction via a payment method. Both of these are extended to full dependent types via Quantitative Type Theory, allowing for arbitrary computation in types alongside guaranteed polynomial time computation in terms. We prove the soundness of the systems using a realisability technique due to Dal Lago and Hofmann. Our long-term goal is to combine the extensional reasoning of type theory with intensional reasoning about the resources intrinsically consumed by programs. This paper is a step along this path, which we hope will lead both to practical systems for reasoning about programs’ resource usage, and to theoretical use as a form of synthetic computational complexity theory
Ellipsis, contradiction and voice mismatch
Previous research has attributed differences in the acceptability of verb phrase ellipsis (VPE) with voice mismatches to processing effects (Arregui et al. 2006, Grant et al. 2012). This paper argues that they can instead be accounted for in terms of a standard, focus-based condition on ellipsis (Rooth 1992a,b), supplemented with the principle that accommodated antecedents cannot contradict an elliptical sentence. This perspective is compatible with voice mismatched VPE being fundamentally grammatical (Merchant 2013, cf. Hardt 1993) rather than ungrammatical (e.g. Kim & Runner 2018). It also encompasses other focus-based factors modulating voice mismatches, which in turn reveal that implicit arguments do not count for contrast in VPE (cf. Overfelt to appear). The account here aligns with a reappraisal of the ‘mismatch asymmetry’ (Arregui et al. 2006) as being driven by a penalty against passive ellipsis in subject focus environments (Poppels & Kehler 2019)
Operands and instances
Can conjunctive propositions be identical without their conjuncts being identical? Can universally quantified propositions be identical without their instances being identical? On a common conception of propositions, on which they inherit the logical structure of the sentences which express them, the answer is negative both times. Here, it will be shown that such a negative answer to both questions is inconsistent, assuming a standard type-theoretic formalization of theorizing about propositions. The result is not specific to conjunction and universal quantification, but applies to any binary operator and propositional quantifier. It is also shown that the result essentially arises out of giving a negative answer to both questions, as each negative answer is consistent by itself
- …