Managing sequential ambidexterity in the electronics industry: roles of temporal switching capability and contingent factors

Researchers on organisational ambidexterity have proposed several solutions to address the potential conflicts between exploration activities and exploitation activities. Unlike simultaneous ambidexterity, sequential ambidexterity – defined as temporal switching between exploration and exploitation – has not been examined fully, and the conditions under which this temporal switching can be successful are unclear. This paper proposes the concept of temporal switching capability to better understand the process by which sequential ambidexterity is executed. In addition, we hypothesise that performance effects are contingent upon firm-specific factors: a firm’s business strategy and absorptive capacity. Utilising three sources of data – a secondary database, annual reports and a survey administered to 145 firms in the electronics industry with 10-year observations – we find support for our hypotheses. The results show that the temporal switching capability positively relates to new product performance and that business strategy type and absorptive capacity have moderating effects. The results are meaningful in both theory and practice.     

Innovative techniques in pediatric liver transplantation: reduced-, split- and living-donor related liver transplantation

BACKGROUND: Biological systems that show threshold phenomena are candidates for stochastic resonance as a mechanism to explain what appears to be biovariability. Stochastic resonance is the amplification of weak signals by "noise." OBJECTIVE: This review discusses the areas of contact dermatitis in which threshold events have been documented. The purpose is to point out the mechanism by which stochastic resonance may affect patch test results. METHODS: A literature review technique was used. RESULTS: The recent finding of a neurological influence on contract dermatitis provides a mechanism for stochastic resonance to affect patch test results. CONCLUSION: Stochastic resonance is likely to affect patch test results when more than one patch test result is positive.     

SOA adoption in business networks: do service-oriented architectures really advance inter-organizational integration?

The emergence of the Internet as a global communication infrastructure has dramatically reduced interaction costs within and across organizations, with significant impact on inter-organizational relationships, vertical industry structures, and markets. More recently, service-oriented architectures (SOA) and Web services have introduced the next paradigm shift and foster the idea of dynamic business networks with quick connect and disconnect relationships. However, little research has systematically analyzed how companies leverage SOA to improve their inter-organizational relationships and reshape their business networks. In addition, the mature research stream on inter-organizational information systems (IOS) has not yet sufficiently considered SOA. In order to close this gap, our research seeks to improve the fundamental understanding of how SOA is applied in business networks and how it differs from prior forms of IOS. Using an exploratory research approach, we investigate 33 SOA cases to identify focus areas and patterns of SOA adoption in business networks. Our case analysis builds on a multi-dimensional classification scheme which we derived from prior literature. While our empirical findings do not confirm all promising propositions related to SOA, they underline the specific contribution of SOA compared to prior forms of IOS. We conclude by suggesting five clusters of SOA adoption in the inter-organizational domain, each of those introducing new aspects in the coordination of distributed business networks.     

Solving subgraph isomorphism problems with constraint programming

The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated filtering algorithm to solve this problem within the context of constraint programming. The main idea of the filtering algorithm is to label every node with respect to its relationships with other nodes of the graph, and to define a partial order on these labels in order to express compatibility of labels for subgraph isomorphism. This partial order over labels is used to filter domains. Labelings can also be strengthened by adding information from the labels of neighbors. Such a strengthening can be applied iteratively until a fixpoint is reached. Practical experiments illustrate that our new filtering approach is more effective on difficult instances of scale free graphs than state-of-the-art algorithms and other constraint programming approaches.     

An intelligent system for monitoring and diagnosis of the CO2 capture process

Amine-based carbon dioxide capture has been widely considered as a feasible ideal technology for reducing large-scale CO₂ emissions and mitigating global warming. The operation of amine-based CO₂ capture is a complicated task, which involves monitoring over 100 process parameters and careful manipulation of numerous valves and pumps. The current research in the field of CO₂ capture has emphasized the need for improving CO₂ capture efficiency and enhancing plant performance. In the present study, artificial intelligence techniques were applied for developing a knowledge-based expert system that aims at effectively monitoring and controlling the CO₂ capture process and thereby enhancing CO₂ capture efficiency. In developing the system, the inferential modeling technique (IMT) was applied to analyze the domain knowledge and problem-solving techniques, and a knowledge base was developed on DeltaV Simulate.The expert system helps to enhance CO₂ capture system performance and efficiency by reducing the time required for diagnosis and problem solving if abnormal conditions occur. The expert system can be used as a decision-support tool that helps inexperienced operators control the plant; it can be used also for training novice operators.     

Stability analysis and time-varying walking control for an under-actuated planar biped robot

This paper presents two walking controllers for a planar biped robot with unactuated point feet. The control is based on the tracking of reference motions expressed as a function of time. First, the reference motions are adapted at each step in order to create a hybrid zero dynamic (HZD) system. Next, the stability of the walking gait under closed-loop control is evaluated with the linearization of the restricted Poincaré map of the HZD. When the controlled outputs are selected to be the actuated coordinates, most periodic walking gaits for this robot are unstable, that is, the eigenvalues of the linearized Poincaré map (ELPM) is larger than one. Therefore, two control strategies are explored to produce stable walking. The first strategy uses an event-based feedback controller to modify the ELPM and the second one is based on the choice of controlled outputs. The stability analysis show that, for the same robot and for the same reference trajectory, the stability of the walking (or ELPM) can be modified by some pertinent choices of controlled outputs. Moreover, by studying some walking characteristics of many stable cases, a necessary condition for stable walking is proposed. It is that the height of swing foot is nearly zero at the desired moment of impact. Based on this condition, the duration of the step is almost constant in presence of initial error, so a method for choosing controlled outputs for the second controller is given. By using this method, two stable domains for the controlled outputs selection are obtained.     

Designing adaptive learning itineraries using features modelling and swarm intelligence

In this paper, Bayesian network (BN) and ant colony optimization (ACO) techniques are combined in order to find the best path through a graph representing all available itineraries to acquire a professional competence. The combination of these methods allows us to design a dynamic learning path, useful in a rapidly changing world. One of the most important advances in this work, apart from the variable amount of pheromones, is the automatic processing of the learning graph. This processing is carried out by the learning management system and helps towards understanding the learning process as a competence-oriented itinerary instead of a stand-alone course. The amount of pheromones is calculated by taking into account the results acquired in the last completed course in relation to the minimum score required and by feeding this into the learning tree in order to obtain a relative impact on the path taken by the student. A BN is used to predict the probability of success, by taking historical data and student profiles into account. Usually, these profiles are defined beforehand; however, in our approach, some characteristics of these profiles, such as the level of knowledge, are classified automatically through supervised and/or unsupervised learning. By using ACO and BN, a fitness function, responsible for automatically selecting the next course in the learning graph, is defined. This is done by generating a path which maximizes the probability of each user??s success on the course. Therefore, the path can change in order to adapt itself to learners?? preferences and needs, by taking into account the pedagogical weight of each learning unit and the social behaviour of the system.