Archive for May, 2009

Business Process Management Conference 2009

Our paper “Business Process-based Resource Importance Determination” has been accepted at the 7th International Conference on Business Process Management (BPM’2009).

Traditionally, the BPM conference attracts the outstanding researchers in the field and abides to the highest academic standards. BPM solicits original research papers that break new ground in or make significant novel contributions to the field. The acceptance rate in previous editions has been around 14%. (cf. http://www.bpm2009.org/)

Leave a Comment

Prof. Maria Damiani visits Secure Business Austria

Prof. Maria Damiani gave a talk on “Spatio-temporal access control: state-of-the-art and open issues”.

Abstract
In the last few years, a number of spatial and spatio-temporal access control models have been developed in the framework of pervasive computing and location-based services. The distinguishing feature of those models is that the access authorization is subordinated to the satisfaction of contextual conditions, such as spatial proximity or containment in certain spaces. For example, health records can be only accessed by personnel located in the hospital during working hours. In most cases those models extend RBAC to allow for the specification of simple constraints based on location and time which are then enforced upon users’ request. Many issues, however, remain to be investigated, for example the administration of spatio-temporal policies, the specification of usage control in mobile applications, the development of suitable architectures and the protection of privacy. In this talk, I will overview research in spatio-temporal access control and discuss a few open issues.

Leave a Comment

Prof. Daniel S. Yeung visits Secure Business Austria

Prof. Daniel S. Yeung gave a talk on “Sensitivity Based Generalization Error for Supervised Learning Problem with Applications in Model Selection and Feature Selection”.

Abstract
Generalization error model provides a theoretical support for a classifier’s performance in terms of prediction accuracy. However, existing models give very loose error bounds. This explains why classification systems generally rely on experimental validation for their claims on prediction accuracy. In this talk we will revisit this problem and explore the idea of developing a new generalization error model based on the assumption that only prediction accuracy on unseen points in a neighborhood of a training point will be considered, since it will be unreasonable to require a classifier to accurately predict unseen points “far away” from training samples. The new error model makes use of the concept of sensitivity measure for an ensemble of multiplayer feedforward neural networks (Multilayer Perceptrons or Radial Basis Function Neural Networks). Two important applications will be demonstrated, model selection and feature reduction for RBFNN classifiers. A number of experimental results using datasets such as the UCI, the 99 KDD Cup, and text categorization, will be presented.

Leave a Comment