Service integrators in business networks—the importance of relationship values

To realise the potentials of CRM (customer relationship management), relationship-specific processes need to be designed and implemented in companies. This is all the more important and complicated in business networks where two or more actors collaborate to serve the customers. A good collaboration within business networks is the basis for understanding the customer process and identifying customer needs. But, even in these days of customer orientation, transaction orientation is still a matter of strong interest, and the following questions remain to be answered: What is the difference between relationship-oriented processes and transaction-oriented processes, and how can relationship-oriented processes be designed for a business network? The authors give first answers to both questions by using a systematic, goal-oriented specialisation of generic actions. To give an example, one relationship-oriented process will be designed and specified for a certain customer process in the course of this paper.     

A fully integrated 1‐in. AMOLED display using current feedback based on a five‐mask LTPS CMOS process

Abstract— In the past, a five‐mask LTPS CMOS process requiring only one single ion‐doping step was used. Based on that process, all necessary components for the realization of a fully integrated AMOLED display using a 3T1C current‐feedback pixel circuit has recently been developed. The integrated data driver is based on a newly developed LTPS operational amplifier, which does not require any compensation for Vth or mobility variations. Only one operational amplifier per column is used to perform digital‐to‐analog conversion as well as current control. In order to achieve high‐precision analog behavior, the operational amplifier is embedded in a switched capacitor network. In addition to circuit verification by simulation and analytic analysis, a 1‐in. fully integrated AMOLED demonstrator was successfully built. To the best of the authors' knowledge, this is the first implementation of a fully integrated AMOLED display with current feedback.     

In situ exploration of large dynamic networks

The analysis of large dynamic networks poses a challenge in many fields, ranging from large bot-nets to social networks. As dynamic networks exhibit different characteristics, e.g., being of sparse or dense structure, or having a continuous or discrete time line, a variety of visualization techniques have been specifically designed to handle these different aspects of network structure and time. This wide range of existing techniques is well justified, as rarely a single visualization is suitable to cover the entire visual analysis. Instead, visual representations are often switched in the course of the exploration of dynamic graphs as the focus of analysis shifts between the temporal and the structural aspects of the data. To support such a switching in a seamless and intuitive manner, we introduce the concept of in situ visualization--a novel strategy that tightly integrates existing visualization techniques for dynamic networks. It does so by allowing the user to interactively select in a base visualization a region for which a different visualization technique is then applied and embedded in the selection made. This permits to change the way a locally selected group of data items, such as nodes or time points, are shown--right in the place where they are positioned, thus supporting the user's overall mental map. Using this approach, a user can switch seamlessly between different visual representations to adapt a region of a base visualization to the specifics of the data within it or to the current analysis focus. This paper presents and discusses the in situ visualization strategy and its implications for dynamic graph visualization. Furthermore, it illustrates its usefulness by employing it for the visual exploration of dynamic networks from two different fields: model versioning and wireless mesh networks.     

Interactive High‐Quality Visualization of Higher‐Order Finite Elements

Higher‐order finite element methods have emerged as an important discretization scheme for simulation. They are increasingly used in contemporary numerical solvers, generating a new class of data that must be analyzed by scientists and engineers. Currently available visualization tools for this type of data are either batch oriented or limited to certain cell types and polynomial degrees. Other approaches approximate higher‐order data by resampling resulting in trade‐offs in interactivity and quality. To overcome these limitations, we have developed a distributed visualization system which allows for interactive exploration of non‐conforming unstructured grids, resulting from space‐time discontinuous Galerkin simulations, in which each cell has its own higher‐order polynomial solution. Our system employs GPU‐based raycasting for direct volume rendering of complex grids which feature non‐convex, curvilinear cells with varying polynomial degree. Frequency‐based adaptive sampling accounts for the high variations along rays. For distribution across a GPU cluster, the initial object‐space partitioning is determined by cell characteristics like the polynomial degree and is adapted at runtime by a load balancing mechanism. The performance and utility of our system is evaluated for different aeroacoustic simulations involving the propagation of shock fronts.     

Comparing notions of randomness

It is an open problem in the area of effective (algorithmic) randomness whether Kolmogorov-Loveland randomness coincides with Martin-Löf randomness. Joe Miller and André Nies suggested some variations of Kolmogorov-Loveland randomness to approach this problem and to provide a partial solution. We show that their proposed notion of injective randomness is still weaker than Martin-Löf randomness. Since in this proof some of the ideas we use are clearer, we also show the weaker theorem that permutation randomness is weaker than Martin-Löf randomness.     

Spatially Varying Mixtures Incorporating Line Processes for Image Segmentation

Spatially varying mixture models are characterized by the dependence of their mixing proportions on location (contextual mixing proportions) and they have been widely used in image segmentation. In this work, Gauss-Markov random field (MRF) priors are employed along with spatially varying mixture models to ensure the preservation of region boundaries in image segmentation. To preserve region boundaries, two distinct models for a line process involved in the MRF prior are proposed. The first model considers edge preservation by imposing a Bernoulli prior on the normally distributed local differences of the contextual mixing proportions. It is a discrete line process model whose parameters are computed by variational inference. The second model imposes Gamma prior on the Student’s-t distributed local differences of the contextual mixing proportions. It is a continuous line process whose parameters are also automatically estimated by the Expectation-Maximization (EM) algorithm. The proposed models are numerically evaluated and two important issues in image segmentation by mixture models are also investigated and discussed: the constraints to be imposed on the contextual mixing proportions to be probability vectors and the MRF optimization strategy in the frameworks of the standard and variational EM algorithm.     

Active learning for extended finite state machines

We present a black-box active learning algorithm for inferring extended finite state machines (EFSM)s by dynamic black-box analysis. EFSMs can be used to model both data flow and control behavior of software and hardware components. Different dialects of EFSMs are widely used in tools for model-based software development, verification, and testing. Our algorithm infers a class of EFSMs called register automata. Register automata have a finite control structure, extended with variables (registers), assignments, and guards. Our algorithm is parameterized on a particular theory, i.e., a set of operations and tests on the data domain that can be used in guards.Key to our learning technique is a novel learning model based on so-called tree queries. The learning algorithm uses tree queries to infer symbolic data constraints on parameters, e.g., sequence numbers, time stamps, identifiers, or even simple arithmetic. We describe sufficient conditions for the properties that the symbolic constraints provided by a tree query in general must have to be usable in our learning model. We also show that, under these conditions, our framework induces a generalization of the classical Nerode equivalence and canonical automata construction to the symbolic setting. We have evaluated our algorithm in a black-box scenario, where tree queries are realized through (black-box) testing. Our case studies include connection establishment in TCP and a priority queue from the Java Class Library.     

The Semantic Web: Collective Intelligence on the Web

The World Wide Web has turned hypertext into a success story by enabling world-wide sharing of unstructured information and informal knowledge. The Semantic Web targets the sharing of structured information and formal knowledge pursuing objectives of achieving collective intelligence on the Web. Germane to the structure of the Semantic Web is a layering and standardization of concerns. These concerns are reflected by an architecture of the Semantic Web that we present through a common use case. Semantic Web data for the use case is now found on the Web and is part of a quickly growing set of Semantic Web resources available for formal processing.     

Fuzzy-Logik basierte Verarbeitung von Expertenregeln

Zusammenfassung In diesem Beitrag wird aufgezeigt, wie in den unter dem Namen Fuzzy Control bekannten Steuerungsalgorithmen Expertenregeln mittels Fuzzy-Variablen formuliert, mit Fuzzy-Operatoren verknüpft und in aktuellen Situationen verarbeitet werden. Häufig erweisen sich in der Praxis die recht einfach konstruierten Fuzzy-Controller den auf der klassischen Mathematik basierenden Steuerungsverfahren als überlegen, da sie sich leicht auf modifizierte Aufgabenstellungen anpassen lassen und eine hohe Stabilität aufweisen, die sich beim Weglassen einiger Regeln zwar verschlechtert, aber zumeist nicht versagt. Dank der Entwicklung sogenannter Fuzzy-Chips lassen sich diese Fuzzy Control-Verfahren schnell und ohne großen Rechenaufwand durchführen. Desweiteren wird untersucht, ob und wie diese Fuzzy-Logik-Algorithmen auf nicht-technische Expertensyste-me übertragen werden können. Da hier zumeist einmalige Entscheidungen getroffen werden müssen, ist größere Sorgfalt auf die Formulierung der Regeln und deren Verknüpfungen zu legen.