Analysing IOIS adoption through structural contradictions

Despite extensive research and practitioner literature on inter-organizational information systems (IOIS), our understanding of non-adoption still has some under-explored issues. This paper offers an explanation of non-adoption that focuses on the potential structural changes that IOIS adoption entails; in particular, we contend that the contradictions between the initial social structure and the structure enacted in the use of an IOIS can be a cause of non-adoption. This paper analyses adoption from a logic of opposition where non-adoption occurs because forces of transformation are offset by forces of persistence. Relying on the concepts of social structure, duality of structure, and structural contradiction from Structuration theory, we develop a framework that categorizes the underlying social structure where an IOIS is to be adopted, and formulate some theoretical propositions. From a practitioner perspective, this paper contends that the fact that IOIS management uncovers the contradictions in the social structure that result from IOIS adoption can help avoid dead ends. Accordingly, this framework, which can be used as a coarse-grained picture for anticipating adoption problems, can inform managers when devising an IOIS implementation strategy.     

Modeling of the intrinsic stress effect on the resonant frequency of NEMS resonators integrated by beams with variable cross-section

Nano-electro-mechanical systems (NEMS) resonators integrated by a double clamped beam with variable cross-section are used in several applications such as chemical and biological detectors, high-frequency filters, and signal processing. The structure of these resonators can experience intrinsic stresses produced during their fabrication process. We present an analytical model to estimate the first bending resonant frequency of NEMS resonators based on a double clamped beam with three cross-sections, which considers the intrinsic stress effect on the resonant structure. This model is obtained using the Rayleigh and Macaulay methods, as well as the Euler–Bernoulli beam theory. We applied the analytical model to a silicon carbide (SiC) resonator of 186 nm thickness reported in the literature. This resonator has a total length ranking from 80 to 258 μm and is subjected to a tensile intrinsic stress close to 110 MPa. Results from this model show good agreement with experimental results. The analytic frequencies have a maximum relative difference less than 6.3% respect to the measured frequencies. The tensile intrinsic stress on the resonant structure causes a significantly increase on its bending resonant frequency. The proposed model provides an insight into the study of the intrinsic stress influence on the resonant frequency of this nanostructure. In addition, this model can estimate the frequency shift due to the variations of the resonator geometrical parameters.     

Assessment methodology for software process improvement in small organizations

ContextDiagnosing processes in a small company requires process assessment practices which give qualitative and quantitative results; these should offer an overall view of the process capability. The purpose is to obtain relevant information about the running of processes, for use in their control and improvement. However, small organizations have some problems in running process assessment, due to their specific characteristics and limitations.ObjectiveThis paper presents a methodology for assessing software processes which assist the activity of software process diagnosis in small organizations. There is an attempt to address issues such as the fact that: (i) process assessment is expensive and typically requires major company resources and (ii) many light assessment methods do not provide information that is detailed enough for diagnosing and improving processes.MethodTo achieve all this, the METvalCOMPETISOFT assessment methodology was developed. This methodology: (i) incorporates the strategy of internal assessments known as rapid assessment, meaning that these assessments do not take up too much time or use an excessive quantity of resources, nor are they too rigorous and (ii) meets all the requirements described in the literature for an assessment proposal which is customized to the typical features of small companies.ResultsThis paper also describes the experience of the application of this methodology in eight small software organizations that took part in the COMPETISOFT project. The results obtained show that this approach allows us to obtain reliable information about the strengths and weaknesses of software processes, along with information to companies on opportunities for improvement.ConclusionThe assessment methodology proposed sets out the elements needed to assist with diagnosing the process in small organizations step-by-step while seeking to make its application economically feasible in terms of resources and time. From the initial application it may be seen that this assessment methodology can be useful, practical and suitable for diagnosing processes in this type of organizations.     

A framework for the definition of metamodels for Computer-Aided Software Engineering tools

Computer-Aided Software Engineering (CASE) tools support modeling-related activities in development projects. Given the variety of tools and functionalities, it is quite common to work with several tools in the same project. However, data cannot usually be exchanged between these tools without loss of information. Recent approaches address this model interchange problem using metamodels to characterize the involved information and transformations to export/import it. Nevertheless, most of these solutions focus on the abstract syntax of models. They fail to consider aspects such as the presentation of models or tool-specific information, which are either disregarded or represented in ad-hoc ways that make difficult their processing. In order to overcome these limitations, this paper introduces a framework to define metamodels of CASE tools and a process to carry out the model interchange using them. The proposed metamodels have a modular organization with several internal metamodels. Each of them is aimed at describing some specific information about content, structure and presentation for both models and tools. The paper illustrates this approach with a case study used for comparison with existing works for this problem.     

Detecting skin in face recognition systems: A colour spaces study

Skin colour detection is a technique very used in most of face detectors to find faces in images or videos. However, there is not a common opinion about which colour space is the best choice to do this task. Therefore, the motivation for our study is to discover which colour model is the best option to build an efficient face detector which can be embedded in a functional face recognition system. We have studied 10 of the most common and used colour spaces doing different comparisons among them, in order to know which one is the best option for human skin colour detection. In concrete, we have studied the models: RGB, CMY, YUV, YIQ, YPbPr, YCbCr, YCgCr, YDbDr, HSV—or HSI—and CIE-XYZ. To make the comparison among them, we have used 15 truth images where the skin colour of a face is clearly separated from the rest of the image (background, eyes, lips, hair, etc.). Thus we can compare at level pixel each colour model, doing a detailed study of each format. We present the final conclusions comparing different results, such as: right detections, false positives and false negatives for each colour space. According to the obtained results, the most appropriate colour spaces for skin colour detection are HSV model (the winner in our study), and the models YCgCr and YDbDr.     

Influence of personality and individual abilities on the sense of presence experienced in anxiety triggering virtual environments

In the literature, there are few studies of the human factors involved in the engagement of presence. The present study aims to investigate the influence of five user characteristics – test anxiety, spatial intelligence, verbal intelligence, personality and computer experience – on the sense of presence. This is the first study to investigate the influence of spatial intelligence on the sense of presence, and the first to use an immersive virtual reality system to investigate the relationship between users’ personality characteristics and presence. The results show a greater sense of presence in test anxiety environments than in a neutral environment. Moreover, high test anxiety students feel more presence than their non-test anxiety counterparts. Spatial intelligence and introversion also influence the sense of presence experienced by high test anxiety students exposed to anxiety triggering virtual environments. These results may help to identify new groups of patients likely to benefit from virtual reality exposure therapy.     

Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming

This paper addresses the non-preemptive single machine scheduling problem to minimize total tardiness. We are interested in the online version of this problem, where orders arrive at the system at random times. Jobs have to be scheduled without knowledge of what jobs will come afterwards. The processing times and the due dates become known when the order is placed. The order release date occurs only at the beginning of periodic intervals. A customized approximate dynamic programming method is introduced for this problem. The authors also present numerical experiments that assess the reliability of the new approach and show that it performs better than a myopic policy.     

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.     

Network interfaces for programmable NICs and multicore platforms

The availability of multicore processors and programmable NICs, such as TOEs (TCP/IP Offloading Engines), provides new opportunities for designing efficient network interfaces to cope with the gap between the improvement rates of link bandwidths and microprocessor performance. This gap poses important challenges related with the high computational requirements associated to the traffic volumes and wider functionality that the network interface has to support. This way, taking into account the rate of link bandwidth improvement and the ever changing and increasing application demands, efficient network interface architectures require scalability and flexibility. An opportunity to reach these goals comes from the exploitation of the parallelism in the communication path by distributing the protocol processing work across processors which are available in the computer, i.e. multicore microprocessors and programmable NICs.Thus, after a brief review of the different solutions that have been previously proposed for speeding up network interfaces, this paper analyzes the onloading and offloading alternatives. Both strategies try to release host CPU cycles by taking advantage of the communication workload execution in other processors present in the node. Nevertheless, whereas onloading uses another general-purpose processor, either included in a chip multiprocessor (CMP) or in a symmetric multiprocessor (SMP), offloading takes advantage of processors in programmable network interface cards (NICs). From our experiments, implemented by using a full-system simulator, we provide a fair and more complete comparison between onloading and offloading. Thus, it is shown that the relative improvement on peak throughput offered by offloading and onloading depends on the rate of application workload to communication overhead, the message sizes, and on the characteristics of the system architecture, more specifically the bandwidth of the buses and the way the NIC is connected to the system processor and memory. In our implementations, offloading provides lower latencies than onloading, although the CPU utilization and interrupts are lower for onloading. Taking into account the conclusions of our experimental results, we propose a hybrid network interface that can take advantage of both, programmable NICs and multicore processors.