Search results for "programming."
showing 10 items of 3035 documents
Scratches Removal in Digitised Aerial Photos Concerning Sicilian Territory
2007
In this paper we propose a fast and effective method to detect and restore scratches in aerial photos from a photographic archive concerning Sicilian territory. Scratch removal is a typical problem for old movie films but similar defects can be seen in still images. Our solution is based on a semiautomatic detection process and an unsupervised restoration algorithm. Results are comparable with those obtained with commercial restoration tools.
Towards an Agent-Based Model for the Analysis of Macroeconomic Signals
2020
This work introduces an agent-based model for the analysis of macroeconomic signals. The Bottom-up Adaptive Model (BAM) deploys a closed Walrasian economy where three types of agents (households, firms and banks) interact in three markets (goods, labor and credit) producing some signals of interest, e.g., unemployment rate, GDP, inflation, wealth distribution, etc. Agents are bounded rational, i.e., their behavior is defined in terms of simple rules finitely searching for the best salary, the best price, and the lowest interest rate in the corresponding markets, under incomplete information. The markets define fixed protocols of interaction adopted by the agents. The observed signals are em…
ABM of Civil Violence: ODD Description
2017
This chapter contains a description of the proposed agent-based model, using the well-known “Overview, Design Concepts and Details” protocol. The model was implemented in NetLogo and is based on the same two types of agents—citizens and law-enforcement—as in Epstein’s model, but “citizen” agents have one subtype (“activist”) used for implementing network influence effects. The salient aspects of the model description are centered on the submodels for the risk perception, the expression of hardship in terms of value-sensitive relative deprivation, endogenous legitimacy feedback and network influence effects, which provide extensions to Epstein’s model. The model includes two networks called …
Session details: Distributed systems: WT - web technologies track
2018
The Web is relentlessly evolving. Once a single interconnection of static, physically distributed content passively accessed by human users through personal computers, during the explosion of Web-based social networks the Web evolved into an environment allowing users worldwide to interact and collaborate to create user-generated content within many virtual communities. In this line, Web 2.0 is the umbrella term used to encompass several developments which followed, namely social networking sites and social media sites (e.g., Facebook), blogs, wikis, folksonomies (e.g. Flickr), video sharing sites (e.g., YouTube), Web applications ("apps"), collaborative platforms, and mashup applications. …
TWO-DIMENSIONAL FINITE STATE RECOGNIZABILITY
1996
The purpose of this paper is to investigate about a new notion of finite state recognizability for two-dimensional (picture) languages. This notion takes as starting point the characterization of one-dimensional recognizable languages in terms of local languages and projections. Such notion can be extended in a natural way to the two-dimensional case. We first introduce a notion of local picture language and then we define,a recognizable picture language as a projection of a local picture language. The family of recognizable picture languages is denoted by REC. We study some combinatorial and language-theoretic properties of family REC. In particular we prove some closure properties with re…
Nonsmooth Optimization Methods
1999
From the previous chapters we know that after the discretization, elliptic and parabolic hemivariational inequalities can be transformed into substationary point type problems for locally Lipschitz superpotentials and as such will be solved. There is a class of mathematical programming methods especially developed for this type of problems. The aim of this chapter is to give an overview of nonsmooth optimization techniques with special emphasis on the first and the second order bundle methods. We present their basic ideas in the convex case and necessary modifications for nonconvex optimization. We shall use them in the next chapter for the numerical realization of several model examples. L…
Iterationsverfahren höherer Ordnung in Banach-Räumen
1969
The Newton process for operator equations in say a linear normed complete space converges under certain hypothesis about the Frechet-derivatives of the operator with at least the order two. There are different ways to improve this Newton process. For instance you obtain a process of order three if you add a correction element containing the second Frechet-derivative of the operator [1]. In the following note we will generalize this idea. In a recursive manner -- by adding higher derivatives -- we will construct iterative processes of any orderk (k > 1). A general theorem due toCollatz provides us error estimates for this processes. Last we will illustrate the processes by several examples.
Proving convexity preserving properties of interpolatory subdivision schemes through reconstruction operators
2013
We introduce a new approach towards proving convexity preserving properties for interpolatory subdivision schemes. Our approach is based on the relation between subdivision schemes and prediction operators within Harten's framework for multiresolution, and hinges on certain convexity properties of the reconstruction operator associated to prediction. Our results allow us to recover certain known results [10,8,1,7]. In addition, we are able to determine the necessary conditions for convexity preservation of the family of subdivision schemes based on the Hermite interpolation considered in [4].
Multi-letter reversible and quantum finite automata
2007
The regular language (a+b)*a (the words in alphabet {a, b} having a as the last letter) is at the moment a classical example of a language not recognizable by a one-way quantum finite automaton (QFA). Up to now, there have been introduced many different models of QFAs, with increasing capabilities, but none of them can cope with this language. We introduce a new, quite simple modification of the QFA model (actually even a deterministic reversible FA model) which is able to recognize this language. We also completely characterise the set of languages recognizable by the new model FAs, by finding a "forbidden construction" whose presence or absence in the minimal deterministic (not necessaril…
On Extensional Fuzzy Sets Generated by Factoraggregation
2014
We develop the concept of a general factoraggregation operator introduced by the authors on the basis of an equivalence relation and applied in two recent papers for analysis of bilevel linear programming solving parameters. In the paper this concept is generalized by using a fuzzy equivalence relation instead of the crisp one. We show how the generalized factoraggregation can be used for construction of extensional fuzzy sets and consider approximations of arbitrary fuzzy sets by extensional ones.