In 1975, G. Jacopini proved the existence of an easy term, i.e., a term which can be consistently (with beta conversion) identified with any other term. In 1980, A. Visser generalized Jacopini's result to R.E. theories; namely, easy terms for consistent (with beta conversion) R.E. theories exist. Of course, no such generalization for non-R.E. theories exists. For example, it is easy to see that there is no easy term for Barendregt's theory H. In this note we shall generalize Jacopini's result to non-R.E. theories as follows. Say that an equation M = N is easy if for any consistent (with beta conversion) extension T we have that T Č{ M = N} is consistent. We shall prove that easy equations exist.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
We recall some syntactic techniques used to prove the consistency of some extensions of the lambda-calculus. These techniques are a possible way to prove the easiness of YOmega3.
3
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
We consider a heat equation with a non-linear right-hand side which depends on certain Volterra-type functionals. We study the problem of existence and convergence for the method of lines by means of semi-discrete inverse formulae.
4
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
Multithreshold Entropy Linear Classifier (MELC) is a recent classifier idea which employs information theoretic concept in order to create a multithreshold maximum margin model. In this paper we analyze its consistency over multithreshold linear models and show that its objective function upper bounds the amount of misclassified points in a similar manner like hinge loss does in support vector machines. For further confirmation we also conduct some numerical experiments on five datasets.
This paper presents an examination of approximation aspects of the Smoothed Particle Hydrodynamics (SPH) in modeling the water wave phenomenon. Close attention is paid on consistency of the SPH formulation and its relation with a correction technique applied to improve the method accuracy. The considerations are confined to flow fields within finite domains with a free surface and fixed solid boundaries with free slip boundary conditions. In spite of a wide application of the SPH method in fluid mechanics, the appropriate modeling of the boundaries is still not clear. For solid straight line boundaries, a natural way is to use additional (virtual, ghost) particles outside the boundary and take into account mirror reflection of associated field variables. Such a method leads to good results, except for a vicinity of solid horizontal bottoms where, because of the SPH approximations in the description of pressure, a stratification of the fluid material particles may occur. In order to illustrate the last phenomenon, some numerical tests have been made. These numerical experiments show that the solid fluid bottom attracts the material particles and thus, to prevent these particles from penetration into the bottom, a mutual exchange of positions of real and ghost particles has been used in a computation procedure.
6
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
Due to the versatility as well as its ease of implementation, the Fast Transversal Filters algorithm is attractive for many adaptive filtering applications. However, it is not widely used because of its undesirable tendency to diverge when operating in finite precision arithmetic. To compensate, modifications to the algorithm have been introduced that are either occasional (performed when a predefined condition(s) is violated) or structured as part of the normal update iteration. However, in neither case is any confidence explicitly given that the computed parameters are in fact close to the desired ones. Here, we introduce a time invariant parameter that provides the user with more flexibility in establishing confidence in the consistency of the updated filter parameters. Additionally, we provide evidence through the introduction of a hybrid FTF algorithm that when sufficient time is given prior to catastrophic divergence, the update parameters of the FTF algorithm can be adjusted so that consistency can be acquired and maintained.
7
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
We consider the regression model in the situation when the number of available regressors pn is much bigger than the sample size n and the number of nonzero coefficients p0n is small (the sparse regression). To choose the regression model, we need to identify the nonzero coefficients. However, in this situation the classical model selection criteria for the choice of predictors like, e.g., the Bayesian Information Criterion (BIC) overestimate the number of regressors. To address this problem, several modifications of BIC have been recently proposed. In this paper we prove weak consistency of some of these modifications under the assumption that both n and pn as well as p0n go to infinity.
8
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
The article deals with the special subclass of φ-mixing periodically correlated (PC) time series and the estimation of autocovariance through Fourier coefficients. The aim is to investigate whether the subsampling of the autocovariance estimator is consistent. It is shown that the consistency holds for frequencies λ=0 and λ=π. Theoretical reasoning is supplemented with a simulation study.
9
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
The main purpose of this paper is to establish the asymptotic properties of the expectation and variance of periodogram for nonstationary, almost periodically correlated time series. We expand our consideration to the whole bifrequency square (0; 2π]2. We show the exact form of asymptotic covariance between two values of periodogram which are calculated at different points. This result implies that periodogram is not consistent in mean square sense for any point from bifrequency square (0; 2π]2. Finally, under the moment and α-mixing condition, we prove the consistency of smoothed periodogram.
10
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
Pawlak had proposed the notion of rough truth in 1987 [16]. The article takes a fresh look at this ``soft'' truth, and presents a formal system LR, that is shown to be sound and complete with respect to a semantics determined by this notion. LR is based on the modal logic S5. Notable is the rough consequence relation defining LR (a first version introduced in [9]), and rough consistency (also introduced in [9]), used to prove the completeness result. The former is defined in order to be able to derive roughly true propositions from roughly true premisses in an information system. The motivation for the latter stems from the observation that a proposition and its negation may well be roughly true together. A characterization of LR-consequence shows that the paraconsistent discussive logic J of Ja\'skowski is equivalent to LR. So, LR, developed from a totally independent angle, viz. that of rough set theory, gives an alternative formulation to this well-studied logic. It is further observed that pre-rough logic [3] and 3-valued ukasiewicz logic are embeddable into LR.
11
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
Let r,n be two modulars on L(G), and let W be an abstract set of indices. For nonlinear integral op-erators T(w) and S(w) on L(G), we give sufficient conditions for two methods of summability gen-erated by T(w) and S(w) to be consistent for sequences (f(w)) of functions of L(G), in the sense of modular r.
12
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
This paper recalls the definition of consistency for pairwise comparison matrices and briefly presents the concept of inconsistency index in connection to other aspects of the theory of pairwise comparisons. By commenting on a recent contribution by Koczkodaj and Szwarc, it will be shown that the discussion on inconsistency indices is far from being over, and the ground is still fertile for debates.
This paper describes ways in which political speakers define and legitimize future policies by construing different policy options in terms of ‘privileged’ and ‘oppositional’ futures. Privileged and oppositional futures are conceptual projections of alternative policy visions occurring in quasi-dialogic chunks of speech, revealing specific evidential, mood, and modality patterns. Privileged future involves the speaker’s preferred or at least acknowledged vision and is articulated through absolute modality and evidential markers which derive from factual evidence, history, and reason. Oppositional future involves an antagonistic and plainly threatening vision, expressed by probabilistic modality and usually interrogative mood. Following the principle of psychological consistency in belief, oppositional future is normally communicated first, allowing a swift and strong response from the privileged future expressed in the speaker-preferred vision.
14
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
Signal Transition Graphs (STGs) are a popular formalism for the specification of asynchronous circuits. A necessary condition for the implementability of an STG is the existence of a consistent and complete state encoding. For an important subclass of STGs, the marked graph STGs, we show that checking consistency is polynomial, but checking the existence of a complete state coding is co-NP-complete. In fact, co-NP-completeness already holds for acyclic and 1-bounded marked graph STGs and for live and 1-bounded marked graph STGs. We add some relevant results for free-choice, bounded, and general STGs.
15
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
Automated support to enterprise modeling has increasingly become a subject of interest for organizations seeking solutions for storage, distribution and analysis of knowledge about business processes. This interest has recently resulted in approving the standard for specifying Semantics of Business Vocabulary and Business Rules (SBVR). Despite the existence of formally grounded notations, up to now SBVR still lacks a sound and consistent logical formalization which would allow developing automated solutions able to check the consistency of a set of business rules. This work reports on the attempt to provide logical foundations for SBVR by the means of defining a specific first-order deontic-alethic logic (FODAL). The connections of FODAL with the modal logic QK and the description logic AℒCQℐ have been investigated and, on top of the obtained theoretical results, a special tool providing automated support for consistency checks of a set of AℒCQℐ-expressible deontic and alethic business rules has been implemented.
In recent years, autonomous navigation for mobile robots has been considered a highly active research field. Within this context, we are interested to apply the Simultaneous Localization And Mapping (SLAM) approach for a wheeled mobile robot. The Extended Kalman Filter has been chosen to perform the SLAM algorithm. In this work, we explicit all steps of the approach. Performances of the developed algorithm have been assessed through simulation in the case of a small scale map. Then, we present several experiments on a real robot that are proceeded in order to exploit a programmed SLAM unit and to generate the navigation map. Based on experimental results, simulation of the SLAM method in the case of a large scale map is then realized. Obtained results are exploited in order to evaluate and compare the algorithm’s consistency and robustness for both cases.
The Ouroboros Model proposes a brain inspired cognitive architecture including detailed suggestions for the main processing steps in an overall conceptualization of cognition as embodied and embedded computing. All memories are structured into schemata, which are firmly grounded in the body of an actor. A cyclic and iterative data-acquisition and -processing loop forms the backbone of all cognitive activity. Ever more sophisticated schemata are built up incrementally from the wide combination of neural activity, concurrent at the point in time when the memory is established; i.e., distinct representations are accrued. Later on, an entire schema can be reinstated from diverse subsets of its constituent features. In order to decode or compile ever more elaborate constructions, extant building blocks are concatenated. They are serially linked via common or “connection-attributes” of different representations and symbols, and they are employed for serial perception, processing and action, in particular, also for language production. At various levels, commonalities between different schemata lead to a similar preferred use of their respective tokens and subsequently shared categorizations. Rules, for the concatenation of words, akin to the ones governing chemical reactions, can be abstracted. As special kinds of symbols, words and word-classes along with the whole grammar of a language can thus be seen as a direct consequence of the processes outlined in the Ouroboros Model. Strong emphasis is put on the dimension of time over short intervals during active experience and performance, and, in particular, during interactions with other agents.
18
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
We propose here Live Sequence Charts with a new, game-based semantics to model interactions between the system and its environment. For constructing programs automatically, we give an algorithm to synthesize either a strategy for the system ensuring that the specification is respected, or, if the specification is unimplementable, a strategy for the environment forcing the system to fail. We introduce the concept of mercifulness, a desirable property of the synthesized program. We give a polynomial time algorithm for synthesizing merciful winning strategies.
Consistency of LSE estimator in linear models is studied assuming that the error vector has radial symmetry. Generalized polar coordinates and algebraic assumptions on the design matrix are considered in the results that are established.
Zaproponowano nowy konsystometr rynnowy do oceny konsystencji półpłynnych produktów żywnościowych. Uzyskano szereg istotnych i wysoko istotnych korelacji między drogą płynięcia, a parametrami Teologicznymi badanych cieczy. Stwierdzono przydatność konsystome-tru rynnowego do oceny konsystencji badanej grupy produktów żywnościowych.
EN
A new gutter consistometer was presented and tested for consistency assessment of selected semi-liquid food products. Numerous significant and highly significant correlations between the flow distance for different slope angles of the gutter and rheological parameters of products were found. Experiments showed the' applicability of the gutter consistometer for consistency evaluation of this class of food products.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.