The improvement and change of IT is one of the reasons which result in globalization. Taiwan has a small market scale; Taiwan¡¦s enterprises must face to global competition and challenge. In this study, we conduct the case study and use a hypercube model to analyze the innovation in technological component, business model, and dynamic capability aspects used in domestic enterprises verse global ones in the chemical industry in Taiwan. The results indicate that the innovation from domestic to globalization is radical in both of business model and technological component. A set of critical dynamic capabilities in technological component and business model for this innovation is then identified. The study offers great insights for practitioners to improve their understanding of innovation in business model and technological component aspects and provide guidelines to help practitioners adapt from domestic to globalization innovation.

Over the past decade, the rapid developments and growth of information and communication technology (ICT) have triggered a new wave of financial innovation¡Ðelectronic banking (e-banking). This study utilizes a hypercube model with secondary data analysis to analyze the differences in technological knowledge and business model aspects used in e-banking versus bricks-and-mortar banking, so as to explore the core capabilities in these two dimensions of e-banking innovation. The results indicate that the nature of e-banking innovation is disruptive, leading to drastic changes in both technological knowledge and business model for customers and incumbent banks. However, the innovation is modular for provider and architectural for regulators. We further identify nine core technical and eleven core business capabilities that are necessary for the stakeholders to cope with the change, each appearing to address either technical or business aspects of e-banking transformation. The findings have the potential to contribute to the understanding of impacts occurring in the change associated with e-banking and offer rich insights for the stakeholders to exploit e-banking opportunities.

This study utilizes a hypercube model with secondary data analysis and comparative analysis to analyze the gaps in technological knowledge and business model aspects used in e-business versus bricks-and-mortar business for the Hardware Agency, so as to explore the impacts in these two dimensions to the e-business innovation. The results indicate that the nature of e-business innovation is architectural for Hardware Agency, customer, and complementors, leading to drastic change in business model. However, the innovation for suppliers is radical, leading to drastic changes in both technological knowledge and business model. We further identify the core business model (in terms of business, logistic and cash flows) and IT infrastructure that are necessary for the Hardware Agent to cope with the e-business change. The findings have the potential to contribute to the understanding of impacts occurring in the change associated with e-business and offer rich insights for the stakeholders, especially for Hardware Agency to manage e-business innovation.

As the size of networks increases continuously, dealing with networks with faulty nodes becomes unavoidable. In this dissertation, we introduce a new measure for network fault tolerance, the strong fault tolerance (or strong Menger-connectivity)in multicomputer networks, and study the strong fault tolerance for popular multicomputer network structures. Let G be a network in which all nodes have degree d. We say that G is strongly fault tolerant if it has the following property: Let Gf be a copy of G with at most d - 2 faulty nodes. Then for any pair of non-faulty nodes u and v in Gf , there are min{degf (u), degf (v)} node-disjoint paths in Gf from u to v, where degf (u) and degf (v) are the degrees of the nodes u and v in Gf, respectively. First we study the strong fault tolerance for the popular network structures such as star networks and hypercube networks. We show that the star networks and the hypercube networks are strongly fault tolerant and develop efficient algorithms that construct the maximum number of node-disjoint paths of nearly optimal or optimal length in these networks when they contain faulty nodes. Our algorithms are optimal in terms of their time complexity. In addition to studying the strong fault tolerance, we also investigate a more realistic concept to describe the ability of networks for tolerating faults. The traditional definition of fault tolerance, sustaining at most d - 1faulty nodes for a regular graph G of degree d, reflects a very rare situation. In many cases, there is a chance that a routing path between two given nodes can be constructed though the network may have more faulty nodes than its degree. In this dissertation, we study the fault tolerance of hypercube networks under a probability model. When each node of the n-dimensional hypercube network has an independent failure probability p, we develop algorithms that, with very high probability, can construct a fault-free path when the hypercube network can sustain up to 2np faulty nodes.

published_or_final_version / Computer Science / Master / Master of Philosophy

Meshes and hypercubes are two most important communication and computation structures used in parallel computing. Network embedding problems for meshes and hypercubes on traditional network architectures have been intensively studied during the past years. With the emergence of new network architectures, the traditional network embedding results are not enough to solve the new requirements. The main objective of this thesis is to design efficient network embedding schemes for realizing meshes and hypercubes on a group of future network architectures. This thesis is organized into two parts. The first part focuses on embedding meshes/tori on a group of double-loop networks by evaluating the traditional embedding metrics, since double-loop networks have been intensively studied and proven to have many desirable properties for future network architecture. We propose a novel tessellation approach to partition the geometric plane of double-loop networks into a set of parallelogram tiles, called P-shape. Based on the characteristics of P-shape, we design a simple embedding scheme, namely P-shape embedding, that embeds arbitrary-shape meshes and tori on double-loop networks in a systematic way. A main merit of P-shape embedding is that a large fraction of embedded mesh/torus edges have edge dilation 1, resulting in a low average dilation. These are the first results, to our knowledge, on embedding meshes and tori on general doubleloop networks which is of great significance due to the popularity of these architectures. Our P-shape construction bridges between regular graphs and double-loop networks, and provides a powerful tool for studying the topological properties of double-loop networks. In the second part, we study efficient embedding schemes for realizing hypercubes on a group of array-basedWDMoptical networks by analyzing the new embedding metric of wavelength requirement, as WDM optical networking is becoming a promising technology for deployment in many applications in advanced telecommunication and parallel computing. We first design routing and wavelength assignments of both bidirectional and unidirectional hypercubes on WDM optical linear arrays, rings, meshes and tori with the consideration of communication directions. For each case, we identify a lower bound on the number of wavelengths required, and design the embedding scheme and wavelength assignment algorithm that uses a provably near-optimal number of wavelengths. To further reduce the wavelength requirement, we extend the results to WDM ring networks with additional links, namely WDM chordal rings. Based on our proposed embedding schemes, we provide the analysis of chord length with optimal number of wavelengths to realize hypercubes on 3-degree and 4-degree WDM chordal rings. Furthermore, we propose an embedding scheme for realizing dimensional hypercubes on WDM optical arrays by considering the hypercubes dimension by dimension, called lattice embedding, instead of embedding hypercubes with all dimensions. Based on lattice embedding, the number of wavelengths required to realize dimensional hypercube on WDM arrays can been significantly reduced compared to the previous results. By our embedding schemes, many communications and computations, originally designed based on hypercubes, can be directly implemented in WDM optical networks, and the wavelength requirements can be easily derived using our obtained results. / http://proxy.library.adelaide.edu.au/login?url= http://library.adelaide.edu.au/cgi-bin/Pwebrecon.cgi?BBID=1345349 / Thesis (Ph.D.) - University of Adelaide, School of Computer Science, 2008

Thesis (M. Phil.)--University of Hong Kong, 1991.

No description available.

No description available.

No description available.