KMICe eX: Conference management tool

The e-management application in organizing a conference is vital to help users whether they are organizers, reviewers, or authors who will make benefit from the Internet or web.The application is linked with the conference website that contains the conference information (such as the important dates, conference venue and the organizer) and the guidelines for presenters such as how to write and submit their papers.In developing such application, the important features and functions to be included have been identified and put into a working model. This article presents the working model which has been tested in organization KMICe 2008

Probabilistic Model Checking for Energy Analysis in Software Product Lines

In a software product line (SPL), a collection of software products is defined by their commonalities in terms of features rather than explicitly specifying all products one-by-one. Several verification techniques were adapted to establish temporal properties of SPLs. Symbolic and family-based model checking have been proven to be successful for tackling the combinatorial blow-up arising when reasoning about several feature combinations. However, most formal verification approaches for SPLs presented in the literature focus on the static SPLs, where the features of a product are fixed and cannot be changed during runtime. This is in contrast to dynamic SPLs, allowing to adapt feature combinations of a product dynamically after deployment. The main contribution of the paper is a compositional modeling framework for dynamic SPLs, which supports probabilistic and nondeterministic choices and allows for quantitative analysis. We specify the feature changes during runtime within an automata-based coordination component, enabling to reason over strategies how to trigger dynamic feature changes for optimizing various quantitative objectives, e.g., energy or monetary costs and reliability. For our framework there is a natural and conceptually simple translation into the input language of the prominent probabilistic model checker PRISM. This facilitates the application of PRISM's powerful symbolic engine to the operational behavior of dynamic SPLs and their family-based analysis against various quantitative queries. We demonstrate feasibility of our approach by a case study issuing an energy-aware bonding network device.Comment: 14 pages, 11 figure

Agent Coordination via Scripting Languages

Introduction It is widely accepted today that closed and proprietary software systems cannot keep up with the pace of changing user requirements. In order to overcome the problems of these systems, modern applications are being built as collections of distributed software agents. Since these agents run in a distributed environment and concurrently access resources, they not only need to exchange information, but they must coordinate their actions to achieve the required functionality. Unfortunately, the corresponding coordination code is often intermixed with computational code, which reduces the flexibility and adaptability, hence the reusability of distributed agents. Talking about agents, it is often not clear what kind of entities we should consider as being agents. In this chapter, we will not worry to much about giving a precise notion of software agents, but simply adapt a definition given in [28]. From our point of view, an agent should be considered as a software program th