A new discrete velocity scheme for solving the Boltzmann equation has been implemented for homogeneous relaxation and one-dimensional problems. Directly solving the Boltzmann equation is computationally expensive because in addition to working in physical space, the nonlinear collision integral must also be evaluated in a velocity space. To best solve the collision integral, collisions between each point in velocity space with all other points in velocity space must be considered, but this is very expensive. Motivated by the Direct Simulation Monte Carlo (DSMC) method, the computational costs in the present method are reduced by randomly sampling a set of collision partners for each point in velocity space. A collision partner selection algorithm was implemented to favor collision partners that contribute more to the collision integral. The new scheme has a built in flexibility, where the resolution in approximating the collision integral can be adjusted by changing how many collision partners are sampled. The computational cost associated with evaluation of the collision integral is compared to the corresponding statistical error. Having a fixed set of velocities can artificially limit the collision outcomes by restricting post collision velocities to those that satisfy the conservation equations and lie precisely on the grid. A new velocity interpolation algorithm enables us to map velocities that do not lie on the grid to nearby grid points while preserving mass, momentum, and energy. This allows for arbitrary post-collision velocities that lie between grid points or completely outside of the velocity space to be projected back onto the nearby grid points. The present scheme is applied to homogeneous relaxation of the non-equilibrium Bobylev Krook-Wu distribution, and the numerical results agree well with the analytic solution. After verifying the proposed method for spatially homogeneous relaxation problems, the scheme was then used to solve a 1D traveling shock. The jump conditions across the shock match the Rankine-Hugoniot jump conditions. The internal shock wave structure was then compared to DSMC solutions, and good agreement was found for Mach numbers ranging from 1.2 to 6. Since a coarse velocity discretization is required for efficient calculation, the effects of different velocity grid resolutions are examined. Although using a relatively coarse approximation for the collision integral is computationally efficient, statistical noise pollutes the solution. The effects of using coarse and fine approximations for the collision integral are examined and it is found that by coarsely evaluating the collision integral, the computational time can be reduced by nearly two orders of magnitude while retaining relatively smooth macroscopic properties. / text

The dissertation details work aimed toward the development and implementation of a 3-D impact fragmentation module to perform rock fall analysis by taking into account impact fragmentation. This fragmentation module is based on a database of a large set of impact simulations using a fully calibrated discrete element model (DEM), and is employed to predict impact fragmentation processes in rockfall analysis by either training a neural network model or linearly interpolating the database. A DEM was employed to model impact fragmentation in the study. A DEM code was developed from scratch. The model was first calibrated and verified with experimental results to demonstrate the capability of modeling both quasi-static and dynamic material behavior. Algorithms to calibrate the model’s micro-parameters against triaxial tests on rocks were presented. Sensitivity analyses were used to identify the deformability micro-parameters by obtaining relationships between microscopic and macroscopic deformability properties. The strength model parameters were identified by a global optimization process aimed at minimizing the difference between computed and experimental failure envelopes. When applied to the experimental results of tested granite, this calibration process produced a good agreement between simulated and experimental results for both deformability and strength properties. Dynamic compression and SHPB tests were performed to verify the dynamic model. A strain-rate-dependent dynamic strength was observed in the experimental results. This strain-rate-dependent dynamic strength was also confirmed by the numerical results. No rate-dependent constitutive model was used in the DEM to simulate dynamic behavior. This simulated rate-dependent dynamic strength can be attributed to material inertia because the inertia inhibits crack growth. Some fundamental mechanisms of impact fragmentation associated with rockfalls were then numerically investigated. The developed DEM code was coupled with a simplified impact model inspired by the theory of dynamic foundations. It has been shown that the magnitude of impact velocity, the angle of the incidence, the ground condition all play very important roles in impact fragmentation. Several case studies were performed to validate the developed impact fragmentation module in rock fall analysis. It has been demonstrated that the developed fragmentation module can reasonably predict impact fragmentation and perform some risk analysis in rock fall analysis. / text

A just-in-time supply pickup and delivery system (JSS) manages the logistic operations between a manufacturing plant and its suppliers by controlling the sequence, timing, and frequency of container pickups and parts deliveries, thereby coordinating internal conveyance, external conveyance, and the operation of cross-docking facilities. The system is important to just-in-time production lines that maintain small inventories. This research studies the logistics, supply chain, and production control of JSS. First, a new meta-heuristics approach (taboo search) is developed to solve a general frequency routing (GFR) problem that has been formulated in this dissertation with five types of constraints: flow, space, load, time, and heijunka. Also, a formulation for cross-dock routing (CDR) has been created and solved. Second, seven issues concerning the structure of JSS systems that employ the previously studied common frequency routing (CFR) problem (Chuah and Yingling, in press) are explored to understand their impacts on operational costs of the system. Finally, a discreteevent simulation model is developed to study JSS by looking at different types of variations in demand and studying their impacts on the stability of inventory levels in the system. The results show that GFR routes at high frequencies do not have common frequencies in the solution. There are some common frequencies at medium frequencies and none at low frequency, where effectively the problem is simply a vehicle routing problem (VRP) with time windows. CDR is an extension of VRP-type problems that can be solved quickly with meta-heuristic approaches. GFR, CDR, and CFR are practical routing strategies for JSS with taboo search or other types of meta-heuristics as solvers. By comparing GFR and CFR solutions to the same problems, it is shown that the impacts of CFR restrictions on cost are minimal and in many cases so small as to make simplier CFR routes desirable. The studies of JSS structural features on the operating costs of JSS systems under the assumption of CFR routes yielded interesting results. First, when suppliers are clustered, the routes become more efficient at mid-level, but not high or low, frequencies. Second, the cost increases with the number of suppliers. Third, negotiating broad time windows with suppliers is important for cost control in JSS systems. Fourth, an increase or decrease in production volumes uniformly shifts the solutions cost versus frequency curve. Fifth, increased vehicle capacity is important in reducing costs at low and medium frequencies but far less important at high frequencies. Lastly, load distributions among the suppliers are not important determinants of transportation costs as long as the average loads remain the same. Finally, a one-supplier, one-part-source simulation model shows that the systems inventory level tends to be sticky to the reordering level. JSS is very stable, but it requires reliable transportation to perform well. The impact to changes in kanban levels (e.g., as might occur between route planning intervals when production rates are adjusted) is relatively long term with dynamic after-effects on inventory levels that take a long time to dissapate. A gradual change in kanban levels may be introduced, prior to the changeover, to counter this effect.

In this dissertation, we explore the problem of fault detection and fault diagnosis for systems modeled as condition systems. A condition system is a Petri net based framework of components which interact with each other and the external environment through the use of condition signals. First, a system FAULT is defined as an observed behavior which does not correspond to any expected behavior, where the expected behavior is defined through condition system models. A DETECTION is the determination that the system is not behaving as expected according to the model of the system. A DIAGNOSIS of this fault localizes the subsystem that is the source of the discrepancy between output and expected observations. We characterize faults as a behavior relaxation of model components. We then show that detection and diagnosis can be determined in a finite number of calculations. The exact solution can be computationally involved, so we also present methods to perform a rapid detection and diagnosis. We have also included a chapter on a conversion from the condition system framework into a linear-time temporal logic(LTL) framework.

My dissertation examines how individuals respond to workplace social comparisons. I measure the explicit set of referent others that individuals compare themselves against in order to evaluate their own level of performance. I examine how the social context of these comparisons impact discretionary performance related behaviors by examining how an individual’s position within a social network and the structural characteristics of an individual’s reference group influences the experience of discrete emotions. Specifically, I examine how malicious envy and benign envy mediate the relationship between social comparison and workplace behavior in a field setting. Results indicate that social network structure plays a significant role in motivating both productive and counterproductive responses to social comparison. Whether or not an employee responds to upward social comparisons by increasing their own work effort or engaging in deviant behavior is influenced by the experience of benign and malicious envy, which is in turn influencedby the network structure of reference groups. Furthermore, social network position plays a moderating role in the occurrence of workplace deviance by either enhancing or limiting the opportunities an employee has to engage in deviant behavior.

No description available.

Une carte est le plongement d'un graphe dans une surface, à un homéomorphisme près. Ainsi, une carte est un objet topologique énumérable, en fonction du nombre de ses sommets, de ses arêtes et de ses faces. Les cartes admettent des symétries internes qui rendent leur énumération difficile. On n'envisage dans ce travail que l'énumération des cartes pointées, le pointage supprimant toutes les symétries. Le nombre exact de cartes pointées sur une surface donnée n'est connu que pour les surfaces de petit genre, comme la sphère (genre 0), le tore ou le plan projectif (genre 1). En effet, la complexité des méthodes de calcul de ces nombres augmente rapidement avec le genre des surfaces. Un travail important de cette thèse a été de convertir l'une de ces méthodes de calcul en une preuve de l'existence d'une structure commune à toutes les séries génératrices de cartes pointées de genre non nul. Pour chaque surface orientable, on réduit le problème à la détermination d'un polynôme, dont le degré est majoré par une fonction simple du genre de la surface. Un résultat analogue est obtenu pour les cartes pointées sur les surfaces non orientables. Des conséquences pratiques et une implantation logicielle de tous ces résultats sont décrites. De nouvelles formules explicites d'énumération sont données. Indépendamment, une bijection géométrique nouvelle est exposée, entre certaines cartes 2-coloriables et les partitions de polygones, énumérées par les nombres de Schröder.

L'idée directrice de ce travail est de montrer que bon nombre de requêtes peuvent être exprimées comme une navigation dans des graphes.

In an interval society, voters are represented by intervals on the real line, corresponding to their approval sets on a linear political spectrum. I imagine the society to be a representative democracy, and ask how to choose members of the society as representatives. Following work in mathematical psychology by Coombs and others, I develop a measure of the compatibility (political similarity) of two voters. I use this measure to determine the popularity of each voter as a candidate. I then establish local “agreeability” conditions and attempt to find a lower bound for the popularity of the best candidate. Other results about certain special societies are also obtained

The capacity of a directed hypergraph is a particular numerical quantity associated with a hypergraph. It is of interest because of certain important connections to longstanding conjectures in theoretical computer science related to fast matrix multiplication and perfect hashing as well as various longstanding conjectures in extremal combinatorics. We give an overview of the concept of the capacity of a hypergraph and survey a few basic results regarding this quantity. Furthermore, we discuss the Lovász number of an undirected graph, which is known to upper bound the capacity of the graph (and in practice appears to be the best such general purpose bound). We then elaborate on some attempted generalizations/modifications of the Lovász number to undirected hypergraphs that we have tried. It is not currently known whether these attempted generalizations/modifications upper bound the capacity of arbitrary hypergraphs. An important method for proving lower bounds on hypergraph capacity is to exhibit a large independent set in a strong power of the hypergraph. We examine methods for this and show a barrier to attempts to usefully generalize certain of these methods to hypergraphs. We then look at cap sets: independent sets in powers of a certain hypergraph. We examine certain structural properties of them with the hope of finding ones that allow us to prove upper bounds on their size. Finally, we consider two interesting generalizations of capacity and use one of them to formulate several conjectures about connections between cap sets and sunflower-free sets.