Scientific Published Papershttp://scholar.ppu.edu/handle/123456789/22017-11-25T11:17:01Z2017-11-25T11:17:01ZMapping E-banking Models to New TechnologiesRomi, Ismail M.Romi, Ismail M.http://scholar.ppu.edu/handle/123456789/3262017-08-10T10:29:32Z2015-02-20T00:00:00ZMapping E-banking Models to New Technologies
Romi, Ismail M.; Romi, Ismail M.
Banks operates in a dynamic environment, with a continuous pressure from customers, and stakeholders. As well
as set of challenges from banks environments and technological advancements. To determine technological solutions
for banks operations and processes, an analysis to the literature were conducted depending on several e-banking
models. Where, prior researches show the different requirement for e-banking, which include e-banking requirements;
to be determined from the banking models, and then; customer requirements, which includes several operations that
meets customer changing capabilities. The current study, proposed a model for e-banking, which is composed of
five main domains, mainly; bank functional and non-functional requirements, customer functional and non-functional
requirements, bank technological capabilities, customers technological capabilities, and suppliers technological
capabilities. And then, matches e-banking systems to latest technologies. Where, two types of bidirectional fit take
place; first, the requirements bidirectional fit to supplierâ€™s technological capabilities, and second, the requirements
bidirectional fit to banks and customers capabilities.
2015-02-20T00:00:00ZSequence Pattern Mining in Data StreamsHijawi, HamzaSaheb, Mahmoudhttp://scholar.ppu.edu/handle/123456789/3252017-08-10T10:29:25Z2015-08-01T00:00:00ZSequence Pattern Mining in Data Streams
Hijawi, Hamza; Saheb, Mahmoud
Sequential pattern mining in data streams environment is an interesting data mining problem. The problem of finding sequential patterns in static databases had been studied extensively in the past years, however mining sequential patterns in the data streams still an active field for researches. In this research a new greedy sequence pattern mining algorithm for the data streams is introduced, it will be used to find the strongly supported sequences. The proposed algorithm is built based on the sequence tree which is used to find the sequential patterns in static databases. The proposed algorithm divides the streams into patches or windows and each patch will update the sequence tree which built from the previous windows. An example is introduced to explain how this algorithm works. We also show the efficiency and the effectiveness of the proposed algorithm on a synthetic dataset and prove how it is suited for data streams environment. We showed experimentally that the proposed algorithm is more efficient than the PrefixSpan algorithm for patterns with any support less than 30% for CPU time and with any support less than 60% for memory usage
2015-08-01T00:00:00ZReference load solutions for plates with semi-elliptical surface cracks subjected to biaxial tensile loadingMadia, MauroArafah, DiyaZerbst, Uwehttp://scholar.ppu.edu/handle/123456789/3242017-08-10T10:29:18Z2014-03-13T00:00:00ZReference load solutions for plates with semi-elliptical surface cracks subjected to biaxial tensile loading
Madia, Mauro; Arafah, Diya; Zerbst, Uwe
The yield or limit load is a key parameter with respect to the accuracy of flaw assessment based on R6
type procedures such as the R6 routine, the SINTAP and FITNET method, the standard BS 7910 and others.
In a number of previous papers two of the present authors proposed the use of a reference load instead of
the common limit load, which not only provided more exact fracture mechanics predictions, but showed
also a wider and more general application range than the conventional parameter. Here the method has
been extended to biaxial tensile loading and it has been successfully validated by a thorough comparison
with finite element results and alternative solutions available in the literature.
2014-03-13T00:00:00ZGENERALIZATIONS OF B.BERGGREN AND PRICE MATRICESMuneer Jebreel Karamahttp://scholar.ppu.edu/handle/123456789/3232017-08-10T10:28:41Z2017-04-18T00:00:00ZGENERALIZATIONS OF B.BERGGREN AND PRICE MATRICES
Muneer Jebreel Karama
The aim of this paper is to generalize B.Berggren Matrices, and Price Matrices
through a general formula for matrices power; so B.Berggren Matrices and Price Matrices will
become a special case when the power of a matrix is reduced to the power of one.
2017-04-18T00:00:00Z