Three semantical interpretations of a statistical theoremhood testing procedure
Three tabu search methods for the MI-FAP applied to 802.11 networks
Wireless LAN using IEEE 802.11 networks are now widely deployed at home by residential users or in hot spots by telecommunication operators. A hot spot is a place where a set of access points (APs) are located nearby each other and can serve many users. Since perturbations can degrade the quality of the signal, a careful channel assignment to each AP has to be done. Channel assignment of APs at hot spots, and more generally setup configuration and management, is still often done manually. In this...
Three tabu search methods for the MI-FAP applied to 802.11 networks
Wireless LAN using IEEE 802.11 networks are now widely deployed at home by residential users or in hot spots by telecommunication operators. A hot spot is a place where a set of access points (APs) are located nearby each other and can serve many users. Since perturbations can degrade the quality of the signal, a careful channel assignment to each AP has to be done. Channel assignment of APs at hot spots, and more generally setup configuration and management, is still often done manually. In this...
Time–dependent Simple Temporal Networks: Properties and Algorithms
Simple Temporal Networks (STN) allow conjunctions of minimum and maximum distance constraints between pairs of temporal positions to be represented. This paper introduces an extension of STN called Time–dependent STN (TSTN), which covers temporal constraints for which the minimum and maximum distances required between two temporal positions x and y are not necessarily constant but may depend on the assignments of x and y. Such constraints are useful to model problems in which the duration of an...
Time-Series Modeling in a Blackboard-Based Coupled Expert System
Topological complexity of motion planning and Massey products
We employ Massey products to find sharper lower bounds for the Schwarz genus of a fibration than those previously known. In particular we give examples of non-formal spaces X for which the topological complexity TC(X) (defined to be the genus of the free path fibration on X) is greater than the zero-divisors cup-length plus one.
Topological Interpretation of Rough Sets
Rough sets, developed by Pawlak, are an important model of incomplete or partially known information. In this article, which is essentially a continuation of [11], we characterize rough sets in terms of topological closure and interior, as the approximations have the properties of the Kuratowski operators. We decided to merge topological spaces with tolerance approximation spaces. As a testbed for our developed approach, we restated the results of Isomichi [13] (formalized in Mizar in [14]) and...
Topologies on free monoids induced by closure operators of a special type
Totally coherent set-valued probability assessments
We introduce the concept of total coherence of a set-valued probability assessment on a family of conditional events. In particular we give sufficient and necessary conditions of total coherence in the case of interval-valued probability assessments. Some relevant cases in which the set-valued probability assessment is represented by the unitary hypercube are also considered.
Towards a linguistic description of dependencies in data
The problem of a linguistic description of dependencies in data by a set of rules R_k: “If X is T_k then Y is S_k” is considered, where T_k’s are linguistic terms like SMALL, BETWEEN 5 AND 7 describing some fuzzy intervals A_k. S_k’s are linguistic terms like DECREASING and QUICKLY INCREASING describing the slopes p_k of linear functions y_k = p_{k}x + q_k approximating data on A_k. The decision of this problem is obtained as a result of a fuzzy partition of the domain X on fuzzy intervals A_k,...
Towards a logic of semiotic systems
The rationalistic denotational approach to semantics is not adequate for capturing the structural dimension of meaning, which is immanent in semiotic systems. The demand for a structural approach to semantics is intensified by a turn in Artificial Intelligence, introduced by Connectionism and Information Retrieval. This paper presents such a structural approach to semantics founded on the phenomenological and autopoietic paradigms and proposes a formalization with the help of category theory.
Towards a theory of practice in metaheuristics design: A machine learning perspective
A number of methodological papers published during the last years testify that a need for a thorough revision of the research methodology is felt by the operations research community – see, for example, [Barr et al., J. Heuristics1 (1995) 9–32; Eiben and Jelasity, Proceedings of the 2002 Congress on Evolutionary Computation (CEC'2002) 582–587; Hooker, J. Heuristics1 (1995) 33–42; Rardin and Uzsoy, J. Heuristics7 (2001) 261–304]. In particular, the performance evaluation of nondeterministic methods,...
Towards an extension of the 2-tuple linguistic model to deal with unbalanced linguistic term sets
In the domain of Computing with words (CW), fuzzy linguistic approaches are known to be relevant in many decision-making problems. Indeed, they allow us to model the human reasoning in replacing words, assessments, preferences, choices, wishes... by ad hoc variables, such as fuzzy sets or more sophisticated variables. This paper focuses on a particular model: Herrera and Martínez' 2-tuple linguistic model and their approach to deal with unbalanced linguistic term sets. It is interesting since the...
Towards automated proofs of observational properties.
Towards Automatic Modeling of Economic Texts.
Towards the automated synthesis of a Gröbner bases algorithm.
We discuss the question of whether the central result of algorithmic Gröbner bases theory, namely the notion of S?polynomials together with the algorithm for constructing Gröbner bases using S?polynomials, can be obtained by ?artificial intelligence?, i.e. a systematic (algorithmic) algorithm synthesis method. We present the ?lazy thinking? method for theorem and algorithm invention and apply it to the ?critical pair / completion? algorithm scheme. We present a road map that demonstrates that, with...
Tracing cluster transitions for different cluster types
Trajectory tracking for a mobile robot with skid-slip compensation in the Vector-Field-Orientation control system
The article is devoted to a motion control problem for a differentially driven mobile robot in the task of trajectory tracking in the presence of skid-slip effects. The kinematic control concept presented in the paper is the Vector Field Orientation (VFO) feedback approach with a nonlinear feed-forward skid-slip influence compensation scheme. The VFO control law guarantees asymptotic convergence of the position tracking error to zero in spite of the disturbing influence of skid-slip phenomena. The...
Transformation of structural patterns in discrete events? An application of structural methods in discrete event systems
An interesting analogy can be found between recognition of noisy, distorted, or incomplete structural patterns and analysis, modelling and control of actual discrete event systems, where different types of uncertainty can occur.
Transition of Consistency and Satisfiability under Language Extensions
This article is the first in a series of two Mizar articles constituting a formal proof of the Gödel Completeness theorem [17] for uncountably large languages. We follow the proof given in [18]. The present article contains the techniques required to expand formal languages. We prove that consistent or satisfiable theories retain these properties under changes to the language they are formulated in.