Alignment within the corporate IT unit: an analysis of software testing and development

Strategic alignment between an organization's business strategy/capabilities and those of its information technology (IT) unit is an extensively researched subject that addresses the issue of fit between business and technology strategies. A key gap in the literature is lack of recognition that underlying this macro level of alignment are other, more granular levels of alignment involving the interdependent subunits within the corporate IT unit. Given the critical interdependencies between development and testing subunits in software engineering, this paper focuses on an alignment model for ensuring that these two functions work together effectively. A development-testing alignment (DTA) model is described, and a case study investigating its value and application is presented. This DTA is decomposed into distinct components for the purposes of theoretical clarity and pragmatic application. The case study analysis uses the model to understand and interpret development-testing alignment in a Fortune 500 company. We found that the development and testing functions were significantly misaligned, and our model identified close to twenty specific aspects that needed to be considered to enhance alignment. These included changes in specificity of scope, governance, resource availability, competencies, and processes. Our analysis shows that the DTA model can be usefully applied for the purpose of understanding tactical alignment between subunits within a corporate IT unit. It also demonstrates that there is value in considering alignment as a dynamic, context-driven, social phenomenon as well as a useful interpretative lens for exploring organizational interactions and interdependencies.     

Identity-based strong designated verifier signature schemes: Attacks and new construction

A strong designated verifier signature scheme makes it possible for a signer to convince a designated verifier that she has signed a message in such a way that the designated verifier cannot transfer the signature to a third party, and no third party can even verify the validity of a designated verifier signature. We show that anyone who intercepts one signature can verify subsequent signatures in Zhang-Mao ID-based designated verifier signature scheme and Lal-Verma ID-based designated verifier proxy signature scheme. We propose a new and efficient ID-based designated verifier signature scheme that is strong and unforgeable. As a direct corollary, we also get a new efficient ID-based designated verifier proxy signature scheme.     

The technology profile inventory: Construction,validation, and application

The technology profile inventory (TPI) measures attitudes toward computers and the internet. We describe the most recent phase of the construction of the TPI. The studies reported refine and validate the instrument, and we present the final version as an Appendix A. Using a new sample of respondents (N = 394), we replicated the three major factors found previously (Confidence, Approval, and Interest). The TPI scores were related to patterns of information technology (IT) usage and also to gender. To demonstrate the practical utility of the TPI we report (1) results linking TPI scores to behavior during an internet search task; (2) test–retest results obtained as part of a cognitive training experiment using action video games; and (3) results showing that attitudes to IT may be modified by a particular experience with information technology.     

Extending metric multidimensional scaling with Bregman divergences

Sum of weighted square distance errors has been a popular way of defining stress function for metric multidimensional scaling (MMDS) like the Sammon mapping. In this paper we generalise this popular MMDS with Bregman divergences, as an example we show that the Sammon mapping can be thought of as a truncated Bregman MMDS (BMMDS) and we show that the full BMMDS improves upon the Sammon mapping on some standard data sets and investigate the reasons underlying this improvement. We then extend a well known family of MMDS, that deploy a strategy of focusing on small distances, with BMMDS and investigate limitations of the strategy empirically. Then an opposite strategy is introduced to create another family of BMMDS that gives increasing mapping quality. A data preprocessing method and a distance matrix preprocessing are introduced.     

Computer-aided development of a real-time program

The refinement calculus is a well-established theory for formal development of imperative program code and is supported by a number of automated tools. Via a detailed case study, this article shows how refinement theory and tool support can be extended for a program with real-time constraints. The approach adapts a timed variant of the refinement calculus and makes corresponding enhancements to a theorem-prover based refinement tool.     

Unsupervised Extraction of Structural Information from High Dimensional Visual Data

We present three unsupervised artificial neural networks for the extraction of structural information from visual data. The ability of each network to represent structured knowledge in a manner easily accessible to human interpretation is illustrated using artificial visual data. These networks are used to collectively demonstrate a variety of unsupervised methods for identifying features in visual data and the structural representation of these features in terms of orientation, temporal and topographical ordering, and stereo disparity.     

Designing a secure e-tender submission protocol

This paper investigates the fundamental difference between a simple e-tender box and a traditional physical tender box, and highlights a series of security traps created by the functional differences. Based on our findings, we have defined the security requirements for an e-tender submission protocol. We also discuss functional limitations of cryptographic technologies. As a result, two secure e-tender submission protocols are proposed which enable a secure e-tender submission. Protocols are assumed to run under the condition that all tendering parties (principal and tenderers) are dishonest players. Our informal and formal security analysis show that these protocols meet their security goals under well known collusion scenarios. Because security is a process not a product, our approach will have broad industry application for developing secure electronic business processes in areas other than e-tendering.

Towards a continuous microfluidic rheometer

In a previous paper we presented a way to measure the rheological properties of complex fluids on a microfluidic chip (Guillot et al., Langmuir 22:6438, 2006). The principle of our method is to use parallel flows between two immiscible fluids as a pressure sensor. In fact, in a such flow, both fluids flow side by side and the size occupied by each fluid stream depends only on both flow rates and on both viscosities. We use this property to measure the viscosity of one fluid knowing the viscosity of the other one, both flow rates and the relative size of both streams in a cross-section. We showed that using a less viscous fluid as a reference fluid allows to define a mean shear rate with a low standard deviation in the other fluid. This method allows us to measure the flow curve of a fluid with less than 250 μL of fluid. In this paper we implement this principle in a fully automated set up which controls the flow rate, analyzes the picture and calculates the mean shear rate and the viscosity of the studied fluid. We present results obtained for Newtonian fluids and complex fluids using this set up and we compare our data with cone and plate rheometer measurements. By adding a mixing stage in the fluidic network we show how this set up can be used to characterize in a continuous way the evolution of the rheological properties as a function of the formulation composition. We illustrate this by measuring the rheological curve of four formulations of polyethylene oxide solution with only 1.3 mL of concentrated polyethylene oxide solution. This method could be very useful in screening processes where the viscosity range and the behavior of the fluid to an applied stress must be evaluated.     

LARS: A learning algorithm for rewriting systems

Whereas there is a number of methods and algorithms to learn regular languages, moving up the Chomsky hierarchy is proving to be a challenging task. Indeed, several theoretical barriers make the class of context-free languages hard to learn. To tackle these barriers, we choose to change the way we represent these languages. Among the formalisms that allow the definition of classes of languages, the one of string-rewriting systems (SRS) has outstanding properties. We introduce a new type of SRS’s, called Delimited SRS (DSRS), that are expressive enough to define, in a uniform way, a noteworthy and non trivial class of languages that contains all the regular languages, , , the parenthesis languages of Dyck, the language of Lukasiewicz, and many others. Moreover, DSRS’s constitute an efficient (often linear) parsing device for strings, and are thus promising candidates in forthcoming applications of grammatical inference. In this paper, we pioneer the problem of their learnability. We propose a novel and sound algorithm (called LARS) which identifies a large subclass of them in polynomial time (but not data). We illustrate the execution of our algorithm through several examples, discuss the position of the class in the Chomsky hierarchy and finally raise some open questions and research directions. This work was supported in part by the IST Program of the European Community, under the PASCAL Network of Excellence, IST-2002-506778. This publication only reflects the authors’ views. Editor: Georgios Paliouras and Yasubumi Sakakibara