A geometrical approach of 3-D FEA for educational purposes applied to electrostatic fields

A geometrical approach of the finite-element analysis applied to electrostatic fields is presented. This approach is particularly well adapted to teaching Finite Elements in Electrical Engineering courses at undergraduate level. The procedure leads to the same system of algebraic equations as that derived by classical approaches, such as variational principle or weighted residuals for nodal elements with plane symmetry. It is shown that the extension of the original procedure to three dimensions is straightforward, provided the domain be meshed in first-order tetrahedral elements. The element matrices are derived by applying Maxwell`s equations in integral form to suitably chosen surfaces in the finite-element mesh.

An Array Recursive Least-Squares Algorithm With Generic Nonfading Regularization Matrix

We present a novel array RLS algorithm with forgetting factor that circumvents the problem of fading regularization, inherent to the standard exponentially-weighted RLS, by allowing for time-varying regularization matrices with generic structure. Simulations in finite precision show the algorithm`s superiority as compared to alternative algorithms in the context of adaptive beamforming.

Rotation-discriminating template matching based on Fourier coefficients of radial projections with robustness to scaling and partial occlusion

We consider brightness/contrast-invariant and rotation-discriminating template matching that searches an image to analyze A for a query image Q We propose to use the complex coefficients of the discrete Fourier transform of the radial projections to compute new rotation-invariant local features. These coefficients can be efficiently obtained via FFT. We classify templates in ""stable"" and ""unstable"" ones and argue that any local feature-based template matching may fail to find unstable templates. We extract several stable sub-templates of Q and find them in A by comparing the features. The matchings of the sub-templates are combined using the Hough transform. As the features of A are computed only once, the algorithm can find quickly many different sub-templates in A, and it is Suitable for finding many query images in A, multi-scale searching and partial occlusion-robust template matching. (C) 2009 Elsevier Ltd. All rights reserved.

Distributed Estimation Over an Adaptive Incremental Network Based on the Affine Projection Algorithm

We study the problem of distributed estimation based on the affine projection algorithm (APA), which is developed from Newton`s method for minimizing a cost function. The proposed solution is formulated to ameliorate the limited convergence properties of least-mean-square (LMS) type distributed adaptive filters with colored inputs. The analysis of transient and steady-state performances at each individual node within the network is developed by using a weighted spatial-temporal energy conservation relation and confirmed by computer simulations. The simulation results also verify that the proposed algorithm provides not only a faster convergence rate but also an improved steady-state performance as compared to an LMS-based scheme. In addition, the new approach attains an acceptable misadjustment performance with lower computational and memory cost, provided the number of regressor vectors and filter length parameters are appropriately chosen, as compared to a distributed recursive-least-squares (RLS) based method.

The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm

This paper addresses the single machine scheduling problem with a common due date aiming to minimize earliness and tardiness penalties. Due to its complexity, most of the previous studies in the literature deal with this problem using heuristics and metaheuristics approaches. With the intention of contributing to the study of this problem, a branch-and-bound algorithm is proposed. Lower bounds and pruning rules that exploit properties of the problem are introduced. The proposed approach is examined through a computational comparative study with 280 problems involving different due date scenarios. In addition, the values of optimal solutions for small problems from a known benchmark are provided.

Variability in UVB Tolerances of Melanized and Nonmelanized Cells of Cryptococcus neoformans and C-laurentii

Solar radiation is one of the major factors responsible for the control of fungus populations in the environment. Inactivation by UVA and UVB radiation is especially important for the control of fungi that disperse infective units through the air, including fungi such as Cryptococcus spp. that infect their vertebrate hosts by inhalation. Cryptococcus neoformans produces melanin in the presence of certain exogenous substrates such as l-3,4 dihydroxyphenylalanine and melanization may protect the fungus against biotic and abiotic environmental factors. In the present study, we investigated the effect of exposure to an UVB irradiance of 1000 mW m(-2) (biologically effective weighted irradiance) on the survival of melanized and nonmelanized cells of four strains of C. neoformans and four strains of C. laurentii. The relative survival (survival of cells exposed to radiation in relation to cells not exposed) of cells grown 2, 4, 6 or 8 days on medium with or without L-dopa was determined after exposure to UVB doses of 1.8 and 3.6 kJ m(-2). Both the irradiance spectrum and the intensities of those doses are environmentally realistic, and, in fact, occur routinely during summer months in temperate regions. Differences in tolerance to UVB radiation were observed between the C. neoformans and C. laurentii strains. The C. neoformans strains were more susceptible to UVB radiation than the C. laurentii strains. In C. neoformans, differences in tolerance to radiation were observed during development of both melanized and nonmelanized cells. For most treatments (strain, time of growth and UVB dose), there were virtually no differences in tolerances between melanized and nonmelanized cells, but when differences occurred they were smaller than those previously observed with UVC. In tests with two strains of C. laurentii, there was no difference in tolerance to UVB radiation between melanized and nonmelanized cells during 8 days of culture; and in tests with four strains for less culture time (4 days) there were no significant differences in tolerance between melanized and nonmelanized cells of any strain of this species.

Canonical Bose gas simulations with stochastic gauges

A technique to simulate the grand canonical ensembles of interacting Bose gases is presented. Results are generated for many temperatures by averaging over energy-weighted stochastic paths, each corresponding to a solution of coupled Gross-Pitaevskii equations with phase noise. The stochastic gauge method used relies on an off-diagonal coherent-state expansion, thus taking into account all quantum correlations. As an example, the second-order spatial correlation function and momentum distribution for an interacting 1D Bose gas are calculated.

Thermally developing Brinkman–Brinkman forced convection in rectangular ducts with isothermal walls

The Extended Weighted Residuals Method (EWRM) is applied to investigate the effects of viscous dissipation on the thermal development of forced convection in a porous-saturated duct of rectangular cross-section with isothermal boundary condition. The Brinkman flow model is employed for determination of the velocity field. The temperature in the flow field was computed by utilizing the Green’s function solution based on the EWRM. Following the computation of the temperature field, expressions are presented for the local Nusselt number and the bulk temperature as a function of the dimensionless longitudinal coordinate. In addition to the aspect ratio, the other parameters included in this computation are the Darcy number, viscosity ratio, and the Brinkman number.

Analysis of heat transfer and entropy generation for a thermally developing Brinkman–Brinkman forced convection problem in a rectangular duct with isoflux walls

Heat transfer and entropy generation analysis of the thermally developing forced convection in a porous-saturated duct of rectangular cross-section, with walls maintained at a constant and uniform heat flux, is investigated based on the Brinkman flow model. The classical Galerkin method is used to obtain the fully developed velocity distribution. To solve the thermal energy equation, with the effects of viscous dissipation being included, the Extended Weighted Residuals Method (EWRM) is applied. The local (three dimensional) temperature field is solved by utilizing the Green’s function solution based on the EWRM where symbolic algebra is being used for convenience in presentation. Following the computation of the temperature field, expressions are presented for the local Nusselt number and the bulk temperature as a function of the dimensionless longitudinal coordinate, the aspect ratio, the Darcy number, the viscosity ratio, and the Brinkman number. With the velocity and temperature field being determined, the Second Law (of Thermodynamics) aspect of the problem is also investigated. Approximate closed form solutions are also presented for two limiting cases of MDa values. It is observed that decreasing the aspect ratio and MDa values increases the entropy generation rate.

Theory manual to OctVCE – a cartesian cell CFD code with special application to blast wave problems, Department of Mechanical Engineering Report 2007/12

OctVCE is a cartesian cell CFD code produced especially for numerical simulations of shock and blast wave interactions with complex geometries, in particular, from explosions. Virtual Cell Embedding (VCE) was chosen as its cartesian cell kernel for its simplicity and sufficiency for practical engineering design problems. The code uses a finite-volume formulation of the unsteady Euler equations with a second order explicit Runge-Kutta Godonov (MUSCL) scheme. Gradients are calculated using a least-squares method with a minmod limiter. Flux solvers used are AUSM, AUSMDV and EFM. No fluid-structure coupling or chemical reactions are allowed, but gas models can be perfect gas and JWL or JWLB for the explosive products. This report also describes the code’s ‘octree’ mesh adaptive capability and point-inclusion query procedures for the VCE geometry engine. Finally, some space will also be devoted to describing code parallelization using the shared-memory OpenMP paradigm. The user manual to the code is to be found in the companion report 2007/13.

Interference in hyperbolic space

The interference in a phase space algorithm of Schleich and Wheeler [Nature 326, 574 (1987)] is extended to the hyperbolic space underlying the group SU(1,1). The extension involves introducing the notion of weighted areas. Analytic expressions for the asymptotic forms for overlaps between the eigenstates of the generators of su(1,1) thus obtained are found to be in excellent agreement with the numerical results.[S1050-2947(98)08602-8].

Truncation errors in finite difference models for solute transport equation with first-order reaction

The truncation errors associated with finite difference solutions of the advection-dispersion equation with first-order reaction are formulated from a Taylor analysis. The error expressions are based on a general form of the corresponding difference equation and a temporally and spatially weighted parametric approach is used for differentiating among the various finite difference schemes. The numerical truncation errors are defined using Peclet and Courant numbers and a new Sink/Source dimensionless number. It is shown that all of the finite difference schemes suffer from truncation errors. Tn particular it is shown that the Crank-Nicolson approximation scheme does not have second order accuracy for this case. The effects of these truncation errors on the solution of an advection-dispersion equation with a first order reaction term are demonstrated by comparison with an analytical solution. The results show that these errors are not negligible and that correcting the finite difference scheme for them results in a more accurate solution. (C) 1999 Elsevier Science B.V. All rights reserved.

A reproducible method for automated extraction of brain volumes from 3D human head MR images

An automated method for extracting brain volumes from three commonly acquired three-dimensional (3D) MR images (proton density, T1 weighted, and T2-weighted) of the human head is described. The procedure is divided into four levels: preprocessing, segmentation, scalp removal, and postprocessing. A user-provided reference point is the sole operator-dependent input required, The method's parameters were first optimized and then fixed and applied to 30 repeat data sets from 15 normal older adult subjects to investigate its reproducibility. Percent differences between total brain volumes (TBVs) for the subjects' repeated data sets ranged from .5% to 2.2%. We conclude that the method is both robust and reproducible and has the potential for wide application.

Programming internet based DAI applications in Qu-Prolog

This paper presents the unique collection of additional features of Qu-Prolog, a variant of the Al programming language Prolog, and illustrates how they can be used for implementing DAI applications. By this we mean applications comprising communicating information servers, expert systems, or agents, with sophisticated reasoning capabilities and internal concurrency. Such an application exploits the key features of Qu-Prolog: support for the programming of sound non-clausal inference systems, multi-threading, and high level inter-thread message communication between Qu-Prolog query threads anywhere on the internet. The inter-thread communication uses email style symbolic names for threads, allowing easy construction of distributed applications using public names for threads. How threads react to received messages is specified by a disjunction of reaction rules which the thread periodically executes. A communications API allows smooth integration of components written in C, which to Qu-Prolog, look like remote query threads.

The burden of mental disorders: a comparison of methods between the Australian burden of disease studies and the Global Burden of Disease study

The national and Victorian burden of disease studies in Australia set out to examine critically the methods used in the Global Burden of Disease study to estimate the burden of mental disorders. The main differences include the use of a different set of disability weights allowing estimates in greater detail by level of severity, adjustments for comorbidity between mental disorders, a greater number of menta I disorders measured, and model ling of substance use disorders, anxiety disorders and bipolar disorder as chronic conditions. Uniform age-weighting in the Australian studies produces considerably lower estimates of the burden due to mental disorders in comparison with age-weighted disability-adjusted life years. A lack of follow-up data on people with mental disorders who are identified in cross-sectional surveys poses the greatest challenge in determining the burden of mental disorders more accurately.