Alternating direction implicit numerical method for the space and time fractional Bloch-Torrey equation in 3-D

Recently, some authors have considered a new diffusion model–space and time fractional Bloch-Torrey equation (ST-FBTE). Magin et al. (2008) have derived analytical solutions with fractional order dynamics in space (i.e., _ = 1, β an arbitrary real number, 1 < β ≤ 2) and time (i.e., 0 < α < 1, and β = 2), respectively. Yu et al. (2011) have derived an analytical solution and an effective implicit numerical method for solving ST-FBTEs, and also discussed the stability and convergence of the implicit numerical method. However, due to the computational overheads necessary to perform the simulations for nuclear magnetic resonance (NMR) in three dimensions, they present a study based on a two-dimensional example to confirm their theoretical analysis. Alternating direction implicit (ADI) schemes have been proposed for the numerical simulations of classic differential equations. The ADI schemes will reduce a multidimensional problem to a series of independent one-dimensional problems and are thus computationally efficient. In this paper, we consider the numerical solution of a ST-FBTE on a finite domain. The time and space derivatives in the ST-FBTE are replaced by the Caputo and the sequential Riesz fractional derivatives, respectively. A fractional alternating direction implicit scheme (FADIS) for the ST-FBTE in 3-D is proposed. Stability and convergence properties of the FADIS are discussed. Finally, some numerical results for ST-FBTE are given.

The Galerkin finite element approximation of the fractional cable equation

The cable equation is one of the most fundamental equations for modeling neuronal dynamics. Cable equations with a fractional order temporal derivative have been introduced to model electrotonic properties of spiny neuronal dendrites. In this paper, the fractional cable equation involving two integro-differential operators is considered. The Galerkin finite element approximations of the fractional cable equation are proposed. The main contribution of this work is outlined as follow: • A semi-discrete finite difference approximation in time is proposed. We prove that the scheme is unconditionally stable, and the numerical solution converges to the exact solution with order O(Δt). • A semi-discrete difference scheme for improving the order of convergence for solving the fractional cable equation is proposed, and the numerical solution converges to the exact solution with order O((Δt)2). • Based on the above semi-discrete difference approximations, Galerkin finite element approximations in space for a full discretization are also investigated. • Finally, some numerical results are given to demonstrate the theoretical analysis.

Analytical solutions for the two- and three-dimensional time-fractional telegraph equations by the method of separating variables

In this paper, a method of separating variables is effectively implemented for solving a time-fractional telegraph equation (TFTE) in two and three dimensions. We discuss and derive the analytical solution of the TFTE in two and three dimensions with nonhomogeneous Dirichlet boundary condition. This method can be extended to other kinds of the boundary conditions.

Friedman Economic Policies, Social Exclusion and Crime: Toward a Gendered Left Realist Subcultural Theory.

Left realists contend that people lacking legitimate means of solving the problem of relative deprivation may come into contact with other frustrated disenfranchised people and form subcultures, which in turn, encourage criminal behaviors. Absent from this theory is an attempt to address how, today, subcultural development in North America and elsewhere is heavily shaped simultaneously by the recent destructive consequences of right-wing Friedman or Chicago School economic policies and marginalized men's attempts to live up to the principles of hegemonic masculinity. The purpose of this paper, then, is to offer a new left realist theory that emphasizes the contribution of these two key determinants.

Analysing and improving a recruitment process : a teaching case for developing business process improvement capabilities

The demand for Business Process Management (BPM) is rapidly rising and with that, the need for capable BPM professionals is also rising. Yet, only a very few structured BPM training/ education programs are available, across universities and professional trainers globally. The ‘lack of appropriate teaching resources’ has been identified as a critical issue for BPM educators in prior studies. Case-based teaching can be an effective means of educating future BPM professionals. A main reason is that cases create an authentic learning environment where the complexities and challenges of the ‘real world’ can be presented in a narrative enabling the students to develop crucial skills such as problem solving, analysis and creativity-within-constraints, and to apply the tools and techniques within a richer and real (or proxy to real) context. However, so far well documented BPM teaching cases are scarce. This article aims to contribute to address this gap by providing a comprehensive teaching case and teaching notes that facilitates the education of selected process improvement phases, namely identification, modelling, analysis, and improvement. The article is divided into three main parts: (i) Introductory teaching notes, (ii) The case narrative, and (iii) Student activities from the case and teaching notes.

Surface plasmon hybridization and exciton coupling

We derive a semianalytical model to describe the interaction of a single photon emitter and a collection of arbitrarily shaped metal nanoparticles. The theory treats the metal nanoparticles classically within the electrostatic eigenmode method, wherein the surface plasmon resonances of collections of nanoparticles are represented by the hybridization of the plasmon modes of the noninteracting particles. The single photon emitter is represented by a quantum mechanical two-level system that exhibits line broadening due to a finite spontaneous decay rate. Plasmon-emitter coupling is described by solving the resulting Bloch equations. We illustrate the theory by studying model systems consisting of a single emitter coupled to one, two, and three nanoparticles, and we also compare the predictions of our model to published experimental data. ©2012 American Physical Society.

Analytical and numerical solutions of the space and time fractional bloch-torrey equation

Fractional order dynamics in physics, particularly when applied to diffusion, leads to an extension of the concept of Brown-ian motion through a generalization of the Gaussian probability function to what is termed anomalous diffusion. As MRI is applied with increasing temporal and spatial resolution, the spin dynamics are being examined more closely; such examinations extend our knowledge of biological materials through a detailed analysis of relaxation time distribution and water diffusion heterogeneity. Here the dynamic models become more complex as they attempt to correlate new data with a multiplicity of tissue compartments where processes are often anisotropic. Anomalous diffusion in the human brain using fractional order calculus has been investigated. Recently, a new diffusion model was proposed by solving the Bloch-Torrey equation using fractional order calculus with respect to time and space (see R.L. Magin et al., J. Magnetic Resonance, 190 (2008) 255-270). However effective numerical methods and supporting error analyses for the fractional Bloch-Torrey equation are still limited. In this paper, the space and time fractional Bloch-Torrey equation (ST-FBTE) is considered. The time and space derivatives in the ST-FBTE are replaced by the Caputo and the sequential Riesz fractional derivatives, respectively. Firstly, we derive an analytical solution for the ST-FBTE with initial and boundary conditions on a finite domain. Secondly, we propose an implicit numerical method (INM) for the ST-FBTE, and the stability and convergence of the INM are investigated. We prove that the implicit numerical method for the ST-FBTE is unconditionally stable and convergent. Finally, we present some numerical results that support our theoretical analysis.

Innovative damage assessment of steel truss bridges using modal strain energy correlation

As a part of vital infrastructure and transportation network, bridge structures must function safely at all times. Bridges are designed to have a long life span. At any point in time, however, some bridges are aged. The ageing of bridge structures, given the rapidly growing demand of heavy and fast inter-city passages and continuous increase of freight transportation, would require diligence on bridge owners to ensure that the infrastructure is healthy at reasonable cost. In recent decades, a new technique, structural health monitoring (SHM), has emerged to meet this challenge. In this new engineering discipline, structural modal identification and damage detection have formed a vital component. Witnessed by an increasing number of publications is that the change in vibration characteristics is widely and deeply investigated to assess structural damage. Although a number of publications have addressed the feasibility of various methods through experimental verifications, few of them have focused on steel truss bridges. Finding a feasible vibration-based damage indicator for steel truss bridges and solving the difficulties in practical modal identification to support damage detection motivated this research project. This research was to derive an innovative method to assess structural damage in steel truss bridges. First, it proposed a new damage indicator that relies on optimising the correlation between theoretical and measured modal strain energy. The optimisation is powered by a newly proposed multilayer genetic algorithm. In addition, a selection criterion for damage-sensitive modes has been studied to achieve more efficient and accurate damage detection results. Second, in order to support the proposed damage indicator, the research studied the applications of two state-of-the-art modal identification techniques by considering some practical difficulties: the limited instrumentation, the influence of environmental noise, the difficulties in finite element model updating, and the data selection problem in the output-only modal identification methods. The numerical (by a planer truss model) and experimental (by a laboratory through truss bridge) verifications have proved the effectiveness and feasibility of the proposed damage detection scheme. The modal strain energy-based indicator was found to be sensitive to the damage in steel truss bridges with incomplete measurement. It has shown the damage indicator's potential in practical applications of steel truss bridges. Lastly, the achievement and limitation of this study, and lessons learnt from the modal analysis have been summarised.

Scheduling techniques to optimise rail operations

In Australia, railway systems play a vital role in transporting the sugarcane crop from farms to mills. The sugarcane transport system is very complex and uses daily schedules, consisting of a set of locomotives runs, to satisfy the requirements of the mill and harvesters. The total cost of sugarcane transport operations is very high; over 35% of the total cost of sugarcane production in Australia is incurred in cane transport. Efficient schedules for sugarcane transport can reduce the cost and limit the negative effects that this system can have on the raw sugar production system. There are several benefits to formulating the train scheduling problem as a blocking parallel-machine job shop scheduling (BPMJSS) problem, namely to prevent two trains passing in one section at the same time; to keep the train activities (operations) in sequence during each run (trip) by applying precedence constraints; to pass the trains on one section in the correct order (priorities of passing trains) by applying disjunctive constraints; and, to ease passing trains by solving rail conflicts by applying blocking constraints and Parallel Machine Scheduling. Therefore, the sugarcane rail operations are formulated as BPMJSS problem. A mixed integer programming and constraint programming approaches are used to describe the BPMJSS problem. The model is solved by the integration of constraint programming, mixed integer programming and search techniques. The optimality performance is tested by Optimization Programming Language (OPL) and CPLEX software on small and large size instances based on specific criteria. A real life problem is used to verify and validate the approach. Constructive heuristics and new metaheuristics including simulated annealing and tabu search are proposed to solve this complex and NP-hard scheduling problem and produce a more efficient scheduling system. Innovative hybrid and hyper metaheuristic techniques are developed and coded using C# language to improve the solutions quality and CPU time. Hybrid techniques depend on integrating heuristic and metaheuristic techniques consecutively, while hyper techniques are the complete integration between different metaheuristic techniques, heuristic techniques, or both.

Document clustering evaluation : Divergence from a random baseline

Divergence from a random baseline is a technique for the evaluation of document clustering. It ensures cluster quality measures are performing work that prevents ineffective clusterings from giving high scores to clusterings that provide no useful result. These concepts are defined and analysed using intrinsic and extrinsic approaches to the evaluation of document cluster quality. This includes the classical clusters to categories approach and a novel approach that uses ad hoc information retrieval. The divergence from a random baseline approach is able to differentiate ineffective clusterings encountered in the INEX XML Mining track. It also appears to perform a normalisation similar to the Normalised Mutual Information (NMI) measure but it can be applied to any measure of cluster quality. When it is applied to the intrinsic measure of distortion as measured by RMSE, subtraction from a random baseline provides a clear optimum that is not apparent otherwise. This approach can be applied to any clustering evaluation. This paper describes its use in the context of document clustering evaluation.

From the editor

In this Project Management Journal issue, the reader will “travel” from human capital to portfolio selection through knowledge development and maturity, systems thinking and problem (dis)solving, and development of combinative capabilities...

Reflection in Integrated Problem Based Learning : 20 years of continuing application to the teaching of architecture

In 1984 the School of Architecture and Built Environment within the University of Newcastle, Australia introduced an integrated program based on real design projects and using Integrated Problem Based Learning (IPBL) as the teaching method. Since 1984 there have been multiple changes arising from the expectations of the architectural fraternity, enrolling students, lecturers, available facilities, accreditation authorities and many others. These challenges have been successfully accommodated whilst maintaining the original purposes and principles of IPBL. The Architecture program has a combined two-degree structure consisting of a first degree, Bachelor of Science (Architecture), followed by a second degree, Bachelor of Architecture. The program is designed to simulate the problem-solving situations that face a working architect in every day practice. This paper will present the degree structure where each student is enrolled in a single course per semester incorporating design integration and study areas in design studies, professional studies, historical studies, technical studies, environmental studies and communication skills. Each year the design problems increase in complexity and duration set around an annual theme. With 20 years of successful delivery of any program there are highlights and challenges along the way and this paper will discuss some of the successes and barriers experienced within the School of Architecture and Built Environment in delivering IPBL. In addition, the reflective process investigates the currency of IPBL as an appropriate vehicle for delivering the curriculum in 2004 and any additional administrative or staff considerations required to enhance the continuing application of IPBL.

Computationally sound automated proofs of cryptographic schemes

Proving security of cryptographic schemes, which normally are short algorithms, has been known to be time-consuming and easy to get wrong. Using computers to analyse their security can help to solve the problem. This thesis focuses on methods of using computers to verify security of such schemes in cryptographic models. The contributions of this thesis to automated security proofs of cryptographic schemes can be divided into two groups: indirect and direct techniques. Regarding indirect ones, we propose a technique to verify the security of public-key-based key exchange protocols. Security of such protocols has been able to be proved automatically using an existing tool, but in a noncryptographic model. We show that under some conditions, security in that non-cryptographic model implies security in a common cryptographic one, the Bellare-Rogaway model [11]. The implication enables one to use that existing tool, which was designed to work with a different type of model, in order to achieve security proofs of public-key-based key exchange protocols in a cryptographic model. For direct techniques, we have two contributions. The first is a tool to verify Diffie-Hellmanbased key exchange protocols. In that work, we design a simple programming language for specifying Diffie-Hellman-based key exchange algorithms. The language has a semantics based on a cryptographic model, the Bellare-Rogaway model [11]. From the semantics, we build a Hoare-style logic which allows us to reason about the security of a key exchange algorithm, specified as a pair of initiator and responder programs. The other contribution to the direct technique line is on automated proofs for computational indistinguishability. Unlike the two other contributions, this one does not treat a fixed class of protocols. We construct a generic formalism which allows one to model the security problem of a variety of classes of cryptographic schemes as the indistinguishability between two pieces of information. We also design and implement an algorithm for solving indistinguishability problems. Compared to the two other works, this one covers significantly more types of schemes, but consequently, it can verify only weaker forms of security.

Supporting the learning of rapid application development in a database environment

Intelligent Tutoring Systems (ITSs) are computer systems designed to provide individualised help to students, learning in a problem solving context. The difference between an ITS and a Computer Assisted Instruction (CAI) system is that an ITS has a Student Model which allows it to provide a better educational environment. The Student Model contains information on what the student knows, and does not know, about the domain being learnt, as well as other personal characteristics such as preferred learning style. This research has resulted in the design and development of a new ITS: Personal Access Tutor (PAT). PAT is an ITS that helps students to learn Rapid Application Development in a database environment. More specifically, PAT focuses on helping students to learn how to create forms and reports in Microsoft Access. To provide an augmented learning environment, PAT’s architecture is different to most other ITSs. Instead of having a simulation, PAT uses a widelyused database development environment (Microsoft Access). This enables the students to ask for help, while developing real applications using real database software. As part of this research, I designed and created the knowledge base required for PAT. This contains four models: the domain, student, tutoring and exercises models. The Instructional Expert I created for PAT provides individualised help to the students to help them correctly finish each exercise, and also proposes the next exercise that a student should work on. PAT was evaluated by students enrolled in the Databases subject at QUT, and by staff members involved in teaching the subject. The results of the evaluation were positive and are discussed in the thesis.

A method for systematically pooling data in very early stage construction price forecasting

Client owners usually need an estimate or forecast of their likely building costs in advance of detailed design in order to confirm the financial feasibility of their projects. Because of their timing in the project life cycle, these early stage forecasts are characterized by the minimal amount of information available concerning the new (target) project to the point that often only its size and type are known. One approach is to use the mean contract sum of a sample, or base group, of previous projects of a similar type and size to the project for which the estimate is needed. Bernoulli’s law of large numbers implies that this base group should be as large as possible. However, increasing the size of the base group inevitably involves including projects that are less and less similar to the target project. Deciding on the optimal number of base group projects is known as the homogeneity or pooling problem. A method of solving the homogeneity problem is described involving the use of closed form equations to compare three different sampling arrangements of previous projects for their simulated forecasting ability by a cross-validation method, where a series of targets are extracted, with replacement, from the groups and compared with the mean value of the projects in the base groups. The procedure is then demonstrated with 450 Hong Kong projects (with different project types: Residential, Commercial centre, Car parking, Social community centre, School, Office, Hotel, Industrial, University and Hospital) clustered into base groups according to their type and size.