327 results on '"Lisitsa, Alexei"'
Search Results
302. Reasoning About Actions Using Description Logics with General TBoxes
- Author
-
Liu, Hongkai, Lutz, Carsten, Miličić, Maja, Wolter, Frank, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Fisher, Michael, editor, van der Hoek, Wiebe, editor, Konev, Boris, editor, and Lisitsa, Alexei, editor
- Published
- 2006
- Full Text
- View/download PDF
303. Automatic Deductive Synthesis of Lisp Programs in the System ALISA
- Author
-
Korukhova, Yulia, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Fisher, Michael, editor, van der Hoek, Wiebe, editor, Konev, Boris, editor, and Lisitsa, Alexei, editor
- Published
- 2006
- Full Text
- View/download PDF
304. Whatever You Say
- Author
-
Hunsberger, Luke, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Fisher, Michael, editor, van der Hoek, Wiebe, editor, Konev, Boris, editor, and Lisitsa, Alexei, editor
- Published
- 2006
- Full Text
- View/download PDF
305. Introducing Attempt in a Modal Logic of Intentional Action
- Author
-
Lorini, Emiliano, Herzig, Andreas, Castelfranchi, Cristiano, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Fisher, Michael, editor, van der Hoek, Wiebe, editor, Konev, Boris, editor, and Lisitsa, Alexei, editor
- Published
- 2006
- Full Text
- View/download PDF
306. A Fault-Tolerant Default Logic
- Author
-
Lin, Zhangang, Ma, Yue, Lin, Zuoquan, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Fisher, Michael, editor, van der Hoek, Wiebe, editor, Konev, Boris, editor, and Lisitsa, Alexei, editor
- Published
- 2006
- Full Text
- View/download PDF
307. Answer Set Programming: A Declarative Approach to Solving Search Problems
- Author
-
Niemelä, Ilkka, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Fisher, Michael, editor, van der Hoek, Wiebe, editor, Konev, Boris, editor, and Lisitsa, Alexei, editor
- Published
- 2006
- Full Text
- View/download PDF
308. Decidable Fragments of Logic Programming with Value Invention
- Author
-
Calimeri, Francesco, Cozza, Susanna, Ianni, Giovambattista, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Fisher, Michael, editor, van der Hoek, Wiebe, editor, Konev, Boris, editor, and Lisitsa, Alexei, editor
- Published
- 2006
- Full Text
- View/download PDF
309. Analytic Tableau Calculi for KLM Rational Logic R
- Author
-
Giordano, Laura, Gliozzi, Valentina, Olivetti, Nicola, Pozzato, Gian Luca, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Fisher, Michael, editor, van der Hoek, Wiebe, editor, Konev, Boris, editor, and Lisitsa, Alexei, editor
- Published
- 2006
- Full Text
- View/download PDF
310. A Modularity Approach for a Fragment of
- Author
-
Herzig, Andreas, Varzinczak, Ivan, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Fisher, Michael, editor, van der Hoek, Wiebe, editor, Konev, Boris, editor, and Lisitsa, Alexei, editor
- Published
- 2006
- Full Text
- View/download PDF
311. On the Semantics of Logic Programs with Preferences
- Author
-
Greco, Sergio, Trubitsyna, Irina, Zumpano, Ester, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Fisher, Michael, editor, van der Hoek, Wiebe, editor, Konev, Boris, editor, and Lisitsa, Alexei, editor
- Published
- 2006
- Full Text
- View/download PDF
312. Model Representation over Finite and Infinite Signatures
- Author
-
Fermüller, Christian G., Pichler, Reinhard, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Fisher, Michael, editor, van der Hoek, Wiebe, editor, Konev, Boris, editor, and Lisitsa, Alexei, editor
- Published
- 2006
- Full Text
- View/download PDF
313. Deciding Extensions of the Theory of Arrays by Integrating Decision Procedures and Instantiation Strategies
- Author
-
Ghilardi, Silvio, Nicolini, Enrica, Ranise, Silvio, Zucchelli, Daniele, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Fisher, Michael, editor, van der Hoek, Wiebe, editor, Konev, Boris, editor, and Lisitsa, Alexei, editor
- Published
- 2006
- Full Text
- View/download PDF
314. Comparing Action Descriptions Based on Semantic Preferences
- Author
-
Eiter, Thomas, Erdem, Esra, Fink, Michael, Senko, Ján, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Fisher, Michael, editor, van der Hoek, Wiebe, editor, Konev, Boris, editor, and Lisitsa, Alexei, editor
- Published
- 2006
- Full Text
- View/download PDF
315. Modal Logics of Negotiation and Preference
- Author
-
Endriss, Ulle, Pacuit, Eric, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Fisher, Michael, editor, van der Hoek, Wiebe, editor, Konev, Boris, editor, and Lisitsa, Alexei, editor
- Published
- 2006
- Full Text
- View/download PDF
316. Representing Action Domains with Numeric-Valued Fluents
- Author
-
Erdem, Esra, Gabaldon, Alfredo, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Fisher, Michael, editor, van der Hoek, Wiebe, editor, Konev, Boris, editor, and Lisitsa, Alexei, editor
- Published
- 2006
- Full Text
- View/download PDF
317. From Inductive Logic Programming to Relational Data Mining
- Author
-
Džeroski, Sašo, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Fisher, Michael, editor, van der Hoek, Wiebe, editor, Konev, Boris, editor, and Lisitsa, Alexei, editor
- Published
- 2006
- Full Text
- View/download PDF
318. An inversion tool for conditional term rewriting systems - a case study of Ackermann inversion
- Author
-
Mikkelsen, Maria Bendix, Glück, Robert, Kirkeby, Maja Hanne, Lisitsa, Alexei, and Nemytykh, Andrei P.
- Subjects
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,Computer Science::Logic in Computer Science ,Computer Science::Programming Languages ,Computer Science::Symbolic Computation - Abstract
We report on an inversion tool for a class of oriented conditional constructor term rewriting systems. Four well-behaved rule inverters ranging from trivial to full, partial and semi-inverters are included. Conditional term rewriting systems are theoretically well founded and can model functional and non-functional rewrite relations. We illustrate the inversion by experiments with full and partial inversions of the Ackermann function. The case study demonstrates, among others, that polyvariant inversion and input-output set propagation can reduce the search space of the generated inverse systems.
- Published
- 2021
- Full Text
- View/download PDF
319. Transforming Coroutining Logic Programs into Equivalent CHR Programs
- Author
-
Danny De Schreye, Vincent Nys, Lisitsa, Alexei, Nemytykh, Andrei P, Proietti, Maurizio, and Nemytykh, Andrei
- Subjects
FOS: Computer and information sciences ,CHR ,compiling control ,program transformation ,Computer Science - Logic in Computer Science ,Selection (relational algebra) ,Computer science ,coroutines ,computer.software_genre ,Porting ,lcsh:QA75.5-76.95 ,Prolog ,logic programming ,Program analysis ,Control (linguistics) ,Implementation ,computer.programming_language ,D.1.6 ,D.3.2 ,D.3.3 ,Computer Science - Programming Languages ,Programming language ,lcsh:Mathematics ,Static analysis ,lcsh:QA1-939 ,Partial deduction ,Logic in Computer Science (cs.LO) ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,lcsh:Electronic computers. Computer science ,computer ,Programming Languages (cs.PL) - Abstract
We extend a technique called Compiling Control. The technique transforms coroutining logic programs into logic programs that, when executed under the standard left-to-right selection rule (and not using any delay features) have the same computational behavior as the coroutining program. In recent work, we revised Compiling Control and reformulated it as an instance of Abstract Conjunctive Partial Deduction. This work was mostly focused on the program analysis performed in Compiling Control. In the current paper, we focus on the synthesis of the transformed program. Instead of synthesizing a new logic program, we synthesize a CHR(Prolog) program which mimics the coroutining program. The synthesis to CHR yields programs containing only simplification rules, which are particularly amenable to certain static analysis techniques. The programs are also more concise and readable and can be ported to CHR implementations embedded in other languages than Prolog., In Proceedings VPT 2017, arXiv:1708.06887
- Published
- 2017
- Full Text
- View/download PDF
320. Inconsistencies in Ontologies
- Author
-
Voronkov, Andrei, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Fisher, Michael, editor, van der Hoek, Wiebe, editor, Konev, Boris, editor, and Lisitsa, Alexei, editor
- Published
- 2006
- Full Text
- View/download PDF
321. Towards Trustworthy Refactoring in Erlang
- Author
-
Dániel Horpácsi, Simon Thompson, Judit Köszegi, Hamilton, Geoff, Lisitsa, Alexei, and Nemytykh, Andrei P.
- Subjects
FOS: Computer and information sciences ,Computer science ,0102 computer and information sciences ,Software_PROGRAMMINGTECHNIQUES ,computer.software_genre ,Notation ,01 natural sciences ,Extensibility ,lcsh:QA75.5-76.95 ,QA76 ,Computer Science - Software Engineering ,Simple (abstract algebra) ,Software_SOFTWAREENGINEERING ,Code (cryptography) ,0101 mathematics ,computer.programming_language ,Computer Science - Programming Languages ,QA76.76 ,Programming language ,lcsh:Mathematics ,010102 general mathematics ,Erlang (programming language) ,lcsh:QA1-939 ,Software Engineering (cs.SE) ,Trustworthiness ,Code refactoring ,010201 computation theory & mathematics ,Verifiable secret sharing ,lcsh:Electronic computers. Computer science ,computer ,Programming Languages (cs.PL) - Abstract
Tool-assisted refactoring transformations must be trustworthy if programmers are to be confident in applying them on arbitrarily extensive and complex code in order to improve style or efficiency. We propose a simple, high-level but rigorous, notation for defining refactoring transformations in Erlang, and show that this notation provides an extensible, verifiable and executable specification language for refactoring. To demonstrate the applicability of our approach, we show how to define and verify a number of example refactorings in the system., In Proceedings VPT 2016, arXiv:1607.01835
- Published
- 2016
322. Computer-Aided Proof of Erdos Discrepancy Properties
- Author
-
Alexei Lisitsa, Boris Konev, Konev, Boris, and Lisitsa, Alexei
- Subjects
Discrete mathematics ,QA75 ,FOS: Computer and information sciences ,Linguistics and Language ,Sequence ,Computer Science - Logic in Computer Science ,I.2.3 ,Conjecture ,Discrete Mathematics (cs.DM) ,Multiplicative function ,G.2.1 ,Language and Linguistics ,Logic in Computer Science (cs.LO) ,Combinatorics ,Integer ,F.2.2 ,Artificial Intelligence ,Subsequence ,Boolean satisfiability problem ,±1-sequence ,Discrepancy theory ,Mathematics ,Computer Science - Discrete Mathematics - Abstract
In 1930s Paul Erdos conjectured that for any positive integer $C$ in any infinite $\pm 1$ sequence $(x_n)$ there exists a subsequence $x_d, x_{2d}, x_{3d},\dots, x_{kd}$, for some positive integers $k$ and $d$, such that $\mid \sum_{i=1}^k x_{i\cdot d} \mid >C$. The conjecture has been referred to as one of the major open problems in combinatorial number theory and discrepancy theory. For the particular case of $C=1$ a human proof of the conjecture exists; for $C=2$ a bespoke computer program had generated sequences of length $1124$ of discrepancy $2$, but the status of the conjecture remained open even for such a small bound. We show that by encoding the problem into Boolean satisfiability and applying the state of the art SAT solvers, one can obtain a discrepancy $2$ sequence of length $1160$ and a proof of the Erd��s discrepancy conjecture for $C=2$, claiming that no discrepancy 2 sequence of length $1161$, or more, exists. In the similar way, we obtain a precise bound of $127\,645$ on the maximal lengths of both multiplicative and completely multiplicative sequences of discrepancy $3$. We also demonstrate that unrestricted discrepancy 3 sequences can be longer than $130\,000$., Revised and extended journal version of arXiv:1402.2184, http://arxiv.org/abs/1402.2184
- Published
- 2014
323. Automation of Penetration Testing
- Author
-
Chu, Ge, Lisitsa, Alexei, and Konev, Boris
324. Enhancing the Auditability of the Agile XP Software Development Process in the Context of EU Medical Device Regulations
- Author
-
Alsaadi, Mahmood, Lisitsa, Alexei, and Atkinson, Katie
- Abstract
Nowadays, there is increasing reliance on software in the healthcare industry, such as software used for diagnostic or therapeutic purposes and software embedded in a medical device, often known as medical device software. Regulatory compliance has become increasingly visible in healthcare industries. Software development companies that develop medical devices software in Europe must comply with EU Medical Device Regulation (EU MDR) regulations in order to get the CE marking. Agile development practices are increasingly adopted by generic software development companies. For example, agile extreme programming (XP) is now considered a common model of choice for many business-critical projects. The reason behind that is that Agile XP has several benefits, such as developing high-quality software with a low cost and in a short period of time, with the capability to embrace any changing requirements during the development process. However, healthcare industries still have a low rate of agile adoption. This is due to the challenges that software developers face when using Agile XP within the stringent requirements of healthcare regulations. These challenges are the lack of fixed up-front planning, lack of documentation, traceability issues, and formality issues. Agile software companies must provide evidence of EU MDR conformity, and they need to develop their own procedures, tools, and methodologies to do so. As yet, there is no consensus on how to audit the Agile XP software companies to ensure that their software processes have been designed and implemented in conformity with EU MDR requirements. The motivation of this research is to assist the companies developing medical device software that wish to adopt Agile XP practices in their effort to meet the EU MDR certification requirements (CE marking). In addition, this research aims to help the information system auditors to extract auditing evidence that demonstrates conformity to the EU MDR requirements that must be met by Agile XP software organisations. This research will try to answer three main questions: Do Agile XP practices support the EU MDR requirements? Is it possible to adopt Agile XP practices when developing medical devices software? Is it possible to submit conformity evidence to EU MDR auditors? The main aim of this research is to enhance the auditability of the Agile XP software development process in the context of EU MDRs. This aim can be achieved by two main objectives: first, proposing an extension to the Agile XP user story to enhance the early planning activities of Agile XP according to EU MDR requirements. Second, designing an auditing model that covers the requirements of EU MDR. This auditing model should provide the EU MDR auditors with auditing evidence that the medical device software developed with an Agile XP process has fulfilled the requirements of EU MDR. The main contribution of this research study is the auditing model for EU MDR requirements that is aligned with the principles of Agile XP. The proposed auditing model would help auditors to audit the Agile XP development process of the medical device with regard to the EU MDR requirements in way of obtaining evidence in conformity to EU MDR requirements. And also, this auditing model can be considered as a guideline that would guide the Agile XP developers to follow the EU MDR requirements. The proposed auditing model has been assessed based on relevant case studies. As result, the evidence gathered shows at least partial support for the requirements in each case study. However, no case study has been demonstrated as supporting fully the auditing yardsticks of the proposed auditing model.
325. Online Network Intrusion Detection System Using Temporal Logic and Stream Data Processing
- Author
-
Abdulbasit Ahmed and Lisitsa, Alexei
- Subjects
QA75 - Abstract
These days, the world are becoming more interconnected, and the Internet has dominated the ways to communicate or to do business. Network security measures must be taken to protect the organization environment. Among these security measures are the intrusion detection systems. These systems aim to detect the actions that attempt to compromise the confidentiality, availability, and integrity of a resource by monitoring the events occurring in computer systems and/or networks. The increasing amounts of data that are transmitted at higher and higher speed networks created a challenging problem for the current intrusion detection systems. Once the traffic exceeds the operational boundaries of these systems, packets are dropped. This means that some attacks will not be detected. In this thesis, we propose developing an online network based intrusion detection system by the combined use of temporal logic and stream data processing. Temporal Logic formalisms allow us to represent attack patterns or normal behaviour. Stream data processing is a recent database technology applied to flows of data. It is designed with high performance features for data intensive applications processing. In this work we develop a system where temporal logic specifications are automatically translated into stream queries that run on the stream database server and are continuously evaluated against the traffic to detect intrusions. The experimental results show that this combination was efficient in using the resources of the running machines and was able to detect all the attacks in the test data. Additionally, the proposed solution provides a concise and unambiguous way to formally represent attack signatures and it is extensible allowing attacks to be added. Also, it is scalable as the system can benefit from using more CPUs and additional memory on the same machine, or using distributed servers.
326. CryptDB Mechanism on Graph Databases
- Author
-
Aburawi, Nahla, Lisitsa, Alexei, and Coenen, Frans
- Subjects
InformationSystems_DATABASEMANAGEMENT - Abstract
The work presented in this thesis is concerned with the database security aspects. In particular, we address the problem of querying encrypted data in graph databases. The thesis considers the most popular databases security methods from the literature: (i) multi-layered encryption and (ii) encryption adjustment. The encryption is one of the effective ways to protect sensitive data in a database from various attacks. Querying encrypted data includes two challenges. Either the data should be decrypted before the querying, leaving it vulnerable to server-side attacks, or one has to apply computationally expensive methods for querying encrypted data.
- Full Text
- View/download PDF
327. Predicting plant Rubisco kinetics from RbcL sequence data using machine learning.
- Author
-
Iqbal WA, Lisitsa A, and Kapralov MV
- Subjects
- Kinetics, Bayes Theorem, Carbon metabolism, Photosynthesis, Carbon Dioxide metabolism, Ribulose-Bisphosphate Carboxylase genetics, Ribulose-Bisphosphate Carboxylase metabolism, Plants metabolism
- Abstract
Ribulose-1,5-bisphosphate carboxylase/oxygenase (Rubisco) is responsible for the conversion of atmospheric CO2 to organic carbon during photosynthesis, and often acts as a rate limiting step in the later process. Screening the natural diversity of Rubisco kinetics is the main strategy used to find better Rubisco enzymes for crop engineering efforts. Here, we demonstrate the use of Gaussian processes (GPs), a family of Bayesian models, coupled with protein encoding schemes, for predicting Rubisco kinetics from Rubisco large subunit (RbcL) sequence data. GPs trained on published experimentally obtained Rubisco kinetic datasets were applied to over 9000 sequences encoding RbcL to predict Rubisco kinetic parameters. Notably, our predicted kinetic values were in agreement with known trends, e.g. higher carboxylation turnover rates (Kcat) for Rubisco enzymes from C4 or crassulacean acid metabolism (CAM) species, compared with those found in C3 species. This is the first study demonstrating machine learning approaches as a tool for screening and predicting Rubisco kinetics, which could be applied to other enzymes., (© The Author(s) 2022. Published by Oxford University Press on behalf of the Society for Experimental Biology.)
- Published
- 2023
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.