Understanding conceptual schemas: exploring the role of application and IS domain knowledge

Although information systems (IS) problem solving involves knowledge of both the IS and application domains, little attention has been paid to the role of application domain knowledge. In this study, which is set in the context of conceptual modeling, we examine the effects of both IS and application domain knowledge on different types of schema understanding tasks: syntactic and semantic comprehension tasks and schema-based problem-solving tasks. Our thesis was that while IS domain knowledge is important in solving all such tasks, the role of application domain knowledge is contingent upon the type of understanding task under investigation. We use the theory of cognitive fit to establish theoretical differences in the role of application domain knowledge among the different types of schema understanding tasks. We hypothesize that application domain knowledge does not influence the solution of syntactic and semantic comprehension tasks for which cognitive fit exists, but does influence the solution of schema-based problem-solving tasks for which cognitive fit does not exist. To assess performance on different types of conceptual schema understanding tasks, we conducted a laboratory experiment in which participants with high- and low-IS domain knowledge responded to two equivalent conceptual schemas that represented high and low levels of application knowledge (familiar and unfamiliar application domains). As expected, we found that IS domain knowledge is important in the solution of all types of conceptual schema understanding tasks in both familiar and unfamiliar applications domains, and that the effect of application domain knowledge is contingent on task type. Our findings for the EER model were similar to those for the ER model. Given the differential effects of application domain knowledge on different types of tasks, this study highlights the importance of considering more than one application domain in designing future studies on conceptual modeling.

Effect of pore constriction on adsorption behaviour in nanoporous carbon slit pore: a computer simulation

A Grand Canonical Monte Carlo simulation (GCMC) method is used to study the effects of pore constriction on the adsorption of argon at 87.3 K in carbon slit pores of infinite and finite lengths. It is shown that the pore constriction affects the pattern of adsorption isotherm. First, the isotherm of the composite pore is greater than that of the uniform pore having the same width as the larger cavity of the composite pore. Secondly, the hysteresis loop of the composite pore is smaller than and falls between those of uniform pores. Two types of hysteresis loops have been observed, irrespective of the absence or presence of constriction and their presence depend on pore width. One hysteresis loop is associated with the compression of adsorbed particles and this phenomenon occurs after pore has been filled with particles. The second hysteresis loop is the classical condensation-evaporation loop. The hysteresis loop of a composite pore depends on the sizes of the larger cavity and the constriction. Generally, it is found that the pore blocking effect is not manifested in composite slit pores, and this result does not support the traditional irkbottle pore hypothesis.

The effects of energy sites on adsorption of Lennard–Jones fluids and phase transition in carbon slit pore of finite length a computer simulation study

A Monte Carlo simulation method is Used 10 study the effects of adsorption strength and topology of sites on adsorption of simple Lennard-Jones fluids in a carbon slit pore of finite length. Argon is used as a model adsorbate, while the adsorbent is modeled as a finite carbon slit pore whose two walls composed of three graphene layers with carbon atoms arranged in a hexagonal pattern. Impurities having well depth of interaction greater than that of carbon atom are assumed to be grafted onto the surface. Different topologies of the impurities; corner, centre, shelf and random topologies are studied. Adsorption isotherms of argon at 87.3 K are obtained for pore having widths of 1, 1.5 and 3 11111 using a Grand Canonical Monte Carlo simulation (GCMC). These results are compared with isotherms obtained for infinite pores. It is shown that the Surface heterogeneity affects significantly the overall adsorption isotherm, particularly the phase transition. Basically it shifts the onset of adsorption to lower pressure and the adsorption isotherms for these four impurity models are generally greater than that for finite pore. The positions of impurities on solid Surface also affect the shape of the adsorption isotherm and the phase transition. We have found that the impurities allocated at the centre of pore walls provide the greatest isotherm at low pressures. However when the pressure increases the impurities allocated along the edges of the graphene layers show the most significant effect on the adsorption isotherm. We have investigated the effect of surface heterogeneity on adsorption hysteresis loops of three models of impurity topology, it shows that the adsorption branches of these isotherms are different, while the desorption branches are quite close to each other. This suggests that the desorption branch is either the thermodynamic equilibrium branch or closer to it than the adsorption branch. (c) 2005 Elsevier Inc. All rights reserved.

A general-purpose tunable landscape generator

The research literature on metalieuristic and evolutionary computation has proposed a large number of algorithms for the solution of challenging real-world optimization problems. It is often not possible to study theoretically the performance of these algorithms unless significant assumptions are made on either the algorithm itself or the problems to which it is applied, or both. As a consequence, metalieuristics are typically evaluated empirically using a set of test problems. Unfortunately, relatively little attention has been given to the development of methodologies and tools for the large-scale empirical evaluation and/or comparison of metaheuristics. In this paper, we propose a landscape (test-problem) generator that can be used to generate optimization problem instances for continuous, bound-constrained optimization problems. The landscape generator is parameterized by a small number of parameters, and the values of these parameters have a direct and intuitive interpretation in terms of the geometric features of the landscapes that they produce. An experimental space is defined over algorithms and problems, via a tuple of parameters for any specified algorithm and problem class (here determined by the landscape generator). An experiment is then clearly specified as a point in this space, in a way that is analogous to other areas of experimental algorithmics, and more generally in experimental design. Experimental results are presented, demonstrating the use of the landscape generator. In particular, we analyze some simple, continuous estimation of distribution algorithms, and gain new insights into the behavior of these algorithms using the landscape generator.

Procedure compilation in the refinement calculus

High-level language program compilation strategies can be proven correct by modelling the process as a series of refinement steps from source code to a machine-level description. We show how this can be done for programs containing recursively-defined procedures in the well-established predicate transformer semantics for refinement. To do so the formalism is extended with an abstraction of the way stack frames are created at run time for procedure parameters and variables.

Verifying data refinements using a model checker

In this paper, we consider how refinements between state-based specifications (e.g., written in Z) can be checked by use of a model checker. Specifically, we are interested in the verification of downward and upward simulations which are the standard approach to verifying refinements in state-based notations. We show how downward and upward simulations can be checked using existing temporal logic model checkers. In particular, we show how the branching time temporal logic CTL can be used to encode the standard simulation conditions. We do this for both a blocking, or guarded, interpretation of operations (often used when specifying reactive systems) as well as the more common non-blocking interpretation of operations used in many state-based specification languages (for modelling sequential systems). The approach is general enough to use with any state-based specification language, and we illustrate how refinements between Z specifications can be checked using the SAL CTL model checker using a small example.

Effects of graphene layer size on the adsorption of fluids on graphitized thermal carbon black. A computer simulation study

The adsorption of Lennard-Jones fluids (argon and nitrogen) onto a graphitized thermal carbon black surface was studied with a Grand Canonical Monte Carlo Simulation (GCMC). The surface was assumed to be finite in length and composed of three graphene layers. When the GCMC simulation was used to describe adsorption on a graphite surface, an over-prediction of the isotherm was consistently observed in the pressure regions where the first and second layers are formed. To remove this over-prediction, surface mediation was accounted for to reduce the fluid-fluid interaction. Do and co-workers have introduced the so-called surface-mediation damping factor to correct the over-prediction for the case of a graphite surface of infinite extent, and this approach has yielded a good description of the adsorption isotherm. In this paper, the effects of the finite size of the graphene layer on the adsorption isotherm and how these would affect the extent of the surface mediation were studied. It was found that this finite-surface model provides a better description of the experimental data for graphitized thermal carbon black of high surface area (i.e. small crystallite size) while the infinite- surface model describes data for carbon black of very low surface area (i.e. large crystallite size).

Managing change and time in dynamic workflow processes

Business environments have become exceedingly dynamic and competitive in recent times. This dynamism is manifested in the form of changing process requirements and time constraints. Workflow technology is currently one of the most promising fields of research in business process automation. However, workflow systems to date do not provide the flexibility necessary to support the dynamic nature of business processes. In this paper we primarily discuss the issues and challenges related to managing change and time in workflows representing dynamic business processes. We also present an analysis of workflow modifications and provide feasibility considerations for the automation of this process.