Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "incremental" wg kryterium: Wszystkie pola


Wyświetlanie 1-4 z 4
Tytuł:
Vector space of increments
Autorzy:
Borawski, M.
Powiązania:
https://bibliotekanauki.pl/articles/206256.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
incremental arithmetic
vector space
vector calculus
standard deviation increment
variance increment
Opis:
The article discusses definitions of vector space for variance increment and standard deviation increment, as well as definition of scalar product for variance increment. This justifies using a vector calculus for variance increment and allows for emplyoing vector calculus methods for variance recalculated into variance increment. The paper also presents a practical example of combining images from sector-scan sonar based on comparison made between local increments of variance.
Źródło:
Control and Cybernetics; 2012, 41, 1; 145-170
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Semi-supervised approach to handle sudden concept drift in Enron data
Autorzy:
Kmieciak, M. R.
Stefanowski, J.
Powiązania:
https://bibliotekanauki.pl/articles/206052.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
concept drift
incremental learning of classifiers
email foldering
Enron data
Opis:
Detection of concept changes in incremental learning from data streams and classifier adaptation is studied in this paper. It is often assumed that all processed learning examples are always labeled, i.e. the class label is available for each example. As it may be difficult to satisfy this assumption in practice, in particular in case of data streams, we introduce an approach that detects concept drift in unlabeled data and retrains the classifier using a limited number of additionally labeled examples. The usefulness of this partly supervised approach is evaluated in the experimental study with the Enron data. This real life data set concerns classification of user's emails to multiple folders. Firstly, we show that the Enron data are characterized by frequent sudden changes of concepts. We also demonstrate that our approach can precisely detect these changes. Results of the next comparative study demonstrate that our approach leads to the classification accuracy comparable to two fully supervised methods: the periodic retraining of the classifier based on windowing and the trigger approach with the DDM supervised drift detection. However, our approach reduces the number of examples to be labeled. Furthermore, it requires less updates of retraining classifiers than windowing.
Źródło:
Control and Cybernetics; 2011, 40, 3; 667-695
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Incremental value of information for discrete-time partially observed stochastic systems
Autorzy:
Banek, T.
Powiązania:
https://bibliotekanauki.pl/articles/969917.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
stochastic control
filtering
Hausdorff measures
change of variables formula of Federer
Lagrange multipliers
value of information
Opis:
A discrete-time stochastic control problem for general (nonlinear in state, control, observation and noise) models is considered. The same noise can enter into the state and into the observation equations, and the state/observation does not need to be affine with respect to the noise. Under mild assumptions the joint distribution function of the state/observation processes is obtained and used for computing the Gateaux and Frechet derivatives of the cost function. Under partial observation the control actions are restricted by the measurability requirement and we compute the Lagrange multiplier associated with this "information constraint". The multiplier is called a "dual", or "shadow" price, and in the literature of the subject is interpreted as an incremental value of information . The present and the future are two factors appearing in the multiplier and we study how they are balanced as time goes on. An algorithm for computing extremal controls in the spirit of R. Rishel (1985) is also obtained.
Źródło:
Control and Cybernetics; 2010, 39, 3; 769-781
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A differential motion planning algorithm for controlling multi-robot systems handling a common object
Autorzy:
Tzafestas, C.
Prokopiou, P.
Tzafestas, S.
Powiązania:
https://bibliotekanauki.pl/articles/205881.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
robot
cooperative robots
incremental robot motion planning
manipulator kinematic
master and two-slaves system
multi-robot kinematics
multi-robot systems
path planning
rigidity condition
Opis:
Multi-robot systems have substantially increased capabilities over single-robot systems and can handle very large or peculiar objects. This paper presents a differential (incremental) motion planning algorithm for an m-robot system (m >or=2) to cooperatively transfer an object from an initial to a desired final position / orientation by rigidly holding it at given respective points Q[sub 1], Q[sub 2],..., Q[sub m]. One of the robots plays the role of a "master" while other robots operate in the "slave" mode maintaining invariant their relative positions and orientations during the system motion. The method employs the differential displacements of the end-effector of each robot arm. Then, the differential displacements of the joints of the m robots are computed for the application of incremental motion control. The algorithm was tested on many examples. A representative of them is shown here, concerning the case of three STAUBLI RX-90L robots similar to 6-dof PUMA robots. The results obtained show the practicality and effectiveness of the method, which, however, needs particular care for completely eliminating the cumulative errors that may occur.
Źródło:
Control and Cybernetics; 2000, 29, 2; 567-584
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-4 z 4

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies