Subjects -> MATHEMATICS (Total: 1013 journals)
    - APPLIED MATHEMATICS (92 journals)
    - GEOMETRY AND TOPOLOGY (23 journals)
    - MATHEMATICS (714 journals)
    - MATHEMATICS (GENERAL) (45 journals)
    - NUMERICAL ANALYSIS (26 journals)
    - PROBABILITIES AND MATH STATISTICS (113 journals)

MATHEMATICS (714 journals)                  1 2 3 4 | Last

Showing 1 - 200 of 538 Journals sorted alphabetically
Abakós     Open Access   (Followers: 4)
Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg     Hybrid Journal   (Followers: 2)
Accounting Perspectives     Full-text available via subscription   (Followers: 4)
ACM Transactions on Algorithms (TALG)     Hybrid Journal   (Followers: 13)
ACM Transactions on Computational Logic (TOCL)     Hybrid Journal   (Followers: 5)
ACM Transactions on Mathematical Software (TOMS)     Hybrid Journal   (Followers: 6)
ACS Applied Materials & Interfaces     Hybrid Journal   (Followers: 44)
Acta Applicandae Mathematicae     Hybrid Journal   (Followers: 2)
Acta Mathematica Hungarica     Hybrid Journal   (Followers: 3)
Acta Mathematica Sinica, English Series     Hybrid Journal   (Followers: 5)
Acta Mathematica Vietnamica     Hybrid Journal  
Acta Mathematicae Applicatae Sinica, English Series     Hybrid Journal  
Advanced Science Letters     Full-text available via subscription   (Followers: 9)
Advances in Applied Clifford Algebras     Hybrid Journal   (Followers: 6)
Advances in Catalysis     Full-text available via subscription   (Followers: 7)
Advances in Complex Systems     Hybrid Journal   (Followers: 10)
Advances in Computational Mathematics     Hybrid Journal   (Followers: 16)
Advances in Decision Sciences     Open Access   (Followers: 4)
Advances in Difference Equations     Open Access   (Followers: 4)
Advances in Fixed Point Theory     Open Access  
Advances in Geosciences (ADGEO)     Open Access   (Followers: 21)
Advances in Linear Algebra & Matrix Theory     Open Access   (Followers: 7)
Advances in Materials Science     Open Access   (Followers: 23)
Advances in Mathematical Physics     Open Access   (Followers: 6)
Advances in Mathematics     Full-text available via subscription   (Followers: 18)
Advances in Numerical Analysis     Open Access   (Followers: 4)
Advances in Operations Research     Open Access   (Followers: 13)
Advances in Operator Theory     Hybrid Journal  
Advances in Pure Mathematics     Open Access   (Followers: 10)
Advances in Science and Research (ASR)     Open Access   (Followers: 8)
Aequationes Mathematicae     Hybrid Journal   (Followers: 2)
African Journal of Educational Studies in Mathematics and Sciences     Full-text available via subscription   (Followers: 8)
African Journal of Mathematics and Computer Science Research     Open Access   (Followers: 5)
Afrika Matematika     Hybrid Journal   (Followers: 2)
Air, Soil & Water Research     Open Access   (Followers: 7)
AKSIOMATIK : Jurnal Penelitian Pendidikan dan Pembelajaran Matematika     Open Access  
Al-Jabar : Jurnal Pendidikan Matematika     Open Access  
Al-Qadisiyah Journal for Computer Science and Mathematics     Open Access   (Followers: 3)
AL-Rafidain Journal of Computer Sciences and Mathematics     Open Access   (Followers: 4)
Algebra and Logic     Hybrid Journal   (Followers: 9)
Algebra Colloquium     Hybrid Journal   (Followers: 3)
Algebra Universalis     Hybrid Journal   (Followers: 3)
Algorithmic Operations Research     Open Access   (Followers: 7)
Algorithms     Open Access   (Followers: 15)
Algorithms Research     Open Access   (Followers: 2)
American Journal of Computational and Applied Mathematics     Open Access   (Followers: 4)
American Journal of Mathematical Analysis     Open Access   (Followers: 1)
American Journal of Mathematical and Management Sciences     Hybrid Journal  
American Journal of Mathematics     Full-text available via subscription   (Followers: 8)
American Journal of Operations Research     Open Access   (Followers: 6)
American Mathematical Monthly     Full-text available via subscription   (Followers: 3)
An International Journal of Optimization and Control: Theories & Applications     Open Access   (Followers: 13)
Analele Universitatii Ovidius Constanta - Seria Matematica     Open Access  
Analysis and Applications     Hybrid Journal   (Followers: 2)
Analysis and Mathematical Physics     Hybrid Journal   (Followers: 7)
Anargya : Jurnal Ilmiah Pendidikan Matematika     Open Access  
Annales Mathematicae Silesianae     Open Access  
Annales mathématiques du Québec     Hybrid Journal   (Followers: 3)
Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica     Open Access   (Followers: 1)
Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica     Open Access  
Annali di Matematica Pura ed Applicata     Hybrid Journal   (Followers: 1)
Annals of Combinatorics     Hybrid Journal   (Followers: 3)
Annals of Data Science     Hybrid Journal   (Followers: 17)
Annals of Functional Analysis     Hybrid Journal   (Followers: 2)
Annals of Mathematics     Full-text available via subscription   (Followers: 5)
Annals of Mathematics and Artificial Intelligence     Hybrid Journal   (Followers: 13)
Annals of PDE     Hybrid Journal  
Annals of Pure and Applied Logic     Open Access   (Followers: 5)
Annals of the Alexandru Ioan Cuza University - Mathematics     Open Access   (Followers: 1)
Annals of the Institute of Statistical Mathematics     Hybrid Journal   (Followers: 1)
Annals of West University of Timisoara - Mathematics     Open Access   (Followers: 1)
Annals of West University of Timisoara - Mathematics and Computer Science     Open Access   (Followers: 2)
Annuaire du Collège de France     Open Access   (Followers: 6)
ANZIAM Journal     Open Access   (Followers: 1)
Applicable Algebra in Engineering, Communication and Computing     Hybrid Journal   (Followers: 3)
Applications of Mathematics     Hybrid Journal   (Followers: 3)
Applied Categorical Structures     Hybrid Journal   (Followers: 5)
Applied Computational Intelligence and Soft Computing     Open Access   (Followers: 17)
Applied Mathematics     Open Access   (Followers: 6)
Applied Mathematics     Open Access   (Followers: 6)
Applied Mathematics & Optimization     Hybrid Journal   (Followers: 7)
Applied Mathematics - A Journal of Chinese Universities     Hybrid Journal   (Followers: 1)
Applied Mathematics and Nonlinear Sciences     Open Access   (Followers: 1)
Applied Mathematics Letters     Full-text available via subscription   (Followers: 4)
Applied Mathematics Research eXpress     Hybrid Journal   (Followers: 1)
Applied Network Science     Open Access   (Followers: 3)
Applied Numerical Mathematics     Hybrid Journal   (Followers: 4)
Applied Spatial Analysis and Policy     Hybrid Journal   (Followers: 5)
Arab Journal of Mathematical Sciences     Open Access   (Followers: 3)
Arabian Journal of Mathematics     Open Access   (Followers: 1)
Archive for Mathematical Logic     Hybrid Journal   (Followers: 3)
Archive of Applied Mechanics     Hybrid Journal   (Followers: 4)
Archive of Numerical Software     Open Access  
Archives of Computational Methods in Engineering     Hybrid Journal   (Followers: 5)
Armenian Journal of Mathematics     Open Access  
Arnold Mathematical Journal     Hybrid Journal   (Followers: 1)
Artificial Satellites     Open Access   (Followers: 22)
Asia-Pacific Journal of Operational Research     Hybrid Journal   (Followers: 3)
Asian Journal of Algebra     Open Access   (Followers: 1)
Asian Research Journal of Mathematics     Open Access  
Asian-European Journal of Mathematics     Hybrid Journal   (Followers: 2)
Australian Mathematics Teacher, The     Full-text available via subscription   (Followers: 7)
Australian Primary Mathematics Classroom     Full-text available via subscription   (Followers: 5)
Australian Senior Mathematics Journal     Full-text available via subscription   (Followers: 1)
Automatic Documentation and Mathematical Linguistics     Hybrid Journal   (Followers: 5)
Axioms     Open Access   (Followers: 1)
Baltic International Yearbook of Cognition, Logic and Communication     Open Access   (Followers: 2)
Banach Journal of Mathematical Analysis     Hybrid Journal  
Basin Research     Hybrid Journal   (Followers: 6)
BIBECHANA     Open Access  
Biomath     Open Access  
BIT Numerical Mathematics     Hybrid Journal  
Boletim Cearense de Educação e História da Matemática     Open Access  
Boletim de Educação Matemática     Open Access  
Boletín de la Sociedad Matemática Mexicana     Hybrid Journal  
Bollettino dell'Unione Matematica Italiana     Full-text available via subscription  
British Journal for the History of Mathematics     Hybrid Journal   (Followers: 2)
British Journal of Mathematical and Statistical Psychology     Full-text available via subscription   (Followers: 18)
British Journal of Mathematics & Computer Science     Full-text available via subscription   (Followers: 1)
Buletinul Academiei de Stiinte a Republicii Moldova. Matematica     Open Access   (Followers: 3)
Bulletin des Sciences Mathamatiques     Full-text available via subscription   (Followers: 3)
Bulletin of Dnipropetrovsk University. Series : Communications in Mathematical Modeling and Differential Equations Theory     Open Access   (Followers: 3)
Bulletin of Mathematical Sciences     Open Access   (Followers: 1)
Bulletin of Symbolic Logic     Full-text available via subscription   (Followers: 4)
Bulletin of Taras Shevchenko National University of Kyiv. Series: Physics and Mathematics     Open Access  
Bulletin of the Australian Mathematical Society     Full-text available via subscription   (Followers: 2)
Bulletin of the Brazilian Mathematical Society, New Series     Hybrid Journal  
Bulletin of the Iranian Mathematical Society     Hybrid Journal  
Bulletin of the London Mathematical Society     Hybrid Journal   (Followers: 3)
Bulletin of the Malaysian Mathematical Sciences Society     Hybrid Journal  
Cadernos do IME : Série Matemática     Open Access  
Calculus of Variations and Partial Differential Equations     Hybrid Journal   (Followers: 1)
Canadian Journal of Mathematics / Journal canadien de mathématiques     Hybrid Journal  
Canadian Journal of Science, Mathematics and Technology Education     Hybrid Journal   (Followers: 20)
Canadian Mathematical Bulletin     Hybrid Journal  
Carpathian Mathematical Publications     Open Access  
Catalysis in Industry     Hybrid Journal  
CAUCHY     Open Access   (Followers: 1)
CEAS Space Journal     Hybrid Journal   (Followers: 5)
CHANCE     Hybrid Journal   (Followers: 5)
Chaos, Solitons & Fractals     Hybrid Journal   (Followers: 1)
Chaos, Solitons & Fractals : X     Open Access   (Followers: 1)
ChemSusChem     Hybrid Journal   (Followers: 8)
Chinese Annals of Mathematics, Series B     Hybrid Journal  
Chinese Journal of Catalysis     Full-text available via subscription   (Followers: 2)
Chinese Journal of Mathematics     Open Access  
Ciencia     Open Access  
CODEE Journal     Open Access  
Cogent Mathematics     Open Access   (Followers: 2)
Cognitive Computation     Hybrid Journal   (Followers: 3)
Collectanea Mathematica     Hybrid Journal  
College Mathematics Journal     Hybrid Journal   (Followers: 3)
COMBINATORICA     Hybrid Journal  
Combinatorics, Probability and Computing     Hybrid Journal   (Followers: 5)
Combustion Theory and Modelling     Hybrid Journal   (Followers: 22)
Commentarii Mathematici Helvetici     Hybrid Journal   (Followers: 1)
Communications in Combinatorics and Optimization     Open Access  
Communications in Contemporary Mathematics     Hybrid Journal  
Communications in Mathematical Physics     Hybrid Journal   (Followers: 3)
Communications On Pure & Applied Mathematics     Hybrid Journal   (Followers: 6)
Complex Analysis and its Synergies     Open Access   (Followers: 1)
Complex Variables and Elliptic Equations: An International Journal     Hybrid Journal  
Compositio Mathematica     Full-text available via subscription   (Followers: 2)
Comptes Rendus : Mathematique     Open Access  
Computational and Applied Mathematics     Hybrid Journal   (Followers: 3)
Computational and Mathematical Methods     Hybrid Journal  
Computational and Mathematical Methods in Medicine     Open Access   (Followers: 2)
Computational and Mathematical Organization Theory     Hybrid Journal   (Followers: 2)
Computational Complexity     Hybrid Journal   (Followers: 5)
Computational Mathematics and Modeling     Hybrid Journal   (Followers: 8)
Computational Mechanics     Hybrid Journal   (Followers: 12)
Computational Methods and Function Theory     Hybrid Journal  
Computational Optimization and Applications     Hybrid Journal   (Followers: 9)
Computers & Mathematics with Applications     Full-text available via subscription   (Followers: 12)
Confluentes Mathematici     Hybrid Journal  
Constructive Mathematical Analysis     Open Access  
Contributions to Discrete Mathematics     Open Access  
Contributions to Game Theory and Management     Open Access  
COSMOS     Hybrid Journal   (Followers: 1)
Cross Section     Full-text available via subscription   (Followers: 1)
Cryptography and Communications     Hybrid Journal   (Followers: 11)
Cuadernos de Investigación y Formación en Educación Matemática     Open Access  
Cubo. A Mathematical Journal     Open Access  
Current Research in Biostatistics     Open Access   (Followers: 8)
Czechoslovak Mathematical Journal     Hybrid Journal  
Daya Matematis : Jurnal Inovasi Pendidikan Matematika     Open Access  
Demographic Research     Open Access   (Followers: 14)
Design Journal : An International Journal for All Aspects of Design     Hybrid Journal   (Followers: 35)
Desimal : Jurnal Matematika     Open Access  
Dhaka University Journal of Science     Open Access  
Differential Equations and Dynamical Systems     Hybrid Journal   (Followers: 3)
Differentsial'nye Uravneniya     Open Access  
Digital Experiences in Mathematics Education     Hybrid Journal   (Followers: 3)
Discrete Mathematics     Hybrid Journal   (Followers: 7)
Discrete Mathematics & Theoretical Computer Science     Open Access   (Followers: 1)
Discrete Mathematics, Algorithms and Applications     Hybrid Journal   (Followers: 2)
Discussiones Mathematicae - General Algebra and Applications     Open Access  
Discussiones Mathematicae Graph Theory     Open Access   (Followers: 1)
Diskretnaya Matematika     Full-text available via subscription  
Doklady Akademii Nauk     Open Access  

        1 2 3 4 | Last

Similar Journals
Journal Cover
Annals of Mathematics and Artificial Intelligence
Journal Prestige (SJR): 0.413
Citation Impact (citeScore): 1
Number of Followers: 13  
 
  Hybrid Journal Hybrid journal (It can contain Open Access articles)
ISSN (Print) 1573-7470 - ISSN (Online) 1012-2443
Published by Springer-Verlag Homepage  [2467 journals]
  • Knowledge forgetting in propositional μ-calculus

    • Free pre-print version: Loading...

      Abstract: Abstract The μ-calculus is one of the most important logics describing specifications of transition systems. It has been extensively explored for formal verification in model checking due to its exceptional balance between expressiveness and algorithmic properties. From the perspective of systems/knowledge evolving, one may want to discard some atoms (elements) that become irrelevant or unnecessary in a specification; one may also need to know what makes something true, or the minimal condition under which something holds. This paper aims to address these scenarios for μ-calculus in terms of knowledge forgetting. In particular, it proposes a notion of forgetting based on a generalized bisimulation and explores the semantic and logical properties of forgetting, including some reasoning complexity results. It also shows that forgetting can be employed to perform knowledge update.
      PubDate: 2023-02-01
       
  • Time and space complexity of deterministic and nondeterministic decision
           trees

    • Free pre-print version: Loading...

      Abstract: Abstract In this paper, we study arbitrary infinite binary information systems each of which consists of an infinite set called universe and an infinite set of two-valued functions (attributes) defined on the universe. We consider the notion of a problem over information system, which is described by a finite number of attributes and a mapping associating a decision to each tuple of attribute values. As algorithms for problem solving, we use deterministic and nondeterministic decision trees. As time and space complexity, we study the depth and the number of nodes in the decision trees. In the worst case, with the growth of the number of attributes in the problem description, (i) the minimum depth of deterministic decision trees grows either almost as logarithm or linearly, (ii) the minimum depth of nondeterministic decision trees either is bounded from above by a constant or grows linearly, (iii) the minimum number of nodes in deterministic decision trees has either polynomial or exponential growth, and (iv) the minimum number of nodes in nondeterministic decision trees has either polynomial or exponential growth. Based on these results, we divide the set of all infinite binary information systems into five complexity classes, and study for each class issues related to time-space trade-off for decision trees.
      PubDate: 2023-02-01
       
  • Chance constrained conic-segmentation support vector machine with
           uncertain data

    • Free pre-print version: Loading...

      Abstract: Abstract Support vector machines (SVM) is one of the well known supervised machine learning model. The standard SVM models are dealing with the situation where the exact values of the data points are known. This paper studies the SVM model when the data set contains uncertain or mislabelled data points. To ensure the small probability of misclassification for the uncertain data, a chance constrained conic-segmentation SVM model is proposed for multiclass classification. Based on the data set, a mixed integer programming formulation for the chance constrained conic-segmentation SVM is derived. Kernelization of chance constrained conic-segmentation SVM model is also exploited for nonlinear classification. The geometric interpretation is presented to show how the chance constrained conic-segmentation SVM works on uncertain data. Finally, experimental results are presented to demonstrate the effectiveness of the chance constrained conic-segmentation SVM for both artificial and real-world data.
      PubDate: 2023-01-16
       
  • Sensitivity analysis of combinatorial optimization problems using
           evolutionary bilevel optimization and data mining

    • Free pre-print version: Loading...

      Abstract: Abstract Sensitivity analysis in general deals with the question of how changes in input data of a model affect its output data. In the context of optimization problems, such an analysis could, for instance, address how changes in capacity constraints affect the optimal solution value. Although well established in the domain of linear programming, sensitivity analysis approaches for combinatorial optimization problems are model-specific, limited in scope and not applicable to practical optimization problems. To overcome these limitations, Schulte et al. developed the concept of bilevel innovization. By using evolutionary bilevel optimization in combination with data mining and visualization techniques, bilevel innovization provides decision-makers with deeper insights into the behavior of the optimization model and supports decision-making related to model building and configuration. Originally introduced in the field of evolutionary computation, most recently bilevel innovization has been proposed as an approach to sensitivity analysis for combinatorial problems in general. Based on previous work on bilevel innovization, our paper illustrates this concept as a tool for sensitivity analysis by providing a comprehensive analysis of the generalized assignment problem. Furthermore, it is investigated how different algorithms for solving the combinatorial problem affect the insights gained by the sensitivity analysis, thus evaluating the robustness and reliability of the sensitivity analysis results.
      PubDate: 2023-01-14
       
  • Cost-aware sequential diagnostics

    • Free pre-print version: Loading...

      Abstract: Abstract A simple search problem is studied in which a binary n-tuple is to be found in a list, by sequential bit comparisons with cost. The problem can be solved (for small n) using dynamic programming. We show how the “bottom up” part of the algorithm can be organized by means of Formal Concept Analysis.
      PubDate: 2022-12-17
       
  • Optimization strategies for the bilevel network design problem with affine
           cost functions

    • Free pre-print version: Loading...

      Abstract: Abstract Today artificial intelligence systems support efficient management in different fields of social activities. In particular, congestion control in modern networks seems to be impossible without proper mathematical models of traffic flow assignment. Thus, the network design problem can be referred to as Stackelberg game with independent lower-level drivers acting in a non-cooperative manner to minimize individual costs. In turn, upper-level decision-maker seeks to minimize overall travel time in the network by investing in its capacity. Hence, the decision-maker faces the challenge with a hierarchical structure which solution important due to its influence on the sustainable development of modern large cities. However, it is well-known that a bilevel programming problem is often strongly NP-hard, while the hierarchical optimization structure of a bilevel problem raises such difficulties as non-convexity and discontinuity. The present paper is devoted to the network design problem with affine cost functions. First of all, we obtain exact optimality conditions to the network design problem in a case of a single-commodity network with non-interfering routes. Secondly, we show that obtained conditions can be exploited as optimization strategies for solving the network design problem in the case of an arbitrary network with affine cost functions. These findings give fresh managerial insights to traffic engineers dealing with network design.
      PubDate: 2022-12-13
       
  • Correction to: Parametrized topological complexity of collision‑free
           motion planning in the plane

    • Free pre-print version: Loading...

      PubDate: 2022-12-01
       
  • Computing triadic generators and association rules from triadic contexts

    • Free pre-print version: Loading...

      Abstract: Abstract In this paper, we present a set of algorithms to display a Hasse diagram of triadic concepts in Triadic Concept Analysis and compute triadic generators and association rules, including implications without any need for a preprocessing step to convert the triadic representation into a dyadic one. Our contributions are as follows. First, we adapt the iPred algorithm for precedence link computation in concept lattices to the triadic framework. Then, new algorithms are proposed to compute triadic generators by extending the notion of faces to further calculate association rules. Finally, an empirical study is conducted in order to mainly show the performance of our prototype on triadic contexts and estimate the cost of each one of its components.
      PubDate: 2022-12-01
       
  • On pruning techniques in map-reduce style CbO algorithms

    • Free pre-print version: Loading...

      Abstract: Abstract A fundamental task in formal concept analysis is the enumeration of formal concepts. Among the fastest algorithms for this task belong algorithms which are based on Close-by-One (CbO), a tree recursive algorithm using lexicographical order of formal concepts to ensure that each formal concept is enumerated exactly once. State-of-the-art algorithms based on CbO, e.g. FCbO, In-Close4, and In-Close5, employ several techniques, which we call pruning, to avoid some unnecessary computations. However, the number of the formal concepts can be exponential w.r.t. dimension of the input data. Therefore, the algorithms do not scale well and large datasets become intractable. To resolve this weakness, several parallel and distributed algorithms were proposed. We propose four new CbO-based algorithms intended for Apache Spark or a similar programming model and show how the pruning can be incorporated into them. We experimentally evaluate the impact of the pruning and demonstrate the scalability of the new algorithms.
      PubDate: 2022-12-01
       
  • Indepth combinatorial analysis of admissible sets for abstract
           argumentation

    • Free pre-print version: Loading...

      Abstract: In this paper we investigate, from a graph theoretical point of view, the notion of acceptability in Dung semantics for abstract argumentation frameworks. We advance the state of the art by introducing and analyzing combinatorial structures exploited for taming, in particular cases, the exponential blowout of acceptance algorithms. We conclude the paper by a series of observations allowing to deepen the intuition with respect to the practical use of Dung acceptance based semantics.
      PubDate: 2022-12-01
       
  • A semiotic perspective on polysemy

    • Free pre-print version: Loading...

      Abstract: Abstract This paper extends Semiotic-Conceptual Analysis (SCA) to provide a means for comparing and evaluating semiotic relations (i.e. sets of signs) with respect to their ability of and efficiency of expressing conceptual structures. One contributing factor for efficiency is polysemy which refers to reusing representamens of signs in different contexts. Two different types of polysemy are identified: ambiguous polysemy which encodes a view from part signs to compound signs and simultaneous polysemy for analysing how compound signs simultaneously denote more than one meaning. Two detailed examples are included.
      PubDate: 2022-12-01
       
  • On Shapley value interpretability in concept-based learning with formal
           concept analysis

    • Free pre-print version: Loading...

      Abstract: Abstract We propose the usage of two power indices from cooperative game theory and public choice theory for ranking attributes of closed sets, namely intents of formal concepts (or closed itemsets). The introduced indices are related to extensional concept stability and are also based on counting of generators, especially of those that contain a selected attribute. The introduction of such indices is motivated by the so-called interpretable machine learning, which supposes that we do not only have the class membership decision of a trained model for a particular object, but also a set of attributes (in the form of JSM-hypotheses or other patterns) along with individual importance of their single attributes (or more complex constituent elements). We characterise computation of the Shapley and Banzhaf-Penrose values of a formal concept in terms of minimal generators and their order filters, provide the reader with their properties important for computation purposes, prove related #P-completeness results, and show experimental results with model and real datasets. We also show how this approach can be applied in both supervised (classification) and unsupervised (pattern mining) settings.
      PubDate: 2022-11-22
       
  • Special issue on conceptual structures

    • Free pre-print version: Loading...

      PubDate: 2022-11-18
       
  • Neural networks in Fréchet spaces

    • Free pre-print version: Loading...

      Abstract: Abstract We propose a neural network architecture in infinite dimensional spaces for which we can show the universal approximation property. Indeed, we derive approximation results for continuous functions from a Fréchet space \(\mathfrak {X}\) into a Banach space \(\mathfrak {Y}\) . The approximation results are generalising the well known universal approximation theorem for continuous functions from \(\mathbb {R}^{n}\) to \(\mathbb {R}\) , where approximation is done with (multilayer) neural networks Cybenko (1989) Math. Cont. Signals Syst. 2, 303–314 and Hornik et al. (1989) Neural Netw., 2, 359–366 and Funahashi (1989) Neural Netw., 2, 183–192 and Leshno (1993) Neural Netw., 6, 861–867. Our infinite dimensional networks are constructed using activation functions being nonlinear operators and affine transforms. Several examples are given of such activation functions. We show furthermore that our neural networks on infinite dimensional spaces can be projected down to finite dimensional subspaces with any desirable accuracy, thus obtaining approximating networks that are easy to implement and allow for fast computation and fitting. The resulting neural network architecture is therefore applicable for prediction tasks based on functional data.
      PubDate: 2022-11-16
       
  • Raising awareness without disclosing truth

    • Free pre-print version: Loading...

      Abstract: Abstract Agents use their own vocabularies to reason and talk about the world. Public signature awareness is satisfied if agents are aware of the vocabularies, or signatures, used by all agents they may, eventually, interact with. Multi-agent modal logics and in particular Dynamic Epistemic Logic rely on public signature awareness for modeling information flow in multi-agent systems. However, this assumption is not desirable for dynamic and open multi-agent systems because (1) it prevents agents to use unique signatures other agents are unaware of, (2) it prevents agents to openly extend their signatures when encountering new information, and (3) it requires that all future knowledge and beliefs of agents are bounded by the current state. We propose a new semantics for awareness that enables us to drop public signature awareness. This semantics is based on partial valuation functions and weakly reflexive relations. Dynamics for raising public and private awareness are then defined in such a way as to differentiate between becoming aware of a proposition and learning its truth value. With this, we show that knowledge and beliefs are not affected through the raising operations.
      PubDate: 2022-10-27
      DOI: 10.1007/s10472-022-09809-y
       
  • Lexicographically maximal edges of dual hypergraphs and Nash-solvability
           of tight game forms

    • Free pre-print version: Loading...

      Abstract: Abstract We prove a new property of dual hypergraphs and derive from it Nash-solvability of the corresponding (tight) game forms. This result is known since 1975, but its new proof is much simpler.
      PubDate: 2022-10-19
      DOI: 10.1007/s10472-022-09820-3
       
  • Real-time passenger bus routing problems with preferences and tradeoffs

    • Free pre-print version: Loading...

      Abstract: Abstract One category of vehicle routing problems involving groups of people where there can be multiple possible drop-off locations is the School Bus Routing Problem (SBRP). In this paper, we investigate a form of SBRP where each passenger has a well-ordered set of preferred stops, e.g., the preferences can be based on the distance to their destination. The passengers continue their journey from the stop to their destination by an alternative mode, such as walking. Different drop-off choices allow for a different set of passengers to be dropped off together, affecting the total vehicle driving distance. As the transport provider and passengers have their own objectives, inevitably, there are two opposing goals (tradeoff aspects), reducing total driving distance versus passenger walking distance. Unlike typical SBRP, we focus on practical problems where the set of passengers is not known well in advance and there is only a short time window to compute a solution (a real-time requirement). Hence, runtime efficiency is more important than optimality. We introduce this variant as SBRP-RT, a school bus routing problem with tradeoff aspects and real-time requirements. We propose a model with an efficient greedy local search for such problems, and demonstrate the efficacy with experiments on real-world datasets with quick solving that balances tradeoffs.
      PubDate: 2022-10-12
      DOI: 10.1007/s10472-022-09812-3
       
  • The logic of secrets and the interpolation rule

    • Free pre-print version: Loading...

      Abstract: Abstract In this article we formalise the notion of knowing a secret as a modality, by combining standard notions of knowledge and ignorance from modal epistemic logic. Roughly speaking, Ann knows a secreet if and only if she knows it and she knows that everyone else does not know it. The main aim is to study the properties of these secretly knowing modalities. It turns out that the modalities are non-normal, and are characterised by a derivation rule we call Interpolation that is stronger than Equivalence but weaker than Monotonicity. We study the Interpolation rule and position it in the landscape of non-normal modal logics. We show that it, in combination with basic axioms, gives us a complete characterisation of the properties of the secretly knowing modalities under weak assumptions about the properties of individual knowledge, in the form of a sound and complete axiomatisation. This characterisation gives us the most basic and fundamental principles of secretly knowing.
      PubDate: 2022-10-10
      DOI: 10.1007/s10472-022-09815-0
       
  • Adversarial attacks on graph-level embedding methods: a case study

    • Free pre-print version: Loading...

      Abstract: Abstract As the number of graph-level embedding techniques increases at an unprecedented speed, questions arise about their behavior and performance when training data undergo perturbations. This is the case when an external entity maliciously alters training data to invalidate the embedding. This paper explores the effects of such attacks on some graph datasets by applying different graph-level embedding techniques. The main attack strategy involves manipulating training data to produce an altered model. In this context, our goal is to go in-depth about methods, resources, experimental settings, and performance results to observe and study all the aspects that derive from the attack stage.
      PubDate: 2022-10-06
      DOI: 10.1007/s10472-022-09811-4
       
  • Learning with cone-based geometric models and orthologics

    • Free pre-print version: Loading...

      Abstract: Abstract Recent approaches for knowledge-graph embeddings aim at connecting quantitative data structures used in machine learning to the qualitative structures of logics. Such embeddings are of a hybrid nature, they are data models that also exhibit conceptual structures inherent to logics. One motivation to investigate embeddings is to design conceptually adequate machine learning (ML) algorithms that learn or incorporate ontologies expressed in some logic. This paper investigates a new approach to embedding ontologies into geometric models that interpret concepts by geometrical structures based on convex cones. The ontologies are assumed to be represented in an orthologic, a logic with a full (ortho)negation. As a proof of concept this cone-based embedding was implemented within two ML algorithms for weak supervised multi-label learning. Both algorithms rely on cones but the first addresses ontologies expressed in classical propositional logic whereas the second addresses a weaker propositional logic, namely a weak orthologic that does not fulfil distributivity. The algorithms were evaluated and showed promising results that call for investigating other (sub)classes of cones and developing fine-tuned algorithms based on them.
      PubDate: 2022-10-01
      DOI: 10.1007/s10472-022-09806-1
       
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
 


Your IP address: 35.173.35.14
 
Home (Search)
API
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-