A framework for virtual organization requirements

Virtual organizations (VOs) are formed by an alliance of organizations linked by a partnership for dealing with emerging challenges. Information and communication technologies play a fundamental role facilitating cooperation, communication and collaboration among the VO members. The formal identification and representation of Requirements Engineering (RE) for one organization have been researched to a large extent along with several elicitation techniques. However, these techniques are not adequate for covering the major challenges of RE for VO. We explore the work done in the management and RE fields to propose a model-based framework for eliciting VOs’ requirements. The goal is to analyze the VO from two points of view: border (intra-organizational, inter-organizational and extra-organizational) and abstract (intentional, organizational and operational). This article includes the framework validation with a case study and a transformation process to develop partial Business Process Diagram from the intentional models.     

Stability of Local On‐Ramp Metering Control Laws

A framework for stability analysis of local on‐ramp metering control strategies based on the cell transmission model is presented. Within this framework, it is possible to formulate Lyapunov and input‐state stability results for on‐ramp metering control strategies in an open section of highway with on‐ramps. Using this analysis, recommendations for the design of on‐ramp metering control laws set points are derived. Two examples on the use of such analysis are presented. One deals with the stability analysis of a local on‐ramp metering control law and the other with the design of a disturbance observer that, used in combination with the local on‐ramp metering control law, provides a more robust response to traffic regulation. Simulation results are included that confirm the possibility of using this framework to test the impact of local on‐ramp metering control strategies.     

The effect of price promotions on consumer shopping behavior across online and offline channels: differences between frequent and non-frequent shoppers

Information Systems and e-Business Management - This study evaluates the differential effect of price promotions on brand choice across the offline and online channels of a grocery retailer. We use...     

Semantic-based authorization architecture for Grid

There are a few issues that still need to be covered regarding security in the Grid area. One of them is authorization where there exist good solutions to define, manage and enforce authorization policies in Grid scenarios. However, these solutions usually do not provide Grid administrators with semantic-aware components closer to the particular Grid domain and easing different administration tasks such as conflict detection or resolution. This paper defines a proposal based on Semantic Web to define, manage and enforce security policies in a Grid scenario. These policies are defined by means of semantic-aware rules which help the administrator to create higher-level definitions with more expressiveness. These rules also permit performing added-value tasks such as conflict detection and resolution, which can be of interest in medium and large scale scenarios where different administrators define the authorization rules that should be followed before accessing a resource in the Grid. The proposed solution has been also tested providing some reasonable response times in the authorization decision process.     

Proof Pearl: a Formal Proof of Higman��s Lemma in ACL2

Higman??s lemma is an important result in infinitary combinatorics, which has been formalized in several theorem provers. In this paper we present a formalization and proof of Higman??s Lemma in the ACL2 theorem prover. Our formalization is based on a proof by Murthy and Russell, where the key termination argument is justified by the multiset relation induced by a well-founded relation. To our knowledge, this is the first mechanization of this proof.     

Arity and alternation: a proper hierarchy in higher order logics

We study the effect of simultaneously bounding the maximal-arity of the higher-order variables and the alternation of quantifiers in higher-order logics, as to their expressive power on finite structures (or relational databases). Let $\mathit{AA}^i(r,m)$ be the class of (i?+?1)-th order logic formulae where all quantifiers are grouped together at the beginning of the formulae, forming m alternating blocks of consecutive existential and universal quantifiers, and such that the maximal-arity (a generalization of the concept of arity, not just the maximal of the arities of the quantified variables) of the higher-order variables is bounded by r. Note that, the order of the quantifiers in the prefix may be mixed. We show that, for every i?≥?1, the resulting $\mathit{AA}^i(r,m)$ hierarchy of formulae of (i?+?1)-th order logic is proper. This extends a result by Makowsky and Pnueli who proved that the same hierarchy in second-order logic is proper. In both cases the strategy used to prove the results consists in considering formulae which, represented as finite structures, satisfy themselves. As the well known diagonalization argument applies here, this gives rise, for each order i and each level of the $\mathit{AA}^i(r,m)$ hierarchy of arity and alternation, to a class of formulae which is not definable in that level, but which is definable in a higher level of the same hierarchy. We then use a similar argument to prove that the classes of $\Sigma^i_m \cup \Pi^i_m$ formulae in which the higher-order variables of all orders up to i?+?1 have maximal-arity at most r, also induce a proper hierarchy in each higher-order logic of order i?≥?3. It is not known whether the correspondent hierarchy in second-order logic is proper. Using the concept of finite model truth definitions introduced by M. Mostowski, we give a sufficient condition for that to be the case.     

A multi-objective evolutionary algorithm for an effective tuning of?fuzzy logic controllers in?heating, ventilating and air conditioning systems

This paper focuses on the use of multi-objective evolutionary algorithms to develop smartly tuned fuzzy logic controllers dedicated to the control of heating, ventilating and air conditioning systems, energy performance, stability and indoor comfort requirements. This problem presents some specific restrictions that make it very particular and complex because of the large time requirements needed to consider multiple criteria (which enlarge the solution search space) and the long computation time models required in each evaluation.     

An open-source library for the numerical modeling of mass-transfer in solid oxide fuel cells

The generation of direct current electricity using solid oxide fuel cells (SOFCs) involves several interplaying transport phenomena. Their simulation is crucial for the design and optimization of reliable and competitive equipment, and for the eventual market deployment of this technology. An open-source library for the computational modeling of mass-transport phenomena in SOFCs is presented in this article. It includes several multicomponent mass-transport models (i.e. Fickian, Stefan–Maxwell and Dusty Gas Model), which can be applied both within porous media and in porosity-free domains, and several diffusivity models for gases. The library has been developed for its use with OpenFOAM^®, a widespread open-source code for fluid and continuum mechanics. The library can be used to model any fluid flow configuration involving multicomponent transport phenomena and it is validated in this paper against the analytical solution of one-dimensional test cases. In addition, it is applied for the simulation of a real SOFC and further validated using experimental data.Program summaryProgram title: multiSpeciesTransportModelsCatalogue identifier: AEKB_v1_0Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AEKB_v1_0.htmlProgram obtainable from: CPC Program Library, Queen?s University, Belfast, N. IrelandLicensing provisions: GNU General Public LicenseNo. of lines in distributed program, including test data, etc.: 18 140No. of bytes in distributed program, including test data, etc.: 64 285Distribution format: tar.gzProgramming language:: C++Computer: Any x86 (the instructions reported in the paper consider only the 64 bit case for the sake of simplicity)Operating system: Generic Linux (the instructions reported in the paper consider only the open-source Ubuntu distribution for the sake of simplicity)Classification: 12External routines: OpenFOAM® (version 1.6-ext) (http://www.extend-project.de)Nature of problem: This software provides a library of models for the simulation of the steady state mass and momentum transport in a multi-species gas mixture, possibly in a porous medium. The software is particularly designed to be used as the mass-transport library for the modeling of solid oxide fuel cells (SOFC). When supplemented with other sub-models, such as thermal and charge-transport ones, it allows the prediction of the cell polarization curve and hence the cell performance.Solution method: Standard finite volume method (FVM) is used for solving all the conservation equations. The pressure-velocity coupling is solved using the SIMPLE algorithm (possibly adding a porous drag term if required). The mass transport can be calculated using different alternative models, namely Fick, Maxwell–Stefan or dusty gas model. The code adopts a segregated method to solve the resulting linear system of equations. The different regions of the SOFC, namely gas channels, electrodes and electrolyte, are solved independently, and coupled through boundary conditions.Restrictions: When extremely large species fluxes are considered, current implementation of the Neumann and Robin boundary conditions do not avoid negative values of molar and/or mass fractions, which finally end up with numerical instability. However this never happened in the documented runs. Eventually these boundary conditions could be reformulated to become more robust.Running time: From seconds to hours depending on the mesh size and number of species. For example, on a 64 bit machine with Intel Core Duo T8300 and 3 GBytes of RAM, the provided test run requires less than 1 second.