On governing collaborative Information Technology (IT) : a relational perspective

Organizations today invest in collaborative IT to engage in collaborative alliances to sustain or improve their competitive positions. Effective use of this collaborative IT in an alliance requires a deeper understanding of their governance structures. This effort is to ensure the sustainability of these alliances. Through the relational view of the firm, we suggest relational lateral IT-steering committees, relational IT operational committees, and relational IT performance management systems as IT governance structures for collaborative alliances. We then incorporate these structures, develop a model for approaches to governing collaborative IT, and evaluate the effectiveness for such governance structures in the IT-dependent alliances. We suggest that IT governance efforts of an alliance should contribute to their collaborative rent. We also suggest that the collaborative rent of an alliance would relate to the business value of its alliance partners. Field survey data containing 192 responses indicates a positive influence of the suggested IT governance efforts of the alliance on the collaborative rent of the alliance. The results also suggest a positive impact of the collaborative rent of the alliance on the business value of the alliance partners.

An ensemble method for predicting subnuclear localizations from primary protein structures

Background Predicting protein subnuclear localization is a challenging problem. Some previous works based on non-sequence information including Gene Ontology annotations and kernel fusion have respective limitations. The aim of this work is twofold: one is to propose a novel individual feature extraction method; another is to develop an ensemble method to improve prediction performance using comprehensive information represented in the form of high dimensional feature vector obtained by 11 feature extraction methods. Methodology/Principal Findings A novel two-stage multiclass support vector machine is proposed to predict protein subnuclear localizations. It only considers those feature extraction methods based on amino acid classifications and physicochemical properties. In order to speed up our system, an automatic search method for the kernel parameter is used. The prediction performance of our method is evaluated on four datasets: Lei dataset, multi-localization dataset, SNL9 dataset and a new independent dataset. The overall accuracy of prediction for 6 localizations on Lei dataset is 75.2% and that for 9 localizations on SNL9 dataset is 72.1% in the leave-one-out cross validation, 71.7% for the multi-localization dataset and 69.8% for the new independent dataset, respectively. Comparisons with those existing methods show that our method performs better for both single-localization and multi-localization proteins and achieves more balanced sensitivities and specificities on large-size and small-size subcellular localizations. The overall accuracy improvements are 4.0% and 4.7% for single-localization proteins and 6.5% for multi-localization proteins. The reliability and stability of our classification model are further confirmed by permutation analysis. Conclusions It can be concluded that our method is effective and valuable for predicting protein subnuclear localizations. A web server has been designed to implement the proposed method. It is freely available at http://bioinformatics.awowshop.com/snlpr​ed_page.php.

Data requirements and graph data structures for a multi-modal, multi-objective trip planner

Traffic congestion has a significant impact on the economy and environment. Encouraging the use of multimodal transport (public transport, bicycle, park’n’ride, etc.) has been identified by traffic operators as a good strategy to tackle congestion issues and its detrimental environmental impacts. A multi-modal and multi-objective trip planner provides users with various multi-modal options optimised on objectives that they prefer (cheapest, fastest, safest, etc) and has a potential to reduce congestion on both a temporal and spatial scale. The computation of multi-modal and multi-objective trips is a complicated mathematical problem, as it must integrate and utilize a diverse range of large data sets, including both road network information and public transport schedules, as well as optimising for a number of competing objectives, where fully optimising for one objective, such as travel time, can adversely affect other objectives, such as cost. The relationship between these objectives can also be quite subjective, as their priorities will vary from user to user. This paper will first outline the various data requirements and formats that are needed for the multi-modal multi-objective trip planner to operate, including static information about the physical infrastructure within Brisbane as well as real-time and historical data to predict traffic flow on the road network and the status of public transport. It will then present information on the graph data structures representing the road and public transport networks within Brisbane that are used in the trip planner to calculate optimal routes. This will allow for an investigation into the various shortest path algorithms that have been researched over the last few decades, and provide a foundation for the construction of the Multi-modal Multi-objective Trip Planner by the development of innovative new algorithms that can operate the large diverse data sets and competing objectives.

Creating and expressing : information as-it-is-experienced

Music and dance are art forms that involve a full mind-body experience, integrating the cognitive, affective and kinesthetic domains. To engage in creating music and dance is to use information to express oneself and communicate. In this chapter I explore the information experience of two distinct groups: those who compose music for an audience, and those who dance socially with a partner. For the composer, information sources can be a stimulus for creation. Sounds, feelings, moods, images, ideas and life experiences can trigger a creative idea. These ideas are shaped by existing musical styles and structures, and by the composer’s personal aesthetic. The intention of the composer is to communicate their expressive ideas to an audience. For the social dancer, information sources are those used to communicate with a partner. There is no intention to perform for an audience. A social dancer aims to express the music and style of the dance while creating a strong connection with their partner. Information sources include the music, the partner’s body, the emotions generated by the dance, the position of other couples on the floor and the feeling of the floor. Use of information in the arts is an under-researched experience. Most information studies are based on the assumption that information is documentary and codified. Subjective and affective information is rarely recognised and legitimised. Information-as-it-is-experienced through creative practice such as music and dance is holistic in acknowledging mind, body and spirit as well as traditional documentary forms of information. This chapter draws on empirical research to illustrate experiencing information as creating and expressing.

On governance structures for cloud resources and assessing their effectiveness

This research suggests information technology (IT) governance structures to manage cloud computing resources. The interest in acquiring IT resources as a utility from the cloud is gaining momentum. Cloud computing resources present organizations with opportunities to manage their IT expenditure on an ongoing basis, and are providing organizations access to modern IT resources to innovate and manage their continuity. However, cloud computing resources are no silver bullet. Organizations would need to have appropriate governance structures and policies in place to manage the cloud resources. The subsequent decisions from these governance structures will ensure effective management of cloud resources. This management will facilitate a better fit of cloud resources into organizations existing processes to achieve business (process-level) and financial (firm-level) objectives. Using a triangulation approach, we suggest four possible governance structures for managing the cloud computing resources. These structures are a chief cloud officer, a cloud management committee, a cloud service facilitation centre, and a cloud relationship centre. We also propose that these governance structures would relate to organizations cloud-related business objectives directly and indirectly to cloud-related financial objectives. Perceptive field survey data from actual and prospective cloud service adopters confirmed that the suggested structures would contribute directly to cloud-related business objectives and indirectly to cloud-related financial objectives.

Differentiation of isomeric N-glycan structures by normal-phase liquid chromatography-MALDI-TOF/TOF tandem mass spectrometry

The detailed characterization of protein N-glycosylation is very demanding given the many different glycoforms and structural isomers that can exist on glycoproteins. Here we report a fast and sensitive method for the extensive structure elucidation of reducing-end labeled N-glycan mixtures using a combination of capillary normal-phase HPLC coupled off-line to matrix-assisted laser desorption/ionization time-of-flight mass spectrometry (MALDI-TOF-MS) and TOF/TOF-MS/MS. Using this method, isobaric N-glycans released from honey bee phospholipase A2 and Arabidopsis thaliana glycoproteins were separated by normal-phase chromatography and subsequently identified by key fragment ions in the MALDI-TOF/TOF tandem mass spectra. In addition, linkage and branching information were provided by abundant cross-ring and "elimination" fragment ions in the MALDI-CID spectra that gave extensive structural information. Furthermore, the fragmentation characteristics of N-glycans reductively aminated with 2-aminobenzoic acid and 2-aminobenzamide were compared. The identification of N-glycans containing 3-linked core fucose was facilitated by distinctive ions present only in the MALDI-CID spectra of 2-aminobenzoic acid-labeled oligosaccharides. To our knowledge, this is the first MS/MS-based technique that allows confident identification of N-glycans containing 3-linked core fucose, which is a major allergenic determinant on insect and plant glycoproteins.

Supplementary information : weighted tree kernels for sequence analysis

Genomic sequences are fundamentally text documents, admitting various representations according to need and tokenization. Gene expression depends crucially on binding of enzymes to the DNA sequence at small, poorly conserved binding sites, limiting the utility of standard pattern search. However, one may exploit the regular syntactic structure of the enzyme's component proteins and the corresponding binding sites, framing the problem as one of detecting grammatically correct genomic phrases. In this paper we propose new kernels based on weighted tree structures, traversing the paths within them to capture the features which underpin the task. Experimentally, we and that these kernels provide performance comparable with state of the art approaches for this problem, while offering significant computational advantages over earlier methods. The methods proposed may be applied to a broad range of sequence or tree-structured data in molecular biology and other domains.

Structures of μOconotoxins from Conusmarmoreus. Inhibitors of tetrodotoxin (TTX)-sensitive and TTX-resistant sodium channels in mammalian sensory neurons

The μO-conotoxins are an intriguing class of conotoxins targeting various voltage-dependent sodium channels and molluscan calcium channels. In the current study, we have shown MrVIA and MrVIB to be the first known peptidic inhibitors of the transient tetrodotoxin-resistant (TTX-R) Na+ current in rat dorsal root ganglion neurons, in addition to inhibiting tetrodotoxin-sensitive Na+ currents. Human TTX-R sodium channels are a therapeutic target for indications such as pain, highlighting the importance of the μO-conotoxins as potential leads for drug development. Furthermore, we have used NMR spectroscopy to provide the first structural information on this class of conotoxins. MrVIA and MrVIB are hydrophobic peptides that aggregate in aqueous solution but were solubilized in 50% acetonitrile/water. The three-dimensional structure of MrVIB consists of a small β-sheet and a cystine knot arrangement of the three-disulfide bonds. It contains four backbone “loops” between successive cysteine residues that are exposed to the solvent to varying degrees. The largest of these, loop 2, is the most disordered part of the molecule, most likely due to flexibility in solution. This disorder is the most striking difference between the structures of MrVIB and the known δ- and ω-conotoxins, which along with the μO-conotoxins are members of the O superfamily. Loop 2 of ω-conotoxins has previously been shown to contain residues critical for binding to voltage-gated calcium channels, and it is interesting to speculate that the flexibility observed in MrVIB may accommodate binding to both sodium and molluscan calcium channels.

Decomposition construction for secret sharing schemes with graph access structures in polynomial time

The purpose of this paper is to describe a new decomposition construction for perfect secret sharing schemes with graph access structures. The previous decomposition construction proposed by Stinson is a recursive method that uses small secret sharing schemes as building blocks in the construction of larger schemes. When the Stinson method is applied to the graph access structures, the number of such “small” schemes is typically exponential in the number of the participants, resulting in an exponential algorithm. Our method has the same flavor as the Stinson decomposition construction; however, the linear programming problem involved in the construction is formulated in such a way that the number of “small” schemes is polynomial in the size of the participants, which in turn gives rise to a polynomial time construction. We also show that if we apply the Stinson construction to the “small” schemes arising from our new construction, both have the same information rate.

Quality Information System: Investigating the conception, role, models and suggesting conceptual and hierarchal models

In the current business world which companies’ competition is very compact in the business arena, quality in manufacturing and providing products and services can be considered as a means of seeking excellence and success of companies in this competition arena. Entering the era of e-commerce and emergence of new production systems and new organizational structures, traditional management and quality assurance systems have been challenged. Consequently, quality information system has been gained a special seat as one of the new tools of quality management. In this paper, quality information system has been studied with a review of the literature of the quality information system, and the role and position of quality Information System (QIS) among other information systems of a organization is investigated. The quality Information system models are analyzed and by analyzing and assessing presented models in quality information system a conceptual and hierarchical model of quality information system is suggested and studied. As a case study the hierarchical model of quality information system is developed by evaluating hierarchical models presented in the field of quality information system based on the Shetabkar Co.

On managing information technology capabilities

Information technology (IT) plays a critical role of enabler of activities that improve the performance of business processes. This enabling role of IT resources means continuous investment in IT is a strategic necessity. It is established that organizations’ IT-related capabilities leverage the enabling potential of IT resources. Today’s turbulent and challenging business environment requires organizations to do more from their existing and newly acquired IT resources. To achieve this, organizations need to discover ways or establish environments to nourish their existing IT-related capabilities, and develop new IT-related capabilities. We suggest one such environment, a dynamic IT-learning environment that could contribute to nourishing existing IT-related capabilities, and developing new IT-related capabilities. This environment is a product of coordination of four organizational factors that relate to the ways in which IT-related knowledge is applied to business processes, the accompanying reward structures, and ways in which the IT-related learning and knowledge is shared within the organization. Using 216 field survey responses, this paper shows that two IT-related capabilities of top management commitment to IT initiatives, and shared organizational knowledge between the IT and business unit managers has a stronger positive influence on business process performance in the presence of this dynamic IT-learning environment. The study also shows that a marginal IT-related capability, technical IT skills, has a positive and significant influence on business process performance in the presence of this environment. These outcomes imply that organizations’ internal environments could contribute to the management of their IT-related capabilities.

Verifiable multi-secret sharing schemes for multiple threshold access structures

A multi-secret sharing scheme allows several secrets to be shared amongst a group of participants. In 2005, Shao and Cao developed a verifiable multi-secret sharing scheme where each participant’s share can be used several times which reduces the number of interactions between the dealer and the group members. In addition some secrets may require a higher security level than others involving the need for different threshold values. Recently Chan and Chang designed such a scheme but their construction only allows a single secret to be shared per threshold value. In this article we combine the previous two approaches to design a multiple time verifiable multi-secret sharing scheme where several secrets can be shared for each threshold value. Since the running time is an important factor for practical applications, we will provide a complexity comparison of our combined approach with respect to the previous schemes.

Joint identification of infinite-frequency added mass and fluid-memory models of marine structures

This paper addresses the problem of joint identification of infinite-frequency added mass and fluid memory models of marine structures from finite frequency data. This problem is relevant for cases where the code used to compute the hydrodynamic coefficients of the marine structure does not give the infinite-frequency added mass. This case is typical of codes based on 2D-potential theory since most 3D-potential-theory codes solve the boundary value associated with the infinite frequency. The method proposed in this paper presents a simpler alternative approach to other methods previously presented in the literature. The advantage of the proposed method is that the same identification procedure can be used to identify the fluid-memory models with or without having access to the infinite-frequency added mass coefficient. Therefore, it provides an extension that puts the two identification problems into the same framework. The method also exploits the constraints related to relative degree and low-frequency asymptotic values of the hydrodynamic coefficients derived from the physics of the problem, which are used as prior information to refine the obtained models.

Time- vs. frequency-domain identification of parametric radiation force models for marine structures at zero speed

The dynamics describing the motion response of a marine structure in waves can be represented within a linear framework by the Cummins Equation. This equation contains a convolution term that represents the component of the radiation forces associated with fluid memory effects. Several methods have been proposed in the literature for the identification of parametric models to approximate and replace this convolution term. This replacement can facilitate the model implementation in simulators and the analysis of motion control designs. Some of the reported identification methods consider the problem in the time domain while other methods consider the problem in the frequency domain. This paper compares the application of these identification methods. The comparison is based not only on the quality of the estimated models, but also on the ease of implementation, ease of use, and the flexibility of the identification method to incorporate prior information related to the model being identified. To illustrate the main points arising from the comparison, a particular example based on the coupled vertical motion of a modern containership vessel is presented.