The communication complexity of fundamental problems in distributed computing on an asynchronous ring are examined from both the algorithmic and lower bound perspective. A detailed study is made of the effect on complexity of a number of assumptions about the algorithms. Randomization is shown to influence both the computability and complexity of several problems. Communication complexity is also shown to exhibit varying degrees of sensitivity to additional parameters including admissibility of error, kind of error, knowledge of ring size, termination requirements, and the existence of identifiers. A unified collection of formal models of distributed computation on asynchronous rings is developed which captures the essential characteristics of a spectrum of distributed algorithms those that are error free (deterministic, Las Vegas, and nondeterministic), and those that err with small probability (Monte Carlo and nondeterministic/probabilistic). The nondeterministic and nondeterministic/probabilistic models are introduced as natural generalizations of the Las Vegas and Monte Carlo models respectively, and prove useful in deriving lower bounds. The unification helps to clarify the essential differences between the progressively more general notions of a distributed algorithm. In addition, the models reveal the sensitivity of various problems to the parameters listed above. Complexity bounds derived using these models typically vary depending on the type of algorithm being investigated. The lower bounds are complemented by algorithms with matching complexity while frequently the lower bounds hold on even more powerful models than those required by the algorithms. Among the algorithms and lower bounds presented are two specific results which stand out because of their relative significance. 1. If g is any nonconstant cyclic function of n variables, then any nondeterministic algorithm for computing g on an anonymous ring of size n has complexity [Formula Omitted] bits of communication; and, there is a is nonconstant cyclic boolean function [Formula Omitted], such that [Formula Omitted] can be computed by a Las Vegas algorithm in [Formula Omitted] expected bits of communication on a ring of size n. 2. The expected complexity of computing AND (and a number of other natural functions) on a ring of fixed size n in the Monte Carlo model is [Formula Omitted] messages and bits where [Formula Omitted] is the allowable probability of error. / Science, Faculty of / Computer Science, Department of / Graduate

Depuis la réforme culturelle en Chine, l’Opéra de Shanghai est un succès pour le public et dans le champ commercial. A partir de 2003, un élargissement de la reforme culturelle chinoise indique que l’institution public chinoise doit concilier les lois commerciales, et la mission de service public. Dans ma thèse, je m’attache à présenter une étude de terrain sur le plan sociologique, économique, stratégique, à effectuer une analyse complète du Centre d’Art de l’Opéra de Shanghai et de la politique culturelle chinoise, pour présenter des propositions constructives au CAOS. L’Opéra National de Paris est comme une grande référence internationale comparable au CAOS en Chine. / Since the cultural reform in China, the Shanghai Opera House is a great success in the public and the commercial field. From 2003, an expansion of the Chinese cultural reform indicates that the Chinese public institution must balance the trade laws and public service mission. In my dissertation, I submit myself to a field study on the sociological, economic, and strategic, to conduct a comprehensive analysis of the Art Centre of the Shanghai Opera and Chinese political culture, to present constructive proposals for CAOS. Opera National de Paris is like a big international benchmark compared to CAOS.

No description available.

abstract: People who participate in correctional treatment programming are viewed as making positive steps towards their reentry into society. However, this is often assessed through a simple “yes” or “no” response to whether they are currently participating without much emphasis on how, why, or to what degree that participation is meaningful for reentry preparedness. The present study aims to a) identify to what extent there is variation in the degree to which women participate in programming and are prepared for reentry, b) identify the characteristics that distinguish highly-involved programmers from less involved programmers, c) identify the characteristics that distinguish women who are highly-prepared for reentry from women who are less prepared, and d) assess whether levels of involvement in programming relates to levels of reentry preparedness. The sample comes from interviewer-proctored surveys of 200 incarcerated women in Arizona. Two indices were created: one for the primary independent variable of program involvement and one for the dependent variable of reentry preparedness. Logistic and multivariate regressions were run to determine the indices’ relatedness to each other and the characteristic variables. The two indices did not have a statistically significant relationship with each other. However, variation across them is found. This indicates that programmers may not be a homogenous group and that they may engage with programming to varying degrees based on a multitude of indicators. / Dissertation/Thesis / Masters Thesis Criminology and Criminal Justice 2020

No description available.

Driven by the advancement of smart electrical grid technologies, automated home energy management systems are being increasingly and extensively studied, developed, and widely accepted. A system like this is indispensable for and symbolic of a smart home. Mixed integer linear programming (MILP) together with dynamic electricity tariff and smart home appliances is a common way to developing energy management systems capable of automatically scheduling appliance operation and greatly saving monetary cost. This study transformed an existing plain MILP model to a goal programming model with priority to better address the conflict among each single appliance cost saving objective and user time preference objective. Constraints regarding the delays between pairs of closely related appliances are either extended or newly introduced. Numerical experiments on five appliances under different situations justify the validness of the proposed framework. Besides, the influences of key parameters on model performance are also investigated.

One of the important tasks during software testing is the generation of test cases. Various approaches have been proposed to automate this task. The approaches available, however, often have problems limiting their use. A problem of dynamic test case generation approaches, for instance, is that a large number of iterations can be necessary to obtain test cases. This article proposes a novel algorithm for path-oriented test case generation based on binary search and describes a possible implementation.

This essay investigates the concept of linear programming in general and linear stochastic programming in particular. Linear stochastic programming is described as the model where the parameters of the linear programming admit random variability. The first three chapters present through a set-geometric approach the foundations of linear programming. Chapter one describes the evolution of the concepts which resulted in the adoption of the model. Chapter two describes the constructs in n-dimensional euclidian space which constitute the mathematical basis of linear programs, and chapter three defines the linear programming model and develops the computational basis of the simplex algorithm. The second three chapters analyze the effect of the introduction of risk into the linear programming model. The different approaches of estimating and measuring risk are studied and the difficulties arising in formulating the stochastic problem and deriving the equivalent deterministic problems are treated from the theoretical and practical point of view. Multiple examples are given throughout the essay for clarification of the salient points.

Although studies examining sexual assault among college students are vast, the literature is somewhat lacking in discussions of contextualized sexual assault predictors and their relationship with sexual assault prevention. The purpose of this study is to examine whether demographic factors, contextual factors, and behavioral factors effect sexual victimization on college campuses. In this examination, I hope to show that the presence of these factors may be related to sexual victimization; however their existence does not necessitate the use of victim blame. By reviewing sexual assault prevention programming on college and university campuses across the United States, I provide alternate explanations and possible solutions to the sexual victimization of students in higher education. This study used data from the American College Health Association Fall 2011 survey. In addition, a comparison is made to these data from an Executive Summary for Mississippi State University from the Spring 2013 ACHA survey period.

No description available.