Reaction engineering studies in a polytropic fixed-bed reactor over a highly active and selective catalyst for oxidative methane coupling

The oxidative coupling of methane (OCM) was carried out in a polytropic fixed-bed reactor applying a Zr/La/Sr catalyst developed by the Neste company. Over this catalyst the OCM reaction follows a complex reaction scheme which includes primary parallel reaction steps to CO, CO₂ and C₂H₆ and consecutive reactions of ethane to ethylene or CO_x. Yield of higher hydrocarbons C₂₊ obtained with this catalyst strongly depended on reaction conditions, i.e. low partial pressures of methane and oxygen obtained by diluting the feed gas with nitrogen and high reaction temperatures promoted C₂₊ selectivity and yield. The maximum yield amounted to 21.4% (20 Vol.-% CH₄, 9 Vol.-% O₂, 71 Vol.-% N₂, T = 860°C; X_CH4 = 41.8%, S = 52.5%). This result belongs to the highest yields reported in the open literature.     

N2O catalytic decomposition over various spinel-type oxides

Various spinel-type catalysts AB₂O₄ (where A = Mg, Ca, Mn, Co, Ni, Cu, Cr, Fe, Zn and B = Cr, Fe, Co) were prepared and characterized by XRD, BET, TEM and FESEM-EDS. The performance of these catalysts towards the decomposition of N₂O to N₂ and O₂ was evaluated in a temperature programmed reaction (TPR) apparatus in the absence and the presence of oxygen. Spinel-type oxides containing Co at the B site were found to provide the best activity. The half conversion temperature of nitrous oxide over the MgCo₂O₄ catalyst was 440 °C and 470 °C in the absence and presence of oxygen, respectively (GHSV = 80,000 h⁻¹).

On the grounds of temperature programmed oxygen desorption (TPD) analyses as well as of reactive runs, the prevalent activity of the MgCo₂O₄ catalyst could be explained by its higher concentration of suprafacial, weakly chemisorbed oxygen species, whose related vacancies contribute actively to nitrous oxide catalytic decomposition. This indicates the way for the development of new, more active catalysts, possibly capable of delivering at low temperatures amounts of these oxygen species even higher than those characteristic of MgCo₂O₄.     

Visual search tree profiling

Understanding how the search space is explored for a given constraint problem – and how it changes for different models, solvers or search strategies – is crucial for efficient solving. Yet programmers often have to rely on the crude aggregate measures of the search that are provided by solvers, or on visualisation tools that can show the search tree, but do not offer sophisticated ways to navigate and analyse it, particularly for large trees. We present an architecture for profiling a constraint programming search that is based on a lightweight instrumentation of the solver. The architecture combines a visualisation of the search tree with various tools for convenient navigation and analysis of the search. These include identifying repeated subtrees, high-level abstraction and navigation of the tree, and the comparison of two search trees. The resulting system is akin to a traditional program profiler, which helps the user to focus on the parts of the execution where an improvement to their program would have the greatest effect.     

Knowledge base support for dynamic information system management

Enterprise activities are governed by regulations and laws that are multiple, heterogeneous and not always easy to understand. The arising and/or the modification of these regulations and laws can cause a significant impact in the business context, especially in terms of enterprise information systems adaptation. Currently, there are many methodological and technological tools that facilitate the application of regulations and procedures, but they are not integrated enough to ensure a complete problem management. Therefore, they are not sufficient to support organizations and companies in the management of their business processes. In this paper we propose a methodological and technological solution, able to model, manage, execute and monitor business processes of complex domains. The system allows both the design of an information system and its prototyping as a web application, by the extension of an appropriately selected Business Process Management suite. During both the design and the usage phases of the prototyped information system, it is possible to interface with a knowledge base that contains information about regulations and aspects that characterize the enterprise (organizational chart, tasks, etc.).     

Portability of executable service-oriented processes: metrics and validation

A key promise of process languages based on open standards, such as the Web Services Business Process Execution Language, is the avoidance of vendor lock-in through the portability of processes among runtime environments. Despite the fact that today various runtimes claim to support this language, every runtime implements a different subset, thus hampering portability and locking in their users. It is our intention to improve this situation by enabling the measurement of the portability of executable service-oriented processes. This helps developers to assess their implementations and to decide if it is feasible to invest in the effort of porting a process to another runtime. In this paper, we define several software quality metrics that quantify the degree of portability of an executable, service-oriented process from different viewpoints. When integrated into a development environment, such metrics can help to improve the portability of the outcome. We validate the metrics theoretically with respect to measurement theory and construct validity using two validation frameworks. The validation is complemented with an empirical evaluation of the metrics using a large set of processes coming from several process libraries.     

Search combinators

The ability to model search in a constraint solver can be an essential asset for solving combinatorial problems. However, existing infrastructure for defining search heuristics is often inadequate. Either modeling capabilities are extremely limited or users are faced with a general-purpose programming language whose features are not tailored towards writing search heuristics. As a result, major improvements in performance may remain unexplored. This article introduces search combinators, a lightweight and solver-independent method that bridges the gap between a conceptually simple modeling language for search (high-level, functional and naturally compositional) and an efficient implementation (low-level, imperative and highly non-modular). By allowing the user to define application-tailored search strategies from a small set of primitives, search combinators effectively provide a rich domain-specific language (DSL) for modeling search to the user. Remarkably, this DSL comes at a low implementation cost to the developer of a constraint solver. The article discusses two modular implementation approaches and shows, by empirical evaluation, that search combinators can be implemented without overhead compared to a native, direct implementation in a constraint solver.     

View-based propagator derivation

When implementing a propagator for a constraint, one must decide about variants: When implementing min, should one also implement max? Should one implement linear constraints both with unit and non-unit coefficients? Constraint variants are ubiquitous: implementing them requires considerable (if not prohibitive) effort and decreases maintainability, but will deliver better performance than resorting to constraint decomposition. This paper shows how to use views to derive propagator variants, combining the efficiency of dedicated propagator implementations with the simplicity and effortlessness of decomposition. A model for views and derived propagators is introduced. Derived propagators are proved to be perfect in that they inherit essential properties such as correctness and domain and bounds consistency. Techniques for systematically deriving propagators such as transformation, generalization, specialization, and type conversion are developed. The paper introduces an implementation architecture for views that is independent of the underlying constraint programming system. A detailed evaluation of views implemented in Gecode shows that derived propagators are efficient and that views often incur no overhead. Views have proven essential for implementing Gecode, substantially reducing the amount of code that needs to be written and maintained.     

Haptic two-finger contact with textiles

Real-time cloth simulation involves many computational challenges to be solved, particularly in the context of haptic applications, where high frame rates are necessary for obtaining a satisfying experience. In this paper, we present an interactive cloth simulation system that offers a compromise between a realistic physics-based simulation of fabrics and a haptic application meeting high requirements in terms of computation speed. Our system allows the user to interact with the fabric using two fingers. The required performance of the system is achieved by introducing an intermediate layer responsible for the simulation of the small part of the surface being in contact with the fingers. Additionally we separate the possible contact situations into different cases, each being individually handled by a specialised contact algorithm.

Designing an extensible architecture for Personalized Ambient Information

Ambient displays provide us with information in the background of our awareness. However, as each user has individual wishes and needs of how, which and when information is presented, the acceptance of ambient displays is low.In this paper we introduce an extensible architecture for personalized ambient information.We employ a notification system to extend the capability of a fixture to display more than one variable. Multiple variables can be updated by multiple information providers. Thereby, our architecture covers a broader spectrum of notifications from alarms to ambient information.We evaluate our concept within a dual-task experiment in comparison to preset notifications. The results show a level of self-interruption which is significantly lower than using preset notifications. Therefore our approach outperforms preset notifications and moves ambient displays closer to secondary displays in human–computer interaction.     

Negotiating SLAs-An Approach for a Generic Negotiation Framework for WS-Agreement

The current Web Services Agreement specification draft proposes a simple request-response protocol for agreement creation only addressing bilateral offer exchanges. This paper proposes a framework augmenting this WS-Agreement to enable negotiations according to a variety of bilateral and multilateral negotiation protocols. The framework design is based on a thorough analysis of taxonomies for negotiations from the literature in order to allow for capturing a variety of different negotiation models within a single, WS-Agreement compatible, framework. In order to provide for the intended flexibility, the proposed protocol takes a two-stage approach: a meta-protocol is conducted among interested parties to agree on a common negotiation protocol first before the real negotiation is carried out in the second step due to the protocol established in the first step.