Addressing the stochastic nature of scientific computations via dynamic loop scheduling.
Adhesive and quasiadhesive categories
We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved, as well as quasiadhesive categories which restrict attention to regular monomorphisms. Many examples of graphical structures used in computer science are shown to be examples of adhesive and quasiadhesive categories. Double-pushout graph rewriting generalizes well to rewriting on arbitrary adhesive and quasiadhesive categories.
Adhesive and quasiadhesive categories
We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved, as well as quasiadhesive categories which restrict attention to regular monomorphisms. Many examples of graphical structures used in computer science are shown to be examples of adhesive and quasiadhesive categories. Double-pushout graph rewriting generalizes well to rewriting on arbitrary adhesive and quasiadhesive categories.
Adjunction models for call-by-push-value with stacks.
Advanced approach for the public transportation regulation system based on cybercars
In the last decade, the authorities require the use of safe, comfortable vehicles to assure a door to door aspect with respect of environment in the urban context. In this paper, we propose an advanced approach of transport regulation where we integrate cybercars into a regulation process as an alternative in disruption cases. For that, we propose an ITS architecture including public transportation and cybercars into the same framework. We will show that collaboration between these two systems...
Advanced inference in fuzzy systems by rule base compression.
Advice Complexity and Barely Random Algorithms
Recently, a new measurement – the advice complexity – was introduced for measuring the information content of online problems. The aim is to measure the bitwise information that online algorithms lack, causing them to perform worse than offline algorithms. Among a large number of problems, a well-known scheduling problem, job shop scheduling with unit length tasks, and the paging problem were analyzed within this model. We observe some connections between advice complexity and randomization. Our...
Advice Complexity and Barely Random Algorithms
Recently, a new measurement – the advice complexity – was introduced for measuring the information content of online problems. The aim is to measure the bitwise information that online algorithms lack, causing them to perform worse than offline algorithms. Among a large number of problems, a well-known scheduling problem, job shop scheduling with unit length tasks, and the paging problem were analyzed within this model. We observe some connections between advice complexity and randomization....
Aerodynamic deceleration at velocities near the escape velocity
This article presents basic procedures for calculating the trajectory of a spaceship that uses only the Earth’s atmosphere to reduce its speed, allowing it to land on the Earth’s surface successfully. The first flight of the ARTEMIS program, which took place from November 16 to December 11 2022, was used as a template for the calculations. All calculations are performed in the symbolic algebra program Maple. To simplify the calculations, forces that have a less significant impact on the shape of...
Affine Parikh automata∗
The Parikh finite word automaton (PA) was introduced and studied in 2003 by Klaedtke and Rueß. Natural variants of the PA arise from viewing a PA equivalently as an automaton that keeps a count of its transitions and semilinearly constrains their numbers. Here we adopt this view and define the affine PA, that extends the PA by having each transition induce an affine transformation on the PA registers, and the PA on letters, that restricts the PA...
Affine Parikh automata
The Parikh finite word automaton (PA) was introduced and studied in 2003 by Klaedtke and Rueß. Natural variants of the PA arise from viewing a PA equivalently as an automaton that keeps a count of its transitions and semilinearly constrains their numbers. Here we adopt this view and define the affine PA, that extends the PA by having each transition induce an affine transformation on the PA registers, and the PA on letters, that restricts the PA by forcing any two transitions on the same letter...
Affine Parikh automata∗
The Parikh finite word automaton (PA) was introduced and studied in 2003 by Klaedtke and Rueß. Natural variants of the PA arise from viewing a PA equivalently as an automaton that keeps a count of its transitions and semilinearly constrains their numbers. Here we adopt this view and define the affine PA, that extends the PA by having each transition induce an affine transformation on the PA registers, and the PA on letters, that restricts the PA...
Affinely self-generating sets and morphisms.
Against all Odds: The amazing but most true story of Aviezri Fraenkel and his special favorite: The responsa project or the multi-faceted contributions of Aviezri Fraenkel to information retrieval and the related areas.
Agent-oriented abstraction.
We define an agent-oriented abstraction formalism devoted to generalized theories of abstraction that have been proposed in Artificial Intelligence. The model we propose extends the abstraction capabilities of the existing Agent-Oriented Programming paradigm. This short note reviews first the existing attempts to define abstraction in AI and in agent systems. Then, our model is introduced in terms of six definitions covering the concepts of agents, annotated knowledge, utility and society of agents....
Aggregation, Non-Contradiction and Excluded-Middle.
This paper investigates the satisfaction of the Non-Contradiction (NC) and Excluded-Middle (EM) laws within the domain of aggregation operators. It provides characterizations both for those aggregation operators that satisfy NC/EM with respect to (w.r.t.) some given strong negation, as well as for those satisfying them w.r.t. any strong negation. The results obtained are applied to some of the most important known classes of aggregation operators.
Aggregation Operators and Lipschitzian Conditions.
Aggregations preserving classes of fuzzy relations
We consider aggregations of fuzzy relations using means in [0,1] (especially: minimum, maximum and quasilinear mean). After recalling fundamental properties of fuzzy relations we examine means, which preserve reflexivity, symmetry, connectedness and transitivity of fuzzy relations. Conversely, some properties of aggregated relations can be inferred from properties of aggregation results. Results of the paper are completed by suitable examples and counter- examples, which is summarized in a special...
AI clustering techniques: a new approach in horizontal fragmentation of classes with complex attributes and methods in object oriented databases.
ALBERT---Software for scientific computations and applications.