Search results for "algoritmi"
showing 10 items of 204 documents
Peer-to-peer cooperative GNSS-based localization for stationary reference nodes in wireless sensor networks
2017
Most localization algorithms in wireless sensor networks rely on a few reference nodes with known locations to estimate the locations of unknown nodes. The locations of reference nodes can be either manually configured or, more practically, obtained by means of some satellite-based positioning system(s). However, satellite-based locations may be inaccurate and imprecise, which results in reduced location accuracy of localization algorithms. This paper proposes a peer-to-peer cooperative GNSS-based localization algorithm for stationary reference nodes to improve their relative location accuracy and precision. The algorithm applies simple statistical methods and GNSS-based information from mu…
Do Randomized Algorithms Improve the Efficiency of Minimal Learning Machine?
2020
Minimal Learning Machine (MLM) is a recently popularized supervised learning method, which is composed of distance-regression and multilateration steps. The computational complexity of MLM is dominated by the solution of an ordinary least-squares problem. Several different solvers can be applied to the resulting linear problem. In this paper, a thorough comparison of possible and recently proposed, especially randomized, algorithms is carried out for this problem with a representative set of regression datasets. In addition, we compare MLM with shallow and deep feedforward neural network models and study the effects of the number of observations and the number of features with a special dat…
A New Paradigm in Interactive Evolutionary Multiobjective Optimization
2020
Over the years, scalarization functions have been used to solve multiobjective optimization problems by converting them to one or more single objective optimization problem(s). This study proposes a novel idea of solving multiobjective optimization problems in an interactive manner by using multiple scalarization functions to map vectors in the objective space to a new, so-called preference incorporated space (PIS). In this way, the original problem is converted into a new multiobjective optimization problem with typically fewer objectives in the PIS. This mapping enables a modular incorporation of decision maker’s preferences to convert any evolutionary algorithm to an interactive one, whe…
Progress Checking for Dummies
2018
Verification of progress properties is both conceptually and technically significantly more difficult than verification of safety and deadlock properties. In this study we focus on the conceptual side. We make a simple modification to a well-known model to demonstrate that it passes progress verification although the resulting model is intuitively badly incorrect. Then we point out that the error can be caught easily by adding a termination branch to the system. We compare the use of termination branches to the established method of addressing the same need, that is, weak fairness. Then we discuss another problem that may cause failure of catching progress errors even with weak fairness. Fi…
Topoloģijas optimizācijas algoritmi 3D printējamu struktūru dizainam
2017
Darbs "Topoloģijas optimizācijas algoritmi 3D printējamu struktūru dizainam" ir veltīts topoloģijas optimizācijas algoritmu un 3D printeru funkcionalitātes izpētei. Darbā tiek apskatīti divi topoloģijas optimizācijas algoritmi un to pielietojumi vairākos piemēros. Ir veikta plaša izpēte par 3D printeru tehnisko specifikāciju, to darbību un izmantošanas veidiem. Darba galvenais mērķis ir realizēt topoloģijas optimizācijas algoritmu no uzdevuma formulējuma līdz pat gatavai, izdrukātai detaļai. Darbā ir apskatīti 3D struktūru nepieciešamie izveides nosacījumi, to modelēšana ar topoloģijas optimizāciju, kā arī pats drukāšanas process. Darba rezultātā tika iegūts dzelzceļa tilta posms, kurš vēlā…
Dataa näkyvissä: Läpinäkyvyys algoritmien ja datan journalistisessa hyödyntämisessä
2021
Läpinäkyvyyden käsite on noussut keskeiseksi viestinnän, median ja politiikan tutkimuksessa sekä viestinnän ja politiikan käytäntöjen eettisessä arvioinnissa. Läpinäkyvyyttä on esitetty keinoksi ylläpitää ja kasvattaa luottamusta journalistista työtä ja sen tuotteita kohtaan interaktiivisessa media- ja viestintäympäristössä. Tiedontuotannon ja päätöksenteon perustuessa yhä enemmän dataan ja sen prosessointiin läpinäkyvyys on noussut keskeiseksi käsitteeksi myös algoritmisen päätöksenteon kohdalla. Tässä artikkelissa tarkastelemme läpinäkyvyyden roolia dataa ja algoritmeja sekä journalismia koskevassa keskustelussa ja esitämme mahdollisuuksia dataan ja algoritmeihin tukeutuvan journalismin l…
PROGETTAZIONE PER ADDITIVE MANUFACTURING DI ORTESI DI GOMITO PERSONALIZZATE E SVILUPPO DI MODELLO PARAMETRICO BASATO SU ALGORITMI GENERATIVI
Decoding Musical Training from Dynamic Processing of Musical Features in the Brain
2018
AbstractPattern recognition on neural activations from naturalistic music listening has been successful at predicting neural responses of listeners from musical features, and vice versa. Inter-subject differences in the decoding accuracies have arisen partly from musical training that has widely recognized structural and functional effects on the brain. We propose and evaluate a decoding approach aimed at predicting the musicianship class of an individual listener from dynamic neural processing of musical features. Whole brain functional magnetic resonance imaging (fMRI) data was acquired from musicians and nonmusicians during listening of three musical pieces from different genres. Six mus…
Stubborn sets, frozen actions, and fair testing
2021
Many partial order methods use some special condition for ensuring that the analysis is not terminated prematurely. In the case of stubborn set methods for safety properties, implementation of the condition is usually based on recognizing the terminal strong components of the reduced state space and, if necessary, expanding the stubborn sets used in their roots. In an earlier study it was pointed out that if the system may execute a cycle consisting of only invisible actions and that cycle is concurrent with the rest of the system in a non-obvious way, then the method may be fooled to construct all states of the full parallel composition. This problem is solved in this study by a method tha…
Osservazioni su contratti algoritmici e tutela del consumatore nell’economia di piattaforma
2020
Il saggio prende in esame alcune delle tutele predisposte dalla direttiva 2019/2161 del Parlamento e del Consiglio in favore del consumatore, nell’ipotesi in cui quest’ultimo sia assistito, nell’incontro con il professionista, dall’uso di tecnologie computazionali: con una espressione di sintesi, l’Autore si riferisce a questa evenienza con la locuzione “contratti algoritmici”. Tre sono gli aspetti cui si dirige l’attenzione: 1) la specificità dell’economia di piattaforma, luogo privilegiato in cui gli algoritmi orientano le scelte di consumo; 2) gli algoritmi che sono adoperati nell’atto di consumo; 3) l’ottimizzazione dei prezzi tramite profilazione automatizzata, quale caso paradigmatico…