A continuous service innovation such as Cloud Computing is highly attractive in the business-to-business world because it brings the service provider both billions of dollars in profits and superior competitive advantage. The success of such an innovation is strongly tied to a consumer’s adoption decision. When dealing with a continuous service innovation, the consumer’s decision process becomes complicated. Not only do consumers need to consider two different decisions of both whether to adopt and how long to adopt (contract length), but also the increasing trend of the service-related technological improvements invokes a forward-looking behavior in consumer’s decision process. Moreover, consumers have to balance the benefits and costs of adoption when evaluating decision alternatives. Consumer adoption decisions come with the desire to have the latest technology and the fear of the adopted technology becoming obsolete. Non-adoption prevents consumers from being locked-in by the service provider, but buying that technology may be costly. Being bound to a longer contract forfeits the opportunity to capitalize on the technological revolution. Frequently signing shorter contracts increases the non-physical efforts such as learning, training and negotiating costs. Targeting the right consumers at the right time with the right service offer in the business-to-business context requires an efficient strategy of sales resource allocation. This is a “mission impossible” for service providers if they do not know how consumers make decisions regarding service innovation. In order to guide the resource allocation decisions, we propose a complex model that integrates the structural, dynamic, and learning approaches to understand the consumer’s decision process on both whether or not to adopt, and how long to adopt a continuously updating service innovation in a B2B context.

In this thesis, we propose a stochastic power management strategy for in-wheel motor electric vehicles (IWM-EVs) to optimize energy consumption and to increase driving range. The driving range for EVs is a critical issue since the battery is the only source of energy. Considering the unpredictable nature of the driver’s power demand, a stochastic dynamic programing (SDP) control scheme is employed. The Policy Iteration Algorithm, one of the efficient SDP algorithms for infinite horizon problems, is used to calculate the optimal policies which are time-invariant and can be implemented directly in real-time application. Applying this control package to a high-fidelity model of an in-wheel motor electric vehicle developed in the Autonomie/Simulink environment results in considerable battery charge economy performance, while it is completely free to launch since it does not need further sensor and communication system. In addition, a skid avoidance algorithm is integrated to the power management strategy to maintain the wheels’ slip ratios within the desired values. Undesirable slip ratio causes poor brake and traction control performances and therefore should be avoided. The simulation results with the integrated power management and skid avoidance systems show that this system improves the braking performance while maintaining the power efficiency of the power management system.

Data Grids provide services and infrastructure for distributed data-intensive applications accessing massive geographically distributed datasets. An important technique to speed access in Data Grids is replication, which provides nearby data access. Although data replication is one of the major techniques for promoting high data access, the problem of replica placement has not been widely studied for large-scale Grid environments. In this thesis, I propose improved data placement techniques useful when replicating potentially large data files in wide area data grids. These techniques are aimed at achieving faster data access as well as efficient utilization of bandwidth and storage resources. At the core of my approach is a new highly distributed replica placement algorithm that places data in strategic locations to improve overall data access performance while satisfying varying user/application and system demands. This improved efficiency of access to large data will improve the practicality of large-scale data and compute intensive collaborative scientific endeavors. My thesis makes several contributions towards improving the state-of-the-art for replica placement in large-scale data grid environments. The major contributions are: (i) development of a new popularity-driven dynamic replica placement algorithm for hierarchically structured data grids that balance storage space utilisation and access latency; (ii) creation of an adaptive version of the base algorithm to dynamically adapt the frequency and degree of replication based on such factors as data request arrival rates, available storage capacities, etc.; (iii) development of a new highly distributed algorithm to determine a near-optimal replica placement while minimizing replication cost (access and update) for a given traffic pattern; (iv) creation of a distributed QoS-aware replica placement algorithm that supports multiple quality requirements both from user and system perspectives to support efficient transfers of large replicas. Simulation results using widely observed data access patterns demonstrate how the effectiveness of my replica placement techniques is affected by various factors such as grid network characteristics (i.e. topology, number of nodes, storage and workload capacities of replica servers, link capacities, traffic pattern), QoS requirements, and so on. Finally, I compare the performance of my algorithms to a number of relevant algorithms from the literature and demonstrate their usefulness and superiority for conditions of interest.

<p>We propose an approximation scheme for single-product periodic-review inventory systems with L-natural-convex structure. We lay out three well-studied inventory models, namely the lost-sales system, the perishable inventory system, and the joint inventory-pricing problem. We approximate the value functions for these models by the class of L-natural-convex quadratic functions, through the technique of linear programming approach to approximate dynamic programming. A series of heuristics are derived based on the quadratic approximation, and their performances are evaluated by comparison with existing heuristics. We present the numerical results and show that our heuristics outperform the benchmarks for majority of cases and scale well with long lead times. In this dissertation we also discuss the alternative strategies we have tried but with unsatisfactory result.</p> / Dissertation

A basic issue for translational genomics is to model gene interactions via gene regulatory networks (GRNs) and thereby provide an informatics environment to derive and study effective interventions eradicating the tumor. In this dissertation, we present two different approaches to intervention methods in cancer-related GRNs. Decisions regarding possible interventions are assumed to be made at every state transition of the network. To account for dosing constraints, a model for the sequence of treatment windows is considered, where treatments are allowed only at the beginning of each treatment cycle followed by a recovery phase. Due to biological variabilities within tumor cells, the action period of an antitumor drug can vary among a population of patients. That is, a treatment typically has a random duration of action. We propose a unified approach to such intervention models for any Markovian GRN governing the tumor. To accomplish this, we place the problem in the general framework of partially controlled decision intervals with infinite horizon discounting cost. We present a methodology to devise optimal intervention policies for synthetically generated gene regulatory networks as well as a mutated mammalian cell-cycle network. As a different approach, we view the phenotype as a characterization of the long- run behavior of the Markovian GRN and desire interventions that optimally move the probability mass from undesirable to desirable states. We employ a linear programming approach to formulate the maximal shift problem, that is, optimization is directly based on the amount of shift. Moreover, the same basic linear programming structure is used for a constrained optimization, where there is a limit on the amount of mass that may be shifted to states that are not directly undesirable relative to the pathology of interest, but which bear some perceived risk. We demonstrate the performance of optimal policies on synthetic networks as well as two real GRNs derived from the metastatic melanoma and mammalian cell cycle. These methods, as any effective cancer treatment must, aim to carry out their actions rapidly and with high efficiency such that a very large percentage of tumor cells die or shift into a state where they stop proliferating.

In this study we address a periodic review capacitated inventory system with supply uncertainty where advance demand information is available. A stochastic dynamic programming formulation is applied with the objective of minimizing the expected inventory related costs over a finite horizon. Three different supply processes are assumed. Under the all-or-nothing type supply process and partially available supply process, the structure of optimal policy is proved to be a base stock policy and numerical examples are given to demonstrate the effects of system parameters. Under Binomially distributed supply process it is shown that a simple base stock policy is not optimal.

This thesis investigates indexing and partitioning schemes for high dimensional scientific computational problems. Building on the foundation offered by Mathematics of Arrays (MoA) for tensor-based computation, the ultimate contribution of the thesis is a unified partitioning scheme that works invariant of the dataset dimension and shape. Consequently, portability is ensured between different high performance machines, cluster architectures, and potentially computational grids. The Multiple Sequence Alignment (MSA) problem in computational biology has an optimal dynamic programming based solution, but it becomes computationally infeasible as its dimensionality (the number of sequences) increases. Even sub-optimal approximations may be unmanageable for more than eight sequences. Furthermore, no existing MSA algorithms have been formulated in a manner invariant over the number of sequences. This thesis presents an optimal distributed MSA method based on MoA. The latter offers a set of constructs that help represent multidimensional arrays in memory in a linear, concise and efficient way. Using MoA allows the partitioning of the dynamic programming algorithm to be expressed independently of dimension. MSA is the highest dimensional scientific problem considered for MoA-based partitioning to date. Two partitioning schemes are presented: the first is a master/slave approach which is based on both master/slave scheduling and slave/slave coupling. The second approach is a peer-to-peer design, in which the scheduling and dependency communication are calculated independently by each process, with no need for a master scheduler. A search space reduction technique is introduced to cater for the exponential expansion as the problem dimensionality increases. This technique relies on defining a hyper-diagonal through the tensor space, and choosing a band of neighbouring partitions around the diagonal to score. In contrast, other sub-optimal methods in the literature only consider projections on the surface of the hyper-cube. The resulting massively parallel design produces a scalable solution that has been implemented on high performance machines and cluster architectures. Experimental results for these implementations are presented for both simulated and real datasets. Comparisons between the reduced search space technique of this thesis with other sub-optimal methods for the MSA problem are presented.

This thesis covers three main issues in content delivery with a focus on placement algorithms of replica servers and replica contents. In a content delivery system, the location of replicas is very important as perceived by a quotation: Closer is better. However, considering the costs incurred by replication, it is a challenge to deploy replicas in a cost-effective manner. The objective of our work is to optimally select the location of replicas which includes sites for replica server deployment, servers for replica contents hosting, and en-route caches for object caching. Our solutions for corresponding applications are presented in three parts of the work, which makes significant contributions for designing scalable, reliable, and efficient systems for Internet content delivery. In the first part, we define the Fault-Tolerant Facility Allocation (FTFA) problem for the placement of replica servers, which relaxes the well known Fault-Tolerant Facility Location (FTFL) problem by allowing an integer (instead of binary) number of facilities per site. We show that the problem is NP-hard even for the metric version, where connection costs satisfy the triangle inequality. We propose two efficient algorithms for the metric FTFA problem with approximation factors 1.81 and 1.61 respectively, where the second algorithm is also shown to be (1.11,1.78)- and (1,2)-approximation through the proposed inverse dual fitting technique. The first bi-factor approximation result is further used to achieve a 1.52-approximation algorithm and the second one a 4-approximation algorithm for the metric Fault-Tolerant k-Facility Allocation problem, where an upper bound of facility number (i. e. k) applies. In the second part, we formulate the problem of QoS-aware content replication for parallel access in terms of combined download speed maximization, where each client has a given degree of parallel connections determined by its QoS requirement. The problem is further converted into the metric FTFL problem and we propose an approximation algorithm which is implemented in a distributed and asynchronous manner of communication. We show theoretically that the cost of our solution is no more than 2F* + RC*, where F* and C* are two components of any optimal solution while R is the maximum number of parallel connections. Numerical experiments show that the cost of our solutions is comparable (within 4% error) to the optimal solutions. In the third part, we establish mathematical formulation for the en-route web caching problem in a multi-server network that takes into account all requests (to any server) passing through the intermediate nodes on a request/response path. The problem is to cache the requested object optimally on the path so that the total system gain is maximized. We consider the unconstrained case and two QoS-constrained cases respectively, using efficient dynamic programming based methods. Simulation experiments show that our methods either yield a steady performance improvement (in the unconstrained case) or provide required QoS guarantees. / http://proxy.library.adelaide.edu.au/login?url= http://library.adelaide.edu.au/cgi-bin/Pwebrecon.cgi?BBID=1461921 / Thesis (Ph.D.) - University of Adelaide, School of Computer Science, 2009

Thesis (Ph. D.)--Ohio State University, 2007. / Title from first page of PDF file. Includes bibliographical references (p. 121-128).

Thesis (Ph.D)--Industrial and Systems Engineering, Georgia Institute of Technology, 2009. / Committee Chair: Pritchett, Amy R.; Committee Member: Clarke, John-Paul; Committee Member: Cross, Stephen; Committee Member: Endsley, Mica; Committee Member: Goldsman, David. Part of the SMARTech Electronic Thesis and Dissertation Collection.