Wyniki wyszukiwania - Biblioteka Nauki

1

Marginalia to a theorem of Jacopini

100%

Statman R.

Fundamenta Informaticae

|

2001

|

tom Vol. 45, nr 1,2

117-121

EN

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

On the method of lines for a non-linear heat equation with functional dependence

80%

Leszczyński H.

Annales Polonici Mathematici

|

1998

|

tom 69

|

nr 1

61-74

EN

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.

3

About the Notion of Easiness in lambda-Calculus

80%

Bertini Y.

Schedae Informaticae

|

2003

|

tom Vol. 12

67-75

EN

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.

4

Asymptotic properties of periodogram for almost periodically correlated time series

80%

Lenart Ł.

Probability and Mathematical Statistics

|

2008

|

tom Vol. 28, Fasc. 2

305--324

EN

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.

5

On the Consistency of Multithreshold Entropy Linear Classifier

80%

Czarnecki W. M.

Schedae Informaticae

|

2015

|

tom Vol. 24

123--132

EN

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.

6

Measuring and maintaining consistency: a hybrid FTF algorithm

80%

Bunch J. R. , Le Borne R. C. , Proudler I. K.

International Journal of Applied Mathematics and Computer Science

|

2001

|

tom 11

|

nr 5

1203-1216

EN

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

On the SPH Approximations in ModelingWaterWaves

80%

Szmidt K.

Archives of Hydro-Engineering and Environmental Mechanics

|

2013

|

tom Vol. 60, nr 1-4

63--86

EN

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.

8

Weak consistency of modified versions of bayesian information criterion in a sparse linear regression

80%

Szulc P.

Probability and Mathematical Statistics

|

2012

|

tom Vol. 32, Fasc. 1

47--55

EN

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.

9

Some results on the subsampling for φ-mixing periodically strictly stationary time series

80%

Synowiecki R.

Probability and Mathematical Statistics

|

2007

|

tom Vol. 27, Fasc. 2

247--260

EN

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.

10

Logic for Rough Truth

80%

Banerjee M.

Fundamenta Informaticae

|

2006

|

tom Vol. 71, nr 2,3

139-151

EN

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

On consistency of summability methods generated by nonlinear integral operators

80%

Tomasz B.

Annales Societatis Mathematicae Polonae. Seria 1: Commentationes Mathematicae

|

1999

|

tom [Z] 39

197-205

EN

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

Smoothed estimator of the periodic hazard function

80%

Dudek A.

Opuscula Mathematica

|

2009

|

tom Vol. 29, no. 3

229-251

EN

A smoothed estimator of the periodic hazard function is considered and its asymptotic probability distribution and bootstrap simultaneous confidence intervals are derived. Moreover, consistency of the bootstrap method is proved and some applications of the developed theory are presented. The bootstrap method is based on the phase-consistent resampling scheme developed in Dudek and Leśkow [6].

13

M-estimation of the mixed-type generalized linear model

80%

Dong Y. , Song L. , Wang M. , Amin M.

Probability and Mathematical Statistics

|

2018

|

tom Vol. 38, Fasc. 1

209--223

EN

To investigate the features of the individual from the mixed-type model, a novel model, named the mixed-type generalized linear model, is proposed firstly in this work, which is verified to be realistic and useful. We consider the robustness of M-estimation to estimate the unknown parameters of the mixed-type generalized linear model. By applying the law of large numbers and the central limit theorem, the consistency and asymptotic normality of the M-estimation for the mixed-type generalized linear model are proved with regularity assumptions. At last, in order to evaluate the finite sample performance of the estimator for the new model, several applied instances are presented, which show the good performance of the estimator.

14

Effect of natural variations with respect of time interval in handwritings of individuals

80%

Gupta S. , Garg R. K. , Nath S.

Nowa kodyfikacja prawa karnego

|

2017

|

tom 45

81-90

EN

In the present investigation an attempt has been made to extract out natural variations with time interval, a total of 540 (60 samples from each age group — 30 samples each from males & females) collected from 9 different age groups, that is two handwriting samples in present handwriting (with an interval of 5–10 minutes between the two handwritings) with content same as that of previous written script (old handwriting) which is also taken as a sample for comparative study with time interval ranged from 2–33 years between present and old handwriting. It has been found that connectivity between letters, alignment and spacing are highly significant characteristic along with those which remain unaffected and intact by showing consistency in skill and speed in due course or age and time. The findings of the present study will assist in the cases which are lacking in contemporary handwritings and can be undertaken with ease by taking into account the handwriting characteristics which are prone to variations.

15

Recent Advances on Inconsistency Indices for Pairwise Comparisons : A Commentary

70%

Brunelli M.

Fundamenta Informaticae

|

2016

|

tom Vol. 144, nr 3/4

321--332

EN

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.

16

Constructing Privileged and Oppositional Future in Dialogic Political Speeches

70%

Cap P.

Heteroglossia - studia kulturoznawczo-filologiczne

|

2021

|

nr 11

131-149

EN

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.

17

Extended penalty coefficients for elimination the lockingeffects in moderately thick beam and plate finite elements

70%

Gilewski W.

|

2014

|

nr 3

18

On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs

70%

Esparza J. , Jančar P. , Miller A.

Fundamenta Informaticae

|

2008

|

tom Vol. 86, nr 3

227-253

EN

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.

19

Logic-based Reasoning Support for SBVR

70%

Solomakhin D. , Franconi E. , Mosca A.

Fundamenta Informaticae

|

2013

|

tom Vol. 124, nr 4

543--560

EN

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.

20

Simulation and experimental evaluation of the EKF simultaneous localization and mapping algorithm on the wifibot mobile robot

70%

Ayadi N. , Derbel N. , Morette N. , Novales C. , Poisson G.

Journal of Artificial Intelligence and Soft Computing Research

|

2018

|

tom Vol. 8, No. 2

91--101

EN

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.