Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection

Permanent URI for this collectionhttps://hdl.handle.net/11147/7148

Browse

Filters

2005 - 200912010 - 20176

Settings

Author: search.filters.author.Kumova, Bora İsmailScopus Q: search.filters.scopusQuartile.N/A

Search Results

Now showing 1 - 7 of 7
  • Conference Object
    Citation - WoS: 3
    Citation - Scopus: 6
    Truth Ratios of Syllogistic Moods
    (Institute of Electrical and Electronics Engineers, 2015) Zarechnev, Mikhail; Kumova, Bora İsmail
    The syllogistic system consists of 256 moods, of which only 24 have been recognized as true. From a set-theoretical point of view, a mood can be represented with three sets and their possible relationships. Three sets can have up to seven sub-sets or spaces. In an earlier work we have used 41 permutations of the spaces, out of which every mood matches an individual number as true or false cases. The truth ratio of a mood is then calculated, by relating the true and false cases with each other. In this work we revise the previously presented properties of the moods and the syllogistic system, this time by using the maximum possible cover, which consists of 96 distinct space permutations. Our results mostly verify our previous findings, like the additional true mood anasoy, the inherently symmetric truth distribution of the moods. Additionally we have revealed some new properties, like the equivalence of some moods, which reduces the system to 136 distinct moods.
  • Conference Object
    Citation - Scopus: 2
    A Survey of Robotic Agent Architectures
    (Institute of Electrical and Electronics Engineers, 2017) Kumova, Bora İsmail; Heye, Samuel Bacha
    Robotic agents consist of various compositions of properties that are found in their mechatronics, behavioural and cognitive architectures. Common properties of each architecture type serve as criteria for assessing the degree of intelligence of most embodied agent models. Although embodied intelligence has long been accepted for robotic agents, the literature is short on combined evaluations that discuss all properties of all architecture types in one framework. Here we provide a review of existing taxonomies for each type of architecture and attempt to combine them all in a single taxonomy for robotic agents.
  • Conference Object
    Citation - WoS: 2
    Citation - Scopus: 2
    An Extended Syllogistic Logic for Automated Reasoning
    (Institute of Electrical and Electronics Engineers, 2017) Çine, Ersin; Kumova, Bora İsmail
    In this work, we generalise the categorical syllogistic logic in several dimensions to a relatively expressive logic that is sufficiently powerful to encompass a wider range of linguistic semantics. The generalisation is necessary in order to eliminate the existential ambiguity of the quantifiers and to increase expressiveness, practicality, and adaptivity of the syllogisms. The extended semantics is expressed in an extended syntax such that an algorithmic solution of the extended syllogisms can be processed. Our algorithmic approach for deduction in this logic allows for automated reasoning directly with quantified propositions, without reduction of quantifiers.
  • Book Part
    Citation - Scopus: 1
    Symmetric Properties of the Syllogistic System Inherited From the Square of Opposition
    (Birkhäuser, 2017) Kumova, Bora İsmail
    The logical square Omega has a simple symmetric structure that visualises the bivalent relationships of the classical quantifiers A, I, E, O. In philosophy it is perceived as a self-complete possibilistic logic. In linguistics however its modelling capability is insufficient, since intermediate quantifiers like few, half, most, etc cannot be distinguished, which makes the existential quantifier I too generic and the universal quantifier A too specific. Furthermore, the latter is a special case of the former, i.e. A subset of I, making the square a logic with inclusive quantifiers. The inclusive quantifiers I and O can produce redundancies in linguistic systems and are too generic to differentiate any intermediate quantifiers. The redundancy can be resolved by excluding A from I, i.e. I-2=I-A, analogously E from O, i.e. O-2=O-E. Although the philosophical possibility of A subset of I is thus lost in I-2, the symmetric structure of the exclusive square (2)Omega remains preserved. The impact of the exclusion on the traditional syllogistic system S with inclusive existential quantifiers is that most of its symmetric structures are obviously lost in the syllogistic system S-2 with exclusive existential quantifiers too. Symmetry properties of S are found in the distribution of the syllogistic cases that are matched by the moods and their intersections. A syllogistic case is a distinct combination of the seven possible spaces of the Venn diagram for three sets, of which there exist 96 possible cases. Every quantifier can be represented with a fixed set of syllogistic cases and so the moods too. Therefore, the 96 cases open a universe of validity for all moods of the syllogistic system S, as well as all fuzzy-syllogistic systems S-n, with n-1 intermediate quantifiers. As a by-product of the fuzzy syllogistic system and its properties, we suggest in return that the logical square of opposition can be generalised to a fuzzy-logical graph of opposition, for 2<n.
  • Conference Object
    Making Accident Data Compatible With Its-Based Traffic Management: Turkish Case
    (Intelligent Transport Systems, 2010) Duvarcı, Yavuz; Geçer Sargın, Feral; Kumova, Bora İsmail; Çınar, Ali Kemal; Selvi, Ömer
    One of the most important reasons of the high rate of accidents would largely lend itself to ineffective data collection and evaluation process since the necessary information cannot be obtained effectively from the traffic accidents reports (TAR). The discord and dealing with non-relevant data may appear at four levels: (1) Country and Cultural, (2) Institutional and organizational, (3) Data collection, (4) Data analysis and Evaluation. The case findings are consistent with this knowledge put forward in the literature; there is a transparency problem in coordination between the institutions as well as the inefficient TAR data, which is open to manipulation; the problem of under-reporting and inappropriate data storage prevails before the false statistical evaluation methods. The old-fashioned data management structure causes incompatibility with the novel technologies, avoiding timely interventions in reducing accidents and alleviating the fatalities. Transmission of the data to the interest agencies for evaluation and effective operation of the ITS-based systems should be considered. The problem areas were explored through diagnoses at institutional, data collection, and evaluation steps and the solutions were determined accordingly for the case city of Izmir.
  • Conference Object
    Developing Applications On-Board of Robots With Becerik
    (Trans Tech Publications, 2012) Kumova, Bora İsmail; Takan, Savaş
    Robot applications are mostly first developed on a computer and thereafter loaded onto the robot. However, in many situations, developing applications directly on the robot may be more effective. For instance, children who have not learned using a computer yet and who develop their robot applications while playing. Or for instance in the robots' operating environment, where there is no computer available. In this contribution we present the properties of the software tool becerik, for developing applications on-board a robot and for running them in multi-tasking mode concurrently. Furthermore, we introduce the programming language of the applications that has the same name becerik, which consists of only 6 commands. © (2012) Trans Tech Publications, Switzerland.
  • Conference Object
    Citation - WoS: 6
    Citation - Scopus: 11
    Dynamically Adaptive Partition-Based Data Distribution Management
    (Institute of Electrical and Electronics Engineers Inc., 2005) Kumova, Bora İsmail
    Performance and scalability of distributed simulations depends primarily on the effectiveness of the employed data distribution management (DDM) algorithm, which aims at reducing the overall computational and messaging effort on the shared data to a necessary minimum. Existing DDM approaches, which are variations and combinations of two basic techniques, namely region-based and grid-based techniques, perform purely in the presence of load differences. We introduce the partition-based technique that allows for variable-size partitioning shared data. Based on this technique, a novel DDM algorithm is introduced that is dynamically adaptive to cluster formations in the shared data as well as in the physical location of the simulation objects. Since the re-distribution is sensitive to inter-relationships between shared data and simulation objects, a balanced constellation has the additional advantage to be of minimal messaging effort. Furthermore, dynamic system scalability is facilitated, as bottlenecks are avoided.