The accurate finite element analysis of subregions of large structures is difficult to carry out because of uncertainties about how the rest of the structure influences the boundary conditions and loadings of the subregion model. This dissertation describes the theoretical development and computer implementation of a new approach to this problem of modeling subregions. This method, the specified boundary stiffness/force (SBSF) method, results in accurate displacement and stress solutions as the boundary loading and the interaction between the stiffness of the subregion and the rest of the structure are taken into account. This method is computationally efficient because each time that the subregion model is analyzed, only the equations involving the degrees of freedom within the subregion model are solved. Numerical examples are presented which compare this method to some of the existing methods for subregion analysis on the basis of both accuracy of results and computational efficiency. The SBSF method is shown to be more accurate than another approximate method, the specified boundary displacement (SBD) method and to require approximately the same number of computations for the solution. For one case, the average error in the results of the SBD method was +2.75% while for the SBSF method the average error was -0.3%. The comparisons between the SBSF method and the efficient and exact zooming methods demonstrate that the SBSF method is less accurate than these methods but is computationally more efficient. In one example, the error for the exact zooming method was -0.9% while for the SBSF method it was -3.7%. Computationally, the exact zooming method requires almost 185% more operations than the SBSF method. Similar results were obtained for the comparison of the efficient zooming method and the SBSF method. Another use of the SBSF method is in the analysis of design changes which are incorporated into the subregion model but not into the parent model. In one subregion model a circular hole was changed to an elliptical hole. The boundary forces and stiffnesses from the parent model with the circular hole were used in the analysis of the modified subregion model. The results of the analysis of the most refined mesh in this example had an error of only -0.52% when compared to the theoretical result for the modified geometry. The results of the research presented in this dissertation indicate that the SBSF method is better suited to the analysis of subregions than the other methods documented in the literature. The method is both accurate and computationally efficient as well as easy to use and implement. The SBSF method can also be extended to the accurate analysis of subregion models with design changes which are not incorporated into the parent model. / Ph. D.

Abstract not available

"February 2003." Corrigenda for, inserted at back Includes bibliographical references (leaves 475-524 ) A methodology is formulated for the successful design and implementation of artificial neural networks (ANN) models for water resources applications. Attention is paid to each of the steps that should be followed in order to develop an optimal ANN model; including when ANNs should be used in preference to more conventional statistical models; dividing the available data into subsets for modelling purposes; deciding on a suitable data transformation; determination of significant model inputs; choice of network type and architecture; selection of an appropriate performance measure; training (optimisation) of the networks weights; and, deployment of the optimised ANN model in an operational environment. The developed methodology is successfully applied to two water resorces case studies; the forecasting of salinity in the River Murray at Murray Bridge, South Australia; and the the forecasting of cyanobacteria (Anabaena spp.) in the River Murray at Morgan, South Australia.

This research is motivated by the recent developments in the Internet Engineering Task Force (IETF) to support seamless integration of moving networks deployed in vehicles to the global Internet. The effort, known as Network Mobility (NEMO), paves the way to support high-speed Internet access in mass transit systems, e.g. trains; buses; ferries; and planes; through the use of on-board mobile routers embedded in the vehicle. One of the critical research challenges of this vision is to achieve high-speed and reliable back-haul connectivity between the mobile router and the rest of the Internet. The problem is particularly challenging due to the fact that a mobile router must rely on wireless links with limited bandwidth and unpredictable quality variations as the vehicle moves around. In this thesis, the multi-homing concept is applied to approach the problem. With multi-homing, mobile router has more than one connection to the Internet. This is achieved by connecting the mobile router to a diverse array of wireless access technologies (e.g., GPRS, CDMA, 802.11, and 802.16) and/or a multiplicity of wireless service providers. While the aggregation helps addressing the bandwidth problem, quality variation problem can be mitigated by employing advanced traffic engineering techniques that dynamically control inbound and outbound traffic over multiple connections. More specifically, the thesis investigates traffic engineering solutions for mobile networks that can effectively address the performance objectives, e.g. maximizing profit for mobile network operator; guaranteeing quality of service for the users; and maintaining fair access to the back-haul bandwidth. Traffic engineering solutions with three different levels of control have been investigated. First, it is shown, using detailed computer simulation of popular applications and networking protocols(e.g., File Transfer Protocol and Transmission Control Protocol), that packet-level traffic engineering which makes decisions of which Internet connection to use for each and every packet, leads to poor system throughput. The main problem with packet-based traffic engineering stems from the fact that in mobile environment where link bandwidths and delay can vary significantly, packets using different connections may experience different delays causing unexpected arrivals at destinations. Second, a maximum utility flow-level traffic engineering has been proposed that aims to maximize a utility function that accounts for bandwidth utilization on the one hand, and fairness on the other. The proposed solution is compared against previously proposed flow-level traffic engineering schemes and shown to have better performance in terms of throughput and fairness. The third traffic engineering proposal addresses the issue of maximizing operator?s profit when different Internet connections have different charging rates, and guaranteeing per user bandwidth through admission control. Finally, a new signaling protocol is designed to allow the mobile router to control its inbound traffic.

"February 2003." / Corrigenda for, inserted at back / Includes bibliographical references (leaves 475-524 ) / xxx, 524 leaves : ill. ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / A methodology is formulated for the successful design and implementation of artificial neural networks (ANN) models for water resources applications. Attention is paid to each of the steps that should be followed in order to develop an optimal ANN model; including when ANNs should be used in preference to more conventional statistical models; dividing the available data into subsets for modelling purposes; deciding on a suitable data transformation; determination of significant model inputs; choice of network type and architecture; selection of an appropriate performance measure; training (optimisation) of the networks weights; and, deployment of the optimised ANN model in an operational environment. The developed methodology is successfully applied to two water resorces case studies; the forecasting of salinity in the River Murray at Murray Bridge, South Australia; and the the forecasting of cyanobacteria (Anabaena spp.) in the River Murray at Morgan, South Australia. / Thesis (Ph.D.)--University of Adelaide, School of Civil and Environmental Engineering, 2003

Flow of traffic on freeways and limited access highways can be represented as a series of kinemetic waves. Solutions to these systems of equations become problematic under congested traffic flow conditions, and under complicated (real-world) networks. A simplified theory of kinematics waves was previously proposed. Simplifying elements includes translation of the problem to moving coordinate system, adoption of bi-linear speed-density relationships, and adoption of restrictive constraints at the on- and off-ramps. However, these simplifying assumptions preclude application of this technique to most practical situations. This research explores the limitations of the simplified theory of kinematic waves. First this research documents a relaxation of several key constraints. In the original theory, priority was given to on-ramp merging vehicles so that they can bypass any queue at the merge. This research proposes to relax this constraint using a capacity-based weighted fair queuing (CBWFQ) merge model. In the original theory, downstream queue affects upstream traffic as a whole and exiting traffic can always be able to leave as long as it gets to the diverge. This research proposes that this diverge constraint be replaced with a contribution-based weighted splitting (CBWS) diverge model. This research proposes a revised notation system, permitting the solution techniques to be extended to freeway networks with multiple freeways and their ramps. This research proposes a generalization to permit application of the revised theory to general transportation networks. A generalized CBWFQ merge model and a generalized CBWS diverge model are formulated to deal with merging and diverging traffic. Finally, this research presents computational procedure for solving the new system of equations. Comparisons of model predictions with field observations are conducted on GA 400 in Atlanta. Investigations into the performance of the proposed CBWFQ and CBWS models are conducted. Results are quite encouraging, quantitative measures suggest satisfactory accuracy with narrow confidence interval.

The analysis of similarity of matrices over fields, as well as integral domains which are not fields, is a classical problem in Linear Algebra and has received considerable attention. A related problem is that of simultaneous similarity of matrices. Many interesting algebraic questions that arise in such problems are discussed by Shmuel Friedland[1]. A special case of this problem is that of Simultaneous Unitary Similarity of hermitian matrices, which we describe as follows: Given a collection of m ordered pairs of similar n×n hermitian matrices denoted by {(Hl,Dl)}ml=1, 1. determine if there exists a unitary matrix U such that UHl U∗ = Dl for all l, 2. and in the case where a U exists, find such a U, (where U∗is the transpose conjugate of U ).The problem is easy for m =1. The problem is challenging for m > 1.The problem stated above is the algorithmic version of the problem of classifying hermitian matrices upto unitary similarity. Any problem involving classification of matrices up to similarity is considered to be “wild”[2]. The difficulty in solving the problem of classifying matrices up to unitary similarity is a indicator of, the toughness of problems involving matrices in unitary spaces [3](pg, 44-46 ).Suppose in the statement of the problem we replace the collection {(Hl,Dl)}ml=1, by a collection of m ordered pairs of complex square matrices denoted by {(Al,Bl) ml=1, then we get the Simultaneous Unitary Similarity problem for square matrices. Suppose we consider k ordered pairs of complex rectangular m ×n matrices denoted by {(Yl,Zl)}kl=1, then the Simultaneous Unitary Equivalence problem for rectangular matrices is the problem of finding whether there exists a m×m unitary matrix U and a n×n unitary matrix V such that UYlV ∗= Zl for all l and in the case they exist find them. In this thesis we describe algorithms to solve these problems. The Simultaneous Unitary Similarity problem for square matrices is challenging for even a single pair (m = 1) if the matrices involved i,e A1,B1 are not normal. In an expository article, Shapiro[4]describes the methods available to solve this problem by arriving at a canonical form. That is A1 or B1 is used to arrive at a canonical form and the matrices are unitarily similar if and only if the other matrix also leads to the same canonical form. In this thesis, in the second chapter we propose an iterative algorithm to solve the Simultaneous Unitary Similarity problem for hermitian matrices. In each iteration we either get a step closer to “the simple case” or end up solving the problem. The simple case which we describe in detail in the first chapter corresponds to finding whether there exists a diagonal unitary matrix U such that UHlU∗= Dl for all l. Solving this case involves defining “paths” made up of non-zero entries of Hl (or Dl). We use these paths to define an equivalence relation that partitions L = {1,…n}. Using these paths we associate scalars with each Hl(i,j) and Dl(i,j)denoted by pr(Hl(i,j)) and pr(Dl(i,j)) (pr is used to indicate that these scalars are obtained by considering products of non-zero elements along the paths from i,j to their class representative). Suppose i (I Є L)belongs to the class[d(i)](d(i) Є L) we denote by uisol a modulus one scalar expressed in terms of ud(i) using the path from i to d( i). The free variable ud(i) can be chosen to be any modulus one scalar. Let U sol be a diagonal unitary matrix given by U sol = diag(u1 sol , u2 sol , unsol ). We show that a diagonal U such that U HlU∗ = Dl exists if and only if pr(Hl(i, j)) = pr(Dl(i, j))for all l, i, j and UsolHlUsol∗= Dl. Solving the simple case sets the trend for solving the general case. In the general case in an iteration we are looking for a unitary U such that U = blk −diag(U1,…, Ur) where each Ui is a pi ×p (i, j Є L = {1,… , r}) unitary matrix such that U HlU ∗= Dl. Our aim in each iteration is to get at least a step closer to the simple case. Based on pi we partition the rows and columns of Hl and Dl to obtain pi ×pj sub-matrices denoted by Flij in Hl and Glij in D1. The aim is to diagonalize either Flij∗Flij Flij∗ and a get a step closer to the simple case. If square sub-matrices are multiples of unitary and rectangular sub-matrices are zeros we say that the collection is in Non-reductive-form and in this case we cannot get a step closer to the simple case. In Non- reductive-form just as in the simple case we define a relation on L using paths made up of these non-zero (multiples of unitary) sub-matrices. We have a partition of L. Using these paths we associate with Flij and (G1ij ) matrices denoted by pr(F1ij) and pr(G1ij) respectively where pr(F1ij) and pr(G1ij) are multiples of unitary. If there exist pr(Flij) which are not multiples of identity then we diagonalize these matrices and move a step closer to the simple case and the given collection is said to be in Reduction-form. If not, the collection is in Solution-form. In Solution-form we identify a unitary matrix U sol = blk −diag(U1sol , U2 sol , …, Ur sol )where U isol is a pi ×pi unitary matrix that is expressed in terms of Ud(i) by using the path from i to[d(i)]( i Є [d(i)], d(i) Є L, Ud(i) is free). We show that there exists U such that U HlU∗ = Dl if and only if pr((Flij) = pr(G1ij) and U solHlU sol∗ = Dl. Thus in a maximum of n steps the algorithm solves the Simultaneous Unitary Similarity problem for hermitian matrices. In the second chapter we also relate the Simultaneous Unitary Similarity problem for hermitian matrices to the simultaneous closed system evolution problem for quantum states. In the third chapter we describe algorithms to solve the Unitary Similarity problem for square matrices (single ordered pair) and the Simultaneous Unitary Equivalence problem for rectangular matrices. These problems are related to the Simultaneous Unitary Similarity problem for hermitian matrices. The algorithms described in this chapter are similar in flow to the algorithm described in the second chapter. This shows that it is the fact that we are looking for unitary similarity that makes these forms possible. The hermitian (or normal)nature of the matrices is of secondary importance. Non-reductive-form is the same as in the hermitian case. The definition of the paths changes a little. But once the paths are defined and the set L is partitioned the definitions of Reduction-form and Solution-form are similar to their counterparts in the hermitian case. In the fourth chapter we analyze the worst case complexity of the proposed algorithms. The main computation in all these algorithms is that of diagonalizing normal matrices, partitioning L and calculating the products pr((Flij) = pr(G1ij). Finding the partition of L is like partitioning an undirected graph in the square case and partitioning a bi-graph in the rectangular case. Also, in this chapter we demonstrate the working of the proposed algorithms by running through the steps of the algorithms for three examples. In the fifth and the final chapter we show that finding if a given collection of ordered pairs of normal matrices is Simultaneously Similar is same as finding if the collection is Simultaneously Unitarily Similar. We also discuss why an algorithm to solve the Simultaneous Similarity problem, along the lines of the algorithms we have discussed in this thesis, may not exist. (For equations pl refer the pdf file)

This research is motivated by the recent developments in the Internet Engineering Task Force (IETF) to support seamless integration of moving networks deployed in vehicles to the global Internet. The effort, known as Network Mobility (NEMO), paves the way to support high-speed Internet access in mass transit systems, e.g. trains; buses; ferries; and planes; through the use of on-board mobile routers embedded in the vehicle. One of the critical research challenges of this vision is to achieve high-speed and reliable back-haul connectivity between the mobile router and the rest of the Internet. The problem is particularly challenging due to the fact that a mobile router must rely on wireless links with limited bandwidth and unpredictable quality variations as the vehicle moves around. In this thesis, the multi-homing concept is applied to approach the problem. With multi-homing, mobile router has more than one connection to the Internet. This is achieved by connecting the mobile router to a diverse array of wireless access technologies (e.g., GPRS, CDMA, 802.11, and 802.16) and/or a multiplicity of wireless service providers. While the aggregation helps addressing the bandwidth problem, quality variation problem can be mitigated by employing advanced traffic engineering techniques that dynamically control inbound and outbound traffic over multiple connections. More specifically, the thesis investigates traffic engineering solutions for mobile networks that can effectively address the performance objectives, e.g. maximizing profit for mobile network operator; guaranteeing quality of service for the users; and maintaining fair access to the back-haul bandwidth. Traffic engineering solutions with three different levels of control have been investigated. First, it is shown, using detailed computer simulation of popular applications and networking protocols(e.g., File Transfer Protocol and Transmission Control Protocol), that packet-level traffic engineering which makes decisions of which Internet connection to use for each and every packet, leads to poor system throughput. The main problem with packet-based traffic engineering stems from the fact that in mobile environment where link bandwidths and delay can vary significantly, packets using different connections may experience different delays causing unexpected arrivals at destinations. Second, a maximum utility flow-level traffic engineering has been proposed that aims to maximize a utility function that accounts for bandwidth utilization on the one hand, and fairness on the other. The proposed solution is compared against previously proposed flow-level traffic engineering schemes and shown to have better performance in terms of throughput and fairness. The third traffic engineering proposal addresses the issue of maximizing operator?s profit when different Internet connections have different charging rates, and guaranteeing per user bandwidth through admission control. Finally, a new signaling protocol is designed to allow the mobile router to control its inbound traffic.

The traditional approach to a digital investigation when a computer system is encountered in a running state is to remove the power, image the machine using a write blocker and then analyse the acquired image. This has the advantage of preserving the contents of the computer’s hard disk at that point in time. However, the disadvantage of this approach is that the preservation of the disk is at the expense of volatile data such as that stored in memory, which does not remain once the power is disconnected. There are an increasing number of situations where this traditional approach of ‘pulling the plug’ is not ideal since volatile data is relevant to the investigation; one of these situations is when the machine under investigation is using encryption. If encrypted data is encountered on a live machine, a live investigation can be performed to preserve this evidence in a form that can be later analysed. However, there are a number of difficulties with using evidence obtained from live investigations that may cause the reliability of such evidence to be questioned. This research investigates whether digital evidence obtained from live investigations involving encryption can be considered to be reliable. To determine this, a means of assessing reliability is established, which involves evaluating digital evidence against a set of criteria; evidence should be authentic, accurate and complete. This research considers how traditional digital investigations satisfy these requirements and then determines the extent to which evidence from live investigations involving encryption can satisfy the same criteria. This research concludes that it is possible for live digital evidence to be considered to be reliable, but that reliability of digital evidence ultimately depends on the specific investigation and the importance of the decision being made. However, the research provides structured criteria that allow the reliability of digital evidence to be assessed, demonstrates the use of these criteria in the context of live digital investigations involving encryption, and shows the extent to which each can currently be met.

The objective of the cellular manufacturing is to simplify the management of the<p>manufacturing industries. In regrouping the production of different parts into clusters,<p>the management of the manufacturing is reduced to manage different small<p>entities. One of the most important problems in the cellular manufacturing is the<p>design of these entities called cells. These cells represent a cluster of machines that<p>can be dedicated to the production of one or several parts. The ideal design of a<p>cellular manufacturing is to make these cells totally independent from one another,<p>i.e. that each part is dedicated to only one cell (i.e. if it can be achieved completely<p>inside this cell). The reality is a little more complex. Once the cells are created,<p>there exists still some traffic between them. This traffic corresponds to a transfer of<p>a part between two machines belonging to different cells. The final objective is to<p>reduce this traffic between the cells (called inter-cellular traffic).<p>Different methods exist to produce these cells and dedicated them to parts. To<p>create independent cells, the choice can be done between different ways to produce<p>each part. Two interdependent problems must be solved:<p>• the allocation of each operation on a machine: each part is defined by one or<p>several sequences of operations and each of them can be achieved by a set of<p>machines. A final sequence of machines must be chosen to produce each part.<p>• the grouping of each machine in cells producing traffic inside and outside the<p>cells.<p>In function of the solution to the first problem, different clusters will be created to<p>minimise the inter-cellular traffic.<p>In this thesis, an original method based on the grouping genetic algorithm (Gga)<p>is proposed to solve simultaneously these two interdependent problems. The efficiency<p>of the method is highlighted compared to the methods based on two integrated algorithms<p>or heuristics. Indeed, to form these cells of machines with the allocation<p>of operations on the machines, the used methods permitting to solve large scale<p>problems are generally composed by two nested algorithms. The main one calls the<p>secondary one to complete the first part of the solution. The application domain goes<p>beyond the manufacturing industry and can for example be applied to the design of<p>the electronic systems as explained in the future research.<p> / Doctorat en Sciences de l'ingénieur / info:eu-repo/semantics/nonPublished