Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "representation," wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-11 z 11
    Tytuł:
    Multiple criteria decision making with deductive approximate representation of efficient outcomes
    Wielokryterialne podejmowanie decyzji z przybliżoną reprezentacją dedukcyjną rozwiązań sprawnych
    Autorzy:
    Kaliszewski, I.
    Powiązania:
    https://bibliotekanauki.pl/articles/206005.pdf
    Data publikacji:
    2002
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    reprezentacja dedukcyjna
    reprezentacja przybliżona
    teoria decyzji
    wielokryterialne podejmowanie decyzji
    approximate representation
    decision theory
    deductive representation
    multiple criteria decision making
    Opis:
    We propose an approach, which we believe, can be pivotal for wider applications of Multiple Criteria Decision Making methods in practical problems. The idea is to represent decisions by approximate rather than by exact values of criteria. By this it is possible to eliminate the need of solving optimization problems from decision making processes. This in turn has far reaching consequences for versatility of decision making methods when modified accordingly to absorb the proposed approach.
    Zaproponowano podejście, o którym należy sądzić, że stanowi istotny postęp w dziedzinie szerszego zastosowania metod wielokryterialnego podejmowania decyzji do zagadnień praktycznych. Idea polega na przybliżonej raczej niż dokładnej reprezentacji decyzji przy pomocy wartości kryteriów. W ten sposób staje się możliwe wyeliminowanie potrzeby rozwiązywania zadań optymalizacyjnych z procesu podejmowania decyzji. To zaś ma daleko idące konsekwencje dla elastyczności metod podejmowania decyzji, zmodyfikowanych w celu uwzględnienia zaproponowanego podejścia.
    Źródło:
    Control and Cybernetics; 2002, 31, 4; 949-964
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Context search algorithm for lexical knowledge acquisition
    Autorzy:
    Szymański, J.
    Duch, W.
    Powiązania:
    https://bibliotekanauki.pl/articles/206264.pdf
    Data publikacji:
    2012
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    semantic memory
    knowledge representation
    international retrieval
    knowledge acquisition
    Opis:
    A Context Search algorithm used for lexical knowledge acquisition is presented. Knowledge representation based on psycholinguistic theories of cognitive processes allows for implementation of a computational model of semantic memory in the form of semantic network. Knowledge acquisition using supervised dialog templates have been performed in a word game designed to guess the concept a human user is thinking about. The game that has been implemented on a web server, demonstrates elementary linguistic competencies based on lexical knowledge stored in semantic memory, enabling at the same time acquisition and validation of knowledge. Possible applications of the algorithm in domains of medical diagnosis and information retrieval are sketched.
    Źródło:
    Control and Cybernetics; 2012, 41, 1; 81-96
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Solving Markov decision processes by d-graph algorithms
    Autorzy:
    Kátai, Z.
    Powiązania:
    https://bibliotekanauki.pl/articles/205688.pdf
    Data publikacji:
    2012
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    Markov decision processes
    dynamic programming
    graph representation
    graph algorithms
    optimization problems
    Opis:
    Markov decision processes (MDPs) provide a mathematical model for sequential decisionmaking (sMDP/dMDP: stochastic/ deterministic MDP). We introduce the concept of generalized dMDP (g-dMDP) where each action may result in more than one next (parallel or clone) state. The common tools to represent dMDPs are digraphs, but these are inadequate for sMDPs and g-dMDPs. We introduce d-graphs as general tools to represent all the above mentioned processes (stationary versions). We also present a combined d-graph algorithm that implements dynamic programming strategies to find optimal policies for the finite/infinite horizon versions of these Markov processes. (The preliminary version of this paper was presented at the Conference MACRo 2011.)
    Źródło:
    Control and Cybernetics; 2012, 41, 3; 577-593
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    New formula for the failure/repair frequency of multi-state monotone systems and its applications
    Autorzy:
    Korczak, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/969720.pdf
    Data publikacji:
    2007
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    multi-state monotone systems
    availability
    repair frequency
    binary representation
    Shannon decomposition
    random demand
    Opis:
    The paper deals with calculation methods for failure and repair frequencies of multi-state monotone systems, both for the instantaneous and steady state cases. First, the fixed demand is considered. Based on the binary representation of multi-state structure, we have obtained a new formula for the failure/repair frequency. This formula is used to derive simple rules for the calculation of failure/repair frequency. These rules show how to convert an expression for the system availability into appropriate expression for the system failure/repair frequency. The applicability of the rules is illustrated by some examples. Finally, expressions for the failure/repair frequency for systems operating under random demand are obtained. Since both input and output data have similar format, the rules can be used in a recursive manner, allowing easy analysis of complex systems with hierarchical structure.
    Źródło:
    Control and Cybernetics; 2007, 36, 1; 219-239
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A variant of the Narayana coding scheme
    Autorzy:
    Das, Monojit
    Sinha, Sudipta
    Powiązania:
    https://bibliotekanauki.pl/articles/1839131.pdf
    Data publikacji:
    2019
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    Fibonacci sequence
    Zeckendorf’s representation
    Narayana sequence
    universal code
    Narayana code straight line
    Opis:
    In this paper we use second order variant of the Narayana sequence to frame a universal coding scheme. Earlier, the Narayana series has been used by Kirthi and Kak to represent universal coding. This paper provides an extension, based on the paper by Kirthi and Kak. The second order variant Narayana universal coding is used in source coding as well as in cryptography.
    Źródło:
    Control and Cybernetics; 2019, 48, 3; 473-484
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A qualitative trajectory calculus as a basis for representing moving objects in Geographical Information Systems
    Autorzy:
    Weghe, N. van de
    Cohn, A. G.
    Tre, G. de
    Maeyer, P. de
    Powiązania:
    https://bibliotekanauki.pl/articles/970477.pdf
    Data publikacji:
    2006
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    obiekt ruchomy
    wnioskowanie jakościowe
    specyfikacja jakościowa
    moving objects
    qualitative reasoning
    qualitative representation
    spatio-temporal modelling
    Opis:
    Qualitative formalisms, suited to express qualitative temporal or spatial relationships between entities, have gained wide acceptance as a useful way of abstracting from the real world. The question remains how to describe spatio-temporal concepts, such as the interaction between disconnected moving objects, adequately within a qualitative calculus and more specifically how to use this in geographical information systems. In this paper, the Basic Qualitative Trajectory Calculus (QTCB) for representing and reasoning about moving objects is presented. QTCB enables comparisons between positions of objects at different time points ro be made. The calculus is based on few primitives (i.e., distance and speed constraints), making it elegant and theoretically simple. To clarify the way in which trajectories are represented within QTCB: specific cases of movements (e.g. circular movement) are presented. To illustrate the naturalness of QTC, a "predator-prey" example is studied.
    Źródło:
    Control and Cybernetics; 2006, 35, 1; 97-119
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Uses of second order variant Fibonacci universal code in cryptography
    Autorzy:
    Basu, M.
    Das, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/206024.pdf
    Data publikacji:
    2016
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    Fibonacci numbers
    Fibonacci coding
    GopalaHemachandra sequence
    Zeckendorf’s representation
    Gopala-Hemachandra code
    GH code straight line
    cryptography
    Opis:
    We know from Zeckendorf’s theorem that every positive integer n has unique representation of the form n =Pl k=1 akF(k), where ak ∈ {0,1} and F(k) is a Fibonacci number such that the string a1a2a3 ... does not contain any consecutive 1’s. In this paper we consider second order variant Fibonacci universal code from Gopala-Hemachandra sequence. Thereby, we describe the uses of this code in cryptography with an illustrative example.
    Źródło:
    Control and Cybernetics; 2016, 45, 2; 239-251
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Representations of hypersurfaces and minimal smoothness of the midsurface in the theory of shells
    Autorzy:
    Delfour, M. C.
    Powiązania:
    https://bibliotekanauki.pl/articles/970297.pdf
    Data publikacji:
    2008
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    thin shell
    asymptotic shell
    midsurface
    smoothness
    representation of a surface
    oriented distance function
    bi-Lipschitz mapping
    tubular neighborhood
    Opis:
    Many hypersurfaces ω in R^N can be viewed as a subset of the boundary Γ of an open subset Ω of R^N. In such cases, the gradient and Hessian matrix of the associated oriented distance function ba to the underlying set Ω completely describe the normal and the N fundamental forms of ω, and a fairly complete intrinsic theory of Sobolev spaces on C1'1-hypersurfaces is available in Delfour (2000). In the theory of thin shells, the asymptotic model only depends on the choice of the constitutive law, the midsurface, and the space of solutions that properly handles the loading applied to the shell and the boundary conditions. A central issue is the minimal smoothness of the midsurface to still make sense of asymptotic membrane shell and bending equations without ad hoc mechanical or mathematical assumptions. This is possible for a C1'1-midsurface with or without boundary and without local maps, local bases, and Christoffel symbols via the purely intrinsic methods developed by Delfour and Zolesio (1995a) in 1992. Anicic, LeDret and Raoult (2004) introduced in 2004 a family of surfaces ω that are the image of a connected bounded open Lipschitzian domain in R² by a bi-Lipschitzian mapping with the assumption that the normal field is globally Lipschizian. >From this, they construct a tubular neighborhood of thickness 2h around the surface and show that for sufficiently small h the associated tubular neighborhood mapping is bi-Lipschitzian. We prove that such surfaces are C1'1-surfaces with a bounded measurable second fundamental form. We show that the tubular neighborhood can be completely described by the algebraic distance function to ω and that it is generally not a Lipschitzian domain in R³ by providing the example of a plate around a flat surface ω verifying all their assumptions. Therefore, the G1-join of K-regular patches in the sense of Le Dret (2004) generates a new K-regular patch that is a C1'1-surface and the join is C1'1. Finally, we generalize everything to hypersurfaces generated by a bi-Lipschitzian mapping defined on a domain with facets (e.g. for sphere, torus). We also give conditions for the decomposition of a C1'1-hypersurface into C1'1-patches.
    Źródło:
    Control and Cybernetics; 2008, 37, 4; 879-911
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On representative functions method for clustering of 2D contours with application to pottery fragments typology
    Autorzy:
    Kaliszewska, A.
    Syga, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/205512.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    shape representation
    2D contours
    cross-sections
    rotationally symmetric objects
    representative functions
    clustering
    dynamic time warping (DTW) distance
    Opis:
    We investigate clustering of 2D contours which represent cross-sections of rotationally symmetric objects. We propose modifications of the existing representations of digitized 2D contours and similarity measures. In particular, we represent each of the investigated objects as a single number and two functions and we use the DTW distance to measure their similarity. We apply our method to clustering of pottery fragments.
    Źródło:
    Control and Cybernetics; 2018, 47, 1; 85-108
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Equivalence of second order optimality conditions for bang-bang control problems. Part 2 : Proofs, variational derivatives and representations
    Autorzy:
    Osmolovskii, N. P.
    Maurer, H.
    Powiązania:
    https://bibliotekanauki.pl/articles/969736.pdf
    Data publikacji:
    2007
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    bang-bang control
    second order necessary and sufficient conditions
    critical cones
    equivalence of quadratic forms
    representation of the Hessian of the Lagrangian
    Opis:
    In Part 1 of this paper (Osmolovskii and Maurer, 2005), we have summarized the main results on the equivalence of two quadratic forms from which second order necessary and sufficient conditions can be derived for optimal bang-bang control problems. Here, in Part 2, we give detailed proofs and elaborate explicit relations between Lagrange multipliers and elements of the critical cones in both approaches. The main analysis concerns the derivation of formulas for the first and second order derivatives of trajectories with respect to variations of switching times, initial and final time and initial point. This leads to explicit representations of the second order derivatives of the Lagrangian for the induced optimization problem. Based on a suitable transformation, we obtain the elements of the Hessian of the Lagrangian in a form which involves only first order variations of the nominal trajectory. Finally, a careful regrouping of all terms allows us to find the desired equivalence of the two quadratic forms.
    Źródło:
    Control and Cybernetics; 2007, 36, 1; 5-45
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A fuzzy shape database to support conceptual design
    Autorzy:
    Zhang, J.
    Pham, B.
    Chen, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/970432.pdf
    Data publikacji:
    2004
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    odwzorowanie kształtu rozmytego
    baza danych rozmyta
    projektowanie koncepcyjne
    fuzzy shape representation
    indexing and retrieval of fuzzy shapes
    shape database
    fuzzy database
    conceptual design
    Opis:
    At the conceptual stage of design, designers only have vague ideas of initial shapes which they gradually refine. These imprecise shapes may be specified by a set of fuzzy shape descriptors which represent the intent of a designer. It is also desirable to be able to save them in a database for future reference or for use as initial shapes for new designs. Most research on fuzzy databases has been focused on theoretical aspects while a fuzzy database is rarely seen in practice, especially in the design area. This paper aims to construct a fuzzy shape database to support shape design by integrating fuzzy data processing and fuzzy querying functions into a conventional database. A possibility-based framework is used for a fuzzy relational database model.
    Źródło:
    Control and Cybernetics; 2004, 33, 1; 141-172
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-11 z 11

      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