Optimal networks with NOR-OR gates and Wired OR logic /

Originally presented as the author's thesis (M.S.), University of Illinois at Urbana-Champaign.

A study of certain factors affecting computation times in designing optimal NOR networks by the implicit enumeration method using the feed-forward formulation /

Bibliography: p. 27-29.

S. Fulgentii Ruspensis episcopi Opera quae extant omnia. D. Valeriani Cemeliensis episcopi homiliae XX et epistola ad monachos /

Apostillas marginales

Optimization and Machine Learning Frameworks for Complex Network Analysis

Thesis (Ph.D.)--University of Washington, 2016-06

Existence and embeddings of partial Steiner triple systems of order ten with cubic leaves

Denote the set of 21 non-isomorphic cubic graphs of order 10 by L. We first determine precisely which L is an element of L occur as the leave of a partial Steiner triple system, thus settling the existence problem for partial Steiner triple systems of order 10 with cubic leaves. Then we settle the embedding problem for partial Steiner triple systems with leaves L is an element of L. This second result is obtained as a corollary of a more general result which gives, for each integer v greater than or equal to 10 and each L is an element of L, necessary and sufficient conditions for the existence of a partial Steiner triple system of order v with leave consisting of the complement of L and v - 10 isolated vertices. (C) 2004 Elsevier B.V. All rights reserved.

Vehicle routing and crew scheduling for metropolitan mail distribution at Australia Post

This paper presents a new multi-depot combined vehicle and crew scheduling algorithm, and uses it, in conjunction with a heuristic vehicle routing algorithm, to solve the intra-city mail distribution problem faced by Australia Post. First we describe the Australia Post mail distribution problem and outline the heuristic vehicle routing algorithm used to find vehicle routes. We present a new multi-depot combined vehicle and crew scheduling algorithm based on set covering with column generation. The paper concludes with a computational investigation examining the affect of different types of vehicle routing solutions on the vehicle and crew scheduling solution, comparing the different levels of integration possible with the new vehicle and crew scheduling algorithm and comparing the results of sequential versus simultaneous vehicle and crew scheduling, using real life data for Australia Post distribution networks.

Edge-coloured cube decompositions

An edge-colored graph is a graph H together with a function f:E(H) → C where C is a set of colors. Given an edge-colored graph H, the graph induced by the edges of color c C is denoted by H(c). Let G, H, and J be graphs and let μ be a positive integer. A (J, H, G, μ) edge-colored graph decomposition is a set S = {H 1,H 2,...,H t} of edge-colored graphs with color set C = {c 1, c 2,..., c k} such that Hi ≅ H for 1 ≤ i ≤ t; Hi (cj) ≅ G for 1 ≤ i ≤ t and ≤ j ≤ k; and for j = 1, 2,..., k, each edge of J occurs in exactly μ of the graphs H 1(c j ), H 2(c j ),..., H t (c j ). Let Q 3 denote the 3-dimensional cube. In this paper, we find necessary and sufficient conditions on n, μ and G for the existence of a (K n ,Q 3,G, μ) edge-colored graph decomposition. © Birkhäuser Verlag, Basel 2007.

Minimal Homogeneous Latin Trades

A latin trade is a subset of a latin square which may be replaced with a disjoint mate to obtain a new latin square. A d-homogeneous latin trade is one which intersects each row, each column and each entry of the latin square either 0 or d times. In this paper we give a construction for minimal d-homogeneous latin trades of size dm, for every integer d >= 3, and m >= 1.75d(2) + 3. We also improve this bound for small values of d. Our proof relies on the construction of cyclic sequences whose adjacent sums are distinct. (c) 2006 Elsevier B.V. All rights reserved.

A scalarization technique for computing the power and exponential moments of gaussian random matrices

We consider the problems of computing the power and exponential moments EXs and EetX of square Gaussian random matrices X=A+BWC for positive integer s and real t, where W is a standard normal random vector and A, B, C are appropriately dimensioned constant matrices. We solve the problems by a matrix product scalarization technique and interpret the solutions in system-theoretic terms. The results of the paper are applicable to Bayesian prediction in multivariate autoregressive time series and mean-reverting diffusion processes.

Modelling the growth of prion protein aggregates in the brain in variant Creutzfeldt-Jakob disease

Deposition of insoluble prion protein (PrP) in the brain in the form of protein aggregates or deposits is characteristic of the ‘transmissible spongiform encephalopathies’ (TSEs). Understanding the growth and development of these PrP aggregates is important both in attempting to the elucidate of the pathogenesis of prion disease and in the development of treatments designed to prevent or inhibit the spread of prion pathology within the brain. Aggregation and disaggregation of proteins and the diffusion of substances into the developing aggregates (surface diffusion) are important factors in the development of protein aggregates. Mathematical models suggest that if aggregation/disaggregation or surface diffusion is the predominant factor, the size frequency distribution of the resulting protein aggregates in the brain should be described by either a power-law or a log-normal model respectively. This study tested this hypothesis for two different types of PrP deposit, viz., the diffuse and florid-type PrP deposits in patients with variant Creutzfeldt-Jakob disease (vCJD). The size distributions of the florid and diffuse plaques were fitted by a power-law function in 100% and 42% of brain areas studied respectively. By contrast, the size distributions of both types of plaque deviated significantly from a log-normal model in all brain areas. Hence, protein aggregation and disaggregation may be the predominant factor in the development of the florid plaques. A more complex combination of factors appears to be involved in the pathogenesis of the diffuse plaques. These results may be useful in the design of treatments to inhibit the development of protein aggregates in vCJD.

Size frequency distribution of the β-amyloid (aβ) deposits in dementia with Lewy bodies with associated Alzheimer’s disease pathology

The objective is to study beta-amyloid (Abeta) deposition in dementia with Lewy bodies (DLB) with Alzheimer's disease (AD) pathology (DLB/AD). The size frequency distributions of the Abeta deposits were studied and fitted by log-normal and power-law models. Patients were ten clinically and pathologically diagnosed DLB/AD cases. Size distributions had a single peak and were positively skewed and similar to those described in AD and Down's syndrome. Size distributions had smaller means in DLB/AD than in AD. Log-normal and power-law models were fitted to the size distributions of the classic and diffuse deposits, respectively. Size distributions of Abeta deposits were similar in DLB/AD and AD. Size distributions of the diffuse deposits were fitted by a power-law model suggesting that aggregation/disaggregation of Abeta was the predominant factor, whereas the classic deposits were fitted by a log-normal distribution suggesting that surface diffusion was important in the pathogenesis of the classic deposits.

Optimization of physical distribution problem in logistics management

Physical distribution plays an imporant role in contemporary logistics management. Both satisfaction level of of customer and competitiveness of company can be enhanced if the distribution problem is solved optimally. The multi-depot vehicle routing problem (MDVRP) belongs to a practical logistics distribution problem, which consists of three critical issues: customer assignment, customer routing, and vehicle sequencing. According to the literatures, the solution approaches for the MDVRP are not satisfactory because some unrealistic assumptions were made on the first sub-problem of the MDVRP, ot the customer assignment problem. To refine the approaches, the focus of this paper is confined to this problem only. This paper formulates the customer assignment problem as a minimax-type integer linear programming model with the objective of minimizing the cycle time of the depots where setup times are explicitly considered. Since the model is proven to be MP-complete, a genetic algorithm is developed for solving the problem. The efficiency and effectiveness of the genetic algorithm are illustrated by a numerical example.

A mathematical model for assembly line balancing model to consider disordering sequence of workstations

Purpose – A binary integer programming model for the simple assembly line balancing problem (SALBP), which is well known as SALBP-1, was formulated more than 30 years ago. Since then, a number of researchers have extended the model for the variants of assembly line balancing problem.The model is still prevalent nowadays mainly because of the lower and upper bounds on task assignment. These properties avoid significant increase of decision variables. The purpose of this paper is to use an example to show that the model may lead to a confusing solution. Design/methodology/approach – The paper provides a remedial constraint set for the model to rectify the disordered sequence problem. Findings – The paper presents proof that the assembly line balancing model formulated by Patterson and Albracht may lead to a confusing solution. Originality/value – No one previously has found that the commonly used model is incorrect.

An integrated scheduling problem of PCB components on sequential pick-and-place machines:mathematical models and heuristic solutions

This paper formulates several mathematical models for determining the optimal sequence of component placements and assignment of component types to feeders simultaneously or the integrated scheduling problem for a type of surface mount technology placement machines, called the sequential pick-andplace (PAP) machine. A PAP machine has multiple stationary feeders storing components, a stationary working table holding a printed circuit board (PCB), and a movable placement head to pick up components from feeders and place them to a board. The objective of integrated problem is to minimize the total distance traveled by the placement head. Two integer nonlinear programming models are formulated first. Then, each of them is equivalently converted into an integer linear type. The models for the integrated problem are verified by two commercial packages. In addition, a hybrid genetic algorithm previously developed by the authors is adopted to solve the models. The algorithm not only generates the optimal solutions quickly for small-sized problems, but also outperforms the genetic algorithms developed by other researchers in terms of total traveling distance.