7 research outputs found
Proposal of a new method for e-banking authentication based on fingerprint reader
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
Identifying main center access hubs in a city using capacity and time criteria. The evolutionary approach
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
Evolutionary approach for obtaining the hub and spoke structure in the logistic network
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
The kernel and shell structure as a tool for improving the graph of transportation connections
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