Kalman Filter Algorithm for Rating and Prediction in Basketball

The Thesis presents a state-space model for a basketball league and a Kalman filter algorithm for the estimation of the state of the league. In the state-space model, each of the basketball teams is associated with a rating that represents its strength compared to the other teams. The ratings are assumed to evolve in time following a stochastic process with independent Gaussian increments. The estimation of the team ratings is based on the observed game scores that are assumed to depend linearly on the true strengths of the teams and independent Gaussian noise. The team ratings are estimated using a recursive Kalman filter algorithm that produces least squares optimal estimates for the team strengths and predictions for the scores of the future games. Additionally, if the Gaussianity assumption holds, the predictions given by the Kalman filter maximize the likelihood of the observed scores. The team ratings allow probabilistic inference about the ranking of the teams and their relative strengths as well as about the teams’ winning probabilities in future games. The predictions about the winners of the games are correct 65-70% of the time. The team ratings explain 16% of the random variation observed in the game scores. Furthermore, the winning probabilities given by the model are concurrent with the observed scores. The state-space model includes four independent parameters that involve the variances of noise terms and the home court advantage observed in the scores. The Thesis presents the estimation of these parameters using the maximum likelihood method as well as using other techniques. The Thesis also gives various example analyses related to the American professional basketball league, i.e., National Basketball Association (NBA), and regular seasons played in year 2005 through 2010. Additionally, the season 2009-2010 is discussed in full detail, including the playoffs.

An algorithm to find distant repeats in a pair of protein sequences

Distant repeats between a pair of protein sequences can be exploited to study the various aspects of proteins such as structure-function relationship, disorders due to protein malfunction, evolutionary analysis, etc. An in-depth analysis of the distant repeats would facilitate to establish a stable evolutionary relation of the repeats with respect to their three-dimensional structure. To this effect, an algorithm has been devised to identify the distant repeats in a pair of protein sequences by essentially using the scores of PAM (Percent Accepted Mutation) matrices. The proposed algorithm will be of much use to researchers involved in the comparative study of various organisms based on the amino-acid repeats in protein sequences. (C) 2010 Elsevier B.V. All rights reserved.

An efficient reduction algorithm for computation of interconnect delay variability for statistical timing analysis in clock tree planning

In this paper, we propose a novel and efficient algorithm for modelling sub-65 nm clock interconnect-networks in the presence of process variation. We develop a method for delay analysis of interconnects considering the impact of Gaussian metal process variations. The resistance and capacitance of a distributed RC line are expressed as correlated Gaussian random variables which are then used to compute the standard deviation of delay Probability Distribution Function (PDF) at all nodes in the interconnect network. Main objective is to find delay PDF at a cheaper cost. Convergence of this approach is in probability distribution but not in mean of delay. We validate our approach against SPICE based Monte Carlo simulations while the current method entails significantly lower computational cost.

A Computationally Efficient PWM Algorithm for Multilevel Inverters

Centred space vector PWM (CSVPWM) technique is popularly used for three level voltage source inverters. The reference voltage vector is synthesized by time-averaging of the three nearest voltage vectors produced by the inverter. Identifying the three voltage vectors, and calculation of the dwelling time for each vector are both computationally intensive. This paper analyses the process of PWM generation in CSVPWM. This analysis breaks up a three-level inverter into six different conceptual two level inverters in different regions of the fundamental cycle. Control of 3-level inverter is viewed as the control of the appropriate 2-level inverter. The analysis leads to a systematic simplification of the computations involved, finally resulting in a computationally efficient PWM algorithm. This algorithm exploits the equivalence between triangle comparison and space vector approaches to PWM generation. This algorithm does not involve any 3-phase/2-phase or 2-phase/3-phase transformation. This also does not involve any transformation from rectangular to polar coordinates, and vice versa. Further no evaluation of trigonometric functions is necessary. This algorithm also provides for the mitigation of DC neutral point unbalance, and is well suited to digital implementation. Simulation and experimental results are presented.

Criticality of the exponential rate of decay for the largest nearest-neighbor link in random geometric graphs

Let n points be placed independently in d-dimensional space according to the density f(x) = A(d)e(-lambda parallel to x parallel to alpha), lambda, alpha > 0, x is an element of R-d, d >= 2. Let d(n) be the longest edge length of the nearest-neighbor graph on these points. We show that (lambda(-1) log n)(1-1/alpha) d(n) - b(n) converges weakly to the Gumbel distribution, where b(n) similar to ((d - 1)/lambda alpha) log log n. We also prove the following strong law for the normalized nearest-neighbor distance (d) over tilde (n) = (lambda(-1) log n)(1-1/alpha) d(n)/log log n: (d - 1)/alpha lambda <= lim inf(n ->infinity) (d) over tilde (n) <= lim sup(n ->infinity) (d) over tilde (n) <= d/alpha lambda almost surely. Thus, the exponential rate of decay alpha = 1 is critical, in the sense that, for alpha > 1, d(n) -> 0, whereas, for alpha <= 1, d(n) -> infinity almost surely as n -> infinity.

Effect of Strain Rate on Evolution of the Deformation Microstructure and Texture in Polycrystalline Copper and Nickel

The evolution of crystallographic texture in polycrystalline copper and nickel has been studied. The deformation texture evolution in these two materials over seven orders of magnitude of strain rate from 3 x 10(-4) to similar to 2.0 x 10(+3) s(-1) show little dependence on the stacking fault energy (SFE) and the amount of deformation. Higher strain rate deformation in nickel leads to weakerh < 101 > texture because of extensive microband formation and grain fragmentation. This behavior, in turn, causes less plastic spin and hence retards texture evolution. Copper maintains the stable end < 101 > component over large strain rates (from 3 x 10(-4) to 10(+2) s(-1)) because of its higher strain-hardening rate that resists formation of deformation heterogeneities. At higher strain rates of the order of 2 x 10(+3) s(-1), the adiabatic temperature rise assists in continuous dynamic recrystallization that leads to an increase in the volume fraction of the < 101 > component. Thus, strain-hardening behavior plays a significant role in the texture evolution of face-centered cubic materials. In addition, factors governing the onset of restoration mechanisms like purity and melting point govern texture evolution at high strain rates. SFE may play a secondary role by governing the propensity of cross slip that in turn helps in the activation of restoration processes.

High-Temperature (1023 K to 1273 K 750 degrees C to 1000 degrees C]) Plastic Deformation Behavior of B-Modified Ti-6Al-4V Alloys: Temperature and Strain Rate Effects

A minor addition of B to the Ti-6Al-4V alloy, by similar to 0.1 wt pct, reduces its as-cast prior beta grain size by an order of magnitude, whereas higher B content leads to the presence of in situ formed TiB needles in significant amounts. An experimental investigation into the role played by these microstructural modifications on the high-temperature deformation behavior of Ti-6Al-4V-xB alloys, with x varying between 0 wt pct and 0.55 wt pct, was conducted. Uniaxial compression tests were performed in the temperature range of 1023 K to 1273 K (750 degrees C to 1000 degrees C) and in the strain rate range of 10(-3) to 10(+1) s(-1). True stress-true strain responses of all alloys exhibit flow softening at lower strain rates and oscillations at higher strain rates. The flow softening is aided by the occurrence of dynamic recrystallization through lath globularization in high temperature (1173 K to 1273 K 900 degrees C to 1000 degrees C]) and a lower strain rate (10(-2) to 10(-3) s(-1)) regime. The grain size refinement with the B addition to Ti64, despite being marked, had no significant effect on this. Oscillations in the flow curve at a higher strain rate (10(0) to 10(+1) s(-1)), however, are associated with microstructural instabilities such as bending of laths, breaking of lath boundaries, generation of cavities, and breakage of TiB needles. The presence of TiB needles affected the instability regime. Microstructural evidence suggests that the matrix cavitation is aided by the easy fracture of TiB needles.

Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems

In this paper, a novel genetic algorithm is developed by generating artificial chromosomes with probability control to solve the machine scheduling problems. Generating artificial chromosomes for Genetic Algorithm (ACGA) is closely related to Evolutionary Algorithms Based on Probabilistic Models (EAPM). The artificial chromosomes are generated by a probability model that extracts the gene information from current population. ACGA is considered as a hybrid algorithm because both the conventional genetic operators and a probability model are integrated. The ACGA proposed in this paper, further employs the ``evaporation concept'' applied in Ant Colony Optimization (ACO) to solve the permutation flowshop problem. The ``evaporation concept'' is used to reduce the effect of past experience and to explore new alternative solutions. In this paper, we propose three different methods for the probability of evaporation. This probability of evaporation is applied as soon as a job is assigned to a position in the permutation flowshop problem. Experimental results show that our ACGA with the evaporation concept gives better performance than some algorithms in the literature.

Effect of favorable pressure gradient on transitional spot formation rate

The calculation of the transitional boundary layer requires estimates of the extent of the transition zone, which in turn depends on the rate at which turbulent spots are formed. This rate has been found to scale with local boundary layer thickness and viscosity, and the resulting nondimensional group (called crumble) is a function of the pressure gradient, among other parameters. Available experimental data are analyzed to show that the crumble increases slowly with increasing favorable pressure gradients, being about four times as large as in constant-pressure flow when the Thwaites pressure gradient parameter at the effective origin of the resulting turbulent boundary layer is 0.1 and when transition is driven by free-stream turbulence.

A Low-Complexity Algorithm for Intrusion Detection in a PIR-Based Wireless Sensor Network

We present a low-complexity algorithm for intrusion detection in the presence of clutter arising from wind-blown vegetation, using Passive Infra-Red (PIR) sensors in a Wireless Sensor Network (WSN). The algorithm is based on a combination of Haar Transform (HT) and Support-Vector-Machine (SVM) based training and was field tested in a network setting comprising of 15-20 sensing nodes. Also contained in this paper is a closed-form expression for the signal generated by an intruder moving at a constant velocity. It is shown how this expression can be exploited to determine the direction of motion information and the velocity of the intruder from the signals of three well-positioned sensors.

Measurement of the corrosion rate of aluminium in sodium hydroxide using holographic interferometry

The application of holographic interferometry to the measurement of the corrosion rate of aluminium in sodium hydroxide is investigated. Details of the fabrication of the corrosion cell and the experimental procedure are given. Thickness loss of aluminium was found for different dissolution times and compared with the conventional weight-loss method using a microbalance.

Position and Feed-Rate Control for Contouring Numerical-Control Systems

Numerical control (NC) for contouring operations requires precise control of position and feed rate for approximating the contour by linear moves of the cutter. A control scheme, for generating linear moves with desired slopes for the cutter, is described. This scheme provides for nine successive linear moves, and may be either expanded or implemented in succession, for approximating a contour.

Almost Stable Matchings by Truncating the Gale–Shapley Algorithm

We show that the ratio of matched individuals to blocking pairs grows linearly with the number of propose–accept rounds executed by the Gale–Shapley algorithm for the stable marriage problem. Consequently, the participants can arrive at an almost stable matching even without full information about the problem instance; for each participant, knowing only its local neighbourhood is enough. In distributed-systems parlance, this means that if each person has only a constant number of acceptable partners, an almost stable matching emerges after a constant number of synchronous communication rounds. We apply our results to give a distributed (2 + ε)-approximation algorithm for maximum-weight matching in bicoloured graphs and a centralised randomised constant-time approximation scheme for estimating the size of a stable matching.

A local 2-approximation algorithm for the vertex cover problem

We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (Δ + 1)2 synchronous communication rounds, where Δ is the maximum degree of the graph. For Δ = 3, we give a 2-approximation algorithm also for the weighted version of the problem.