login::  password::

cwbe coordinatez:

you: r,
system: public
net: yes



total descendants::161
total children::24
3 K

show[ 2 | 3] flat

kris rubin6
Hromada, Daniel
>> v povodi horneho bodrogu nasli drogu<<

 Prospero      20.10.2017 - 22:17:25 , level: 1, UP   NEW
And I mean it.

 Prospero      20.10.2017 - 22:19:08 , level: 2, UP   NEW

Hypotekárne zmluvy ukladajú určité povinnosti nielen dlžníkovi, ale aj veriteľovi. Týchto povinností sa veriteľ môže k ťarche tretej osoby zbaviť len za predpokladu, že s tým tretia osoba súhlasí. V Republike, ktorej záleží na udržaní stavu právnej istoty platia uvedené princípy aj v prípade "konsolidácie" emph{circa} 1000 subprime hypoték, jednej z ktorých sa určovacia Žaloba týka.

 Prospero      16.01.2018 - 15:38:54 , level: 3, UP   NEW

 Prospero      20.10.2017 - 22:20:27 [1K] , level: 3, UP   NEW
Odvolanie zo dňa 20.10.2017 (AE471020) adresované Odvolaciemu súdu pre kraj Bratislava.

 Prospero      20.10.2017 - 22:34:58 , level: 4, UP   NEW

 Prospero      04.06.2017 - 12:56:19 (modif: 04.06.2017 - 13:38:38) [1K] , level: 1, UP   NEW  HARDLINK !!CONTENT CHANGED!!
In the Life of Apollonius, the Athenian author Philostratus, a sophist who lived from c.170 to c.247, tells the story of Apollonius of Tyana, a charismatic teacher and miracle worker from the first century CE who belonged to the school of Pythagoras. It is an apologetic work, in which Philostratus tries to show that Apollonius was a man with divine powers, but not a magician. He also pays attention to Apollonius' behavior as a sophist.

Although the hero is known from several other sources, Philostratus' vie romancée is our most important source.

In the following PDF, you will find the first volume of the translation by F.C. Conybeare, which was published in 1912 in the Loeb Classical Library.

 Prospero      12.12.2016 - 00:43:59 (modif: 12.12.2016 - 00:56:27) [1K] , level: 1, UP   NEW !!CONTENT CHANGED!!
Voynich Manuscript is a corpus of unknown origin written down in
unique graphemic system and potentially representing phonic val-
ues of unknown or potentially even extinct language. Departing from
the postulate that the manuscript is not a hoax but rather encodes au-
thentic contents, our article presents an evolutionary algorithm which
aims to find the most optimal mapping between voynichian glyphs
and candidate phonemic values.

Core component of the decoding algorithm is a process of maxi-
mization of a fitness function which aims to find most optimal set of
substitution rules allowing to transcribe the part of the manuscript -
which we call the Calendar - into lists of feminine names. This leads
to sets of character subsitution rules which allow us to consistently
transcribe dozens among three hundred calendar tokens into femi-
nine names: a result far surpassing both "popular" as well as "state
of the art" tentatives to crack the manuscript. What’s more, by using
name lists stemming from different languages as potential cribs, our
"adaptive" method can also be useful in identification of the language
in which the manuscript is written.

As far as we can currently tell, results of our experiments indicate
that the Calendar part of the manuscript contains names from bal-
toslavic, balkanic or hebrew language strata. Two further indications
are also given: primo, highest fitness values were obtained when the
crib list contains names with specific infixes at token’s penultimate
position as is the case, for example, for slavic feminine diminutives
(i.e. names ending with -ka and not -a). In the most successful sce-
nario, 240 characters contained in 35 distinct Voynichese tokens were
successfully transcribed. Secundo, in case of crib stemming from He-
brew language, whole adaptation process converges to significantly
better fitness values when transcribing voynichian tokens whose or-
der of individual characters have been reversed, and when lists femi-
nine and not masculine names are used as the crib.

backup from http://sci.wizzion.com/voynich.pdf

 Prospero      29.09.2015 - 13:59:23 (modif: 29.09.2015 - 14:00:01), level: 1, UP   NEW !!CONTENT CHANGED!!
Abstract: The paper presents a novel method of multiclass classification. The method combines the notions of dimensionality reduction and binarization with notions of category prototype and evolutionary optimization. It introduces a supervised machine learning algorithm which first projects documents of the training corpus into low-dimensional binary space and subsequently uses canonical genetic algorithm in order to find a constellation of prototypes with highest classificatory pertinence. Fitness function is based on a cognitively plausible notion that a good prototype of a category C should be as close as possible to members of C and as far as possible to members associated to other categories. In case of classification of documents contained in a 20-newsgroup corpus into 20 classes, our algorithm seems to yield better results than a comparable deep learning "semantic hashing" method which also projects the semantic data into 128-dimensional binary (i.e. 16-byte) vector space.

Keywords: multiclass classification, dimensionality reduction, evolutionary computing, prototype theory of categorization, light stochastic binarization, canonic genetic algorithm, supervised machine learning

 Prospero      29.09.2015 - 14:03:46 , level: 2, UP   NEW

 Prospero      07.09.2015 - 10:41:39 (modif: 07.09.2015 - 10:44:42), level: 1, UP   NEW !!CONTENT CHANGED!!
Beamer presentation presented during the examination of the rigorous Thesis

WARNING: this is not the doctoral Thesis but "just" a gentle (and already overpassed) initiation to it

P.S. slowly going LaTex, eh ;)?

 Prospero      07.09.2015 - 10:46:08 , level: 2, UP   NEW

 Prospero      07.09.2015 - 10:34:23 (modif: 07.09.2015 - 10:36:40), level: 1, UP   NEW !!CONTENT CHANGED!!

Evolutionary models of ontogeny of linguistic categories and rules


Language development is a process by means of which a human baby constructs an adequate competence to encode & decode meanings in language of her parents. Computationally it can be described as a trinity of mutually interconnected problems : clustering of all tokens which baby heard into 1) semantic and 2) grammatical categories ; and 3) discovery of grammatical rules allowing to combine the members of diverse equivalence classes into syntactically correct and meaningful phrases. A theoretical, « psycholinguistic » claim of our Thesis is that similary to those theories which explain emergence of cultural or creative thinking as the result of evolutionary process occuring within an individual mind, the emergence of linguistic representations and faculties within a human individuum can be also considered as a case where basic tenets of Universal Darwinism apply. The practical, « cybernetic » aim of the Thesis is to create a computational models of concept learning, part-of-speech induction and grammar induction having comparable performance to existing models but based principially on evolutionary algorithms. It shall be argued that the « fitness function » , which determines the « survival rate » of « candidate grammars » emerging and disappearing in baby’s mind should be based upon the idea that the most fit is such a grammar G which « minimizes the distance »
between the utterances successfully parsed from linguistic environment E by the application of grammar G and the utterances potentially generated by the grammar G.

evolutionary computing, language acquisition, genetic epistemology, part-of-speech induction, grammar induction, optimal clustering, machine learning, concept construction, grammar systems, motherese, toddlerese

WARNING: this is not the doctoral Thesis but "just" a gentle (and already overpassed) introduction to it

 Prospero      07.09.2015 - 10:38:36 , level: 2, UP   NEW

 Prospero      10.10.2014 - 09:22:21 (modif: 10.10.2014 - 09:23:42), level: 1, UP   NEW !!CONTENT CHANGED!!
We introduce a novel method for transformation of texts into short binary vectors which can be subsequently compared by means of Hamming distance measurement. Similary to other semantic hashing approaches, the objective is to perform radical dimensionality reduction by putting texts with similar meaning into same or similar buckets while putting the texts with dissimilar meaning into different and distant buckets. First, the method transforms the texts into complete TF-IDF, than implements Reflective Random Indexing in order to fold both term and document spaces into low-dimensional space. Subsequently, every dimension of the resulting low-dimensional space is simply thresholded along its 50th percentile so that every individual bit of resulting hash shall cut the whole input dataset into two equally cardinal subsets. Without implementing any parameter-tuning training phase whatsoever, the method attains, especially in the high-precision/low-recall region of 20newsgroups text classification task, results which are comparable to those obtained by much more complex deep learning techniques.

Keywords: Random Indexing, unsupervised Locality Sensitive Hashing, Dimensionality Reduction, Hamming Distance, Nearest-Neighbor Search

BibTex Citation:

title={Empiric Introduction to Light Stochastic Binarization},
author={Hromada, Daniel Devatman},
booktitle={Text, Speech and Dialogue},

 Prospero      10.10.2014 - 09:25:36 , level: 2, UP   NEW

 Prospero      19.07.2014 - 00:32:01 (modif: 19.07.2014 - 00:36:27), level: 1, UP   NEW !!CONTENT CHANGED!!
We present two axiomatic and three conjectural conditions which a model inducing natural language categories should dispose of, if ever it aims to be considered as “cognitively plausible”. 1st axiomatic condition is that the model should involve a bootstrapping component. 2nd axiomatic condition is that it should be data-driven. 1st conjectural condition demands that the model integrates the surface features – related to prosody, phonology and morphology – somewhat more intensively than is the case in existing Markov-inspired models. 2nd conjectural condition demands that asides integrating symbolic and connectionist aspects, the model under question should exploit the global geometric and topologic properties of vector-spaces upon which it operates. At last we shall argue that model should facilitate qualitative evaluation, for example in form of a POS-i restricted Turing Test. In order to support our claims, we shall present a POS-induction model based on trivial k-way clustering of vectors representing suffixal and co-occurrence information present in parts of Multext-East corpus. Even in very initial stages of its development, the model succeeds to outperform some more complex probabilistic POS-induction models for lesser computational cost.

category construction, part-of-speech induction, surface features, vector spaces, bootstrapping, geometry of thought, categorization-oriented Turing Test, partitioning of grammatical feature space, K-means clustering, cognitive plausibility

Published in Proceedings of 15th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU), July 2014, Montpellier, France

 Prospero      26.08.2014 - 18:12:54 , level: 2, UP   NEW
another downloadable backup at http://wizzion.com/papers/2014/

 Prospero      17.10.2013 - 17:21:25 (modif: 17.10.2013 - 17:32:22) [1K] , level: 1, UP   NEW !!CONTENT CHANGED!!
Edit distance is not the only approach how distance between two character sequences can be calculated. Strings can be also compared in somewhat subtler geometric ways. A procedure inspired by Random Indexing can attribute an D-dimensional geometric coordinate to any character N-gram present in the corpus and can subsequently represent the word as a sum of N-gram fragments which the string contains. Thus, any word can be described as a point in a dense N-dimensional space and the calculation of their distance can be realized by applying traditional Euclidean measures. Strong correlation exists, within the Keats Hyperion corpus, between such cosine measure and Levenshtein distance. Overlaps between the centroid of Levenshtein distance matrix space and centroids of vectors spaces generated by Random Projection were also observed. Contrary to standard non-random “sparse” method of measuring cosine distances between two strings, the method based on Random Projection tends to naturally promote not the shortest but rather longer strings. The geometric approach yields finer output range than Levenshtein distance and the retrieval of the nearest neighbor of text’s centroid could have, due to limited dimensionality of Randomly Projected space, smaller complexity than other vector methods.

Published in Proceedings of Student Workshop of RANLP 2013 (Hissar, Bulgaria) conference.

 Prospero      19.11.2013 - 22:27:21 , level: 2, UP   NEW

 Prospero      20.09.2013 - 17:11:09 (modif: 20.09.2013 - 17:17:18) [3K] , level: 1, UP   NEW !!CONTENT CHANGED!!

Parallel democracy model is a variant of traditional participative democracy
approach aiming to provide a new method of convergence toward quasi-optimal
solutions of diverse perennial political and social challenges. Within the
framework of the model, such challenges are operationalized into variables for
which the authority can associate possible value. The value which is assigned to
the variable in a moment T of system’s history is called an active value. Every
couple {variable, active value} represents a functional property of a given society
and the genomic vector of such properties can not only describe, but also determine
the functioning of a society under question. In majority of occidental societies,
the authority to assign values to variables is delegated to parliament which assigns
values to variables by means of aggregated voting. The government or other
institutional bodies subsequently execute actions according to such activated values.
In almost all modern political systems, the value->variable assignment is
done in sequential (serial) order for example by voting for one law proposal after
another during a parliamentary session or a referendum. Any reform of the system
—an update of multiple variables— is a costly process because a change of
value for almost any variable requires a new vote which, in majority of societies,
involves the relocation of vote-givers to a vote giving location during a period dedicated
to voting. The progress of quasi-perennial storage systems and databases
in combination with communication networks make it possible to aggregate and
store information about numbers of votes related to potentially infinite number
of variables. Therefore a method by means of which the values are activated and
assigned to variables does not necessarily need to be sequential. Given the condition
that the act of voting is identic to the incrementation of the chosen value
stored on the medium, it is not necessary anymore that the decision-makers shall
meet at one point in time in order to give their vote to the value they want to
activate. Even the condition that they must meet in one place is weakened since
the vote-giving place can be purely virtual. Kyberia.sk and kyberia.cz domains are
domains where first tentatives to implement such a system were implemented «in
vivo» for a limited set of variables. The aggregated voting of already registered
kyberia.cz users determine the number of votes which a registration application
of a new user needs to obtain in order to be accepted. Kyberia.sk senators can
decide what motto shall be displayed at the top of the page —the option which
receive the biggest number of votes becomes the active title. Since both variables
are internal constants of kyberia’s engine, no human intervention is necessary
after a value becomes variable’s active value and the system automatically reconfigure
its own code.

Keywords: Parallel democracy model. Participative democracy. Vote aggregation.
Auto-configuration of social networks. Genome of political bodies.

(published in 2013 issue of Teoria Politica journal, pages 165-180)

 Prospero      09.10.2014 - 22:44:31 , level: 2, UP   NEW
another backup http://wizzion.com/papers/2012/ParallelDemocracyModel.pdf

 Prospero      11.01.2014 - 00:27:12 , level: 2, UP   NEW

 Prospero      20.09.2013 - 17:20:38 (modif: 20.09.2013 - 17:30:30), level: 2, UP   NEW !!CONTENT CHANGED!!
One can imagine, for example, a tribe inhabiting a village located in an environment so hostile, that in every moment of existence of the village, at least two thirds of adult men are patrolling at different spots on the circumference of the village. It happens from time to time that some warriors die in the battle and sometimes their chieftain dies as well. Given a security constraint that forbids the majority of men to meet at one spot and vote, thus leaving the perimeter of the village unprotected, what method could assure that the village shall always have a chieftain respected by the biggest number of his comrades ?

One can imagine the following answer: to every man of the tribe, a distinct color is associated, be it the color that only the man himself can mix. It does not really matter whether the knowledge of color's preparation was revealed to a given individual during a certain rite of passage or whether it was transferred to him by his father —what matters is, that any adult member of the tribe can use a distinct color as his unique identification token. In the middle of the village, there is a group of totems. One of the most central totems is divided into sections, for example stripes colored in different colors. The old legend states that once a man is able to mix his own distinct color, the spirit of the village shall allow him to do two things: Firstly, he can paint his stripe on the totem, hence creating his own section. Secondly, if ever he meets a man worthy of his respect, he can paint one and only one line into the stripe colored in the same color as is the tattoo on the forehead of such a respectable man. And if ever, after engraving such a line into the chosen section of the totem (let’s say green), one finds out that the chosensection contains more colored lines than any other section, one’s duty is to go and seek as much comrades as one can find in order to tell them that the village’s new chieftain is a man with a green tattoo on his forehead...

In this example, the totem represents a variable. When considered as a set, the group of all colors of different sections of the totem $chief represent the type of that variable. When taken individually, every colored section of the totem represents a possible value of the variable. Lines on different sections represent votes which a given possible value had obtained and the section which had obtained the biggest number of votes —i. e. a stripe with the biggest number of distinctly colored lines on it— represents the «active value» of the variable $chief. The act of writing a line correspond to the act of voting and the act of counting the lines within all the sections and the subsequent choice of the section which contain the maximum number of lines can be interpreted as aggregation of votes.

There are several crucial aspects to notice in the above «totem» scenario...

 IMH[Locked_OUT]      08.11.2010 - 16:21:30 , level: 2, UP   NEW
Noda system configure je moderated a obsahuje len take nody ktore sluzia na realne nastavovanie premennych kyberie.

Vsetky otazky ci pripomienky tykajuce sa PDM (ci jej konkretnej realizacie v podobe funkcionality 'system configure') prosim adresujte do tejto 'diskusnej' node.

 IMH[Locked_OUT]      01.02.2012 - 15:25:53 (modif: 01.02.2012 - 15:31:51) [1K] , level: 3, UP   NEW !!CONTENT CHANGED!!
Tak sa zda ze na zaklade nasej ideje publishnutej tu: http://wiki.kyberia.cz/doku.php/parallel_democracy_model_pdm niekto zostavil celu knihu: http://www.betterworldbooks.com/parallel-democracy-model-id-6133095644.aspx


 mirex      18.10.2010 - 12:30:24 [1K] , level: 3, UP   NEW
vidim v tom tieto problemy:
a) ako suvisi tento navrh s kyberiou? Co je na kyberii 'kasta profesionalnych politikov'? Bude moct hlasovat kazdy uzivatel, alebo iba obcan? Avatar system je zneuzitelny tym, ze je mozne vytvarat si neobmedzene mnozstvo alter-eg.
b) system PMD treba naprogramovat. Aktualny system nepodporuje ani 'zmenu nazoru' a teda stiahnutie hlasu. Rovnako kazdy novy navrh nezavisi len od hlasovania, ale aj od programatorov systemu. Odhlasovany navrh sa nenaprogramuje ked nieje cas.
c) je to pouzitelne iba na zopar pripadov, ktore rataju so zmenou behu systemu.

       10.10.2015 - 09:16:42 , level: 4, UP   NEW
Odpoveda niekedy hromi na podobne otazky?

 mirex      10.10.2015 - 22:03:13 , level: 5, UP   NEW
Z mojich skusenosti na 90% nie.

       10.10.2015 - 22:23:36 , level: 6, UP   NEW
To mas imho fenomenalne dobre ratio.

 IMH[Locked_OUT]      06.12.2012 - 16:04:11 (modif: 06.12.2012 - 16:05:13), level: 1, UP   NEW !!CONTENT CHANGED!!
A language-independent method of figure-of-speech extraction is proposed in order to reinforce rhetoric-oriented considerations in natural language processing studies. The method is based upon a translation of a canonical form of repetition-based figures of speech into the language of PERL-compatible regular expressions. Anadiplosis, anaphora, antimetabole figures were translated into the form exploiting the back-reference properties of PERL-compatible regular expression while epiphora was translated into a formula exploiting recursive properties of this very concise artificial language. These four figures alone matched more than 7000 strings when applied on dramatic and poetic corpora written in English, French, German and Latin. Possible usages varying from stylometric evaluation of translation quality of poetic works to more complex problem of semi-supervised figure of speech induction are briefly discussed.

Hromada, D. D. (2011, September). Initial Experiments with Multilingual Extraction of Rhetoric Figures by means of PERL-compatible Regular Expressions. In Student Research Workshop of RANLP2011 conference (pp. 85-90).

 IMH[Locked_OUT]      06.12.2012 - 16:07:47 , level: 2, UP   NEW

 IMH[Locked_OUT]      14.07.2012 - 19:44:01 [1K] , level: 1, UP   NEW
Proceedings of CQRW2012 Symposium of a joint 2012 World Congress of International Association of Philosophy and Computing (IACAP) and Artificial Intelligence and Simulated Behaviour (AISB) comemorating 100th anniversary of Alan Matheson's Turing's birth

Which follow(ed|s) following order in real-life as well as in Proceedings' content:

Session G, Wednesday, 4 July, 14:00-16:30
14:00-14:30 Daniel Devatman Hromada
From Taxonomy of Turing Test-Consistent Scenarios Towards Attribution of Legal Status to Meta-modular Artificial Autonomous Agents

14:30-15:00 Michael Zillich
My Robot is Smarter than Your Robot: On the Need for a Total Turing Test for Robots

15:00-15:30 Adam Linson, Chris Dobbyn and Robin Laney
Interactive Intelligence: Behaviour-based AI, Musical HCI and the Turing Test

15:30-16:00 Javier Insa, Jose Hernandez-Orallo, Sergio España, David Dowe and M.Victoria Hernandez-Lloreda
The anYnt Project Intelligence Test (Demo)

16:00-16:30 Jose Hernandez-Orallo, Javier Insa, David Dowe and Bill Hibbard
Turing Machines and Recursive Turing Tests

Session W, Wednesday, 4 July, 17:00-18:30
17:00-17:30 Francesco Bianchini and Domenica Bruni
What Language for Turing Test in the Age of Qualia?

17:30-18:00 Paul Schweizer
Could There be a Turing Test for Qualia?

18:00-18:30 Antonio Chella and Riccardo Manzotti
Jazz and Machine Consciousness: Towards a New Turing Test

Session H, Thursday, 5 July, 10:00-12:30
10:00-10:30 William York and Jerry Swan
Taking Turing Seriously (But Not Literally)

10:30-11:00 Hajo Greif
Laws of Form and the Force of Function: Variations on the Turing Test
Editors: Vincent C. Muller and Aladdin Ayesh

click on the link below to enjoy the lecture, (some|most|all) of the articles are really great :)