Search results for "Computer program"
showing 10 items of 807 documents
Developing MLS Location-Based Service Pilot System
2002
Development of mobile networks and terminals provides basis for advanced mobile services and applications. One of the new features is support for locating the mobile user by her/his terminal. The Location-Based Services (LBS), utilising this feature, are expected to form an important class of the new services. At the Information Technology Research Institute, University of Jyvaskyla, LBSs have been studied in MultiMeetMobile research project. The project developed an LBS pilot system, called MLS. This paper presents the experiences collected during the development of the LBS pilot and describes the MLS system.
Usability of Programming Languages
2016
Programming languages form the interface between programmers (the users) and the computation that they desire the computer to execute. Although studies exist for some aspects of programming language design (such as conditionals), other aspects have received little or no human factors evaluations. Designers thus have little they can rely on if they want to make new languages highly usable, and users cannot easily chose a language based on usability criteria. This SIG will bring together researchers and practitioners interested in increasing the depth and breadth of studies on the usability of programming languages, and ultimately in improving the usability of future languages. nonPeerReviewed
γ‐Agregation operators and some aspects of generalized aggregation problem
2010
We explore questions related to the aggregation operators and aggregation of fuzzy sets. No preliminary knowledge of the aggregation operators theory and of the fuzzy sets theory are required, because all necessary information is given in Section 2. Later we introduce a new class of γ‐aggregation operators, which “ignore” arguments less than γ. Due to this property γ‐aggregation operators simplify the aggregation process and extend the area of possible applications. The second part of the paper is devoted to the generalized aggregation problem. We use the definition of generalized aggregation operator, introduced by A. Takaci in [7], and study the pointwise extension of a γ‐agop. First publ…
Pointwise k-Pseudo Metric Space
2021
In this paper, the concept of a k-(quasi) pseudo metric is generalized to the L-fuzzy case, called a pointwise k-(quasi) pseudo metric, which is considered to be a map d:J(LX)×J(LX)⟶[0,∞) satisfying some conditions. What is more, it is proved that the category of pointwise k-pseudo metric spaces is isomorphic to the category of symmetric pointwise k-remote neighborhood ball spaces. Besides, some L-topological structures induced by a pointwise k-quasi-pseudo metric are obtained, including an L-quasi neighborhood system, an L-topology, an L-closure operator, an L-interior operator, and a pointwise quasi-uniformity.
Cell-average multiresolution based on local polynomial regression. Application to image processing
2014
In Harten (1996) [32] presented a general framework about multiresolution representation based on four principal operators: decimation and prediction, discretization and reconstruction. The discretization operator indicates the nature of the data. In this work the pixels of a digital image are obtained as the average of a function in some defined cells. A family of Harten cell-average multiresolution schemes based on local polynomial regression is presented. The stability is ensured by the linearity of the operators obtained and the order is calculated. Some numerical experiments are performed testing the accuracy of the prediction operators in comparison with the classical linear and nonli…
Non-separable local polynomial regression cell-average multiresolution operators. Application to compression of images
2016
Abstract Cell-average multiresolution Harten׳s algorithms have been satisfactorily used to compress data. These schemes are based on two operators: decimation and prediction. The accuracy of the method depends on the prediction operator. In order to design a precise function, local polynomial regression has been used in the last years. This paper is devoted to construct a family of non-separable two-dimensional linear prediction operators approximating the real values with this procedure. Some properties are proved as the order of the scheme and the stability. Some numerical experiments are performed comparing the new methods with the classical linear method.
Non-linear Local Polynomial Regression Multiresolution Methods Using $$\ell ^1$$-norm Minimization with Application to Signal Processing
2015
Harten’s Multiresolution has been developed and used for different applications such as fast algorithms for solving linear equations or compression, denoising and inpainting signals. These schemes are based on two principal operators: decimation and prediction. The goal of this paper is to construct an accurate prediction operator that approximates the real values of the signal by a polynomial and estimates the error using \(\ell ^1\)-norm in each point. The result is a non-linear multiresolution method. The order of the operator is calculated. The stability of the schemes is ensured by using a special error control technique. Some numerical tests are performed comparing the new method with…
Non-consistent cell-average multiresolution operators with application to image processing
2016
In recent years different techniques to process signal and image have been designed and developed. In particular, multiresolution representations of data have been studied and used successfully for several applications such as compression, denoising or inpainting. A general framework about multiresolution representation has been presented by Harten (1996) 20. Harten's schemes are based on two operators: decimation, D , and prediction, P , that satisfy the consistency property D P = I , where I is the identity operator. Recently, some new classes of multiresolution operators have been designed using learning statistical tools and weighted local polynomial regression methods obtaining filters…
On specific stability bounds for linear multiresolution schemes based on piecewise polynomial Lagrange interpolation
2009
Abstract The Deslauriers–Dubuc symmetric interpolation process can be considered as an interpolatory prediction scheme within Harten's framework. In this paper we express the Deslauriers–Dubuc prediction operator as a combination of either second order or first order differences. Through a detailed analysis of certain contractivity properties, we arrive to specific l ∞ -stability bounds for the multiresolution transform. A variety of tests indicate that these l ∞ bounds are closer to numerical estimates than those obtained with other approaches.
Spectrum of composition operators on S(R) with polynomial symbols
2020
Abstract We study the spectrum of operators in the Schwartz space of rapidly decreasing functions which associate each function with its composition with a polynomial. In the case where this operator is mean ergodic we prove that its spectrum reduces to {0}, while the spectrum of any non mean ergodic composition operator with a polynomial always contains the closed unit disc except perhaps the origin. We obtain a complete description of the spectrum of the composition operator with a quadratic polynomial or a cubic polynomial with positive leading coefficient.