New benchmarking techniques in resource allocation problems: theory and applications in cloud systems

Motivated by different e-commerce applications such as allocating virtual machines to servers and online ad placement, we study new models that aim to capture unstudied tensions faced by decision-makers. In online/sequential models, future information is often unavailable to decision-makers---e.g., the exact demand of a product for next week. Sometimes, these unknowns have regularity, and decision-makers can fit random models. Other times, decision-makers must be prepared for any possible outcome. In practice, several solutions are based on classical models that do not fully consider these unknowns. One reason for this is our present technical limitations. Exploring new models with adequate sources of uncertainty could be beneficial for both the theory and the practice of decision-making. For example, cloud companies such as Amazon WS face highly unpredictable demands of resources. New management planning that considers these tensions have improved capacity and cut costs for the cloud providers. As a result, cloud companies can now offer new services at lower prices benefiting thousands of users. In this thesis, we study three different models, each motivated by an application in cloud computing and online advertising. From a technical standpoint, we apply either worst-case analysis with limited information from the system or adaptive analysis with stochastic results learned after making an irrevocable decision. A central aspect of this work is dynamic benchmarks as opposed to static or offline ones. Static and offline viewpoints are too conservative and have limited interpretation in some dynamic settings. A dynamic criterion, such as the value of an optimal sequential policy, allows comparisons with the best that one could do in dynamic scenarios. Another aspect of this work is multi-objective criteria in dynamic settings, where two or more competing goals must be satisfied under an uncertain future. We tackle the challenges introduced by these new perspectives with fresh theoretical analyses, drawing inspiration from linear and nonlinear optimization and stochastic processes.Ph.D

HAL/SM language specification

A programming language is presented for the flight software of the NASA Space Shuttle program. It is intended to satisfy virtually all of the flight software requirements of the space shuttle. To achieve this, it incorporates a wide range of features, including applications-oriented data types and organizations, real time control mechanisms, and constructs for systems programming tasks. It is a higher order language designed to allow programmers, analysts, and engineers to communicate with the computer in a form approximating natural mathematical expression. Parts of the English language are combined with standard notation to provide a tool that readily encourages programming without demanding computer hardware expertise. Block diagrams and flow charts are included. The semantics of the language is discussed

Toward practical and private online services

Today's common online services (social networks, media streaming, messaging, email, etc.) bring convenience. However, these services are susceptible to privacy leaks. Certainly, email snooping by rogue employees, email server hacks, and accidental disclosures of user ratings for movies are some sources of private information leakage. This dissertation investigates the following question: Can we build systems that (a) provide strong privacy guarantees to the users, (b) are consistent with existing commercial and policy regimes, and (c) are affordable? Satisfying all three requirements simultaneously is challenging, as providing strong privacy guarantees usually necessitates either sacrificing functionality, incurring high resource costs, or both. Indeed, there are powerful cryptographic protocols---private information retrieval (PIR), and secure two-party computation (2PC)---that provide strong guarantees but are orders of magnitude more expensive than their non-private counterparts. This dissertation takes these protocols as a starting point and then substantially reduces their costs by tailoring them using application-specific properties. It presents two systems, Popcorn and Pretzel, built on this design ethos. Popcorn is a Netflix-like media delivery system, that provably hides, even from the content distributor (for example, Netflix), which movie a user is watching. Popcorn tailors PIR protocols to the media domain. It amortizes the server-side overhead of PIR by batching requests from the large number of concurrent users retrieving content at any given time; and, it forms large batches without introducing playback delays by leveraging the properties of media streaming. Popcorn is consistent with the prevailing commercial regime (copyrights, etc.), and its per-request dollar cost is 3.87 times that of a non-private system. The other system described in this dissertation, Pretzel, is an email system that encrypts emails end-to-end between senders and intended recipients, but allows the email service provider to perform content-based spam filtering and targeted advertising. Pretzel refines a 2PC protocol. It reduces the resource consumption of the protocol by replacing the underlying encryption scheme with a more efficient one, applying a packing technique to conserve invocations of the encryption algorithm, and pruning the inputs to the protocol. Pretzel's costs, versus a legacy non-private implementation, are estimated to be up to 5.4 times for the email provider, with additional but modest client-side requirements. Popcorn and Pretzel have fundamental connections. For instance, the cryptographic protocols in both systems securely compute vector-matrix products. However, we observe that differences in the vector and matrix dimensions lead to different system designs. Ultimately, both systems represent a potentially appealing compromise: sacrifice some functionality to build in strong privacy properties at affordable costs.Computer Science

On-line extensible bin packing with unequal bin sizes

Analysis of AlgorithmsIn the extensible bin packing problem we are asked to pack a set of items into a given number of bins, each with an original size. However, the original bin sizes can be extended if necessary. The goal is to minimize the total size of the bins. We consider the problem with unequal (original) bin sizes and give the complete analysis on a list scheduling algorithm (LS). Namely we present tight bounds of LS for every collection of original bin sizes and every number of bins. We further show better on-line algorithms for the two-bin case and the three-bin case. Interestingly, it is proved that the on-line algorithms have better competitive ratios for unequal bins than for equal bins. Some variants of the problem are also discussed

Multi-objective particle swarm optimization for the structural design of concentric tube continuum robots for medical applications

Concentric tube robots belong to the class of continuum robotic systems whose morphology is described by continuous tangent curvature vectors. They are composed of multiple, interacting tubes nested inside one another and are characterized by their inherent flexibility. Concentric tube continuum robots equipped with tools at their distal end have high potential in minimally invasive surgery. Their morphology enables them to reach sites within the body that are inaccessible with commercial tools or that require large incisions. Further, they can be deployed through a tight lumen or follow a nonlinear path. Fundamental research has been the focus during the last years bringing them closer to the operating room. However, there remain challenges that require attention. The structural synthesis of concentric tube continuum robots is one of these challenges, as these types of robots are characterized by their large parameter space. On the one hand, this is advantageous, as they can be deployed in different patients, anatomies, or medical applications. On the other hand, the composition of the tubes and their design is not a straightforward task but one that requires intensive knowledge of anatomy and structural behavior. Prior to the utilization of such robots, the composition of tubes (i.e. the selection of design parameters and application-specific constraints) must be solved to determine a robotic design that is specifically targeted towards an application or patient. Kinematic models that describe the change in morphology and complex motion increase the complexity of this synthesis, as their mathematical description is highly nonlinear. Thus, the state of the art is concerned with the structural design of these types of robots and proposes optimization algorithms to solve for a composition of tubes for a specific patient case or application. However, existing approaches do not consider the overall parameter space, cannot handle the nonlinearity of the model, or multiple objectives that describe most medical applications and tasks. This work aims to solve these fundamental challenges by solving the parameter optimization problem by utilizing a multi-objective optimization algorithm. The main concern of this thesis is the general methodology to solve for patient- and application-specific design of concentric tube continuum robots and presents key parameters, objectives, and constraints. The proposed optimization method is based on evolutionary concepts that can handle multiple objectives, where the set of parameters is represented by a decision vector that can be of variable dimension in multidimensional space. Global optimization algorithms specifically target the constrained search space of concentric tube continuum robots and nonlinear optimization enables to handle the highly nonlinear elasticity modeling. The proposed methodology is then evaluated based on three examples that include cooperative task deployment of two robotic arms, structural stiffness optimization under the consideration of workspace constraints and external forces, and laser-induced thermal therapy in the brain using a concentric tube continuum robot. In summary, the main contributions are 1) the development of an optimization methodology that describes the key parameters, objectives, and constraints of the parameter optimization problem of concentric tube continuum robots, 2) the selection of an appropriate optimization algorithm that can handle the multidimensional search space and diversity of the optimization problem with multiple objectives, and 3) the evaluation of the proposed optimization methodology and structural synthesis based on three real applications