When decision support systems fail: insights for strategic information systems from Formula

Decision support systems (DSS) are sophisticated tools that increasingly take advantage of big data and are used to design and implement individual - and organization - level strategic decisions . Yet, when organizations excessively rely on their potential the outcome may be decision - making failure, particularly when such tools are applied under high pressure and turbulent conditions. Partial understanding and unidimensional interpretation can prevent learning from failure. Building on a practice perspective, we study an iconic case of strategic failure in Formula 1 racing. Our approach, which integrates the decision maker as well as the organizational and material context , identifies three interrelated sources of strategic failure that are worth investigation for decision - makers using DSS and big data: (1) t he situated nature and affordances of decision - making ; (2) t he distributed nature of cognition in decision - making; and (3) the performativity of the DSS. We outline specific research questions and their implications for firm performance and competitive advantage. Finally, we advance an agenda that can help close timely gaps in strategic IS research

Model checking usage policies

We study usage automata, a formal model for specifying policies on the usage of resources. Usage automata extend finite state automata with some additional features, parameters and guards, that improve their expressivity. We show that usage automata are expressive enough to model policies of real-world applications. We discuss their expressive power, and we prove that the problem of telling whether a computation complies with a usage policy is decidable. The main contribution of this paper is a model checking technique for usage automata. The model is that of usages, i.e. basic processes that describe the possible patterns of resource access and creation. In spite of the model having infinite states, because of recursion and resource creation, we devise a polynomial-time model checking technique for deciding when a usage complies with a usage policy

Compact Millimeter-Wave Bandpass Filters Using Quasi-Lumped Elements in 0.13-um (Bi)-CMOS Technology for 5G Wireless Systems

© 2019 IEEE.A design methodology for a compact millimeter-wave on-chip bandpass filter (BPF) is presented in this paper. Unlike the previously published works in the literature, the presented method is based on quasi-lumped elements, which consists of a resonator with enhanced self-coupling and metal-insulator-metal capacitors. Thus, this approach provides inherently compact designs comparing with the conventional distributed elements-based ones. To fully understand the insight of the approach, simplified LC-equivalent circuit models are developed. To further demonstrate the feasibility of using this approach in practice, the resonator and two compact BPFs are designed using the presented models. All three designs are fabricated in a standard 0.13- \mu \text{m} (Bi)-CMOS technology. The measured results show that the resonator can generate a notch at 47 GHz with the attenuation better than 28 dB due to the enhanced self-coupling. The chip size, excluding the pads, is only 0.096 \times 0.294 mm 2. In addition, using the resonator for BPF designs, the first BPF has one transmission zero at 58 GHz with a peak attenuation of 23 dB. The center frequency of this filter is 27 GHz with an insertion loss of 2.5 dB, while the return loss is better than 10 dB from 26 to 31 GHz. The second BPF has two transmission zeros, and a minimum insertion loss of 3.5 dB is found at 29 GHz, while the return loss is better than 10 dB from 26 GHz to 34 GHz. Also, more than 20-dB stopband attenuation is achieved from dc to 20.5 GHz and from 48 to 67 GHz. The chip sizes of these two BPFs, excluding the pads, are only 0.076\times 0.296 mm 2 and 0.096\times 0.296 mm 2, respectively.Peer reviewe

Comparing rockfall scar volumes and kinematically detachable rock masses

Scenario-based risk assessment for rockfalls, requires assumptions for different scenarios of magnitude (volume). The magnitude of such instabilities is related to the properties of the jointed rock mass, with the characteristics of the existing unfavourably dipping joint sets playing a major role. The critical factors for the determination of the maximum credible rockfall volume in a study site, the Forat Negre in Andorra, are investigated. The results from two previous analyses for the rockfall size distribution at this site are discussed. The first analysis provides the observed size distribution of the rockfall scars, and it is an empirical evidence of past rockfalls. The second one, calculates the kinematically detachable rock masses, indicating hypothetical rockfalls that might occur in the future. The later gives a maximum rockfall volume, which is one order of magnitude higher, because the persistence of the basal planes is overestimated. The tension cracks and lateral planes interrupt systematically the basal planes, exerting a control over their persistence, and restricting the formation of extensive planes and large rockfall failures. Nonetheless, the formation of basal planes across more than one spacings of tension cracks is possible and small step-path failures have been observed too. Concluding, the key factor for the determination of the maximum credible volume at the study-site is the maximum realistic length of the basal planes, penetrating into the rock mass, their spacing, and, if applied, the contribution of the rock bridges to the overall rock mass resistance.Peer ReviewedPostprint (author's final draft

Synthesis of Attributed Feature Models From Product Descriptions: Foundations

Feature modeling is a widely used formalism to characterize a set of products (also called configurations). As a manual elaboration is a long and arduous task, numerous techniques have been proposed to reverse engineer feature models from various kinds of artefacts. But none of them synthesize feature attributes (or constraints over attributes) despite the practical relevance of attributes for documenting the different values across a range of products. In this report, we develop an algorithm for synthesizing attributed feature models given a set of product descriptions. We present sound, complete, and parametrizable techniques for computing all possible hierarchies, feature groups, placements of feature attributes, domain values, and constraints. We perform a complexity analysis w.r.t. number of features, attributes, configurations, and domain size. We also evaluate the scalability of our synthesis procedure using randomized configuration matrices. This report is a first step that aims to describe the foundations for synthesizing attributed feature models

CaSPiS: A Calculus of Sessions, Pipelines and Services

Service-oriented computing is calling for novel computational models and languages with well disciplined primitives for client-server interaction, structured orchestration and unexpected events handling. We present CaSPiS, a process calculus where the conceptual abstractions of sessioning and pipelining play a central role for modelling service-oriented systems. CaSPiS sessions are two-sided, uniquely named and can be nested. CaSPiS pipelines permit orchestrating the flow of data produced by different sessions. The calculus is also equipped with operators for handling (unexpected) termination of the partner’s side of a session. Several examples are presented to provide evidence of the flexibility of the chosen set of primitives. One key contribution is a fully abstract encoding of Misra et al.’s orchestration language Orc. Another main result shows that in CaSPiS it is possible to program a “graceful termination” of nested sessions, which guarantees that no session is forced to hang forever after the loss of its partner

Orchestrating Tuple-based Languages

The World Wide Web can be thought of as a global computing architecture supporting the deployment of distributed networked applications. Currently, such applications can be programmed by resorting mainly to two distinct paradigms: one devised for orchestrating distributed services, and the other designed for coordinating distributed (possibly mobile) agents. In this paper, the issue of designing a pro- gramming language aiming at reconciling orchestration and coordination is investigated. Taking as starting point the orchestration calculus Orc and the tuple-based coordination language Klaim, a new formalism is introduced combining concepts and primitives of the original calculi. To demonstrate feasibility and effectiveness of the proposed approach, a prototype implementation of the new formalism is described and it is then used to tackle a case study dealing with a simplified but realistic electronic marketplace, where a number of on-line stores allow client applications to access information about their goods and to place orders