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ę "Owsiński, K." wg kryterium: Autor

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    Tytuł:
    Proposal of a new method for e-banking authentication based on fingerprint reader
    Autorzy:
    Hłobaż, A.
    Owsiński, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/94793.pdf
    Data publikacji:
    2013
    Wydawca:
    Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Wydawnictwo Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie
    Tematy:
    electronic banking
    authorization codes
    authorization
    biometric data
    fingerprint scanner
    bankowość elektroniczna
    kody autoryzacji
    autoryzacja
    dane biometryczne
    skaner odcisków placów
    Opis:
    The paper presents a novel method/mechanism for electronic banking transactions authentication based on biometrics, using fingerprint reader. The method allows to identify the client not only by something that he has or knows, but who he is. Therefore, the proposed solution enhances security of transactions authentication by an additional factor of client identification - this kind of solution hasn't been currently used by banks in Poland so far. The article also presents that the application of an additional level of security is not associated with an increase of costs for banks but allows them to reduce them, especially for long-term relationships with customers.
    Źródło:
    Information Systems in Management; 2013, 2, 2; 136-145
    2084-5537
    2544-1728
    Pojawia się w:
    Information Systems in Management
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Identifying main center access hubs in a city using capacity and time criteria. The evolutionary approach
    Autorzy:
    Owsiński, J. W.
    Stańczak, J.
    Barski, A.
    Sęp, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/205927.pdf
    Data publikacji:
    2016
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    transport
    urban transport system
    Hub and Spoke
    Park and Ride
    evolutionary algorithm
    Opis:
    In this paper we consider the well known Hub and Spoke problem, analyzed in the context of Warsaw Public Transport System. Our method was designed for data preprocessing so as to allow using a timetable obtained from the public transport web site after conversion into the required data format. A dedicated evolutionary algorithm method that detects the hubs of almost all available transport means was also developed. The hubs identified are well connected to the center of the city and to other identified hubs (characterized by high capacity or short travel time). These hubs may become the skeleton of the public transport system and, in particular, good points for locating Park and Ride facilities.
    Źródło:
    Control and Cybernetics; 2016, 45, 2; 207-223
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Evolutionary approach for obtaining the hub and spoke structure in the logistic network
    Autorzy:
    Mażbic-Kulma, B.
    Stańczak, J.
    Owsiński, J. W.
    Sęp, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/343812.pdf
    Data publikacji:
    2011
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    kernel and shell
    hub and spoke
    logistic network
    evolutionary algorithm
    Opis:
    In order to describe transportation system, as a routine a connection graph would be used. Vertices of the graph can be train stations, bus stop, airports etc. The edges show direct connections between vertices. A direct application of such graph can be difficult and computational problems can occur while one would try to organize or optimize such a transportation system. Therefore, a method of aggregation of such graph was introduced, using the general kernel and shell structure and a hub and spoke transformation method of the source graph. These structures allow to concentrate and order the transport of goods/persons among vertices and enable to reduce the number of analyzed vertices as well as edges of the graph. In the presented paper we continue our work on kernel and shell and its instance hub and spoke methods of connection graph transformation. In this paper we develop model of the transportation system using the hub and spoke method with predetermined, minimum and indirectly described numbers of hub nodes. To obtain the desired structures, several versions of specialized evolutionary algorithm (EA) were developed and applied.
    Źródło:
    Total Logistic Management; 2011, 4; 89-105
    1689-5959
    Pojawia się w:
    Total Logistic Management
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The kernel and shell structure as a tool for improving the graph of transportation connections
    Autorzy:
    Mażbic-Kulma, B.
    Owsiński, J. W.
    Sęp, K.
    Stańczak, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/406561.pdf
    Data publikacji:
    2013
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    transport
    connections graph
    hub and spoke
    kernel and shell
    α-clique
    genetic algorithm
    Opis:
    A model of a transportation system is expected to be useful in simulations of a real system to solve given transportation tasks. A connection graph is routinely used to describe a transportation system. Vertices can be train stations, bus stops, airports etc. The edges show direct connections between vertices. A direct approach can be difficult and computational problems can arise in attempts to organize or optimize such a transportation system. Therefore, a method for aggregating such graphs was introduced, using a general kernel and shell structure and its particular instances: α-clique structured graphs of connections and a hub and spoke transformation of the source graph. These structures enable the concentration and ordering of transport between vertices and reduction of the analyzed graph. To obtain the desired structures, several versions of a specialized evolutionary algorithm were developed and applied.
    Źródło:
    Operations Research and Decisions; 2013, 23, 2; 91-105
    2081-8858
    2391-6060
    Pojawia się w:
    Operations Research and Decisions
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Properties of an α-clique approach to obtaining the hub and spoke structure in optimization of transportation systems
    Autorzy:
    Mazbic-Kulma, B.
    Owsinski, J. W.
    Barski, A.
    Sęp, K.
    Stańczak, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/205710.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    transport
    transport systems
    graphs
    hub and spoke
    evolutionary algorithm
    time-wise profitability
    Opis:
    The paper is devoted to the analysis of a graph transformation, pertinent for the transport and logistic systems and their planning and management. Namely, we consider, for a given graph, representing some existing transport or logistic system, its transformation to a (non-equivalent) so-called ”hub-and-spoke” structure, known from both literature and practice of transportation and logistics. This structure is supposed to bring benefits in terms of functioning and economic performance of the respective systems. The transformation into the ”hub-and-spoke” is not only non-equivalent (regarding the original graph of the system), but is also, in general, non unique. The structure sought is composed of two kinds of elements - nodes of the graph (stations, airports, havens, etc.), namely: the subgraph of hubs, which, in principle, ought to constitute a complete sub-graph (a clique), and the ”spokes”, i.e. the subsets of nodes, each of which is connected in the ultimate structure only with one of the hubs. The paper proposes a relaxation of the hub-and-spoke structure by allowing the hub subgraph not to be complete, but at least connected, with a definite ”degree of completeness” (alpha), from where the name of ”alpha-clique”. It is shown how such structures can be obtained and what are the resulting benefits for various assumptions, regarding such structures. The benefits are measured here with travel times. The desired structures are sought with an evolutionary algorithm. It is shown on an academic example how the results vary and how the conclusions, relevant for practical purposes, can be drawn from such analyses, done with the methods here presented.
    Źródło:
    Control and Cybernetics; 2018, 47, 2; 173-189
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-5 z 5

      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