Titlebook: e-Business and Telecommunications; International Confer Joaquim Filipe,Mohammad S. Obaidat Conference proceedings 2009 Springer-Verlag Berl

ARK

Towards a Version-Based Approach to Deal with Business Process Evolutionas quickly as possible while keeping effectiveness, new business or production requirements. This paper proposes to adopt a version-based approach to support these dynamic evolutions of business processes (BP). Adopting this approach permits to keep chronological BP changes since several instances o

apiary

Comparing Consumer Resistance to Mobile Banking in Finland and Portugald how the five adoption barriers namely usage, value, risk, tradition and image, derived from the earlier literature, differ between these two countries. Using an Internet questionnaire a total of 3.597 usable responses was collected. A confirmatory factor analysis was implemented with SEM to build

600

Halfhearted

SHRIK

FLIP

Aggregation and Thresholding Schemes for Anomaly-Based Approachesmaly scores of audit events are obtained by aggregating several local anomaly scores. Remarkably, most works focus on profile/model definition while critical issues of anomaly measuring, aggregating and thresholding are dealt with ”simplistically”. This paper addresses the issue of anomaly scoring a

mechanism

A Memory Efficient Network Encryption Schemees consume either more memory to gain high throughput or low memory with low throughput. The need has aroused for a scheme that has low memory requirements and in the same time possesses high speed, as the number of the internet users increases each day. We used the SSM model [1], to construct an en

peritonitis

Analyzing the Effectiveness of the Self-organized Public-Key Management System on MANETs under the Lme. It is fully self-organized and does not require any certificate authority. Two kinds of misbehavior attacks are considered to be great threats to PGP-Like: lack of cooperation and impersonation attacks. This work quantifies the impact of such attacks on the PGP-Like. Simulation results show that

啤酒

草率男

Reducing Memory Requirements for Combinatorial Attacks on NTRU via Multiple Birthdaysday problem [9] allowed to speed-up several combinatorial attacks. However, in the case of NTRU we can not hope to to apply Wagner’s algorithm directly, as the search space does not behave nicely. In this paper we show that we can nevertheless draw profit from a multiple birthday approach. Our appro