Radiation transport in dust in disk geometry

The main objective of the research program is twofold: (1) to develop a computer code to solve the problem of scattering, absorption and emission of photons by dust grains in a dusty medium with 2 dimensional disk geometry, and (2) to study the various physical and geometrical effects of 2 dimensional radiation transport on the thermal structure and radiation field. These tasks were accomplished and are briefly summarized. The method for solving the radiation transport problem in disk geometry is a generalization of the quasi-diffusion method (QDM) previously developed by the author

Using infrared spectral features to probe circumstellar dust shells around cool stars

IRAS observations of cool stars provide low resolution spectra in the mid-infrared and also give fluxes at four wavelength bands from which color-color diagrams are constructed. The later have been used to study the evolution of these stars: as an O-rich star evolves to become a C-rich star and its detached dust shell moves further away, its evolution can be tracked on a color-color diagram. A major factor in determining the position of either C-rich or O-rich stars on the 12-25-60 micron color-color diagram is the presence of spectral features in the mid-IR. O-rich stars show a 9.8 micron silicate feature, while C-rich stars have a SiC feature at 11.2 microns. IRAS observations indicate that the SiC feature is quite narrow and uniform in shape showing little variation from star to star. The full width at half maximum (FWHM) is 1.6 + or - 0.15 microns. On the other hand, the shape of the silicate feature varies widely among the O-rich stars, with a FWHM ranging from 2 to 3 microns. The characteristics of circumstellar dust shells should manifest themselves both in the flux spectrum and in the details of the spectral features. To provide a coherent interpretation for these IRAS observations, models were constructed (using a radiative transfer code) of dust shells around O-rich and C-rich stars. Realistic grain opacities were used which include spectral features of varying intrinsic widths (e.g., Gaussian features at 10 microns with half width at half maximum of 0.5 and 1.0 microns)

Predicting incipent instabilities and bifurcations of nonlinear dynamical systems modelling compliant off-shore structures

For engineers, the two most important aspects of dynamical analysis are high amplitude resonance vibrations and structural stability, i.e. whether a steady state solution is stable under small perturbations. For the former case, a novel and simple method based on Poincare mapping technique has been devised to predict an imminent flip bifurcation. This bifurcation represents the beginning of the second order subharmonic response. For the latter case, we discovered that while classical quantitative analytical techniques work well in establishing the 'local' structural stability of a steady state solution, the global geometric structure of the catchment region can alter dramatically such that even an initial condition close to the steady state can diverge from it rather than being attracted. This phenomenon known as fractal basin boundary occurs when the invariant manifolds of the saddle separating the steady state solution from any remote attractor cross. The critical point in which the invariant manifolds just touch can be accurately predict by the Melinkov's method. Because of the complicated interwoven nature of the invariant manifolds, it is called a tangle. If the invariant manifolds are originated from the same saddle, the crossing is known as a homoclinic tangle, if originated from different saddle, a heteroclinic tangle. The critical point is then known as homoclinic or heteroclinic tangency. Tangles are also intimately related to chaotic behaviour. The creation and destruction of chaotic attractors have been observed through a series of homoclinic and heteroclinic tangency. In fact, after the invariant manifolds of an inverting saddle cross, the unstable manifold becomes the chaotic attractor. This leads us to believe that all chaotic attractors are topologically the same

Non-Intrusive Measurement in Packet Networks and its Applications

PhDNetwork measurementis becoming increasingly important as a meanst o assesst he performanceo f packet networks. Network performance can involve different aspects such as availability, link failure detection etc, but in this thesis, we will focus on Quality of Service (QoS). Among the metrics used to define QoS, we are particularly interested in end-to-end delay performance. Recently, the adoption of Service Level Agreements (SLA) between network operators and their customersh as becomea major driving force behind QoS measurementm: easurementi s necessaryt o produce evidence of fulfilment of the requirements specified in the SLA. Many attempts to do QoS based packet level measurement have been based on Active Measurement, in which the properties of the end-to-end path are tested by adding testing packets generated from the sending end. The main drawback of active probing is its intrusive nature which causes extraburden on the network, and has been shown to distort the measured condition of the network. The other category of network measurement is known as Passive Measurement. In contrast to Active Measurement, there are no testing packets injected into the network, therefore no intrusion is caused. The proposed applications using Passive Measurement are currently quite limited. But Passive Measurement may offer the potential for an entirely different perspective compared with Active Measurements In this thesis, the objective is to develop a measurement methodology for the end-to-end delay performance based on Passive Measurement. We assume that the nodes in a network domain are accessible.F or example, a network domain operatedb y a single network operator. The novel idea is to estimate the local per-hop delay distribution based on a hybrid approach (model and measurement-based)W. ith this approach,t he storagem easurementd ata requirement can be greatly alleviated and the overhead put in each local node can be minimized, so maintaining the fast switching operation in a local switcher or router. Per-hop delay distributions have been widely used to infer QoS at a single local node. However, the end-to-end delay distribution is more appropriate when quantifying delays across an end-to-end path. Our approach is to capture every local node's delay distribution, and then the end-to-end delay distribution can be obtained by convolving the estimated delay distributions. In this thesis, our algorithm is examined by comparing the proximity of the actual end-to-end delay distribution with the estimated one obtained by our measurement method under various conditions. e. g. in the presence of Markovian or Power-law traffic. Furthermore, the comparison between Active Measurement and our scheme is also studied. 2 Network operators may find our scheme useful when measuring the end-to-end delay performance. As stated earlier, our scheme has no intrusive effect. Furthermore, the measurement result in the local node can be re-usable to deduce other paths' end-to-end delay behaviour as long as this local node is included in the path. Thus our scheme is more scalable compared with active probing

A new and efficient intelligent collaboration scheme for fashion design

Technology-mediated collaboration process has been extensively studied for over a decade. Most applications with collaboration concepts reported in the literature focus on enhancing efficiency and effectiveness of the decision-making processes in objective and well-structured workflows. However, relatively few previous studies have investigated the applications of collaboration schemes to problems with subjective and unstructured nature. In this paper, we explore a new intelligent collaboration scheme for fashion design which, by nature, relies heavily on human judgment and creativity. Techniques such as multicriteria decision making, fuzzy logic, and artificial neural network (ANN) models are employed. Industrial data sets are used for the analysis. Our experimental results suggest that the proposed scheme exhibits significant improvement over the traditional method in terms of the time–cost effectiveness, and a company interview with design professionals has confirmed its effectiveness and significance

Deterministic Polynomial-Time Algorithms for Designing Short DNA Words

Designing short DNA words is a problem of constructing a set (i.e., code) of n DNA strings (i.e., words) with the minimum length such that the Hamming distance between each pair of words is at least k and the n words satisfy a set of additional constraints. This problem has applications in, e.g., DNA self-assembly and DNA arrays. Previous works include those that extended results from coding theory to obtain bounds on code and word sizes for biologically motivated constraints and those that applied heuristic local searches, genetic algorithms, and randomized algorithms. In particular, Kao, Sanghi, and Schweller (2009) developed polynomial-time randomized algorithms to construct n DNA words of length within a multiplicative constant of the smallest possible word length (e.g., 9 max{log n, k}) that satisfy various sets of constraints with high probability. In this paper, we give deterministic polynomial-time algorithms to construct DNA words based on derandomization techniques. Our algorithms can construct n DNA words of shorter length (e.g., 2.1 log n + 6.28 k) and satisfy the same sets of constraints as the words constructed by the algorithms of Kao et al. Furthermore, we extend these new algorithms to construct words that satisfy a larger set of constraints for which the algorithms of Kao et al. do not work.Comment: 27 page