Papers by Tajana Ban Kirigin
Dependency-based Labeling of Associative LexicalCommunities
Central European Conference on Information and Intelligent Systems, 2021
Uvodenje pojma vektora i osnovni pojmovi U ovom poglavlju bitće opisano kako se uvodi pojam vekto... more Uvodenje pojma vektora i osnovni pojmovi U ovom poglavlju bitće opisano kako se uvodi pojam vektora u osnovnoj i srednjojškoli pomoću nekoliko udžbenika za 8. razred osnovneškole i 3. razred srednješkole. Nakon toga navestćemo osnovne pojmove vezane za vektore. Napomenutćemo ako se definicije u udžbenicima razlikuju. 1.1 Osnovnaškola Na početku drugog polugodišta 8. razreda na nastavi matematike uvodi se pojam vektora. Pomoću nekoliko udžbenika opisatćemo načine uvodenja pojma vektora. Osim toga, navestćemo osnovne pojmove vezane za vektore i operacije s vektorima za prvi udžbenik, a za ostale udžbenikeće biti navedene razlike u odnosu na prvi udžbenik. Motivacijski primjerće biti naveden ako ga neki pojam ima.
Future Internet
We present a graph-based method for the lexical task of labeling senses of polysemous lexemes. Th... more We present a graph-based method for the lexical task of labeling senses of polysemous lexemes. The labeling task aims at generalizing sense features of a lexical item in a corpus using more abstract concepts. In this method, a coordination dependency-based lexical graph is first constructed with clusters of conceptually associated lexemes representing related senses and conceptual domains of a source lexeme. The label abstraction is based on the syntactic patterns of the x is_a y dependency relation. For each sense cluster, an additional lexical graph is constructed by extracting label candidates from a corpus and selecting the most prominent is_a collocates in the constructed label graph. The obtained label lexemes represent the sense abstraction of the cluster of conceptually associated lexemes. In a similar graph-based procedure, the semantic class representation is validated by constructing a WordNet hypernym relation graph. These additional labels indicate the most appropriate ...
On the Formalization and Computational Complexity of Resilience Problems for Cyber-Physical Systems
Lecture Notes in Computer Science, 2022
arXiv: Computational Complexity, May 7, 2021
This paper develops a Multiset Rewriting language with explicit time for the specification and an... more This paper develops a Multiset Rewriting language with explicit time for the specification and analysis of Time-Sensitive Distributed Systems (TSDS). Goals are often specified using explicit time constraints. A good trace is an infinite trace in which the goals are satisfied perpetually despite possible interference from the environment. In our previous work [16], we discussed two desirable properties of TSDSes, realizability (there exists a good trace) and survivability (where, in addition, all admissible traces are good). Here we consider two additional properties, recoverability (all compliant traces do not reach points-of-no-return) and reliability (the system can always continue functioning using a good trace). Following [16], we focus on a class of systems called Progressing Timed Systems (PTS), where intuitively only a finite number of actions can be carried out in a bounded time period. We prove that for this class of systems the properties of recoverability and reliability coincide and are PSPACE-complete. Moreover, if we impose a bound on time (as in bounded model-checking), we show that for PTS the reliability property is in the Π p 2 class of the polynomial hierarchy, a subclass of PSPACE. We also show that the bounded survivability is both NP-hard and coNP-hard.
Periodic Systems: Safety, Security, andComplexity
Book of Abstracts LAP 2021, 2021
Specifying and verifying timing aspects of security protocols
Implementing Sentiment Dictionary into Vader Sentiment Analyis for Croatian
Book of Abstracts LAP 2021, 2021
2019 IEEE 32nd Computer Security Foundations Symposium (CSF), 2019
Denial of Service (DoS) attacks have been a serious security concern, as no service is, in princi... more Denial of Service (DoS) attacks have been a serious security concern, as no service is, in principle, protected against them. Although a Dolev-Yao intruder with unlimited resources can trivially render any service unavailable, DoS attacks do not necessarily have to be carried out by such (extremely) powerful intruders. It is useful in practice and more challenging for formal protocol verification to determine whether a service is vulnerable even to resource-bounded intruders that cannot generate or intercept arbitrary large volumes of traffic. This paper proposes a novel, more refined intruder model where the intruder can only consume at most some specified amount of resources in any given time window. Additionally, we propose protocol theories that may contain timeouts and specify service resource usage during protocol execution. In contrast to the existing resource-conscious protocol verification models, our model allows finer and more subtle analysis of DoS problems. We illustrate the power of our approach by representing a number of classes of DoS attacks, such as, Slow, Asymmetric and Amplification DoS attacks, exhausting different types of resources of the target, such as, number of workers, processing power, memory, and network bandwidth. We show that the proposed DoS problem is undecidable in general and is PSPACE-complete for the class of resource-bounded, balanced systems. Finally, we implemented our formal verification model in the rewriting logic tool Maude and analyzed a number of DoS attacks in Maude using Rewriting Modulo SMT in an automated fashion.
On the complexity of Verifying Cyber-Phisical Security Protocols
Construction Grammar Conceptual Network: Dependency-based graph method for semantic association analysis
Natural Language Engineering, 2021
Proceedings of the 7th International Conference on Information Systems Security and Privacy
Development of automated technological systems has seen the increase in interconnectivity among i... more Development of automated technological systems has seen the increase in interconnectivity among its components. This includes Internet of Things (IoT) and Industry 4.0 (I4.0) and the underlying communication between sensors and controllers. This paper is a step toward a formal framework for specifying such systems and analyzing underlying properties including safety and security. We introduce automata systems (AS) motivated by I4.0 applications. We identify various subclasses of AS that reflect different types of requirements on I4.0. We investigate the complexity of the problem of functional correctness of these systems as well as their vulnerability to attacks. We model the presence of various levels of threats to the system by proposing a range of intruder models, based on the number of actions intruders can use.
On the Security and Complexity of Periodic Systems
SN Computer Science
Lecture Notes in Computer Science, 2021
This paper develops a Multiset Rewriting language with explicit time for the specification and an... more This paper develops a Multiset Rewriting language with explicit time for the specification and analysis of Time-Sensitive Distributed Systems (TSDS). Goals are often specified using explicit time constraints. A good trace is an infinite trace in which the goals are satisfied perpetually despite possible interference from the environment. In our previous work [16], we discussed two desirable properties of TSDSes, realizability (there exists a good trace) and survivability (where, in addition, all admissible traces are good). Here we consider two additional properties, recoverability (all compliant traces do not reach points-of-no-return) and reliability (the system can always continue functioning using a good trace). Following [16], we focus on a class of systems called Progressing Timed Systems (PTS), where intuitively only a finite number of actions can be carried out in a bounded time period. We prove that for this class of systems the properties of recoverability and reliability coincide and are PSPACE-complete. Moreover, if we impose a bound on time (as in bounded model-checking), we show that for PTS the reliability property is in the Π p 2 class of the polynomial hierarchy, a subclass of PSPACE. We also show that the bounded survivability is both NP-hard and coNP-hard.
Sentiment Potential Analysis
Book of Abstracts LAP 2021, 2021
Mathematics, 2021
This paper describes a graph method for labeling word senses and identifying lexical sentiment po... more This paper describes a graph method for labeling word senses and identifying lexical sentiment potential by integrating the corpus-based syntactic-semantic dependency graph layer, lexical semantic and sentiment dictionaries. The method, implemented as ConGraCNet application on different languages and corpora, projects a semantic function onto a particular syntactical dependency layer and constructs a seed lexeme graph with collocates of high conceptual similarity. The seed lexeme graph is clustered into subgraphs that reveal the polysemous semantic nature of a lexeme in a corpus. The construction of the WordNet hypernym graph provides a set of synset labels that generalize the senses for each lexical cluster. By integrating sentiment dictionaries, we introduce graph propagation methods for sentiment analysis. Original dictionary sentiment values are integrated into ConGraCNet lexical graph to compute sentiment values of node lexemes and lexical clusters, and identify the sentiment p...
Mathematics, 2022
Numerous centrality measures have been introduced as tools to determine the importance of nodes i... more Numerous centrality measures have been introduced as tools to determine the importance of nodes in complex networks, reflecting various network properties, including connectivity, survivability, and robustness. In this paper, we introduce Semi-Local Intregation (SLI), a node centrality measure for undirected and weighted graphs that takes into account the coherence of the locally connected subnetwork and evaluates the integration of nodes within their neighbourhood. We illustrate SLI node importance differentiation among nodes in lexical networks and demonstrate its potential in natural language processing (NLP). In the NLP task of sense identification and sense structure analysis, the SLI centrality measure evaluates node integration and provides the necessary local resolution by differentiating the importance of nodes to a greater extent than standard centrality measures. This provides the relevant topological information about different subnetworks based on relatively local infor...
6 Senior Clinical Trial Specialist
Time is often a key component used in specifying the rules and the requirements of a collaboratio... more Time is often a key component used in specifying the rules and the requirements of a collaboration. For a correct collaboration and to achieve a common goal, participants usually should follow strict deadlines and should have quick reactions to some (unex-pected) event.
Proceedings of the 2018 Workshop on Cyber-Physical Systems Security and PrivaCy, 2018
Distance-bounding (DB) protocols protect against relay attacks on proximity-based access control ... more Distance-bounding (DB) protocols protect against relay attacks on proximity-based access control systems. In a DB protocol, the verifier computes an upper bound on the distance to the prover by measuring the time-of-flight of exchanged messages. DB protocols are, however, vulnerable to distance fraud, in which a dishonest prover is able to manipulate the distance bound computed by an honest verifier. Despite their conceptual simplicity, devising a formal characterization of DB protocols and distance fraud attacks that is amenable to automated formal analysis is non-trivial, primarily because of their real-time and probabilistic nature. In this work, we introduce a generic, computational model, based on Rewriting Logic, for formally analyzing various forms of distance fraud, including recently identified timing attacks, on the Hancke-Kuhn family of DB protocols through statistical model checking. While providing an insightful formal characterization on its own, the model enables a practical formal analysis method that can help system designers bridge the gap between conceptual descriptions and low-level designs. In addition to accurately confirming known results, we use the model to define new attack strategies and quantitatively evaluate their effectiveness under realistic assumptions that would otherwise be difficult to reason about manually. CCS CONCEPTS • Security and privacy → Formal methods and theory of security; Logic and verification; Access control; • Computer systems organization → Embedded and cyber-physical systems; • Software and its engineering → Model checking;
Logic, Language, and Security, 2020
Among his numerous collaborations, over the last decade, Andre Scedrov has formed quite a stable ... more Among his numerous collaborations, over the last decade, Andre Scedrov has formed quite a stable research group. This would not have been possible without his leading scientific role, which has been equally measured by his generous personality, hospitality, and kindness. Among the obtained results and mathematical solutions, the group is particularly fond of real-time abstractions, called Circle-Configurations, which provide a way of handling both density as well as infinity of time in the model. Having in mind the broadness and variety of Andre Scedrov's interests, we hope to offer here yet another view on these constructions and formal timed models, enriched with the cognitive science perspective.
Uploads
Papers by Tajana Ban Kirigin