Wyniki wyszukiwania - BazTech

1

Exploring relative instances of exposure in equilibrium of migration processes based on population characteristics

Pitlik L., Kollár P., Fülöp Z., Madarász I.

Managerial Economics

|

2017

|

Vol. 18, no. 2

183--199

EN

Cybernetic states of law try to plan each activity – especially migration issues. The planning process has the following question originating in socio-cybernetics in its core: Where can it be assumed that the population characteristics are higher/lower than rational? The planning levels can be different: from the continent or country levels via statistic regions or micro-regions to settlements (even at the street and house levels). Parallel to the aggregation like population density (or annual growth rate), models can also be developed for arbitrary layers of demographical statistics, like the required ratio of males and females in different age-groups and/or education categories, etc. The models can analyze time-periods (e.g., years, time intervals) to ensure that dynamic processes will not actually be covered through static evaluation. The necessary data asset (a kind of Big Data) is given by OECD/ EUROSTAT, for example The questions and data assets are well-known. The modeling methodology consists of potential know-how: through estimations of staircase functions in the framework of online similarity analyses, regional norm values can be derived for targeted population characteristics. Therefore, the European strategy concerning the integration of massive volumes of migrants can be supported in an objective way. Analogue analyses with the same methodology have already been derived for parts of Germany and Hungary. Similarity analysis is an artificial intelligence-based approach with its own consistence-oriented quality assurance layers. The data-driven policy creation needs methodologies where objectivity is provided through optimization in the modeling based on arbitrary phenomena. The modeling philosophy should try to ensure a kind of regional multi-layered equilibrium (sustainability, cf. Kazohinia). The outlined methodology can be seen as a sort of automated SWOT analysis where each conclusion will be derived from the raw statistics in a direct way – without the risk of human subjectivity intervening in the process. The modeling spectrum consists of three levels: (1) Explorative modeling is able to derive basic characteristics for ceteris paribus perspectives through the complex functions. The standard analytical potential works with ceteris paribus parameters, based on the appropriate literature sources. (2) Antidiscriminative modeling is capable of deriving ranks for objects without an actual learning pattern, for the so-called production functions. (3) A cybernetic state of law should be able to have robot-planning values supporting human decision processes. Therefore, 'freedom of press' is basically the capability to explore and publish objective force fields and not to catalyze the spread of subjective evaluations.

2

Weighted Extended Tree Transducers

Fülöp Z., Maletti A., Vogler H.

Fundamenta Informaticae

|

2011

|

Vol. 111, nr 2

163-202

EN

Weighted extended tree transducers (wxtts) over countably complete semirings are systematically explored. It is proved that the extension in the left-hand sides of a wxtt can be simulated by the inverse of a linear and nondeleting tree homomorphism. In addition, a characterization of the class of weighted tree transformations computable by bottom-up wxtts in terms of bimorphisms is provided. Backward and forward application to recognizable weighted tree languages are standard operations for wxtts. It is shown that the backward application of a linear wxtt preserves recognizability and that the domain of an arbitrary bottom-up wxtt is recognizable. Examples demonstrate that neither backward nor forward application of arbitrary wxtts preserves recognizability. Finally, a HASSE diagram relates most of the important subclasses of weighted tree transformations computable by wxtts.

3

Pebble Macro Tree Transducers with Strong Pebble Handling

Fülöp Z., Muzamel L.

Fundamenta Informaticae

|

2008

|

Vol. 89, nr 2-3

207-257

EN

We consider pebble macro tree transducers with call-by-name semantics and strong pebble handling. The latter means that the last dropped pebble can be lifted regardless of the position of the reading head. This tree transducer concept is a generalization of the pebblemacro tree transducer introduced by J. Engelfriet and S. Maneth in 2003, however we leave the original name untouched. Our main results are that (1) every n-pebble macro tree transformation can be characterized by the composition of an n-pebble tree transformation and a yield tree transformation, and (2) each n- pebble tree transformation can also be computed by an (n - 1)-pebble macro tree transformation. Using (1) and (2) we prove that every n-pebblemacro tree transformation appears as the composition of n+2 stay-macro tree transformations and hence, the inverses of n-pebble macro tree transformations preserve regularity. Finally, using the previous results, we show that the type checking problem for n-pebble macro tree transducers is decidable.